Mobiles

input/code.cpp: In function 'void f(int, int)':
input/code.cpp:34:12: warning: array subscript is below array bounds [-Warray-bounds]
   minimax[l].F = d + 1;
   ~~~~~~~~~^
input/code.cpp:35:12: warning: array subscript is below array bounds [-Warray-bounds]
   minimax[l].S = d + 1;
   ~~~~~~~~~^
input/code.cpp:42:12: warning: array subscript is below array bounds [-Warray-bounds]
   minimax[r].F = d + 1;
   ~~~~~~~~~^
input/code.cpp:43:12: warning: array subscript is below array bounds [-Warray-bounds]
   minimax[r].S = d + 1;
   ~~~~~~~~~^

// Tässä on varmaan 5x pikkuvirhettä ja korjattavaa




#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 101010
int n;
bool star[N];
pii minimax[N];
pii children[N];

void qaq() { cout<<"-1\n"; exit(0); }
int res = 0;

void f(int x, int d) {
	int l = children[x].F, r = children[x].S;
	int lmin = 999, lmax = 0, rmin = 999, rmax = 0;

	if (l == -1) {
		int l_depth = d + 1;
		lmin = l_depth;
		lmax = l_depth;
		minimax[l].F = d + 1;
		minimax[l].S = d + 1;
	} else f(l, d+1);

	if (r == -1) {
		int r_depth = d + 1;
		rmin = r_depth;
		rmax = r_depth;
		minimax[r].F = d + 1;
		minimax[r].S = d + 1;
	} else f(r, d+1);

	minimax[x] = {min(minimax[l].F, lmin), max(minimax[r].S, rmax)};
	lmin = min(lmin, minimax[l].F);
	lmax = max(lmax, minimax[l].S);
	rmin = min(rmin, minimax[r].F);
	rmax = max(rmax, minimax[r].S);

	//cout<<"at "<<x<<" {"<<lmin<<","<<lmax<<"} {"<<rmin<<","<<rmax<<"}\n";

	if (abs(lmin - lmax) > 1) {
		qaq();
	}
	if (abs(rmin - rmax) > 1) {
		qaq();
	}

	if (abs(lmin - rmax) > 1) {
		qaq();
	}
	if (abs(lmin - rmin) > 1) {
		qaq();
	}
	if (abs(lmax - rmin) > 1) {
		qaq();
	}
	if (abs(lmax - rmax) > 1) {
		qaq();
	}

	bool left_diff = abs(lmin - lmax) > 0;
	bool right_diff = abs(rmin - rmax) > 0;

	// 1.
	if (left_diff && right_diff) qaq();

	// 6.
	if (!left_diff && !right_diff) return;
	
	if (!right_diff) {
		// 2.
		if ((lmax == rmax) && (lmin < rmax)) {
			res++;
			return;
		}

		// 4.
		if (!left_diff) {
			if (lmax > rmin) return;

			// 5.
			if (lmin < rmax) {
				res++;
				return;
			}
		}
	}

	if (!left_diff) {
		// 3.
		if ((rmax == lmax) && (rmin < rmax)) return;
	}
	
}

int main() {
	IO; cin>>n;
	FOR(x,1,n+1) {
		int l, r; cin>>l>>r;
		children[x] = {l, r};
	}

	f(1,0);
	cout<<res<<"\n";
} 

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: WRONG ANSWER

Test 28

Verdict: ACCEPTED

Test 29

Verdict: ACCEPTED

Test 30

Verdict: WRONG ANSWER

Test 31

Verdict: WRONG ANSWER

Test 32

Verdict: ACCEPTED

Test 33

Verdict: WRONG ANSWER

Test 34

Verdict: ACCEPTED

Test 35

Verdict: WRONG ANSWER

Test 36

Verdict: WRONG ANSWER

Test 37

Verdict: ACCEPTED

Test 38

Verdict: WRONG ANSWER

Test 39

Verdict: WRONG ANSWER

Test 40

Verdict: WRONG ANSWER

Test 41

Verdict: WRONG ANSWER

Test 42

Verdict: WRONG ANSWER