QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#757556 | #9739. 盒子 | Jumping# | WA | 2ms | 3616kb | C++14 | 353b | 2024-11-17 10:33:10 | 2024-11-17 10:33:11 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
signed main(){
int z0,h,u0,v0,u1,v1;
cin>>z0>>h>>u0>>v0>>u1>>v1;
int q;
cin>>q;
while(q--){
int x,y,z;
cin>>x>>y>>z;
if(z<=z0+h&&z>=z0&&x<=max(u0,u1)&&x>=min(u0,v1)&&y<=max(v0,v1)&&y>=min(v0,v1))cout<<"YES"<<'\n';
else cout<<"NO"<<'\n';
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3616kb
input:
1 1 -1 -1 1 1 3 -1 -1 1 0 0 2 1 2 2
output:
YES YES NO
result:
ok 3 token(s): yes count is 2, no count is 1
Test #2:
score: 0
Accepted
time: 0ms
memory: 3560kb
input:
0 0 0 0 0 0 1 0 0 0
output:
YES
result:
ok YES
Test #3:
score: -100
Wrong Answer
time: 2ms
memory: 3532kb
input:
350432 492023 -396022 -414507 -384948 -709370 1000 -130226 -670854 277087 566180 93150 527328 -204228 -72535 242125 -614762 564337 -801184 223424 -916504 -284025 749863 555219 232927 -127805 10830 871265 510696 -444465 52713 313445 -731187 -723316 -917838 537750 294727 532132 -19501 346654 -632699 -...
output:
NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO YES NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO YES NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO NO N...
result:
wrong answer expected NO, found YES [32nd token]