#include <bits/stdc++.h>
#include "island.h"
using namespace std;
void solve(int n, int q) {
set <pair <int, int>> ans;
for (int i = 1; i <= n; i++) {
int u = i;
int v = query(u, 1);
if (u > v) swap(u, v);
ans.insert({u, v});
}
for (auto [u, v] : ans) answer(u, v);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |