bzoj1149: [CTSC2007]风玲Mobiles

咳，这是道水题，我不想多说。。

太弱太弱，做了这么久

 

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <iostream>
#include <algorithm>
#include <vector>
#include <deque>
#include <map>
#include <stack>
#include <queue>
typedef long long LL;
typedef double DB;
typedef unsigned US;
typedef long double LDB;
#define For(i, a, b) for(int i = (a); i <= (b); i++)
#define Ford(i, a, b) for(int i = (a); i >= (b); i--)
#define Rep(i, a) for(int i = (0); i < (a); i++)
#define Repn(i, a) for(int i = ((a) - 1); i >= 0; i--)
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define repn(i, a, b) for(int i = ((a) - 1); i >= (b); i--)
#define FU(i, t) for(__typeof((t).begin()) i = (t).begin(); i != (t).end(); i++)
#define FD(i, t) for(__typeof((t).rbegin()) i = (t).rbegin(); i != (t).rend(); i++)
#define pi (3.141592653589793238)
#define MIT (2147483647)
#define INF (1000000000)
#define MLL (1000000000000000000LL)
#define ft first
#define sd second
#define mk make_pair
#define clr(a, x) (memset((a), (x), sizeof(a)))
#define sma_let(x) (((x) >= 'a') && ((x) <= 'z'))
#define big_let(x) (((x) >= 'A') && ((x) <= 'Z'))
#define let(x) ((sma_let(x)) || (big_let(x)))
#define puf push_front
#define pub push_back
#define pof pop_front
#define pob pop_back
#define sqr(x) ((x) * (x))
#define sz(x) ((int) (x).size())
#define all(x) (x).begin(), (x).end()
using namespace std;
inline void SETIO(string name) {
	string In = name + ".in", Out = name + ".out";
	freopen(In.c_str(), "r", stdin), freopen(Out.c_str(), "w", stdout);
}

const int N = 100001;
int n;
int Dat[N][2], Min[N], Max[N], Ans;

inline void Input() {
	scanf("%d", &n);
	For(i, 1, n) scanf("%d %d", &Dat[i][0], &Dat[i][1]);
}

inline void Solve() {
	bool Flag = 0;
		
	Ford(i, n, 1) {
		int C[2], H[2];
		if(Dat[i][0] == -1) C[0] = H[0] = 0;
		else C[0] = Min[Dat[i][0]], H[0] = Max[Dat[i][0]];
		if(Dat[i][1] == -1) C[1] = H[1] = 0;
		else C[1] = Min[Dat[i][1]], H[1] = Max[Dat[i][1]];
		Min[i] = min(C[0], C[1]) + 1, Max[i] = max(H[0], H[1]) + 1;
		if(Max[i] - Min[i] > 1) Flag = 1;
		if(H[0] < H[1] || C[0] < C[1]) swap(C[0], C[1]), swap(H[0], H[1]), ++Ans;
		if(H[1] > C[0]) Flag = 1;
		if(Flag) break;
	}
	
	printf("%d\n", Flag ? -1 : Ans);
}

int main() {
	#ifndef ONLINE_JUDGE
	SETIO("1149");
	#endif
	Input();
	Solve();
	return 0;
}