oj.uz

Submission #96122

# Submission time Handle Problem Language Result Execution time Memory
96122 2019-02-06T10:41:20 Z igzi Race (IOI11_race) C++17
100 / 100
 522 ms 37116 KB 
#include <bits/stdc++.h>
#define maxK 1000006
#define maxN 200005

using namespace std;

vector <pair<int,int>> adj[maxN];
vector <int> all;
long long dis[maxK],s[maxN],ans=INT_MAX,k;
bool mar[maxN];

void dfs0(int n,int par){
s[n]=1;
for(int i=0;i<adj[n].size();i++){
int x=adj[n][i].first;
if(x==par || mar[x]) continue;
dfs0(x,n);
s[n]+=s[x];
}
}

int cen(int n,int par,int S){
for(int i=0;i<adj[n].size();i++){
int x=adj[n][i].first;
if(x==par || mar[x]) continue;
if(s[x]>S/2) return cen(x,n,S);
}
return n;
}

void dfs1(int n,int par,long long d,int l){
if(d<=k) all.push_back(d);
if(d<=k) ans=min(ans,dis[k-d]+l);
for(int i=0;i<adj[n].size();i++){
int x=adj[n][i].first;
if(x==par || mar[x]) continue;
dfs1(x,n,d+adj[n][i].second,l+1);
}
}

void dfs2(int n,int par,long long d,int l){
if(d<=k) dis[d]=min(dis[d],(long long)l);
for(int i=0;i<adj[n].size();i++){
int x=adj[n][i].first;
if(x==par || mar[x]) continue;
dfs2(x,n,d+adj[n][i].second,l+1);
}
}

void decompose(int n){
dfs0(n,-1);
int c=cen(n,-1,s[n]);
mar[c]=true;
for(int i=0;i<adj[c].size();i++){
int x=adj[c][i].first;
if(mar[x]) continue;
dfs1(x,c,adj[c][i].second,1);
dfs2(x,c,adj[c][i].second,1);
}
ans=min(ans,dis[k]);
for(int i=0;i<all.size();i++) dis[all[i]]=INT_MAX;
all.clear();
for(int i=0;i<adj[c].size();i++){
int x=adj[c][i].first;
if(mar[x]) continue;
decompose(x);
}
}

int best_path(int n, int K, int H[][2], int L[])
{
    k=K;
    for(int i=0;i<n-1;i++){
        int a=H[i][0],b=H[i][1],c=L[i];
        adj[a].push_back({b,c});
        adj[b].push_back({a,c});
    }
    for(int i=0;i<=k;i++){
        dis[i]=INT_MAX;
    }
    dis[0]=0;
    decompose(1);
    if(ans==INT_MAX)return -1;
    return ans;
}

Compilation message

