Task: | Mobiles |
Sender: | Yytsi |
Submission time: | 2019-03-07 18:16:09 +0200 |
Language: | C++ |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 100 |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.01 s | details |
#2 | ACCEPTED | 0.01 s | details |
#3 | ACCEPTED | 0.01 s | details |
#4 | ACCEPTED | 0.02 s | details |
#5 | ACCEPTED | 0.02 s | details |
#6 | ACCEPTED | 0.01 s | details |
#7 | ACCEPTED | 0.03 s | details |
#8 | ACCEPTED | 0.04 s | details |
#9 | ACCEPTED | 0.01 s | details |
#10 | ACCEPTED | 0.02 s | details |
#11 | ACCEPTED | 0.02 s | details |
#12 | ACCEPTED | 0.02 s | details |
#13 | ACCEPTED | 0.03 s | details |
#14 | ACCEPTED | 0.01 s | details |
#15 | ACCEPTED | 0.01 s | details |
#16 | ACCEPTED | 0.02 s | details |
#17 | ACCEPTED | 0.02 s | details |
#18 | ACCEPTED | 0.02 s | details |
#19 | ACCEPTED | 0.02 s | details |
#20 | ACCEPTED | 0.02 s | details |
#21 | ACCEPTED | 0.02 s | details |
#22 | ACCEPTED | 0.01 s | details |
#23 | ACCEPTED | 0.03 s | details |
#24 | ACCEPTED | 0.02 s | details |
#25 | ACCEPTED | 0.05 s | details |
#26 | ACCEPTED | 0.01 s | details |
#27 | ACCEPTED | 0.02 s | details |
#28 | ACCEPTED | 0.02 s | details |
#29 | ACCEPTED | 0.03 s | details |
#30 | ACCEPTED | 0.02 s | details |
#31 | ACCEPTED | 0.03 s | details |
#32 | ACCEPTED | 0.03 s | details |
#33 | ACCEPTED | 0.04 s | details |
#34 | ACCEPTED | 0.05 s | details |
#35 | ACCEPTED | 0.05 s | details |
#36 | ACCEPTED | 0.05 s | details |
#37 | ACCEPTED | 0.05 s | details |
#38 | ACCEPTED | 0.04 s | details |
#39 | ACCEPTED | 0.05 s | details |
#40 | ACCEPTED | 0.05 s | details |
#41 | ACCEPTED | 0.06 s | details |
#42 | ACCEPTED | 0.03 s | details |
Code
#include <bits/stdc++.h> using namespace std; #define FOR(i, a, b) for (int i=a; i<(b); i++) #define IO ios_base::sync_with_stdio(0); cin.tie(0) #define F first #define S second #define pb push_back typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; #define N 201010 int n; pii minimax[N]; pii children[N]; bool star[N]; void qaq() { cout<<"-1\n"; exit(0); } int res = 0; void swap_at(int x) { //cout<<"swap at: "<<x<<"\n"; res++; //swap(minimax[x].F, minimax[x].S); //swap(minimax[children[x].F], minimax[children[x].S]); } int dmin = 9999999, dmax = -9999999; void f(int x, int d) { if (star[x]) { //cout<<"minimax["<<x<<"] = "<<d<<" "<<d<<"\n"; dmin = min(dmin, d); dmax = max(dmax, d); minimax[x] = {d, d}; return; } int l = children[x].F, r = children[x].S; int lmin = 9999999, lmax = -9999999, rmin = 9999999, rmax = -9999999; f(l, d+1); f(r, d+1); minimax[x].F = min(minimax[l].F, minimax[r].F); minimax[x].S = max(minimax[l].S, minimax[r].S); lmin = minimax[l].F; lmax = minimax[l].S; rmin = minimax[r].F; rmax = minimax[r].S; //cout<<"at "<<x<<" {"<<lmin<<","<<lmax<<"} {"<<rmin<<","<<rmax<<"}\n"; bool left_diff = abs(lmin - lmax) > 0; bool right_diff = abs(rmin - rmax) > 0; if (left_diff && right_diff) { //cout<<"kvaak\n"; qaq(); } if (left_diff && !right_diff) { int rball = rmin; if (lmin == rball) return; if (lmin < rball) { swap_at(x); return; } } if (!left_diff && right_diff) { int lball = lmin; if (rmin < lball) return; if (rmin == lball) { swap_at(x); return; } } // 2. if (lmin < rmax) { swap_at(x); return; } } int main() { IO; cin>>n; int cur_id = n+1; FOR(x,1,n+1) { int l, r; cin>>l>>r; if (l == -1) { l = cur_id; star[l] = true; cur_id++; } if (r == -1) { r = cur_id; star[r] = true; cur_id++; } children[x] = {l, r}; } f(1,0); if (dmax - dmin > 1) qaq(); cout<<res<<"\n"; }
Test details
Test 1
Verdict: ACCEPTED
input |
---|
1 -1 -1 |
correct output |
---|
0 |
user output |
---|
0 |
Test 2
Verdict: ACCEPTED
input |
---|
2 2 -1 -1 -1 |
correct output |
---|
0 |
user output |
---|
0 |
Test 3
Verdict: ACCEPTED
input |
---|
2 -1 2 -1 -1 |
correct output |
---|
1 |
user output |
---|
1 |
Test 4
Verdict: ACCEPTED
input |
---|
4 2 3 4 -1 -1 -1 -1 -1 |
correct output |
---|
0 |
user output |
---|
0 |
Test 5
Verdict: ACCEPTED
input |
---|
4 2 3 -1 4 -1 -1 -1 -1 |
correct output |
---|
1 |
user output |
---|
1 |
Test 6
Verdict: ACCEPTED
input |
---|
4 2 3 -1 -1 4 -1 -1 -1 |
correct output |
---|
1 |
user output |
---|
1 |
Test 7
Verdict: ACCEPTED
input |
---|
4 2 3 -1 -1 -1 4 -1 -1 |
correct output |
---|
2 |
user output |
---|
2 |
Test 8
Verdict: ACCEPTED
input |
---|
5 2 3 4 5 -1 -1 -1 -1 ... |
correct output |
---|
0 |
user output |
---|
0 |
Test 9
Verdict: ACCEPTED
input |
---|
5 2 3 4 -1 5 -1 -1 -1 ... |
correct output |
---|
-1 |
user output |
---|
-1 |
Test 10
Verdict: ACCEPTED
input |
---|
5 2 3 4 -1 -1 5 -1 -1 ... |
correct output |
---|
-1 |
user output |
---|
-1 |
Test 11
Verdict: ACCEPTED
input |
---|
5 2 3 -1 4 5 -1 -1 -1 ... |
correct output |
---|
-1 |
user output |
---|
-1 |
Test 12
Verdict: ACCEPTED
input |
---|
5 2 3 -1 4 -1 5 -1 -1 ... |
correct output |
---|
-1 |
user output |
---|
-1 |
Test 13
Verdict: ACCEPTED
input |
---|
5 2 3 -1 -1 4 5 -1 -1 ... |
correct output |
---|
1 |
user output |
---|
1 |
Test 14
Verdict: ACCEPTED
input |
---|
6 2 3 4 5 6 -1 -1 -1 ... |
correct output |
---|
0 |
user output |
---|
0 |
Test 15
Verdict: ACCEPTED
input |
---|
6 2 3 4 5 -1 6 -1 -1 ... |
correct output |
---|
1 |
user output |
---|
1 |
Test 16
Verdict: ACCEPTED
input |
---|
6 2 3 4 -1 5 6 -1 -1 ... |
correct output |
---|
1 |
user output |
---|
1 |
Test 17
Verdict: ACCEPTED
input |
---|
6 2 3 -1 4 5 6 -1 -1 ... |
correct output |
---|
2 |
user output |
---|
2 |
Test 18
Verdict: ACCEPTED
input |
---|
19 2 3 6 5 4 7 -1 -1 ... |
correct output |
---|
-1 |
user output |
---|
-1 |
Test 19
Verdict: ACCEPTED
input |
---|
9 3 2 4 5 -1 -1 6 9 ... |
correct output |
---|
-1 |
user output |
---|
-1 |
Test 20
Verdict: ACCEPTED
input |
---|
4 -1 2 3 4 -1 -1 -1 -1 |
correct output |
---|
-1 |
user output |
---|
-1 |
Test 21
Verdict: ACCEPTED
input |
---|
12 3 2 4 5 -1 6 7 9 ... |
correct output |
---|
-1 |
user output |
---|
-1 |
Test 22
Verdict: ACCEPTED
input |
---|
10 3 2 7 5 4 6 8 10 ... |
correct output |
---|
-1 |
user output |
---|
-1 |
Test 23
Verdict: ACCEPTED
input |
---|
1000 2 -1 -1 3 4 -1 5 -1 ... |
correct output |
---|
-1 |
user output |
---|
-1 |
Test 24
Verdict: ACCEPTED
input |
---|
10000 2 -1 -1 3 4 -1 5 -1 ... |
correct output |
---|
-1 |
user output |
---|
-1 |
Test 25
Verdict: ACCEPTED
input |
---|
100000 2 -1 -1 3 4 -1 5 -1 ... |
correct output |
---|
-1 |
user output |
---|
-1 |
Test 26
Verdict: ACCEPTED
input |
---|
10 2 3 6 5 7 4 -1 -1 ... |
correct output |
---|
2 |
user output |
---|
2 |
Test 27
Verdict: ACCEPTED
input |
---|
18 2 3 7 6 5 4 11 9 ... |
correct output |
---|
3 |
user output |
---|
3 |
Test 28
Verdict: ACCEPTED
input |
---|
13 3 2 4 5 7 6 -1 -1 ... |
correct output |
---|
-1 |
user output |
---|
-1 |
Test 29
Verdict: ACCEPTED
input |
---|
660 3 2 5 6 7 4 10 8 ... |
correct output |
---|
-1 |
user output |
---|
-1 |
Test 30
Verdict: ACCEPTED
input |
---|
1250 2 3 6 7 5 4 10 14 ... |
correct output |
---|
7 |
user output |
---|
7 |
Test 31
Verdict: ACCEPTED
input |
---|
5000 2 3 6 7 5 4 11 14 ... |
correct output |
---|
4 |
user output |
---|
4 |
Test 32
Verdict: ACCEPTED
input |
---|
32767 2 3 5 4 7 6 13 14 ... |
correct output |
---|
0 |
user output |
---|
0 |
Test 33
Verdict: ACCEPTED
input |
---|
100000 2 3 5 7 4 6 15 14 ... |
correct output |
---|
7 |
user output |
---|
7 |
Test 34
Verdict: ACCEPTED
input |
---|
98348 3 2 7 5 6 4 10 8 ... |
correct output |
---|
-1 |
user output |
---|
-1 |
Test 35
Verdict: ACCEPTED
input |
---|
100000 2 3 5 7 4 6 15 14 ... |
correct output |
---|
7 |
user output |
---|
7 |
Test 36
Verdict: ACCEPTED
input |
---|
99999 3 2 7 5 6 4 10 8 ... |
correct output |
---|
5 |
user output |
---|
5 |
Test 37
Verdict: ACCEPTED
input |
---|
98348 3 2 7 5 6 4 10 8 ... |
correct output |
---|
-1 |
user output |
---|
-1 |
Test 38
Verdict: ACCEPTED
input |
---|
98303 3 2 5 4 7 6 9 8 ... |
correct output |
---|
1 |
user output |
---|
1 |
Test 39
Verdict: ACCEPTED
input |
---|
98304 3 2 5 4 7 6 9 8 ... |
correct output |
---|
16 |
user output |
---|
16 |
Test 40
Verdict: ACCEPTED
input |
---|
99989 3 2 5 4 7 6 9 8 ... |
correct output |
---|
15 |
user output |
---|
15 |
Test 41
Verdict: ACCEPTED
input |
---|
99989 2 3 4 5 6 7 8 9 ... |
correct output |
---|
15 |
user output |
---|
15 |
Test 42
Verdict: ACCEPTED
input |
---|
100000 3 2 5 4 7 6 9 8 ... |
correct output |
---|
16 |
user output |
---|
16 |