Submission #83961

#	Time	Username	Problem	Language	Result	Execution time	Memory
83961		josiftepe	COCI17_cezar (COCI17_cezar)	C++14	50 / 50	3 ms	680 KiB

cezar

#include <iostream>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <sstream>
#include <cstdio>
#include <algorithm>
#include <stack>
#include <queue>
#include <cmath>
#include <iomanip>
#include <fstream>
//#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = (1 << 30);
const ll inf = (1LL << 60LL);
const int maxn = 1e5 + 10;
int n;
int arr[55];
int cnt[20];
int main(int argc, const char * argv[]) {
    ios_base::sync_with_stdio(false);
//    ifstream cin("in.txt");
    cin >> n;
    int sum = 0;
    for(int i = 0; i < n; i ++){
        cin >> arr[i];
        sum += arr[i];
    }
    for(int i = 2; i <= 9; i ++){
        cnt[i] = 4;
    }
    cnt[10] = 16;
    cnt[11] = 4;
    for(int i = 0; i< n; i ++){
        cnt[arr[i]] --;
    }
    int X = 21 - sum;
    int ret = 0, ret2 = 0;
    for(int i = 2; i <= 11; i ++){
        if(i > X){
            ret += cnt[i];
        }
        else{
            ret2 += cnt[i];
        }
    }
    if(ret >= ret2){
        cout << "DOSTA\n";
    }
    else{
        cout << "VUCI\n";
    }
    return 0;
}

• 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