QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #173413 | #7178. Bishops | ucup-team1469# | TL | 1ms | 3532kb | C++17 | 16.6kb | 2023-09-09 23:31:36 | 2023-09-09 23:31:37 |
Judging History
answer
#include <bits/stdc++.h>
#if __has_include(<atcoder/all>)
#include <atcoder/all>
#endif
using namespace std;
using ll = long long;
using ull = unsigned long long int;
using i128 = __int128_t;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using ld = long double;
template <typename T> using vc = vector<T>;
template <typename T> using vvc = vector<vc<T>>;
template <typename T> using vvvc = vector<vvc<T>>;
using vi = vc<int>;
using vl = vc<ll>;
using vpi = vc<pii>;
using vpl = vc<pll>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
#define overload5(a, b, c, d, e, name, ...) name
#define overload4(a, b, c, d, name, ...) name
#define REP0(n) for(ll jidlsjf = 0; jidlsjf < n; ++jidlsjf)
#define REP1(i, n) for(ll i = 0; i < (n); ++i)
#define REP2(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP3(i, a, b, c) for(ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)
#define per0(n) for(int jidlsjf = 0; jidlsjf < (n); ++jidlsjf)
#define per1(i, n) for(ll i = (n)-1; i >= 0; --i)
#define per2(i, a, b) for(ll i = (a)-1; i >= b; --i)
#define per3(i, a, b, c) for(ll i = (a)-1; i >= (b); i -= (c))
#define per(...) overload4(__VA_ARGS__, per3, per2, per1, per0)(__VA_ARGS__)
#define fore0(a) rep(a.size())
#define fore1(i, a) for(auto &&i : a)
#define fore2(a, b, v) for(auto &&[a, b] : v)
#define fore3(a, b, c, v) for(auto &&[a, b, c] : v)
#define fore4(a, b, c, d, v) for(auto &&[a, b, c, d] : v)
#define fore(...) overload5(__VA_ARGS__, fore4, fore3, fore2, fore1, fore0)(__VA_ARGS__)
#define perm(v) for(bool permrepflag = true; (permrepflag ? exchange(permrepflag, false) : next_permutation(all(v)));)
#define fi first
#define se second
#define pb push_back
#define ppb pop_back
#define ppf pop_front
#define eb emplace_back
#define drop(s) cout << #s << endl, exit(0)
#define si(c) (int)(c).size()
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define lbg(c, x) distance((c).begin(), lower_bound(all(c), (x), greater{}))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define ubg(c, x) distance((c).begin(), upper_bound(all(c), (x), greater{}))
#define rng(v, l, r) v.begin() + (l), v.begin() + (r)
#define all(c) begin(c), end(c)
#define rall(c) rbegin(c), rend(c)
#define SORT(v) sort(all(v))
#define RSORT(v) sort(rall(v))
#define REV(v) reverse(all(v))
#define UNIQUE(x) SORT(x), x.erase(unique(all(x)), x.end())
template <typename T = ll, typename S> T SUM(const S &v) { return accumulate(all(v), T(0)); }
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define INT(...) \
int __VA_ARGS__; \
IN(__VA_ARGS__)
#define INTd(...) \
int __VA_ARGS__; \
IN2(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
IN(__VA_ARGS__)
#define LLd(...) \
ll __VA_ARGS__; \
IN2(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
IN(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
IN(__VA_ARGS__)
#define LD(...) \
ld __VA_ARGS__; \
IN(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
IN(name)
#define VECd(type, name, size) \
vector<type> name(size); \
IN2(name)
#define VEC2(type, name1, name2, size) \
vector<type> name1(size), name2(size); \
for(int i = 0; i < size; i++) IN(name1[i], name2[i])
#define VEC2d(type, name1, name2, size) \
vector<type> name1(size), name2(size); \
for(int i = 0; i < size; i++) IN2(name1[i], name2[i])
#define VEC3(type, name1, name2, name3, size) \
vector<type> name1(size), name2(size), name3(size); \
for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i])
#define VEC3d(type, name1, name2, name3, size) \
vector<type> name1(size), name2(size), name3(size); \
for(int i = 0; i < size; i++) IN2(name1[i], name2[i], name3[i])
#define VEC4(type, name1, name2, name3, name4, size) \
vector<type> name1(size), name2(size), name3(size), name4(size); \
for(int i = 0; i < size; i++) IN(name1[i], name2[i], name3[i], name4[i]);
#define VEC4d(type, name1, name2, name3, name4, size) \
vector<type> name1(size), name2(size), name3(size), name4(size); \
for(int i = 0; i < size; i++) IN2(name1[i], name2[i], name3[i], name4[i]);
#define VV(type, name, h, w) \
vector<vector<type>> name(h, vector<type>(w)); \
IN(name)
#define VVd(type, name, h, w) \
vector<vector<type>> name(h, vector<type>(w)); \
IN2(name)
int scan() { return getchar(); }
void scan(int &a) { cin >> a; }
void scan(long long &a) { cin >> a; }
void scan(char &a) { cin >> a; }
void scan(ld &a) { cin >> a; }
void scan(string &a) { cin >> a; }
template <class T, class S> void scan(pair<T, S> &p) { scan(p.first), scan(p.second); }
template <class T> void scan(vector<T> &);
template <class T> void scan(vector<T> &a) {
for(auto &i : a) scan(i);
}
template <class T> void scan(T &a) { cin >> a; }
void IN() {}
void IN2() {}
template <class Head, class... Tail> void IN(Head &head, Tail &...tail) {
scan(head);
IN(tail...);
}
template <class Head, class... Tail> void IN2(Head &head, Tail &...tail) {
scan(head);
--head;
IN2(tail...);
}
template<class T> void prt_(T a){ cout<<a; }
template<class T,class U> void prt_(pair<T,U> a){ cout<<"{"<<a.fi<<", "<<a.se<<"}"; }
void prt_(ld a){ printf("%.15Lf",a); }
template<class T> void prt(vc<T> a){
for(size_t i=0;i<a.size();++i){
prt_(a[i]);
cout<<" \n"[i==a.size()-1];
}
}
template<class T> void prt(vvc<T> a){
for(auto& v:a){
for(size_t i=0;i<v.size();++i){
prt_(v[i]);
cout<<" \n"[i==v.size()-1];
}
}
}
template<class T> void prt(T a){ prt_(a),cout<<"\n"; }
template<class T,class... Args> void prt(T a,Args... args){ prt_(a),cout<<" ",prt(args...); }
template<class Head,class... Tail> struct multi_dim_vector{ using type=vc<typename multi_dim_vector<Tail...>::type>; };
template<class T> struct multi_dim_vector<T>{ using type=T; };
template<class T,class Arg> vc<T> mvec(int n,Arg&& arg){ return vc<T>(n,arg); }
template<class T,class... Args> class multi_dim_vector<Args...,T>::type mvec(int n,Args&&... args){
return typename multi_dim_vector<Args...,T>::type(n,mvec<T>(args...));
}
template<class T> T REVed(T a){
reverse(a.begin(),a.end());
return a;
}
template<class T> T SORTed(T a){
sort(a.begin(),a.end());
return a;
}
template<class T> T RSORTed(T a){
sort(a.rbegin(),a.rend());
return a;
}
vi iota(int n){
vi res(n);
iota(res.begin(),res.end(),0);
return res;
}
template <class T> bool chmax(T &a, T b){ return (a < b ? a = b, 1 : 0); }
template <class T> bool chmin(T &a, T b){ return (a > b ? a = b, 1 : 0); }
template<class T> auto runLength(T a) -> vc<pair<typename decltype(a)::value_type,ll>>{
int n=a.size();
vc<pair<typename decltype(a)::value_type,ll>> res;
if(n==0){ return res; }
typename decltype(a)::value_type now=a[0];
ll l=1;
rep(i,1,n){
if(a[i-1]==a[i]){ l++; }
else{
res.pb(now,l);
now=a[i],l=1;
}
}
res.pb(now,l);
return res;
}
template<int mod> struct mymodint{
ll x;
static constexpr ll get_mod(){ return mod; }
ll val(){ return x; }
mymodint(ll x_=0):x((x_%mod+mod)%mod){}
mymodint operator-(){ return (x==0)?0:mod-x; }
mymodint operator+(mymodint rhs){ return mymodint(*this)+=rhs; }
mymodint operator-(mymodint rhs){ return mymodint(*this)-=rhs; }
mymodint operator*(mymodint rhs){ return mymodint(*this)*=rhs; }
mymodint operator/(mymodint rhs){ return mymodint(*this)/=rhs; }
mymodint pow(ll rhs){
mymodint res=1,now=(*this);
while(rhs){
res*=((rhs&1)?now:1),now*=now,rhs>>=1;
}
return res;
}
mymodint& operator+=(mymodint rhs){
x+=rhs.x,x-=((x>=mod)?mod:0);
return (*this);
}
mymodint& operator-=(mymodint rhs){
x-=rhs.x;
x+=((x<0)?mod:0);
return (*this);
}
mymodint& operator*=(mymodint rhs){
x=x*rhs.x%mod;
return (*this);
}
mymodint& operator/=(mymodint rhs){ return (*this)*=rhs.pow(mod-2); }
bool operator==(mymodint rhs){ return x==rhs.x; }
bool operator!=(mymodint rhs){ return x!=rhs.x; }
};
template<int mod> using modint=
#if __has_include(<atcoder/all>)
atcoder::static_modint<mod>;
#else
mymodint<mod>;
#endif
template<int mod> std::ostream& operator<<(std::ostream& os,modint<mod> x){
return os<<(x.val());
}
template<int mod> std::istream& operator>>(std::istream& is,modint<mod>& x){
ll t;
is>>t,x=t;
return is;
}
template<class T> struct cmb{
vc<T> fac,ifac;
cmb(int mx=3000000):fac(mx+1,1),ifac(mx+1,1){
for(int i=1;i<=mx;++i){ fac[i]=fac[i-1]*i; }
ifac[mx]/=fac[mx];
for(int i=mx;i>0;--i){ ifac[i-1]=ifac[i]*i; }
}
T operator()(ll n,ll k){
if(n<0||k<0||n<k){ return 0; }
return fac[n]*ifac[k]*ifac[n-k];
}
T f(ll n){
return n<0?T(0):fac[n];
}
T fi(ll n){
return n<0?T(0):ifac[n];
}
};
struct dsu {
public:
dsu() : _n(0) {}
explicit dsu(int n) : _n(n), parent_or_size(n, -1) {}
int merge(int a, int b) {
assert(0 <= a && a < _n);
assert(0 <= b && b < _n);
int x = leader(a), y = leader(b);
if (x == y) return x;
if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);
parent_or_size[x] += parent_or_size[y];
parent_or_size[y] = x;
return x;
}
bool same(int a, int b) {
assert(0 <= a && a < _n);
assert(0 <= b && b < _n);
return leader(a) == leader(b);
}
int leader(int a) {
assert(0 <= a && a < _n);
if (parent_or_size[a] < 0) return a;
return parent_or_size[a] = leader(parent_or_size[a]);
}
int size(int a) {
assert(0 <= a && a < _n);
return -parent_or_size[leader(a)];
}
std::vector<std::vector<int>> groups() {
std::vector<int> leader_buf(_n), group_size(_n);
for (int i = 0; i < _n; i++) {
leader_buf[i] = leader(i);
group_size[leader_buf[i]]++;
}
std::vector<std::vector<int>> result(_n);
for (int i = 0; i < _n; i++) {
result[i].reserve(group_size[i]);
}
for (int i = 0; i < _n; i++) {
result[leader_buf[i]].push_back(i);
}
result.erase(
std::remove_if(result.begin(), result.end(),
[&](const std::vector<int>& v) { return v.empty(); }),
result.end());
return result;
}
private:
int _n;
// root node: -1 * component size
// otherwise: parent
std::vector<int> parent_or_size;
};
int main(){
using fp=modint<998244353>;
INT(n,m);
if(n==1){
cout<<m<<endl;
for(int i=0;i<m;++i){ cout<<1<<" "<<i+1<<endl; }
return 0;
}
if(m==1){
cout<<n<<endl;
for(int i=0;i<n;++i){ cout<<i+1<<" "<<1<<endl; }
return 0;
}
vvc<pii> G(n+m-1),W(n+m-1);
for(int j=0;j<=m-1;++j){
G[m-1-j].pb({0,j});
W[j].pb({0,j});
G[n-1+m-1-j].pb({n-1,j});
W[n-1+j].pb({n-1,j});
}
for(int i=1;i<=n-2;++i){
G[m-1+i].pb({i,0});
W[i].pb({i,0});
G[i].pb({i,m-1});
W[i+m-1].pb({i,m-1});
}
map<pii,vc<pii>> jump;
for(auto v:G){
if(si(v)!=2){ continue; }
jump[v[0]].pb(v[1]);
jump[v[1]].pb(v[0]);
}
for(auto v:W){
if(si(v)!=2){ continue; }
jump[v[0]].pb(v[1]);
jump[v[1]].pb(v[0]);
}
map<pii,int> seen;
vpi ans;
rep(t,4){
pii v={t%2*(n-1),t/2*(m-1)};
if(seen[v]){ continue; }
ans.pb(v);
seen[v]=1;
auto c=jump[v][0],prv=v;
seen[c]=1;
bool g=0;
while(c!=v){
if(g){ ans.pb(c); }
if(si(jump[c])==1){
c=jump[c][0];
seen[c]=1;
break;
}
if(jump[c][0]==prv){ swap(jump[c][0],jump[c][1]); }
prv=c;
c=jump[c][0];
seen[c]=1;
g^=1;
}
}
for(auto [v,w]:jump){
if(seen[v]){ continue; }
ans.pb(v);
seen[v]=1;
auto c=jump[v][0],prv=v;
seen[c]=1;
bool g=0;
while(c!=v){
if(g){ ans.pb(c); }
if(jump[c][0]==prv){ swap(jump[c][0],jump[c][1]); }
prv=c;
c=jump[c][0];
seen[c]=1;
g^=1;
}
}
cout<<si(ans)<<endl;
for(auto v:ans){
cout<<v.fi+1<<" "<<v.se+1<<endl;
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3532kb
input:
2 5
output:
6 1 1 1 3 1 5 2 1 2 3 2 5
result:
ok n: 2, m: 5, bishops: 6
Test #2:
score: 0
Accepted
time: 1ms
memory: 3500kb
input:
5 5
output:
8 1 1 5 1 1 2 5 4 1 3 5 3 1 4 5 2
result:
ok n: 5, m: 5, bishops: 8
Test #3:
score: -100
Time Limit Exceeded
input:
100000 100000
output:
199998 1 1 100000 1 1 2 100000 99999 1 3 100000 99998 1 4 100000 99997 1 5 100000 99996 1 6 100000 99995 1 7 100000 99994 1 8 100000 99993 1 9 100000 99992 1 10 100000 99991 1 11 100000 99990 1 12 100000 99989 1 13 100000 99988 1 14 100000 99987 1 15 100000 99986 1 16 100000 99985 1 17 100000 99984 ...