# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
915269 | jpfr12 | Karte (COCI15_karte) | C++14 | 1 ms | 456 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 <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <string>
#include <map>
#include <math.h>
#include <cmath>
#include <climits>
#include <unordered_map>
#include <unordered_set>
#include <assert.h>
#include <fstream>
#include <bitset>
#include <iomanip>
typedef long long ll;
using namespace std;
int MOD = (int)1e9;
int MAXN = 1e6;
//classes
//global
map<char, set<string>> Map;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
//ifstream fin("input.txt");
//ofstream fout("output.txt");
//stop
string s;
cin >> s;
bool rep = false;
int n = s.length();
for(int i = 0; i < n; i += 3){
char c = s[i];
string str = s.substr(i+1, 2);
if(Map[c].count(str)){
cout << "GRESKA\n";
return 0;
}
Map[c].insert(str);
}
string str = "PKHT";
for(char& i: str){
cout << 13 - Map[i].size() << " ";
}
cout << '\n';
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |