結果
問題 | No.2521 Don't be Same |
ユーザー |
👑 ![]() |
提出日時 | 2023-10-27 21:43:36 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 183 ms / 2,000 ms |
コード長 | 2,961 bytes |
コンパイル時間 | 2,189 ms |
コンパイル使用メモリ | 197,764 KB |
最終ジャッジ日時 | 2025-02-17 14:47:44 |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 27 |
ソースコード
#include <bits/stdc++.h>#pragma GCC optimize("Ofast")#pragma GCC optimize("unroll-loops")using namespace std;using std::cout;using std::cin;using std::endl;using ll=long long;using ld=long double;const ll ILL=2167167167167167167;const int INF=2100000000;const int mod=998244353;#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)#define all(p) p.begin(),p.end()template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}template<class T> void vec_out(vector<T> &p,int ty=0){if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}template<class T> T vec_sum(vector<T> &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;}int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}void solve();// oddloopint main() {ios::sync_with_stdio(false);cin.tie(nullptr);int t=1;//cin>>t;rep(i,0,t) solve();}void solve(){int X,Y;cin>>X>>Y;auto op=[&]() -> void {if(X==0){cout<<"A 2 "<<Y<<endl;Y=0;}else if(Y==0){cout<<"A 1 "<<X<<endl;X=0;}else if(X==Y){cout<<"B"<<endl;Y=0;X=0;}else if(X<Y){if(X%2==0) cout<<"A 2 "<<Y-X+1<<endl,Y=X-1;else cout<<"A 2 "<<Y-X-1<<endl,Y=X+1;}else{if(Y%2==0) cout<<"A 1 "<<X-Y+1<<endl,X=Y-1;else cout<<"A 1 "<<X-Y-1<<endl,X=Y+1;}};auto rec=[&]() -> void {char c;cin>>c;if(c=='C'||c=='D'){exit(0);}if(c=='B'){X=0,Y=0;}if(c=='A'){int a,b;cin>>a>>b;a--;if(a) Y-=b;else X-=b;}};if(abs(X-Y)==1&&max(X,Y)%2==0){cout<<"Second"<<endl;}else{cout<<"First"<<endl;op();}while(true){rec();op();}}