Submission #1034565

#TimeUsernameProblemLanguageResultExecution timeMemory
1034565Mr_HusanboyThousands Islands (IOI22_islands)C++17
10 / 100
22 ms9548 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) { vector<vector<int>> g(n); for(int i = 0; i < m; i ++) g[u[i]].push_back(i); if(len(g[0]) <= 1) return false; if(n == 2){ if(len(g[1]) == 0) return false; return vector {g[0][0], g[1][0], g[0][1], g[0][0], g[1][0], g[0][1]}; } vector can(n, vector(n, 0)); for(int i = 0; i < m; i++) can[u[i]][v[i]] = i; return vector{can[0][1], can[1][0], can[0][2], can[2][0], can[1][0], can[0][1], can[2][0], can[0][2]}; }
#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...