oj.uz

Submission #97566

# Submission time Handle Problem Language Result Execution time Memory
97566 2019-02-17T08:09:16 Z georgerapeanu Dreaming (IOI13_dreaming) C++11
24 / 100
 90 ms 15224 KB 
#include "dreaming.h"
#include <vector>
#include <algorithm>
#include <cstdio>
#include <queue>

using namespace std;

const int NMAX = 1e5;

pair<int,int> link[NMAX + 5];

vector< pair<int,int> > graph[NMAX + 5];

bool viz[NMAX + 5];

struct data_t{
    int best_dist;
    int node;
};


data_t dfs(int nod,int tata){
    viz[nod] = true;
    data_t ans;
    ans.node = nod;
    ans.best_dist = 0;

    link[nod] = {-1,-1};

    for(auto it:graph[nod]){
        if(it.first == tata){
            continue;
        }
        data_t tmp = dfs(it.first,nod);
        if(ans.best_dist <= tmp.best_dist + it.second){
            ans.best_dist = tmp.best_dist + it.second;
            ans.node = tmp.node;
            link[nod] = it;
        }
    }

    return ans;
}


int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    int ans = 0;

    for(int i = 0;i < M;i++){
        graph[A[i]].push_back({B[i],T[i]});
        graph[B[i]].push_back({A[i],T[i]});
    }

    vector<int> d;

    for(int i = 0;i < N;i++){
        if(viz[i]){
            continue;
        }

        data_t tmp = dfs(i,0);
        data_t aux = dfs(tmp.node,0);

        vector<int> diam;
        int len = 0;
        diam.push_back(0);
        for(int node = tmp.node;link[node].first != -1;node = link[node].first){
            diam.push_back(link[node].second);
            len += diam.back();
        }

        ans = max(ans,len);

        int best = 1 << 30;
        int pref = 0;

        for(int i = 0;i < (int)diam.size();i++){
            pref += diam[i];
            best = min(best,max(pref,len - pref));
        }
        
        d.push_back(best);
    }

    priority_queue<int,vector<int>,greater<int> > h;

    for(auto it:d){
        h.push(it);
    } 

    while((int)h.size() > 1){
        int a = h.top();h.pop();
        int b = h.top();h.pop();

        ans = max(ans,a + b + L);

        b = max(b,a + L);

        h.push(b);
    }

    return ans;
}

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:63:16: warning: variable 'aux' set but not used [-Wunused-but-set-variable]
         data_t aux = dfs(tmp.node,0);
                ^~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 15096 KB Output is correct
