結果
| 問題 | No.153 石の山 |
| ユーザー |
 t98slider
|
| 提出日時 | 2021-08-06 02:27:06 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 5,087 bytes |
| コンパイル時間 | 2,189 ms |
| コンパイル使用メモリ | 191,200 KB |
| 実行使用メモリ | 4,356 KB |
| 最終ジャッジ日時 | 2023-10-14 21:44:06 |
| 合計ジャッジ時間 | 3,588 ms |
|
ジャッジサーバーID （参考情報） |
judge11 / judge12 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1 ms
4,352 KB |
| testcase_01 | AC | 1 ms
4,352 KB |
| testcase_02 | WA | - |
| testcase_03 | AC | 1 ms
4,348 KB |
| testcase_04 | AC | 2 ms
4,352 KB |
| testcase_05 | AC | 1 ms
4,348 KB |
| testcase_06 | AC | 2 ms
4,352 KB |
| testcase_07 | AC | 1 ms
4,348 KB |
| testcase_08 | AC | 1 ms
4,352 KB |
| testcase_09 | AC | 2 ms
4,356 KB |
| testcase_10 | AC | 1 ms
4,352 KB |
| testcase_11 | AC | 1 ms
4,348 KB |
| testcase_12 | AC | 1 ms
4,348 KB |
| testcase_13 | AC | 2 ms
4,352 KB |
| testcase_14 | AC | 1 ms
4,352 KB |
| testcase_15 | AC | 2 ms
4,352 KB |
| testcase_16 | WA | - |
| testcase_17 | AC | 1 ms
4,352 KB |
| testcase_18 | AC | 1 ms
4,348 KB |
| testcase_19 | WA | - |
| testcase_20 | WA | - |
| testcase_21 | AC | 1 ms
4,352 KB |
| testcase_22 | AC | 1 ms
4,348 KB |
| testcase_23 | AC | 1 ms
4,352 KB |
| testcase_24 | AC | 1 ms
4,352 KB |
| testcase_25 | AC | 2 ms
4,348 KB |
| testcase_26 | AC | 1 ms
4,352 KB |
| testcase_27 | WA | - |
| testcase_28 | AC | 2 ms
4,348 KB |
| testcase_29 | WA | - |
| testcase_30 | AC | 2 ms
4,352 KB |
ソースコード
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)printf("yes\n");else printf("no\n")
#define Yes(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YES(ans) if(ans)printf("YES\n");else printf("NO\n")
#define popcount(v) __builtin_popcount(v)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
const int MOD2=998244353;
const int INF=1<<30;
const ll INF2=1LL<<60;
//入力系
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}
template<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
//出力系
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
//デバッグ系
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
ll updivide(ll a,ll b){return (a+b-1)/b;}
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}
vector<map<deque<int>,int>> dp(2);
int rec(int turn,deque<int>& dq){
int n=dq.size();
if(n==0)return turn;
sort(rall(dq));
if(dp[turn].count(dq))return dp[turn][dq];
rep(i,n){
int pre=dq.front();
dq.pop_front();
if(pre>=2){
if(pre%2==0){
dq.push_back(pre/2);
dq.push_back(pre/2);
if(rec(turn^1,dq)!=turn)return dp[turn][dq]=(turn^1);
dq.pop_back();
dq.pop_back();
}else{
dq.push_back(pre/2);
dq.push_back(pre/2+1);
if(rec(turn^1,dq)!=turn)return dp[turn][dq]=(turn^1);
dq.pop_back();
dq.pop_back();
}
}
if(pre>=3){
if(pre%3==0){
dq.push_back(pre/3),dq.push_back(pre/3),dq.push_back(pre/3);
if(rec(turn^1,dq)!=turn)return dp[turn][dq]=(turn^1);
dq.pop_back(),dq.pop_back(),dq.pop_back();
}
if(pre%3==1){
dq.push_back(pre/3),dq.push_back(pre/3),dq.push_back(pre/3+1);
if(rec(turn^1,dq)!=turn)return dp[turn][dq]=(turn^1);
dq.pop_back(),dq.pop_back(),dq.pop_back();
}
if(pre%3==2){
dq.push_back(pre/3),dq.push_back(pre/3+1),dq.push_back(pre/3+1);
if(rec(turn^1,dq)!=turn)return dp[turn][dq]=(turn^1);
dq.pop_back(),dq.pop_back(),dq.pop_back();
}
}
dq.push_back(pre);
}
return dp[turn][dq]=turn;
}
int main(){
int n;
cin>>n;
if(n==1){
out("B");
return 0;
}
if(n<=16){
deque<int> dq;
dq.push_back(n);
out(rec(0,dq)?'A':'B');
}else{
out('A');
return 0;
}
}