Submission #370992

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
370992	2021-02-25 11:18:45	KoD	Simurgh (IOI17_simurgh)	C++17	51 / 100	331 ms	4712 KiB

simurgh

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
#include <bits/stdc++.h>
#include "simurgh.h"
template <class T>
using Vec = std::vector<T>;
Vec<int> find_roads(int n, Vec<int> U, Vec<int> V) {
  Vec<Vec<std::pair<int, int>>> graph(n);
  const int m = (int) U.size();
  for (int i = 0; i < m; ++i) {
    graph[U[i]].emplace_back(V[i], i);
    graph[V[i]].emplace_back(U[i], i);
  }
  Vec<char> visited(n);
  Vec<int> depth(n), pedge(n, -1);
  Vec<int> edges;
  std::set<int> tree;
  auto dfs = [&](auto dfs, const int u) -> void {
    visited[u] = true;
    for (const auto [v, e]: graph[u]) {
      if (visited[v]) {
        if (depth[u] + 1 < depth[v]) {
          edges.push_back(e);
        }
      }
      else {
        depth[v] = depth[u] + 1;
        pedge[v] = e;
        tree.insert(e);
        dfs(dfs, v);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 13 / 13
• Subtask 2: 17 / 17
• Subtask 3: 21 / 21
• Subtask 4: 0 / 19
• Subtask 5: 0 / 30