oj.uz

답안 #899502

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
899502 2024-01-06T10:32:04 Z AlphaMale06 Karte (COCI15_karte) C++14
50 / 50
 1 ms 348 KB 
#include <bits/stdc++.h>

/*
	Oce nas,
	koji si na nebesima,
	da se sveti ime Tvoje,
	da dodje carstvo Tvoje,
	da bude volja Tvoja,
	i na zemlji, kao i na nebu.
	
	Hleb nas nasusni daj nam danas,
	i oprosti nam dugove nase,
	kao sto i mi oprastamo duznicima svojim,
	i ne uvedi nas u iskusenje,
	no izbavi nas od zloga.
	
	Jer je Tvoje Carstvo,
	i sila, i slava,
	u vekove vekova.
	
	Amin.
*/

using namespace std;
typedef vector<int> vc;
typedef vector<vector<int>> vvc;
using ll = long long;
using ld = long double;
#define yes cout << "YES\n"
#define no cout << "NO\n"
#define F first
#define S second
#define pb push_back
#define pf push_front
#define all(x) (x).begin(), (x).end()
#define int long long

int a[4][13];

void solve(){
	string s;
	cin >> s;
	int n=s.size();
	for(int i=0; i< n; i+=3){
		int ind=stoi(s.substr(i+1, 2)) - 1;
		int ind1=0;
		if(s[i]=='T'){
			ind1=3;
		}
		else if(s[i]=='K'){
			ind1=1;
		}
		else if(s[i]=='H'){
			ind1=2;
		}
		if(a[ind1][ind]==1){
				cout << "GRESKA\n";
				return;
		}
		a[ind1][ind]++;
	}
	for(int i=0; i< 4; i++){
		int ans=13;
		for(int j=0; j< 13; j++){
			ans-=a[i][j];
		}
		cout << ans << " ";
	}
}

signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	solve();
}

Subtask #1
50.0 / 50.0

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