oj.uz

Submission #782800

# Submission time Handle Problem Language Result Execution time Memory
782800 2023-07-14T09:38:15 Z vjudge1 Race (IOI11_race) C++17
100 / 100
 270 ms 36452 KB 
#include<bits/stdc++.h>
#include "race.h"
using namespace std;
const int N = 2e5+37;
int mi = 1e7, n, k, p;
vector<array<int, 2>> adj[N];
vector<int> s(N), vis2(N);
vector<int> best((int)1e6+37, 1e7); 
vector<array<int, 2>> mp;
vector<int> pff;

void dfs(int v, int p){
    int pf=0;
    s[v] = 1;

    for(auto i: adj[v]){
        if(vis2[i[0]]||i[0]==p) continue;
        pf++;
        dfs(i[0], v); s[v]+=s[i[0]];
    }

}
int dfs2(int v, int p, int gh){

    for(auto i: adj[v]){
        if(vis2[i[0]]||i[0]==p) continue;
        if(s[i[0]]>=gh/2) return dfs2(i[0], v, gh);
    }
    return v;
}

void dfs3(int v,  int dist, int z, int p){
   // cout<<v<<" "<<dist<<" "<<z<<"\n";
    if(dist<=k){
	    mp.push_back({dist, z});
	    
	    for(auto i: adj[v]){

	        if(vis2[i[0]]||i[0]==p) continue;

	        dfs3(i[0], dist+i[1], z+1, v);
	    }
	}
}

void dfs4(int v){

    for(auto pf: adj[v]){
        if(vis2[pf[0]]) continue;   
        mp.clear();

        dfs3(pf[0], pf[1], 1, v);
       

        for(auto i: mp){
	        if(i[0]>k) continue;
	        if(best[k-i[0]]!=1e7){
	       		mi=min(mi, i[1]+best[k-i[0]]);
	        }
        }
        for(auto i: mp){
        	if(i[0]<=k){
	        	best[i[0]]=min(i[1], best[i[0]]);
	        	pff.push_back(i[0]);
        	}
        }
    }
}


void gh(int v){

    dfs(v, v); 

    int x = dfs2(v, v, s[v]);
    dfs4(x);

    for(auto i:pff) if(i<=k)best[i]=1e7;
    pff.clear();
	
	vis2[x]=1; best[0]=0;
	for(auto i: adj[x]){
		if(!vis2[i[0]]) gh(i[0]);
	}
}

int best_path(int N, int K, int a[][2], int l[])
{	
	best[0]=0;
    n = N, k = K;

    for(int i= 0; i < n-1; i++){
        int x=a[i][0], y=a[i][1], z=l[i];
        adj[x].push_back({y, z});
        adj[y].push_back({x, z});
    }

    p=1;
    gh(0);

    if(mi==1e7) return -1;
    return mi;
}

void f(){
	#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    #endif
}
/*
signed main()
{
    f();
    int n, k; cin >> n >> k;
    int a[n-1][2], l[n-1];
    for(int i=0; i<n-1; i++){
        cin>>a[i][0]>>a[i][1] >> l[i];
    }

   cout<< best_path(n, k, a, l);

   cerr<<(float)clock()/CLOCKS_PER_SEC;
}

    */

Compilation message

