Submission #1316800

#TimeUsernameProblemLanguageResultExecution timeMemory
1316800mikolaj00Island Hopping (JOI24_island)C++20
100 / 100
3 ms400 KiB
#include <bits/stdc++.h>
#include "island.h"
using namespace std;

void solve(int N, int L)
{
    vector<bool> vis(N+1);
    vis[1] = true;
    for (int i = 1; i < N; i++)
    {
        int x = query(1, i);
        if (vis[x])
            continue;
        vis[x] = true;

        for (int j = 1; j < N; j++)
        {
            int y = query(x, j);
            answer(x, y);
            
            if (vis[y])
                break;
            vis[y] = true;
        }
    }
}
#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...