結果
問題 | No.1990 Candy Boxes |
ユーザー | t98slider |
提出日時 | 2022-06-24 22:32:28 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 6,062 bytes |
コンパイル時間 | 1,671 ms |
コンパイル使用メモリ | 178,016 KB |
実行使用メモリ | 15,276 KB |
最終ジャッジ日時 | 2023-08-12 23:07:59 |
合計ジャッジ時間 | 5,857 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,384 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 1 ms
4,384 KB |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | AC | 21 ms
7,520 KB |
testcase_13 | AC | 21 ms
7,936 KB |
testcase_14 | AC | 16 ms
8,184 KB |
testcase_15 | AC | 16 ms
8,644 KB |
testcase_16 | AC | 17 ms
9,352 KB |
testcase_17 | AC | 17 ms
9,588 KB |
testcase_18 | AC | 17 ms
9,532 KB |
testcase_19 | AC | 23 ms
9,044 KB |
testcase_20 | AC | 24 ms
10,052 KB |
testcase_21 | AC | 23 ms
9,592 KB |
testcase_22 | AC | 19 ms
8,076 KB |
testcase_23 | AC | 25 ms
9,188 KB |
testcase_24 | AC | 24 ms
9,068 KB |
testcase_25 | AC | 33 ms
11,704 KB |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | AC | 24 ms
13,036 KB |
testcase_29 | WA | - |
testcase_30 | AC | 22 ms
11,220 KB |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | AC | 26 ms
10,772 KB |
testcase_36 | WA | - |
testcase_37 | AC | 20 ms
10,396 KB |
testcase_38 | AC | 16 ms
8,820 KB |
testcase_39 | AC | 19 ms
9,500 KB |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | AC | 23 ms
12,624 KB |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | AC | 1 ms
4,380 KB |
testcase_51 | AC | 2 ms
4,376 KB |
testcase_52 | AC | 1 ms
4,376 KB |
testcase_53 | WA | - |
testcase_54 | AC | 2 ms
4,384 KB |
testcase_55 | AC | 2 ms
4,380 KB |
testcase_56 | WA | - |
testcase_57 | AC | 2 ms
4,380 KB |
testcase_58 | AC | 2 ms
4,380 KB |
testcase_59 | WA | - |
testcase_60 | AC | 2 ms
4,380 KB |
testcase_61 | AC | 2 ms
4,376 KB |
testcase_62 | AC | 2 ms
4,376 KB |
testcase_63 | AC | 1 ms
4,380 KB |
testcase_64 | AC | 1 ms
4,376 KB |
testcase_65 | AC | 29 ms
11,128 KB |
testcase_66 | AC | 23 ms
9,864 KB |
testcase_67 | WA | - |
testcase_68 | AC | 16 ms
7,768 KB |
testcase_69 | WA | - |
testcase_70 | AC | 27 ms
11,396 KB |
testcase_71 | WA | - |
testcase_72 | WA | - |
testcase_73 | AC | 27 ms
11,148 KB |
testcase_74 | WA | - |
testcase_75 | AC | 17 ms
9,300 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_popcountll(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 vector4d(type,name,h,w,d,...) vector<vector<vector<vector<type>>>>name(h,vector<vector<vector<type>>>(w,vector<vector<type>>(d,vector<type>(__VA_ARGS__)))) using namespace std; using ll = long long; template<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>; 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, size_t size> void scan(array<T, size>& a){ for(auto&& i : a) scan(i);} 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<<'\n';} 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; } struct dsu { public: dsu() : _n(0) {} dsu(int n) : _n(n), parent_or_size(n, -1) {} int merge(int a, int b) { assert(0 <= a && a < _n); assert(0 <= b && b < _n); int x = leader(a), y = leader(b); if (x == y) return x; if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y); parent_or_size[x] += parent_or_size[y]; parent_or_size[y] = x; return x; } bool same(int a, int b) { assert(0 <= a && a < _n); assert(0 <= b && b < _n); return leader(a) == leader(b); } int leader(int a) { assert(0 <= a && a < _n); if (parent_or_size[a] < 0) return a; return parent_or_size[a] = leader(parent_or_size[a]); } int size(int a) { assert(0 <= a && a < _n); return -parent_or_size[leader(a)]; } std::vector<std::vector<int>> groups() { std::vector<int> leader_buf(_n), group_size(_n); for (int i = 0; i < _n; i++) { leader_buf[i] = leader(i); group_size[leader_buf[i]]++; } std::vector<std::vector<int>> result(_n); for (int i = 0; i < _n; i++) { result[i].reserve(group_size[i]); } for (int i = 0; i < _n; i++) { result[leader_buf[i]].push_back(i); } result.erase( std::remove_if(result.begin(), result.end(), [&](const std::vector<int>& v) { return v.empty(); }), result.end()); return result; } private: int _n; // root node: -1 * component size // otherwise: parent std::vector<int> parent_or_size; }; int main(){ INT(n); vector<int> a(n); in(a); dsu uf(n); for(int i = 0; i + 1 < n; i++){ if(a[i] >= 1 && a[i + 1] >= 1){ //if(a[i] % 2 == 1 && a[i + 1] == 1)continue; uf.merge(i, i + 1); } } auto G = uf.groups(); for(auto &&vec:G){ ll s1 = 0, s2 = 0; sort(all(vec)); if(a[vec[0]]==0)continue; for(int i = 0; i < vec.size(); i+= 2){ s1 += a[vec[i]]; } for(int i = 1 ; i < vec.size(); i+=2){ s2 += a[vec[i]]; } if(s1 != s2){ out("No"); return 0; } bool flag = false; for(int i = 0; i + 1 < vec.size(); i++){ if(a[vec[i]] % 2 == a[vec[i+1]] % 2){ flag = true; break; } } if(!flag){ out("No"); return 0; } flag = true; int v = 0, cnt = 0; for(int i = 1; i + 1 < vec.size(); i++){ if(a[vec[i]] % 2 == 1){ if(a[vec[i]-1] % 2 == 1 && a[vec[i]+1] % 2 == 1){ flag = false; break; } } } if(!flag){ out("No"); return 0; } } out("Yes"); }