結果
問題 | No.2148 ひとりUNO |
ユーザー | snuke |
提出日時 | 2022-12-05 00:11:04 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 19 ms / 2,000 ms |
コード長 | 4,417 bytes |
コンパイル時間 | 2,522 ms |
コンパイル使用メモリ | 216,740 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-10-12 00:20:31 |
合計ジャッジ時間 | 4,149 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 4 ms
6,816 KB |
testcase_02 | AC | 4 ms
6,820 KB |
testcase_03 | AC | 4 ms
6,816 KB |
testcase_04 | AC | 4 ms
6,820 KB |
testcase_05 | AC | 4 ms
6,816 KB |
testcase_06 | AC | 4 ms
6,816 KB |
testcase_07 | AC | 4 ms
6,816 KB |
testcase_08 | AC | 4 ms
6,820 KB |
testcase_09 | AC | 4 ms
6,816 KB |
testcase_10 | AC | 4 ms
6,816 KB |
testcase_11 | AC | 4 ms
6,816 KB |
testcase_12 | AC | 3 ms
6,816 KB |
testcase_13 | AC | 4 ms
6,820 KB |
testcase_14 | AC | 4 ms
6,816 KB |
testcase_15 | AC | 4 ms
6,820 KB |
testcase_16 | AC | 19 ms
6,816 KB |
testcase_17 | AC | 19 ms
6,820 KB |
testcase_18 | AC | 19 ms
6,820 KB |
testcase_19 | AC | 19 ms
6,816 KB |
testcase_20 | AC | 19 ms
6,816 KB |
testcase_21 | AC | 18 ms
6,820 KB |
testcase_22 | AC | 19 ms
6,816 KB |
testcase_23 | AC | 19 ms
6,820 KB |
testcase_24 | AC | 18 ms
6,816 KB |
testcase_25 | AC | 18 ms
6,820 KB |
testcase_26 | AC | 10 ms
6,820 KB |
testcase_27 | AC | 11 ms
6,820 KB |
testcase_28 | AC | 10 ms
6,820 KB |
testcase_29 | AC | 10 ms
6,816 KB |
testcase_30 | AC | 10 ms
6,820 KB |
testcase_31 | AC | 10 ms
6,816 KB |
testcase_32 | AC | 10 ms
6,816 KB |
testcase_33 | AC | 10 ms
6,816 KB |
testcase_34 | AC | 10 ms
6,820 KB |
testcase_35 | AC | 11 ms
6,816 KB |
testcase_36 | AC | 10 ms
6,816 KB |
testcase_37 | AC | 11 ms
6,820 KB |
testcase_38 | AC | 10 ms
6,816 KB |
testcase_39 | AC | 2 ms
6,820 KB |
ソースコード
#include <bits/stdc++.h> #define rep(i,n) for(int i = 0; i < (n); ++i) #define rep1(i,n) for(int i = 1; i <= (n); ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) #define srep(i,s,t) for (int i = s; i < (t); ++i) #define rng(a) a.begin(),a.end() #define rrng(a) a.rbegin(),a.rend() #define fi first #define se second #define pb push_back #define eb emplace_back #define pob pop_back #define sz(x) (int)(x).size() #define pcnt __builtin_popcountll #define snuke srand((unsigned)clock()+(unsigned)time(NULL)); #define newline puts("") using namespace std; template<typename T> using vc = vector<T>; template<typename T> using vv = vc<vc<T>>; template<typename T> using PQ = priority_queue<T,vc<T>,greater<T>>; using uint = unsigned; using ull = unsigned long long; using vi = vc<int>; using vvi = vv<int>; using vvvi = vv<vi>; using ll = long long; using vl = vc<ll>; using vvl = vv<ll>; using vvvl = vv<vl>; using P = pair<int,int>; using vp = vc<P>; using vvp = vv<P>; int geti(){int x;scanf("%d",&x);return x;} vi pm(int n, int s=0) { vi a(n); iota(rng(a),s); return a;} template<typename T>istream& operator>>(istream&i,vc<T>&v){rep(j,sz(v))i>>v[j];return i;} template<typename T>string join(const T&v,const string& d=""){stringstream s;rep(i,sz(v))(i?s<<d:s)<<v[i];return s.str();} template<typename T>ostream& operator<<(ostream&o,const vc<T>&v){if(sz(v))o<<join(v," ");return o;} template<typename T1,typename T2>istream& operator>>(istream&i,pair<T1,T2>&v){return i>>v.fi>>v.se;} template<typename T1,typename T2>ostream& operator<<(ostream&o,const pair<T1,T2>&v){return o<<v.fi<<","<<v.se;} template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int){a.fi--;a.se--;} template<typename T>void operator--(vc<T>&a,int){for(T&x:a)x--;} template<typename T>void operator++(vc<T>&a,int){for(T&x:a)x++;} template<typename T>void operator+=(vc<T>&a,T b){for(T&x:a)x+=b;} template<typename T>void operator+=(vc<T>&a,const vc<T>&b){a.insert(a.end(),rng(b));} template<typename T1,typename T2>bool mins(T1& x,const T2&y){if(x>y){x=y;return true;}else return false;} template<typename T1,typename T2>bool maxs(T1& x,const T2&y){if(x<y){x=y;return true;}else return false;} template<typename Tx, typename Ty>Tx dup(Tx x, Ty y){return (x+y-1)/y;} template<typename T>ll suma(const vc<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;} template<typename T>ll suma(const vv<T>&a){ll res(0);for(auto&&x:a)res+=suma(x);return res;} template<typename T>void uni(T& a){sort(rng(a));a.erase(unique(rng(a)),a.end());} template<typename T>void prepend(vc<T>&a,const T&x){a.insert(a.begin(),x);} const double eps = 1e-10; const ll LINF = 1001002003004005006ll; const int INF = 1001001001; #define dame { puts("-1"); return;} #define yes { puts("YES"); return;} #define no { puts("NO"); return;} #define ret(x) { cout<<(x)<<endl; return;} #define yn {puts("Yes");}else{puts("No");} const int MX = 200005; template<typename T>void rot(T& a,int i){rotate(a.begin(),a.begin()+(i),a.end());} template<typename T>void rot(vv<T>& a){int h=sz(a),w=sz(a[0]);vv<T> p(w,vc<T>(h));swap(a,p);rep(i,h)rep(j,w)a[j][h-1-i]=p[i][j];} void rot(vc<string>& a){int h=sz(a),w=sz(a[0]);vc<string> p(w,string(h,'?'));swap(a,p);rep(i,h)rep(j,w)a[j][h-1-i]=p[i][j];} struct Solver { void solve() { int n; scanf("%d",&n); vvi a(3); rep(i,n) { char c; int d; scanf(" %c%d",&c,&d); int x = 0; if (c == 'R') x = 1; if (c == 'G') x = 2; --d; a[x].pb(d); } while (1) { bool upd = false; rep(i,sz(a)) { if (sz(a[i]) == 0) { a.erase(a.begin()+i); upd = true; break; } } if (!upd) break; } if (sz(a) == 1) yes; auto f = [&](int i, int j) { vi& b = a[i]; vi& c = a[j]; set<int> st; for (int x : b) st.insert(x); vi res; for (int x : c) { if (st.count(x)) res.pb(x); } return res; }; if (sz(a) == 2) { if (f(0,1).size()) yes; no; } rep(ri,3) { vi l = f(0,1); vi r = f(1,2); if (sz(l) && sz(r)) { if (sz(l) > 1 || sz(r) > 1 || l != r) yes; if (sz(a[1]) == 1) yes; } rot(a,1); } no; } }; int main() { // cin.tie(nullptr); ios::sync_with_stdio(false); int ts = 1; scanf("%d",&ts); rep1(ti,ts) { Solver solver; solver.solve(); } return 0; }