Submission #1329936

#TimeUsernameProblemLanguageResultExecution timeMemory
1329936huoiIsland Hopping (JOI24_island)C++17
0 / 100
1 ms412 KiB
#include "island.h"
#include <bits/stdc++.h>
using namespace std;

void solve(int N, int L) {
    vector<set<int>> adj(N + 1);
    for (int u = 1; u < N; u++) {
        int v = query(u, 1);
        if (adj[v].find(u) != adj[v].end()) v = query(u, 2);
        cout << u << " " << v << "\n";
        adj[u].insert(v);
        adj[v].insert(u);
        answer(u, v);
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...