#include<bits/stdc++.h>
#include"island.h"
#define exoworldgd cin.tie(0)->sync_with_stdio(0), cout.tie(0)
#define ll long long
using namespace std;
void solve(int N,int L){
int vis[305]={};vis[1]=1;
for(int i=1,x;i<N;i++) {
x=query(1,i);
if(vis[x])continue;
vis[x]=1;
for(int j=1,y;j<N;j++) {
y=query(x,j),answer(x,y);
if(vis[y])break;
vis[y]=1;
}
}
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |