Submission #837305

#TimeUsernameProblemLanguageResultExecution timeMemory
837305ymmThousands Islands (IOI22_islands)C++17
5 / 100
31 ms5092 KiB
#include "islands.h" #include <bits/stdc++.h> #define Loop(x,l,r) for (ll x = (l); x < (r); ++x) typedef long long ll; typedef std::pair<int,int> pii; using namespace std; std::variant<bool, std::vector<int>> find_journey( int N, int M, std::vector<int> U, std::vector<int> V) { vector<int> v[2]; Loop (i,0,M) v[U[i]].push_back(i); if (v[0].size() < 2 || v[1].size() < 1) return false; vector<int> ans = { v[0][0], v[1][0], v[0][1], v[0][0], v[1][0], v[0][1], }; 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...