oj.uz

답안 #71644

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
71644 2018-08-25T09:39:55 Z MANcity 경주 (Race) (IOI11_race) C++14
100 / 100
 1332 ms 31896 KB 
#include<iostream>
#include<cstdio>
#include<fstream>
#include<algorithm>
#include<cmath>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<cstring>
#include<vector>
#include "race.h"
using namespace std;
#define for1(i,n) for(int i=1;i<=(int)n;i++)
#define for0(i,n) for(int i=0;i<=(int)n;i++)
#define forn(i,n) for(int i=n;i>=1;i--)
#define fo(i,x,y) for(int i=x;i<=(int)y;i++)
#define fr(i,x,y) for(int i=x;i>=(int)y;i--)
#define pb push_back
#define mp make_pair
#define LL long long
const LL Mod=1000*1000*1000+7;
int K;
vector<vector<pair<int,int> > > G(200002);
int sizeVer[200002];
int used[200002];
int sumSize;
int verNum;
int ka[5000002];
int ANSWER=1000000;
void dfs(int v,int p)
{
    if(G[v].size()==1 && G[v][0].first==p)
        sizeVer[v]=1;
    else
        sizeVer[v]=0;
    for0(j,G[v].size()-1)
    {
        int to=G[v][j].first;
        if(to!=p && used[to]==0)
        {
            dfs(to,v);
            sizeVer[v]+=sizeVer[to];
        }
    }
    verNum++;
    sizeVer[v]+=1;
    sumSize+=sizeVer[v];
}
int find_centr(int v,int p)
{
    int u=0;
    for0(j,G[v].size()-1)
    {
        int to=G[v][j].first;
        if(to!=p && used[to]==0)
        {
            if(2*sizeVer[to]>verNum)
            {
                u=1;
                return find_centr(to,v);
            }
        }
    }
    if(u==0)
        return v;
}
int update_dfs(int v,int p,int len,int qan)
{
    if(ka[len]==-1)
        ka[len]=qan;
    else
        ka[len]=min(qan,ka[len]);
    if(K>=len)
    for0(j,G[v].size()-1)
    {
        int to=G[v][j].first;
        int l=G[v][j].second;
        if(to!=p && used[to]==0)
        {
            update_dfs(to,v,len+l,qan+1);
        }
    }
}
int stug_dfs(int v,int p,int len,int qan)
{
    if(K>=len)
    {
        //cout<<v<<" AAAA "<<len<<" "<<K-len<<" "<<ka[K-len]<<endl;
        if(ka[K-len]!=-1)
        {
            ANSWER=min(ANSWER,ka[K-len]+qan);
            //cout<<v<<" "<<len<<" "<<ANSWER<<endl;
        }
    }
    if(K>=len)
    for0(j,G[v].size()-1)
    {
        int to=G[v][j].first;
        int l=G[v][j].second;
        if(to!=p && used[to]==0)
        {
            stug_dfs(to,v,len+l,qan+1);
        }
    }
}
int del_dfs(int v,int p,int len)
{
    ka[len]=-1;
    if(K>=len)
    for0(j,G[v].size()-1)
    {
        int to=G[v][j].first;
        int l=G[v][j].second;
        if(to!=p && used[to]==0)
        {
            del_dfs(to,v,len+l);
        }
    }
}
int Q=0;
void solve(int v)
{
    /*for0(i,K)
        ka[i]=-1;*/
    ka[0]=0;
    sumSize=0;
    verNum=0;
    dfs(v,-1);
    if(verNum==1)
        return;
    int centr=find_centr(v,-1);
    for0(i,G[centr].size()-1)
    {
        int to=G[centr][i].first;
        int len=G[centr][i].second;
        if(used[to]==0)
        {
            stug_dfs(to,centr,len,1);
            update_dfs(to,centr,len,1);
        }
    }
    used[centr]=1;
    for0(i,G[centr].size()-1)
    {
        int to=G[centr][i].first;
        int l=G[centr][i].second;
        if(used[to]==0)
        {
            del_dfs(to,centr,l);
        }
    }
    for0(i,G[centr].size()-1)
    {
        int to=G[centr][i].first;
        if(used[to]==0)
        {
            solve(to);
        }
    }
}
int best_path(int N, int K_0, int H[][2], int L[])
{
    K=K_0;
    for0(i,N-2)
    {
        G[H[i][0]].pb({H[i][1],L[i]});
        G[H[i][1]].pb({H[i][0],L[i]});
    }
    for0(i,K)
        ka[i]=-1;
    solve(1);
    if(ANSWER==1000000)
        return -1;
    return ANSWER;
}
/*
11 12
0 1 3
0 2 4
2 3 5
3 4 4
4 5 6
0 6 3
6 7 2
6 8 5
8 9 6
8 10 7
2
*/
/*
6 16
0 1 10
0 2 1
2 3 2
3 4 3
2 5 4
4
*/

