Submission #745234

#TimeUsernameProblemLanguageResultExecution timeMemory
745234math_rabbit_1028수천개의 섬 (IOI22_islands)C++17
0 / 100
46 ms9048 KiB
#include "islands.h"

#include <bits/stdc++.h>
using namespace std;

int n, m;
vector<int> adj[101010];

std::variant<bool, std::vector<int>> find_journey(
    int N, int M, std::vector<int> U, std::vector<int> V) {
  n = N; m = M;
  for (int i = 0; i < m; i++) {
    adj[U[i]].push_back(V[i]);
    adj[V[i]].push_back(U[i]);
  }
  if (adj[0].size() > 0) {
    vector<int> ret;
    ret.push_back(0);
    ret.push_back(adj[0][0]);
    ret.push_back(0);
    return ret;
  }
  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...