Submission #1024624

#TimeUsernameProblemLanguageResultExecution timeMemory
1024624vjudge1Thousands Islands (IOI22_islands)C++17
1.75 / 100
36 ms8856 KiB
#include <bits/stdc++.h> #include <variant> #define f first #define s second #define ent '\n' using namespace std; typedef long long ll; const int maxn = 2e5 + 12; const int mod = 1e9 + 2022; vector<int> g[maxn]; int n, m; variant<bool, vector<int>> find_journey(int N, int M, vector<int> u, vector<int> v){ n = N, m = M; for(int i=0;i<m;i++){ g[u[i]].push_back(i); } if(g[0].size() >= 2 && g[1].size() >= 2){ vector<int> ans; ans = {g[0][0], g[1][0], g[0][1], g[1][1], g[1][0], g[0][0], g[1][1], g[0][1]}; return ans; } return false; }
#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...