QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #492179 | #9156. 百万富翁 | zwh2008# | 15 | 631ms | 46900kb | C++14 | 372b | 2024-07-26 10:11:15 | 2024-07-26 10:11:16 |
Judging History
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);
for(int i=0;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=0;i<n;i++)if(ct[i]==n-1)return i;
}
return 0;
}
详细
Pretests
Pretest #1:
score: 15
Accepted
time: 629ms
memory: 21896kb
input:
1000 1 499500 957319859
output:
Correct 7127326332295218295 1.000000 1331569654267968081
result:
points 1.0 Correct
Pretest #2:
score: 0
Wrong Answer
time: 11ms
memory: 46852kb
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: 631ms
memory: 23156kb
input:
1000 1 499500 957319857
output:
Correct 7127326332295218295 1.000000 1331569654267968081
result:
points 1.0 Correct
Test #2:
score: 0
Wrong Answer
time: 18ms
memory: 46900kb
input:
1000000 20 2000000 29091471
output:
Wrong answer 4459638610240858557 0.000000 6906350380861515327
result:
points 0.0 Wrong answer