# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1058108 | SalihSahin | Thousands Islands (IOI22_islands) | C++17 | 19 ms | 4440 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define pb push_back
using namespace std;
#include "islands.h"
std::variant<bool, std::vector<int>> find_journey(int N, int M, std::vector<int> U, std::vector<int> V) {
if(N == 2){
vector<int> c[2];
for(int i = 0; i < M; i++){
if(U[i] == 0) c[0].pb(i);
else c[1].pb(i);
}
if(c[0].size() > 1 && c[1].size() > 0){
int x = c[0][0], y = c[0][1], z = c[1][0];
vector<int> ans = {x, z, y, x, z, y};
return ans;
}
else return false;
}
if(N <= 400){
vector<vector<int> > cnt(N, vector<int>(N, -1));
for(int i = 0; i < M; i++){
cnt[U[i]][V[i]] = i;
}
bool ok = 1;
for(int i = 0; i < N; i++){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |