【题解】9.26模拟赛T1

首先发现一个点，答案要么是$2n-2$，要么是$-1$
接下来就是判断是否能走到终点

我给出一种不同于$std$的神奇做法
我逐行的处理每行能到达那些点，显然这些点可以构成一些区间
到底怎么处理呢，请看我的图
（以下，黄色代表背景，红色代表可以到达之地，绿色代表障碍）





等等等等

对于这一行的所有区间通过这一行的所有障碍点求出下一行的可行区间
具体怎么实现呢，就是模拟啦

然后注意一些细节

• 中间有空行的话，可行区间向右扩散到$n$
• 第一行和最后一行单独处理
• 开$longlong$？

Code：

#include <bits/stdc++.h>
#define maxn 100010
#define int long long
using namespace std;
struct node{
	int x, y;
}a[maxn];
struct Line{
	int l, r;
}s[maxn];
int n, m, b[maxn], flag[maxn], c[maxn];

inline int read(){
	int s = 0, w = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
	for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
	return s * w;
}

bool cmp(node x, node y){ return x.x == y.x ? x.y < y.y : x.x < y.x; }

//void print(int num){
//	for (int i = 1; i <= num; ++i) printf("[%d, %d] ", s[i].l, s[i].r);
//	puts("");
//}

//void Print(int num){
//	for (int i = 1; i <= num; ++i) printf("%d ", b[i]);
//	puts("");
//}

void work(){
	for (int i = 1; i <= m; ++i) scanf("%lld%lld", &a[i].x, &a[i].y);
	sort(a + 1, a + 1 + m, cmp);
	int cnt = 0, num = 1, lst = 0; s[1].l = 1, s[1].r = n;
	if (a[1].x == 1) s[1].r = a[1].y - 1, lst = 1;
	for (int i = 1; i <= m; ++i)
		if (a[i].x != lst){// print(num);
			if (a[i].x > lst + 1) s[num = 1] = (Line){s[1].l, n};
			lst = a[i].x, b[1] = 0; int sum = 1;
			for (int j = i; j <= m && a[j].x == a[i].x; ++j) b[++sum] = a[j].y;
			b[++sum] = n + 1; 
			for (int j = 1; j < sum; ++j) flag[j] = 0;
			int k = 1;
			for (int j = 1; j < sum; ++j){
				if (b[j] + 1 >= b[j + 1]) continue;
				while (k <= num && s[k].r <= b[j]) ++k;
				if (k > num) break;
				if (s[k].l < b[j + 1]) flag[j] = 1, c[j] = max(b[j], s[k].l - 1);
			}
			num = 0;//Print(sum);
			for (int j = 1; j < sum; ++j)
				if (flag[j]) s[++num] = (Line){c[j] + 1, b[j + 1] - 1};
			if (!num){ puts("-1"); return; }
		}// print(num);
	if (a[m].x < n) printf("%lld\n", 2 * n - 2); else
	if (s[num].r > a[m].y) printf("%lld\n", 2 * n - 2); else puts("-1");
}

signed main(){
	freopen("pa.in", "r", stdin);
	freopen("pa.out", "w", stdout);
	while (scanf("%lld%lld", &n, &m) == 2) work();
	return 0;
}