oj.uz

Submission #962333

# Submission time Handle Problem Language Result Execution time Memory
962333 2024-04-13T10:44:43 Z n3rm1n Dreaming (IOI13_dreaming) C++17
47 / 100
 888 ms 18748 KB 
#include<bits/stdc++.h>
#include "dreaming.h"
using namespace std;
const int MAXN = 1e5 + 10;
vector < pair < int, int > > g[MAXN];
int mark[MAXN];
int used[MAXN];
void dfs0(int beg)
{
    mark[beg] = 1;
    used[beg] = 1;
    int nb;
    for (int i = 0; i < g[beg].size(); ++ i)
    {
        nb = g[beg][i].first;
        if(!used[nb])
            dfs0(nb);
    }
}
int 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);
    }
}
int maxdist = 0;
int dfs(int beg)
{
    used[beg] = 1;
    int nb, distt;
    int maxx = 0;
    for (int 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 < int, int >  > path;
int st, fi;
int marked[MAXN];
int dfs_form(int beg, int add)
{
    marked[beg] = 1;
    used[beg] = 1;
    if(beg == fi)
    {
        path.push_back(make_pair(beg, add));
        return 1;
    }
    int nb, distt;
    int found = 0;
    for (int 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;
}

int travelTime(int N, int M, int L, int A[], int B[], int T[])
{
    for (int 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]));
    }

    int n = N;

    vector < pair < int/*diam*/, int > > pq;
    for (int i = 0; i < n; ++ i)
    {
        if(marked[i])continue;
        int aa1 = 0, bb1 = 0;
        int aa2 = 0, bb2 = 0;
        memset(used, 0, sizeof(used));
        far = 0;
        far_index = 0;
        dfs_diam(i, 0);
        aa1 = far_index;
        memset(used, 0, sizeof(used));
        far = 0;
        far_index = 0;
        dfs_diam(aa1, 0);
        bb1 = far_index;

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

        int index1 = path[0].first;
        int total1 = path[0].second;
        int best1 = total1, curr;
        for (int i = 1; i < path.size(); ++ i)
        {
            curr = max(path[i].second, total1 - path[i].second);
            if(curr < best1)
            {
                best1 = curr;
                index1 = path[i].first;
            }
        }

        pq.push_back(make_pair(best1, index1));
       // cout << "component " << best1 << "  " << index1 << endl;
    }
    sort(pq.begin(), pq.end());

    int sz = pq.size();
    int diam1, ii1;
    int diam2, ii2;
    int neww;
    for (int i = 0; i < pq.size()-1; ++ i)
    {
        diam1 = pq[i].first;
        ii1 = pq[i].second;

        diam2 = pq[i+1].first;
        ii2 = pq[i+1].second;



        neww = max(max(diam1, diam2), min(diam1, diam2) + L);
        g[ii1].push_back(make_pair(ii2, L));
        g[ii2].push_back(make_pair(ii1, L));
        if(diam1 > diam2)pq[i+1] = make_pair(neww, ii1);
        else pq[i+1] = make_pair(neww, ii2);

    }


        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));
    return dfs(aa1);

    ///

}

Compilation message

