結果

問題 No.2432 Flip and Move
ユーザー akuaakua
提出日時 2023-08-20 21:23:39
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,659 ms / 2,000 ms
コード長 6,105 bytes
コンパイル時間 3,988 ms
コンパイル使用メモリ 204,100 KB
実行使用メモリ 339,420 KB
最終ジャッジ日時 2024-12-14 03:52:51
合計ジャッジ時間 27,235 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,816 KB
testcase_02 AC 591 ms
339,420 KB
testcase_03 AC 1,659 ms
303,520 KB
testcase_04 AC 293 ms
155,776 KB
testcase_05 AC 291 ms
155,776 KB
testcase_06 AC 226 ms
129,408 KB
testcase_07 AC 1,076 ms
221,516 KB
testcase_08 AC 1,199 ms
234,960 KB
testcase_09 AC 1,579 ms
295,404 KB
testcase_10 AC 373 ms
216,240 KB
testcase_11 AC 426 ms
246,536 KB
testcase_12 AC 325 ms
217,412 KB
testcase_13 AC 314 ms
180,556 KB
testcase_14 AC 372 ms
72,512 KB
testcase_15 AC 1,348 ms
263,044 KB
testcase_16 AC 380 ms
97,016 KB
testcase_17 AC 930 ms
200,988 KB
testcase_18 AC 223 ms
57,364 KB
testcase_19 AC 655 ms
171,708 KB
testcase_20 AC 991 ms
216,316 KB
testcase_21 AC 677 ms
170,560 KB
testcase_22 AC 704 ms
184,872 KB
testcase_23 AC 176 ms
49,360 KB
testcase_24 AC 850 ms
196,656 KB
testcase_25 AC 649 ms
163,040 KB
testcase_26 AC 475 ms
151,676 KB
testcase_27 AC 25 ms
13,700 KB
testcase_28 AC 12 ms
8,564 KB
testcase_29 AC 699 ms
166,536 KB
testcase_30 AC 943 ms
206,752 KB
testcase_31 AC 467 ms
146,952 KB
testcase_32 AC 41 ms
18,128 KB
testcase_33 AC 902 ms
203,216 KB
testcase_34 AC 460 ms
105,808 KB
testcase_35 AC 316 ms
115,396 KB
testcase_36 AC 2 ms
6,820 KB
testcase_37 AC 2 ms
6,820 KB
testcase_38 AC 2 ms
6,820 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<atcoder/all>
#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque #include <unordered_map> // unordered_map #include <unordered_set> // unordered_set #include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <math.h>
#include <iomanip>
#include <functional>
#include<unordered_map>
#include <random>
using namespace std;  
using namespace atcoder;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)
//#define endl '\n'
#define all(x) (x).begin(),(x).end()
#define arr(x) (x).rbegin(),(x).rend()
typedef long long ll;
typedef unsigned long long ull;
const ll inf=1e18;  
//const int inf=1e7;  
using graph = vector<vector<int> > ;
using P= pair<ll,ll>;  
using vi=vector<int>;
using vvi=vector<vi>;
using vll=vector<ll>; 
using vvll=vector<vll>;
using vp=vector<P>;
using vvp=vector<vp>;
using vd=vector<double>;
using vvd =vector<vd>;
//string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
//string S="abcdefghijklmnopqrstuvwxyz";
//g++ main.cpp -std=c++17 -I .  
//cout <<setprecision(20);
//cout << fixed << setprecision(10);
//cin.tie(0); ios::sync_with_stdio(false);

