Submission #1088389

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1088389	2024-09-14 10:18:27	tht2005	Designated Cities (JOI19_designated_cities)	C++17	16 / 100	145 ms	34132 KiB

designated_cities

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>
using namespace std;
typedef pair<long long, int> pi;
struct edge_t {
  int to, w, w_rev;
  edge_t(int x, int y, int z) : to(x), w(y), w_rev(z) {}
};
const int N = (int)2e5 + 10;
int n;
vector<edge_t> aj[N];
long long ans[N], r1[N];
pi dfs3(int v, int p, tuple<long long, int, int>& res) {
  pi mx(r1[v], v), mx2(-1, -1);
  for(const edge_t& e : aj[v]) {
    if(e.to == p)
      continue;
    pi tmp = dfs3(e.to, v, res);
    tmp.first += e.w + e.w_rev;
    if(mx < tmp)
      mx2 = mx, mx = tmp;
    else if(mx2 < tmp)
      mx2 = tmp;
  }
  if(mx2.first != -1 && get<0> (res) < mx.first + mx2.first) {
    res = { mx.first + mx2.first, mx.second, mx2.second };
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 6
• Subtask 2: 7 / 7
• Subtask 3: 9 / 9
• Subtask 4: 0 / 17
• Subtask 5: 0 / 17
• Subtask 6: 0 / 44