Submission #831388

#TimeUsernameProblemLanguageResultExecution timeMemory
831388NeroZein수천개의 섬 (IOI22_islands)C++17
1.75 / 100
26 ms3944 KiB
#include "islands.h"
#include <variant>
#include <vector>
#include <bits/stdc++.h>

using namespace std;

std::variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) {
  map<pair<int, int>, int> mp; 
  for (int i = 0; i < M; ++i) {
     mp[{U[i], V[i]}]++;
  }
  for (auto p : mp) {
    if (p.first.first == 0 && p.second > 1 && mp[{p.first.second, p.first.first}] > 0) {
      return true; 
    }
  }
  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...