Submission #1034500

#TimeUsernameProblemLanguageResultExecution timeMemory
1034500Mr_HusanboyThousands Islands (IOI22_islands)C++17
5 / 100
25 ms8272 KiB
#include "islands.h"

#include <variant>
#include <bits/stdc++.h>

using namespace std;

#define ff first
#define ss second
#define all(a) (a).begin(), (a).end()
#define ll long long
const int mod = 1000002022;

vector<int> state, p;
int n, m; 
vector<vector<int>> g;
template<typename T>
int len(T &a){return a.size();}

mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());


variant<bool, vector<int>> find_journey(
    int n, int m, std::vector<int> u, std::vector<int> v) {
  if(n == 2) return false;
  vector<vector<int>> can(n, vector<int>(n));
  for(int i = 0; i < m; i ++){
    can[u[i]][v[i]] = i;
  }

  vector<int> ans = {can[0][1], can[1][2], can[2][0], can[0][2], can[2][1], can[1][0], can[2][0], can[1][2], can[0][1], can[1][0], can[2][1], can[0][2]};
  return ans;
}
#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...