QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #490663 | #9156. 百万富翁 | xvzhiming# | 0 | 124ms | 47148kb | C++20 | 337b | 2024-07-25 16:02:42 | 2024-07-25 16:02:45 |
Judging History
answer
#pragma GCC optimize(2)
#pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#include "richest.h"
using namespace std;
int richest(int n, int k, int m) {
int id = 0;
for (int i = 1; i < n; i++) {
vector <int> c = ask({id}, {i});
id = c[0];
}
return id;
}
//int main() {
//
// return 0;
//}
Details
Tip: Click on the bar to expand more detailed information
Pretests
Pretest #1:
score: 0
Wrong Answer
time: 1ms
memory: 7956kb
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: 124ms
memory: 47148kb
input:
1000000 20 2000000 29091473
output:
Too many queries 1294109832092195181 0.000000 6906350380861515327
result:
points 0.0 Too many queries
Final Tests
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 7956kb
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: 121ms
memory: 47080kb
input:
1000000 20 2000000 29091471
output:
Too many queries 1294109832092195181 0.000000 6906350380861515327
result:
points 0.0 Too many queries