# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
602153 | inksamurai | Karte (COCI15_karte) | C++17 | 1 ms | 324 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 rep(i,n) for(int i=0;i<n;i++)
#define rng(i,c,n) for(int i=(c);i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define fi first
#define se second
#define sz(a) (int)a.size()
#define vec(...) vector<__VA_ARGS__>
#define _3aFGabX ios::sync_with_stdio(0),cin.tie(0)
using pii=pair<int,int>;
using vi=vector<int>;
void print(){cout<<'\n';}
template<class h,class...t>
void print(const h&v,const t&...u){cout<<v<<' ',print(u...);}
// e
signed main(){
_3aFGabX;
string s;
cin>>s;
int n=sz(s);
std::map<pair<char,int>,int> mp;
std::map<char,int> cnt;
for(int i=0;i<n;i+=3){
char ch=s[i];
int num=stoi(s.substr(i+1,2));
if(mp.find(pii(ch,num))!=mp.end()){
cout<<"GRESKA\n";
exit(0);
}
mp[pii(ch,num)]=1;
cnt[ch]+=1;
}
vi rs={'P','K','H','T'};
for(auto ch:rs){
cout<<13-cnt[ch]<<" ";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |