# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
115055 |
2019-06-05T02:15:14 Z |
ansol4328 |
Race (IOI11_race) |
C++11 |
|
1056 ms |
46480 KB |
#include<stdio.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++)
~^~~~~~~~~~~~~~~~
# |
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 |
4 ms |
384 KB |
Output is correct |
4 |
Correct |
2 ms |
384 KB |
Output is correct |
5 |
Correct |
2 ms |
356 KB |
Output is correct |
6 |
Correct |
2 ms |
512 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 |
# |
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 |
4 ms |
384 KB |
Output is correct |
4 |
Correct |
2 ms |
384 KB |
Output is correct |
5 |
Correct |
2 ms |
356 KB |
Output is correct |
6 |
Correct |
2 ms |
512 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 |
5 ms |
3840 KB |
Output is correct |
23 |
Correct |
5 ms |
3328 KB |
Output is correct |
24 |
Correct |
5 ms |
3840 KB |
Output is correct |
25 |
Correct |
5 ms |
3712 KB |
Output is correct |
26 |
Correct |
4 ms |
1920 KB |
Output is correct |
27 |
Correct |
2 ms |
512 KB |
Output is correct |
28 |
Correct |
3 ms |
1280 KB |
Output is correct |
29 |
Correct |
4 ms |
1792 KB |
Output is correct |
30 |
Correct |
4 ms |
1920 KB |
Output is correct |
31 |
Correct |
5 ms |
3072 KB |
Output is correct |
32 |
Correct |
5 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 |
3584 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 |
# |
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 |
4 ms |
384 KB |
Output is correct |
4 |
Correct |
2 ms |
384 KB |
Output is correct |
5 |
Correct |
2 ms |
356 KB |
Output is correct |
6 |
Correct |
2 ms |
512 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 |
237 ms |
15652 KB |
Output is correct |
20 |
Correct |
275 ms |
15656 KB |
Output is correct |
21 |
Correct |
249 ms |
15836 KB |
Output is correct |
22 |
Correct |
235 ms |
16120 KB |
Output is correct |
23 |
Correct |
162 ms |
16120 KB |
Output is correct |
24 |
Correct |
113 ms |
16248 KB |
Output is correct |
25 |
Correct |
244 ms |
18296 KB |
Output is correct |
26 |
Correct |
131 ms |
21752 KB |
Output is correct |
27 |
Correct |
333 ms |
31972 KB |
Output is correct |
28 |
Correct |
596 ms |
42616 KB |
Output is correct |
29 |
Correct |
588 ms |
41816 KB |
Output is correct |
30 |
Correct |
356 ms |
31900 KB |
Output is correct |
31 |
Correct |
334 ms |
31992 KB |
Output is correct |
32 |
Correct |
498 ms |
32012 KB |
Output is correct |
33 |
Correct |
615 ms |
30200 KB |
Output is correct |
34 |
Correct |
490 ms |
31096 KB |
Output is correct |
# |
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 |
4 ms |
384 KB |
Output is correct |
4 |
Correct |
2 ms |
384 KB |
Output is correct |
5 |
Correct |
2 ms |
356 KB |
Output is correct |
6 |
Correct |
2 ms |
512 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 |
5 ms |
3840 KB |
Output is correct |
23 |
Correct |
5 ms |
3328 KB |
Output is correct |
24 |
Correct |
5 ms |
3840 KB |
Output is correct |
25 |
Correct |
5 ms |
3712 KB |
Output is correct |
26 |
Correct |
4 ms |
1920 KB |
Output is correct |
27 |
Correct |
2 ms |
512 KB |
Output is correct |
28 |
Correct |
3 ms |
1280 KB |
Output is correct |
29 |
Correct |
4 ms |
1792 KB |
Output is correct |
30 |
Correct |
4 ms |
1920 KB |
Output is correct |
31 |
Correct |
5 ms |
3072 KB |
Output is correct |
32 |
Correct |
5 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 |
3584 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 |
237 ms |
15652 KB |
Output is correct |
40 |
Correct |
275 ms |
15656 KB |
Output is correct |
41 |
Correct |
249 ms |
15836 KB |
Output is correct |
42 |
Correct |
235 ms |
16120 KB |
Output is correct |
43 |
Correct |
162 ms |
16120 KB |
Output is correct |
44 |
Correct |
113 ms |
16248 KB |
Output is correct |
45 |
Correct |
244 ms |
18296 KB |
Output is correct |
46 |
Correct |
131 ms |
21752 KB |
Output is correct |
47 |
Correct |
333 ms |
31972 KB |
Output is correct |
48 |
Correct |
596 ms |
42616 KB |
Output is correct |
49 |
Correct |
588 ms |
41816 KB |
Output is correct |
50 |
Correct |
356 ms |
31900 KB |
Output is correct |
51 |
Correct |
334 ms |
31992 KB |
Output is correct |
52 |
Correct |
498 ms |
32012 KB |
Output is correct |
53 |
Correct |
615 ms |
30200 KB |
Output is correct |
54 |
Correct |
490 ms |
31096 KB |
Output is correct |
55 |
Correct |
14 ms |
1920 KB |
Output is correct |
56 |
Correct |
16 ms |
1964 KB |
Output is correct |
57 |
Correct |
101 ms |
16248 KB |
Output is correct |
58 |
Correct |
50 ms |
15980 KB |
Output is correct |
59 |
Correct |
128 ms |
22392 KB |
Output is correct |
60 |
Correct |
1056 ms |
46480 KB |
Output is correct |
61 |
Correct |
419 ms |
32012 KB |
Output is correct |
62 |
Correct |
418 ms |
32052 KB |
Output is correct |
63 |
Correct |
652 ms |
32252 KB |
Output is correct |
64 |
Correct |
1030 ms |
34652 KB |
Output is correct |
65 |
Correct |
449 ms |
32332 KB |
Output is correct |
66 |
Correct |
838 ms |
43712 KB |
Output is correct |
67 |
Correct |
250 ms |
32996 KB |
Output is correct |
68 |
Correct |
671 ms |
35636 KB |
Output is correct |
69 |
Correct |
594 ms |
35960 KB |
Output is correct |
70 |
Correct |
545 ms |
34240 KB |
Output is correct |