Submission #1312475

#TimeUsernameProblemLanguageResultExecution timeMemory
1312475kawhietThousands Islands (IOI22_islands)C++20
6.75 / 100
19 ms5936 KiB
#include <bits/stdc++.h>
#include "islands.h"
using namespace std;

variant<bool, vector<int>> find_journey(int n, int m, vector<int> u, vector<int> v) {
  vector<int> d(n);
  vector<vector<int>> g(n);
  for (int i = 0; i < m; i++) {
    d[u[i]]++;
    g[u[i]].push_back(i);
  }
  if (d[0] <= 1 || d[1] == 0) {
    return false;
  }
  int x = g[0][0], y = g[0][1], z = g[1][0];
  return vector<int>{x, z, y, x, z, y};
}
#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...