oj.uz

Submission #993432

# Submission time Handle Problem Language Result Execution time Memory
993432 2024-06-05T15:43:53 Z Alfraganus Dreaming (IOI13_dreaming) C++17
47 / 100
 115 ms 8888 KB 
#include "dreaming.h"
#include <bits/stdc++.h>
using namespace std;

#define print(a) for(auto x : a) cout << x << ' '; cout << endl;

int travelTime(int n, int m, int l, int a[], int b[], int t[]) {
    vector<vector<array<int, 2>>> graph(n);
    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;
    vector<array<int, 2>> lnk(n, {-1, -1});
    vector<bool> used(n);
    int res = 0;
    for(int i = 0; i < n; i ++){
        if(!used[i]){
            set<array<int, 2>> st;
            st.insert({0, i});
            used[i] = 1;
            int last = -1;
            while(!st.empty()){
                auto [x, y] = *st.begin();
                st.erase(st.begin());
                last = y;

                for(auto z : graph[y]){
                    if(!used[z[0]]){
                        st.insert({x + z[1], z[0]});
                        used[z[0]] = 1;
                    }
                }
            }
            used[last] = 0;
            st.insert({0, last});
            while(!st.empty()){
                auto [x, y] = *st.begin();
                st.erase(st.begin());
                last = y;

                for(auto z : graph[y]){
                    if(used[z[0]]){
                        lnk[z[0]] = {y, z[1]};
                        st.insert({x + z[1], z[0]});
                        used[z[0]] = 0;
                    }
                }
            }
            used[i] = 1;
            st.insert({0, i});

            while(!st.empty()){
                auto [x, y] = *st.begin();
                st.erase(st.begin());
                
                for(auto z : graph[y]){
                    if(!used[z[0]]){
                        st.insert({x + z[1], z[0]});
                        used[z[0]] = 1;
                    }
                }
            }
            vector<int> p;
            int sum = 0;
            while(lnk[last][0] != -1){
                p.push_back(lnk[last][1]);
                sum += p.back();
                last = lnk[last][0];
            }
            res = max(res, sum);
            p.push_back(0);
            int ans = 1e9, s = 0;
            for(int i = 0; i < (int)p.size(); i ++)
                ans = min(ans, max(s, sum - s)), s += p[i];
            d.push_back(ans);
        }
    }
    if(d.size() == 1){
        while(1){

        }
        return res;
    }
    else if(d.size() == 2)
        return max(res, d[0] + d[1] + l);
    else{
        sort(d.begin(), d.end());
        int ans = res;
        int k = d.size();
        for(int i = 0; i < k - 2; i ++)
            ans = min(ans, max(d[k - 2] + d[k - 1] + 2 * l, d[i] + l + d[k - 1]));
        ans = min(ans, max(d[k - 2] + d[k - 1] + l, d[k - 1] + d[k - 3] + 2 * l));
        ans = min(ans, max(d[k - 2] + d[k - 1] + l, d[k - 2] + d[k - 3] + 2 * l));
        return ans;
    }
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 7784 KB Output is correct
2 Correct 37 ms 7620 KB Output is correct
3 Correct 23 ms 5212 KB Output is correct
4 Correct 5 ms 1372 KB Output is correct
5 Correct 4 ms 1116 KB Output is correct
6 Correct 10 ms 2140 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 19 ms 3420 KB Output is correct
9 Correct 25 ms 4444 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 34 ms 5904 KB Output is correct
12 Correct 42 ms 6788 KB Output is correct
13 Correct 1 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 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 1 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 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 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 37 ms 7784 KB Output is correct
2 Correct 37 ms 7620 KB Output is correct
3 Correct 23 ms 5212 KB Output is correct
4 Correct 5 ms 1372 KB Output is correct
5 Correct 4 ms 1116 KB Output is correct
6 Correct 10 ms 2140 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 19 ms 3420 KB Output is correct
9 Correct 25 ms 4444 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 34 ms 5904 KB Output is correct
12 Correct 42 ms 6788 KB Output is correct
13 Correct 1 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 0 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 348 KB Output is correct
28 Correct 1 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 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 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 37 ms 7640 KB Output is correct
40 Correct 39 ms 7640 KB Output is correct
41 Correct 23 ms 5212 KB Output is correct
42 Correct 5 ms 1368 KB Output is correct
43 Correct 0 ms 344 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 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 91 ms 8888 KB Output is correct
58 Correct 94 ms 8784 KB Output is correct
59 Correct 78 ms 8528 KB Output is correct
60 Correct 74 ms 8588 KB Output is correct
61 Correct 76 ms 8536 KB Output is correct
62 Correct 74 ms 8616 KB Output is correct
63 Correct 93 ms 8788 KB Output is correct
64 Correct 115 ms 8788 KB Output is correct
65 Correct 92 ms 8792 KB Output is correct
66 Correct 115 ms 8824 KB Output is correct
67 Correct 80 ms 8528 KB Output is correct
68 Correct 83 ms 8532 KB Output is correct
69 Correct 78 ms 8588 KB Output is correct
70 Correct 71 ms 8540 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 2 ms 604 KB Output is correct
73 Correct 2 ms 604 KB Output is correct
74 Correct 2 ms 604 KB Output is correct
75 Correct 2 ms 604 KB Output is correct
76 Correct 2 ms 604 KB Output is correct
77 Correct 2 ms 604 KB Output is correct
78 Correct 2 ms 604 KB Output is correct
79 Correct 2 ms 604 KB Output is correct
80 Correct 82 ms 8576 KB Output is correct
81 Correct 76 ms 8532 KB Output is correct
82 Correct 80 ms 8528 KB Output is correct
83 Correct 81 ms 8528 KB Output is correct
84 Correct 2 ms 604 KB Output is correct
85 Correct 1 ms 604 KB Output is correct
86 Correct 2 ms 604 KB Output is correct
87 Correct 2 ms 604 KB Output is correct
88 Correct 2 ms 604 KB Output is correct
89 Correct 2 ms 604 KB Output is correct
90 Correct 2 ms 616 KB Output is correct
91 Correct 2 ms 604 KB Output is correct
92 Correct 2 ms 604 KB Output is correct
93 Correct 2 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 6 ms 1116 KB Output is correct
105 Correct 10 ms 2136 KB Output is correct
106 Correct 0 ms 348 KB Output is correct
107 Correct 19 ms 3420 KB Output is correct
108 Correct 25 ms 4440 KB Output is correct
109 Correct 1 ms 348 KB Output is correct
110 Correct 36 ms 5980 KB Output is correct
111 Correct 44 ms 6860 KB Output is correct
112 Correct 1 ms 348 KB Output is correct
113 Correct 48 ms 8512 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 5976 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 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 1 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 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 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 Incorrect 1 ms 348 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 7784 KB Output is correct
2 Correct 37 ms 7620 KB Output is correct
3 Correct 23 ms 5212 KB Output is correct
4 Correct 5 ms 1372 KB Output is correct
5 Correct 4 ms 1116 KB Output is correct
6 Correct 10 ms 2140 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 19 ms 3420 KB Output is correct
9 Correct 25 ms 4444 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 34 ms 5904 KB Output is correct
12 Correct 42 ms 6788 KB Output is correct
13 Correct 1 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 0 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 348 KB Output is correct
28 Correct 1 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 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 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 37 ms 7640 KB Output is correct
40 Correct 39 ms 7640 KB Output is correct
41 Correct 23 ms 5212 KB Output is correct
42 Correct 5 ms 1368 KB Output is correct
43 Correct 0 ms 344 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 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 91 ms 8888 KB Output is correct
58 Correct 94 ms 8784 KB Output is correct
59 Correct 78 ms 8528 KB Output is correct
60 Correct 74 ms 8588 KB Output is correct
61 Correct 76 ms 8536 KB Output is correct
62 Correct 74 ms 8616 KB Output is correct
63 Correct 93 ms 8788 KB Output is correct
64 Correct 115 ms 8788 KB Output is correct
65 Correct 92 ms 8792 KB Output is correct
66 Correct 115 ms 8824 KB Output is correct
67 Correct 80 ms 8528 KB Output is correct
68 Correct 83 ms 8532 KB Output is correct
69 Correct 78 ms 8588 KB Output is correct
70 Correct 71 ms 8540 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 2 ms 604 KB Output is correct
73 Correct 2 ms 604 KB Output is correct
74 Correct 2 ms 604 KB Output is correct
75 Correct 2 ms 604 KB Output is correct
76 Correct 2 ms 604 KB Output is correct
77 Correct 2 ms 604 KB Output is correct
78 Correct 2 ms 604 KB Output is correct
79 Correct 2 ms 604 KB Output is correct
80 Correct 82 ms 8576 KB Output is correct
81 Correct 76 ms 8532 KB Output is correct
82 Correct 80 ms 8528 KB Output is correct
83 Correct 81 ms 8528 KB Output is correct
84 Correct 2 ms 604 KB Output is correct
85 Correct 1 ms 604 KB Output is correct
86 Correct 2 ms 604 KB Output is correct
87 Correct 2 ms 604 KB Output is correct
88 Correct 2 ms 604 KB Output is correct
89 Correct 2 ms 604 KB Output is correct
90 Correct 2 ms 616 KB Output is correct
91 Correct 2 ms 604 KB Output is correct
92 Correct 2 ms 604 KB Output is correct
93 Correct 2 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 6 ms 1116 KB Output is correct
105 Correct 10 ms 2136 KB Output is correct
106 Correct 0 ms 348 KB Output is correct
107 Correct 19 ms 3420 KB Output is correct
108 Correct 25 ms 4440 KB Output is correct
109 Correct 1 ms 348 KB Output is correct
110 Correct 36 ms 5980 KB Output is correct
111 Correct 44 ms 6860 KB Output is correct
112 Correct 1 ms 348 KB Output is correct
113 Correct 48 ms 8512 KB Output is correct
114 Incorrect 23 ms 5976 KB Output isn't correct
115 Halted 0 ms 0 KB -