oj.uz

Submission #986821

# Submission time Handle Problem Language Result Execution time Memory
986821 2024-05-21T09:52:02 Z huutuan Race (IOI11_race) C++14
43 / 100
 307 ms 68076 KB 
#include "race.h"

#include <bits/stdc++.h>

using namespace std;

#define int long long

const int N=2e5+10, M=1e6+10, inf=1e9;
int n, k, tin[N], tout[N], tdfs, tour[N];
vector<pair<int, int>> g[N];
int dep[N], dist[N], sz[N];
map<int, int> mp;
int ans;

void dfs_sz(int u, int p){
   tin[u]=++tdfs;
   tour[tdfs]=u;
   for (int i=0; i<(int)g[u].size(); ++i){
      if (g[u][i].first==p){
         g[u].erase(g[u].begin()+i);
         break;
      }
   }
   sz[u]=1;
   for (auto &e:g[u]){
      int v=e.first, w=e.second;
      dep[v]=dep[u]+1;
      dist[v]=dist[u]+w;
      dfs_sz(v, u);
      sz[u]+=sz[v];
      if (sz[v]>sz[g[u][0].first]) swap(e, g[u][0]);
   }
   tout[u]=tdfs;
}

void minimize(int x, int y){
   auto it=mp.find(x);
   if (it==mp.end()) mp[x]=y;
   else it->second=y;
}

int get(int x){
   auto it=mp.find(x);
   if (it==mp.end()) return inf;
   return it->second;
}

void dfs_merge(int u, bool keep){
   if (g[u].empty()){
      if (keep) minimize(dist[u], dep[u]);
      return;
   }
   for (auto &e:g[u]) if (e!=g[u][0]) dfs_merge(e.first, 0);
   dfs_merge(g[u][0].first, 1);
   for (auto &e:g[u]) if (e!=g[u][0]){
      int v=e.first;
      for (int i=tin[v]; i<=tout[v]; ++i){
         int w=tour[i];
         ans=min(ans, get(k-dist[w]+dist[u]*2)+dep[w]-dep[u]*2);
      }
      for (int i=tin[v]; i<=tout[v]; ++i){
         int w=tour[i];
         minimize(dist[w], dep[w]);
      }
   }
   ans=min(ans, get(k+dist[u])-dep[u]);
   minimize(dist[u], dep[u]);
   if (!keep) mp.clear();
}

