Submission #1183748

#TimeUsernameProblemLanguageResultExecution timeMemory
1183748gyg수천개의 섬 (IOI22_islands)C++20
6.75 / 100
20 ms7496 KiB
#include "islands.h" #include <bits/stdc++.h> using namespace std; #define arr array #define vec vector #define var variant #define pii pair<int, int> #define fir first #define sec second const int N = 1e5 + 5; int n, m; arr<vec<pii>, N> adj; var<bool, vec<int>> find_journey(int _n, int _m, vec<int> _u, vec<int> _v) { n = _n, m = _m; for (int i = 0; i < m; i++) { int u = _u[i] + 1, v = _v[i] + 1; adj[u].push_back({v, i}); } if (adj[1].size() < 2 || adj[2].size() < 1) return false; vec<int> ans = {adj[1][0].sec, adj[2][0].sec, adj[1][1].sec, adj[1][0].sec, adj[2][0].sec, adj[1][1].sec}; 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...