oj.uz

답안 #251278

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
251278 2020-07-20T16:37:10 Z AaronNaidu 꿈 (IOI13_dreaming) C++14
47 / 100
 160 ms 15300 KB 
#include <bits/stdc++.h>
#include "dreaming.h"
using namespace std;

vector<pair<int, int>> graph[100001];
int dists[100001];
bool visited[100001];
int maxWithinDist = 0;
int maxDist = 0;
int maxNode = 0;

void dfs(int node, int parent, int dist) {
    dists[node] = dist;
    if (dist > maxDist)
    {
        maxWithinDist = max(maxWithinDist, dist);
        maxDist = dist;
        maxNode = node;
    }
    for (auto i : graph[node])
    {
        if (i.first != parent)
        {
            dfs(i.first, node, dist + i.second);
        }
    }
    visited[node] = true;
}

int travelTime(int n, int m, int l, int a[], int b[], int t[]) {
    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]});
    }
    dfs(0, -1, 0);    
    //cout << "Done dfs1 landed on " << maxNode << "\n";
    int dfsFrom = maxNode;
    maxDist = 0;
    maxNode = dfsFrom;
    dfs(dfsFrom, -1, 0);
    //cout << "Done dfs2 landed on " << maxNode << "\n";
    int currDist = maxDist;
    int prevCurrDist = currDist;
    int currNode = maxNode;
    while (float(currDist) > maxDist/float(2))
    {
        for (auto i : graph[currNode])
        {
            if (dists[i.first] < dists[currNode])
            {
                currNode = i.first;
                prevCurrDist = currDist;
                currDist = dists[currNode];
                break;
            }
        }
    }
    //cout << "Cand dists are " << currDist << " " << prevCurrDist << " out of " << maxDist << "\n";
    int ans1 = min(max(currDist, maxDist - currDist), max(prevCurrDist, maxDist - prevCurrDist));
    int start2 = 0;
    for (int i = 0; i < n; i++)
    {
        if (!visited[i])
        {
            //cout << "Starting from " << start2 << "\n";
            break;
        }
        start2++;
    }
    maxDist = 0;
    maxNode = start2;
    dfs(start2, -1, 0);
    //cout << "Done dfs3 landed on " << maxNode << "\n";
    dfsFrom = maxNode;
    maxDist = 0;
    maxNode = dfsFrom;
    dfs(dfsFrom, -1, 0);
    //cout << "Done dfs4 landed on " << maxNode << "\n";
    currDist = maxDist;
    prevCurrDist = currDist;
    currNode = maxNode;
    while (float(currDist) > maxDist/float(2))
    {
        for (auto i : graph[currNode])
        {
            if (dists[i.first] < dists[currNode])
            {
                currNode = i.first;
                prevCurrDist = currDist;
                currDist = dists[currNode];
                break;
            }
        }
    }
    //cout << "Cand dists are " << currDist << " " << prevCurrDist << " out of " << maxDist << "\n";
    int ans2 = min(max(currDist, maxDist - currDist), max(prevCurrDist, maxDist - prevCurrDist));
    //cout << "Ans 1 is " << ans1 << "\n";
    //cout << "Ans 2 is " << ans2 << "\n";
    return max(ans1 + ans2 + l, maxWithinDist);
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 12792 KB Output is correct
2 Correct 70 ms 13944 KB Output is correct
3 Correct 42 ms 10232 KB Output is correct
4 Correct 10 ms 4352 KB Output is correct
5 Correct 8 ms 3584 KB Output is correct
6 Correct 18 ms 5224 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 26 ms 6656 KB Output is correct
9 Correct 34 ms 8312 KB Output is correct
10 Correct 2 ms 2816 KB Output is correct
11 Correct 53 ms 10232 KB Output is correct
12 Correct 60 ms 11984 KB Output is correct
13 Correct 3 ms 2816 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 12792 KB Output is correct
2 Correct 70 ms 13944 KB Output is correct
3 Correct 42 ms 10232 KB Output is correct
4 Correct 10 ms 4352 KB Output is correct
5 Correct 8 ms 3584 KB Output is correct
6 Correct 18 ms 5224 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 26 ms 6656 KB Output is correct
9 Correct 34 ms 8312 KB Output is correct
10 Correct 2 ms 2816 KB Output is correct
11 Correct 53 ms 10232 KB Output is correct
12 Correct 60 ms 11984 KB Output is correct
13 Correct 3 ms 2816 KB Output is correct
14 Correct 2 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 2 ms 2688 KB Output is correct
20 Correct 2 ms 2688 KB Output is correct
21 Correct 3 ms 2688 KB Output is correct
22 Correct 3 ms 2688 KB Output is correct
23 Correct 3 ms 2688 KB Output is correct
24 Correct 3 ms 2688 KB Output is correct
25 Correct 2 ms 2688 KB Output is correct
26 Correct 2 ms 2688 KB Output is correct
27 Correct 3 ms 2688 KB Output is correct
28 Correct 2 ms 2688 KB Output is correct
29 Correct 2 ms 2688 KB Output is correct
30 Correct 2 ms 2688 KB Output is correct
31 Correct 2 ms 2688 KB Output is correct
32 Correct 2 ms 2688 KB Output is correct
33 Correct 2 ms 2688 KB Output is correct
34 Correct 2 ms 2688 KB Output is correct
35 Correct 2 ms 2688 KB Output is correct
36 Correct 2 ms 2688 KB Output is correct
37 Correct 2 ms 2688 KB Output is correct
38 Correct 2 ms 2688 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 12792 KB Output is correct
2 Correct 70 ms 13944 KB Output is correct
3 Correct 42 ms 10232 KB Output is correct
4 Correct 10 ms 4352 KB Output is correct
5 Correct 8 ms 3584 KB Output is correct
6 Correct 18 ms 5224 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 26 ms 6656 KB Output is correct
9 Correct 34 ms 8312 KB Output is correct
10 Correct 2 ms 2816 KB Output is correct
11 Correct 53 ms 10232 KB Output is correct
12 Correct 60 ms 11984 KB Output is correct
13 Correct 3 ms 2816 KB Output is correct
14 Correct 2 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 2 ms 2688 KB Output is correct
20 Correct 2 ms 2688 KB Output is correct
21 Correct 3 ms 2688 KB Output is correct
22 Correct 3 ms 2688 KB Output is correct
23 Correct 3 ms 2688 KB Output is correct
24 Correct 3 ms 2688 KB Output is correct
25 Correct 2 ms 2688 KB Output is correct
26 Correct 2 ms 2688 KB Output is correct
27 Correct 3 ms 2688 KB Output is correct
28 Correct 2 ms 2688 KB Output is correct
29 Correct 2 ms 2688 KB Output is correct
30 Correct 2 ms 2688 KB Output is correct
31 Correct 2 ms 2688 KB Output is correct
32 Correct 2 ms 2688 KB Output is correct
33 Correct 2 ms 2688 KB Output is correct
34 Correct 2 ms 2688 KB Output is correct
35 Correct 2 ms 2688 KB Output is correct
36 Correct 2 ms 2688 KB Output is correct
37 Correct 2 ms 2688 KB Output is correct
38 Correct 2 ms 2688 KB Output is correct
39 Correct 54 ms 13944 KB Output is correct
40 Correct 69 ms 14132 KB Output is correct
41 Correct 36 ms 10232 KB Output is correct
42 Correct 10 ms 4352 KB Output is correct
43 Correct 3 ms 2688 KB Output is correct
44 Correct 2 ms 2688 KB Output is correct
45 Correct 2 ms 2688 KB Output is correct
46 Correct 2 ms 2688 KB Output is correct
47 Correct 2 ms 2688 KB Output is correct
48 Correct 2 ms 2688 KB Output is correct
49 Correct 2 ms 2688 KB Output is correct
50 Correct 2 ms 2688 KB Output is correct
51 Correct 2 ms 2688 KB Output is correct
52 Correct 2 ms 2688 KB Output is correct
53 Correct 2 ms 2688 KB Output is correct
54 Correct 2 ms 2688 KB Output is correct
55 Correct 2 ms 2688 KB Output is correct
56 Correct 2 ms 2688 KB Output is correct
57 Correct 67 ms 9592 KB Output is correct
58 Correct 84 ms 9720 KB Output is correct
59 Correct 66 ms 9656 KB Output is correct
60 Correct 67 ms 9592 KB Output is correct
61 Correct 67 ms 9720 KB Output is correct
62 Correct 65 ms 9720 KB Output is correct
63 Correct 69 ms 9464 KB Output is correct
64 Correct 63 ms 9336 KB Output is correct
65 Correct 80 ms 9684 KB Output is correct
66 Correct 68 ms 9592 KB Output is correct
67 Correct 68 ms 9592 KB Output is correct
68 Correct 77 ms 9592 KB Output is correct
69 Correct 93 ms 9880 KB Output is correct
70 Correct 82 ms 9852 KB Output is correct
71 Correct 2 ms 2688 KB Output is correct
72 Correct 3 ms 2944 KB Output is correct
73 Correct 3 ms 2944 KB Output is correct
74 Correct 5 ms 2944 KB Output is correct
75 Correct 3 ms 2944 KB Output is correct
76 Correct 3 ms 2944 KB Output is correct
77 Correct 3 ms 2944 KB Output is correct
78 Correct 4 ms 2944 KB Output is correct
79 Correct 4 ms 2944 KB Output is correct
80 Correct 70 ms 9592 KB Output is correct
81 Correct 86 ms 9592 KB Output is correct
82 Correct 160 ms 9720 KB Output is correct
83 Correct 106 ms 9720 KB Output is correct
84 Correct 5 ms 2816 KB Output is correct
85 Correct 3 ms 2816 KB Output is correct
86 Correct 6 ms 2816 KB Output is correct
87 Correct 3 ms 2816 KB Output is correct
88 Correct 5 ms 2816 KB Output is correct
89 Correct 3 ms 2816 KB Output is correct
90 Correct 3 ms 2816 KB Output is correct
91 Correct 3 ms 2944 KB Output is correct
92 Correct 4 ms 2816 KB Output is correct
93 Correct 3 ms 2816 KB Output is correct
94 Correct 2 ms 2688 KB Output is correct
95 Correct 2 ms 2688 KB Output is correct
96 Correct 2 ms 2688 KB Output is correct
97 Correct 2 ms 2688 KB Output is correct
98 Correct 2 ms 2688 KB Output is correct
99 Correct 2 ms 2688 KB Output is correct
100 Correct 2 ms 2688 KB Output is correct
101 Correct 2 ms 2728 KB Output is correct
102 Correct 2 ms 2688 KB Output is correct
103 Correct 2 ms 2688 KB Output is correct
104 Correct 7 ms 3584 KB Output is correct
105 Correct 16 ms 5216 KB Output is correct
106 Correct 2 ms 2688 KB Output is correct
107 Correct 26 ms 6652 KB Output is correct
108 Correct 33 ms 8312 KB Output is correct
109 Correct 2 ms 2688 KB Output is correct
110 Correct 50 ms 10104 KB Output is correct
111 Correct 62 ms 11896 KB Output is correct
112 Correct 2 ms 2816 KB Output is correct
113 Correct 99 ms 15300 KB Output is correct

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 17 ms 4992 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 12792 KB Output is correct
2 Correct 70 ms 13944 KB Output is correct
3 Correct 42 ms 10232 KB Output is correct
4 Correct 10 ms 4352 KB Output is correct
5 Correct 8 ms 3584 KB Output is correct
6 Correct 18 ms 5224 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 26 ms 6656 KB Output is correct
9 Correct 34 ms 8312 KB Output is correct
10 Correct 2 ms 2816 KB Output is correct
11 Correct 53 ms 10232 KB Output is correct
12 Correct 60 ms 11984 KB Output is correct
13 Correct 3 ms 2816 KB Output is correct
14 Incorrect 2 ms 2688 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 12792 KB Output is correct
2 Correct 70 ms 13944 KB Output is correct
3 Correct 42 ms 10232 KB Output is correct
4 Correct 10 ms 4352 KB Output is correct
5 Correct 8 ms 3584 KB Output is correct
6 Correct 18 ms 5224 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 26 ms 6656 KB Output is correct
9 Correct 34 ms 8312 KB Output is correct
10 Correct 2 ms 2816 KB Output is correct
11 Correct 53 ms 10232 KB Output is correct
12 Correct 60 ms 11984 KB Output is correct
13 Correct 3 ms 2816 KB Output is correct
14 Correct 2 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 2 ms 2688 KB Output is correct
20 Correct 2 ms 2688 KB Output is correct
21 Correct 3 ms 2688 KB Output is correct
22 Correct 3 ms 2688 KB Output is correct
23 Correct 3 ms 2688 KB Output is correct
24 Correct 3 ms 2688 KB Output is correct
25 Correct 2 ms 2688 KB Output is correct
26 Correct 2 ms 2688 KB Output is correct
27 Correct 3 ms 2688 KB Output is correct
28 Correct 2 ms 2688 KB Output is correct
29 Correct 2 ms 2688 KB Output is correct
30 Correct 2 ms 2688 KB Output is correct
31 Correct 2 ms 2688 KB Output is correct
32 Correct 2 ms 2688 KB Output is correct
33 Correct 2 ms 2688 KB Output is correct
34 Correct 2 ms 2688 KB Output is correct
35 Correct 2 ms 2688 KB Output is correct
36 Correct 2 ms 2688 KB Output is correct
37 Correct 2 ms 2688 KB Output is correct
38 Correct 2 ms 2688 KB Output is correct
39 Correct 54 ms 13944 KB Output is correct
40 Correct 69 ms 14132 KB Output is correct
41 Correct 36 ms 10232 KB Output is correct
42 Correct 10 ms 4352 KB Output is correct
43 Correct 3 ms 2688 KB Output is correct
44 Correct 2 ms 2688 KB Output is correct
45 Correct 2 ms 2688 KB Output is correct
46 Correct 2 ms 2688 KB Output is correct
47 Correct 2 ms 2688 KB Output is correct
48 Correct 2 ms 2688 KB Output is correct
49 Correct 2 ms 2688 KB Output is correct
50 Correct 2 ms 2688 KB Output is correct
51 Correct 2 ms 2688 KB Output is correct
52 Correct 2 ms 2688 KB Output is correct
53 Correct 2 ms 2688 KB Output is correct
54 Correct 2 ms 2688 KB Output is correct
55 Correct 2 ms 2688 KB Output is correct
56 Correct 2 ms 2688 KB Output is correct
57 Correct 67 ms 9592 KB Output is correct
58 Correct 84 ms 9720 KB Output is correct
59 Correct 66 ms 9656 KB Output is correct
60 Correct 67 ms 9592 KB Output is correct
61 Correct 67 ms 9720 KB Output is correct
62 Correct 65 ms 9720 KB Output is correct
63 Correct 69 ms 9464 KB Output is correct
64 Correct 63 ms 9336 KB Output is correct
65 Correct 80 ms 9684 KB Output is correct
66 Correct 68 ms 9592 KB Output is correct
67 Correct 68 ms 9592 KB Output is correct
68 Correct 77 ms 9592 KB Output is correct
69 Correct 93 ms 9880 KB Output is correct
70 Correct 82 ms 9852 KB Output is correct
71 Correct 2 ms 2688 KB Output is correct
72 Correct 3 ms 2944 KB Output is correct
73 Correct 3 ms 2944 KB Output is correct
74 Correct 5 ms 2944 KB Output is correct
75 Correct 3 ms 2944 KB Output is correct
76 Correct 3 ms 2944 KB Output is correct
77 Correct 3 ms 2944 KB Output is correct
78 Correct 4 ms 2944 KB Output is correct
79 Correct 4 ms 2944 KB Output is correct
80 Correct 70 ms 9592 KB Output is correct
81 Correct 86 ms 9592 KB Output is correct
82 Correct 160 ms 9720 KB Output is correct
83 Correct 106 ms 9720 KB Output is correct
84 Correct 5 ms 2816 KB Output is correct
85 Correct 3 ms 2816 KB Output is correct
86 Correct 6 ms 2816 KB Output is correct
87 Correct 3 ms 2816 KB Output is correct
88 Correct 5 ms 2816 KB Output is correct
89 Correct 3 ms 2816 KB Output is correct
90 Correct 3 ms 2816 KB Output is correct
91 Correct 3 ms 2944 KB Output is correct
92 Correct 4 ms 2816 KB Output is correct
93 Correct 3 ms 2816 KB Output is correct
94 Correct 2 ms 2688 KB Output is correct
95 Correct 2 ms 2688 KB Output is correct
96 Correct 2 ms 2688 KB Output is correct
97 Correct 2 ms 2688 KB Output is correct
98 Correct 2 ms 2688 KB Output is correct
99 Correct 2 ms 2688 KB Output is correct
100 Correct 2 ms 2688 KB Output is correct
101 Correct 2 ms 2728 KB Output is correct
102 Correct 2 ms 2688 KB Output is correct
103 Correct 2 ms 2688 KB Output is correct
104 Correct 7 ms 3584 KB Output is correct
105 Correct 16 ms 5216 KB Output is correct
106 Correct 2 ms 2688 KB Output is correct
107 Correct 26 ms 6652 KB Output is correct
108 Correct 33 ms 8312 KB Output is correct
109 Correct 2 ms 2688 KB Output is correct
110 Correct 50 ms 10104 KB Output is correct
111 Correct 62 ms 11896 KB Output is correct
112 Correct 2 ms 2816 KB Output is correct
113 Correct 99 ms 15300 KB Output is correct
114 Incorrect 17 ms 4992 KB Output isn't correct
115 Halted 0 ms 0 KB -