QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#35311	#2616. Attack Order	yzhang	WA	2ms	3664kb	C++17	1.2kb	2022-06-15 08:21:43	2022-06-15 08:21:44

Judging History

你现在查看的是最新测评结果

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2022-06-15 08:21:44]
评测

测评结果：WA
用时：2ms
内存：3664kb

查看

[2022-06-15 08:21:43]
提交

answer

//μ's forever
#include <bits/stdc++.h>
#define N 105
//#define getchar nc
using namespace std;
inline char nc(){
    static char buf[100000],*p1=buf,*p2=buf;
    return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}
inline int read()
{
    register int x=0,f=1;register char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
    return x*f;
}
inline void write(register int x)
{
    if(!x)putchar('0');if(x<0)x=-x,putchar('-');
    static int sta[20];register int tot=0;
    while(x)sta[tot++]=x%10,x/=10;
    while(tot)putchar(sta[--tot]+48);
}
int T,n;
int a[N],b[N];
int main()
{
    T=read();
    while(T--){
        n=read();
        for(int i=1;i<=n;++i) a[i]=read();
        for(int i=1;i<=n;++i) b[i]=read();
        if(n==1||n==2){
            puts("Yes");
            continue;
        }
        bool fl=1;
        int sm=0;
        for(int i=1;i<=n;++i) sm+=b[i];
        for(int i=1;i<=n;++i)
            for(int j=1;j<=n;++j)
                if(a[i]>a[j]){
                    if(a[j]+sm-b[j]>a[i])
                        fl=0;
                }
        puts(fl?"Yes":"No");
    }
    return 0;
}

源文件, 语言: C++17

詳細信息

Test #1:

score: 100

Accepted

time: 2ms

memory: 3664kb

input:

output:

Yes
Yes
No

result:

ok 3 token(s): yes count is 2, no count is 1

Test #2:

score: -100

Wrong Answer

time: 2ms

memory: 3484kb

input:

output:

No
No
No
Yes
No
No
No
Yes
No
Yes
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
Yes
No
Yes
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
Yes
No
Yes
No
No
No
Yes
Yes
Yes
Yes
No
No
No
No
Yes
No
No
Yes
No
No
No
No
Yes
No
No
No
No
No
Yes
No
No
No
No
No
No
No
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
Yes
No...

result:

wrong answer expected NO, found YES [4th token]