QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #621872 | #8650. Island Hopping | hhoppitree# | 0 | 1ms | 3968kb | C++17 | 356b | 2024-10-08 17:50:31 | 2024-10-08 17:50:32 |
answer
#include "island.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 505;
int vis[N];
void solve(int n, int) {
for (int i = 1, x; i <= n; ++i) {
if (vis[x = query(1, x)]++) continue;
for (int j = 1, y; ; ++j) {
if (vis[y = query(x, j)]++) continue;
answer(x, y);
}
}
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3928kb
input:
3 9
output:
2 -1
result:
wrong answer Wrong Answer [2]
Subtask #2:
score: 0
Wrong Answer
Test #4:
score: 0
Wrong Answer
time: 0ms
memory: 3924kb
input:
299 89401
output:
2 -1
result:
wrong answer Wrong Answer [2]
Subtask #3:
score: 0
Wrong Answer
Test #9:
score: 0
Wrong Answer
time: 1ms
memory: 3968kb
input:
299 598
output:
2 -1
result:
wrong answer Wrong Answer [2]
Subtask #4:
score: 0
Wrong Answer
Test #15:
score: 0
Wrong Answer
time: 0ms
memory: 3968kb
input:
299 89401
output:
2 -1
result:
wrong answer Wrong Answer [2]
Subtask #5:
score: 0
Wrong Answer
Test #23:
score: 0
Wrong Answer
time: 1ms
memory: 3968kb
input:
299 897
output:
2 -1
result:
wrong answer Wrong Answer [2]
Subtask #6:
score: 0
Wrong Answer
Test #32:
score: 0
Wrong Answer
time: 0ms
memory: 3848kb
input:
300 90000
output:
2 -1
result:
wrong answer Wrong Answer [2]
Subtask #7:
score: 0
Wrong Answer
Test #58:
score: 0
Wrong Answer
time: 1ms
memory: 3840kb
input:
300 900
output:
2 -1
result:
wrong answer Wrong Answer [2]
Subtask #8:
score: 0
Wrong Answer
Test #84:
score: 0
Wrong Answer
time: 1ms
memory: 3816kb
input:
299 598
output:
2 -1
result:
wrong answer Wrong Answer [2]