CSES - APIO 2007

CSES - APIO 2007 - Results

Submission details
Task:	Mobiles
Sender:	ollpu
Submission time:	2019-03-07 14:31:34 +0200
Language:	C++
Status:	READY
Result:	100

Feedback
group	verdict	score
#1	ACCEPTED	100

Test results
test	verdict	time
#1	ACCEPTED	0.02 s	details
#2	ACCEPTED	0.01 s	details
#3	ACCEPTED	0.03 s	details
#4	ACCEPTED	0.02 s	details
#5	ACCEPTED	0.02 s	details
#6	ACCEPTED	0.02 s	details
#7	ACCEPTED	0.02 s	details
#8	ACCEPTED	0.02 s	details
#9	ACCEPTED	0.03 s	details
#10	ACCEPTED	0.02 s	details
#11	ACCEPTED	0.02 s	details
#12	ACCEPTED	0.01 s	details
#13	ACCEPTED	0.03 s	details
#14	ACCEPTED	0.02 s	details
#15	ACCEPTED	0.02 s	details
#16	ACCEPTED	0.02 s	details
#17	ACCEPTED	0.02 s	details
#18	ACCEPTED	0.01 s	details
#19	ACCEPTED	0.02 s	details
#20	ACCEPTED	0.02 s	details
#21	ACCEPTED	0.02 s	details
#22	ACCEPTED	0.02 s	details
#23	ACCEPTED	0.02 s	details
#24	ACCEPTED	0.03 s	details
#25	ACCEPTED	0.04 s	details
#26	ACCEPTED	0.03 s	details
#27	ACCEPTED	0.01 s	details
#28	ACCEPTED	0.03 s	details
#29	ACCEPTED	0.02 s	details
#30	ACCEPTED	0.02 s	details
#31	ACCEPTED	0.02 s	details
#32	ACCEPTED	0.02 s	details
#33	ACCEPTED	0.05 s	details
#34	ACCEPTED	0.04 s	details
#35	ACCEPTED	0.04 s	details
#36	ACCEPTED	0.05 s	details
#37	ACCEPTED	0.06 s	details
#38	ACCEPTED	0.04 s	details
#39	ACCEPTED	0.04 s	details
#40	ACCEPTED	0.04 s	details
#41	ACCEPTED	0.05 s	details
#42	ACCEPTED	0.05 s	details

Code

#include <bits/stdc++.h>
using namespace std;
const int N = 101010;
int l[N], r[N];
int mal = -1, mil = 1e9;
bool pos = 1;
void h1(int i, int cd=0) {
  if (i == -2) {
    mal = max(mal, cd);
    mil = min(mil, cd);
    return;
  }
  h1(l[i], cd+1);
  h1(r[i], cd+1);
}
void h1_(int i, int cd=0) {
  if (cd == mil-1) {
    if (l[i] != -2) l[i] = -1;
    if (r[i] != -2) r[i] = -1;
    return;
  }
  h1_(l[i], cd+1);
  h1_(r[i], cd+1);
}
#define F first
#define S second
int res = 0;
pair<int, bool> h2(int i) {
  if (i < 0) return {i == -2, i == -2};
  auto lv = h2(l[i]);
  auto rv = h2(r[i]);
  if (lv.F > rv.F) {
    res++; swap(lv, rv);
  }
  if (lv.F && !rv.S) pos = 0;
  return {lv.F + rv.F, lv.S && rv.S};
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  if (n == 1) {
    cout << 0 << endl;
    return 0;
  }
  for (int i = 0; i < n; ++i) {
    cin >> l[i] >> r[i];
    l[i]--; r[i]--;
  }
  h1(0);
  if (mal-mil > 1) {
    cout << -1 << endl;
    return 0;
  }
  h1_(0);
  h2(0);
  if (!pos) {
    cout << -1 << endl;
    return 0;
  }
  cout << res << endl;
}

Test details

Test 1

Verdict: ACCEPTED

input
`1 -1 -1` view save

correct output
`0` view save

user output
`0` view save

Test 2

Verdict: ACCEPTED

input
`2 2 -1 -1 -1` view save

correct output
`0` view save

user output
`0` view save

Test 3

Verdict: ACCEPTED

input
`2 -1 2 -1 -1` view save

correct output
`1` view save

user output
`1` view save

Test 4

Verdict: ACCEPTED

input
`4 2 3 4 -1 -1 -1 -1 -1` view save

correct output
`0` view save

user output
`0` view save

Test 5

Verdict: ACCEPTED

input
`4 2 3 -1 4 -1 -1 -1 -1` view save

correct output
`1` view save

user output
`1` view save

Test 6

Verdict: ACCEPTED

input
`4 2 3 -1 -1 4 -1 -1 -1` view save

correct output
`1` view save

user output
`1` view save

Test 7

Verdict: ACCEPTED

input
`4 2 3 -1 -1 -1 4 -1 -1` view save

correct output
`2` view save

user output
`2` view save

Test 8

Verdict: ACCEPTED

input
`5 2 3 4 5 -1 -1 -1 -1 ...` view save

correct output
`0` view save

user output
`0` view save

Test 9

Verdict: ACCEPTED

input
`5 2 3 4 -1 5 -1 -1 -1 ...` view save

correct output
`-1` view save

user output
`-1` view save

Test 10

Verdict: ACCEPTED

input
`5 2 3 4 -1 -1 5 -1 -1 ...` view save

correct output
`-1` view save

user output
`-1` view save

Test 11

