제출 #1324876

#제출 시각아이디문제언어결과실행 시간메모리
1324876kenkunkinIsland Hopping (JOI24_island)C++20
100 / 100
5 ms400 KiB
#include <bits/stdc++.h>
#include "island.h"
using namespace std;


const int maxn=3e2+5;
bool d[maxn];
void solve(int n,int l)
{
    d[1]=1;
    for (int i=1;i<n;i++)
    {
        int x=query(1,i);
        if (d[x])   continue;
        d[x]=1;
        for (int j=1;j<n;j++)
        {
            int y=query(x,j);
            answer(x,y);
            if (d[y]) break;
            d[y]=1;
        }
    }
}
#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...