Task: | Lumimyrsky |
Sender: | vgtcross |
Submission time: | 2023-10-30 00:02:43 +0200 |
Language: | C++ (C++20) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.00 s | details |
#2 | WRONG ANSWER | 0.00 s | details |
#3 | ACCEPTED | 0.00 s | details |
#4 | ACCEPTED | 0.00 s | details |
#5 | ACCEPTED | 0.00 s | details |
#6 | WRONG ANSWER | 0.00 s | details |
#7 | ACCEPTED | 0.00 s | details |
#8 | ACCEPTED | 0.00 s | details |
#9 | ACCEPTED | 0.00 s | details |
#10 | ACCEPTED | 0.00 s | details |
#11 | ACCEPTED | 0.00 s | details |
Code
#include <bits/stdc++.h> #define MODE 1 #if MODE #define debug(x) cout << #x << ": " << x << endl #define log(x) cout << x << endl #define test(x) x #else #define debug(x) #define log(x) #define test(x) #endif #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() #define fi first #define se second #define X real() #define Y imag() using namespace std; using ll = long long; using ld = long double; using uint = unsigned int; using ull = unsigned long long; using pii = pair<int, int>; using pli = pair<ll, int>; using pll = pair<ll, ll>; using P = complex<ll>; const ll M = 1000000007; // 998244353 void solve() { int n = 10; vector<int> a(n), b(n); for (int &i : a) cin >> i; for (int &i : b) cin >> i; int ans1 = 0, ans2 = 0; int pr = 0; for (int i = 0; i < 10; ++i) { ans1 += max(0, a[i] - pr); pr = a[i]; } pr = 0; for (int i = 0; i < 10; ++i) { ans2 += max(0, b[i] - pr); pr = a[i]; } if (ans1 < ans2) cout << "1\n"; else cout << "2\n"; } int main() { cin.tie(0) -> sync_with_stdio(0); int t = 1; if (t == 0) cin >> t; while (t--) solve(); return 0; }
Test details
Test 1
Verdict: ACCEPTED
input |
---|
0 0 1 1 1 2 2 2 1 0 0 1 2 3 2 2 3 0 1 1 |
correct output |
---|
1 |
user output |
---|
1 |
Test 2
Verdict: WRONG ANSWER
input |
---|
1 1 1 1 1 1 1 1 0 1 1 0 0 0 1 0 1 0 0 0 |
correct output |
---|
1 |
user output |
---|
2 |
Test 3
Verdict: ACCEPTED
input |
---|
1 2 2 2 0 0 0 2 0 0 0 1 0 1 1 2 1 2 1 2 |
correct output |
---|
1 |
user output |
---|
1 |
Test 4
Verdict: ACCEPTED
input |
---|
4 2 0 10 6 10 4 5 4 3 3 1 2 7 6 1 3 5 2 6 |
correct output |
---|
2 |
user output |
---|
2 |
Test 5
Verdict: ACCEPTED
input |
---|
6 0 7 9 3 1 5 6 9 4 9 0 1 0 2 2 0 1 4 7 |
correct output |
---|
2 |
user output |
---|
2 |
Test 6
Verdict: WRONG ANSWER
input |
---|
10 9 6 1 10 9 7 6 7 6 2 1 10 2 0 7 2 9 4 6 |
correct output |
---|
1 |
user output |
---|
2 |
Test 7
Verdict: ACCEPTED
input |
---|
22 5 87 83 20 36 92 98 49 9 61 40 77 35 52 49 29 100 18 81 |
correct output |
---|
1 |
user output |
---|
1 |
Test 8
Verdict: ACCEPTED
input |
---|
90 95 33 21 82 6 4 37 10 99 60 10 53 61 42 53 33 48 62 83 |
correct output |
---|
2 |
user output |
---|
2 |
Test 9
Verdict: ACCEPTED
input |
---|
7 22 78 32 44 98 73 46 98 31 54 26 50 8 7 42 27 1 50 53 |
correct output |
---|
2 |
user output |
---|
2 |
Test 10
Verdict: ACCEPTED
input |
---|
88 1 97 24 87 38 53 82 23 42 1 61 43 77 40 40 52 88 48 93 |
correct output |
---|
2 |
user output |
---|
2 |
Test 11
Verdict: ACCEPTED
input |
---|
1 36 50 50 50 0 13 31 14 1 22 88 42 13 25 13 8 39 34 49 |
correct output |
---|
1 |
user output |
---|
1 |