Submission #767202

#TimeUsernameProblemLanguageResultExecution timeMemory
767202t6twotwo수천개의 섬 (IOI22_islands)C++17
10 / 100
27 ms4412 KiB
#include "islands.h" #include <bits/stdc++.h> using namespace std; variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) { if (N == 2) { vector<int> a, b; for (int i = 0; i < M; i++) { if (U[i] == 0) { a.push_back(i); } else { b.push_back(i); } } if (a.size() >= 2 && b.size() >= 1) { return vector{a[0], b[0], a[1], a[0], b[0], a[1]}; } else { return false; } } bool subtask3 = 0; bool subtask4 = 0; if (M % 2 == 0) { subtask3 = 1; subtask4 = 0; for (int i = 0; i < M; i += 2) { if (U[i] != V[i + 1] || V[i] != U[i + 1]) { subtask3 = 0; } if (U[i] != U[i + 1] || V[i] != V[i + 1]) { subtask4 = 0; } } } if (subtask3 && 0) { vector<vector<pair<int, int>>> adj(N); for (int i = 0; i < M; i++) { adj[U[i]].emplace_back(V[i], i); } vector<bool> vis(N); int x = 0; while (1) { if (adj[x].size() > 1) { return true; } if (adj[x].empty()) { return false; } vis[x] = 1; if (vis[adj[x][0].first]) { return true; } x = adj[x][0].first; } } int s[3][3]; for (int i = 0; i < M; i++) { if (U[i] < 3 && V[i] < 3) { s[U[i]][V[i]] = i; } } return vector{s[0][1], s[1][2], s[2][0], s[0][2], s[2][1], s[1][0], s[2][0], s[1][2], s[0][1], s[1][0], s[2][1], s[0][2]}; }

Compilation message (stderr)

islands.cpp: In function 'std::variant<bool, std::vector<int, std::allocator<int> > > find_journey(int, int, std::vector<int>, std::vector<int>)':
islands.cpp:21:10: warning: variable 'subtask4' set but not used [-Wunused-but-set-variable]
   21 |     bool subtask4 = 0;
      |          ^~~~~~~~
#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...