race.cpp: In function 'void f()':
race.cpp:107:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  107 |     freopen("in.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
race.cpp:108:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  108 |     freopen("out.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 10452 KB Output is correct
2 Correct 5 ms 10452 KB Output is correct
3 Correct 5 ms 10452 KB Output is correct
4 Correct 5 ms 10452 KB Output is correct
5 Correct 5 ms 10452 KB Output is correct
6 Correct 4 ms 10464 KB Output is correct
7 Correct 5 ms 10452 KB Output is correct
8 Correct 5 ms 10452 KB Output is correct
9 Correct 5 ms 10508 KB Output is correct
10 Correct 5 ms 10452 KB Output is correct
11 Correct 5 ms 10452 KB Output is correct
12 Correct 5 ms 10428 KB Output is correct
13 Correct 5 ms 10452 KB Output is correct
14 Correct 5 ms 10452 KB Output is correct
15 Correct 5 ms 10452 KB Output is correct
16 Correct 5 ms 10452 KB Output is correct
17 Correct 5 ms 10452 KB Output is correct
18 Correct 5 ms 10452 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 10452 KB Output is correct
2 Correct 5 ms 10452 KB Output is correct
3 Correct 5 ms 10452 KB Output is correct
4 Correct 5 ms 10452 KB Output is correct
5 Correct 5 ms 10452 KB Output is correct
6 Correct 4 ms 10464 KB Output is correct
7 Correct 5 ms 10452 KB Output is correct
8 Correct 5 ms 10452 KB Output is correct
9 Correct 5 ms 10508 KB Output is correct
10 Correct 5 ms 10452 KB Output is correct
11 Correct 5 ms 10452 KB Output is correct
12 Correct 5 ms 10428 KB Output is correct
13 Correct 5 ms 10452 KB Output is correct
14 Correct 5 ms 10452 KB Output is correct
15 Correct 5 ms 10452 KB Output is correct
16 Correct 5 ms 10452 KB Output is correct
17 Correct 5 ms 10452 KB Output is correct
18 Correct 5 ms 10452 KB Output is correct
19 Correct 5 ms 10452 KB Output is correct
20 Correct 5 ms 10404 KB Output is correct
21 Correct 6 ms 10512 KB Output is correct
22 Correct 6 ms 10452 KB Output is correct
23 Correct 5 ms 10452 KB Output is correct
24 Correct 7 ms 10516 KB Output is correct
25 Correct 6 ms 10580 KB Output is correct
26 Correct 5 ms 10452 KB Output is correct
27 Correct 5 ms 10508 KB Output is correct
28 Correct 5 ms 10580 KB Output is correct
29 Correct 5 ms 10580 KB Output is correct
30 Correct 5 ms 10520 KB Output is correct
31 Correct 5 ms 10580 KB Output is correct
32 Correct 5 ms 10580 KB Output is correct
33 Correct 5 ms 10512 KB Output is correct
34 Correct 5 ms 10580 KB Output is correct
35 Correct 5 ms 10512 KB Output is correct
36 Correct 5 ms 10516 KB Output is correct
37 Correct 5 ms 10580 KB Output is correct
38 Correct 5 ms 10452 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 10452 KB Output is correct
2 Correct 5 ms 10452 KB Output is correct
3 Correct 5 ms 10452 KB Output is correct
4 Correct 5 ms 10452 KB Output is correct
5 Correct 5 ms 10452 KB Output is correct
6 Correct 4 ms 10464 KB Output is correct
7 Correct 5 ms 10452 KB Output is correct
8 Correct 5 ms 10452 KB Output is correct
9 Correct 5 ms 10508 KB Output is correct
10 Correct 5 ms 10452 KB Output is correct
11 Correct 5 ms 10452 KB Output is correct
12 Correct 5 ms 10428 KB Output is correct
13 Correct 5 ms 10452 KB Output is correct
14 Correct 5 ms 10452 KB Output is correct
15 Correct 5 ms 10452 KB Output is correct
16 Correct 5 ms 10452 KB Output is correct
17 Correct 5 ms 10452 KB Output is correct
18 Correct 5 ms 10452 KB Output is correct
19 Correct 83 ms 15788 KB Output is correct
20 Correct 78 ms 15648 KB Output is correct
21 Correct 86 ms 16152 KB Output is correct
22 Correct 75 ms 16488 KB Output is correct
23 Correct 48 ms 15788 KB Output is correct
24 Correct 41 ms 15732 KB Output is correct
25 Correct 88 ms 19212 KB Output is correct
26 Correct 79 ms 24032 KB Output is correct
27 Correct 119 ms 21104 KB Output is correct
28 Correct 185 ms 35320 KB Output is correct
29 Correct 203 ms 34084 KB Output is correct
30 Correct 107 ms 20684 KB Output is correct
31 Correct 106 ms 20684 KB Output is correct
32 Correct 133 ms 20672 KB Output is correct
33 Correct 140 ms 19468 KB Output is correct
34 Correct 123 ms 19520 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 10452 KB Output is correct
2 Correct 5 ms 10452 KB Output is correct
3 Correct 5 ms 10452 KB Output is correct
4 Correct 5 ms 10452 KB Output is correct
5 Correct 5 ms 10452 KB Output is correct
6 Correct 4 ms 10464 KB Output is correct
7 Correct 5 ms 10452 KB Output is correct
8 Correct 5 ms 10452 KB Output is correct
9 Correct 5 ms 10508 KB Output is correct
10 Correct 5 ms 10452 KB Output is correct
11 Correct 5 ms 10452 KB Output is correct
12 Correct 5 ms 10428 KB Output is correct
13 Correct 5 ms 10452 KB Output is correct
14 Correct 5 ms 10452 KB Output is correct
15 Correct 5 ms 10452 KB Output is correct
16 Correct 5 ms 10452 KB Output is correct
17 Correct 5 ms 10452 KB Output is correct
18 Correct 5 ms 10452 KB Output is correct
19 Correct 5 ms 10452 KB Output is correct
20 Correct 5 ms 10404 KB Output is correct
21 Correct 6 ms 10512 KB Output is correct
22 Correct 6 ms 10452 KB Output is correct
23 Correct 5 ms 10452 KB Output is correct
24 Correct 7 ms 10516 KB Output is correct
25 Correct 6 ms 10580 KB Output is correct
26 Correct 5 ms 10452 KB Output is correct
27 Correct 5 ms 10508 KB Output is correct
28 Correct 5 ms 10580 KB Output is correct
29 Correct 5 ms 10580 KB Output is correct
30 Correct 5 ms 10520 KB Output is correct
31 Correct 5 ms 10580 KB Output is correct
32 Correct 5 ms 10580 KB Output is correct
33 Correct 5 ms 10512 KB Output is correct
34 Correct 5 ms 10580 KB Output is correct
35 Correct 5 ms 10512 KB Output is correct
36 Correct 5 ms 10516 KB Output is correct
37 Correct 5 ms 10580 KB Output is correct
38 Correct 5 ms 10452 KB Output is correct
39 Correct 83 ms 15788 KB Output is correct
40 Correct 78 ms 15648 KB Output is correct
41 Correct 86 ms 16152 KB Output is correct
42 Correct 75 ms 16488 KB Output is correct
43 Correct 48 ms 15788 KB Output is correct
44 Correct 41 ms 15732 KB Output is correct
45 Correct 88 ms 19212 KB Output is correct
46 Correct 79 ms 24032 KB Output is correct
47 Correct 119 ms 21104 KB Output is correct
48 Correct 185 ms 35320 KB Output is correct
49 Correct 203 ms 34084 KB Output is correct
50 Correct 107 ms 20684 KB Output is correct
51 Correct 106 ms 20684 KB Output is correct
52 Correct 133 ms 20672 KB Output is correct
53 Correct 140 ms 19468 KB Output is correct
54 Correct 123 ms 19520 KB Output is correct
55 Correct 10 ms 11156 KB Output is correct
56 Correct 11 ms 11152 KB Output is correct
57 Correct 56 ms 16652 KB Output is correct
58 Correct 31 ms 16576 KB Output is correct
59 Correct 77 ms 23868 KB Output is correct
60 Correct 270 ms 36452 KB Output is correct
61 Correct 120 ms 21044 KB Output is correct
62 Correct 132 ms 21800 KB Output is correct
63 Correct 158 ms 21780 KB Output is correct
64 Correct 256 ms 22436 KB Output is correct
65 Correct 128 ms 20300 KB Output is correct
66 Correct 261 ms 31000 KB Output is correct
67 Correct 75 ms 22332 KB Output is correct
68 Correct 170 ms 21104 KB Output is correct
69 Correct 202 ms 21292 KB Output is correct
70 Correct 157 ms 20840 KB Output is correct