結果
問題 | No.2432 Flip and Move |
ユーザー |
|
提出日時 | 2023-08-18 22:44:14 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,753 ms / 2,000 ms |
コード長 | 2,906 bytes |
コンパイル時間 | 4,549 ms |
コンパイル使用メモリ | 261,932 KB |
最終ジャッジ日時 | 2025-02-16 10:28:31 |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 36 |
ソースコード
#include<bits/stdc++.h>#include<atcoder/all>using namespace std;using namespace atcoder;typedef long long int ll;typedef long double ld;typedef vector<ll> vi;typedef vector<vi> vvi;typedef vector<vvi> vvvi;typedef vector<vvvi> vvvvi;typedef pair<ll,ll> pi;typedef pair<ll,pi> ppi;typedef pair<ll,ppi> pppi;typedef pair<ll,pppi> ppppi;#define FOR(i,l,r) for(ll i=l;i<r;i++)#define REP(i,n) FOR(i,0,n)#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)#define RREP(i,n) RFOR(i,0,n)#define ALL(x) x.begin(),x.end()#define F first#define S second#define BS(A,x) binary_search(ALL(A),x)#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())#define COU(A,x) (UB(A,x)-LB(A,x))#define sz(c) ((ll)(c).size())/*#include<boost/multiprecision/cpp_int.hpp>namespace mp=boost::multiprecision;using Bint=mp::cpp_int;*/template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;}template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}//*using mint=modint998244353;const ll mod=998244353;const ld EPS=1e-8;//*//*using mint=modint1000000007;const ll mod=1000000007;//*///using mint=modint;//*typedef vector<mint> vm;typedef vector<vm> vvm;typedef vector<vvm> vvvm;typedef vector<vvvm> vvvvm;ostream&operator<<(ostream&os,mint&a){os<<a.val();return os;}//*/int main(){ll H,W,K;cin>>H>>W>>K;vvvvi D(H,vvvi(W,vvi(2,vi(2,-1))));ll x=0,y=0,r=0,d=0,c=0;while(D[y][x][r][d]==-1){D[y][x][r][d]=c++;if(d){if(y==0)d=!d;else y--;}else{if(y==H-1)d=!d;else y++;}if(r){if(x==0)r=!r;else x--;}else{if(x==W-1)r=!r;else x++;}}if(K>D[y][x][r][d]){K-=D[y][x][r][d];ll k=c-D[y][x][r][d];K%=k;K+=D[y][x][r][d];}vector<vector<bool>>DP(H,vector<bool>(W));REP(i,H)REP(j,W)REP(r,2)REP(d,2)if(D[i][j][r][d]!=-1&&D[i][j][r][d]<K)DP[i][j]=!DP[i][j];vector<string>ans(H,(string(W,'.')));//REP(i,H)REP(j,W)if(DP[i][j])ans[i][j]='#';x=y=r=d=0;REP(_,K){ans[y][x]^=('#')^('.');if(d){if(y==0)d=!d;else y--;}else{if(y==H-1)d=!d;else y++;}if(r){if(x==0)r=!r;else x--;}else{if(x==W-1)r=!r;else x++;}}REP(i,H)cout<<ans[i]<<endl;return 0;}