제출 #797659

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
797659		Osplei	수천개의 섬 (IOI22_islands)	C++17	0 / 100	23 ms	4912 KiB

islands

#include <bits/stdc++.h>
 
using namespace std;
 
typedef pair<int,int> ii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii; 
typedef vector<vii> wgraf;
typedef pair<int,ii> edge;
typedef vector <ll> vl;
typedef pair <ll, ll> LL;
typedef vector <LL> vll;
 
#define UNVISITED 0
#define VISITED 1
#define pb push_back
#define F first
#define S second

struct nodo{
	int v, id;
};

variant <bool, vector <int>> find_journey(int N, int M, vector <int> U, vector <int> V){
	
	vector <int> ans;
	
	if (N==1) return false;

	if (N<=400){
			
		vector <nodo> grafo[N+5];
 
		for (int i=0; i<M; i++) {
			grafo[U[i]].pb({V[i], i});
		}

		ans.pb(grafo[0][0].id);
		ans.pb(grafo[grafo[0][0].v][0].id);

		ans.pb(grafo[0][1].id);
		ans.pb(grafo[grafo[0][1].v][0].id);

		ans.pb(grafo[grafo[0][0].v][0].id);
		ans.pb(grafo[0][0].id);

		ans.pb(grafo[grafo[0][1].v][0].id);
		ans.pb(grafo[0][1].id);
 
		return ans;

	} else return false;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 21
• Subtask 4: 0 / 24
• Subtask 5: 0 / 45