제출 #1305211

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1305211		tab	COCI17_cezar (COCI17_cezar)	C++20	50 / 50	1 ms	840 KiB

cezar

#include "bits/stdc++.h"
using namespace std;
#define intt long long
#define fi first
#define se second

const intt mxN = 2e5+1;
const intt LG = 20;
const intt inf = 1e18; 
const intt mod = 1e9 + 7; 
intt dx[4] = {1, -1, 0ll, 0ll};
intt dy[4] = {0, 0, 1, -1};
map<intt,intt> val;

intt n, sum;
void _() {
    cin >> n;
    for(intt i = 2; i <= 10; i++) val[i] = 4;
    val[10] += 3; val[11] = 1;

    for(intt i = 0; i < n; i++) {
        intt x;
        cin >> x;
        sum += x;
        val[x]--;
    }
    intt diff = 21 - sum;
    intt as = 0, yu = 0;
    for(intt i = 1; i <= diff; i++) {
        as += val[i] * i;
    }
    for(intt i = diff + 1; i <= 11; i++) {
        yu += val[i] * i;
    }
    if(yu >= as) {
        cout << "DOSTA" << endl;
    } else {
        cout << "VUCI" << endl;
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); 
    cout.tie(NULL);

    // freopen("island.in", "r", stdin);
    // freopen("island.out", "w", stdout);

    intt t = 1, buu = 1;
    // cin >> t;
    while(t--){
        // cout << "Case #" << buu++ << ": ";
        _();
    }
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5