Submission #1074393

#	Time	Username	Problem	Language	Result	Execution time	Memory
1074393		fv3	수천개의 섬 (IOI22_islands)	C++17	0 / 100	21 ms	5552 KiB

islands

#include "islands.h"
#include <bits/stdc++.h>

using namespace std;
vector<vector<pair<int, int>>> adj;
vector<int> res, visited;
bool ok;

void DFS(int index)
{
  visited[index] = 1;
  for (auto node : adj[index])
  {
    if (visited[node.first]) 
    {
      ok = true;
      return;
    }
    DFS(node.first);
  }
}

variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) 
{
  adj = vector<vector<pair<int, int>>>(N);
  res = vector<int>();
  for (int i = 0; i < M; i += 2)
  {
    adj[U[i]].push_back({V[i], i});
  }

  ok = false;
  visited = vector<int>(N);
  DFS(0);

  if (ok)
    return vector<int>({0});
  return false;
}

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