Submission #1256498

#TimeUsernameProblemLanguageResultExecution timeMemory
1256498keremIsland Hopping (JOI24_island)C++20
28 / 100
3 ms428 KiB
#include "island.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back


int n,R=-1,ind[305];
vector<int> g[305];

void dfs(int x,int ata){
	if(ata!=0) answer(x,ata);
	int y=query(x,++ind[x]);
	while(!(ind[y]!=0 && y!=ata) && !(ata==1 && y==R)){
		if(y!=ata)
			dfs(y,x);
		if(ind[x]==n-1) break;
		y=query(x,++ind[x]);
	}
}
void solve(int N, int L){
	n=N;
	int tmp=query(1,2);
	if(query(tmp,1)==1)
		R=tmp;
	dfs(1,0);
}
#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...