oj.uz

Submission #962277

# Submission time Handle Problem Language Result Execution time Memory
962277 2024-04-13T09:59:39 Z n3rm1n Dreaming (IOI13_dreaming) C++17
47 / 100
 153 ms 38408 KB 
#include<bits/stdc++.h>
#include "dreaming.h"
using namespace std;
const long long MAXN = 5e5 + 10;
vector < pair < long long, long long > > g[MAXN];
long long mark[MAXN];
long long used[MAXN];
void dfs0(long long beg)
{
    mark[beg] = 1;
    used[beg] = 1;
    long long nb;
    for (long long i = 0; i < g[beg].size(); ++ i)
    {
        nb = g[beg][i].first;
        if(!used[nb])
            dfs0(nb);
    }
}
long long far = 0, far_index = 0;
void dfs_diam(int beg, int to_there)
{
    if(far <= to_there)
    {
        far = to_there;
        far_index = beg;
    }
    used[beg] = 1;
    int nb, distt;
    for (int i = 0; i < g[beg].size(); ++ i)
    {
        nb = g[beg][i].first;
        distt = g[beg][i].second;
        if(!used[nb])dfs_diam(nb, to_there + distt);
    }
}
long long maxdist = 0;
long long dfs(long long beg)
{
    used[beg] = 1;
    long long nb, distt;
    long long maxx = 0;
    for (long long i = 0; i < g[beg].size(); ++ i)
    {
        nb = g[beg][i].first;
        distt = g[beg][i].second;
        if(!used[nb])maxx = max(maxx, dfs(nb)+distt);
    }
    return maxx;
}
vector < pair < long long, long long >  > path;
long long st, fi;
long long dfs_form(long long beg, long long add)
{
    used[beg] = 1;
    if(beg == fi)
    {
        path.push_back(make_pair(beg, add));
        return 1;
    }
    long long nb, distt;
    long long found = 0;
    for (long long i = 0; i < g[beg].size(); ++ i)
    {
        nb = g[beg][i].first;
        distt = g[beg][i].second;
        if(!used[nb])
        {
            if(dfs_form(nb, add + distt))found = 1;
        }
    }
    if(found)path.push_back(make_pair(beg, add));
    return found;
}
vector < pair < long long, long long > > path1, path2;
int travelTime(int N, int M, int L, int A[], int B[], int T[])
{
    for (long long i = 0; i < M; ++ i)
    {
        g[A[i]].push_back(make_pair(B[i], T[i]));
        g[B[i]].push_back(make_pair(A[i], T[i]));
    }

    long long n = N;
    dfs0(0);

    /// opit
    int aa1 = 0, bb1 = 0;
    int aa2 = 0, bb2 = 0;
    memset(used, 0, sizeof(used));
    far = 0;
    far_index = 0;
    dfs_diam(0, 0);
    aa1 = far_index;
    memset(used, 0, sizeof(used));
    far = 0;
    far_index = 0;
    dfs_diam(aa1, 0);
    bb1 = far_index;

    int starter2 = 0;
    for (int i = 0; i < n && (starter2 == 0); ++ i)
        if(!mark[i])starter2 = i;
    if(starter2 == 0)return 1;
    memset(used, 0, sizeof(used));
    far = 0;
    far_index = 0;
    dfs_diam(starter2, 0);
    aa2 = far_index;
    memset(used, 0, sizeof(used));
    far = 0;
    far_index = 0;
    dfs_diam(aa2, 0);
    bb2 = far_index;

    path.clear();
    st = aa1;
    fi = bb1;
    dfs_form(st, 0);
    memset(used, 0, sizeof(used));
    path1 = path;
    path.clear();
    st = aa2;
    fi = bb2;
    memset(used, 0, sizeof(used));
    dfs_form(st, 0);
    path2 = path;

    long long index1 = path1[0].first, index2 = path2[0].first;
    long long total1 = path1[0].second;
    long long total2 = path2[0].second;
    long long best1 = total1, best2 = total2, curr;
    for (int i = 1; i < path1.size(); ++ i)
    {
        curr = max(path1[i].second, total1 - path1[i].second);
        if(curr < best1)
        {
            best1 = curr;
            index1 = path1[i].first;
        }
    }
    for (int i = 1; i < path2.size(); ++ i)
    {
        curr = max(path2[i].second, total2 - path2[i].second);

        if(curr < best2)
        {
            best2 = curr;
            index2 = path2[i].first;
        }
    }
    g[index1].push_back(make_pair(index2, L));
    g[index2].push_back(make_pair(index1, L));
    long long ans = 0;
    memset(used, 0, sizeof(used));
    ans = max(ans, dfs(aa1));
    memset(used, 0, sizeof(used));
    ans = max(ans, dfs(bb1));
    memset(used, 0, sizeof(used));
    ans = max(ans, dfs(aa2));
    memset(used, 0, sizeof(used));
    ans = max(ans, dfs(bb2));
    return ans;
    ///

}

Compilation message

dreaming.cpp: In function 'void dfs0(long long int)':
dreaming.cpp:13:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for (long long i = 0; i < g[beg].size(); ++ i)
      |                           ~~^~~~~~~~~~~~~~~
dreaming.cpp: In function 'void dfs_diam(int, int)':
dreaming.cpp:30:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for (int i = 0; i < g[beg].size(); ++ i)
      |                     ~~^~~~~~~~~~~~~~~
dreaming.cpp: In function 'long long int dfs(long long int)':
dreaming.cpp:43:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     for (long long i = 0; i < g[beg].size(); ++ i)
      |                           ~~^~~~~~~~~~~~~~~
dreaming.cpp: In function 'long long int dfs_form(long long int, long long int)':
dreaming.cpp:63:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |     for (long long i = 0; i < g[beg].size(); ++ i)
      |                           ~~^~~~~~~~~~~~~~~
dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:133:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  133 |     for (int i = 1; i < path1.size(); ++ i)
      |                     ~~^~~~~~~~~~~~~~
dreaming.cpp:142:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  142 |     for (int i = 1; i < path2.size(); ++ i)
      |                     ~~^~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 36716 KB Output is correct
2 Correct 77 ms 36500 KB Output is correct
3 Correct 40 ms 30572 KB Output is correct
4 Correct 12 ms 21468 KB Output is correct
5 Correct 10 ms 20316 KB Output is correct
6 Correct 26 ms 23000 KB Output is correct
7 Correct 4 ms 18780 KB Output is correct
8 Correct 32 ms 24956 KB Output is correct
9 Correct 48 ms 27336 KB Output is correct
10 Correct 6 ms 19036 KB Output is correct
11 Correct 85 ms 29720 KB Output is correct
12 Correct 95 ms 33020 KB Output is correct
13 Correct 6 ms 19036 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 36716 KB Output is correct
2 Correct 77 ms 36500 KB Output is correct
3 Correct 40 ms 30572 KB Output is correct
4 Correct 12 ms 21468 KB Output is correct
5 Correct 10 ms 20316 KB Output is correct
6 Correct 26 ms 23000 KB Output is correct
7 Correct 4 ms 18780 KB Output is correct
8 Correct 32 ms 24956 KB Output is correct
9 Correct 48 ms 27336 KB Output is correct
10 Correct 6 ms 19036 KB Output is correct
11 Correct 85 ms 29720 KB Output is correct
12 Correct 95 ms 33020 KB Output is correct
13 Correct 6 ms 19036 KB Output is correct
14 Correct 5 ms 18780 KB Output is correct
15 Correct 6 ms 18780 KB Output is correct
16 Correct 5 ms 18776 KB Output is correct
17 Correct 5 ms 18776 KB Output is correct
18 Correct 6 ms 18956 KB Output is correct
19 Correct 4 ms 18776 KB Output is correct
20 Correct 6 ms 18780 KB Output is correct
21 Correct 4 ms 18952 KB Output is correct
22 Correct 5 ms 18780 KB Output is correct
23 Correct 4 ms 18776 KB Output is correct
24 Correct 4 ms 18780 KB Output is correct
25 Correct 6 ms 18972 KB Output is correct
26 Correct 5 ms 18780 KB Output is correct
27 Correct 5 ms 18776 KB Output is correct
28 Correct 4 ms 18956 KB Output is correct
29 Correct 5 ms 18780 KB Output is correct
30 Correct 5 ms 18780 KB Output is correct
31 Correct 6 ms 18780 KB Output is correct
32 Correct 6 ms 18880 KB Output is correct
33 Correct 5 ms 18780 KB Output is correct
34 Correct 5 ms 18780 KB Output is correct
35 Correct 5 ms 18776 KB Output is correct
36 Correct 4 ms 18780 KB Output is correct
37 Correct 5 ms 18780 KB Output is correct
38 Correct 5 ms 18780 KB Output is correct
39 Correct 64 ms 36368 KB Output is correct
40 Correct 63 ms 36532 KB Output is correct
41 Correct 45 ms 30636 KB Output is correct
42 Correct 14 ms 21436 KB Output is correct
43 Correct 5 ms 18780 KB Output is correct
44 Correct 5 ms 18960 KB Output is correct
45 Correct 5 ms 18780 KB Output is correct
46 Correct 5 ms 18780 KB Output is correct
47 Correct 5 ms 18948 KB Output is correct
48 Correct 6 ms 18880 KB Output is correct
49 Correct 5 ms 18776 KB Output is correct
50 Correct 5 ms 18960 KB Output is correct
51 Correct 5 ms 18780 KB Output is correct
52 Correct 5 ms 18780 KB Output is correct
53 Correct 5 ms 18780 KB Output is correct
54 Correct 5 ms 18776 KB Output is correct
55 Correct 4 ms 18776 KB Output is correct
56 Correct 5 ms 19200 KB Output is correct
57 Correct 89 ms 25276 KB Output is correct
58 Correct 153 ms 25264 KB Output is correct
59 Correct 88 ms 25124 KB Output is correct
60 Correct 80 ms 25132 KB Output is correct
61 Correct 85 ms 24972 KB Output is correct
62 Correct 72 ms 24916 KB Output is correct
63 Correct 70 ms 24620 KB Output is correct
64 Correct 65 ms 24532 KB Output is correct
65 Correct 67 ms 24696 KB Output is correct
66 Correct 76 ms 24656 KB Output is correct
67 Correct 101 ms 25168 KB Output is correct
68 Correct 79 ms 24980 KB Output is correct
69 Correct 88 ms 25296 KB Output is correct
70 Correct 113 ms 24968 KB Output is correct
71 Correct 6 ms 19032 KB Output is correct
72 Correct 6 ms 19152 KB Output is correct
73 Correct 7 ms 19036 KB Output is correct
74 Correct 8 ms 19036 KB Output is correct
75 Correct 7 ms 19032 KB Output is correct
76 Correct 6 ms 19036 KB Output is correct
77 Correct 6 ms 19036 KB Output is correct
78 Correct 7 ms 19036 KB Output is correct
79 Correct 6 ms 19032 KB Output is correct
80 Correct 78 ms 25332 KB Output is correct
81 Correct 80 ms 25000 KB Output is correct
82 Correct 78 ms 24908 KB Output is correct
83 Correct 86 ms 24688 KB Output is correct
84 Correct 6 ms 19036 KB Output is correct
85 Correct 5 ms 19084 KB Output is correct
86 Correct 6 ms 19032 KB Output is correct
87 Correct 6 ms 19036 KB Output is correct
88 Correct 5 ms 19032 KB Output is correct
89 Correct 6 ms 19036 KB Output is correct
90 Correct 5 ms 19032 KB Output is correct
91 Correct 7 ms 19124 KB Output is correct
92 Correct 5 ms 19036 KB Output is correct
93 Correct 6 ms 19036 KB Output is correct
94 Correct 5 ms 18780 KB Output is correct
95 Correct 4 ms 18776 KB Output is correct
96 Correct 4 ms 18776 KB Output is correct
97 Correct 5 ms 18780 KB Output is correct
98 Correct 4 ms 18784 KB Output is correct
99 Correct 4 ms 18780 KB Output is correct
100 Correct 4 ms 18780 KB Output is correct
101 Correct 4 ms 18776 KB Output is correct
102 Correct 4 ms 18780 KB Output is correct
103 Correct 4 ms 18780 KB Output is correct
104 Correct 14 ms 20388 KB Output is correct
105 Correct 20 ms 23000 KB Output is correct
106 Correct 5 ms 18776 KB Output is correct
107 Correct 40 ms 25016 KB Output is correct
108 Correct 43 ms 27340 KB Output is correct
109 Correct 5 ms 19036 KB Output is correct
110 Correct 67 ms 29712 KB Output is correct
111 Correct 107 ms 33220 KB Output is correct
112 Correct 5 ms 19036 KB Output is correct
113 Correct 110 ms 38408 KB Output is correct

Subtask #4
0 / 18.0

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

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 18780 KB Output is correct
2 Correct 6 ms 18780 KB Output is correct
3 Correct 5 ms 18776 KB Output is correct
4 Correct 5 ms 18776 KB Output is correct
5 Correct 6 ms 18956 KB Output is correct
6 Correct 4 ms 18776 KB Output is correct
7 Correct 6 ms 18780 KB Output is correct
8 Correct 4 ms 18952 KB Output is correct
9 Correct 5 ms 18780 KB Output is correct
10 Correct 4 ms 18776 KB Output is correct
11 Correct 4 ms 18780 KB Output is correct
12 Correct 6 ms 18972 KB Output is correct
13 Correct 5 ms 18780 KB Output is correct
14 Correct 5 ms 18776 KB Output is correct
15 Correct 4 ms 18956 KB Output is correct
16 Correct 5 ms 18780 KB Output is correct
17 Correct 5 ms 18780 KB Output is correct
18 Correct 6 ms 18780 KB Output is correct
19 Correct 6 ms 18880 KB Output is correct
20 Correct 5 ms 18780 KB Output is correct
21 Correct 5 ms 18780 KB Output is correct
22 Correct 5 ms 18776 KB Output is correct
23 Correct 4 ms 18780 KB Output is correct
24 Correct 5 ms 18780 KB Output is correct
25 Correct 5 ms 18780 KB Output is correct
26 Incorrect 4 ms 18780 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 36716 KB Output is correct
2 Correct 77 ms 36500 KB Output is correct
3 Correct 40 ms 30572 KB Output is correct
4 Correct 12 ms 21468 KB Output is correct
5 Correct 10 ms 20316 KB Output is correct
6 Correct 26 ms 23000 KB Output is correct
7 Correct 4 ms 18780 KB Output is correct
8 Correct 32 ms 24956 KB Output is correct
9 Correct 48 ms 27336 KB Output is correct
10 Correct 6 ms 19036 KB Output is correct
11 Correct 85 ms 29720 KB Output is correct
12 Correct 95 ms 33020 KB Output is correct
13 Correct 6 ms 19036 KB Output is correct
14 Correct 5 ms 18780 KB Output is correct
15 Correct 6 ms 18780 KB Output is correct
16 Correct 5 ms 18776 KB Output is correct
17 Correct 5 ms 18776 KB Output is correct
18 Correct 6 ms 18956 KB Output is correct
19 Correct 4 ms 18776 KB Output is correct
20 Correct 6 ms 18780 KB Output is correct
21 Correct 4 ms 18952 KB Output is correct
22 Correct 5 ms 18780 KB Output is correct
23 Correct 4 ms 18776 KB Output is correct
24 Correct 4 ms 18780 KB Output is correct
25 Correct 6 ms 18972 KB Output is correct
26 Correct 5 ms 18780 KB Output is correct
27 Correct 5 ms 18776 KB Output is correct
28 Correct 4 ms 18956 KB Output is correct
29 Correct 5 ms 18780 KB Output is correct
30 Correct 5 ms 18780 KB Output is correct
31 Correct 6 ms 18780 KB Output is correct
32 Correct 6 ms 18880 KB Output is correct
33 Correct 5 ms 18780 KB Output is correct
34 Correct 5 ms 18780 KB Output is correct
35 Correct 5 ms 18776 KB Output is correct
36 Correct 4 ms 18780 KB Output is correct
37 Correct 5 ms 18780 KB Output is correct
38 Correct 5 ms 18780 KB Output is correct
39 Correct 64 ms 36368 KB Output is correct
40 Correct 63 ms 36532 KB Output is correct
41 Correct 45 ms 30636 KB Output is correct
42 Correct 14 ms 21436 KB Output is correct
43 Correct 5 ms 18780 KB Output is correct
44 Correct 5 ms 18960 KB Output is correct
45 Correct 5 ms 18780 KB Output is correct
46 Correct 5 ms 18780 KB Output is correct
47 Correct 5 ms 18948 KB Output is correct
48 Correct 6 ms 18880 KB Output is correct
49 Correct 5 ms 18776 KB Output is correct
50 Correct 5 ms 18960 KB Output is correct
51 Correct 5 ms 18780 KB Output is correct
52 Correct 5 ms 18780 KB Output is correct
53 Correct 5 ms 18780 KB Output is correct
54 Correct 5 ms 18776 KB Output is correct
55 Correct 4 ms 18776 KB Output is correct
56 Correct 5 ms 19200 KB Output is correct
57 Correct 89 ms 25276 KB Output is correct
58 Correct 153 ms 25264 KB Output is correct
59 Correct 88 ms 25124 KB Output is correct
60 Correct 80 ms 25132 KB Output is correct
61 Correct 85 ms 24972 KB Output is correct
62 Correct 72 ms 24916 KB Output is correct
63 Correct 70 ms 24620 KB Output is correct
64 Correct 65 ms 24532 KB Output is correct
65 Correct 67 ms 24696 KB Output is correct
66 Correct 76 ms 24656 KB Output is correct
67 Correct 101 ms 25168 KB Output is correct
68 Correct 79 ms 24980 KB Output is correct
69 Correct 88 ms 25296 KB Output is correct
70 Correct 113 ms 24968 KB Output is correct
71 Correct 6 ms 19032 KB Output is correct
72 Correct 6 ms 19152 KB Output is correct
73 Correct 7 ms 19036 KB Output is correct
74 Correct 8 ms 19036 KB Output is correct
75 Correct 7 ms 19032 KB Output is correct
76 Correct 6 ms 19036 KB Output is correct
77 Correct 6 ms 19036 KB Output is correct
78 Correct 7 ms 19036 KB Output is correct
79 Correct 6 ms 19032 KB Output is correct
80 Correct 78 ms 25332 KB Output is correct
81 Correct 80 ms 25000 KB Output is correct
82 Correct 78 ms 24908 KB Output is correct
83 Correct 86 ms 24688 KB Output is correct
84 Correct 6 ms 19036 KB Output is correct
85 Correct 5 ms 19084 KB Output is correct
86 Correct 6 ms 19032 KB Output is correct
87 Correct 6 ms 19036 KB Output is correct
88 Correct 5 ms 19032 KB Output is correct
89 Correct 6 ms 19036 KB Output is correct
90 Correct 5 ms 19032 KB Output is correct
91 Correct 7 ms 19124 KB Output is correct
92 Correct 5 ms 19036 KB Output is correct
93 Correct 6 ms 19036 KB Output is correct
94 Correct 5 ms 18780 KB Output is correct
95 Correct 4 ms 18776 KB Output is correct
96 Correct 4 ms 18776 KB Output is correct
97 Correct 5 ms 18780 KB Output is correct
98 Correct 4 ms 18784 KB Output is correct
99 Correct 4 ms 18780 KB Output is correct
100 Correct 4 ms 18780 KB Output is correct
101 Correct 4 ms 18776 KB Output is correct
102 Correct 4 ms 18780 KB Output is correct
103 Correct 4 ms 18780 KB Output is correct
104 Correct 14 ms 20388 KB Output is correct
105 Correct 20 ms 23000 KB Output is correct
106 Correct 5 ms 18776 KB Output is correct
107 Correct 40 ms 25016 KB Output is correct
108 Correct 43 ms 27340 KB Output is correct
109 Correct 5 ms 19036 KB Output is correct
110 Correct 67 ms 29712 KB Output is correct
111 Correct 107 ms 33220 KB Output is correct
112 Correct 5 ms 19036 KB Output is correct
113 Correct 110 ms 38408 KB Output is correct
114 Incorrect 15 ms 20828 KB Output isn't correct
115 Halted 0 ms 0 KB -