text stringlengths 49 983k |
|---|
#include<bits/stdc++.h>
using namespace std;
int main(){
int N;
for(cin>>N;N;--N){
int t,x,y;
cin>>t>>x>>y;
if(t<x+y||(t-x-y)&1)return cout<<"No",0;
}
return cout<<"Yes",0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,a,b,c;
cin>>n;
while(cin>>a>>b>>c){
if(b+c>a) return cout<<"No"<<endl,0;
if((b+c)%2==0 && a%2) return cout<<"No"<<endl,0;
if((b+c)%2 && a%2==0) return cout<<"No"<<endl,0;
}
cout<<"Yes"<<endl;
return 0;
} |
#include <iostream>
#include<map>
#include<string>
#include<vector>
#include<map>
#include <algorithm>
using namespace std;
int n,t,x,y;
string ans="Yes";
int main()
{
cin>>n;
for (int i=1;i<=n;i++){
cin>>t>>x>>y;
if (x+y>t || (t-x-y)%2!=0) ans="No";
}
cout<<ans<<endl;;
}
|
#include <iostream>
using namespace std;
int main() {
int N;
cin>>N;
int T=0,X=0,Y=0;
bool f=true;
while (N--) {
int t,x,y;
cin>>t>>x>>y;
int dt=abs(t-T);
int dis=abs(x-X)+abs(y-Y);
if (dis>dt || abs(dis-dt)%2!=0) {
f=false;
}
T=t,X=x,Y=y;
}
cout<<(f?"Yes":"No")<<endl;
return 0;
}
|
#include <iostream>
#include <cmath>
using namespace std;
int ans=0;
int main(){
int i,j,k,n;
cin>>n;
for(i=1;i<=n;i++){
int t,x,y;
cin>>t>>x>>y;
if((x+y)%2==t%2&&t>=x+y)ans++;
}
if(ans==n)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} |
#include <bits/stdc++.h>
#include<vector>
using namespace std;
#define rep(i, n) for(int i=0; i<(int)(n); ++i)
int main() {
int a,b,c,d;
cin>>a;
rep(i,a){
cin>>b>>c>>d;
b=b-c-d;
if(b<0||b%2!=0){
cout<<"No";
return 0;
}
}
cout<<"Yes";
}
|
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n,i,k=0;
cin>>n;
int t[n+1],x[n+1],y[n+1];
for (i=1; i<=n; i++)
cin>>t[i]>>x[i]>>y[i];
for (i=1; i<=n; i++)
if (x[i]+y[i]<=t[i] && (x[i]+y[i]-t[i])%2==0)
k++;
if (k==n)
cout<<"Yes";
else
cout<<"No";
return 0;
} |
#include <iostream>
using namespace std;
int main()
{
int n,F=1,a,x,y;
cin>>n;
for (int i=1;i<=n;i++){
cin>>a>>x>>y;
if (x+y<=a && (a-x-y)%2==0) continue;
else{
F=0;
break;
}
}
if (F==1) cout<<"Yes";
else cout<<"No";
return 0;
} |
#include<bits/stdc++.h>
#define MOD (long long)(1e9+7)
using namespace std;
int n;
int main()
{
cin >> n;
int x=0,y=0,l=0;
for(int i=0,t,a,b; i<n; i++)
{
cin >> t >> a >> b;
int k=abs(x-a)+abs(y-b);
if(t-l < k || (k-t+l)%2)
{
cout << "No";
return 0;
}
x=a,y=b,l=t;
}
cout << "Yes";
return 0;
}
|
#include <iostream>
using namespace std;
int n;
long long t,x,y;
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>t>>x>>y;
if(t<x+y||(t-x-y)%2!=0){
cout<<"No"<<endl;
return 0;
}
else continue;
}
cout<<"Yes"<<endl;
return 0;
} |
#include<iostream>
using namespace std;
int n;
int t,a,b;
int sum;
bool check(void)
{
cin>>t>>a>>b;
sum = a + b;
if(t >= sum && (t - sum) % 2 == 0)
return true;
return false;
}
int main(void)
{
cin>>n;
while(n--)
{
if(!check())
{
cout<<"No\n";
return 0;
}
}
cout<<"Yes\n";
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n,f=1,t,x,y;
double a[101],b[101],maxa=0.0,p;
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>t>>x>>y;
if(t<x+y)f=0;
else if((t-x-y)%2==1)f=0;
}
if(f)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
} |
#include<cmath>
#include<cstdio>
int main()
{
int n;
scanf("%d",&n);
int pd=1;
for(int i=1;i<=n;i++){
int t,a,b;
scanf("%d %d %d",&t,&a,&b);
if(a+b<=t){
t-=a+b;
if(t%2!=0){
pd=0;
printf("No\n");
break;
}
}else{
pd=0;
printf("No\n");
break;
}
}
if(pd){
printf("Yes\n");
}
return 0;
} |
#include<cstdio>
int main()
{
int n;
scanf("%d",&n);
int ans = n;
int pos = 0;
while(n--)
{
int t,a,b;
scanf("%d%d%d",&t,&a,&b);
if(a+b > t)
continue;
if((a+b-t)%2==0)
pos++;
else
continue;
}
if(pos == ans)
printf("Yes");
else
printf("No");
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
int n,t,x,y;
scanf("%d",&n);
for(int i=0; i<n; i++){
scanf("%d %d %d",&t,&x,&y);
if((t%(x+y)!=0 and (t-x-y)%2!=0) or t<x+y){
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n; cin >> n;
int ok = 1;
int X = 0, Y = 0, T = 0;
for (int i = 0; i < n; ++i)
{
int t, x, y; cin >> t >> x >> y;
X = abs(x - X);
Y = abs(y - Y);
T = t - T;
if (X + Y > T) ok = 0;
if ((X + Y) % 2 != T % 2) ok = 0;
}
cout << (ok ? "Yes" : "No") << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAX_N=1e8;int a[MAX_N];
int main(){
int m;cin>>m;
int flag=1;
while(m--){
int t,x,y;
cin>>t>>x>>y;
int p=x+y;
if(t<p||((t-p)%2!=0))
flag=0;
}if(flag) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int a,b,c,d;scanf("%d",&a);
for(int i=1;i<=a;i++)
{
scanf("%d%d%d",&b,&c,&d);
if(c+d>b){printf("No\n");return 0;}
else if((c+d)%2==0&&b%2==1){printf("No\n");return 0;}
else if((c+d)%2==1&&b%2==0){printf("No\n");return 0;}
}
printf("Yes\n");
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n,t,x,y;
int main(){
cin>>n;
for(int i=0;i<n;i++){
cin>>t>>x>>y;
if(!(x+y<=t&&(t-x-y)%2==0)){
cout<<"No";
return 0;
}
}
cout<<"Yes";
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n,t,x,y;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d%d%d",&t,&x,&y);
if(x+y>t)
{
puts("No");
return 0;
}
if((x+y)%2+t%2==1)
{
puts("No");
return 0;
}
}
puts("Yes");
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
bool ok = 1;
for(int i = 1; i <= n; ++i) {
int t, x, y;
cin >> t >> x >> y;
if(t < x || t < y || x + y > t || (t - (x + y)) % 2 == 1)
ok = 0;
}
if(ok == 1)
cout << "Yes";
else
cout << "No";
return 0;
}
|
#include<cstdio>
int main()
{
int t;
bool f1=0;
scanf("%d",&t);
while(t--)
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
if((b+c)>a||(b+c)%2!=a%2)
f1=1;
}
if(f1)
puts("No");
else
puts("Yes");
} |
#include<bits/stdc++.h>
using namespace std;
int n,m,x,y,ff;
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>m>>x>>y;
if(m<x+y)ff=1;
if((m-x-y)%2==1) ff=1;
}
if(ff==1) cout<<"No"<<endl;
else cout<<"Yes"<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;bool flag=1;
cin>>n;
for(int i=1;i<=n;i++){
int t,x,y;
cin>>t>>x>>y;
if(t<x+y) flag=0;
if((t-x-y)%2) flag=0;
}
if(flag) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int dis(int a,int b)
{
return a+b;
}
int main()
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
int t,x,y,d;
scanf("%d %d %d",&t,&x,&y);
d=dis(x,y);
if((t<d)||(t&1)!=(d&1))
{
puts("No");
return 0;
}
}
puts("Yes");
return 0;
}
|
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main() {
int n,t[100000],x[100000],y[100000];
cin >> n;
for(int i=0; i<n; i++) {
cin >> t[i] >> x[i] >> y[i];
if(t[i]%2!=(x[i]+y[i])%2||t[i]<x[i]+y[i]) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} |
#include<cstdio>
using namespace std;
int main()
{
int n,t,x,y;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d%d%d",&t,&x,&y);
if(x+y>t) return printf("No\n"),0;
if((x+y)%2==0&&t%2==1) return printf("No\n"),0;
if((x+y)%2==1&&t%2==0) return printf("No\n"),0;
}
return printf("Yes\n"),0;
} |
#include<bits/stdc++.h>
using namespace std;
int tt,tx,ty,x,y,t,f;
int n;
int main()
{
cin >> n;
for(int i=0;i<n;i++)
{
cin >> tt >> tx >> ty;
if((((tt-t)-(abs(tx-x)+abs(ty-y)))%2!=0||abs(tx-x)+abs(ty-y)>tt-t))
{
f=1;
}
t=tt,x=tx,y=ty;
}
if(f) cout << "No";
else cout << "Yes";
return 0;
}
|
#include<cstdio>
#include<algorithm>
int main()
{
int n,flag=0;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
int a,b,c,d;
scanf("%d%d%d",&a,&b,&c);
d=a-b-c;
if(d<0||d%2==1)
{
flag=1;
}
}
if(flag)
printf("No\n");
else
printf("Yes\n");
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,t,x,y,i;
cin >> n;
for(i=0;i<n;i++){
cin >> t >> x >> y;
if(abs(-x)+abs(-y)>t || abs(-x)+abs(-y)<=t && (abs(-x)+abs(-y))%2!=t%2){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n,ans=1,x,y,t,tx,ty,tt;
int main(){
cin>>n;
for(int i=1,d;i<=n;++i)
{
scanf("%d%d%d",&tt,&tx,&ty);
d=fabs(tx-x)+fabs(ty-y);
if(!(tt-t>=d&&(tt-t-d)%2==0)) {ans=0; break;}
x=tx; y=ty; t=tt;
}
if(ans) cout<<"Yes"; else cout<<"No";
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N; cin >> N;
for (int i=0, dt=0, dx=0, dy=0; i<N; i++){
int t, x, y; cin >> t >> x >> y;
int st=abs(t-dt), di=abs(x-dx)+abs(y-dy);
if(di>st||(di+st)&1){
cout << "No\n";
return 0;
}
dt = t, dx = x, dy = y;
}
cout << "Yes";
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
while(~scanf("%d",&n)){
int flag=0;
while(n--){
int t,x,y;
scanf("%d%d%d",&t,&x,&y);
if((t-(x+y))%2||t<(x+y)){
flag=1;
}
}
if(flag){
printf("No\n");
}else{
printf("Yes\n");
}
}
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin>>n;
int currX=0, currY=0, currT=0;
while(n--){
int t, x, y;
cin>>t>>x>>y;
if(abs(currY - y)+abs(currX - x) > t-currT || (abs(currY - y)+abs(currX - x))%2 != (t-currT)%2 ){
cout<<"No";
return 0;
}
}
cout<<"Yes\n";
} |
#include<iostream>
using namespace std;
int main()
{
int n,t,x,y;
cin>>n;
while(n--)
{
cin>>t>>x>>y;
if(t<x+y||(t-x-y)%2)
{
cout<<"No\n";
return 0;
}
}
cout<<"Yes\n";
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n,t,x,y;//不用开数组
int main(){
cin>>n;
for(int i=0;i<n;i++){
cin>>t>>x>>y;//输入每组数据
if(!(x+y<=t&&(t-x-y)%2==0)){//判断是否符合
cout<<"No\n";//不符合
return 0;//避免重复输出
}
}
cout<<"Yes\n";//全部符合
return 0;
} |
#include<iostream>
using namespace std;
int main()
{
int n;
cin>>n;
for(int i=0;i<n;i++)
{
int t,x,y;
cin>>t>>x>>y;
t-=x+y;
if(t<0||t%2)
return!(cout<<"No\n");
}
return!(cout<<"Yes\n");
} |
#include <iostream>
using namespace std;
int main() {
int N;
cin>>N;
int dt=0,dx=0,dy=0;
bool f=true;
for (int i=0; i<N; i++) {
int t,x,y;
cin>>t>>x>>y;
dt=abs(t-dt),dx=abs(x-dx),dy=abs(y-dy);
if (dt<dx+dy || (dx+dy-dt)%2!=0) {
f=false;
}
}
cout<<(f?"Yes":"No")<<endl;
return 0;
}
|
#include<cstdio>
using namespace std;
int main()
{
int n,t,x,y;
scanf("%d\n",&n);
for(int i=0;i<n;i++)
{
scanf("%d%d%d\n",&t,&x,&y);
if(x+y>t){printf("No\n");return 0;}
if((x+y)%2 != t%2){printf("No\n");return 0;}
}
printf("Yes\n");
return 0;
} |
#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);i++)
using namespace std;
int main(){
int n; scanf("%d",&n);
int t=0,x=0,y=0;
rep(i,n){
int t2,x2,y2; scanf("%d%d%d",&t2,&x2,&y2);
int d=abs(x2-x)+abs(y2-y);
if(t2-t<d || (t2-t)%2!=d%2){ cout<<"No"<<endl; return 0; }
}
cout<<"Yes"<<endl;
return 0;
}
|
#include<iostream>
using namespace std;
int n,t[100005],x[100005],y[100005];
bool f;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
cin>>t[i]>>x[i]>>y[i];
for(int i=1;i<=n;i++)
{
if(x[i]+y[i]>t[i])
{
cout<<"No";f=1;break;
}
else if((t[i]-x[i]-y[i])%2==1)
{
cout<<"No";f=1;break;
}
}
if(!f)cout<<"Yes";
} |
#include<iostream>
#include<string>
#include<algorithm>
using namespace std;
int main(){
int a,b[100000],c[100000],d[100000],e=0;
cin>>a;
for(int i=0;i<a;i++){
cin>>b[i]>>c[i]>>d[i];
if((c[i]+d[i]-b[i])%2==0 && c[i]+d[i]<=b[i]){
e++;
}
}
if(e==a){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
} |
#include <iostream>
using namespace std;
int main()
{
int f=1,i,j,n,a[100000][3];
cin>>n;
for(i=0;i<=n;i++)
{
cin>>a[i][0]>>a[i][1]>>a[i][2];
if(a[i][2]+a[i][1]>a[i][0]||a[i][0]%2!=(a[i][1]+a[i][2])%2)
f=0;
}
if(f==1)
cout<<"Yes";
else
cout<<"No";
return 0;
} |
#include<iostream>
using namespace std;
int x,y,n,q,t;
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>t>>x>>y;
if((t<x+y)||((x+y)%2!=t%2)){
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
return 0;
} |
#include <iostream>
#include <string>
using namespace std;
int main()
{
int n;
cin >> n;
for(int i = 0;i < n;i++)
{
int a,b,c;
cin >> a >> b >> c;
b+=c;
if(a < b||(a-b)%2 == 1){cout << "No" << endl;return 0;}
}
cout << "Yes" << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main(){
int N,t,x,y,pt=0,px=0,py=0;
cin >> N;
for(int i=0;i<N;i++){
cin >> t >> x >> y;
if(abs(x-px)+abs(y-py)>t-pt ||
(abs(x-px)+abs(y-py)-(t-pt))%2!=0){
cout << "No" << endl;
return 0;
}
pt=t;px=x;py=y;
}
cout << "Yes" << endl;
return 0;
}
|
#include<iostream>
#include<cstdio>
using namespace std;
int n,a,b,c;
bool flag=1;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{scanf("%d%d%d",&a,&b,&c);
a=a-c-b;
if(a<0||(a%2==1))
flag=0;
}
if(flag==0)
{cout<<"No";
}
else
cout<<"Yes";
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n,t,x,y;
int main()
{
int n,x,y,z,i;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>x>>y>>z;
if(!(y+z<=x&&(x-y-z)%2==0))
{
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
return 0;
} |
#include<cstdio>
using namespace std;
int n;
int abs(int x)
{
if(x<0) return -x;
return x;
}
int main()
{
scanf("%d",&n);
while(n--)
{
int t,x,y;
scanf("%d %d %d",&t,&x,&y);
if(x<0) x=-x;
if(y<0) y=-y;
if((x+y)%2!=(t%2)||(x+y>t)){printf("No");return 0;}
}
printf("Yes");
return 0;
} |
#include<iostream>
using namespace std;
int main()
{
int i,j,k=0,n;
cin>>n;
int a[n],x[n],y[n];
for(i=0;i<n;i++)
{
j=0;
cin>>a[i]>>x[i]>>y[i];
j+=x[i];
j+=y[i];
//cout<<j<<" "<<a[i]<<endl;
if((a[i]-j)%2!=0||j>a[i])
{
k=1;
}
}
if(k==0)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
} |
#include <iostream>
using namespace std;
int main()
{
int n,t,x,y,F=0;
cin>>n;
for (int i=1;i<=n;i++){
cin>>t>>x>>y;
if (x+y<=t && (t-x-y)%2==0) continue;
else F=1;
}
if (F==0) cout<<"Yes";
else cout<<"No";
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n,t,x,y;
int main()
{
cin>>n;
for(int i=1; i<=n; i++)
{
cin>>t>>x>>y;
if(x+y>t||(t-x-y)%2!=0)
{
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int i,n,flag=1,t,x,y,nx=0,ny=0,j;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d%d",&t,&x,&y);
j+=abs(x-nx)+abs(ny-y);
if((t-j)%2==1||j>t)
{
flag=0;
break;
}
nx=x;
ny=y;
}
if(flag)
printf("Yes");
else
printf("No");
return 0;
} |
#include <iostream>
using namespace std;
int main() {
int a, b, c, d, e = 0, f = 0, g = 0;
cin >> a;
for (int i = 0; i < a; ++i) {
cin >> b >> c >> d;
int mon = c + d - f - g, mmon = b - e;
if (!(mon <= mmon && mon % 2 == mmon % 2)) {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} |
#include<cstdio>
using namespace std;
int n,t,x,y;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d%d%d",&t,&x,&y);
if(x+y>t||(t-x-y)%2!=0)
{
printf("No");
return 0;
}
}
printf("Yes");
return 0;
} |
#include<iostream>
using namespace std;
int a[100000][3];
int main()
{
int f=1,i,j,n;
cin>>n;
for(i=0;i<n;i++)
{
cin>>a[i][0]>>a[i][1]>>a[i][2];
if((a[i][2]+a[i][1]>a[i][0])||a[i][0]%2!=(a[i][1]+a[i][2])%2)
f=0;
}
if(f==1)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
}
|
#include"bits/stdc++.h"
using namespace std;
int main()
{
int n,t,x,y;
bool f=true;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d %d %d",&t,&x,&y);
if(t%(x+y)!=0&&(t-x-y)%2!=0||t<(x+y))
f=false;
}
if(f)
printf("Yes");
else
printf("No");
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,x,y,t;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>t>>x>>y;
if(t<x+y||(t-x-y)%2==1)
{
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
} |
#include<bits/stdc++.h>
using namespace std;
int n,t,x,y,z,d;
int main(){
cin>>n;
for(int i=0;i<n;i++){
cin>>t>>x>>y;
if(!(x+y<=t&&(t-x-y)%2==0)){
cout<<"No\n";
return 0;
}
}
cout<<"Yes\n";
return 0;
} |
#include <iostream>
using namespace std;
int main(){
int n,t0=0,x0=0,y0=0,t1,x1,y1,dif=0,dif_t=0;cin>>n;
for(int i=0;i<n;++i){
cin>>t1>>x1>>y1;
dif=abs(x0-x1+y0-y1);
dif_t=t1-t0;
if((dif%2!=dif_t%2)||dif>dif_t){
printf("No\n");
return 0;
}
t1=t0;
x1=x0;
y1=y0;
}printf("Yes\n");
} |
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
int x, y, t;
bool flag = 0;
while (n--) {
cin >> t >> x >> y;
int k = abs(x) + abs(y);
if (t < k) flag = 1;
if ((k - t) & 1) flag = 1;
}
cout << (flag ? "No" : "Yes") << endl;
return 0;
} |
#include <iostream>
using namespace std;
int main() {
int N;
cin>>N;
int dt=0,dx=0,dy=0;
bool f=true;
for (int i=0; i<N; i++) {
int t,x,y;
cin>>t>>x>>y;
dt=abs(t-dt),dx=abs(x-dx),dy=abs(y-dy);
if (dt<dx+dy || (abs(dx+dy-dt))%2!=0) {
f=false;
}
}
cout<<(f?"Yes":"No")<<endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n; cin>>n;
int t[n+1],x[n+1],y[n+1]; t[0]=0,x[0]=0,y[0]=0;
for(int i=1;i<n+1;i++) cin>>t[i]>>x[i]>>y[i];
for(int i=0;i<n;i++){
int d=abs(x[i+1]-x[i])+abs(y[i+1]-y[i]);
int u=t[i+1]-t[i];
if(d>u||(d<u&&(u-d)%2)){cout<<"No"; return 0;}
}
cout<<"Yes";
} |
#include<iostream>
using namespace std;
int main()
{
int n,t,x,y,px=0,py=0,pt=0,r;
bool c;
cin>>n;
while(n--)
{
c=false;
cin>>t>>x>>y;
r=(t-pt-x+px-y+py);
if(r>=0)
{
if(r%2==0)
{c=true;}
}
if(!c)
{
puts("No");
return 0;
}
pt=t;
px=x;
py=y;
}
puts("Yes");
return 0;
} |
#include<stdio.h>
int n,x,y,t,a,b,c;
int abs(int);
int main(void){
register int i;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d%d%d",&c,&a,&b);
if(((abs(x-a)+abs(y-b))%2!=(c-t)%2)||(abs(x-a)+abs(y-b)>c-t))
return puts("No"),0;
x=a,y=b,t=c;
}
puts("Yes");
return 0;
}
int abs(int a){
return a>0?a:-a;
} |
#include<iostream>
using namespace std;
int main(){
int n,t,x,y;
cin>>n;
for(int i=1;i<=n;i++){
cin>>t>>x>>y;
if((x+y>t)||((x+y)%2==0&&t%2==1)||((x+y)%2==1&&t%2==0)){
cout<<"No"<<endl;
return 0;}
}
cout<<"Yes"<<endl;} |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main(){
int N;
scanf("%d", &N);
while(N--){
int t,x,y;
scanf("%d%d%d", &t,&x,&y);
if(t<(x+y) || (x+y+t)%2){
printf("No\n");
return 0;
}
}
printf("Yes\n");
} |
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main(){
int N;
cin >> N;
while(N--){
int t,x,y;
cin >> t >> x >> y;
if(t<(x+y) || (x+y+t)%2){
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int n;
cin >> n;
int a=0,b=0,c=0,x,y,t;
for(int i=n;i>0;i--){
cin>>t>>x>>y;
if(t-c<abs(a-x)+abs(b-y)||(t-c)%2!=(abs(a-x)+abs(b-y))%2){
cout << "No";
return 0;
}
a=x;
b=y;
c=t;
}
cout << "Yes";
}
|
#include <iostream>
#include <cmath>
using namespace std;
int x,y,t;
int n,a,b,c;
int main()
{
cin>>n;
for(int i=1;i<=n;i++) {
cin>>c>>a>>b;
int sum=abs(a-x)+abs(b-y),ti=c-t;
if(sum>ti||(sum%2!=ti%2)) { cout<<"No"<<endl; return 0; }
x=a,y=b,t=c;
}
cout<<"Yes"<<endl;
return 0;
} |
#include<stdio.h>
int main(){
int n;
int x=0,y=0,t=0,tk;
int k;
scanf("%d",&n);
for(int i=0;i<n;++i){
tk = -t;
k = x+y;
scanf("%d%d%d",&t,&x,&y);
tk += t;
k += tk - x - y;
if(k < 0 || k%2 != 0){
printf("No\n");
return 0;
}
}
printf("Yes\n");
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int main(){
int n,t,x,y;
cin>>n;
for(int i=1;i<=n;i++){
cin>>t>>x>>y;
if(!(x+y<=t&&(t-x-y)%2==0)){
cout<<"No";
return 0;
}
}
cout<<"Yes";
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n,t,x,y;//不用开数组
int main(){
cin>>n;
for(int i=0;i<n;i++){
cin>>t>>x>>y;//输入每组数据
if(!(x+y<=t&&(t-x-y)%2==0)){//判断是否符合
cout<<"No"<<endl;//不符合
return 0;}}//避免重复输出
cout<<"Yes"<<endl;//全部符合
return 0;
} |
#include <iostream>
using namespace std;
int main(void){
int N,xx,yy,tt;
cin >> N;
for(int i=0;i<N;i++){
cin >> tt >> xx >> yy;
if((tt - (xx+yy)) % 2 == 1 || tt < (xx+yy)){
cout<<"No";
return 0;
}
}
cout<<"Yes";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int t;
void S(){puts("No");exit(0);}
int main()
{
cin>>t;
while(t--)
{
int a,b,c;
cin>>a>>b>>c;
a-=b+c;
if(a<0)S();
if(a&1)S();
}
puts("Yes");
return 0;
} |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int t,x,y,sum=0;
for(int i=0;i<N;i++) {
cin >> t >> x >> y;
int jg=(x%2)+(y%2);
//cout << jg << t%2 << endl;
if(t>=x+y && t%2==jg%2) sum++;
else break;
}
if(sum==N) cout << "Yes" << endl;
else cout << "No" << endl;
}
|
#include<cstdio>
#include<cmath>
int n,t,x,y,a,b;
int main()
{
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d%d%d",&t,&x,&y);
int k=fabs(x-a)+fabs(y-b);
if(k>t)
{
printf("No");
return 0;
}
else if(k<t)
if((k-t)%2)
{
printf("No");
return 0;
}
}
printf("Yes");
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int N,a,b,c;
bool ans=false;
cin >>N;
for(int i=0;i<N;i++){
cin >>a>>b>>c;
if((a>=(b+c))&&(a%2==(b+c)%2))
ans=true;
else{
ans=false;
cout <<"No"<<endl;
return 0;
}
}
cout <<"Yes"<<endl;
return 0;
} |
#include<iostream>
#include<cmath>
using namespace std;
int main(){
int n,i,j;
cin>>n;
int t[n],x[100000],y[100000];
for(i=1;i<=n;i++){
cin>>t[i];
cin>>x[i]>>y[i];
j=fabs(x[i]-x[i-1])+fabs(y[i]-y[i-1]);
if(t[i]-t[i-1]<j||(t[i]-t[i-1]-j)%2!=0){
cout<<"No";
return 0;
}
}
cout<<"Yes";
return 0;
} |
// C - Traveling
#include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin>>N;
bool ans=true;
for(int i=0; i<N; ++i){
int t,x,y; cin>>t>>x>>y;
if(t%2 != (x+y)%2){ ans = false; break; }
else if(t < x+y){ ans = false; break; }
}
cout<< (ans?"Yes":"No") <<endl;
} |
#include<iostream>
using namespace std;
int main(){
int N;
int t,x,y;
cin>>N;
int f=1;//能
while(N--){
cin>>t>>x>>y;
//下面开始判断
if(x+y>t){
f=0;
}
if((t-(x+y))%2!=0){
f=0;
}
}
if(f==1){
cout<<"Yes"<<endl;
}else{
cout<<"No"<<endl;
}
return 0;
} |
#include<cstdio>
#include<cmath>
using namespace std;
int x[100005],y[100005],t[100005];
int main()
{
int n,f=1;scanf("%d",&n);
for(int i=1;i<=n&&f;i++)
{
scanf("%d%d%d",&t[i],&x[i],&y[i]);
int s=t[i]-t[i-1]-abs(x[i]-x[i-1])-abs(y[i]-y[i-1]);
if(s<0||s&1) f=0;
}
if(f) printf("Yes");else printf("No");
return 0;
} |
#include<iostream>
#include<cmath>
using namespace std;
int n,a,b,c,l,ll;
int main()
{
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a>>b>>c;
l=b+c;
if(l>a){cout<<"No"<<endl;return 0;}
ll=a-l;
if(ll%2>0){cout<<"No"<<endl;return 0;}
}
cout<<"Yes"<<endl;
return 0;
} |
#include<cstdio>
int main()
{
int n,t,x,y;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d%d%d",&t,&x,&y);
if(x+y>t||(x+y)%2==0&&t%2==1||(x+y)%2==1&&t%2==0)
{
printf("No");
return 0;
}
}
printf("Yes");
} |
#include<iostream>
#include<cstdio>
using namespace std;
int main() {
int n,t,x,y;
cin>>n;
int f=0;
for(int i=0; i<n; i++) {
cin>>t>>x>>y;
if(!(x+y<=t&&(t-x-y)%2==0)) f=1;
}
if (f==0) cout<<"Yes\n";
else cout<<"No\n";
return 0;
} |
// C - Traveling
#include <bits/stdc++.h>
using namespace std;
int main(){
int N; cin>>N;
while(N--){
int t,x,y; cin>>t>>x>>y;
if(t<x+y || (t&1)!=((x+y)&1)){ puts("No"); return 0; }
}
puts("Yes");
} |
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int t[n+1],x[n+1],y[n+1];
for (int i=1; i<=n; i++)
{
cin>>t[i]>>x[i]>>y[i];
}
int k=0;
for (int i=1; i<=n; i++)
{
if (x[i]+y[i]<=t[i] && (x[i]+y[i]-t[i])%2==0)
k++;
}
if (k==n)
cout<<"Yes";
else
cout<<"No";
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int a,b,x,y;
int main(){
cin>>a;
for(int i=0;i<a;i++){
cin>>b>>x>>y;
if(!(x+y<=b&&(b-x-y)%2==0)){
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,x,y,t;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>t>>x>>y;
if(x+y>t||(t-x-y)%2!=0)
{cout<<"No"<<endl;return 0;}
}
cout<<"Yes"<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main(){
int a,b,n,tol,tim;
cin>>n;
for(int i=0;i<n;++i){
cin>>tim>>a>>b;
tol=a+b;
if((tim-tol)%2==1||tim<tol){
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int n,t,x,y;
int main()
{
cin>>n;
for(int i=0;i<n;i++)
{
cin>>t>>x>>y;
if(!(x+y<=t&&(t-x-y)%2==0))
{
cout<<"No\n";
return 0;
}
}
cout<<"Yes\n";
return 0;
} |
#include<iostream>
int n,t,x,y,pt,px,py,f,d;
int main(){
std::cin>>n;
for(;n--;pt=t,px=x,py=y)std::cin>>t>>x>>y,d=abs(x-px)+abs(y-py),f=(t-pt<d||(d-t+pt)%2)?1:0;
std::cout<<(f?"No":"Yes");
} |
#include<iostream>
const int N=100001;
using namespace std;
int main(){
int n,x[N],y[N],t[N];
cin>>n;
for(int i=1;i<=n;i++) cin>>t[i]>>x[i]>>y[i];
for(int i=1;i<=n;i++)
if(x[i]+y[i]>t[i]||(t[i]-x[i]-y[i])%2!=0){cout<<"No"; return 0;}
cout<<"Yes";
} |
#include<bits/stdc++.h>
using namespace std;
int n,t,x,y;
int main()
{
cin>>n;
for(int i=0;i<n;i++)
{
cin>>t>>x>>y;
if(!(x+y<=t&&(t-x-y)%2==0))
{
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
return 0;
} |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n,a,b,c,f=1;
scanf("%d",&n);
for(int i=1;i<=n;i++) {
scanf("%d%d%d",&a,&b,&c);
if(a<b+c||(a-b-c)&1){f=0;break;}
}
if(f)printf("Yes");
else printf("No");
} |
#include<bits/stdc++.h>
using namespace std;
int main() {
int n,x,y,t;
cin>>n;
for(int i=0; i<n; i++) {
cin>>t>>x>>y;
if(x+y>t||(t-x-y)%2) {
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
} |
#include<bits/stdc++.h>
#define E exit(0);
using namespace std;
int main(){
int n,t,x,y;
cin>>n;
for(int i=1;i<=n;i++){
cin>>t>>x>>y;
if(x+y>t)puts("No"),E
if((x+y)%2==0&&t%2)puts("No"),E
if((x+y)%2&&t%2==0)puts("No"),E
}
puts("Yes");E
} |
#include <iostream>
#include <cstdio>
#include <string>
using namespace std;
int main() {
int n;
cin >> n;
for (int i=0;i<n;i++) {
int t, x, y;
cin >> t >> x >> y;
int z = x +y;
if ((t < z) || (t % 2 != z % 2) ) {
cout << "No\n";
return 0;
}
}
cout << "Yes\n";
return 0;
}
|
#include<bits/stdc++.h>
using namespace std;
int n,t,x,y;
int main()
{
cin>>n;
for(int i=0;i<n;i++)
{
cin>>t>>x>>y;
if(!(x+y<=t&&(t-x-y)%2==0))
{
cout<<"No\n";
return 0;
}
}
cout<<"Yes\n";
}
|
#include<bits/stdc++.h>
using namespace std;
int n,t[1000000],x[1000000],y[1000000];
int main(){
int i,j;
cin>>n;
for(i=1;i<=n;i++){
cin>>t[i]>>x[i]>>y[i];
}
for(i=1;i<=n;i++){
int dt=t[i]-t[i-1];
dt-=abs(x[i]-x[i-1]);
dt-=abs(y[i]-y[i-1]);
if(dt<0||dt%2){
cout<<"No"<<endl;
return 0;
}
}
cout<<"Yes"<<endl;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.