QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #716171 | #9587. 结课风云 | NULL_SF | WA | 1ms | 3688kb | C++23 | 337b | 2024-11-06 14:36:31 | 2024-11-06 14:36:32 |
Judging History
answer
#include <iostream>
#include <algorithm>
using namespace std;
int x[1001],y[1001];
signed main()
{
int n,a,b,c,d;
cin>>n>>a>>b>>c;
for(int i=1;i<=n;i++){
cin>>x[i]>>y[i];
}
cin>>d;
int cnt=0;
for(int i=1;i<=n;i++){
if(x[i]+y[i]<c && y[i]+min(b,x[i]+d)>=c) cnt++;
}
cout<<cnt;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3688kb
input:
5 40 60 60 20 25 10 40 25 30 35 50 40 60 10
output:
2
result:
ok single line: '2'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3568kb
input:
1 0 100 0 0 52 0
output:
0
result:
ok single line: '0'
Test #3:
score: -100
Wrong Answer
time: 1ms
memory: 3648kb
input:
1000 100 0 100 48 0 43 0 67 0 9 0 97 0 2 0 35 0 47 0 81 0 29 0 96 0 19 0 100 0 14 0 79 0 89 0 37 0 54 0 93 0 9 0 23 0 44 0 37 0 99 0 5 0 39 0 31 0 24 0 65 0 87 0 100 0 100 0 51 0 62 0 92 0 33 0 73 0 53 0 49 0 65 0 29 0 44 0 44 0 29 0 80 0 60 0 79 0 84 0 16 0 99 0 14 0 68 0 96 0 42 0 8 0 24 0 80 0 17...
output:
0
result:
wrong answer 1st lines differ - expected: '986', found: '0'