# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
339214 | 2020-12-24T20:45:00 Z | ammar2000 | Karte (COCI15_karte) | C++17 | 1 ms | 364 KB |
#include <bits/stdc++.h> using namespace std; string s; map <pair <int , char >,int > mp; map <char ,int > mapp; int c; int main() { cin>>s; for (int i=0;i<s.length()-2;i+=3) { int no=(s[i+1]-'0')*10+(s[i+2]-'0'); mp[{no,s[i]}]++; if (mp[{no,s[i]}]>1) { cout <<"GRESKA"; return 0; } mapp[s[i]]++; } cout <<13-mapp['P']<< " "<<13-mapp['K']<<" "<<13-mapp['H']<<" "<<13-mapp['T']; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
4 | Correct | 1 ms | 364 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 | 364 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 |