Task: | Youngling tournament |
Sender: | zxc |
Submission time: | 2016-07-28 18:13:21 +0300 |
Language: | C++ |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 100 |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.05 s | details |
#2 | ACCEPTED | 0.05 s | details |
#3 | ACCEPTED | 0.06 s | details |
#4 | ACCEPTED | 0.05 s | details |
#5 | ACCEPTED | 0.06 s | details |
#6 | ACCEPTED | 0.05 s | details |
#7 | ACCEPTED | 0.05 s | details |
#8 | ACCEPTED | 0.05 s | details |
#9 | ACCEPTED | 0.06 s | details |
#10 | ACCEPTED | 0.06 s | details |
#11 | ACCEPTED | 0.06 s | details |
#12 | ACCEPTED | 0.06 s | details |
#13 | ACCEPTED | 0.05 s | details |
#14 | ACCEPTED | 0.06 s | details |
#15 | ACCEPTED | 0.06 s | details |
#16 | ACCEPTED | 0.06 s | details |
#17 | ACCEPTED | 0.05 s | details |
#18 | ACCEPTED | 0.06 s | details |
#19 | ACCEPTED | 0.06 s | details |
#20 | ACCEPTED | 0.06 s | details |
#21 | ACCEPTED | 0.12 s | details |
#22 | ACCEPTED | 0.12 s | details |
#23 | ACCEPTED | 0.11 s | details |
#24 | ACCEPTED | 0.12 s | details |
#25 | ACCEPTED | 0.12 s | details |
#26 | ACCEPTED | 0.10 s | details |
#27 | ACCEPTED | 0.59 s | details |
#28 | ACCEPTED | 0.59 s | details |
#29 | ACCEPTED | 0.57 s | details |
#30 | ACCEPTED | 0.61 s | details |
#31 | ACCEPTED | 0.76 s | details |
#32 | ACCEPTED | 0.63 s | details |
#33 | ACCEPTED | 0.65 s | details |
#34 | ACCEPTED | 0.64 s | details |
#35 | ACCEPTED | 0.60 s | details |
#36 | ACCEPTED | 0.67 s | details |
#37 | ACCEPTED | 0.66 s | details |
#38 | ACCEPTED | 0.67 s | details |
#39 | ACCEPTED | 0.55 s | details |
#40 | ACCEPTED | 0.64 s | details |
#41 | ACCEPTED | 0.60 s | details |
#42 | ACCEPTED | 0.99 s | details |
#43 | ACCEPTED | 0.70 s | details |
#44 | ACCEPTED | 0.60 s | details |
#45 | ACCEPTED | 0.43 s | details |
#46 | ACCEPTED | 0.41 s | details |
#47 | ACCEPTED | 0.38 s | details |
#48 | ACCEPTED | 0.41 s | details |
#49 | ACCEPTED | 0.40 s | details |
#50 | ACCEPTED | 0.43 s | details |
#51 | ACCEPTED | 0.66 s | details |
#52 | ACCEPTED | 0.56 s | details |
#53 | ACCEPTED | 0.64 s | details |
#54 | ACCEPTED | 0.68 s | details |
#55 | ACCEPTED | 0.71 s | details |
#56 | ACCEPTED | 0.68 s | details |
#57 | ACCEPTED | 0.68 s | details |
#58 | ACCEPTED | 0.67 s | details |
#59 | ACCEPTED | 0.70 s | details |
#60 | ACCEPTED | 0.78 s | details |
#61 | ACCEPTED | 0.80 s | details |
#62 | ACCEPTED | 0.76 s | details |
#63 | ACCEPTED | 0.60 s | details |
#64 | ACCEPTED | 0.65 s | details |
#65 | ACCEPTED | 0.64 s | details |
#66 | ACCEPTED | 1.14 s | details |
#67 | ACCEPTED | 0.81 s | details |
#68 | ACCEPTED | 0.64 s | details |
#69 | ACCEPTED | 0.50 s | details |
#70 | ACCEPTED | 0.44 s | details |
#71 | ACCEPTED | 0.43 s | details |
#72 | ACCEPTED | 0.50 s | details |
#73 | ACCEPTED | 0.47 s | details |
#74 | ACCEPTED | 0.51 s | details |
Compiler report
input/code.cpp: In function 'void solve()': input/code.cpp:147:6: warning: unused variable 'lo' [-Wunused-variable] int lo = 0; ^ input/code.cpp:148:6: warning: unused variable 'hi' [-Wunused-variable] int hi = pos; ^
Code
#include <bits/stdc++.h>#define F first#define S secondusing namespace std;typedef long long ll;const int N = 1<<17;struct Node {pair<ll, ll> val;ll prior;int cnt;ll sum;ll ma;Node * left;Node * right;Node(ll v, ll i) {val = {v, i};sum = 0;ma = 0;prior = rand();cnt = 1;left = right = NULL;}};Node * root;int cnt(Node * a) {if(a == NULL) return 0;return a->cnt;}ll sum(Node * a) {if(a == NULL) return 0;return a->sum;}ll ma(Node * a) {if(a == NULL) return 0;return a->ma;}void upd(Node * a) {if(a == NULL) return;a->cnt = cnt(a->left) + cnt(a->right) + 1;a->sum = sum(a->left) + sum(a->right) + a->val.F;a->ma = max(ma(a->left), max(ma(a->right), a->val.F));}void split(Node* k, Node*& l, Node*& r, int c) {if(k == NULL) {l = r = NULL;}else {if(cnt(k->left) + 1 <= c) {split(k->right, k->right, r, c - cnt(k->left)-1);l = k;}else {split(k->left, l, k->left, c);r = k;}}upd(k);}void print(Node * a) {if(a == NULL) return;print(a->left);cout<<a->val.F<<' ';print(a->right);}void merge(Node*& k, Node* l, Node* r) {if(l == NULL) {k = r;}else if(r == NULL) {k = l;}else {if(l->prior < r->prior) {merge(l->right, l->right, r);k = l;}else {merge(r->left, l, r->left);k = r;}}upd(k);}int n;ll getSum(Node * k, int x, int y, int cSum) {if(k == NULL) return 0;//cout<<k->val.F<<endl;int l = cSum;int r = cSum + cnt(k) - 1;if(l > y || r < x) return 0;if(l >= x && r <= y) {return k->sum;}ll mid = cSum + cnt(k->left);ll q = getSum(k->left, x, y, cSum);ll w = getSum(k->right, x, y, cSum+cnt(k->left)+1);if(mid >= x && mid <= y) {q += k->val.F;}return q + w;}ll getMax(Node * k, int x, int y, int cSum) {if(k == NULL) return -1e18;int l = cSum;int r = cSum + cnt(k) - 1;if(l > y || r < x) return -1e18;if(l >= x && r <= y) {return k->ma;}ll mid = cSum + cnt(k->left);ll q = getMax(k->left, x, y, cSum);ll w = getMax(k->right, x, y, cSum+cnt(k->left)+1);if(mid >= x && mid <= y) {q = max(q, k->val.F);}return max(q,w);}int find(Node * a, ll sum, ll cSum, ll q) {ll pos = cSum + cnt(a->left) + 1;if(a == NULL) {return -1e9;}if(pos-2 <= q) {if(pos-2 < q && ma(a->right) >= sum) {return find(a->right, sum, cSum + cnt(a->left)+1, q);}if(a->val.F >= sum) {return cSum + cnt(a->left)+1;}return find(a->left, sum, cSum, q);}else {return find(a->left, sum, cSum, q);}}void solve() {ll sum = getSum(root, n-1, n-1, -1);int pos = n-2;int ans = 1;//cout<<"ASDASD\n";//cout<<sum<<'\n';//print(root);//cout<<endl;while(pos >= 0) {// cout<<pos<<' ';int lo = 0;int hi = pos;int best = -1;best = find(root, sum, 0, pos)-2;// cout<<sum<<' '<<pos<<' '<<best<<'\n';/*while(lo <= hi) {int mid = (lo+hi)/2;// cout<<"lol "<<mid<<' '<<getMax(root, mid, pos, -1)<<' '<<sum<<'\n';if(getMax(root, mid, pos, -1) >= sum) {lo = mid+1;best = mid;}else {hi = mid-1;}}*/// cout<<best<<'\n';// cout<<'\n';if(best == -1) break;sum = getSum(root, best+1, n-1, -1);if(getMax(root, best, best, -1) >= sum) {++ans;}sum = getSum(root, best, n-1, -1);pos = best-1;}cout<<ans<<'\n';}int findPos(Node* k, pair<ll, ll> val) {if(k == NULL) {return -1e9;}if(val <= k->val) {int q = findPos(k->right, val) + cnt(k->left) + 1;if(q < 0) {return cnt(k->left) + 1;}return q;}return findPos(k->left, val);}void insert(Node*& root, Node * a) {int pos = findPos(root, a->val);Node * t1, *t2;split(root, t1, t2, pos);merge(t1, t1, a);merge(root, t1, t2);}Node * qwe[101010];int main() {cin>>n;root = new Node({(ll)1e18, (ll)-1});root->prior = -1e18;for(int i = 0; i < n; ++i) {ll q;cin>>q;qwe[i] = new Node({(ll)q, i});insert(root, qwe[i]);}// print(root);// cout<<endl;;solve();int m;cin>>m;for(int i = 0; i< m; ++i) {ll k, f;cin>>k>>f;--k;//cout<<"QWEQWE "<<i<<'\n';int pos = findPos(root, qwe[k]->val);//cout<<pos<<'\n';Node * t1, *t2, *t3;split(root, t1, t3, pos);split(t1, t1, t2, pos-1);merge(root, t1, t3);qwe[k]->val.F = f;insert(root, qwe[k]);// print(root);// cout<<endl;;solve();}}
Test details
Test 1
Verdict: ACCEPTED
input |
---|
3 2 1 3 3 1 3 2 7 ... |
correct output |
---|
3 2 3 2 |
user output |
---|
3 2 3 2 |
Test 2
Verdict: ACCEPTED
input |
---|
7 2 14 14 15 5 2 5 5 5 2 4 12 ... |
correct output |
---|
4 3 3 3 3 ... |
user output |
---|
4 3 3 3 3 ... |
Test 3
Verdict: ACCEPTED
input |
---|
10 1 3 40 6 2 20 7 79 80 100 10 9 58 10 40 ... |
correct output |
---|
7 6 6 6 5 ... |
user output |
---|
7 6 6 6 5 ... |
Test 4
Verdict: ACCEPTED
input |
---|
10 1 3 40 6 2 20 7 79 80 100 10 9 8 10 10 ... |
correct output |
---|
7 4 4 3 2 ... |
user output |
---|
7 4 4 3 2 ... |
Test 5
Verdict: ACCEPTED
input |
---|
10 1 3 40 6 2 20 7 79 80 100 10 9 80 10 4 ... |
correct output |
---|
7 7 3 2 4 ... |
user output |
---|
7 7 3 2 4 ... |
Test 6
Verdict: ACCEPTED
input |
---|
10 1 3 100 47 95 3 2 2 24 12 10 10 56 1 52 ... |
correct output |
---|
6 4 4 4 3 ... |
user output |
---|
6 4 4 4 3 ... |
Test 7
Verdict: ACCEPTED
input |
---|
10 1 3 100 47 95 3 2 2 24 12 10 10 6 1 2 ... |
correct output |
---|
6 5 5 5 4 ... |
user output |
---|
6 5 5 5 4 ... |
Test 8
Verdict: ACCEPTED
input |
---|
10 1 3 100 47 95 3 2 2 24 12 10 10 91 2 2 ... |
correct output |
---|
6 5 5 5 4 ... |
user output |
---|
6 5 5 5 4 ... |
Test 9
Verdict: ACCEPTED
input |
---|
100 189 48 295 293 281 74 10000 10... |
correct output |
---|
2 2 2 2 2 ... |
user output |
---|
2 2 2 2 2 ... |
Test 10
Verdict: ACCEPTED
input |
---|
100 189 48 295 293 281 74 10000 10... |
correct output |
---|
2 2 2 2 2 ... |
user output |
---|
2 2 2 2 2 ... |
Test 11
Verdict: ACCEPTED
input |
---|
100 189 48 295 293 281 74 10000 10... |
correct output |
---|
2 2 2 2 2 ... |
user output |
---|
2 2 2 2 2 ... |
Test 12
Verdict: ACCEPTED
input |
---|
100 37 10000 10000 10000 137 58 10... |
correct output |
---|
5 4 4 4 3 ... |
user output |
---|
5 4 4 4 3 ... |
Test 13
Verdict: ACCEPTED
input |
---|
100 37 10000 10000 10000 137 58 10... |
correct output |
---|
5 2 2 2 2 ... |
user output |
---|
5 2 2 2 2 ... |
Test 14
Verdict: ACCEPTED
input |
---|
100 37 10000 10000 10000 137 58 10... |
correct output |
---|
5 2 2 2 2 ... |
user output |
---|
5 2 2 2 2 ... |
Test 15
Verdict: ACCEPTED
input |
---|
1000 117690 118480 116698 116498 73... |
correct output |
---|
3 3 3 3 3 ... |
user output |
---|
3 3 3 3 3 ... |
Test 16
Verdict: ACCEPTED
input |
---|
1000 117690 118480 116698 116498 73... |
correct output |
---|
3 2 2 2 2 ... |
user output |
---|
3 2 2 2 2 ... |
Test 17
Verdict: ACCEPTED
input |
---|
1000 117690 118480 116698 116498 73... |
correct output |
---|
3 2 2 2 2 ... |
user output |
---|
3 2 2 2 2 ... |
Test 18
Verdict: ACCEPTED
input |
---|
1000 1709 376 1086 1000000 3107 278... |
correct output |
---|
4 4 4 4 4 ... |
user output |
---|
4 4 4 4 4 ... |
Test 19
Verdict: ACCEPTED
input |
---|
1000 1000000 1000000 1000000 100000... |
correct output |
---|
3 2 2 3 3 ... |
user output |
---|
3 2 2 3 3 ... |
Test 20
Verdict: ACCEPTED
input |
---|
1000 2951 1970 2237 1000000 1057 25... |
correct output |
---|
3 3 3 3 3 ... |
user output |
---|
3 3 3 3 3 ... |
Test 21
Verdict: ACCEPTED
input |
---|
10000 1000000000 1000000000 5855 100... |
correct output |
---|
3 3 3 3 3 ... |
user output |
---|
3 3 3 3 3 ... |
Test 22
Verdict: ACCEPTED
input |
---|
10000 1000000000 1000000000 5855 100... |
correct output |
---|
3 2 2 2 2 ... |
user output |
---|
3 2 2 2 2 ... |
Test 23
Verdict: ACCEPTED
input |
---|
10000 1000000000 1000000000 5855 100... |
correct output |
---|
3 2 2 2 2 ... |
user output |
---|
3 2 2 2 2 ... |
Test 24
Verdict: ACCEPTED
input |
---|
10000 19032 1470 1806 23678 10000000... |
correct output |
---|
5 3 3 3 3 ... |
user output |
---|
5 3 3 3 3 ... |
Test 25
Verdict: ACCEPTED
input |
---|
10000 14039 13924 27761 8322 8912 68... |
correct output |
---|
6 6 6 6 6 ... |
user output |
---|
6 6 6 6 6 ... |
Test 26
Verdict: ACCEPTED
input |
---|
10000 14880 1000000000 1000000000 10... |
correct output |
---|
9 9 3 3 3 ... |
user output |
---|
9 9 3 3 3 ... |
Test 27
Verdict: ACCEPTED
input |
---|
50000 1000000000000 364674496414 128... |
correct output |
---|
4 4 4 4 4 ... |
user output |
---|
4 4 4 4 4 ... |
Test 28
Verdict: ACCEPTED
input |
---|
50000 1000000000000 364674496414 128... |
correct output |
---|
4 2 2 2 2 ... |
user output |
---|
4 2 2 2 2 ... |
Test 29
Verdict: ACCEPTED
input |
---|
50000 1000000000000 364674496414 128... |
correct output |
---|
4 2 3 3 2 ... |
user output |
---|
4 2 3 3 2 ... |
Test 30
Verdict: ACCEPTED
input |
---|
50000 1000000000000 60494 106399 100... |
correct output |
---|
12 11 10 10 10 ... |
user output |
---|
12 11 10 10 10 ... |
Test 31
Verdict: ACCEPTED
input |
---|
50000 137138 68579 80891 12876 12790... |
correct output |
---|
12 3 3 3 3 ... |
user output |
---|
12 3 3 3 3 ... |
Test 32
Verdict: ACCEPTED
input |
---|
50000 1000000000000 18780 1000000000... |
correct output |
---|
13 3 3 3 3 ... |
user output |
---|
13 3 3 3 3 ... |
Test 33
Verdict: ACCEPTED
input |
---|
50000 1000000000000 1000000000000 10... |
correct output |
---|
4 4 4 4 4 ... |
user output |
---|
4 4 4 4 4 ... |
Test 34
Verdict: ACCEPTED
input |
---|
50000 1000000000000 1000000000000 10... |
correct output |
---|
4 2 2 2 2 ... |
user output |
---|
4 2 2 2 2 ... |
Test 35
Verdict: ACCEPTED
input |
---|
50000 1000000000000 1000000000000 10... |
correct output |
---|
4 2 2 2 2 ... |
user output |
---|
4 2 2 2 2 ... |
Test 36
Verdict: ACCEPTED
input |
---|
50000 29257 1000000000000 11645 2409... |
correct output |
---|
14 14 14 12 12 ... |
user output |
---|
14 14 14 12 12 ... |
Test 37
Verdict: ACCEPTED
input |
---|
50000 14532 1000000000000 17273 2604... |
correct output |
---|
13 2 2 2 2 ... |
user output |
---|
13 2 2 2 2 ... |
Test 38
Verdict: ACCEPTED
input |
---|
50000 1000000000000 13888 1000000000... |
correct output |
---|
14 14 12 12 12 ... |
user output |
---|
14 14 12 12 12 ... |
Test 39
Verdict: ACCEPTED
input |
---|
50000 1000000000000 1000000000000 10... |
correct output |
---|
6 6 6 6 5 ... |
user output |
---|
6 6 6 6 5 ... |
Test 40
Verdict: ACCEPTED
input |
---|
50000 1000000000000 1000000000000 10... |
correct output |
---|
6 4 4 3 3 ... |
user output |
---|
6 4 4 3 3 ... |
Test 41
Verdict: ACCEPTED
input |
---|
50000 1000000000000 1000000000000 10... |
correct output |
---|
6 3 3 3 3 ... |
user output |
---|
6 3 3 3 3 ... |
Test 42
Verdict: ACCEPTED
input |
---|
50000 1000000000000 1000000000000 10... |
correct output |
---|
28 25 25 25 25 ... |
user output |
---|
28 25 25 25 25 ... |
Test 43
Verdict: ACCEPTED
input |
---|
50000 1 1 1 1 1 1 1 1000000000000 1 ... |
correct output |
---|
27 2 2 2 2 ... |
user output |
---|
27 2 2 2 2 ... |
Test 44
Verdict: ACCEPTED
input |
---|
50000 1000000000000 1000000000000 10... |
correct output |
---|
27 24 22 22 7 ... |
user output |
---|
27 24 22 22 7 ... |
Test 45
Verdict: ACCEPTED
input |
---|
50000 100000 100000 100000 100000 10... |
correct output |
---|
2 2 2 2 2 ... |
user output |
---|
2 2 2 2 2 ... |
Test 46
Verdict: ACCEPTED
input |
---|
50000 100000 100000 100000 100000 10... |
correct output |
---|
2 2 2 2 2 ... |
user output |
---|
2 2 2 2 2 ... |
Test 47
Verdict: ACCEPTED
input |
---|
50000 100000 100000 100000 100000 10... |
correct output |
---|
2 2 2 2 2 ... |
user output |
---|
2 2 2 2 2 ... |
Test 48
Verdict: ACCEPTED
input |
---|
50000 100000 100000 100000 100000 10... |
correct output |
---|
2 2 2 2 2 ... |
user output |
---|
2 2 2 2 2 ... |
Test 49
Verdict: ACCEPTED
input |
---|
50000 722 100000 100000 5989 100000 ... |
correct output |
---|
2 2 2 2 2 ... |
user output |
---|
2 2 2 2 2 ... |
Test 50
Verdict: ACCEPTED
input |
---|
50000 9132 100000 100000 100000 3077... |
correct output |
---|
2 2 2 2 2 ... |
user output |
---|
2 2 2 2 2 ... |
Test 51
Verdict: ACCEPTED
input |
---|
100000 1000000000000 1000000000000 10... |
correct output |
---|
5 5 5 5 5 ... |
user output |
---|
5 5 5 5 5 ... |
Test 52
Verdict: ACCEPTED
input |
---|
100000 1000000000000 1000000000000 10... |
correct output |
---|
5 2 2 2 2 ... |
user output |
---|
5 2 2 2 2 ... |
Test 53
Verdict: ACCEPTED
input |
---|
100000 1000000000000 1000000000000 10... |
correct output |
---|
5 2 2 2 2 ... |
user output |
---|
5 2 2 2 2 ... |
Test 54
Verdict: ACCEPTED
input |
---|
100000 12649 85081 263931 249102 9739... |
correct output |
---|
10 6 6 6 6 ... |
user output |
---|
10 6 6 6 6 ... |
Test 55
Verdict: ACCEPTED
input |
---|
100000 1000000000000 113645 43822 250... |
correct output |
---|
10 3 3 3 3 ... |
user output |
---|
10 3 3 3 3 ... |
Test 56
Verdict: ACCEPTED
input |
---|
100000 1000000000000 1000000000000 10... |
correct output |
---|
11 3 3 3 3 ... |
user output |
---|
11 3 3 3 3 ... |
Test 57
Verdict: ACCEPTED
input |
---|
100000 1000000000000 1000000000000 10... |
correct output |
---|
5 5 5 5 5 ... |
user output |
---|
5 5 5 5 5 ... |
Test 58
Verdict: ACCEPTED
input |
---|
100000 1000000000000 1000000000000 10... |
correct output |
---|
5 2 2 2 2 ... |
user output |
---|
5 2 2 2 2 ... |
Test 59
Verdict: ACCEPTED
input |
---|
100000 1000000000000 1000000000000 10... |
correct output |
---|
5 5 5 5 2 ... |
user output |
---|
5 5 5 5 2 ... |
Test 60
Verdict: ACCEPTED
input |
---|
100000 41613 13664 63607 100000000000... |
correct output |
---|
11 11 11 10 10 ... |
user output |
---|
11 11 11 10 10 ... |
Test 61
Verdict: ACCEPTED
input |
---|
100000 1000000000000 40692 1000000000... |
correct output |
---|
11 2 2 2 2 ... |
user output |
---|
11 2 2 2 2 ... |
Test 62
Verdict: ACCEPTED
input |
---|
100000 1000000000000 1000000000000 10... |
correct output |
---|
12 8 2 2 2 ... |
user output |
---|
12 8 2 2 2 ... |
Test 63
Verdict: ACCEPTED
input |
---|
100000 1000000000000 1000000000000 10... |
correct output |
---|
5 5 5 5 5 ... |
user output |
---|
5 5 5 5 5 ... |
Test 64
Verdict: ACCEPTED
input |
---|
100000 1000000000000 1000000000000 10... |
correct output |
---|
5 3 3 3 3 ... |
user output |
---|
5 3 3 3 3 ... |
Test 65
Verdict: ACCEPTED
input |
---|
100000 1000000000000 1000000000000 10... |
correct output |
---|
5 5 3 3 3 ... |
user output |
---|
5 5 3 3 3 ... |
Test 66
Verdict: ACCEPTED
input |
---|
100000 1 1 1 1 1 1 1 1000000000000 1 ... |
correct output |
---|
27 25 25 25 25 ... |
user output |
---|
27 25 25 25 25 ... |
Test 67
Verdict: ACCEPTED
input |
---|
100000 1 1 1000000000000 100000000000... |
correct output |
---|
26 6 6 5 3 ... |
user output |
---|
26 6 6 5 3 ... |
Test 68
Verdict: ACCEPTED
input |
---|
100000 1000000000000 1000000000000 1 ... |
correct output |
---|
26 5 5 5 5 ... |
user output |
---|
26 5 5 5 5 ... |
Test 69
Verdict: ACCEPTED
input |
---|
100000 279 1623 100000 100000 100000 ... |
correct output |
---|
3 3 3 3 3 ... |
user output |
---|
3 3 3 3 3 ... |
Test 70
Verdict: ACCEPTED
input |
---|
100000 279 1623 100000 100000 100000 ... |
correct output |
---|
3 3 3 3 3 ... |
user output |
---|
3 3 3 3 3 ... |
Test 71
Verdict: ACCEPTED
input |
---|
100000 279 1623 100000 100000 100000 ... |
correct output |
---|
3 3 3 3 3 ... |
user output |
---|
3 3 3 3 3 ... |
Test 72
Verdict: ACCEPTED
input |
---|
100000 8815 100000 100000 100000 1000... |
correct output |
---|
2 2 2 2 2 ... |
user output |
---|
2 2 2 2 2 ... |
Test 73
Verdict: ACCEPTED
input |
---|
100000 20748 100000 100000 20644 1000... |
correct output |
---|
2 2 2 2 2 ... |
user output |
---|
2 2 2 2 2 ... |
Test 74
Verdict: ACCEPTED
input |
---|
100000 21734 6649 26577 100000 8081 5... |
correct output |
---|
2 2 2 2 2 ... |
user output |
---|
2 2 2 2 2 ... |