답안 #77168 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
77168	2018-09-23T08:00:01 Z	muradeyn	경주 (Race) (IOI11_race)	C++14	43 / 100	882 ms	34412 KB

race

#include "race.h"
#include <bits/stdc++.h>
#define intt long long
#define FAST_READ ios_base::sync_with_stdio(0);cin.tie(0);
#define SIZE 200001
#define INF INT_MAX
#define F first
#define S second
#define in(a) scanf("%d",&a);
#define outn(a) printf("%d\n",&a);
#define outs(a) printf("%d ",&a);


using namespace std;

int root , n , x , y , w , used[SIZE] , dp[SIZE] , co , cent = -1 , ans = -1;

intt we  , k;

vector< pair<int,intt> >v[SIZE];

map< int , int > mp;

bool f = true;

void init() {
    for (int i = 1;i<=n;i++) {
        if (used[i] < 5 && used[i] > 0)used[i] = 0;
    }
}

void dfs(int s,int p) {
    co++;
    used[s] = 1;
    int sz = v[s].size();
    for (int i = 0;i<sz;i++) {
        int to = v[s][i].first;
        intt cost = v[s][i].second;
        if (to == p)continue;
        if (used[to] >= 1)continue;
        we += cost;
        dfs(to,s);
    }
}

void dfs2(int s,int p) {
    used[s] = 2;
    dp[s] = 1;
    bool f = true;
    int sz = v[s].size();
    for (int i = 0;i<sz;i++) {
        int to = v[s][i].first;
        if (used[to] >= 2)continue;
        dfs2(to,s);
        if (dp[to] > co / 2) f = false;
        dp[s] += dp[to];
    }
    if (f && cent == -1 && co - dp[s] <= co / 2) cent = s;
}

void dfs3(int s,int p,int len,intt cst) {
    used[s] = 3;
    if (cst == k) {
        if (ans == -1)ans = len;
        else ans = min(ans,len);
        return;
    }
    int sz = v[s].size();
    for (int i = 0;i<sz;i++) {
        int to = v[s][i].first;
        intt cost = v[s][i].second;
        if (to == p)continue;
        if (used[to] >= 3)continue;
        dfs3(to,s,len + 1,cst + cost);
    }
}

void dfs4(int s,int p,int len,intt cst) {
    used[s] = 4;
    //cout<<s - 1<<" "<<cst<<" "<<k<<endl;
    //char aa;
    //cin>>aa;
    if (cst > k)return;
    if (cst == k) {
        if (ans == -1)ans = len;
        else ans = min(ans,len);
        return;
    }
    else if (mp[k - cst] != 0) {
        if (ans == -1)ans = len + mp[k - cst];
        else ans = min(ans,len + mp[k - cst]);
    }
    int sz = v[s].size();
    //cout<<sz<<endl;
    for (int i = 0;i<sz;i++) {
        int to = v[s][i].first;
        intt cost = v[s][i].second;
        if (to == p)continue;
        if (used[to] >= 4)continue;
        dfs4(to,s,len + 1,cst + cost);
    }
    if (mp[cst] == 0)mp[cst] = len;
    else if (mp[cst] > len)mp[cst] = min(mp[cst],len);
}

