oj.uz

답안 #39420

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
39420 2018-01-15T02:48:28 Z adamczh1 Karte (COCI15_karte) C++14
50 / 50
 0 ms 2020 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> pii;

#define SIZE(x) (int)(x).size()
#define ALL(x) (x).begin(),(x).end()
#define ff first
#define ss second

inline ll readi(){
	ll x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}

map<char,bool> seen[14];
map<char,int> cc;

int main(){
	string S;
	cin>>S;
	for(int i=0;i<SIZE(S);i+=3){
		char suit=S[i];
		int num=10*(S[i+1]-'0')+S[i+2]-'0';
		if(seen[num][suit]){
			puts("GRESKA");
			return 0;
		}
		seen[num][suit]=1;
		cc[suit]++;
	}
	cout<<13-cc['P']<<' '<<13-cc['K']<<' '<<13-cc['H']<<' '<<13-cc['T']<<endl;
	return 0;
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 2020 KB Output is correct
2 Correct 0 ms 2020 KB Output is correct
3 Correct 0 ms 2020 KB Output is correct
4 Correct 0 ms 2020 KB Output is correct
5 Correct 0 ms 2020 KB Output is correct
6 Correct 0 ms 2020 KB Output is correct
7 Correct 0 ms 2020 KB Output is correct
8 Correct 0 ms 2020 KB Output is correct
9 Correct 0 ms 2020 KB Output is correct
10 Correct 0 ms 2020 KB Output is correct