| Task: | Golf |
| Sender: | Naming is (NP) Hard |
| Submission time: | 2025-11-08 12:08:05 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | details |
| #2 | ACCEPTED | 0.00 s | details |
| #3 | ACCEPTED | 0.00 s | details |
| #4 | ACCEPTED | 0.00 s | details |
| #5 | ACCEPTED | 0.00 s | details |
| #6 | ACCEPTED | 0.00 s | details |
Code
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define D(x) {x;}
#else
#define D(x)
#endif
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x),end(x)
#define sz(x) (int) (x).size()
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
int main() {
cin.tie(0) -> sync_with_stdio(0);
cin.exceptions(cin.failbit);
int n = 18;
int x;
for (int i = 0; i < n; ++i) cin >> x;
int U = 0, M = 0;
for (int i = 0; i < n; ++i) {
cin >> x;
U += x;
}
for (int i = 0; i < n; ++i) {
cin >> x;
M += x;
}
if (U < M) {
cout << "Uolevi\n";
} else if (M < U) {
cout << "Maija\n";
} else {
cout << "Tie\n";
}
}
Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 159 168 193 218 170 221 158 2... |
| correct output |
|---|
| Tie |
| user output |
|---|
| Tie |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 133 249 194 236 50 75 110 2... |
| correct output |
|---|
| Uolevi |
| user output |
|---|
| Uolevi |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 137 87 55 236 159 239 137 1... |
| correct output |
|---|
| Maija |
| user output |
|---|
| Maija |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 555 80 711 842 298 130... |
| correct output |
|---|
| Tie |
| user output |
|---|
| Tie |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 968 902 552 181 973 857... |
| correct output |
|---|
| Maija |
| user output |
|---|
| Maija |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 229 64 872 833 214 370... |
| correct output |
|---|
| Uolevi |
| user output |
|---|
| Uolevi |