Verdict: ACCEPTED

input
`5 2 3 -1 4 5 -1 -1 -1 ...` view save

correct output
`-1` view save

user output
`-1` view save

Test 12

Verdict: ACCEPTED

input
`5 2 3 -1 4 -1 5 -1 -1 ...` view save

correct output
`-1` view save

user output
`-1` view save

Test 13

Verdict: ACCEPTED

input
`5 2 3 -1 -1 4 5 -1 -1 ...` view save

correct output
`1` view save

user output
`1` view save

Test 14

Verdict: ACCEPTED

input
`6 2 3 4 5 6 -1 -1 -1 ...` view save

correct output
`0` view save

user output
`0` view save

Test 15

Verdict: ACCEPTED

input
`6 2 3 4 5 -1 6 -1 -1 ...` view save

correct output
`1` view save

user output
`1` view save

Test 16

Verdict: ACCEPTED

input
`6 2 3 4 -1 5 6 -1 -1 ...` view save

correct output
`1` view save

user output
`1` view save

Test 17

Verdict: ACCEPTED

input
`6 2 3 -1 4 5 6 -1 -1 ...` view save

correct output
`2` view save

user output
`2` view save

Test 18

Verdict: ACCEPTED

input
`19 2 3 6 5 4 7 -1 -1 ...` view save

correct output
`-1` view save

user output
`-1` view save

Test 19

Verdict: ACCEPTED

input
`9 3 2 4 5 -1 -1 6 9 ...` view save

correct output
`-1` view save

user output
`-1` view save

Test 20

Verdict: ACCEPTED

input
`4 -1 2 3 4 -1 -1 -1 -1` view save

correct output
`-1` view save

user output
`-1` view save

Test 21

Verdict: ACCEPTED

input
`12 3 2 4 5 -1 6 7 9 ...` view save

correct output
`-1` view save

user output
`-1` view save

Test 22

Verdict: ACCEPTED

input
`10 3 2 7 5 4 6 8 10 ...` view save

correct output
`-1` view save

user output
`-1` view save

Test 23

Verdict: ACCEPTED

input
`1000 2 -1 -1 3 4 -1 5 -1 ...` view save

correct output
`-1` view save

user output
`-1` view save

Test 24

Verdict: ACCEPTED

input
`10000 2 -1 -1 3 4 -1 5 -1 ...` view save

correct output
`-1` view save

user output
`-1` view save

Test 25

Verdict: ACCEPTED

input
`100000 2 -1 -1 3 4 -1 5 -1 ...` view save

correct output
`-1` view save

user output
`-1` view save

Test 26

Verdict: ACCEPTED

input
`10 2 3 6 5 7 4 -1 -1 ...` view save

correct output
`2` view save

user output
`2` view save

Test 27

Verdict: ACCEPTED

input
`18 2 3 7 6 5 4 11 9 ...` view save

correct output
`3` view save

user output
`3` view save

Test 28

Verdict: ACCEPTED

input
`13 3 2 4 5 7 6 -1 -1 ...` view save

correct output
`-1` view save

user output
`-1` view save

Test 29

Verdict: ACCEPTED

input
`660 3 2 5 6 7 4 10 8 ...` view save

correct output
`-1` view save

user output
`-1` view save

Test 30

Verdict: ACCEPTED

input
`1250 2 3 6 7 5 4 10 14 ...` view save

correct output
`7` view save

user output
`7` view save

Test 31

Verdict: ACCEPTED

input
`5000 2 3 6 7 5 4 11 14 ...` view save

correct output
`4` view save

user output
`4` view save

Test 32

Verdict: ACCEPTED

input
`32767 2 3 5 4 7 6 13 14 ...` view save

correct output
`0` view save

user output
`0` view save

Test 33

Verdict: ACCEPTED

input
`100000 2 3 5 7 4 6 15 14 ...` view save

correct output
`7` view save

user output
`7` view save

Test 34

Verdict: ACCEPTED

input
`98348 3 2 7 5 6 4 10 8 ...` view save

correct output
`-1` view save

user output
`-1` view save

Test 35

Verdict: ACCEPTED

input
`100000 2 3 5 7 4 6 15 14 ...` view save

correct output
`7` view save

user output
`7` view save

Test 36

Verdict: ACCEPTED

input
`99999 3 2 7 5 6 4 10 8 ...` view save

correct output
`5` view save

user output
`5` view save

Test 37

Verdict: ACCEPTED

input
`98348 3 2 7 5 6 4 10 8 ...` view save

correct output
`-1` view save

user output
`-1` view save

Test 38

Verdict: ACCEPTED

input
`98303 3 2 5 4 7 6 9 8 ...` view save

correct output
`1` view save

user output
`1` view save

Test 39

Verdict: ACCEPTED

input
`98304 3 2 5 4 7 6 9 8 ...` view save

correct output
`16` view save

user output
`16` view save

Test 40

Verdict: ACCEPTED

input
`99989 3 2 5 4 7 6 9 8 ...` view save

correct output
`15` view save

user output
`15` view save

Test 41

Verdict: ACCEPTED

input
`99989 2 3 4 5 6 7 8 9 ...` view save

correct output
`15` view save

user output
`15` view save

Test 42

Verdict: ACCEPTED

input
`100000 3 2 5 4 7 6 9 8 ...` view save

correct output
`16` view save

user output
`16` view save

APIO 2007

Mobiles

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Test 40

Test 41

Test 42

Tasks

Submissions (ollpu)