oj.uz

Submission #115056

# Submission time Handle Problem Language Result Execution time Memory
115056 2019-06-05T02:16:08 Z ansol4328 Race (IOI11_race) C++11
100 / 100
 1053 ms 43728 KB 
#include "race.h"
#include<vector>
#include<queue>
#include<algorithm>
 
using namespace std;
typedef pair<int,int> P;
typedef vector<vector<P>> graph;
 
struct CentroidDecomposition
{
    graph CentTree;
    vector<bool> visit;
    vector<int> sub; // size of subtree
    int tot;
    CentroidDecomposition(int N)
    {
        CentTree.resize(N+5);
        visit.resize(N+5);
        sub.resize(N+5);
    }
    void get_sz(int cur, int prev, graph &tree)
    {
        sub[cur]=1;
        for(int i=0 ; i<tree[cur].size() ; i++)
        {
            int nxt=tree[cur][i].first;
            if(!visit[nxt] && nxt!=prev)
            {
                get_sz(nxt,cur,tree);
                sub[cur]+=sub[nxt];
            }
        }
    }
    int get_cen(int cur, int prev, graph &tree)
    {
        for(int i=0 ; i<tree[cur].size() ; i++)
        {
            int nxt=tree[cur][i].first;
            if(!visit[nxt] && nxt!=prev && sub[nxt]>tot/2)
                return get_cen(nxt,cur,tree);
        }
        return cur;
    }
    int decomp(int cur, int prev, graph &tree)
    {
        get_sz(cur,prev,tree);
        tot=sub[cur];
        int cen=get_cen(cur,prev,tree);
        visit[cen]=true;
        for(int i=0 ; i<tree[cen].size() ; i++)
        {
            int nxt=tree[cen][i].first;
            int nxtcen;
            if(!visit[nxt] && nxt!=prev)
            {
                nxtcen=decomp(nxt,cen,tree);
                CentTree[cen].push_back(P(nxtcen,0));
                CentTree[nxtcen].push_back(P(cen,0));
            }
        }
        return cen;
    }
};
 
int n, k, res=1e9;
graph lst;
bool check[200005];
int dist[1000005], idx;
P que[200005];
 
void clr_dist(int v, int prev, int dst)
{
    dist[dst]=1e9;
    dist[k-dst]=1e9;
    for(int i=0 ; i<lst[v].size() ; i++)
    {
        int nxt=lst[v][i].first;
        int d=lst[v][i].second;
        if(nxt!=prev && !check[nxt] && dst+d<=k) clr_dist(nxt,v,dst+d);
    }
}
 
void get_dist(int v, int prev, int dst, int cnt)
{
    que[++idx]=P(dst,cnt);
    res=min(res,dist[k-dst]+cnt);
    for(int i=0 ; i<lst[v].size() ; i++)
    {
        int nxt=lst[v][i].first;
        int d=lst[v][i].second;
        if(nxt!=prev && !check[nxt] && dst+d<=k)
        {
            get_dist(nxt,v,dst+d,cnt+1);
        }
    }
}
 
int best_path(int N, int K, int H[][2], int L[])
{
    n=N, k=K;
    lst.resize(n+5);
    for(int i=0 ; i<n-1 ; i++)
    {
        int x=H[i][0], y=H[i][1], d=L[i];
        x++, y++;
        lst[x].push_back(P(y,d));
        lst[y].push_back(P(x,d));
    }
    CentroidDecomposition T(n);
 
    int root=T.decomp(1,-1,lst);
    graph &ctree=T.CentTree;
    queue<int> Q;
    Q.push(root);
    check[root]=true;
    while(!Q.empty())
    {
        int v=Q.front();
        Q.pop();
        clr_dist(v,-1,0);
        dist[0]=0;
        for(int i=0 ; i<lst[v].size() ; i++)
        {
            idx=0;
            int nxt=lst[v][i].first;
            int d=lst[v][i].second;
            if(!check[nxt] && d<=k) get_dist(nxt,v,d,1);
            for(int j=1 ; j<=idx ; j++) dist[que[j].first]=min(dist[que[j].first],que[j].second);
        }
        for(int i=0 ; i<ctree[v].size() ; i++)
        {
            int nxt=ctree[v][i].first;
            if(!check[nxt])
            {
                Q.push(nxt);
                check[nxt]=true;
            }
        }
    }
    if(res==1e9) res=-1;
    return res;
}

Compilation message

race.cpp: In member function 'void CentroidDecomposition::get_sz(int, int, graph&)':
race.cpp:25:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0 ; i<tree[cur].size() ; i++)
                       ~^~~~~~~~~~~~~~~~~
race.cpp: In member function 'int CentroidDecomposition::get_cen(int, int, graph&)':
race.cpp:37:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0 ; i<tree[cur].size() ; i++)
                       ~^~~~~~~~~~~~~~~~~
race.cpp: In member function 'int CentroidDecomposition::decomp(int, int, graph&)':
race.cpp:51:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0 ; i<tree[cen].size() ; i++)
                       ~^~~~~~~~~~~~~~~~~
race.cpp: In function 'void clr_dist(int, int, int)':
race.cpp:76:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0 ; i<lst[v].size() ; i++)
                   ~^~~~~~~~~~~~~~
