제출 #627265

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
627265	2022-08-12 11:45:24	model_code	수천개의 섬 (IOI22_islands)	C++17	34 / 100	1096 ms	131724 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-prabowo-fail.cpp
#include "islands.h"
#include <functional>
#include <queue>
#include <utility>
#include <variant>
#include <vector>
std::vector<std::vector<std::pair<int, int>>> pruneNoOutgoing(
    int N, int M, std::vector<int> &U, std::vector<int> &V) {
  std::vector<int> deg(N);
  std::vector<std::vector<std::pair<int, int>>> radj(N);
  for (int i = 0; i < M; ++i) {
    if (U[i] < 0) {
      continue;
    }
    radj[V[i]].emplace_back(U[i], i);
    ++deg[U[i]];
  }
  std::queue<int> q;
  for (int i = 0; i < N; ++i) {
    if (deg[i] == 0) {
      q.push(i);
    }
  }
  std::vector<bool> removed(N, false);
  while (!q.empty()) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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