QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#537613 | #9156. 百万富翁 | kimmoqt# | 15 | 618ms | 24072kb | C++20 | 881b | 2024-08-30 16:39:50 | 2024-08-30 16:39:51 |
Judging History
answer
#include "richest.h"
#include <bits/stdc++.h>
using namespace std;
int richest(int N, int T, int S) {
vector<int> a,b;
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> res=ask(a,b);
vector<vector<int>> comp(N,vector<int>(N));
int cnt=0;
for(int i=0;i<N;i++) {
for(int j=i+1;j<N;j++) {
comp[i][j]=res[cnt];
comp[j][i]=res[cnt];
cnt++;
}
}
vector<int> ord;
for(int i=0;i<N;i++) ord.push_back(i);
sort(ord.begin(),ord.end(),[&](int i, int j){
return comp[i][j]==i;
});
return ord[0];
}
Details
Tip: Click on the bar to expand more detailed information
Pretests
Pretest #1:
score: 15
Accepted
time: 618ms
memory: 23636kb
input:
1000 1 499500 957319859
output:
Correct 7127326332295218295 1.000000 1331569654267968081
result:
points 1.0 Correct
Pretest #2:
score: 0
Time Limit Exceeded
input:
1000000 20 2000000 29091473
output:
Unauthorized output
result:
Final Tests
Test #1:
score: 15
Accepted
time: 615ms
memory: 24072kb
input:
1000 1 499500 957319857
output:
Correct 7127326332295218295 1.000000 1331569654267968081
result:
points 1.0 Correct
Test #2:
score: 0
Memory Limit Exceeded
input:
1000000 20 2000000 29091471
output:
Unauthorized output