Submission #1230454

#TimeUsernameProblemLanguageResultExecution timeMemory
1230454madamadam3수천개의 섬 (IOI22_islands)C++20
5 / 100
18 ms4424 KiB
#include "islands.h" #include <bits/stdc++.h> using namespace std; using vi = vector<int>; int n, m; vi x, y; variant<bool, vi> find_journey(int N, int M, vi U, vi V) { n = N; m = M; x = U; y = V; if (n <= 2) return false; int ab, ba, ac, ca, bc, cb; for (int i = 0; i < m; i++) { int u = x[i], v = y[i]; if (u == 0 && v == 1) ab = i; else if (u == 1 && v == 0) ba = i; else if (u == 0 && v == 2) ac = i; else if (u == 2 && v == 0) ca = i; else if (u == 1 && v == 2) bc = i; else if (u == 2 && v == 1) cb = i; } return vi({ab, bc, ca, ac, cb, ba, ca, bc, ab, ba, cb, ac}); }
#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...