結果
問題 | No.1219 Mancala Combo |
ユーザー | side |
提出日時 | 2020-09-04 21:43:56 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 6,147 bytes |
コンパイル時間 | 3,400 ms |
コンパイル使用メモリ | 204,688 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-11-26 12:23:29 |
合計ジャッジ時間 | 3,160 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,820 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 2 ms
6,820 KB |
testcase_03 | AC | 2 ms
6,816 KB |
testcase_04 | WA | - |
testcase_05 | AC | 2 ms
6,824 KB |
testcase_06 | WA | - |
testcase_07 | AC | 1 ms
6,816 KB |
testcase_08 | WA | - |
testcase_09 | AC | 1 ms
6,820 KB |
testcase_10 | WA | - |
testcase_11 | AC | 1 ms
6,820 KB |
testcase_12 | WA | - |
testcase_13 | AC | 1 ms
6,816 KB |
testcase_14 | AC | 1 ms
6,816 KB |
testcase_15 | AC | 2 ms
6,816 KB |
testcase_16 | WA | - |
testcase_17 | AC | 12 ms
6,816 KB |
testcase_18 | WA | - |
testcase_19 | AC | 12 ms
6,816 KB |
testcase_20 | WA | - |
testcase_21 | AC | 10 ms
6,816 KB |
testcase_22 | WA | - |
testcase_23 | AC | 15 ms
6,820 KB |
testcase_24 | WA | - |
testcase_25 | AC | 11 ms
6,820 KB |
testcase_26 | WA | - |
testcase_27 | AC | 16 ms
6,816 KB |
testcase_28 | WA | - |
ソースコード
/* vrrtll==???>;::::~~~~~~......`.`````````````````````...-?777!_.._?7u,~~~::::;>>??=lllttrrzu rtll==??>>;::::~~~~......`.`````````````````` ..J77!`````````...`..._T,~~~~:::;;>??==lttrrv tll=??>>;:::~~~~......``````````````````..J7^ ` `` ` `` .,```````...._4,.~~~::;;>>?===lttr l=???>;;::~~~......`````HTSu,.`` `..J7! ` `` .J"~N```````````..?&.~~~~::;;>>?==llt =??>;;::~~~~.....``````.@????7SJ.?= ` ` `` .J=....J; ``````````..h..~~~~::;;>??=ll ?>>;::~~~~.....````````.D?>>?>?>?8+.`` `.J"_......_b` ````````.S_.~~~~::;;>??=l >;;::~~~~....``````````.C>??>>>?>>>?8J.` ```..Y~..........J; ` ` ``````` G...~~~~::;>??= ;;::~~~....```````` `..W1>>?>>>>?>>>>>?S,.`.7^.............-N`` ` ``````` 6...~~~~::;>?? ;:~~~~....``````` ..7` d??>>?>?>>?>>?>>1udMgggNNNNggJ.......([ `````.L...~~~~::;>? :~~~.....`````` .7` `K>?>?>>>>>>+ugNMMMB""7<!~~<?7TWMNNa,..w.` ` ` ` `````,)....~~:::;> ~~~....``````.J^ ` #>>?>>>?jgMMM9=_................-?TMMa,b` ` ` ` ````(,...~~~~:;; ~~~....``` .7`` ` @?>>?1uMM#=.........................(TMNa...... ` ``````4....~~~::; ~~~...`` .=`` ` ` .b>>jgNH".................`.............?HNmx??17TYY9SA+(..L....~~~:: ~....` ,^`` ` ` .b+dN#^............6..-(,-...`............(HMm+>>>>>?>>????zOM_.~~~:: .... .=``` `` ` ...JNMM^..........`..._n.(MMN,....`..`.........?MNe<>>?>??>????d^...~~~: ~...v```` ` ..-Z""!_..(M@_........`........?7MMMMp.................-TNN+?>>>????1d4-..-(Jk9 ..(^`...zY"!_........(MD..............`......JMMMMp....`..`..`......./MNx>??>>?1d!.h7=~(??= (v_`,R_.............(NF..(/..(&,...`..........?MMMM;..................(MMs>>?1&T"!``....(1= t..`` 4,...........(N@....?,(NMNR_.....`..`....(WMM$..`....`..`..`....._HMe7=```````....~_1 ...````.4,........-dM:.....(7MMMNR-.....................`............(.?^ `` ``````....~~~ ...``````,4,....`.(NF........(MMMMb..`....--................`....(.7! ` ````....~~: ..````` ` `.5J_...JMt.........?NMMM[...`.HH5._(J7[...`...`...--?^` ` `````....~~~: ...````` ` ` 7a,.dM{....`...../MMMN......(J=` .>......._(/= ` ` `````...~~~: ....```` `` (4MN{..........._7"^...(/^ `.C....-(J=` ` ` ```....~~~: ....````` ` JdM[...`...`........`_3.. ..?!..(-7! ` ` ``````....~~~:: r...`````` ` ``(CJMb..............`......__..-(?^ ` ` `````....~~::; J/...````` ` `,3>+MN-.`..`...`..........._(J=`` ` ` ```````....~~~::; _j,..`.```` ``.5>>?dNb...`......`......_-?'` ` `````....~~~::;; ~~j,..```````.D??>>>MM/....`........(-=` ` ` ` ```````...~~~:::;> ~~~j,...````.E??>??>?MN-.........(J= ` ` ` ``````....~~~~::;?? :~~~?,...``.@>?>?>>??dMN_....-(?^ ` ` ` ` ````````...~~~~:;;>?? ::~~~?/....K??????>>?>dMN-_(7! ` ` ` ````````....~~~:::>>??l ;:::~~/e.(K==?????????<dM"! ` ` ` ` `` ``````...~~~~:::;>??=l @TT_beginner */ #include "bits/stdc++.h" using namespace std; #define ok1 cerr<<"ok1\n"; #define ok2 cerr<<"ok2\n"; #define M LLONG_MAX #define rep(i,n) for(ll i=0;i<n;++i) #define REP(i,s,n) for(ll i=(s);i<(n);++i) #define repr(i,n) for(ll i=n-1;i>=0;--i) #define REPR(i,s,n) for(ll i=(s);i>=(n);--(i)) #define all(a) (a).begin(),(a).end() #define reall(a) (a).rbegin(),(a).rend() #define pb emplace_back //emplace_backの方が速いが使い慣れてないため #define DOUBLE fixed << setprecision(15) #define fi first #define se second #define mp make_pair #define mt make_tuple #define out(x, y) ((x) < 0 || h <= (x) || (y) < 0 || w <= (y)) #define TO_STRING(VariableName) # VariableName #define debug(x) cerr<<TO_STRING(x)<<" is: "<<x<<" "<<endl; const double pi = acos(-1.0L); typedef vector<int> vi; typedef vector<string> vs; typedef long long ll; typedef vector<ll> vll; typedef vector<vi> vvi; typedef vector<vll> vvll; typedef vector<char> vc; typedef vector<double> vd; typedef vector<bool> vb; typedef deque<ll> dll; typedef pair<ll, ll> P; typedef tuple<ll, ll, ll> TLL; typedef vector<P> vP; typedef vector<TLL> vTLL; const ll mod = 1e9 + 7; //const ll mod = 998244353; ll dx[8] = { -1,0,1,0,1,1,-1,-1 }; ll dy[8] = { 0,-1,0,1,1,-1,1,-1 }; template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template<class A, class B> ostream& operator<<(ostream& ost, const pair<A, B>&p) { ost << "{ " << p.first << ", " << p.second << " }"; return ost; } template<class T> ostream& operator<<(ostream& ost, const vector<T>&v) { ost << "{ "; for (int i = 0; i<v.size(); i++) { if (i)ost << ", "; ost << v[i]; } ost << " }"; return ost; } template<class A, class B> ostream& operator<<(ostream& ost, const map<A, B>&v) { ost << "{ "; for (auto p : v) { ost << "{ " << p.first << ", " << p.second << " }"; } ost << " }"; return ost; } void debugs() { std::cerr << "\n"; } template <class T, class... Args> void debugs(const T &x, const Args &... args) { std::cerr << x << " "; debugs(args...); } bool out_check(ll a, ll b) { return (0 <= a && a < b); } double pitagoras(ll a, ll b, ll c, ll d) { double dx = a - b, dy = c - d; return pow(dx * dx + dy * dy, 0.5); } ll modpow(ll a, ll b, ll mod) { ll c = 1; while (b > 0) { if (b & 1) { c = a * c%mod; }a = a * a%mod; b >>= 1; }return c; } void Yes(bool x) { cout << ((x) ? "Yes\n" : "No\n"); } void YES(bool x) { cout << ((x) ? "YES\n" : "NO\n"); } void yes(bool x) { cout << ((x) ? "yes\n" : "no\n"); } void Yay(bool x) { cout << ((x) ? "Yay!\n" : ":(\n"); } void OK(bool x) { cout << ((x) ? "OK!\n" : "NG\n"); } //* ll n, m, d, e, l, r, k, h, w, Q, ans, ret = M; bool flag = false, flag2 = false, flag3 = false; string s, t, u; //* int main() { cin.tie(0); ios::sync_with_stdio(false);//not interactive cin >> n; vll a(n); rep(i, n)cin >> a[i]; repr(i, n) { if ((a[i] + ans) % (i + 1) == 0) { ans += bool(a[i] + ans); } else { Yes(0); return 0; } } Yes(1); }