QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#492176	#9156. 百万富翁	zwh2008^#	0	16ms	23352kb	C++14	377b	2024-07-26 10:10:38	2024-07-26 10:10:39

Judging History

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

[2024-07-26 10:10:39]
评测

测评结果：0
用时：16ms
内存：23352kb

查看

[2024-07-26 10:10:38]
提交

answer

#include<bits/stdc++.h>
#include "richest.h"
using namespace std;
int richest(int n,int T,int S) {
    if(T==1) {
        vector<int>a,b,ct(n+1);
        for(int i=1;i<=n;i++)for(int j=i+1;j<=n;j++)a.push_back(i),b.push_back(j);
        vector<int>c=ask(a,b);
        for(int i:c)ct[i]++;
        for(int i=1;i<=n;i++)if(ct[i]==n-1)return i;
    }
    return 1;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Pretests

Pretest #1:

score: 0

Wrong Answer

time: 4ms

memory: 15864kb

input:

1000 1 499500 957319859

output:

Index out of bounds
9775460264716263939
0.000000
6906350380861515327

result:

points 0.0 Index out of bounds

Pretest #2:

score: 0

Wrong Answer

time: 16ms

memory: 23352kb

input:

1000000 20 2000000 29091473

output:

Wrong answer
4459638610240858557
0.000000
6906350380861515327

result:

points 0.0 Wrong answer

Final Tests

Test #1:

score: 0

Wrong Answer

time: 3ms

memory: 15972kb

input:

1000 1 499500 957319857

output:

Index out of bounds
9775460264716263939
0.000000
6906350380861515327

result:

points 0.0 Index out of bounds

Test #2:

score: 0

Wrong Answer

time: 12ms

memory: 23352kb

input:

1000000 20 2000000 29091471

output:

Wrong answer
4459638610240858557
0.000000
6906350380861515327

result:

points 0.0 Wrong answer