int best_path(int N, int K, int h[][2], int l[])
{
    k = K;
    n = N;
    for (int i = 0;i<n - 1;i++) {
        x = h[i][0];
        y = h[i][1];
        x++;
        y++;
        v[x].push_back({y,l[i]});
        v[y].push_back({x,l[i]});
    }
    while (f) {
        f = false;
        init();
        for (int i = 1;i<=n;i++) {
            if (used[i] == 0) {
              co = 0; we = 0;
                dfs(i , -1);
                if (we < k || co == 1) continue;
                dp[i] = 0;
                cent = -1;
                dfs2(i,-1);
                if (cent == -1)continue;
                f = true;
                root = cent;
                dfs3(cent,-1,0,0);
                mp.clear();
                dfs4(cent,-1,0,0);
                used[cent] = 5;
            }
        }
    }
    return ans;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	4984 KB	Output is correct
2	Correct	6 ms	5108 KB	Output is correct
3	Correct	6 ms	5184 KB	Output is correct
4	Correct	6 ms	5184 KB	Output is correct
5	Correct	6 ms	5276 KB	Output is correct
6	Correct	6 ms	5276 KB	Output is correct
7	Correct	6 ms	5352 KB	Output is correct
8	Correct	6 ms	5352 KB	Output is correct
9	Correct	6 ms	5352 KB	Output is correct
10	Correct	8 ms	5352 KB	Output is correct
11	Correct	6 ms	5352 KB	Output is correct
12	Correct	6 ms	5352 KB	Output is correct
13	Correct	6 ms	5352 KB	Output is correct
14	Correct	6 ms	5352 KB	Output is correct
15	Correct	6 ms	5352 KB	Output is correct
16	Correct	6 ms	5352 KB	Output is correct
17	Correct	6 ms	5352 KB	Output is correct
18	Correct	6 ms	5352 KB	Output is correct
19	Correct	453 ms	12412 KB	Output is correct
20	Correct	417 ms	12412 KB	Output is correct
21	Correct	441 ms	12540 KB	Output is correct
22	Correct	437 ms	12540 KB	Output is correct
23	Correct	329 ms	12896 KB	Output is correct
24	Correct	161 ms	12896 KB	Output is correct
25	Correct	260 ms	16136 KB	Output is correct
26	Correct	75 ms	19832 KB	Output is correct
27	Correct	399 ms	20096 KB	Output is correct
28	Correct	871 ms	34412 KB	Output is correct
29	Correct	882 ms	34412 KB	Output is correct
30	Correct	386 ms	34412 KB	Output is correct
31	Correct	383 ms	34412 KB	Output is correct
32	Correct	519 ms	34412 KB	Output is correct
33	Correct	482 ms	34412 KB	Output is correct
34	Correct	649 ms	34412 KB	Output is correct

Subtask #4
0 / 57.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	4984 KB	Output is correct
2	Correct	6 ms	5108 KB	Output is correct
3	Correct	6 ms	5184 KB	Output is correct
4	Correct	6 ms	5184 KB	Output is correct
5	Correct	6 ms	5276 KB	Output is correct
6	Correct	6 ms	5276 KB	Output is correct
7	Correct	6 ms	5352 KB	Output is correct
8	Correct	6 ms	5352 KB	Output is correct
9	Correct	6 ms	5352 KB	Output is correct
10	Correct	8 ms	5352 KB	Output is correct
11	Correct	6 ms	5352 KB	Output is correct
12	Correct	6 ms	5352 KB	Output is correct
13	Correct	6 ms	5352 KB	Output is correct
14	Correct	6 ms	5352 KB	Output is correct
15	Correct	6 ms	5352 KB	Output is correct
16	Correct	6 ms	5352 KB	Output is correct
17	Correct	6 ms	5352 KB	Output is correct
18	Correct	6 ms	5352 KB	Output is correct
19	Correct	6 ms	5352 KB	Output is correct
20	Correct	6 ms	5352 KB	Output is correct
21	Correct	9 ms	5372 KB	Output is correct
22	Correct	7 ms	5372 KB	Output is correct
23	Correct	7 ms	5372 KB	Output is correct
24	Correct	8 ms	5372 KB	Output is correct
25	Correct	8 ms	5500 KB	Output is correct
26	Correct	10 ms	5500 KB	Output is correct
27	Correct	9 ms	5500 KB	Output is correct
28	Correct	8 ms	5500 KB	Output is correct
29	Correct	8 ms	5500 KB	Output is correct
30	Correct	9 ms	5500 KB	Output is correct
31	Correct	8 ms	5500 KB	Output is correct
32	Correct	9 ms	5500 KB	Output is correct
33	Correct	9 ms	5500 KB	Output is correct
34	Correct	7 ms	5500 KB	Output is correct
35	Correct	7 ms	5504 KB	Output is correct
36	Correct	7 ms	5504 KB	Output is correct
37	Correct	7 ms	5504 KB	Output is correct
38	Correct	7 ms	5504 KB	Output is correct
39	Correct	453 ms	12412 KB	Output is correct
40	Correct	417 ms	12412 KB	Output is correct
41	Correct	441 ms	12540 KB	Output is correct
42	Correct	437 ms	12540 KB	Output is correct
43	Correct	329 ms	12896 KB	Output is correct
44	Correct	161 ms	12896 KB	Output is correct
45	Correct	260 ms	16136 KB	Output is correct
46	Correct	75 ms	19832 KB	Output is correct
47	Correct	399 ms	20096 KB	Output is correct
48	Correct	871 ms	34412 KB	Output is correct
49	Correct	882 ms	34412 KB	Output is correct
50	Correct	386 ms	34412 KB	Output is correct
51	Correct	383 ms	34412 KB	Output is correct
52	Correct	519 ms	34412 KB	Output is correct
53	Correct	482 ms	34412 KB	Output is correct
54	Correct	649 ms	34412 KB	Output is correct
55	Correct	40 ms	34412 KB	Output is correct
56	Incorrect	24 ms	34412 KB	Output isn't correct
57	Halted	0 ms	0 KB	-

답안 #77168

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 12.0 / 12.0

Subtask #3 22.0 / 22.0

Subtask #4 0 / 57.0

Subtask #1
9.0 / 9.0

Subtask #2
12.0 / 12.0

Subtask #3
22.0 / 22.0

Subtask #4
0 / 57.0