Submission #1248845

#TimeUsernameProblemLanguageResultExecution timeMemory
1248845bonicCOCI17_cezar (COCI17_cezar)C++20
50 / 50
0 ms328 KiB
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main() {
    int n; cin >> n; vector<int> A(n);
    vector<int> Cnt;
    for (int i = 2; i <= 9; i++) {
        for (int j = 0; j < 4; j++) {
            Cnt.push_back(i);
        }
    }
    for (int i = 0; i < 16; i++) {
        Cnt.push_back(10);
    }
    for (int i = 0; i < 4; i++) {
        Cnt.push_back(11);
    }
    int sum = 0;
    for (int i = 0; i < n; i++) {
        cin >> A[i];
        sum += A[i];
    }
    sort(A.begin(), A.end());
    if (sum >= 21) {
        cout << "DOSTA"; return 0;
    }
    int x = 21 - sum;
    int y = upper_bound(Cnt.begin(), Cnt.end(), x) - Cnt.begin();
    int z = upper_bound(A.begin(), A.end(), x) - A.begin();
    // cout << Cnt.size() - y << " " << y << "\n";
    // cout << A.size() - z << " " << z << "\n";
    if (((52 - y) - (n - z)) > (y - z)) {
        cout << "DOSTA"; return 0;
    }
    else {
        cout << "VUCI"; return 0;
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...