const double PI = acos(-1);
int vx[]={0,1,0,-1,-1,1,1,-1},vy[]={1,0,-1,0,1,1,-1,-1};
void putsYes(bool f){cout << (f?"Yes":"No") << endl;}
void putsYES(bool f){cout << (f?"YES":"NO") << endl;}
void putsFirst(bool f){cout << (f?"First":"Second") << endl;}
void debug(int test){cout << "TEST" << " " << test << endl;}
ll pow_pow(ll x,ll n,ll mod){
    if(n==0) return 1; 
    x%=mod;
    ll res=pow_pow(x*x%mod,n/2,mod);
    if(n&1)res=res*x%mod;
    return res;
}
ll gcdll(ll x,ll y){
    if(y==0)return x;
    return gcdll(y,x%y);
}
//ll INFF=1000100100100100100;
ll lcmll(ll x,ll y){
    ll X=(x/gcdll(x,y)),Y=y;
    return X*Y;
}
template<class T> bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    else return false;
}
template<class T> bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    else return false;
}
struct edge{
  int to; ll cost;int dir;
  edge(int to,ll cost,int dir) : to(to),cost(cost),dir(dir){}
};
using ve=vector<edge>;
using vve=vector<ve>;
using mint = modint998244353;
using vm=vector<mint>;
using vvm=vector<vm>;
const int mod = 998244353;
//int mod = 1e9+7;
constexpr ll MAX = 33;
ll fact[MAX],finv[MAX],inv[MAX];
void initcomb(){
  fact[0]=fact[1]=1;
  finv[0]=finv[1]=1;
  inv[1]=1;
  for(int i=2;i<MAX;i++){
    fact[i]=fact[i-1]*i%mod;
    inv[i]=mod-inv[mod%i]*(mod/i)%mod;
    finv[i]=finv[i-1]*inv[i]%mod;
  }
}
ll comb(ll n,ll k){
  if(n<k) return 0;
  if(n<0||k<0) return 0;
  return fact[n]*(finv[k]*finv[n-k]%mod)%mod;
}
struct UnionFind { vector<int> par, siz; UnionFind(int n) : par(n, -1) , siz(n, 1) { } int root(int x) { if (par[x] == -1) return x;
        else return par[x] = root(par[x]);
    }
    bool issame(int x, int y) {
        return root(x) == root(y);
    }
    bool unite(int x, int y) {
        x = root(x), y = root(y);
        if (x == y) return false; 
        //if (siz[x] < siz[y]) swap(x, y);
        par[y] = x;
        siz[x] += siz[y];
        return true;
    }
    int size(int x) {
        return siz[root(x)];
    }
};
struct Compress{
   vll a;
   map<ll,ll> d,d2;
   int cnt;
   Compress() :cnt(0) {}
   void add(ll x){a.push_back(x);}
   void init(){
     set<ll>s(a.begin(),a.end());
     for(auto y:s)d[y]=cnt++;
     for(auto&y:a)y=d[y];
     for(auto u:d)d2[u.second]=u.first;
   }
   ll to(ll x){return d[x];} //変換先
   ll from(ll x){return d2[x];}//逆引き
   int size(){return cnt;}
};
vll anss;
using S=pair<P,P>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
void solve(int test){
  int h,w; cin >>  h >> w;
  ll k; cin >>  k;
  vector<S> vs;
  vs.push_back(S(P(-1,-1),P(-1,-1)));
  vvvvi seen(h,vvvi(w,vvi(2,vi(2))));
  S now=S(P(1,1),P(0,0));
  vvi ans(h,vi(w));
  string out=".#";
  for(ll i=1; i<=k; i++){
    if(seen[now.first.first-1][now.first.second-1][now.second.first][now.second.second]){
       int id=seen[now.first.first-1][now.first.second-1][now.second.first][now.second.second];
       for(int j=1; j<=id-1; j++){
         ans[vs[j].first.first-1][vs[j].first.second-1]^=1;
       }
       ll num=k-(id-1);
       ll base=num/(vs.size()-id);
       ll plus=num%(vs.size()-id);
       for(int j=id; j<vs.size(); j++){
         int now=base+((j-id+1)<=plus);
         if(now%2==0)continue;
         ans[vs[j].first.first-1][vs[j].first.second-1]^=1;
       }
       rep(i,h){
         rep(j,w)cout << out[ans[i][j]];
         cout << endl;
       }
       return;
    }
    vs.push_back(now);
    seen[now.first.first-1][now.first.second-1][now.second.first][now.second.second]=i;
    if(now.second.first==0){
      if(now.first.first<h)now.first.first++;
      else now.second.first=1;
    }
    else if(now.second.first==1){
      if(now.first.first>1)now.first.first--;
      else now.second.first=0;
    }
    if(now.second.second==0){
      if(now.first.second<w)now.first.second++;
      else now.second.second=1;
    }
    else if(now.second.second==1){
      if(now.first.second>1)now.first.second--;
      else now.second.second=0;
    }
  }
  for(int j=1; j<vs.size(); j++){
    ans[vs[j].first.first-1][vs[j].first.second-1]^=1;
  }
  rep(i,h){
    rep(j,w)cout << out[ans[i][j]];
    cout << endl;
  }
}
//g++ main.cpp -std=c++17 -I .
int main(){cin.tie(0);ios::sync_with_stdio(false);
 int t=1;//cin >>t;
 rep(test,t)solve(test);
 for(auto ans:anss)cout << ans << endl;
}
0