結果
問題 |
No.1149 色塗りゲーム
|
ユーザー |
![]() |
提出日時 | 2020-08-09 01:41:06 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 165 ms / 2,000 ms |
コード長 | 3,591 bytes |
コンパイル時間 | 2,348 ms |
コンパイル使用メモリ | 201,952 KB |
最終ジャッジ日時 | 2025-01-12 19:15:10 |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 50 |
コンパイルメッセージ
main.cpp: In lambda function: main.cpp:114:5: warning: control reaches end of non-void function [-Wreturn-type] 114 | }; | ^
ソースコード
#include <bits/stdc++.h> using namespace std; typedef unsigned long long ull; typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef vector<ll> vl; typedef vector<vector<ll>> vvl; //typedef vector<vector<ll>> Graph; const ll mod = 1e9 + 7; //const ll mod = 998244353; #define REP(i,n) for(ll i=0;i<(ll)n;i++) #define dump(x) cerr << #x << " = " << (x) << endl; #define spa << " " << #define fi first #define se second template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; } template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; } template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){ os << "(" << v.first << ", " << v.second << ")"; return os; } template<class T> ostream& operator << (ostream& os, const vector<T> v){ for(int i = 0; i < (int)v.size(); i++){if(i > 0){os << " ";} os << v[i];} return os; } template<class T> ostream& operator << (ostream& os, const vector<vector<T>> v){ for(int i = 0; i < (int)v.size(); i++){if(i > 0){os << endl;} os << v[i];} return os; } template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++) {cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<endl;}}; template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0]; for(ll i=1;i<n;i++)cerr spa v[i]; cerr<<endl;}; int main(){ cin.tie(0); ios::sync_with_stdio(false); ll N; cin >> N; vl grundy(N+1, 0); grundy[1] = 1; for(int n=2;n<=N;n++){ vl cand; REP(j, n){ ll left = j; ll right = n-1-j; cand.push_back(grundy[left]^grundy[right]); } REP(j, n-1){ ll left = j; ll right = n-2-j; cand.push_back(grundy[left]^grundy[right]); } sort(cand.begin(), cand.end()); cand.erase(unique(cand.begin(), cand.end()), cand.end()); bool done = false; REP(i, cand.size()){ if(cand[i] != i){ grundy[n] = i; done = true; break; } } if(!done) grundy[n] = cand.size(); } vl state(N, 0); auto calc_grundy = [&](vl &now){ ll res = 0; REP(i, N){ ll j = i; while(j<N and now[i]==now[j]) j++; if(now[i]==0) res ^= (grundy[j-i]); i = j-1; } return res; }; auto best_action = [&](vl &now){ pll res; REP(i, N){ if(!now[i]){ now[i] = 1; ll g = calc_grundy(now); if(g==0){ res.first = i; res.second = 1; return res; } now[i] = 0; } } REP(i, N-1){ if(!now[i] and !now[i+1]){ now[i] = 1; now[i+1] = 1; ll g = calc_grundy(now); if(g==0){ res.first = i; res.second = 2; return res; } now[i] = 0; now[i+1] = 0; } } }; while(1){ auto act = best_action(state); cout << act.second spa act.first+1 << endl; ll t; cin >> t; if(t==0 or t==1) return 0; ll k, x; cin >> k >> x; x--; if(t==2) return 0; REP(i, k) state[x+i] = 1; } //cout << grundy << endl; return 0; }