QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#761172 | #9739. 盒子 | syhhh1 | WA | 0ms | 3532kb | C++14 | 360b | 2024-11-18 21:17:56 | 2024-11-18 21:17:57 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
int z,h,u0,v0,u1,v1;
cin>>z>>h>>u0>>v0>>u1>>v1;
int q;
cin>>q;
while(q--)
{
int x,y,z1;
cin>>x>>y>>z1;
if(x>=min(u0,u1)&&x<=max(u0,u1)&&y>=max(v0,v1)&&y<=max(v0,v1)&&z1>=z&&z1<=z+h)cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3532kb
input:
1 1 -1 -1 1 1 3 -1 -1 1 0 0 2 1 2 2
output:
NO NO NO
result:
wrong answer expected YES, found NO [1st token]