QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #488481 | #9156. 百万富翁 | JohnAlfnov# | 15 | 619ms | 27304kb | C++14 | 405b | 2024-07-24 08:17:34 | 2024-07-24 08:17:35 |
Judging History
answer
#include "richest.h"
#include<bits/stdc++.h>
using namespace std;
int cnt[1000005];
int richest(int N,int T,int S){
if(T==1){
vector<int>a,b;
for(int i=1;i<N;++i)for(int j=i+1;j<=N;++j){
a.emplace_back(i-1);b.emplace_back(j-1);
}
vector<int>c=ask(a,b);
for(int i=0;i<N;++i)cnt[i]=0;
for(auto z:c)++cnt[z];
for(int i=0;i<N;++i)if(cnt[i]==N-1)return i;
}
return 1;
}
详细
Pretests
Pretest #1:
score: 15
Accepted
time: 619ms
memory: 27304kb
input:
1000 1 499500 957319859
output:
Correct 7127326332295218295 1.000000 1331569654267968081
result:
points 1.0 Correct
Pretest #2:
score: 0
Wrong Answer
time: 13ms
memory: 24148kb
input:
1000000 20 2000000 29091473
output:
Wrong answer 4459638610240858557 0.000000 6906350380861515327
result:
points 0.0 Wrong answer
Final Tests
Test #1:
score: 15
Accepted
time: 616ms
memory: 27176kb
input:
1000 1 499500 957319857
output:
Correct 7127326332295218295 1.000000 1331569654267968081
result:
points 1.0 Correct
Test #2:
score: 0
Wrong Answer
time: 17ms
memory: 24488kb
input:
1000000 20 2000000 29091471
output:
Wrong answer 4459638610240858557 0.000000 6906350380861515327
result:
points 0.0 Wrong answer