#822677 (C++14) No.2148 ひとりUNO

• 問題: No.2148 ひとりUNO
• ユーザー: daiota
• 提出日時: 2022-12-05 08:49:33
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: WA
• 実行時間: -
• コード長: 1,803 bytes
• コンパイル時間: 1,896 ms
• コンパイル使用メモリ: 178,152 KB
• 実行使用メモリ: 6,824 KB
• 最終ジャッジ日時: 2024-10-12 06:55:35
• 合計ジャッジ時間: 3,181 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

ファイルパターン	結果
sample	AC * 1
other	WA * 39

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<int(n);i++)
typedef long long ll;
typedef pair<char,ll> P;
int main(void){
    ll i;
    cin.tie(0);  ios_base::sync_with_stdio(false);
    int T;
    cin >> T;
    REP(tc,T){
        ll N;
        cin >> N;
        vector<ll> b,g,r;
        REP(i,N){
            char c;
            ll x;
            cin >> c >> x;
            if(c=='B') b.push_back(x);
            if(c=='G') g.push_back(x);
            if(c=='R') r.push_back(x);
        }
        sort(b.begin(),b.end());
        sort(g.begin(),g.end());
        sort(r.begin(),r.end());
        b.erase(unique(b.begin(),b.end()),b.end());
        g.erase(unique(g.begin(),g.end()),g.end());
        r.erase(unique(r.begin(),r.end()),r.end());
        ll n=b.size(),m=g.size(),p=r.size();
        if((n==0 && m==0 && p!=0) || (m==0 && p==0 && n!=0) || (p==0 && n==0 && m!=0)){
            cout << "YES" << endl;
            return 0;
        }
        ll d=0,e=0,f=0;
        vector<ll> v;
        REP(i,n) v.push_back(b[i]);
        REP(i,m) v.push_back(g[i]);
        sort(v.begin(),v.end());
        v.erase(unique(v.begin(),v.end()),v.end());
        ll z=v.size();
        if(n+m>z) d=1;
        v.clear();
        REP(i,m) v.push_back(g[i]);
        REP(i,p) v.push_back(r[i]);
        sort(v.begin(),v.end());
        v.erase(unique(v.begin(),v.end()),v.end());
        z=v.size();
        if(m+p>z) e=1;
        v.clear();
        REP(i,p) v.push_back(r[i]);
        REP(i,n) v.push_back(b[i]);
        sort(v.begin(),v.end());
        v.erase(unique(v.begin(),v.end()),v.end());
        z=v.size();
        if(p+n>z) f=1;
        if((n!=0 && m!=0 && p==0)){
            if(d==1) cout << "YES" << endl;
            else cout << "NO" << endl;
            return 0;
        }
        if((m!=0 && p!=0 && n==0)){
            if(e==1) cout << "YES" << endl;
            else cout << "NO" << endl;
            return 0;
        }
        if((p!=0 && n!=0 && m==0)){
            if(f==1) cout << "YES" << endl;
            else cout << "NO" << endl;
            return 0;
        }
        if(d+e+f>=2) cout << "YES" << endl;
        else cout << "NO" << endl;
    }
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX