제출 #1310510

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1310510		dgarcia09	Cezar (COCI17_cezar)	C++20	15 / 50	1 ms	716 KiB

cezar

#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#define int long long
#define endl '\n' 
#define fr first
#define sc second
#define vc vector<int>
using namespace std;

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); 	cout.tie(0);
    cout.setf(ios::fixed);
    cout.precision(0);

    int n;   
    cin >> n;
    vc num(n);
    vc res(14, 4);
    int sum = 0;
    res[10] = 12;

    for(int i = 1; i <= n; i++){ 
        cin >> num[i];
        res[num[i]]--;
        sum += num[i];
    }

    sum = abs(sum - 21);
    int cont1 = 0, cont2 = res[1];

    for(int i = 2; i <= sum; i++){
        cont1 += res[i];
    }

    for (int i = sum+1; i <= 10; i++){
        cont2 += res[i];  
    }

    if(cont2 >= cont1){
        cout << "DOSTA" << endl;
    }else{
        cout << "VUCI" << endl;
    }
    

    return 0;
}

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