- 旅行计划
- @ 2026-07-18 12:31:21
#include<bits/stdc++.h>
using namespace std;
struct wz{
long long t;
long long x;
long long y;
};
wz a,b;
int n;
int main(){
cin>>n;
b.t=0,b.x=0,b.y=0;
for(int i=1;i<=n;i++){
cin>>a.t>>a.x>>a.y;
if(a.x==b.x&&a.y==b.y) {
cout<<"No";
return 0;
}
if(abs(a.x-b.x)+abs(a.y-b.y)<=a.t-b.t){
b.t=a.t,b.x=a.x,b.y=a.y;
}
else {
cout<<"No";
return 0;
}
}
cout<<"Yes";
return 0;
}
1 条评论
-
202607gj03盛辰 (shengchen) LV 8 @ 2026-07-19 09:27:11
#include<bits/stdc++.h> using namespace std; int n,num[100005],sum,flag; int main() { cin>>n; for (int i=1;i<=n*3;i++) cin>>num[i]; for (int i=1;i<=n*3;i+=3) { sum = 0; sum += num[i+1] + num[i+2]; if ((num[i]-sum)%2 == 0&&num[i]>=sum) flag = 1; else { flag = 0; break; } } if (flag) cout<<"Yes"; else cout<<"No"; }AC
- 1
信息
- ID
- 3005
- 难度
- 7
- 分类
- (无)
- 标签
- 递交数
- 47
- 已通过
- 11
- 通过率
- 23%
- 上传者