Compilation message

race.cpp: In function 'int update_dfs(int, int, int, int)':
race.cpp:85:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
race.cpp: In function 'int stug_dfs(int, int, int, int)':
race.cpp:107:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
race.cpp: In function 'int del_dfs(int, int, int)':
race.cpp:121:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
race.cpp: In function 'int find_centr(int, int)':
race.cpp:68:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 7 ms 5204 KB Output is correct
3 Correct 7 ms 5284 KB Output is correct
4 Correct 7 ms 5364 KB Output is correct
5 Correct 7 ms 5364 KB Output is correct
6 Correct 7 ms 5364 KB Output is correct
7 Correct 7 ms 5364 KB Output is correct
8 Correct 7 ms 5364 KB Output is correct
9 Correct 7 ms 5364 KB Output is correct
10 Correct 7 ms 5364 KB Output is correct
11 Correct 6 ms 5364 KB Output is correct
12 Correct 7 ms 5364 KB Output is correct
13 Correct 9 ms 5364 KB Output is correct
14 Correct 6 ms 5364 KB Output is correct
15 Correct 7 ms 5364 KB Output is correct
16 Correct 6 ms 5364 KB Output is correct
17 Correct 7 ms 5364 KB Output is correct
18 Correct 5 ms 5364 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 7 ms 5204 KB Output is correct
3 Correct 7 ms 5284 KB Output is correct
4 Correct 7 ms 5364 KB Output is correct
5 Correct 7 ms 5364 KB Output is correct
6 Correct 7 ms 5364 KB Output is correct
7 Correct 7 ms 5364 KB Output is correct
8 Correct 7 ms 5364 KB Output is correct
9 Correct 7 ms 5364 KB Output is correct
10 Correct 7 ms 5364 KB Output is correct
11 Correct 6 ms 5364 KB Output is correct
12 Correct 7 ms 5364 KB Output is correct
13 Correct 9 ms 5364 KB Output is correct
14 Correct 6 ms 5364 KB Output is correct
15 Correct 7 ms 5364 KB Output is correct
16 Correct 6 ms 5364 KB Output is correct
17 Correct 7 ms 5364 KB Output is correct
18 Correct 5 ms 5364 KB Output is correct
19 Correct 7 ms 5364 KB Output is correct
20 Correct 6 ms 5364 KB Output is correct
21 Correct 8 ms 5364 KB Output is correct
22 Correct 13 ms 10776 KB Output is correct
23 Correct 12 ms 10776 KB Output is correct
24 Correct 13 ms 10776 KB Output is correct
25 Correct 12 ms 10776 KB Output is correct
26 Correct 9 ms 10776 KB Output is correct
27 Correct 12 ms 10776 KB Output is correct
28 Correct 11 ms 10776 KB Output is correct
29 Correct 10 ms 10776 KB Output is correct
30 Correct 10 ms 10776 KB Output is correct
31 Correct 12 ms 10776 KB Output is correct
32 Correct 10 ms 10776 KB Output is correct
33 Correct 11 ms 10776 KB Output is correct
34 Correct 10 ms 10776 KB Output is correct
35 Correct 10 ms 10776 KB Output is correct
36 Correct 13 ms 10776 KB Output is correct
37 Correct 11 ms 10776 KB Output is correct
38 Correct 11 ms 10776 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 7 ms 5204 KB Output is correct
3 Correct 7 ms 5284 KB Output is correct
4 Correct 7 ms 5364 KB Output is correct
5 Correct 7 ms 5364 KB Output is correct
6 Correct 7 ms 5364 KB Output is correct
7 Correct 7 ms 5364 KB Output is correct
8 Correct 7 ms 5364 KB Output is correct
9 Correct 7 ms 5364 KB Output is correct
10 Correct 7 ms 5364 KB Output is correct
11 Correct 6 ms 5364 KB Output is correct
12 Correct 7 ms 5364 KB Output is correct
13 Correct 9 ms 5364 KB Output is correct
14 Correct 6 ms 5364 KB Output is correct
15 Correct 7 ms 5364 KB Output is correct
16 Correct 6 ms 5364 KB Output is correct
17 Correct 7 ms 5364 KB Output is correct
18 Correct 5 ms 5364 KB Output is correct
19 Correct 268 ms 11084 KB Output is correct
20 Correct 265 ms 11088 KB Output is correct
21 Correct 287 ms 11088 KB Output is correct
22 Correct 317 ms 11088 KB Output is correct
23 Correct 189 ms 11228 KB Output is correct
24 Correct 161 ms 11276 KB Output is correct
25 Correct 314 ms 16000 KB Output is correct
26 Correct 166 ms 16632 KB Output is correct
27 Correct 303 ms 16884 KB Output is correct
28 Correct 488 ms 27124 KB Output is correct
29 Correct 549 ms 27124 KB Output is correct
30 Correct 301 ms 27124 KB Output is correct
31 Correct 297 ms 27124 KB Output is correct
32 Correct 361 ms 27124 KB Output is correct
33 Correct 439 ms 27124 KB Output is correct
34 Correct 441 ms 27124 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 7 ms 5204 KB Output is correct
3 Correct 7 ms 5284 KB Output is correct
4 Correct 7 ms 5364 KB Output is correct
5 Correct 7 ms 5364 KB Output is correct
6 Correct 7 ms 5364 KB Output is correct
7 Correct 7 ms 5364 KB Output is correct
8 Correct 7 ms 5364 KB Output is correct
9 Correct 7 ms 5364 KB Output is correct
10 Correct 7 ms 5364 KB Output is correct
11 Correct 6 ms 5364 KB Output is correct
12 Correct 7 ms 5364 KB Output is correct
13 Correct 9 ms 5364 KB Output is correct
14 Correct 6 ms 5364 KB Output is correct
15 Correct 7 ms 5364 KB Output is correct
16 Correct 6 ms 5364 KB Output is correct
17 Correct 7 ms 5364 KB Output is correct
18 Correct 5 ms 5364 KB Output is correct
19 Correct 7 ms 5364 KB Output is correct
20 Correct 6 ms 5364 KB Output is correct
21 Correct 8 ms 5364 KB Output is correct
22 Correct 13 ms 10776 KB Output is correct
23 Correct 12 ms 10776 KB Output is correct
24 Correct 13 ms 10776 KB Output is correct
25 Correct 12 ms 10776 KB Output is correct
26 Correct 9 ms 10776 KB Output is correct
27 Correct 12 ms 10776 KB Output is correct
28 Correct 11 ms 10776 KB Output is correct
29 Correct 10 ms 10776 KB Output is correct
30 Correct 10 ms 10776 KB Output is correct
31 Correct 12 ms 10776 KB Output is correct
32 Correct 10 ms 10776 KB Output is correct
33 Correct 11 ms 10776 KB Output is correct
34 Correct 10 ms 10776 KB Output is correct
35 Correct 10 ms 10776 KB Output is correct
36 Correct 13 ms 10776 KB Output is correct
37 Correct 11 ms 10776 KB Output is correct
38 Correct 11 ms 10776 KB Output is correct
39 Correct 268 ms 11084 KB Output is correct
40 Correct 265 ms 11088 KB Output is correct
41 Correct 287 ms 11088 KB Output is correct
42 Correct 317 ms 11088 KB Output is correct
43 Correct 189 ms 11228 KB Output is correct
44 Correct 161 ms 11276 KB Output is correct
45 Correct 314 ms 16000 KB Output is correct
46 Correct 166 ms 16632 KB Output is correct
47 Correct 303 ms 16884 KB Output is correct
48 Correct 488 ms 27124 KB Output is correct
49 Correct 549 ms 27124 KB Output is correct
50 Correct 301 ms 27124 KB Output is correct
51 Correct 297 ms 27124 KB Output is correct
52 Correct 361 ms 27124 KB Output is correct
53 Correct 439 ms 27124 KB Output is correct
54 Correct 441 ms 27124 KB Output is correct
55 Correct 25 ms 27124 KB Output is correct
56 Correct 25 ms 27124 KB Output is correct
57 Correct 106 ms 27124 KB Output is correct
58 Correct 62 ms 27124 KB Output is correct
59 Correct 161 ms 27124 KB Output is correct
60 Correct 1014 ms 27832 KB Output is correct
61 Correct 404 ms 27832 KB Output is correct
62 Correct 343 ms 27832 KB Output is correct
63 Correct 469 ms 27832 KB Output is correct
64 Correct 1332 ms 27832 KB Output is correct
65 Correct 568 ms 27832 KB Output is correct
66 Correct 852 ms 31896 KB Output is correct
67 Correct 357 ms 31896 KB Output is correct
68 Correct 577 ms 31896 KB Output is correct
69 Correct 558 ms 31896 KB Output is correct
70 Correct 609 ms 31896 KB Output is correct