제출 #237189

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
237189		Mlxa	Cezar (COCI17_cezar)	C++14	50 / 50	5 ms	512 KiB

cezar

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int ll
#define all(x) x.begin(), x.end()
#define x first
#define y second
#define mp make_pair
#define mt make_tuple

const int N = 20;
int cnt[N];
int n;
int x;
int s;

signed main() {
#ifdef LC
	assert(freopen("input.txt", "r", stdin));
#endif
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	fill(cnt + 2, cnt + 10, 4);
	cnt[10] = 16;
	cnt[11] = 4;
	cin >> n;
	while (n--) {
		cin >> x;
		--cnt[x];
		assert(cnt[x] >= 0);
		s += x;
	}
	int a = 0;
	int b = 0;
	x = 21 - s;
	assert(x >= 0);
	for (int i = 2; i <= x; ++i) {
		a += cnt[i];
	}
	for (int i = x + 1; i <= 11; ++i) {
		b += cnt[i];
	}
	if (a >= b) {
		cout << "VUCI\n";
	} else {
		cout << "DOSTA\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