Submission #1215103

#TimeUsernameProblemLanguageResultExecution timeMemory
1215103dostsThousands Islands (IOI22_islands)C++20
5 / 100
19 ms6984 KiB
#include "islands.h" #include <bits/stdc++.h> #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2") //#define int long long #define pii pair<int,int> #define vi vector<int> #define ff first #define ss second #define sp << " " << #define all(x) x.begin(),x.end() #define big(x) ((int)(x.size())) using namespace std; const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9; std::variant<bool, std::vector<int>> find_journey(int N, int M, std::vector<int> U, std::vector<int> V) { if (N == 2) return false; int id[N][N]{}; for (int i = 0;i<M;i++) { id[U[i]][V[i]] = i; } return vi{id[0][1],id[1][2],id[2][1],id[0][1],id[0][2],id[1][2],id[2][1],id[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...