Submission #1150214

#TimeUsernameProblemLanguageResultExecution timeMemory
1150214emptypringlescanIsland Hopping (JOI24_island)C++20
100 / 100
2 ms420 KiB
#include "island.h"
#include <bits/stdc++.h>
using namespace std;
void solve(int n, int L){
	int got[n+1];
	memset(got,0,sizeof(got));
	got[1]=1;
	vector<pair<int,int> > ed;
	for(int i=1; i<n; i++){
		int x=query(1,i);
		if(got[x]) continue;
		got[x]=1;
		int cnt=1;
		while(true){
			int y=query(x,cnt);
			ed.push_back({x,y});
			if(got[y]) break;
			got[y]=1;
			cnt++;
		}
	}
	for(pair<int,int> i:ed) answer(i.first,i.second);
}
#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...