oj.uz

Submission #398996

# Submission time Handle Problem Language Result Execution time Memory
398996 2021-05-05T02:08:16 Z jlallas384 Dreaming (IOI13_dreaming) C++14
40 / 100
 1000 ms 7364 KB 
#include <bits/stdc++.h>
#include "dreaming.h"
using namespace std;

int travelTime(int n, int m, int l, int A[], int B[], int T[]) {
    vector<vector<pair<int,int>>> g(n);
    for(int i = 0; i < m; i++){
        g[A[i]].emplace_back(B[i],T[i]);
        g[B[i]].emplace_back(A[i],T[i]);
    }
    vector<int> vis(n),mins;
    int ans = 0;
    for(int i = 0; i < n; i++) if(!vis[i]){
        queue<int> q;
        q.push(i);
        vis[i] = 1;
        vector<int> comp;
        while(q.size()){
            int v = q.front(); q.pop();
            comp.push_back(v);
            for(auto [u,w]: g[v]) if(!vis[u]){
                q.push(u);
                vis[u] = 1;
            }
        }
        int mn = 1e9;
        for(int st: comp){
            queue<tuple<int,int,int>> q;
            q.emplace(st,-1,0);
            int mx = 0;
            while(q.size()){
                auto [v,p,dst] = q.front(); q.pop();
                mx = max(mx,dst);
                ans = max(ans,dst);
                for(auto [u,w]: g[v]) if(u != p){
                    q.emplace(u,v,w+dst);
                }
            }
            mn = min(mn,mx);
        }
        mins.push_back(mn);
    }
    sort(mins.rbegin(), mins.rend());
    int maxP = mins[0];
    for(int i = 1; i < mins.size(); i++){
        ans = max(ans,maxP + l + mins[i]);
        maxP = max(maxP,mins[i] + l);
    }
    return ans;
}

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:21:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   21 |             for(auto [u,w]: g[v]) if(!vis[u]){
      |                      ^
dreaming.cpp:32:22: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   32 |                 auto [v,p,dst] = q.front(); q.pop();
      |                      ^
dreaming.cpp:35:26: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   35 |                 for(auto [u,w]: g[v]) if(u != p){
      |                          ^
dreaming.cpp:45:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     for(int i = 1; i < mins.size(); i++){
      |                    ~~^~~~~~~~~~~~~

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1090 ms 7364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1090 ms 7364 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 5528 KB Output is correct
2 Correct 37 ms 5584 KB Output is correct
3 Correct 35 ms 5992 KB Output is correct
4 Correct 37 ms 5996 KB Output is correct
5 Correct 35 ms 5964 KB Output is correct
6 Correct 38 ms 6460 KB Output is correct
7 Correct 50 ms 6216 KB Output is correct
8 Correct 34 ms 5892 KB Output is correct
9 Correct 33 ms 5832 KB Output is correct
10 Correct 39 ms 6188 KB Output is correct
11 Correct 1 ms 304 KB Output is correct
12 Correct 18 ms 3656 KB Output is correct
13 Correct 17 ms 3696 KB Output is correct
14 Correct 17 ms 3704 KB Output is correct
15 Correct 17 ms 3688 KB Output is correct
16 Correct 17 ms 3668 KB Output is correct
17 Correct 17 ms 3656 KB Output is correct
18 Correct 17 ms 3740 KB Output is correct
19 Correct 17 ms 3656 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 17 ms 3672 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 2 ms 460 KB Output is correct
28 Correct 4 ms 460 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 3 ms 460 KB Output is correct
31 Correct 7 ms 460 KB Output is correct
32 Correct 2 ms 332 KB Output is correct
33 Correct 4 ms 480 KB Output is correct
34 Correct 6 ms 460 KB Output is correct
35 Correct 1 ms 304 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 204 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 208 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 1 ms 300 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 204 KB Output is correct
49 Correct 1 ms 204 KB Output is correct
50 Correct 1 ms 204 KB Output is correct
51 Correct 2 ms 204 KB Output is correct
52 Correct 1 ms 204 KB Output is correct
53 Correct 1 ms 304 KB Output is correct
54 Correct 188 ms 564 KB Output is correct
55 Correct 190 ms 580 KB Output is correct
56 Correct 2 ms 460 KB Output is correct
57 Correct 2 ms 460 KB Output is correct
58 Correct 93 ms 588 KB Output is correct
59 Correct 132 ms 588 KB Output is correct
60 Correct 2 ms 460 KB Output is correct
61 Correct 2 ms 444 KB Output is correct
62 Correct 82 ms 588 KB Output is correct
63 Correct 89 ms 588 KB Output is correct
64 Correct 1 ms 332 KB Output is correct
65 Correct 2 ms 460 KB Output is correct
66 Correct 179 ms 588 KB Output is correct
67 Correct 93 ms 588 KB Output is correct
68 Correct 2 ms 460 KB Output is correct
69 Correct 2 ms 460 KB Output is correct
70 Correct 2 ms 460 KB Output is correct
71 Correct 2 ms 460 KB Output is correct
72 Correct 132 ms 708 KB Output is correct
73 Correct 140 ms 588 KB Output is correct
74 Correct 4 ms 460 KB Output is correct
75 Correct 7 ms 572 KB Output is correct
76 Correct 97 ms 576 KB Output is correct
77 Correct 125 ms 592 KB Output is correct
78 Correct 2 ms 460 KB Output is correct
79 Correct 2 ms 460 KB Output is correct
80 Correct 1 ms 332 KB Output is correct
81 Correct 1 ms 332 KB Output is correct
82 Correct 3 ms 460 KB Output is correct
83 Correct 3 ms 460 KB Output is correct
84 Correct 14 ms 480 KB Output is correct
85 Correct 2 ms 332 KB Output is correct
86 Correct 53 ms 456 KB Output is correct
87 Correct 135 ms 592 KB Output is correct
88 Correct 2 ms 460 KB Output is correct
89 Correct 2 ms 460 KB Output is correct
90 Correct 2 ms 460 KB Output is correct
91 Correct 2 ms 464 KB Output is correct
92 Correct 47 ms 460 KB Output is correct
93 Correct 53 ms 460 KB Output is correct
94 Correct 54 ms 448 KB Output is correct
95 Correct 74 ms 532 KB Output is correct
96 Correct 66 ms 708 KB Output is correct
97 Correct 63 ms 460 KB Output is correct
98 Correct 69 ms 460 KB Output is correct
99 Correct 148 ms 588 KB Output is correct
100 Correct 98 ms 548 KB Output is correct
101 Correct 84 ms 460 KB Output is correct
102 Correct 1 ms 204 KB Output is correct
103 Correct 1 ms 204 KB Output is correct
104 Correct 1 ms 204 KB Output is correct
105 Correct 1 ms 204 KB Output is correct
106 Correct 1 ms 204 KB Output is correct
107 Correct 1 ms 204 KB Output is correct
108 Correct 1 ms 204 KB Output is correct
109 Correct 1 ms 204 KB Output is correct
110 Correct 1 ms 204 KB Output is correct
111 Correct 1 ms 204 KB Output is correct
112 Correct 2 ms 332 KB Output is correct
113 Correct 8 ms 332 KB Output is correct
114 Correct 12 ms 332 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1090 ms 7364 KB Time limit exceeded
2 Halted 0 ms 0 KB -