#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
typedef long long LL;
inline int read()
{
int x=0;bool f=0;char c=getchar();
for (;c<'0'||c>'9';c=getchar()) f=c=='-'?1:0;
for (;c>='0'&&c<='9';c=getchar()) x=x*10+c-'0';
return f?-x:x;
}
int main()
{
int n=read(),l=0,r=0,A,B,T,R=0;read();
for (int i=1;i<=n;i++,R=T)
{
T=read(),A=(read()+T>>1)+1,B=read()+T-1>>1;
l=max(l,A);r=min(r+T-R,B);
if (l>r) return puts("NIE"),0;
}
printf("%d\n",l);
return 0;
}
bzoj4723
最新推荐文章于 2018-05-30 23:57:06 发布