제출 #627262

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
627262	2022-08-12 11:45:10	model_code	수천개의 섬 (IOI22_islands)	C++17	26 / 100	1105 ms	745980 KiB

islands

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
// failed/solution-bidirectional.cpp
#include "islands.h"
#include <bits/stdc++.h>
#define edge std::pair<int,int>
std::variant<bool, std::vector<int>> find_journey(int, int M, std::vector<int> U, std::vector<int> V) {
  // adj vector
  std::vector<edge> path[1111], path_rev[1111];
  for (int i = 0; i < M; i++){
    path[U[i]].push_back({V[i], i});
    path_rev[V[i]].push_back({U[i], i});
  }
  // move forward until we find a node with > 1 new outdegree (not including the one we come from)
  int curr_pos = 0;
  int prev = -1;
  std::vector<int> sol, tmp;
  while (true) {
    if (curr_pos == 0 && path[curr_pos].size() == 0) // dead-end
      return false;
    else if (curr_pos != 0 && path[curr_pos].size() == 1) // dead-end
      return false;
    // we're at the 0, and and only have 1 path forward
    else if (curr_pos == 0 && path[curr_pos].size() == 1) {
      int idx = 0;
      prev = curr_pos;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 5
• Subtask 2: 5 / 5
• Subtask 3: 21 / 21
• Subtask 4: 0 / 24
• Subtask 5: 0 / 45