제출 #526647

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
526647	2022-02-15 20:19:39	sliviu	꿈 (IOI13_dreaming)	C++17	42 / 100	176 ms	25292 KiB

dreaming

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 <dreaming.h>
#include <bits/stdc++.h>
using namespace std;
int travelTime(int n, int m, int cost, int A[], int B[], int T[]) {
  int ans = 0, t = 0;
  vector<int> seen(n), dpu(n), dpb(n), cn;
  vector<vector<int>> pref(n), suf(n);
  deque<pair<int, int>> cur;
  vector<vector<pair<int, int>>> G(n);
  for (int i = 0; i < m; ++i) {
    G[A[i]].emplace_back(B[i], T[i]);
    G[B[i]].emplace_back(A[i], T[i]);
  }
  function<void(int, int)> dfs1 = [&](int node, int last) {
    cn.emplace_back(node);
    seen[node] = t;
    pref[node].emplace_back(0), suf[node].emplace_back(0);
    for (auto x : G[node])
      if (x.first != last) {
        dfs1(x.first, node);
        dpb[node] = max(dpb[node], dpb[x.first] + x.second);
        pref[node].emplace_back(dpb[x.first] + x.second);
        suf[node].emplace_back(dpb[x.first] + x.second);
      }
    pref[node].emplace_back(0), suf[node].emplace_back(0);
    int s = pref[node].size() - 1;
    for (int i = 1; i <= s; ++i)
      pref[node][i] = max(pref[node][i], pref[node][i - 1]);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 14 / 14
• Subtask 2: 10 / 10
• Subtask 3: 0 / 23
• Subtask 4: 18 / 18
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23