race.cpp: In function 'void get_dist(int, int, int, int)':
race.cpp:88:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0 ; i<lst[v].size() ; i++)
                   ~^~~~~~~~~~~~~~
race.cpp: In function 'int best_path(int, int, int (*)[2], int*)':
race.cpp:123:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0 ; i<lst[v].size() ; i++)
                       ~^~~~~~~~~~~~~~
race.cpp:131:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int i=0 ; i<ctree[v].size() ; i++)
                       ~^~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 296 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 3 ms 512 KB Output is correct
22 Correct 4 ms 3840 KB Output is correct
23 Correct 5 ms 3228 KB Output is correct
24 Correct 5 ms 3840 KB Output is correct
25 Correct 5 ms 3712 KB Output is correct
26 Correct 3 ms 1792 KB Output is correct
27 Correct 3 ms 512 KB Output is correct
28 Correct 3 ms 1280 KB Output is correct
29 Correct 3 ms 1792 KB Output is correct
30 Correct 4 ms 1920 KB Output is correct
31 Correct 4 ms 3072 KB Output is correct
32 Correct 4 ms 3200 KB Output is correct
33 Correct 5 ms 3584 KB Output is correct
34 Correct 4 ms 2816 KB Output is correct
35 Correct 5 ms 3712 KB Output is correct
36 Correct 5 ms 4096 KB Output is correct
37 Correct 5 ms 3584 KB Output is correct
38 Correct 4 ms 2432 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 296 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 242 ms 14428 KB Output is correct
20 Correct 250 ms 14464 KB Output is correct
21 Correct 273 ms 14712 KB Output is correct
22 Correct 228 ms 14712 KB Output is correct
23 Correct 149 ms 14800 KB Output is correct
24 Correct 109 ms 14712 KB Output is correct
25 Correct 247 ms 17108 KB Output is correct
26 Correct 126 ms 20260 KB Output is correct
27 Correct 295 ms 28920 KB Output is correct
28 Correct 518 ms 39688 KB Output is correct
29 Correct 567 ms 38856 KB Output is correct
30 Correct 316 ms 28976 KB Output is correct
31 Correct 336 ms 29036 KB Output is correct
32 Correct 501 ms 29080 KB Output is correct
33 Correct 612 ms 27296 KB Output is correct
34 Correct 409 ms 27128 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 296 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 3 ms 512 KB Output is correct
22 Correct 4 ms 3840 KB Output is correct
23 Correct 5 ms 3228 KB Output is correct
24 Correct 5 ms 3840 KB Output is correct
25 Correct 5 ms 3712 KB Output is correct
26 Correct 3 ms 1792 KB Output is correct
27 Correct 3 ms 512 KB Output is correct
28 Correct 3 ms 1280 KB Output is correct
29 Correct 3 ms 1792 KB Output is correct
30 Correct 4 ms 1920 KB Output is correct
31 Correct 4 ms 3072 KB Output is correct
32 Correct 4 ms 3200 KB Output is correct
33 Correct 5 ms 3584 KB Output is correct
34 Correct 4 ms 2816 KB Output is correct
35 Correct 5 ms 3712 KB Output is correct
36 Correct 5 ms 4096 KB Output is correct
37 Correct 5 ms 3584 KB Output is correct
38 Correct 4 ms 2432 KB Output is correct
39 Correct 242 ms 14428 KB Output is correct
40 Correct 250 ms 14464 KB Output is correct
41 Correct 273 ms 14712 KB Output is correct
42 Correct 228 ms 14712 KB Output is correct
43 Correct 149 ms 14800 KB Output is correct
44 Correct 109 ms 14712 KB Output is correct
45 Correct 247 ms 17108 KB Output is correct
46 Correct 126 ms 20260 KB Output is correct
47 Correct 295 ms 28920 KB Output is correct
48 Correct 518 ms 39688 KB Output is correct
49 Correct 567 ms 38856 KB Output is correct
50 Correct 316 ms 28976 KB Output is correct
51 Correct 336 ms 29036 KB Output is correct
52 Correct 501 ms 29080 KB Output is correct
53 Correct 612 ms 27296 KB Output is correct
54 Correct 409 ms 27128 KB Output is correct
55 Correct 15 ms 1792 KB Output is correct
56 Correct 16 ms 1792 KB Output is correct
57 Correct 106 ms 15064 KB Output is correct
58 Correct 50 ms 14992 KB Output is correct
59 Correct 133 ms 21188 KB Output is correct
60 Correct 1053 ms 43728 KB Output is correct
61 Correct 378 ms 29048 KB Output is correct
62 Correct 421 ms 29060 KB Output is correct
63 Correct 619 ms 29208 KB Output is correct
64 Correct 1024 ms 31020 KB Output is correct
65 Correct 420 ms 28664 KB Output is correct
66 Correct 782 ms 40572 KB Output is correct
67 Correct 200 ms 29516 KB Output is correct
68 Correct 543 ms 31968 KB Output is correct
69 Correct 549 ms 32308 KB Output is correct
70 Correct 533 ms 30872 KB Output is correct