# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
382926 |
2021-03-28T14:25:21 Z |
Alma |
Karte (COCI15_karte) |
C++17 |
|
2 ms |
512 KB |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
string s, a;
cin >> s;
unordered_set<string> p;
unordered_set<string> k;
unordered_set<string> h;
unordered_set<string> t;
for (int i = 0; i < (int)s.size(); i += 3) {
a = s.substr(i, 3);
if (a[0] == 'P') {
if (p.find(a) != p.end()) {
cout << "GRESKA\n";
return 0;
}
p.insert(a);
} else if (a[0] == 'K') {
if (k.find(a) != k.end()) {
cout << "GRESKA\n";
return 0;
}
k.insert(a);
} else if (a[0] == 'H') {
if (h.find(a) != h.end()) {
cout << "GRESKA\n";
return 0;
}
h.insert(a);
} else {
if (t.find(a) != t.end()) {
cout << "GRESKA\n";
return 0;
}
t.insert(a);
}
}
cout << 13 - (int)p.size() << ' ';
cout << 13 - (int)k.size() << ' ';
cout << 13 - (int)h.size() << ' ';
cout << 13 - (int)t.size() << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
364 KB |
Output is correct |
2 |
Correct |
1 ms |
364 KB |
Output is correct |
3 |
Correct |
1 ms |
512 KB |
Output is correct |
4 |
Correct |
1 ms |
384 KB |
Output is correct |
5 |
Correct |
1 ms |
364 KB |
Output is correct |
6 |
Correct |
1 ms |
364 KB |
Output is correct |
7 |
Correct |
1 ms |
492 KB |
Output is correct |
8 |
Correct |
1 ms |
364 KB |
Output is correct |
9 |
Correct |
1 ms |
364 KB |
Output is correct |
10 |
Correct |
1 ms |
364 KB |
Output is correct |