This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define B begin()
#define E end()
#define F first
#define S second
#define pb push_back
#define pf push_front
#define eb emplace_back
#define ll long long
#define ui unsigned int
#define ull unsigned long long
#define sts stable_sort
using namespace std;
const int MAXN = 1e6 + 4;
const int MOD = 1e9 + 7;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int n; cin >> n;
map<int, int> m;
for(int i = 2; i <= 11; i++){
if(i == 10){
m[i] = 12;
}else{
m[i] = 4;
}
}
int sum = 0;
for(int i = 0; i < n; i++){
int x; cin >> x;
sum += x;
m[x]--;
}
if(sum >= 20){
cout << "DOSTA\n"; return 0;
}
int l = 0, r = 0;
for(int i = 2; i <= 11; i++){
if(i <= 21 - sum){
l += m[i];
}else{
r += m[i];
}
}
if(l > r){
cout << "VUCI\n"; return 0;
}
cout << "DOSTA\n";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |