Submission #1320265

#TimeUsernameProblemLanguageResultExecution timeMemory
1320265thelegendary08Island Hopping (JOI24_island)C++17
100 / 100
3 ms408 KiB
#include "island.h"
#include<bits/stdc++.h>
using namespace std;
void solve(int N, int L) {
	vector<bool> vis(N+1); vis[1]=1; vector<int>ord; for(int i = 1; i < N; i++)ord.push_back(query(1,i)); //for(auto u : ord)cout<<u<<' '; cout<<'\n';
	for(int i = 0; i < N-1; i++){
		int cur = ord[i]; if(vis[cur])continue; vis[cur] = 1; vector<int>tmp;
		for(int j = 1; j < N; j++){
			int c = query(cur, j); tmp.push_back(c); answer(cur,c); if(vis[c])break;
		} for(auto u : tmp)vis[u]=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...