제출 #1235585

#제출 시각아이디문제언어결과실행 시간메모리
1235585Ghulam_Junaid수천개의 섬 (IOI22_islands)C++20
10 / 100
20 ms8260 KiB
#include <bits/stdc++.h> #include "islands.h" using namespace std; const int N = 1e3 + 10; int n, m, out[N], edge[N][N]; vector<int> g[N]; variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) { n = N, m = M; for (int i = 0; i < m; i ++){ g[U[i]].push_back(i); edge[U[i]][V[i]] = i; out[U[i]]++; } if (N == 2){ if (out[0] < 2 or out[1] < 1) return false; int e1 = g[0][0], e2 = g[0][1], e3 = g[1][0]; return vector<int>({e1, e3, e2, e1, e3, e2}); } int e1 = edge[0][1], e2 = edge[1][2], e3 = edge[2][0]; int e4 = edge[1][0], e5 = edge[2][1], e6 = edge[0][2]; return vector<int>({e1, e2, e3, e6, e5, e4, e3, e2, e1, e4, e5, e6}); if (N == 4) { return vector<int>({0, 1, 2, 4, 0, 3, 2, 1, 4, 3}); } 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...