dreaming.cpp: In function 'void dfs0(int)':
dreaming.cpp:13:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for (int 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<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for (int i = 0; i < g[beg].size(); ++ i)
      |                     ~~^~~~~~~~~~~~~~~
dreaming.cpp: In function 'int dfs(int)':
dreaming.cpp:43:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     for (int i = 0; i < g[beg].size(); ++ i)
      |                     ~~^~~~~~~~~~~~~~~
dreaming.cpp: In function 'int dfs_form(int, int)':
dreaming.cpp:65:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |     for (int i = 0; i < g[beg].size(); ++ i)
      |                     ~~^~~~~~~~~~~~~~~
dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:114:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |         for (int i = 1; i < path.size(); ++ i)
      |                         ~~^~~~~~~~~~~~~
dreaming.cpp:93:13: warning: unused variable 'aa2' [-Wunused-variable]
   93 |         int aa2 = 0, bb2 = 0;
      |             ^~~
dreaming.cpp:93:22: warning: unused variable 'bb2' [-Wunused-variable]
   93 |         int aa2 = 0, bb2 = 0;
      |                      ^~~
dreaming.cpp:133:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  133 |     for (int i = 0; i < pq.size()-1; ++ i)
      |                     ~~^~~~~~~~~~~~~
dreaming.cpp:129:9: warning: unused variable 'sz' [-Wunused-variable]
  129 |     int sz = pq.size();
      |         ^~
dreaming.cpp:152:22: warning: unused variable 'bb1' [-Wunused-variable]
  152 |         int aa1 = 0, bb1 = 0;
      |                      ^~~
dreaming.cpp:153:13: warning: unused variable 'aa2' [-Wunused-variable]
  153 |         int aa2 = 0, bb2 = 0;
      |             ^~~
dreaming.cpp:153:22: warning: unused variable 'bb2' [-Wunused-variable]
  153 |         int aa2 = 0, bb2 = 0;
      |                      ^~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 17668 KB Output is correct
2 Correct 47 ms 17612 KB Output is correct
3 Correct 34 ms 13004 KB Output is correct
4 Correct 8 ms 6904 KB Output is correct
5 Correct 6 ms 5720 KB Output is correct
6 Correct 12 ms 7772 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 22 ms 8924 KB Output is correct
9 Correct 28 ms 10972 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 50 ms 12256 KB Output is correct
12 Correct 48 ms 15060 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 17668 KB Output is correct
2 Correct 47 ms 17612 KB Output is correct
3 Correct 34 ms 13004 KB Output is correct
4 Correct 8 ms 6904 KB Output is correct
5 Correct 6 ms 5720 KB Output is correct
6 Correct 12 ms 7772 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 22 ms 8924 KB Output is correct
9 Correct 28 ms 10972 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 50 ms 12256 KB Output is correct
12 Correct 48 ms 15060 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4952 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 1 ms 4956 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 1 ms 4956 KB Output is correct
20 Correct 1 ms 4956 KB Output is correct
21 Correct 1 ms 4956 KB Output is correct
22 Correct 1 ms 4744 KB Output is correct
23 Correct 1 ms 4784 KB Output is correct
24 Correct 1 ms 4952 KB Output is correct
25 Correct 1 ms 4956 KB Output is correct
26 Correct 1 ms 4956 KB Output is correct
27 Correct 1 ms 4956 KB Output is correct
28 Correct 1 ms 4956 KB Output is correct
29 Correct 1 ms 4732 KB Output is correct
30 Correct 2 ms 4952 KB Output is correct
31 Correct 1 ms 4956 KB Output is correct
32 Correct 1 ms 4956 KB Output is correct
33 Correct 1 ms 4956 KB Output is correct
34 Correct 1 ms 4956 KB Output is correct
35 Correct 1 ms 5208 KB Output is correct
36 Correct 1 ms 4952 KB Output is correct
37 Correct 1 ms 4956 KB Output is correct
38 Correct 1 ms 4956 KB Output is correct
39 Correct 47 ms 17628 KB Output is correct
40 Correct 43 ms 17536 KB Output is correct
41 Correct 29 ms 13016 KB Output is correct
42 Correct 8 ms 6748 KB Output is correct
43 Correct 1 ms 4956 KB Output is correct
44 Correct 1 ms 4956 KB Output is correct
45 Correct 1 ms 4956 KB Output is correct
46 Correct 1 ms 4956 KB Output is correct
47 Correct 1 ms 4956 KB Output is correct
48 Correct 1 ms 4956 KB Output is correct
49 Correct 2 ms 4956 KB Output is correct
50 Correct 1 ms 4956 KB Output is correct
51 Correct 2 ms 4956 KB Output is correct
52 Correct 1 ms 4956 KB Output is correct
53 Correct 1 ms 4956 KB Output is correct
54 Correct 1 ms 4956 KB Output is correct
55 Correct 1 ms 4956 KB Output is correct
56 Correct 2 ms 4860 KB Output is correct
57 Correct 48 ms 9052 KB Output is correct
58 Correct 50 ms 9304 KB Output is correct
59 Correct 51 ms 8960 KB Output is correct
60 Correct 54 ms 8964 KB Output is correct
61 Correct 50 ms 8976 KB Output is correct
62 Correct 60 ms 8788 KB Output is correct
63 Correct 49 ms 8796 KB Output is correct
64 Correct 48 ms 8796 KB Output is correct
65 Correct 45 ms 8796 KB Output is correct
66 Correct 47 ms 8796 KB Output is correct
67 Correct 52 ms 9084 KB Output is correct
68 Correct 50 ms 9040 KB Output is correct
69 Correct 52 ms 9160 KB Output is correct
70 Correct 52 ms 9096 KB Output is correct
71 Correct 1 ms 4956 KB Output is correct
72 Correct 2 ms 4956 KB Output is correct
73 Correct 2 ms 4956 KB Output is correct
74 Correct 2 ms 4956 KB Output is correct
75 Correct 2 ms 4956 KB Output is correct
76 Correct 2 ms 4956 KB Output is correct
77 Correct 2 ms 4956 KB Output is correct
78 Correct 2 ms 4956 KB Output is correct
79 Correct 3 ms 5000 KB Output is correct
80 Correct 52 ms 9040 KB Output is correct
81 Correct 57 ms 9064 KB Output is correct
82 Correct 48 ms 8788 KB Output is correct
83 Correct 49 ms 8772 KB Output is correct
84 Correct 2 ms 4956 KB Output is correct
85 Correct 2 ms 4956 KB Output is correct
86 Correct 3 ms 4956 KB Output is correct
87 Correct 2 ms 4952 KB Output is correct
88 Correct 2 ms 4956 KB Output is correct
89 Correct 2 ms 4956 KB Output is correct
90 Correct 3 ms 4956 KB Output is correct
91 Correct 3 ms 4956 KB Output is correct
92 Correct 2 ms 4952 KB Output is correct
93 Correct 2 ms 4952 KB Output is correct
94 Correct 1 ms 4956 KB Output is correct
95 Correct 1 ms 4956 KB Output is correct
96 Correct 1 ms 4956 KB Output is correct
97 Correct 1 ms 4956 KB Output is correct
98 Correct 1 ms 4956 KB Output is correct
99 Correct 1 ms 4956 KB Output is correct
100 Correct 1 ms 4956 KB Output is correct
101 Correct 1 ms 4956 KB Output is correct
102 Correct 1 ms 4972 KB Output is correct
103 Correct 1 ms 4956 KB Output is correct
104 Correct 6 ms 5720 KB Output is correct
105 Correct 14 ms 7772 KB Output is correct
106 Correct 1 ms 5152 KB Output is correct
107 Correct 21 ms 8920 KB Output is correct
108 Correct 28 ms 10968 KB Output is correct
109 Correct 1 ms 4956 KB Output is correct
110 Correct 40 ms 12340 KB Output is correct
111 Correct 53 ms 15068 KB Output is correct
112 Correct 1 ms 4956 KB Output is correct
113 Correct 62 ms 18748 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 888 ms 9428 KB Output is correct
2 Incorrect 869 ms 9248 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 1 ms 4956 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4744 KB Output is correct
10 Correct 1 ms 4784 KB Output is correct
11 Correct 1 ms 4952 KB Output is correct
12 Correct 1 ms 4956 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4732 KB Output is correct
17 Correct 2 ms 4952 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 1 ms 4956 KB Output is correct
20 Correct 1 ms 4956 KB Output is correct
21 Correct 1 ms 4956 KB Output is correct
22 Correct 1 ms 5208 KB Output is correct
23 Correct 1 ms 4952 KB Output is correct
24 Correct 1 ms 4956 KB Output is correct
25 Correct 1 ms 4956 KB Output is correct
26 Correct 4 ms 4956 KB Output is correct
27 Correct 6 ms 5036 KB Output is correct
28 Correct 10 ms 5076 KB Output is correct
29 Correct 4 ms 4952 KB Output is correct
30 Correct 6 ms 4956 KB Output is correct
31 Correct 8 ms 4952 KB Output is correct
32 Incorrect 3 ms 5208 KB Output isn't correct
33 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 17668 KB Output is correct
2 Correct 47 ms 17612 KB Output is correct
3 Correct 34 ms 13004 KB Output is correct
4 Correct 8 ms 6904 KB Output is correct
5 Correct 6 ms 5720 KB Output is correct
6 Correct 12 ms 7772 KB Output is correct
7 Correct 1 ms 4956 KB Output is correct
8 Correct 22 ms 8924 KB Output is correct
9 Correct 28 ms 10972 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 50 ms 12256 KB Output is correct
12 Correct 48 ms 15060 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4952 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 1 ms 4956 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 1 ms 4956 KB Output is correct
20 Correct 1 ms 4956 KB Output is correct
21 Correct 1 ms 4956 KB Output is correct
22 Correct 1 ms 4744 KB Output is correct
23 Correct 1 ms 4784 KB Output is correct
24 Correct 1 ms 4952 KB Output is correct
25 Correct 1 ms 4956 KB Output is correct
26 Correct 1 ms 4956 KB Output is correct
27 Correct 1 ms 4956 KB Output is correct
28 Correct 1 ms 4956 KB Output is correct
29 Correct 1 ms 4732 KB Output is correct
30 Correct 2 ms 4952 KB Output is correct
31 Correct 1 ms 4956 KB Output is correct
32 Correct 1 ms 4956 KB Output is correct
33 Correct 1 ms 4956 KB Output is correct
34 Correct 1 ms 4956 KB Output is correct
35 Correct 1 ms 5208 KB Output is correct
36 Correct 1 ms 4952 KB Output is correct
37 Correct 1 ms 4956 KB Output is correct
38 Correct 1 ms 4956 KB Output is correct
39 Correct 47 ms 17628 KB Output is correct
40 Correct 43 ms 17536 KB Output is correct
41 Correct 29 ms 13016 KB Output is correct
42 Correct 8 ms 6748 KB Output is correct
43 Correct 1 ms 4956 KB Output is correct
44 Correct 1 ms 4956 KB Output is correct
45 Correct 1 ms 4956 KB Output is correct
46 Correct 1 ms 4956 KB Output is correct
47 Correct 1 ms 4956 KB Output is correct
48 Correct 1 ms 4956 KB Output is correct
49 Correct 2 ms 4956 KB Output is correct
50 Correct 1 ms 4956 KB Output is correct
51 Correct 2 ms 4956 KB Output is correct
52 Correct 1 ms 4956 KB Output is correct
53 Correct 1 ms 4956 KB Output is correct
54 Correct 1 ms 4956 KB Output is correct
55 Correct 1 ms 4956 KB Output is correct
56 Correct 2 ms 4860 KB Output is correct
57 Correct 48 ms 9052 KB Output is correct
58 Correct 50 ms 9304 KB Output is correct
59 Correct 51 ms 8960 KB Output is correct
60 Correct 54 ms 8964 KB Output is correct
61 Correct 50 ms 8976 KB Output is correct
62 Correct 60 ms 8788 KB Output is correct
63 Correct 49 ms 8796 KB Output is correct
64 Correct 48 ms 8796 KB Output is correct
65 Correct 45 ms 8796 KB Output is correct
66 Correct 47 ms 8796 KB Output is correct
67 Correct 52 ms 9084 KB Output is correct
68 Correct 50 ms 9040 KB Output is correct
69 Correct 52 ms 9160 KB Output is correct
70 Correct 52 ms 9096 KB Output is correct
71 Correct 1 ms 4956 KB Output is correct
72 Correct 2 ms 4956 KB Output is correct
73 Correct 2 ms 4956 KB Output is correct
74 Correct 2 ms 4956 KB Output is correct
75 Correct 2 ms 4956 KB Output is correct
76 Correct 2 ms 4956 KB Output is correct
77 Correct 2 ms 4956 KB Output is correct
78 Correct 2 ms 4956 KB Output is correct
79 Correct 3 ms 5000 KB Output is correct
80 Correct 52 ms 9040 KB Output is correct
81 Correct 57 ms 9064 KB Output is correct
82 Correct 48 ms 8788 KB Output is correct
83 Correct 49 ms 8772 KB Output is correct
84 Correct 2 ms 4956 KB Output is correct
85 Correct 2 ms 4956 KB Output is correct
86 Correct 3 ms 4956 KB Output is correct
87 Correct 2 ms 4952 KB Output is correct
88 Correct 2 ms 4956 KB Output is correct
89 Correct 2 ms 4956 KB Output is correct
90 Correct 3 ms 4956 KB Output is correct
91 Correct 3 ms 4956 KB Output is correct
92 Correct 2 ms 4952 KB Output is correct
93 Correct 2 ms 4952 KB Output is correct
94 Correct 1 ms 4956 KB Output is correct
95 Correct 1 ms 4956 KB Output is correct
96 Correct 1 ms 4956 KB Output is correct
97 Correct 1 ms 4956 KB Output is correct
98 Correct 1 ms 4956 KB Output is correct
99 Correct 1 ms 4956 KB Output is correct
100 Correct 1 ms 4956 KB Output is correct
101 Correct 1 ms 4956 KB Output is correct
102 Correct 1 ms 4972 KB Output is correct
103 Correct 1 ms 4956 KB Output is correct
104 Correct 6 ms 5720 KB Output is correct
105 Correct 14 ms 7772 KB Output is correct
106 Correct 1 ms 5152 KB Output is correct
107 Correct 21 ms 8920 KB Output is correct
108 Correct 28 ms 10968 KB Output is correct
109 Correct 1 ms 4956 KB Output is correct
110 Correct 40 ms 12340 KB Output is correct
111 Correct 53 ms 15068 KB Output is correct
112 Correct 1 ms 4956 KB Output is correct
113 Correct 62 ms 18748 KB Output is correct
114 Correct 888 ms 9428 KB Output is correct
115 Incorrect 869 ms 9248 KB Output isn't correct
116 Halted 0 ms 0 KB -