QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#120044	#2616. Attack Order	solemntee	WA	2ms	3624kb	C++20	1.4kb	2023-07-06 12:31:13	2023-07-06 12:31:13

Judging History

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

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

[2023-07-06 12:31:13]
评测

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

查看

[2023-07-06 12:31:13]
提交

answer

#include<bits/stdc++.h>
using namespace std;
const int N=2e6+5;
typedef long long ll;
int main(){
    int t;
    scanf("%d",&t);
    while(t--){
        int n;
        scanf("%d",&n);
        vector<int>a(n+1),b(n+1);
        ll sum=0;
        for(int i=1;i<=n;i++){
            scanf("%d%d",&a[i],&b[i]);
            sum+=b[i];
        }
        if(n==2){
            printf("Yes\n");
            continue;
        }
        vector<vector<int>>v(n+1,vector<int>()),v2(n+1,vector<int>());
        vector<int>in(n+1);
        bool flag=false;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++)if(j!=i){
                if(sum-b[i]+a[i]<=a[j]){
                    v[i].push_back(j);
                    v2[j].push_back(i);
                    in[i]++;
                }
            }
        }
        queue<int>q;
        vector<int>dp(n+1);
        for(int i=1;i<=n;i++)if(in[i]==0){
            q.push(i);
            dp[i]=1;
        }
        //printf("YES\n");
        while(!q.empty()){
            int p=q.front();
            q.pop();
            for(auto to:v2[p]){
                in[to]--;
                dp[to]=max(dp[to],dp[p]+1);
                if(in[to]==0){
                    q.push(to);
                }
            }
        }
        for(int i=1;i<=n;i++){
            if(dp[i]==n)flag=true;
        }
        if(flag)printf("Yes\n");
        else printf("No\n");

    }
	return 0;
}

源文件, 语言: C++20

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3624kb

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: 3620kb

input:

output:

No
No
No
No
No
No
No
Yes
No
Yes
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
No
Yes
No
No
Yes
No
No
Yes
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
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...

result:

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