QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #507588 | #9156. 百万富翁 | lin1991122 | 15 | 624ms | 25392kb | C++14 | 596b | 2024-08-06 19:34:06 | 2024-08-06 19:34:07 |
Judging History
answer
#include<bits/stdc++.h>
#include "richest.h"
using namespace std;
const int N=1e6+3;
bitset<N>vis;
int richest(int n,int t,int s){
if(t==1){
for(int i=0;i<n;++i)vis[i]=0;
vector<int>q1,q2;
for(int i=0;i<n;++i)
for(int j=i+1;j<n;++j)
q1.push_back(i),q2.push_back(j);
vector<int>res=ask(q1,q2);
int len=q1.size();
for(int i=0;i<len;++i)
if(res[i]==q1[i])vis[q2[i]]=1;
else vis[q1[i]]=1;
for(int i=0;i<n;++i)
if(!vis[i])return i;
}
return 1;
}
Details
Tip: Click on the bar to expand more detailed information
Pretests
Pretest #1:
score: 15
Accepted
time: 613ms
memory: 25392kb
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: 23400kb
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: 624ms
memory: 25288kb
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: 23432kb
input:
1000000 20 2000000 29091471
output:
Wrong answer 4459638610240858557 0.000000 6906350380861515327
result:
points 0.0 Wrong answer