# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1058166 | SalihSahin | Thousands Islands (IOI22_islands) | C++17 | 16 ms | 4472 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"
const int N = 1e3 + 5;
vector<int> nodes, cycle, adj[N];
vector<bool> vis(N);
void dfs(int node){
if(cycle.size() > 0) return;
nodes.pb(node);
vis[node] = 1;
for(auto itr: adj[node]){
if(!vis[itr]){
dfs(itr);
}
if(itr == 0 && nodes.size() > 2) cycle = nodes;
if(cycle.size() > 0) return;
}
nodes.pop_back();
}
std::variant<bool, std::vector<int>> find_journey(int N, int M, std::vector<int> U, std::vector<int> V) {
if(N == 2){ // subtask 1
vector<int> c[2];
for(int i = 0; i < M; i++){
Compilation message (stderr)
# | 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... |