Submission #736361

#TimeUsernameProblemLanguageResultExecution timeMemory
736361jk410Thousands Islands (IOI22_islands)C++17
5 / 100
32 ms5180 KiB
#include "islands.h"
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> edge[2];
variant<bool, vector<int>> find_journey(int _n, int m, vector<int> u, vector<int> v) {
	n = _n;
	for (int i = 0; i < m; i++)
		edge[u[i]].push_back(i);
	if ((int)edge[0].size() < 2 || (int)edge[1].size() < 1)
		return false;
	return vector<int>({edge[0][0],edge[1][0],edge[0][1],edge[0][0],edge[1][0],edge[0][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...