Submission #1037515

#TimeUsernameProblemLanguageResultExecution timeMemory
103751512345678수천개의 섬 (IOI22_islands)C++17
0 / 100
25 ms3140 KiB
#include "islands.h" #include <bits/stdc++.h> using namespace std; const int nx=1e3+5; int cnt[nx]; std::variant<bool, std::vector<int>> find_journey(int N, int M, std::vector<int> U, std::vector<int> V) { for (int i=0; i<M; i+=2) cnt[U[i]]++, cnt[V[i]]++; if (cnt[0]>=2) return vector<int> {}; 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...