Submission #831433

#	Time	Username	Problem	Language	Result	Execution time	Memory
831433		NeroZein	수천개의 섬 (IOI22_islands)	C++17	1.75 / 100	413 ms	65668 KiB

islands

#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) {
  if (N == 2) return false;
  map<pair<int, int>, int> mp;
  for (int i = 0; i < M; ++i) {
    mp[{U[i], V[i]}] = i;
  }
  vector<int> Path = {0, 1, 2, 0, 2, 1, 0, 1, 2, 0, 2, 1, 0};
  vector<int> ret;
  for (int i = 0; i < 6; ++i) {
    ret.push_back(mp[{Path[i], Path[i + 1]}]);
  }
  for (int i = 0; i < N; ++i) {
    for (int j = i + 1; j < N; ++j) {
      swap(mp[{i, j}], mp[{j, i}]);
    }
  }
  for (int i = 6; i < 12; ++i) {
    ret.push_back(mp[{Path[i], Path[i + 1]}]);
  }
  return ret;
}

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