제출 #1332396

#제출 시각아이디문제언어결과실행 시간메모리
13323962sqrt3Island Hopping (JOI24_island)C++20
65 / 100
3 ms436 KiB
#include "island.h"
#include <vector>
#include <set>

using namespace std;

void solve(int N, int L) {
    vector<int> A(N);
    A[0] = 1;
    for (int i = 1; i < N; ++i) {
        A[i] = query(1, i);
    }
    vector<set<int>> known(N + 1);
    for (int i = N - 1; i >= 1; --i) {
        int v = A[i];
        int idx = 1;
        while (true) {
            int u = query(v, idx++);
            if (known[v].find(u) == known[v].end()) {
                answer(v, u);
                known[u].insert(v);
                break;
            }
        }
    }
}
#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...