Submission #835866

#TimeUsernameProblemLanguageResultExecution timeMemory
835866APROHACKThousands Islands (IOI22_islands)C++17
1.75 / 100
28 ms27896 KiB
#include "islands.h"
#define pb push_back
#define ll long long
#include <variant>
#include <vector>
using namespace std;

std::variant<bool, std::vector<int>> find_journey(
	int N, int M, std::vector<int> U, std::vector<int> V) {
	int cuenta[N][N];

	vector<int>parejas[N][N];
	for(int i = 0 ; i < N ; i ++){
		for(int j = 0 ; j < N ; j ++){
			cuenta[i][j] = 0;
		}
	}
	for(int i = 0 ; i < M ; i ++ ){
		cuenta[U[i]][V[i]] ++  ;
		parejas[U[i]][V[i]].pb(i);
	}

	if (N == 2) {
		if(cuenta[0][1] >= 2 and cuenta[1][0] >= 1)return true;
		return false;
  	}
	return false;
}
#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...