제출 #1329951

#제출 시각아이디문제언어결과실행 시간메모리
1329951huoiIsland Hopping (JOI24_island)C++17
22 / 100
3 ms420 KiB
#include "island.h"
#include <bits/stdc++.h>
using namespace std;

vector<bool> vis;

void dfs(int u) {
    vis[u] = true;
    for (int k = 1; k <= 2; k++) {
        int v = query(u, k);
        if (vis[v]) continue;
        answer(u, v);
        dfs(v);
    }
}

void solve(int N, int L) {
    vis.resize(N + 1);
    vis[1] = true;

    vector<int> roots(3);
    for (int i = 0; i < 3; i++) {
        roots[i] = query(1, i + 1);
        answer(1, roots[i]);
        vis[roots[i]] = true;
    }

    for (int root : roots) {
        dfs(root);
    }
}
#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...