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 mp make_pair
#define pb push_back
#define ii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define INF 100000000000000000
#define modulo 1000000007
#define mod 998244353
#define int long long int
using namespace std;
bool erase(map<int,int>&data,int key){
if(!data.count(key))return false;
data[key]--;
if(data[key]==0)data.erase(key);
return true;
}
int32_t main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("q.gir","r",stdin);
// freopen("q.cik","w",stdout);
int n;
cin>>n;
vector<int> arr(n);
for(int i=0;i<n;i++)cin>>arr[i];
map<int,int> data;
for(int i=1;i<=13;i++){
if(i==1)data[11]+=4;
else if(i==13||i==11||i==12)data[10]+=4;
else data[i]+=4;
}
int sum=0;
for(int i=0;i<n;i++){
sum+=arr[i];
erase(data,arr[i]);
}
int rem=21-sum;
int a=0,b=0;
for(map<int,int>::iterator itr=data.begin();itr!=data.end();itr++){
if(itr->first<=rem){
a+=itr->second;
}
else b+=itr->second;
}
if(b<=a){
cout<<"VUCI";
}
else cout<<"DOSTA";
}
# | 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... |