Submission #237201

#	Time	Username	Problem	Language	Result	Execution time	Memory
237201		DIvanCode	COCI17_cezar (COCI17_cezar)	C++14	50 / 50	5 ms	384 KiB

cezar

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<unordered_set>
#include<unordered_map>
#include<queue>
#include<ctime>
#include<cassert>
#include<complex>
#include<string>
#include<cstring>
#include<chrono>
#include<random>
#include<bitset>
#include<iomanip>

#define fi first
#define se second
#define mp make_pair
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define sz(v) (int) v.size()

using namespace std;

mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> pii;

signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin >> n;
	vector<int> cnt(12);
	for (int i = 2; i <= 11; ++i) {
		cnt[i] = 4;
	}
	cnt[10] = 16;
	int diff = 21;
	for (int i = 0; i < n; ++i) {
		int x;
		cin >> x;
		diff -= x;
		cnt[x]--;
	}
	int sum1 = 0, sum2 = 0;
	for (int i = 2; i <= min(11, diff); ++i) {
		sum1 += cnt[i];
	}
	for (int i = diff + 1; i < 12; ++i) {
		sum2 += cnt[i];
	}
	if (sum1 <= sum2) {
		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