Submission #1077016

#TimeUsernameProblemLanguageResultExecution timeMemory
1077016mariaclaraThousands Islands (IOI22_islands)C++17
5 / 100
32 ms8272 KiB
#include "islands.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> pii; #define all(x) x.begin(), x.end() #define sz(x) (int)x.size() #define pb push_back #define mk make_pair #define fr first #define sc second variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) { int edges[N][N]; for(int i = 0; i < M; i++) edges[U[i]][V[i]] = i; if(N == 2) return false; vector<int> ans; ans.pb(edges[0][1]); // 0 pra 1 ans.pb(edges[1][0]); // 1 pra 0 ans.pb(edges[0][2]); // 0 pra 2 ans.pb(edges[2][0]); // 2 pra 0 ans.pb(edges[1][0]); // 0 pra 1 ans.pb(edges[0][1]); // 1 pra 0 ans.pb(edges[2][0]); // 0 pra 2 ans.pb(edges[0][2]); // 2 pra 0 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...