oj.uz

Submission #407035

# Submission time Handle Problem Language Result Execution time Memory
407035 2021-05-18T11:39:27 Z LptN21 Karte (COCI15_karte) C++14
50 / 50
 1 ms 204 KB 
#include <bits/stdc++.h>
using namespace std;
#define fastIO ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
#define FF first
#define SS second
#define pb push_back
#define sz(x) (int)x.size()
#define oo 1e9
#define eps 1e-9
#define PI acos(-1.0)
#define lb lower_bound
#define ub upper_bound
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> ii;
const int N = 1e5+7, M=13+7;
const int MOD = 1e9+7;

int n, m, k, t;

bool mark[4][M];
int cnt[4];

int get(char c) {
    if(c=='P') return 0;
    if(c=='K') return 1;
    if(c=='H') return 2;
    return 3;
}

signed main() {
    //freopen("test.inp", "r", stdin);
    //freopen("test.out", "w", stdout);
    //fastIO;
    char c, n1, n2;memset(cnt, 0, sizeof cnt);
    while(~scanf("%c%c%c", &c, &n1, &n2)&&c!='\n') {
        n=(n1-'0')*10+n2-'0';
        if(mark[get(c)][n]) {
            printf("GRESKA");
            return 0;
        }
        mark[get(c)][n]=1;
        cnt[get(c)]++;
    }
    for(int i=0;i<4;i++) printf("%d ", 13-cnt[i]);
    return 0;
}
/* stuff you should look for
    - int overflow, array bounds
    - special cases (n=1?)
    - do smth instead of do nothing and stay organized
    - WRITE STUFF DOWN
    - DONT JUST STICK ON ONE APPROACH
*/

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct