# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
158632 | GoldNextYear | Karte (COCI15_karte) | C++14 | 2 ms | 504 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.
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1000000007;
const ll mod2=998244353;
const ll inf=1e18*4;
const ld pai=acos(-1);
string s;
int arr[26];
map<string,int>mp;
int main(){
cin>>s;
for(int i=0;i<26;i++)arr[i]=13;
for(int i=0;i<s.size()-2;i+=3){
string ret="";
for(int j=i;j<i+3;j++)ret+=s[j];
if(mp[ret])cout<<"GRESKA"<<endl,exit(0);
mp[ret]=1;
arr[ret[0]-'A']--;
}
cout<<arr['P'-'A']<<" "<<arr['K'-'A']<<" "<<arr['H'-'A']<<" "<<arr['T'-'A']<<endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |