# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1005458 | vjudge1 | Karte (COCI15_karte) | C++17 | 0 ms | 600 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
string s; cin>>s;
set<int> p,k,h,t;
for (int i=1; i<=13; i++){
p.insert(i), k.insert(i), h.insert(i), t.insert(i);
}
bool ok=true;
for (int i=0; i<s.length(); i+=3){
int suit=s[i];
int number=(s[i+1]-'0')*10+(s[i+2]-'0');
if (suit=='P'){
if (p.count(number)==0) ok=false;
else p.erase(number);
} else if (suit=='K') {
if (k.count(number)==0) ok=false;
else k.erase(number);
} else if (suit=='H'){
if (h.count(number)==0) ok=false;
else h.erase(number);
} else if (suit=='T'){
if (t.count(number)==0) ok=false;
else t.erase(number);
}
}
if (ok){
cout<<(int)(p.size())<<' '<<(int)(k.size())<<' '<<(int)(h.size())<<' '<<(int)(t.size())<<'\n';
} else{
cout<<"GRESKA"<<'\n';
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |