Submission #1040254

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1040254	2024-07-31T20:44:47 Z	DeathIsAwe	Dreaming (IOI13_dreaming)	C++14	47 / 100	43 ms	14256 KB

dreaming

#include "dreaming.h"
#include <bits/stdc++.h>
using namespace std;
vector<vector<pair<int,int>>> graph;
vector<pair<int,int>> dum;
vector<int> radi, parent, stac, sum;
vector<bool> visited;


void recur(int a) {
    for (pair<int,int> i: graph[a]) {
        if (i.first != parent[a]) {
            recur(i.first);
            sum[a] = max(sum[a], sum[i.first] + i.second);
        }
    }
}


int travelTime(int n, int m, int l, int a[], int b[], int t[]) {
    int node, radius, prevsum, next, radiusprev, temp, temp2, diameter = 0, maxdi;
    bool button;
    for (int i=0;i<n;i++) {
        visited.push_back(false);
        sum.push_back(0);
        graph.push_back(dum);
        parent.push_back(0);
    }
    for (int i=0;i<m;i++) {
        graph[a[i]].push_back(make_pair(b[i], t[i]));
        graph[b[i]].push_back(make_pair(a[i], t[i]));
    }



    for (int i=0;i<n;i++) {
        if (visited[i]) {
            continue;
        }
        if (graph[i].size() == 0) {
            visited[i] = true;
            radi.push_back(0);
            continue;
        }
        if (graph[i].size() != 1) {
            continue;
        }
        stac = {i}; parent[i] = -1;
        while (stac.size() > 0) {
            node = stac.back(); stac.pop_back();
            visited[node] = true;
            for (pair<int,int> j: graph[node]) {
                if (j.first != parent[node]) {
                    parent[j.first] = node;
                    stac.push_back(j.first);
                }
            }
        }
        
        
        
        recur(i);
        radius = sum[i]; prevsum = 0; radiusprev = INT_MAX; node = i; diameter = sum[i];
        while (radiusprev > radius) {
            for (pair<int,int> j: graph[node]) {
                if (j.first == parent[node]) {
                    continue;
                }
                if (sum[j.first] + j.second == sum[node]) {
                    next = j.first;
                    temp2 = j.second;
                }
            }
            temp = 0;
            button = false;
            for (pair<int,int> j: graph[next]) {
                if (j.first == parent[next]) {
                    continue;
                }
                if (!button && sum[j.first] + j.second == sum[next]) {
                    button = true;
                    continue;
                }
                temp = max(temp, sum[j.first] + j.second);
            }
            diameter = max(diameter, temp + sum[next]);
            prevsum = max(prevsum + temp2, temp);
            radiusprev = radius; radius = max(prevsum, sum[next]); node = next;
            //cout << radiusprev << ' ' << radius << ' ' << prevsum << '\n';
        }
        //cout << radiusprev << '\n' << '\n';
        radi.push_back(radiusprev);
        maxdi = max(maxdi, diameter);
    }
    //for (int i: radi) {
    //    cout << i << ' ';
    //}
    //cout << '\n';

    sort(radi.begin(), radi.end(), greater<int>());
    if (radi.size() == 1) {
        return maxdi;
    } else if (radi.size() == 2) {
        return max(radi[0] + radi[1] + l, maxdi);
    }
    return max(max(radi[0] + radi[1], radi[1] + radi[2] + l) + l, maxdi);
}

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:21:77: warning: 'maxdi' may be used uninitialized in this function [-Wmaybe-uninitialized]
   21 |     int node, radius, prevsum, next, radiusprev, temp, temp2, diameter = 0, maxdi;
      |                                                                             ^~~~~
dreaming.cpp:87:35: warning: 'temp2' may be used uninitialized in this function [-Wmaybe-uninitialized]
   87 |             prevsum = max(prevsum + temp2, temp);
      |                           ~~~~~~~~^~~~~~~
dreaming.cpp:76:45: warning: 'next' may be used uninitialized in this function [-Wmaybe-uninitialized]
   76 |             for (pair<int,int> j: graph[next]) {
      |                                             ^

Subtask #1
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	26 ms	13068 KB	Output is correct
2	Correct	32 ms	13092 KB	Output is correct
3	Correct	20 ms	8632 KB	Output is correct
4	Correct	4 ms	2200 KB	Output is correct
5	Correct	3 ms	1432 KB	Output is correct
6	Correct	7 ms	3092 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	16 ms	4880 KB	Output is correct
9	Correct	21 ms	6672 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	24 ms	9704 KB	Output is correct
12	Correct	28 ms	10896 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	544 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct

Subtask #3
23.0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	26 ms	13068 KB	Output is correct
2	Correct	32 ms	13092 KB	Output is correct
3	Correct	20 ms	8632 KB	Output is correct
4	Correct	4 ms	2200 KB	Output is correct
5	Correct	3 ms	1432 KB	Output is correct
6	Correct	7 ms	3092 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	16 ms	4880 KB	Output is correct
9	Correct	21 ms	6672 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	24 ms	9704 KB	Output is correct
12	Correct	28 ms	10896 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	1 ms	544 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	27 ms	13400 KB	Output is correct
40	Correct	29 ms	13056 KB	Output is correct
41	Correct	19 ms	8504 KB	Output is correct
42	Correct	4 ms	2200 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	348 KB	Output is correct
52	Correct	0 ms	344 KB	Output is correct
53	Correct	0 ms	348 KB	Output is correct
54	Correct	0 ms	348 KB	Output is correct
55	Correct	0 ms	348 KB	Output is correct
56	Correct	0 ms	344 KB	Output is correct
57	Correct	32 ms	8716 KB	Output is correct
58	Correct	30 ms	8820 KB	Output is correct
59	Correct	32 ms	9220 KB	Output is correct
60	Correct	28 ms	8704 KB	Output is correct
61	Correct	31 ms	8716 KB	Output is correct
62	Correct	27 ms	8716 KB	Output is correct
63	Correct	26 ms	8472 KB	Output is correct
64	Correct	27 ms	9228 KB	Output is correct
65	Correct	27 ms	8460 KB	Output is correct
66	Correct	28 ms	8460 KB	Output is correct
67	Correct	29 ms	8620 KB	Output is correct
68	Correct	32 ms	8828 KB	Output is correct
69	Correct	32 ms	8560 KB	Output is correct
70	Correct	32 ms	8704 KB	Output is correct
71	Correct	0 ms	348 KB	Output is correct
72	Correct	1 ms	604 KB	Output is correct
73	Correct	1 ms	604 KB	Output is correct
74	Correct	1 ms	604 KB	Output is correct
75	Correct	1 ms	604 KB	Output is correct
76	Correct	1 ms	604 KB	Output is correct
77	Correct	1 ms	604 KB	Output is correct
78	Correct	1 ms	604 KB	Output is correct
79	Correct	1 ms	480 KB	Output is correct
80	Correct	27 ms	8736 KB	Output is correct
81	Correct	29 ms	8708 KB	Output is correct
82	Correct	28 ms	9228 KB	Output is correct
83	Correct	30 ms	8596 KB	Output is correct
84	Correct	1 ms	604 KB	Output is correct
85	Correct	1 ms	604 KB	Output is correct
86	Correct	1 ms	604 KB	Output is correct
87	Correct	1 ms	604 KB	Output is correct
88	Correct	1 ms	604 KB	Output is correct
89	Correct	1 ms	604 KB	Output is correct
90	Correct	1 ms	604 KB	Output is correct
91	Correct	1 ms	604 KB	Output is correct
92	Correct	1 ms	604 KB	Output is correct
93	Correct	1 ms	604 KB	Output is correct
94	Correct	0 ms	348 KB	Output is correct
95	Correct	0 ms	348 KB	Output is correct
96	Correct	0 ms	348 KB	Output is correct
97	Correct	0 ms	348 KB	Output is correct
98	Correct	0 ms	348 KB	Output is correct
99	Correct	0 ms	348 KB	Output is correct
100	Correct	0 ms	348 KB	Output is correct
101	Correct	0 ms	348 KB	Output is correct
102	Correct	0 ms	348 KB	Output is correct
103	Correct	0 ms	348 KB	Output is correct
104	Correct	3 ms	1432 KB	Output is correct
105	Correct	7 ms	3160 KB	Output is correct
106	Correct	0 ms	348 KB	Output is correct
107	Correct	13 ms	4912 KB	Output is correct
108	Correct	18 ms	6484 KB	Output is correct
109	Correct	1 ms	348 KB	Output is correct
110	Correct	28 ms	8864 KB	Output is correct
111	Correct	30 ms	10760 KB	Output is correct
112	Correct	1 ms	348 KB	Output is correct
113	Correct	43 ms	14256 KB	Output is correct

Subtask #4
0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	18 ms	6156 KB	Output is correct
2	Correct	12 ms	6412 KB	Output is correct
3	Correct	14 ms	6156 KB	Output is correct
4	Correct	11 ms	6412 KB	Output is correct
5	Correct	11 ms	6668 KB	Output is correct
6	Correct	16 ms	6920 KB	Output is correct
7	Correct	14 ms	6668 KB	Output is correct
8	Correct	15 ms	6204 KB	Output is correct
9	Correct	11 ms	6156 KB	Output is correct
10	Correct	14 ms	7176 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	5 ms	5904 KB	Output is correct
13	Correct	4 ms	4624 KB	Output is correct
14	Correct	4 ms	4624 KB	Output is correct
15	Correct	4 ms	4624 KB	Output is correct
16	Correct	4 ms	4624 KB	Output is correct
17	Correct	4 ms	4584 KB	Output is correct
18	Correct	4 ms	6064 KB	Output is correct
19	Correct	4 ms	4624 KB	Output is correct
20	Incorrect	0 ms	348 KB	Output isn't correct
21	Halted	0 ms	0 KB	-

Subtask #5
0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	544 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	604 KB	Output is correct
28	Correct	1 ms	604 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	1 ms	604 KB	Output is correct
31	Correct	1 ms	604 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	608 KB	Output is correct
34	Correct	1 ms	608 KB	Output is correct
35	Correct	0 ms	352 KB	Output is correct
36	Correct	0 ms	352 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	0 ms	356 KB	Output is correct
40	Correct	0 ms	352 KB	Output is correct
41	Correct	0 ms	352 KB	Output is correct
42	Correct	0 ms	352 KB	Output is correct
43	Correct	0 ms	352 KB	Output is correct
44	Correct	0 ms	436 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	0 ms	360 KB	Output is correct
47	Correct	0 ms	352 KB	Output is correct
48	Correct	0 ms	360 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	348 KB	Output is correct
52	Incorrect	0 ms	348 KB	Output isn't correct
53	Halted	0 ms	0 KB	-

Subtask #6
0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	26 ms	13068 KB	Output is correct
2	Correct	32 ms	13092 KB	Output is correct
3	Correct	20 ms	8632 KB	Output is correct
4	Correct	4 ms	2200 KB	Output is correct
5	Correct	3 ms	1432 KB	Output is correct
6	Correct	7 ms	3092 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	16 ms	4880 KB	Output is correct
9	Correct	21 ms	6672 KB	Output is correct
10	Correct	0 ms	344 KB	Output is correct
11	Correct	24 ms	9704 KB	Output is correct
12	Correct	28 ms	10896 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	1 ms	544 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	1 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	27 ms	13400 KB	Output is correct
40	Correct	29 ms	13056 KB	Output is correct
41	Correct	19 ms	8504 KB	Output is correct
42	Correct	4 ms	2200 KB	Output is correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	348 KB	Output is correct
52	Correct	0 ms	344 KB	Output is correct
53	Correct	0 ms	348 KB	Output is correct
54	Correct	0 ms	348 KB	Output is correct
55	Correct	0 ms	348 KB	Output is correct
56	Correct	0 ms	344 KB	Output is correct
57	Correct	32 ms	8716 KB	Output is correct
58	Correct	30 ms	8820 KB	Output is correct
59	Correct	32 ms	9220 KB	Output is correct
60	Correct	28 ms	8704 KB	Output is correct
61	Correct	31 ms	8716 KB	Output is correct
62	Correct	27 ms	8716 KB	Output is correct
63	Correct	26 ms	8472 KB	Output is correct
64	Correct	27 ms	9228 KB	Output is correct
65	Correct	27 ms	8460 KB	Output is correct
66	Correct	28 ms	8460 KB	Output is correct
67	Correct	29 ms	8620 KB	Output is correct
68	Correct	32 ms	8828 KB	Output is correct
69	Correct	32 ms	8560 KB	Output is correct
70	Correct	32 ms	8704 KB	Output is correct
71	Correct	0 ms	348 KB	Output is correct
72	Correct	1 ms	604 KB	Output is correct
73	Correct	1 ms	604 KB	Output is correct
74	Correct	1 ms	604 KB	Output is correct
75	Correct	1 ms	604 KB	Output is correct
76	Correct	1 ms	604 KB	Output is correct
77	Correct	1 ms	604 KB	Output is correct
78	Correct	1 ms	604 KB	Output is correct
79	Correct	1 ms	480 KB	Output is correct
80	Correct	27 ms	8736 KB	Output is correct
81	Correct	29 ms	8708 KB	Output is correct
82	Correct	28 ms	9228 KB	Output is correct
83	Correct	30 ms	8596 KB	Output is correct
84	Correct	1 ms	604 KB	Output is correct
85	Correct	1 ms	604 KB	Output is correct
86	Correct	1 ms	604 KB	Output is correct
87	Correct	1 ms	604 KB	Output is correct
88	Correct	1 ms	604 KB	Output is correct
89	Correct	1 ms	604 KB	Output is correct
90	Correct	1 ms	604 KB	Output is correct
91	Correct	1 ms	604 KB	Output is correct
92	Correct	1 ms	604 KB	Output is correct
93	Correct	1 ms	604 KB	Output is correct
94	Correct	0 ms	348 KB	Output is correct
95	Correct	0 ms	348 KB	Output is correct
96	Correct	0 ms	348 KB	Output is correct
97	Correct	0 ms	348 KB	Output is correct
98	Correct	0 ms	348 KB	Output is correct
99	Correct	0 ms	348 KB	Output is correct
100	Correct	0 ms	348 KB	Output is correct
101	Correct	0 ms	348 KB	Output is correct
102	Correct	0 ms	348 KB	Output is correct
103	Correct	0 ms	348 KB	Output is correct
104	Correct	3 ms	1432 KB	Output is correct
105	Correct	7 ms	3160 KB	Output is correct
106	Correct	0 ms	348 KB	Output is correct
107	Correct	13 ms	4912 KB	Output is correct
108	Correct	18 ms	6484 KB	Output is correct
109	Correct	1 ms	348 KB	Output is correct
110	Correct	28 ms	8864 KB	Output is correct
111	Correct	30 ms	10760 KB	Output is correct
112	Correct	1 ms	348 KB	Output is correct
113	Correct	43 ms	14256 KB	Output is correct
114	Correct	18 ms	6156 KB	Output is correct
115	Correct	12 ms	6412 KB	Output is correct
116	Correct	14 ms	6156 KB	Output is correct
117	Correct	11 ms	6412 KB	Output is correct
118	Correct	11 ms	6668 KB	Output is correct
119	Correct	16 ms	6920 KB	Output is correct
120	Correct	14 ms	6668 KB	Output is correct
121	Correct	15 ms	6204 KB	Output is correct
122	Correct	11 ms	6156 KB	Output is correct
123	Correct	14 ms	7176 KB	Output is correct
124	Correct	0 ms	348 KB	Output is correct
125	Correct	5 ms	5904 KB	Output is correct
126	Correct	4 ms	4624 KB	Output is correct
127	Correct	4 ms	4624 KB	Output is correct
128	Correct	4 ms	4624 KB	Output is correct
129	Correct	4 ms	4624 KB	Output is correct
130	Correct	4 ms	4584 KB	Output is correct
131	Correct	4 ms	6064 KB	Output is correct
132	Correct	4 ms	4624 KB	Output is correct
133	Incorrect	0 ms	348 KB	Output isn't correct
134	Halted	0 ms	0 KB	-

Submission #1040254

Compilation message

Subtask #1 14.0 / 14.0

Subtask #2 10.0 / 10.0

Subtask #3 23.0 / 23.0

Subtask #4 0 / 18.0

Subtask #5 0 / 12.0

Subtask #6 0 / 23.0

Subtask #1
14.0 / 14.0

Subtask #2
10.0 / 10.0

Subtask #3
23.0 / 23.0

Subtask #4
0 / 18.0

Subtask #5
0 / 12.0

Subtask #6
0 / 23.0