# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
88569 | 2018-12-06T17:21:00 Z | aminra | Karte (COCI15_karte) | C++14 | 3 ms | 852 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; const int MOD = (int)1e9 + 7; const int MAXN = (int)5e5 + 7; const int infint = (int)1e9; const ll inf = (ll)1e18; string s; map<char, int> M; map<string, int> T; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); string s; cin >> s; for (int i = 0; i < s.size(); i += 3) { string t = s.substr(i, 3); T[t]++; M[t[0]]++; } int mx = 0; for (auto u : T) mx = max(mx, u.second); if(mx > 1) return cout << "GRESKA", 0; cout << 13 - M['P'] << " " << 13 - M['K'] << " " << 13 - M['H'] << " " << 13 - M['T']; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 468 KB | Output is correct |
3 | Correct | 2 ms | 624 KB | Output is correct |
4 | Correct | 2 ms | 636 KB | Output is correct |
5 | Correct | 2 ms | 636 KB | Output is correct |
6 | Correct | 2 ms | 792 KB | Output is correct |
7 | Correct | 2 ms | 792 KB | Output is correct |
8 | Correct | 2 ms | 792 KB | Output is correct |
9 | Correct | 3 ms | 792 KB | Output is correct |
10 | Correct | 2 ms | 852 KB | Output is correct |