oj.uz

Submission #97578

# Submission time Handle Problem Language Result Execution time Memory
97578 2019-02-17T09:19:26 Z georgerapeanu Dreaming (IOI13_dreaming) C++11
54 / 100
 88 ms 15224 KB 
#include "dreaming.h"
#include <vector>
#include <algorithm>
#include <cstdio>
 
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);
    }
 
    sort(d.begin(),d.end());
    reverse(d.begin(),d.end());

    int tmp = 1 << 30;
   
    if((int)d.size() >= 3){
        for(int i = 0;i < 3;i++){
            vector<int> pula;
            for(int j = 0;j < 3;j++){
                if(i != j){
                    pula.push_back(d[j] + L);
                }
                else{
                    pula.push_back(d[j]);
                }
            }
            sort(pula.begin(),pula.end());
            tmp = min(pula[1] + pula[2],tmp);
        }
    }
   
    else if((int)d.size() == 2){
        tmp = d[0] + d[1] + L;
    }

    else{
        tmp = 0;
    }

    ans = max(ans,tmp);

    return ans;
}

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:62: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 15224 KB Output is correct
2 Correct 62 ms 15096 KB Output is correct
3 Correct 41 ms 10876 KB Output is correct
4 Correct 11 ms 4480 KB Output is correct
5 Correct 9 ms 3584 KB Output is correct
6 Correct 16 ms 5504 KB Output is correct
7 Correct 3 ms 2688 KB Output is correct
8 Correct 32 ms 6904 KB Output is correct
9 Correct 48 ms 8816 KB Output is correct
10 Correct 4 ms 2688 KB Output is correct
11 Correct 55 ms 10360 KB Output is correct
12 Correct 60 ms 12896 KB Output is correct
13 Correct 4 ms 2688 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 15224 KB Output is correct
2 Correct 62 ms 15096 KB Output is correct
3 Correct 41 ms 10876 KB Output is correct
4 Correct 11 ms 4480 KB Output is correct
5 Correct 9 ms 3584 KB Output is correct
6 Correct 16 ms 5504 KB Output is correct
7 Correct 3 ms 2688 KB Output is correct
8 Correct 32 ms 6904 KB Output is correct
9 Correct 48 ms 8816 KB Output is correct
10 Correct 4 ms 2688 KB Output is correct
11 Correct 55 ms 10360 KB Output is correct
12 Correct 60 ms 12896 KB Output is correct
13 Correct 4 ms 2688 KB Output is correct
14 Correct 3 ms 2688 KB Output is correct
15 Correct 3 ms 2688 KB Output is correct
16 Correct 3 ms 2688 KB Output is correct
17 Correct 3 ms 2688 KB Output is correct
18 Correct 3 ms 2688 KB Output is correct
19 Correct 4 ms 2688 KB Output is correct
20 Correct 3 ms 2688 KB Output is correct
21 Correct 3 ms 2688 KB Output is correct
22 Correct 4 ms 2688 KB Output is correct
23 Correct 3 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 3 ms 2688 KB Output is correct
27 Correct 4 ms 2688 KB Output is correct
28 Correct 4 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 4 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 3 ms 2688 KB Output is correct
36 Correct 4 ms 2688 KB Output is correct
37 Correct 4 ms 2688 KB Output is correct
38 Correct 3 ms 2688 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 15224 KB Output is correct
2 Correct 62 ms 15096 KB Output is correct
3 Correct 41 ms 10876 KB Output is correct
4 Correct 11 ms 4480 KB Output is correct
5 Correct 9 ms 3584 KB Output is correct
6 Correct 16 ms 5504 KB Output is correct
7 Correct 3 ms 2688 KB Output is correct
8 Correct 32 ms 6904 KB Output is correct
9 Correct 48 ms 8816 KB Output is correct
10 Correct 4 ms 2688 KB Output is correct
11 Correct 55 ms 10360 KB Output is correct
12 Correct 60 ms 12896 KB Output is correct
13 Correct 4 ms 2688 KB Output is correct
14 Correct 3 ms 2688 KB Output is correct
15 Correct 3 ms 2688 KB Output is correct
16 Correct 3 ms 2688 KB Output is correct
17 Correct 3 ms 2688 KB Output is correct
18 Correct 3 ms 2688 KB Output is correct
19 Correct 4 ms 2688 KB Output is correct
20 Correct 3 ms 2688 KB Output is correct
21 Correct 3 ms 2688 KB Output is correct
22 Correct 4 ms 2688 KB Output is correct
23 Correct 3 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 3 ms 2688 KB Output is correct
27 Correct 4 ms 2688 KB Output is correct
28 Correct 4 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 4 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 3 ms 2688 KB Output is correct
36 Correct 4 ms 2688 KB Output is correct
37 Correct 4 ms 2688 KB Output is correct
38 Correct 3 ms 2688 KB Output is correct
39 Correct 63 ms 15160 KB Output is correct
40 Correct 71 ms 15200 KB Output is correct
41 Correct 40 ms 10872 KB Output is correct
42 Correct 12 ms 4608 KB Output is correct
43 Correct 3 ms 2688 KB Output is correct
44 Correct 4 ms 2688 KB Output is correct
45 Correct 4 ms 2816 KB Output is correct
46 Correct 4 ms 2688 KB Output is correct
47 Correct 3 ms 2688 KB Output is correct
48 Correct 4 ms 2688 KB Output is correct
49 Correct 4 ms 2688 KB Output is correct
50 Correct 4 ms 2688 KB Output is correct
51 Correct 4 ms 2688 KB Output is correct
52 Correct 4 ms 2688 KB Output is correct
53 Correct 4 ms 2688 KB Output is correct
54 Correct 4 ms 2688 KB Output is correct
55 Correct 4 ms 2688 KB Output is correct
56 Correct 4 ms 2688 KB Output is correct
57 Correct 88 ms 8824 KB Output is correct
58 Correct 81 ms 8736 KB Output is correct
59 Correct 82 ms 8716 KB Output is correct
60 Correct 69 ms 8696 KB Output is correct
61 Correct 78 ms 8568 KB Output is correct
62 Correct 66 ms 8696 KB Output is correct
63 Correct 67 ms 8440 KB Output is correct
64 Incorrect 56 ms 8412 KB Output isn't correct
65 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 6144 KB Output is correct
2 Correct 39 ms 6184 KB Output is correct
3 Correct 39 ms 6272 KB Output is correct
4 Correct 60 ms 6256 KB Output is correct
5 Correct 34 ms 6136 KB Output is correct
6 Correct 34 ms 6648 KB Output is correct
7 Correct 38 ms 6520 KB Output is correct
8 Correct 33 ms 6136 KB Output is correct
9 Correct 34 ms 6132 KB Output is correct
10 Correct 34 ms 6400 KB Output is correct
11 Correct 4 ms 2688 KB Output is correct
12 Correct 11 ms 4220 KB Output is correct
13 Correct 11 ms 4220 KB Output is correct
14 Correct 12 ms 4220 KB Output is correct
15 Correct 11 ms 4220 KB Output is correct
16 Correct 11 ms 4092 KB Output is correct
17 Correct 11 ms 4092 KB Output is correct
18 Correct 11 ms 4220 KB Output is correct
19 Correct 11 ms 4092 KB Output is correct
20 Correct 4 ms 2688 KB Output is correct
21 Correct 3 ms 2688 KB Output is correct
22 Correct 4 ms 2688 KB Output is correct
23 Correct 11 ms 4220 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 15224 KB Output is correct
2 Correct 62 ms 15096 KB Output is correct
3 Correct 41 ms 10876 KB Output is correct
4 Correct 11 ms 4480 KB Output is correct
5 Correct 9 ms 3584 KB Output is correct
6 Correct 16 ms 5504 KB Output is correct
7 Correct 3 ms 2688 KB Output is correct
8 Correct 32 ms 6904 KB Output is correct
9 Correct 48 ms 8816 KB Output is correct
10 Correct 4 ms 2688 KB Output is correct
11 Correct 55 ms 10360 KB Output is correct
12 Correct 60 ms 12896 KB Output is correct
13 Correct 4 ms 2688 KB Output is correct
14 Correct 4 ms 2688 KB Output is correct
15 Correct 4 ms 2816 KB Output is correct
16 Correct 5 ms 2816 KB Output is correct
17 Correct 4 ms 2688 KB Output is correct
18 Correct 4 ms 2788 KB Output is correct
19 Correct 5 ms 2816 KB Output is correct
20 Correct 4 ms 2688 KB Output is correct
21 Correct 5 ms 2816 KB Output is correct
22 Correct 5 ms 2816 KB Output is correct
23 Correct 3 ms 2688 KB Output is correct
24 Correct 4 ms 2688 KB Output is correct
25 Correct 3 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 4 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 4 ms 2660 KB Output is correct
33 Correct 4 ms 2688 KB Output is correct
34 Correct 3 ms 2688 KB Output is correct
35 Correct 3 ms 2688 KB Output is correct
36 Correct 4 ms 2688 KB Output is correct
37 Correct 4 ms 2688 KB Output is correct
38 Correct 4 ms 2688 KB Output is correct
39 Correct 4 ms 2688 KB Output is correct
40 Correct 4 ms 2816 KB Output is correct
41 Correct 4 ms 2688 KB Output is correct
42 Correct 5 ms 3072 KB Output is correct
43 Correct 6 ms 3072 KB Output is correct
44 Correct 4 ms 2816 KB Output is correct
45 Correct 4 ms 2816 KB Output is correct
46 Correct 5 ms 2816 KB Output is correct
47 Correct 5 ms 2816 KB Output is correct
48 Correct 5 ms 2816 KB Output is correct
49 Correct 4 ms 2816 KB Output is correct
50 Correct 5 ms 2816 KB Output is correct
51 Correct 5 ms 2816 KB Output is correct
52 Correct 4 ms 2816 KB Output is correct
53 Correct 5 ms 2816 KB Output is correct
54 Correct 5 ms 2944 KB Output is correct
55 Correct 5 ms 2816 KB Output is correct
56 Correct 5 ms 2816 KB Output is correct
57 Correct 5 ms 2816 KB Output is correct
58 Correct 5 ms 2808 KB Output is correct
59 Correct 4 ms 2816 KB Output is correct
60 Correct 5 ms 2816 KB Output is correct
61 Correct 5 ms 2816 KB Output is correct
62 Correct 4 ms 2816 KB Output is correct
63 Correct 5 ms 2816 KB Output is correct
64 Correct 5 ms 2816 KB Output is correct
65 Correct 5 ms 2816 KB Output is correct
66 Correct 4 ms 2816 KB Output is correct
67 Correct 5 ms 2816 KB Output is correct
68 Correct 4 ms 2688 KB Output is correct
69 Correct 4 ms 2688 KB Output is correct
70 Correct 5 ms 2816 KB Output is correct
71 Correct 5 ms 2816 KB Output is correct
72 Correct 4 ms 2816 KB Output is correct
73 Correct 4 ms 2816 KB Output is correct
74 Correct 4 ms 2816 KB Output is correct
75 Correct 5 ms 2816 KB Output is correct
76 Correct 5 ms 2816 KB Output is correct
77 Correct 5 ms 2816 KB Output is correct
78 Correct 4 ms 2816 KB Output is correct
79 Correct 5 ms 2816 KB Output is correct
80 Correct 5 ms 2816 KB Output is correct
81 Correct 4 ms 2816 KB Output is correct
82 Correct 6 ms 2816 KB Output is correct
83 Correct 5 ms 2816 KB Output is correct
84 Correct 5 ms 2816 KB Output is correct
85 Correct 5 ms 2816 KB Output is correct
86 Correct 5 ms 2816 KB Output is correct
87 Correct 5 ms 2816 KB Output is correct
88 Correct 5 ms 2816 KB Output is correct
89 Correct 5 ms 2816 KB Output is correct
90 Correct 4 ms 2688 KB Output is correct
91 Correct 4 ms 2688 KB Output is correct
92 Correct 3 ms 2688 KB Output is correct
93 Correct 4 ms 2688 KB Output is correct
94 Correct 4 ms 2688 KB Output is correct
95 Correct 3 ms 2688 KB Output is correct
96 Correct 3 ms 2688 KB Output is correct
97 Correct 4 ms 2688 KB Output is correct
98 Correct 3 ms 2688 KB Output is correct
99 Correct 3 ms 2688 KB Output is correct
100 Correct 4 ms 2688 KB Output is correct
101 Correct 4 ms 2816 KB Output is correct
102 Correct 4 ms 2816 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 15224 KB Output is correct
2 Correct 62 ms 15096 KB Output is correct
3 Correct 41 ms 10876 KB Output is correct
4 Correct 11 ms 4480 KB Output is correct
5 Correct 9 ms 3584 KB Output is correct
6 Correct 16 ms 5504 KB Output is correct
7 Correct 3 ms 2688 KB Output is correct
8 Correct 32 ms 6904 KB Output is correct
9 Correct 48 ms 8816 KB Output is correct
10 Correct 4 ms 2688 KB Output is correct
11 Correct 55 ms 10360 KB Output is correct
12 Correct 60 ms 12896 KB Output is correct
13 Correct 4 ms 2688 KB Output is correct
14 Correct 3 ms 2688 KB Output is correct
15 Correct 3 ms 2688 KB Output is correct
16 Correct 3 ms 2688 KB Output is correct
17 Correct 3 ms 2688 KB Output is correct
18 Correct 3 ms 2688 KB Output is correct
19 Correct 4 ms 2688 KB Output is correct
20 Correct 3 ms 2688 KB Output is correct
21 Correct 3 ms 2688 KB Output is correct
22 Correct 4 ms 2688 KB Output is correct
23 Correct 3 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 3 ms 2688 KB Output is correct
27 Correct 4 ms 2688 KB Output is correct
28 Correct 4 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 4 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 3 ms 2688 KB Output is correct
36 Correct 4 ms 2688 KB Output is correct
37 Correct 4 ms 2688 KB Output is correct
38 Correct 3 ms 2688 KB Output is correct
39 Correct 63 ms 15160 KB Output is correct
40 Correct 71 ms 15200 KB Output is correct
41 Correct 40 ms 10872 KB Output is correct
42 Correct 12 ms 4608 KB Output is correct
43 Correct 3 ms 2688 KB Output is correct
44 Correct 4 ms 2688 KB Output is correct
45 Correct 4 ms 2816 KB Output is correct
46 Correct 4 ms 2688 KB Output is correct
47 Correct 3 ms 2688 KB Output is correct
48 Correct 4 ms 2688 KB Output is correct
49 Correct 4 ms 2688 KB Output is correct
50 Correct 4 ms 2688 KB Output is correct
51 Correct 4 ms 2688 KB Output is correct
52 Correct 4 ms 2688 KB Output is correct
53 Correct 4 ms 2688 KB Output is correct
54 Correct 4 ms 2688 KB Output is correct
55 Correct 4 ms 2688 KB Output is correct
56 Correct 4 ms 2688 KB Output is correct
57 Correct 88 ms 8824 KB Output is correct
58 Correct 81 ms 8736 KB Output is correct
59 Correct 82 ms 8716 KB Output is correct
60 Correct 69 ms 8696 KB Output is correct
61 Correct 78 ms 8568 KB Output is correct
62 Correct 66 ms 8696 KB Output is correct
63 Correct 67 ms 8440 KB Output is correct
64 Incorrect 56 ms 8412 KB Output isn't correct
65 Halted 0 ms 0 KB -