| Task: | Sukat |
| Sender: | MikaelM |
| Submission time: | 2024-01-20 13:37:25 +0200 |
| Language: | C++ (C++17) |
| Status: | READY |
| Result: | 0 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details |
| #2 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details |
| #3 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details |
| #4 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details |
| #5 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details |
| #6 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details |
| #7 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details |
| #8 | WRONG ANSWER | 0.05 s | 2, 3 | details |
| #9 | WRONG ANSWER | 0.00 s | 2, 3 | details |
| #10 | WRONG ANSWER | 0.11 s | 2, 3 | details |
| #11 | WRONG ANSWER | 0.12 s | 2, 3 | details |
| #12 | WRONG ANSWER | 0.11 s | 2, 3 | details |
| #13 | WRONG ANSWER | 0.13 s | 2, 3 | details |
| #14 | WRONG ANSWER | 0.23 s | 2, 3 | details |
| #15 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #16 | WRONG ANSWER | 0.09 s | 3 | details |
| #17 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #18 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #19 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #20 | TIME LIMIT EXCEEDED | -- | 3 | details |
| #21 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
string a = "-ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const int N = 10000;
vector<int> v[N];
bool z[N];
void haku(int s){
if(z[s]) return;
z[s] = true;
if(s == 1000){
cout << "YES";
exit(0);
}
for(int u : v[s]){
haku(u);
}
}
int main(){
string s;
cin >> s;
int n = s.size();
// montako jokaista kirjainta on
unordered_map<char, int> m;
for(char c : s) m[c]++;
// 1. solmu = 0
// viimeinen solmu = 1000
for(int i = 1; i <= 26; i++){
v[0].push_back(i);
v[100 + i].push_back(1000);
}
// parita kirjaimet
for(int i = 0; i < n; i++){
char c = s[i];
//int kpl = m[c];
for(int j = 1; j <= 26; j++){
//cout << s[i] << " " << a[j] << "\n";
if(c == a[j] || m[a[j]] == 0) continue;
for(int k = 1; k <= m[c]; k++) v[i].push_back(100 + j);
}
}
haku(0);
// niin monta kaarta lähtee jokaisesta
/*for(auto u : m){
cout << u.first << " " << u.second << "\n";
}
*/
}
/*
BBBCK
ABBC
Jokaisesta kirjaimesta on kaari
kaikkiin muihin eri kirjaimiin
maksimiparitus
*/Test details
Test 1
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| QBAXGXJZJS |
| correct output |
|---|
| 5 XJ ZX SQ JG ... |
| user output |
|---|
| YES |
Test 2
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| SSSSSSSSSS |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 3
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| SETTSESEEE |
| correct output |
|---|
| 5 ES ET ES ET ... |
| user output |
|---|
| YES |
Test 4
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| SSMRSSSSKR |
| correct output |
|---|
| 4 SR SR SM SK |
| user output |
|---|
| YES |
Test 5
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| BIIILIIRRL |
| correct output |
|---|
| 5 IR IL IR IL ... |
| user output |
|---|
| YES |
Test 6
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| YYGEYTDSTY |
| correct output |
|---|
| 5 YT YT YS YG ... |
| user output |
|---|
| YES |
Test 7
Group: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| MMMMMMMMMN |
| correct output |
|---|
| 1 MN |
| user output |
|---|
| YES |
Test 8
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| XQQZJQDDJOWXDFVQUIODDJIZIQDQIW... |
| correct output |
|---|
| 500 DQ DQ DQ DQ ... |
| user output |
|---|
| YES |
Test 9
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| IIIIIIIIIIIIIIIIIIIIIIIIIIIIII... |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 10
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| KEOHHYHHAIHLLHEKIHKAHHHHOHEHHE... |
| correct output |
|---|
| 493 HA HA HA HA ... |
| user output |
|---|
| YES |
Test 11
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| WNNFXQNODQFSQVQQPNLQNQNNVVNXHN... |
| correct output |
|---|
| 499 NQ NQ NQ NQ ... |
| user output |
|---|
| YES |
Test 12
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| VGAHMMMXMMVXAAMMMOMMMXVMMMYMXT... |
| correct output |
|---|
| 500 MH MH MH MH ... |
| user output |
|---|
| YES |
Test 13
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| KKKKUUAKKAUKKKKFKKSVKCWKKKCVOJ... |
| correct output |
|---|
| 500 KI KI KI KI ... |
| user output |
|---|
| YES |
Test 14
Group: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| VVVVVVVVVVVVVVVVVVVVVVVVVVVVVV... |
| correct output |
|---|
| 100 VP VP VP VP ... |
| user output |
|---|
| YES |
Test 15
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| FKKJJBWTSFCDEKFPOKIPWZSVKHACMC... |
| correct output |
|---|
| 100000 CK CK CK CK ... |
| user output |
|---|
| (empty) |
Test 16
Group: 3
Verdict: WRONG ANSWER
| input |
|---|
| RRRRRRRRRRRRRRRRRRRRRRRRRRRRRR... |
| correct output |
|---|
| 0 |
| user output |
|---|
| (empty) |
Test 17
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| WVKKVVADNVCVKLVYVVZVKVCTNKVLVV... |
| correct output |
|---|
| 99925 VC VC VC VC ... |
| user output |
|---|
| (empty) |
Test 18
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| BBBBBDNXDZQXBBYBBWBSBTMADXBBVZ... |
| correct output |
|---|
| 99999 BE BE BE BE ... |
| user output |
|---|
| (empty) |
Test 19
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| FBRDPLUMLZMLLLUFUCLEMCMULLZLFL... |
| correct output |
|---|
| 100000 LU LU LU LU ... |
| user output |
|---|
| (empty) |
Test 20
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| UUBUBUTUJSLUVBUXTUUMUXUXTMXUXS... |
| correct output |
|---|
| 100000 UX UX UX UX ... |
| user output |
|---|
| (empty) |
Test 21
Group: 3
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| PPPPPPPPPPEPPPPPPPPPPBOPPPPPPP... |
| correct output |
|---|
| 20000 PB PB PB PB ... |
| user output |
|---|
| (empty) |