# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
490608 |
2021-11-28T10:18:13 Z |
SanRa |
Karte (COCI15_karte) |
C++14 |
|
1 ms |
292 KB |
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
vector <vector<bool> > Suits(4, vector <bool> (13,false));
string s;
vector <int> numSuits (4,13);
int suit;
cin >> s;
bool error = false;
int x = s.size();
for(int i = 0; (!error) && (i < x/3); i++){
int numero = (s[i*3+1]-'0')*10+(s[i*3+2]-'0');
if (s[i*3]=='P') {
suit=0;
} else if (s[i*3]=='K') {
suit=1;
} else if (s[i*3]=='H') {
suit=2;
} else {
suit=3;
}
if(Suits[suit][numero]) {
error = true;
}
else{
Suits[suit][numero] = true;
numSuits[suit]--;
}
}
if(!error){
cout << numSuits[0] << " " << numSuits[1] << " " << numSuits[2] << " " << numSuits[3];
}
else{
cout << "GRESKA";
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
292 KB |
Output is correct |
2 |
Correct |
0 ms |
288 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |
6 |
Correct |
0 ms |
204 KB |
Output is correct |
7 |
Correct |
1 ms |
204 KB |
Output is correct |
8 |
Correct |
0 ms |
204 KB |
Output is correct |
9 |
Correct |
0 ms |
204 KB |
Output is correct |
10 |
Correct |
0 ms |
204 KB |
Output is correct |