int32_t best_path(int32_t _N, int32_t K, int32_t H[][2], int32_t L[])
{
   n=_N, k=K;
   for (int i=0; i<n-1; ++i){
      int u=H[i][0]+1, v=H[i][1]+1, w=L[i];
      g[u].emplace_back(v, w);
      g[v].emplace_back(u, w);
   }
   dfs_sz(1, 0);
   ans=inf;
   dfs_merge(1, 0);
   return ans>n?-1:ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 2 ms 10588 KB Output is correct
4 Correct 2 ms 10588 KB Output is correct
5 Correct 2 ms 10584 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 2 ms 10588 KB Output is correct
8 Correct 2 ms 10584 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 2 ms 10588 KB Output is correct
11 Correct 2 ms 5212 KB Output is correct
12 Correct 3 ms 4952 KB Output is correct
13 Correct 2 ms 10588 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 2 ms 10588 KB Output is correct
16 Correct 2 ms 10588 KB Output is correct
17 Correct 2 ms 10588 KB Output is correct
18 Correct 2 ms 10588 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 2 ms 10588 KB Output is correct
4 Correct 2 ms 10588 KB Output is correct
5 Correct 2 ms 10584 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 2 ms 10588 KB Output is correct
8 Correct 2 ms 10584 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 2 ms 10588 KB Output is correct
11 Correct 2 ms 5212 KB Output is correct
12 Correct 3 ms 4952 KB Output is correct
13 Correct 2 ms 10588 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 2 ms 10588 KB Output is correct
16 Correct 2 ms 10588 KB Output is correct
17 Correct 2 ms 10588 KB Output is correct
18 Correct 2 ms 10588 KB Output is correct
19 Correct 2 ms 10600 KB Output is correct
20 Correct 2 ms 10584 KB Output is correct
21 Correct 2 ms 10676 KB Output is correct
22 Correct 3 ms 10744 KB Output is correct
23 Correct 3 ms 10844 KB Output is correct
24 Correct 3 ms 10844 KB Output is correct
25 Correct 3 ms 10844 KB Output is correct
26 Correct 3 ms 10844 KB Output is correct
27 Correct 2 ms 10588 KB Output is correct
28 Correct 3 ms 10844 KB Output is correct
29 Correct 3 ms 10844 KB Output is correct
30 Correct 3 ms 10720 KB Output is correct
31 Correct 3 ms 10840 KB Output is correct
32 Correct 3 ms 10840 KB Output is correct
33 Correct 3 ms 10844 KB Output is correct
34 Correct 3 ms 10844 KB Output is correct
35 Correct 3 ms 10844 KB Output is correct
36 Correct 2 ms 10844 KB Output is correct
37 Correct 3 ms 10844 KB Output is correct
38 Correct 3 ms 10844 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 2 ms 10588 KB Output is correct
4 Correct 2 ms 10588 KB Output is correct
5 Correct 2 ms 10584 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 2 ms 10588 KB Output is correct
8 Correct 2 ms 10584 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 2 ms 10588 KB Output is correct
11 Correct 2 ms 5212 KB Output is correct
12 Correct 3 ms 4952 KB Output is correct
13 Correct 2 ms 10588 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 2 ms 10588 KB Output is correct
16 Correct 2 ms 10588 KB Output is correct
17 Correct 2 ms 10588 KB Output is correct
18 Correct 2 ms 10588 KB Output is correct
19 Correct 75 ms 19928 KB Output is correct
20 Correct 91 ms 21012 KB Output is correct
21 Correct 75 ms 20560 KB Output is correct
22 Correct 88 ms 21340 KB Output is correct
23 Correct 98 ms 21840 KB Output is correct
24 Correct 72 ms 20816 KB Output is correct
25 Correct 55 ms 27472 KB Output is correct
26 Correct 46 ms 32852 KB Output is correct
27 Correct 117 ms 32096 KB Output is correct
28 Correct 191 ms 68076 KB Output is correct
29 Correct 190 ms 66444 KB Output is correct
30 Correct 122 ms 32508 KB Output is correct
31 Correct 119 ms 32748 KB Output is correct
32 Correct 193 ms 32660 KB Output is correct
33 Correct 142 ms 31700 KB Output is correct
34 Correct 307 ms 41280 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10584 KB Output is correct
2 Correct 2 ms 10588 KB Output is correct
3 Correct 2 ms 10588 KB Output is correct
4 Correct 2 ms 10588 KB Output is correct
5 Correct 2 ms 10584 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 2 ms 10588 KB Output is correct
8 Correct 2 ms 10584 KB Output is correct
9 Correct 2 ms 10588 KB Output is correct
10 Correct 2 ms 10588 KB Output is correct
11 Correct 2 ms 5212 KB Output is correct
12 Correct 3 ms 4952 KB Output is correct
13 Correct 2 ms 10588 KB Output is correct
14 Correct 2 ms 10588 KB Output is correct
15 Correct 2 ms 10588 KB Output is correct
16 Correct 2 ms 10588 KB Output is correct
17 Correct 2 ms 10588 KB Output is correct
18 Correct 2 ms 10588 KB Output is correct
19 Correct 2 ms 10600 KB Output is correct
20 Correct 2 ms 10584 KB Output is correct
21 Correct 2 ms 10676 KB Output is correct
22 Correct 3 ms 10744 KB Output is correct
23 Correct 3 ms 10844 KB Output is correct
24 Correct 3 ms 10844 KB Output is correct
25 Correct 3 ms 10844 KB Output is correct
26 Correct 3 ms 10844 KB Output is correct
27 Correct 2 ms 10588 KB Output is correct
28 Correct 3 ms 10844 KB Output is correct
29 Correct 3 ms 10844 KB Output is correct
30 Correct 3 ms 10720 KB Output is correct
31 Correct 3 ms 10840 KB Output is correct
32 Correct 3 ms 10840 KB Output is correct
33 Correct 3 ms 10844 KB Output is correct
34 Correct 3 ms 10844 KB Output is correct
35 Correct 3 ms 10844 KB Output is correct
36 Correct 2 ms 10844 KB Output is correct
37 Correct 3 ms 10844 KB Output is correct
38 Correct 3 ms 10844 KB Output is correct
39 Correct 75 ms 19928 KB Output is correct
40 Correct 91 ms 21012 KB Output is correct
41 Correct 75 ms 20560 KB Output is correct
42 Correct 88 ms 21340 KB Output is correct
43 Correct 98 ms 21840 KB Output is correct
44 Correct 72 ms 20816 KB Output is correct
45 Correct 55 ms 27472 KB Output is correct
46 Correct 46 ms 32852 KB Output is correct
47 Correct 117 ms 32096 KB Output is correct
48 Correct 191 ms 68076 KB Output is correct
49 Correct 190 ms 66444 KB Output is correct
50 Correct 122 ms 32508 KB Output is correct
51 Correct 119 ms 32748 KB Output is correct
52 Correct 193 ms 32660 KB Output is correct
53 Correct 142 ms 31700 KB Output is correct
54 Correct 307 ms 41280 KB Output is correct
55 Correct 14 ms 6744 KB Output is correct
56 Incorrect 12 ms 6296 KB Output isn't correct
57 Halted 0 ms 0 KB -