Submission #1076465

#TimeUsernameProblemLanguageResultExecution timeMemory
1076465zsomborThousands Islands (IOI22_islands)C++17
5 / 100
21 ms6732 KiB
#include "islands.h" #include <bits/stdc++.h> #include <variant> using namespace std; int n, m; vector<int> u; vector<int> v; vector<int> ans; void solve1() { vector<int> a; vector<int> b; for (int i = 0; i < m; i++) { if (!u[i]) a.push_back(i); else b.push_back(i); } if (a.size() < 2 || b.size() < 1) return; ans = {a[0], b[0], a[1], a[0], b[0], a[1]}; } variant<bool, vector<int> > find_journey(int N, int M, vector<int> U, vector<int> V) { n = N; m = M; u = U; v = V; if (n == 2) solve1(); if (ans.size()) 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...