QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #50104 | #871. Interesting Scoring Systems | Sparky327 | WA | 72ms | 1840kb | C++ | 842b | 2022-09-24 16:29:52 | 2022-09-24 16:30:19 |
Judging History
answer
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<map>
#include<cmath>
#define ll long long
using namespace std;
int g[1000100],h[1000100];
ll win=0;
int main()
{
int t;
scanf("%d",&t);
while (t--) {
int n;
win=0;
scanf("%d",&n);
for (int i=1;i<=n;i++){
scanf("%d",&g[i]);
}
for (int i=1;i<=n;i++){
scanf("%d",&h[i]);
}
if (n==1) {
printf("YES\n");
continue;
}
else if (n==2) {
if (h[1]>g[1]&&h[2]==g[2]) printf("YES\n");
else printf("NO\n");
continue;
}
for (int i=1;i<=n;i++){
int u=h[i]-g[i];
win+=u;
g[i]=g[i]-2*u;
}
if (win<n-1) {
printf("NO\n");
continue;
}
sort(g+1,g+n+1);
ll sum=0;
for (int i=1;i<n;i++)
sum+=g[i];
if(sum<g[n]) printf("NO\n");
else printf("YES\n");
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 1764kb
input:
2 3 4 1 1 6 1 1 4 5 1 1 1 7 1 1 1
output:
YES NO
result:
ok 2 token(s): yes count is 1, no count is 1
Test #2:
score: 0
Accepted
time: 1ms
memory: 1840kb
input:
2 4 5 3 1 3 7 4 1 3 1 0 0
output:
YES YES
result:
ok 2 token(s): yes count is 2, no count is 0
Test #3:
score: -100
Wrong Answer
time: 72ms
memory: 1784kb
input:
10000 64 2 2 1 4 1 7 5 0 4 7 4 3 0 6 2 3 3 2 5 2 4 3 2 9 4 2 5 1 0 1 2 4 0 5 5 4 4 0 0 2 0 3 2 5 5 6 5 0 5 0 3 0 3 6 5 4 0 6 7 3 4 4 2 2 3 2 1 5 1 10 7 0 6 10 6 4 0 8 3 4 4 3 7 3 6 4 2 13 6 3 7 1 0 1 3 6 0 7 7 5 6 0 0 3 0 4 2 7 7 9 7 0 7 0 4 0 4 8 7 5 0 9 10 4 6 5 3 3 99 98 79 89 106 103 91 89 105 9...
output:
YES YES YES YES YES YES NO YES YES YES YES YES YES YES YES YES NO YES YES YES NO YES YES YES YES YES YES YES YES YES YES YES YES YES NO YES NO YES NO YES NO YES YES YES YES YES YES YES YES YES NO YES YES YES YES YES YES YES YES YES YES YES NO YES YES YES NO YES YES YES YES YES NO YES YES YES YES YES...
result:
wrong answer expected NO, found YES [3rd token]