2 Correct 63 ms 15224 KB Output is correct
3 Correct 39 ms 10872 KB Output is correct
4 Correct 11 ms 4480 KB Output is correct
5 Correct 10 ms 3840 KB Output is correct
6 Correct 16 ms 5504 KB Output is correct
7 Correct 3 ms 2688 KB Output is correct
8 Correct 28 ms 6904 KB Output is correct
9 Correct 36 ms 8824 KB Output is correct
10 Correct 3 ms 2688 KB Output is correct
11 Correct 53 ms 10360 KB Output is correct
12 Correct 62 ms 12916 KB Output is correct
13 Correct 4 ms 2816 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 15096 KB Output is correct
2 Correct 63 ms 15224 KB Output is correct
3 Correct 39 ms 10872 KB Output is correct
4 Correct 11 ms 4480 KB Output is correct
5 Correct 10 ms 3840 KB Output is correct
6 Correct 16 ms 5504 KB Output is correct
7 Correct 3 ms 2688 KB Output is correct
8 Correct 28 ms 6904 KB Output is correct
9 Correct 36 ms 8824 KB Output is correct
10 Correct 3 ms 2688 KB Output is correct
11 Correct 53 ms 10360 KB Output is correct
12 Correct 62 ms 12916 KB Output is correct
13 Correct 4 ms 2816 KB Output is correct
14 Correct 4 ms 2688 KB Output is correct
15 Correct 3 ms 2688 KB Output is correct
16 Correct 4 ms 2688 KB Output is correct
17 Correct 3 ms 2688 KB Output is correct
18 Correct 12 ms 2688 KB Output is correct
19 Correct 4 ms 2688 KB Output is correct
20 Correct 4 ms 2688 KB Output is correct
21 Correct 4 ms 2688 KB Output is correct
22 Correct 4 ms 2688 KB Output is correct
23 Correct 4 ms 2688 KB Output is correct
24 Correct 4 ms 2688 KB Output is correct
25 Correct 4 ms 2688 KB Output is correct
26 Correct 4 ms 2688 KB Output is correct
27 Correct 4 ms 2688 KB Output is correct
28 Correct 3 ms 2688 KB Output is correct
29 Correct 3 ms 2688 KB Output is correct
30 Correct 3 ms 2688 KB Output is correct
31 Correct 3 ms 2688 KB Output is correct
32 Correct 3 ms 2688 KB Output is correct
33 Correct 4 ms 2688 KB Output is correct
34 Correct 3 ms 2688 KB Output is correct
35 Correct 4 ms 2688 KB Output is correct
36 Correct 3 ms 2688 KB Output is correct
37 Correct 4 ms 2688 KB Output is correct
38 Correct 4 ms 2608 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 15096 KB Output is correct
2 Correct 63 ms 15224 KB Output is correct
3 Correct 39 ms 10872 KB Output is correct
4 Correct 11 ms 4480 KB Output is correct
5 Correct 10 ms 3840 KB Output is correct
6 Correct 16 ms 5504 KB Output is correct
7 Correct 3 ms 2688 KB Output is correct
8 Correct 28 ms 6904 KB Output is correct
9 Correct 36 ms 8824 KB Output is correct
10 Correct 3 ms 2688 KB Output is correct
11 Correct 53 ms 10360 KB Output is correct
12 Correct 62 ms 12916 KB Output is correct
13 Correct 4 ms 2816 KB Output is correct
14 Correct 4 ms 2688 KB Output is correct
15 Correct 3 ms 2688 KB Output is correct
16 Correct 4 ms 2688 KB Output is correct
17 Correct 3 ms 2688 KB Output is correct
18 Correct 12 ms 2688 KB Output is correct
19 Correct 4 ms 2688 KB Output is correct
20 Correct 4 ms 2688 KB Output is correct
21 Correct 4 ms 2688 KB Output is correct
22 Correct 4 ms 2688 KB Output is correct
23 Correct 4 ms 2688 KB Output is correct
24 Correct 4 ms 2688 KB Output is correct
25 Correct 4 ms 2688 KB Output is correct
26 Correct 4 ms 2688 KB Output is correct
27 Correct 4 ms 2688 KB Output is correct
28 Correct 3 ms 2688 KB Output is correct
29 Correct 3 ms 2688 KB Output is correct
30 Correct 3 ms 2688 KB Output is correct
31 Correct 3 ms 2688 KB Output is correct
32 Correct 3 ms 2688 KB Output is correct
33 Correct 4 ms 2688 KB Output is correct
34 Correct 3 ms 2688 KB Output is correct
35 Correct 4 ms 2688 KB Output is correct
36 Correct 3 ms 2688 KB Output is correct
37 Correct 4 ms 2688 KB Output is correct
38 Correct 4 ms 2608 KB Output is correct
39 Correct 86 ms 15124 KB Output is correct
40 Correct 77 ms 15108 KB Output is correct
41 Correct 49 ms 10872 KB Output is correct
42 Correct 11 ms 4480 KB Output is correct
43 Correct 3 ms 2688 KB Output is correct
44 Correct 3 ms 2688 KB Output is correct
45 Correct 4 ms 2688 KB Output is correct
46 Correct 3 ms 2688 KB Output is correct
47 Correct 4 ms 2688 KB Output is correct
48 Correct 3 ms 2688 KB Output is correct
49 Correct 4 ms 2688 KB Output is correct
50 Correct 3 ms 2688 KB Output is correct
51 Correct 4 ms 2688 KB Output is correct
52 Correct 3 ms 2688 KB Output is correct
53 Correct 3 ms 2688 KB Output is correct
54 Correct 3 ms 2688 KB Output is correct
55 Correct 4 ms 2688 KB Output is correct
56 Correct 3 ms 2688 KB Output is correct
57 Correct 76 ms 8668 KB Output is correct
58 Correct 90 ms 8728 KB Output is correct
59 Correct 67 ms 8696 KB Output is correct
60 Correct 80 ms 8824 KB Output is correct
61 Correct 63 ms 8568 KB Output is correct
62 Correct 86 ms 8568 KB Output is correct
63 Correct 65 ms 8440 KB Output is correct
64 Incorrect 57 ms 8440 KB Output isn't correct
65 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 6396 KB Output is correct
2 Incorrect 43 ms 6500 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 15096 KB Output is correct
2 Correct 63 ms 15224 KB Output is correct
3 Correct 39 ms 10872 KB Output is correct
4 Correct 11 ms 4480 KB Output is correct
5 Correct 10 ms 3840 KB Output is correct
6 Correct 16 ms 5504 KB Output is correct
7 Correct 3 ms 2688 KB Output is correct
8 Correct 28 ms 6904 KB Output is correct
9 Correct 36 ms 8824 KB Output is correct
10 Correct 3 ms 2688 KB Output is correct
11 Correct 53 ms 10360 KB Output is correct
12 Correct 62 ms 12916 KB Output is correct
13 Correct 4 ms 2816 KB Output is correct
14 Correct 4 ms 2688 KB Output is correct
15 Correct 4 ms 2816 KB Output is correct
16 Correct 4 ms 2816 KB Output is correct
17 Incorrect 4 ms 2688 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 15096 KB Output is correct
2 Correct 63 ms 15224 KB Output is correct
3 Correct 39 ms 10872 KB Output is correct
4 Correct 11 ms 4480 KB Output is correct
5 Correct 10 ms 3840 KB Output is correct
6 Correct 16 ms 5504 KB Output is correct
7 Correct 3 ms 2688 KB Output is correct
8 Correct 28 ms 6904 KB Output is correct
9 Correct 36 ms 8824 KB Output is correct
10 Correct 3 ms 2688 KB Output is correct
11 Correct 53 ms 10360 KB Output is correct
12 Correct 62 ms 12916 KB Output is correct
13 Correct 4 ms 2816 KB Output is correct
14 Correct 4 ms 2688 KB Output is correct
15 Correct 3 ms 2688 KB Output is correct
16 Correct 4 ms 2688 KB Output is correct
17 Correct 3 ms 2688 KB Output is correct
18 Correct 12 ms 2688 KB Output is correct
19 Correct 4 ms 2688 KB Output is correct
20 Correct 4 ms 2688 KB Output is correct
21 Correct 4 ms 2688 KB Output is correct
22 Correct 4 ms 2688 KB Output is correct
23 Correct 4 ms 2688 KB Output is correct
24 Correct 4 ms 2688 KB Output is correct
25 Correct 4 ms 2688 KB Output is correct
26 Correct 4 ms 2688 KB Output is correct
27 Correct 4 ms 2688 KB Output is correct
28 Correct 3 ms 2688 KB Output is correct
29 Correct 3 ms 2688 KB Output is correct
30 Correct 3 ms 2688 KB Output is correct
31 Correct 3 ms 2688 KB Output is correct
32 Correct 3 ms 2688 KB Output is correct
33 Correct 4 ms 2688 KB Output is correct
34 Correct 3 ms 2688 KB Output is correct
35 Correct 4 ms 2688 KB Output is correct
36 Correct 3 ms 2688 KB Output is correct
37 Correct 4 ms 2688 KB Output is correct
38 Correct 4 ms 2608 KB Output is correct
39 Correct 86 ms 15124 KB Output is correct
40 Correct 77 ms 15108 KB Output is correct
41 Correct 49 ms 10872 KB Output is correct
42 Correct 11 ms 4480 KB Output is correct
43 Correct 3 ms 2688 KB Output is correct
44 Correct 3 ms 2688 KB Output is correct
45 Correct 4 ms 2688 KB Output is correct
46 Correct 3 ms 2688 KB Output is correct
47 Correct 4 ms 2688 KB Output is correct
48 Correct 3 ms 2688 KB Output is correct
49 Correct 4 ms 2688 KB Output is correct
50 Correct 3 ms 2688 KB Output is correct
51 Correct 4 ms 2688 KB Output is correct
52 Correct 3 ms 2688 KB Output is correct
53 Correct 3 ms 2688 KB Output is correct
54 Correct 3 ms 2688 KB Output is correct
55 Correct 4 ms 2688 KB Output is correct
56 Correct 3 ms 2688 KB Output is correct
57 Correct 76 ms 8668 KB Output is correct
58 Correct 90 ms 8728 KB Output is correct
59 Correct 67 ms 8696 KB Output is correct
60 Correct 80 ms 8824 KB Output is correct
61 Correct 63 ms 8568 KB Output is correct
62 Correct 86 ms 8568 KB Output is correct
63 Correct 65 ms 8440 KB Output is correct
64 Incorrect 57 ms 8440 KB Output isn't correct
65 Halted 0 ms 0 KB -