Submission #1084482

#TimeUsernameProblemLanguageResultExecution timeMemory
1084482SamueleVidThousands Islands (IOI22_islands)C++17
6.75 / 100
22 ms4440 KiB
#include <bits/stdc++.h> using namespace std; variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) { vector<int> el_primo; vector<int> el_secondo; for (int i = 0; i < M; i ++) { if (U[i] == 0) el_primo.push_back(i); else el_secondo.push_back(i); } if (el_primo.size() >= 2 && el_secondo.size() >= 1) { int a = el_primo[0]; int b = el_secondo[0]; int c = el_primo[1]; vector<int> res = {a, b, c, a, b, c}; return res; } 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...