Submission #628515

#TimeUsernameProblemLanguageResultExecution timeMemory
628515c28dnv9q3Thousands Islands (IOI22_islands)C++17
0 / 100
66 ms7200 KiB
#include "islands.h"

#include <variant>
#include <vector>
#include <map>
using namespace std;

variant<bool, vector<int>> find_journey(
    int N, int M, vector<int> U, vector<int> V) {
  map<pair<int,int>, int> m;
  for (int i = 0; i < M; i++)
    m[{U[i], V[i]}] = i;
  if (N < 4)
    return false;
  int c0 = m[{0,1}];
  int c1 = m[{1,2}];
  int c2 = m[{2,3}];
  int c3 = m[{0,3}];
  int c4 = m[{3,1}];
  return vector<int>{
    c0, c1, c2, c4, c0, c3, c2, c1, c4, c3
  };
}
#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...