結果

問題 No.2432 Flip and Move
ユーザー mikammikam
提出日時 2023-08-18 23:00:13
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 426 ms / 2,000 ms
コード長 5,823 bytes
コンパイル時間 7,965 ms
コンパイル使用メモリ 405,728 KB
実行使用メモリ 104,832 KB
最終ジャッジ日時 2024-05-06 05:30:58
合計ジャッジ時間 15,736 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 127 ms
65,788 KB
testcase_03 AC 236 ms
104,832 KB
testcase_04 AC 35 ms
42,496 KB
testcase_05 AC 35 ms
42,496 KB
testcase_06 AC 50 ms
29,672 KB
testcase_07 AC 137 ms
69,172 KB
testcase_08 AC 127 ms
74,676 KB
testcase_09 AC 182 ms
101,096 KB
testcase_10 AC 85 ms
42,900 KB
testcase_11 AC 77 ms
48,628 KB
testcase_12 AC 80 ms
37,060 KB
testcase_13 AC 54 ms
40,020 KB
testcase_14 AC 57 ms
26,120 KB
testcase_15 AC 140 ms
86,828 KB
testcase_16 AC 136 ms
28,128 KB
testcase_17 AC 342 ms
57,304 KB
testcase_18 AC 53 ms
18,396 KB
testcase_19 AC 265 ms
45,004 KB
testcase_20 AC 383 ms
62,944 KB
testcase_21 AC 274 ms
44,360 KB
testcase_22 AC 426 ms
50,784 KB
testcase_23 AC 39 ms
15,064 KB
testcase_24 AC 386 ms
55,256 KB
testcase_25 AC 237 ms
41,480 KB
testcase_26 AC 141 ms
38,852 KB
testcase_27 AC 9 ms
5,880 KB
testcase_28 AC 5 ms
5,376 KB
testcase_29 AC 271 ms
43,160 KB
testcase_30 AC 392 ms
59,568 KB
testcase_31 AC 165 ms
37,000 KB
testcase_32 AC 21 ms
7,392 KB
testcase_33 AC 321 ms
58,176 KB
testcase_34 AC 124 ms
31,924 KB
testcase_35 AC 75 ms
30,876 KB
testcase_36 AC 2 ms
5,376 KB
testcase_37 AC 2 ms
5,376 KB
testcase_38 AC 1 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
using namespace std;
#include <boost/multiprecision/cpp_int.hpp>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i,a,b) for (int i = (int)(a); i < (int)(b); i++)
#define all(v) v.begin(),v.end()
#define inc(x,l,r) ((l)<=(x)&&(x)<(r)) 
#define Unique(x) sort(all(x)), x.erase(unique(all(x)), x.end())
#define pcnt __builtin_popcountll
typedef long long ll;
#define int ll
using ld = long double;
using vi = vector<int>;
using vs = vector<string>;
using P = pair<int,int>;
using vp = vector<P>;
using Bint = boost::multiprecision::cpp_int;
template<typename T1,typename T2> bool chmax(T1 &a, const T2 b) {if (a < b) {a = b; return true;} else return false; }
template<typename T1,typename T2> bool chmin(T1 &a, const T2 b) {if (a > b) {a = b; return true;} else return false; }
template<typename T> using priority_queue_greater = priority_queue<T, vector<T>, greater<T>>;
template<typename T1,typename T2> ostream &operator<< (ostream &os, const pair<T1,T2> &p){os << p.first <<" "<<p.second;return os;}
ostream &operator<< (ostream &os, const modint1000000007 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint1000000007 &m){ll in;is>>in;m=in;return is;}
ostream &operator<< (ostream &os, const modint998244353 &m){os << m.val();return os;}
istream &operator>> (istream &is, modint998244353 &m){ll in;is>>in;m=in;return is;}
template<typename T> istream &operator>>(istream& is,vector<T> &v){for(T &in:v)is>>in;return is;}
template<class... T> void input(T&... a){(cin>> ... >> a);}
#ifdef LOCAL
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){os<<"\x1b[32m";rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");os<<"\x1b[0m";return os;}
template<class T> int print(T& a){cout << "\x1b[32m"<< a<< '\n' << "\x1b[0m";return 0;}
template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << "\x1b[32m" << a;(cout<<...<<(cout<<' ',b));cout<<'\n' << "\x1b[0m";return 0;}
#else
template<typename T> ostream &operator<<(ostream &os,const vector<T> &v){rep(i,v.size())os<<v[i]<<(i+1!=v.size()?" ":"");return os;}
template<class T> int print(T& a){cout << a<< '\n';return 0;}
template<class T,class... Ts> int print(const T&a, const Ts&... b){cout << a;(cout<<...<<(cout<<' ',b));cout<<'\n';return 0;}
#endif
#define VI(v,n) vi v(n); input(v)
#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)
#define CHAR(...) char __VA_ARGS__; input(__VA_ARGS__)
int sign(ll x){return x>0?1:x<0?-1:0;}
ll ceil(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return (x+y-1)/y;return -((-x/y));}
ll floor(ll x,ll y){assert(y!=0);if(sign(x)==sign(y))return x/y;if(y<0)x*=-1,y*=-1;return x/y-(x%y<0);}
ll abs(ll x,ll y){return abs(x-y);}
ll bit(int n){return 1ll<<n;}
template<class T> bool ins(string s,T t){return s.find(t)!=string::npos;}
P operator+ (const P &p, const P &q){ return P{p.first+q.first,p.second+q.second};}
P operator- (const P &p, const P &q){ return P{p.first-q.first,p.second-q.second};}
int yesno(bool ok,string y="Yes",string n="No"){ cout<<(ok?y:n)<<endl;return 0;}
int YESNO(bool ok,string y="YES",string n="NO"){ cout<<(ok?y:n)<<endl;return 0;}
int di[]={-1,0,1,0,-1,-1,1,1};
int dj[]={0,1,0,-1,-1,1,-1,1};
const ll INF = 8e18;
//using mint = modint1000000007;
// using mint = modint998244353;
//mint stom(const string &s,int b=10){mint res = 0;for(auto c:s)res *= b,res += c-'0';return res;}
template<typename F>
pair<vi,vi> loopfind(F &&nxt,int s=0){
    int fast = s;
    int slow = s;
    while(1){
        fast = nxt(nxt(fast));
        slow = nxt(slow);
        if(fast == slow)break;
    }
    fast = s;
    while(1){
        fast = nxt(fast);
        slow = nxt(slow);
        if(fast == slow)break;
    }
    int loopstart = fast;
    vi tail;
    tail.push_back(s);
    int i = nxt(s);
    while(i!=loopstart){
        tail.push_back(i);
        i = nxt(i);
    }
    vi loop;
    loop.push_back(loopstart);
    i = nxt(loopstart);
    while(i!=loopstart){
        loop.push_back(i);
        i = nxt(i);
    }
 
    return {tail,loop};
}
signed main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    INT(h,w,k);
    using mint = modint;
    mint::set_mod(2);
    int n = h*w*4;
    vp dij = {{1,1},{1,-1},{-1,1},{-1,-1}};
    auto D = [](int di,int dj){
        if(di==1&&dj==1)return 0;
        if(di==1&&dj==-1)return 1;
        if(di==-1&&dj==1)return 2;
        if(di==-1&&dj==-1)return 3;
        assert(0);
    };
    auto f = [&](int i,int j,int d){
        return (i*w+j)+d*h*w;
    };
    vi a(n);
    rep(i,h)rep(j,w)rep(d,4){
        auto [di,dj] = dij[d];
        int ni = i+di;
        int nj = j+dj;
        if(!inc(ni,0,h))ni = i,di *= -1;
        if(!inc(nj,0,w))nj = j,dj *= -1;
        a[f(i,j,d)] = f(ni,nj,D(di,dj));
        // print(i,j,d,f(i,j,d),ni,nj,D(di,dj),f(ni,nj,D(di,dj)));
    }
    auto [tail,loop] = loopfind([&](int i){return a[i];});
    auto g = [&](int f){
        f %= h*w;
        return P{f/w,f%w};
    };
    vector res(h,vi(w));
    if(tail.size()){
        int tz = tail.size();
        int r = min(k,tz);
        rep(id,r){
            auto [i,j] = g(tail[id]);
            res[i][j] ^=1;
        }
        k -= r;
    }
    if(k){
        auto lz = loop.size();
        int l = k/lz;
        int r = k%lz;
        if(l&1)for(auto f:loop){
            auto [i,j] = g(f);
            res[i][j] ^= 1;
        }
        rep(id,r){
            auto [i,j] = g(loop[id]);
            res[i][j] ^= 1;
        }
    }
    rep(i,h){
        string s(w,'.');
        rep(j,w)if(res[i][j])s[j] = '#';
        print(s);
    }
    return 0;
}
0