QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#537601 | #9156. 百万富翁 | Nevll# | 0 | 155ms | 68148kb | C++14 | 549b | 2024-08-30 16:27:09 | 2024-08-30 16:27:11 |
Judging History
answer
#include "richest.h"
# include <bits/stdc++.h>
# define ll long long
# define fi first
# define se second
# define pii pair<int, int>
using namespace std;
int richest(int N, int T, int S) {
vector<int> nw;
for(int i=0;i<N;i++) nw.push_back(i);
while(nw.size() > 1) {
vector<int> as1, as2;
as1.clear();
as2.clear();
for(int i=0;i+1<nw.size();i+=2) {
as1.push_back(nw[0]);
as2.push_back(nw[1]);
}
nw = ask(as1, as2);
}
return nw[0];
}
Details
Tip: Click on the bar to expand more detailed information
Pretests
Pretest #1:
score: 0
Wrong Answer
time: 0ms
memory: 7960kb
input:
1000 1 499500 957319859
output:
Too many queries 1294109832092195181 0.000000 6906350380861515327
result:
points 0.0 Too many queries
Pretest #2:
score: 0
Wrong Answer
time: 155ms
memory: 68148kb
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: 1ms
memory: 7980kb
input:
1000 1 499500 957319857
output:
Too many queries 1294109832092195181 0.000000 6906350380861515327
result:
points 0.0 Too many queries
Test #2:
score: 0
Wrong Answer
time: 146ms
memory: 68140kb
input:
1000000 20 2000000 29091471
output:
Wrong answer 4459638610240858557 0.000000 6906350380861515327
result:
points 0.0 Wrong answer