oj.uz

답안 #725352

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
725352 2023-04-17T10:27:06 Z yeyso 꿈 (IOI13_dreaming) C++14
47 / 100
 1000 ms 19124 KB 
#include "dreaming.h"
#include <bits/stdc++.h>
using namespace std;
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    int n = N; int m = M; int l = L;
    vector<vector<int>> adj(n, vector<int>());
    vector<vector<int>> dma(n, vector<int>());

    vector<int> a(A, A+m);
    vector<int> b(B, B+m);
    vector<int> t(T, T+m);
    for(int i = 0; i < a.size(); i ++){
        adj[a[i]].push_back(b[i]); adj[b[i]].push_back(a[i]);
        dma[a[i]].push_back(t[i]); dma[b[i]].push_back(t[i]);
    }

    vector<int> components = {0};
    queue<int> q0; q0.push(0);
    vector<int> v(n, 0);
    int node = 0;
    while(!q0.empty()){
        node = q0.front();
        q0.pop();
        if(!v[node]){
            v[node] = 1;
            for(int i = 0; i < adj[node].size(); i ++){
                q0.push(adj[node][i]);
            }
        }
        if(q0.empty()){
            for(int i = 0; i < v.size(); i ++){
                if(v[i] == 0){
                    components.push_back(i);
                    q0.push(i);
                    break;
                }
            }
        }
    }
    queue<int> q;
    vector<int> d0(n, INT_MAX / 2); vector<int> v0(n, 0);
    vector<int> d(n, INT_MAX / 2); vector<int> visited(n, 0);
    vector<pair<int, int>> prefix0; vector<pair<int, int>> prefix;
    vector<vector<int>> prefixes;
    vector<int> maxsizes;
    vector<int> csize;
    vector<int> parents(n, -1); vector<int> parents0(n, -1);
    for(int x = 0; x < components.size(); x ++){
        prefix = prefix0;
        int furtherest = 0; int dist = 0;
        d = d0; visited = v0;
        parents = parents0;
        d[components[x]] = 0;
        // Finds the furtherest node in the component
        q.push(components[x]);
        while(!q.empty()){
            node = q.front();
            q.pop();
            if(!visited[node]){
                visited[node] = 1;
                for(int i = 0; i < adj[node].size(); i ++){
                    q.push(adj[node][i]);
                    d[adj[node][i]] = min(d[adj[node][i]], d[node] + dma[node][i]);
                    
                }
            }
        }

        for(int i = 0; i < visited.size(); i ++){
            if(visited[i]){
                if(d[i] >= dist){
                    dist = d[i];
                    furtherest = i;
                }
            }
        }

        // Generate a prefix array of nodes from the furtherest

        d = d0; visited = v0;
        d[furtherest] = 0;
        q.push(furtherest);
        //cout << furtherest << "\n";
        while(!q.empty()){
            node = q.front();
            q.pop();
            if(!visited[node]){
                visited[node] = 1;
                for(int i = 0; i < adj[node].size(); i ++){
                    q.push(adj[node][i]);
                    //cout << d[node] << " ";
                    d[adj[node][i]] = min(d[adj[node][i]], d[node] + dma[node][i]);

                    if(!visited[adj[node][i]]){
                        parents[adj[node][i]] = node;
                    }
                }
            }
        }
        furtherest = 0;
        dist = 0;
        for(int i = 0; i < visited.size(); i ++){
            if(visited[i]){
                if(d[i] >= dist){
                    dist = d[i];
                    furtherest = i;
                }
            }
        }
        //cout << "_" << furtherest << "_";
        //int cur = furtherest;
        node = furtherest;
        dist = 0;
        while(node > -1){
            prefix.push_back({d[node], 0});
            node = parents[node];
        }
        //sort(prefix.begin(), prefix.end());
        reverse(prefix.begin(), prefix.end());
        //cout << components[x] << " | ";
        /*for(int i = 0; i < parents.size(); i ++){
            cout << parents[i] << " ";
        }*/
        int maxd = prefix[prefix.size() - 1].first;
        int score = INT_MAX / 2;
        int best = INT_MAX / 2;
        for(int i = 0; i < prefix.size(); i ++){
            //cout << prefix[i].first << " ";
            if(max(prefix[i].first, maxd - prefix[i].first) < best){
                //score = abs(maxd / 2 - prefix[i].first);
                best = max(prefix[i].first, maxd - prefix[i].first);
            }
        }
        //prefixes.push_back(prefix);
        maxsizes.push_back(maxd);
        //cout << " - " << best << " ";
        csize.push_back(best);
        //cout << best << "\n";
        //cout << furtherest << " " << dist << " " << components[i] << "\n";
        //cout << components[i] << " ";
        //cout << "\n";
    }

    
    return max(max(maxsizes[0], maxsizes[1]), csize[0] + csize[1] + l);
}
/*
g++ -DEVAL -static -O2 -o dreaming grader.cpp dreaming.cpp
12 10 2
0 8 4 
8 2 2
2 7 4
5 11 3
5 1 7
1 3 1
1 9 5
10 6 3
2 6 2
10 4 2
*/

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:12:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |     for(int i = 0; i < a.size(); i ++){
      |                    ~~^~~~~~~~~~
dreaming.cpp:26:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 |             for(int i = 0; i < adj[node].size(); i ++){
      |                            ~~^~~~~~~~~~~~~~~~~~
dreaming.cpp:31:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |             for(int i = 0; i < v.size(); i ++){
      |                            ~~^~~~~~~~~~
dreaming.cpp:48:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for(int x = 0; x < components.size(); x ++){
      |                    ~~^~~~~~~~~~~~~~~~~~~
dreaming.cpp:61:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |                 for(int i = 0; i < adj[node].size(); i ++){
      |                                ~~^~~~~~~~~~~~~~~~~~
dreaming.cpp:69:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |         for(int i = 0; i < visited.size(); i ++){
      |                        ~~^~~~~~~~~~~~~~~~
dreaming.cpp:89:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |                 for(int i = 0; i < adj[node].size(); i ++){
      |                                ~~^~~~~~~~~~~~~~~~~~
dreaming.cpp:102:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |         for(int i = 0; i < visited.size(); i ++){
      |                        ~~^~~~~~~~~~~~~~~~
dreaming.cpp:127:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  127 |         for(int i = 0; i < prefix.size(); i ++){
      |                        ~~^~~~~~~~~~~~~~~
dreaming.cpp:125:13: warning: unused variable 'score' [-Wunused-variable]
  125 |         int score = INT_MAX / 2;
      |             ^~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 16384 KB Output is correct
2 Correct 87 ms 16844 KB Output is correct
3 Correct 47 ms 11248 KB Output is correct
4 Correct 9 ms 2876 KB Output is correct
5 Correct 7 ms 2132 KB Output is correct
6 Correct 14 ms 4180 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 31 ms 7628 KB Output is correct
9 Correct 52 ms 9548 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 105 ms 12868 KB Output is correct
12 Correct 159 ms 15044 KB Output is correct
13 Correct 1 ms 468 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 312 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 316 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 16384 KB Output is correct
2 Correct 87 ms 16844 KB Output is correct
3 Correct 47 ms 11248 KB Output is correct
4 Correct 9 ms 2876 KB Output is correct
5 Correct 7 ms 2132 KB Output is correct
6 Correct 14 ms 4180 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 31 ms 7628 KB Output is correct
9 Correct 52 ms 9548 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 105 ms 12868 KB Output is correct
12 Correct 159 ms 15044 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 308 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 308 KB Output is correct
26 Correct 1 ms 304 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 312 KB Output is correct
29 Correct 1 ms 304 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 316 KB Output is correct
39 Correct 80 ms 17292 KB Output is correct
40 Correct 76 ms 17220 KB Output is correct
41 Correct 43 ms 11452 KB Output is correct
42 Correct 8 ms 2816 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 280 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 308 KB Output is correct
55 Correct 1 ms 212 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 122 ms 17632 KB Output is correct
58 Correct 133 ms 17592 KB Output is correct
59 Correct 136 ms 17716 KB Output is correct
60 Correct 124 ms 17768 KB Output is correct
61 Correct 121 ms 18124 KB Output is correct
62 Correct 140 ms 18264 KB Output is correct
63 Correct 157 ms 17912 KB Output is correct
64 Correct 118 ms 17940 KB Output is correct
65 Correct 108 ms 18124 KB Output is correct
66 Correct 123 ms 18216 KB Output is correct
67 Correct 126 ms 17740 KB Output is correct
68 Correct 121 ms 17748 KB Output is correct
69 Correct 121 ms 18032 KB Output is correct
70 Correct 152 ms 18032 KB Output is correct
71 Correct 1 ms 312 KB Output is correct
72 Correct 2 ms 724 KB Output is correct
73 Correct 2 ms 724 KB Output is correct
74 Correct 2 ms 744 KB Output is correct
75 Correct 2 ms 724 KB Output is correct
76 Correct 2 ms 724 KB Output is correct
77 Correct 3 ms 828 KB Output is correct
78 Correct 2 ms 724 KB Output is correct
79 Correct 2 ms 724 KB Output is correct
80 Correct 111 ms 17776 KB Output is correct
81 Correct 137 ms 17644 KB Output is correct
82 Correct 112 ms 18148 KB Output is correct
83 Correct 114 ms 18148 KB Output is correct
84 Correct 2 ms 724 KB Output is correct
85 Correct 2 ms 596 KB Output is correct
86 Correct 2 ms 724 KB Output is correct
87 Correct 2 ms 724 KB Output is correct
88 Correct 3 ms 744 KB Output is correct
89 Correct 3 ms 724 KB Output is correct
90 Correct 2 ms 736 KB Output is correct
91 Correct 3 ms 808 KB Output is correct
92 Correct 2 ms 708 KB Output is correct
93 Correct 2 ms 724 KB Output is correct
94 Correct 1 ms 308 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 224 KB Output is correct
97 Correct 1 ms 312 KB Output is correct
98 Correct 1 ms 212 KB Output is correct
99 Correct 1 ms 212 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 1 ms 308 KB Output is correct
102 Correct 1 ms 312 KB Output is correct
103 Correct 1 ms 304 KB Output is correct
104 Correct 8 ms 2132 KB Output is correct
105 Correct 16 ms 4156 KB Output is correct
106 Correct 1 ms 304 KB Output is correct
107 Correct 36 ms 7644 KB Output is correct
108 Correct 41 ms 9600 KB Output is correct
109 Correct 1 ms 308 KB Output is correct
110 Correct 65 ms 13344 KB Output is correct
111 Correct 102 ms 15440 KB Output is correct
112 Correct 1 ms 468 KB Output is correct
113 Correct 139 ms 19124 KB Output is correct

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1036 ms 10476 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 308 KB Output is correct
13 Correct 1 ms 304 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 312 KB Output is correct
16 Correct 1 ms 304 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 316 KB Output is correct
26 Incorrect 1 ms 468 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 16384 KB Output is correct
2 Correct 87 ms 16844 KB Output is correct
3 Correct 47 ms 11248 KB Output is correct
4 Correct 9 ms 2876 KB Output is correct
5 Correct 7 ms 2132 KB Output is correct
6 Correct 14 ms 4180 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 31 ms 7628 KB Output is correct
9 Correct 52 ms 9548 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 105 ms 12868 KB Output is correct
12 Correct 159 ms 15044 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 308 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 308 KB Output is correct
26 Correct 1 ms 304 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 312 KB Output is correct
29 Correct 1 ms 304 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 316 KB Output is correct
39 Correct 80 ms 17292 KB Output is correct
40 Correct 76 ms 17220 KB Output is correct
41 Correct 43 ms 11452 KB Output is correct
42 Correct 8 ms 2816 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 280 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 308 KB Output is correct
55 Correct 1 ms 212 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 122 ms 17632 KB Output is correct
58 Correct 133 ms 17592 KB Output is correct
59 Correct 136 ms 17716 KB Output is correct
60 Correct 124 ms 17768 KB Output is correct
61 Correct 121 ms 18124 KB Output is correct
62 Correct 140 ms 18264 KB Output is correct
63 Correct 157 ms 17912 KB Output is correct
64 Correct 118 ms 17940 KB Output is correct
65 Correct 108 ms 18124 KB Output is correct
66 Correct 123 ms 18216 KB Output is correct
67 Correct 126 ms 17740 KB Output is correct
68 Correct 121 ms 17748 KB Output is correct
69 Correct 121 ms 18032 KB Output is correct
70 Correct 152 ms 18032 KB Output is correct
71 Correct 1 ms 312 KB Output is correct
72 Correct 2 ms 724 KB Output is correct
73 Correct 2 ms 724 KB Output is correct
74 Correct 2 ms 744 KB Output is correct
75 Correct 2 ms 724 KB Output is correct
76 Correct 2 ms 724 KB Output is correct
77 Correct 3 ms 828 KB Output is correct
78 Correct 2 ms 724 KB Output is correct
79 Correct 2 ms 724 KB Output is correct
80 Correct 111 ms 17776 KB Output is correct
81 Correct 137 ms 17644 KB Output is correct
82 Correct 112 ms 18148 KB Output is correct
83 Correct 114 ms 18148 KB Output is correct
84 Correct 2 ms 724 KB Output is correct
85 Correct 2 ms 596 KB Output is correct
86 Correct 2 ms 724 KB Output is correct
87 Correct 2 ms 724 KB Output is correct
88 Correct 3 ms 744 KB Output is correct
89 Correct 3 ms 724 KB Output is correct
90 Correct 2 ms 736 KB Output is correct
91 Correct 3 ms 808 KB Output is correct
92 Correct 2 ms 708 KB Output is correct
93 Correct 2 ms 724 KB Output is correct
94 Correct 1 ms 308 KB Output is correct
95 Correct 1 ms 212 KB Output is correct
96 Correct 1 ms 224 KB Output is correct
97 Correct 1 ms 312 KB Output is correct
98 Correct 1 ms 212 KB Output is correct
99 Correct 1 ms 212 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 1 ms 308 KB Output is correct
102 Correct 1 ms 312 KB Output is correct
103 Correct 1 ms 304 KB Output is correct
104 Correct 8 ms 2132 KB Output is correct
105 Correct 16 ms 4156 KB Output is correct
106 Correct 1 ms 304 KB Output is correct
107 Correct 36 ms 7644 KB Output is correct
108 Correct 41 ms 9600 KB Output is correct
109 Correct 1 ms 308 KB Output is correct
110 Correct 65 ms 13344 KB Output is correct
111 Correct 102 ms 15440 KB Output is correct
112 Correct 1 ms 468 KB Output is correct
113 Correct 139 ms 19124 KB Output is correct
114 Execution timed out 1036 ms 10476 KB Time limit exceeded
115 Halted 0 ms 0 KB -