race.cpp: In function 'void dfs0(int, int)':
race.cpp:14:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(int i=0;i<adj[n].size();i++){
             ~^~~~~~~~~~~~~~
race.cpp: In function 'int cen(int, int, int)':
race.cpp:23:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(int i=0;i<adj[n].size();i++){
             ~^~~~~~~~~~~~~~
race.cpp: In function 'void dfs1(int, int, long long int, int)':
race.cpp:34:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(int i=0;i<adj[n].size();i++){
             ~^~~~~~~~~~~~~~
race.cpp: In function 'void dfs2(int, int, long long int, int)':
race.cpp:43:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(int i=0;i<adj[n].size();i++){
             ~^~~~~~~~~~~~~~
race.cpp: In function 'void decompose(int)':
race.cpp:54:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(int i=0;i<adj[c].size();i++){
             ~^~~~~~~~~~~~~~
race.cpp:61:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(int i=0;i<all.size();i++) dis[all[i]]=INT_MAX;
             ~^~~~~~~~~~~
race.cpp:63:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 for(int i=0;i<adj[c].size();i++){
             ~^~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5112 KB Output is correct
2 Correct 5 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 5 ms 4984 KB Output is correct
5 Correct 5 ms 5112 KB Output is correct
6 Correct 5 ms 5112 KB Output is correct
7 Correct 5 ms 4984 KB Output is correct
8 Correct 5 ms 4984 KB Output is correct
9 Correct 5 ms 4984 KB Output is correct
10 Correct 5 ms 5112 KB Output is correct
11 Correct 6 ms 5084 KB Output is correct
12 Correct 5 ms 4984 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 5 ms 5116 KB Output is correct
15 Correct 5 ms 5112 KB Output is correct
16 Correct 5 ms 5112 KB Output is correct
17 Correct 7 ms 5112 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5112 KB Output is correct
2 Correct 5 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 5 ms 4984 KB Output is correct
5 Correct 5 ms 5112 KB Output is correct
6 Correct 5 ms 5112 KB Output is correct
7 Correct 5 ms 4984 KB Output is correct
8 Correct 5 ms 4984 KB Output is correct
9 Correct 5 ms 4984 KB Output is correct
10 Correct 5 ms 5112 KB Output is correct
11 Correct 6 ms 5084 KB Output is correct
12 Correct 5 ms 4984 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 5 ms 5116 KB Output is correct
15 Correct 5 ms 5112 KB Output is correct
16 Correct 5 ms 5112 KB Output is correct
17 Correct 7 ms 5112 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 5 ms 4984 KB Output is correct
20 Correct 6 ms 4988 KB Output is correct
21 Correct 6 ms 5140 KB Output is correct
22 Correct 15 ms 12280 KB Output is correct
23 Correct 11 ms 11000 KB Output is correct
24 Correct 10 ms 11900 KB Output is correct
25 Correct 10 ms 11768 KB Output is correct
26 Correct 8 ms 7800 KB Output is correct
27 Correct 9 ms 11384 KB Output is correct
28 Correct 8 ms 6652 KB Output is correct
29 Correct 7 ms 7672 KB Output is correct
30 Correct 8 ms 7928 KB Output is correct
31 Correct 14 ms 10232 KB Output is correct
32 Correct 11 ms 10712 KB Output is correct
33 Correct 11 ms 11256 KB Output is correct
34 Correct 11 ms 9848 KB Output is correct
35 Correct 11 ms 11512 KB Output is correct
36 Correct 13 ms 12408 KB Output is correct
37 Correct 10 ms 11256 KB Output is correct
38 Correct 10 ms 9080 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5112 KB Output is correct
2 Correct 5 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 5 ms 4984 KB Output is correct
5 Correct 5 ms 5112 KB Output is correct
6 Correct 5 ms 5112 KB Output is correct
7 Correct 5 ms 4984 KB Output is correct
8 Correct 5 ms 4984 KB Output is correct
9 Correct 5 ms 4984 KB Output is correct
10 Correct 5 ms 5112 KB Output is correct
11 Correct 6 ms 5084 KB Output is correct
12 Correct 5 ms 4984 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 5 ms 5116 KB Output is correct
15 Correct 5 ms 5112 KB Output is correct
16 Correct 5 ms 5112 KB Output is correct
17 Correct 7 ms 5112 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 166 ms 12224 KB Output is correct
20 Correct 175 ms 12296 KB Output is correct
21 Correct 157 ms 12368 KB Output is correct
22 Correct 153 ms 12660 KB Output is correct
23 Correct 142 ms 12408 KB Output is correct
24 Correct 83 ms 12280 KB Output is correct
25 Correct 192 ms 17240 KB Output is correct
26 Correct 106 ms 18320 KB Output is correct
27 Correct 229 ms 19704 KB Output is correct
28 Correct 522 ms 30328 KB Output is correct
29 Correct 493 ms 27948 KB Output is correct
30 Correct 195 ms 19704 KB Output is correct
31 Correct 279 ms 19724 KB Output is correct
32 Correct 308 ms 19704 KB Output is correct
33 Correct 410 ms 18556 KB Output is correct
34 Correct 382 ms 19448 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5112 KB Output is correct
2 Correct 5 ms 4984 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 5 ms 4984 KB Output is correct
5 Correct 5 ms 5112 KB Output is correct
6 Correct 5 ms 5112 KB Output is correct
7 Correct 5 ms 4984 KB Output is correct
8 Correct 5 ms 4984 KB Output is correct
9 Correct 5 ms 4984 KB Output is correct
10 Correct 5 ms 5112 KB Output is correct
11 Correct 6 ms 5084 KB Output is correct
12 Correct 5 ms 4984 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 5 ms 5116 KB Output is correct
15 Correct 5 ms 5112 KB Output is correct
16 Correct 5 ms 5112 KB Output is correct
17 Correct 7 ms 5112 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 5 ms 4984 KB Output is correct
20 Correct 6 ms 4988 KB Output is correct
21 Correct 6 ms 5140 KB Output is correct
22 Correct 15 ms 12280 KB Output is correct
23 Correct 11 ms 11000 KB Output is correct
24 Correct 10 ms 11900 KB Output is correct
25 Correct 10 ms 11768 KB Output is correct
26 Correct 8 ms 7800 KB Output is correct
27 Correct 9 ms 11384 KB Output is correct
28 Correct 8 ms 6652 KB Output is correct
29 Correct 7 ms 7672 KB Output is correct
30 Correct 8 ms 7928 KB Output is correct
31 Correct 14 ms 10232 KB Output is correct
32 Correct 11 ms 10712 KB Output is correct
33 Correct 11 ms 11256 KB Output is correct
34 Correct 11 ms 9848 KB Output is correct
35 Correct 11 ms 11512 KB Output is correct
36 Correct 13 ms 12408 KB Output is correct
37 Correct 10 ms 11256 KB Output is correct
38 Correct 10 ms 9080 KB Output is correct
39 Correct 166 ms 12224 KB Output is correct
40 Correct 175 ms 12296 KB Output is correct
41 Correct 157 ms 12368 KB Output is correct
42 Correct 153 ms 12660 KB Output is correct
43 Correct 142 ms 12408 KB Output is correct
44 Correct 83 ms 12280 KB Output is correct
45 Correct 192 ms 17240 KB Output is correct
46 Correct 106 ms 18320 KB Output is correct
47 Correct 229 ms 19704 KB Output is correct
48 Correct 522 ms 30328 KB Output is correct
49 Correct 493 ms 27948 KB Output is correct
50 Correct 195 ms 19704 KB Output is correct
51 Correct 279 ms 19724 KB Output is correct
52 Correct 308 ms 19704 KB Output is correct
53 Correct 410 ms 18556 KB Output is correct
54 Correct 382 ms 19448 KB Output is correct
55 Correct 15 ms 5880 KB Output is correct
56 Correct 16 ms 5752 KB Output is correct
57 Correct 83 ms 12920 KB Output is correct
58 Correct 40 ms 12904 KB Output is correct
59 Correct 120 ms 19832 KB Output is correct
60 Correct 461 ms 36496 KB Output is correct
61 Correct 194 ms 20088 KB Output is correct
62 Correct 208 ms 28528 KB Output is correct
63 Correct 301 ms 28532 KB Output is correct
64 Correct 500 ms 24816 KB Output is correct
65 Correct 328 ms 20472 KB Output is correct
66 Correct 501 ms 37116 KB Output is correct
67 Correct 115 ms 29924 KB Output is correct
68 Correct 267 ms 28660 KB Output is correct
69 Correct 274 ms 28792 KB Output is correct
70 Correct 280 ms 28024 KB Output is correct