Submission #316831

#	Time	Username	Problem	Language	Result	Execution time	Memory
316831		ronnith	COCI17_cezar (COCI17_cezar)	C++14	50 / 50	1 ms	384 KiB

cezar

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#warning Check Integer OverFlow
#define ll long long
#define rep(i,a,b) for(int i=a;i<b;i++)
#define maxs(a,b) if(b>a)a=b
#define mins(a,b) if(b<a)a=b
#define debug(x) cerr<<"["<<#x<<":"<<x<<"] "
#define debug2(a,b) debug(a);debug(b)
#define debug3(a,b,c) debug2(a,b);debug(c)
#define de cerr
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (((a)/(__gcd(a,b))) * b)
#define print(arr) for(auto it = arr.begin();it < arr.end();it ++){cout << *it << " ";}cout << ln;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define all(a) (a).begin(), (a).end()
#define vi vector<int>
#define v vector
#define p pair
#define pii p<int,int>
#define pb push_back
#define mk make_pair
#define f first
#define s second
#define ln "\n"
typedef long double ld;
using namespace std;
using namespace __gnu_pbds;
ll modF=1e9+7;

/*OUTPUT

*/

void solve(){
	int N;
	cin >> N;
	int sm = 0;
	int fr[12];
	for(int i = 2;i <= 9;i ++){
		fr[i] = 4;
	}
	fr[10] = 12;
	fr[11] = 1;
	rep(i,0,N){
		int x;
		cin >> x;
		sm += x;
		fr[x] --;
	}
	int diff = 21 - sm;
	int x = 0;
	int y = 0;
	rep(i,2,12){
		if(i > diff){
			x += fr[i];
		}
		else{
			y += fr[i];
		}
	}
	if(x >= y){
		cout << "DOSTA\n";
	}
	else{
		cout << "VUCI\n";
	}
}

int main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int t = 1;
	// cin >> t;
	while(t --){
		solve();
	}
}

Compilation message (stderr)

cezar.cpp:4:2: warning: #warning Check Integer OverFlow [-Wcpp]
    4 | #warning Check Integer OverFlow
      |  ^~~~~~~

• 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