| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 374063 | Nimbostratus | Karte (COCI15_karte) | C++17 | 1 ms | 364 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 pb push_back
#define ub upper_bound
#define lb lower_bound
#define clean(a,s) memset((a),0,sizeof((a)[0])*(s))
#define all(x) (x).begin() , (x).end()
#define fi first
#define se second
#define int int
using pii = pair<int,int>;
using ll = long long;
const int maxn = 2e5+5;
const int inf = 2e9;
const int mod = 1e9+7;
string s;
map<char,set<int>> mp;
int32_t main () {
	//freopen("in","r",stdin); freopen("out","w",stdout);
	ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0);
	cin >> s;
	for(int i=0;i<s.size();i+=3) {
		int x = 10*(s[i+1]-'0') + (s[i+2]-'0');
		if(mp[s[i]].count(x)) {
			cout << "GRESKA" << endl;
			return 0;
		}
		mp[s[i]].insert(x);
	}
	cout << 13-mp['P'].size() << " " << 13-mp['K'].size() << " " << 13-mp['H'].size() << " " << 13-mp['T'].size() << endl;
	 
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
