oj.uz

Submission #917919

# Submission time Handle Problem Language Result Execution time Memory
917919 2024-01-29T05:25:31 Z Juanchoki Dreaming (IOI13_dreaming) C++14
47 / 100
 212 ms 31976 KB 
#include"dreaming.h"
#include <bits/stdc++.h>
using namespace std;
struct edge
{
    int u, w;
};
struct tpos
{
    int nodo, dist, padre;
};
vector<vector<edge>> adj;
pair<int, int> bfs (int nodo, int N)
{
  //  cout << "nodo: " << nodo << '\n';
        pair<int, int> ret;
        ret.second = -1;
        queue<tpos> q; 
        q.push({nodo, 0, -1});
        tpos temp_tpos;
        vector<bool> visi(N);
        while (!q.empty())
        {
            temp_tpos = q.front(); q.pop();
            visi[temp_tpos.nodo] = 1;
            //cout << "    " << temp_tpos.nodo <<  " " << temp_tpos.dist << "\n";
            for (edge e: adj[temp_tpos.nodo])
            {
           //     cout << temp_tpos.nodo << " vecinos: " << e.u << '\n';
                if (visi[e.u]) continue;
                q.push({e.u, temp_tpos.dist+e.w, temp_tpos.nodo}); 
            }
            if (temp_tpos.dist > ret.second)
            {
                ret.second = temp_tpos.dist;
                ret.first = temp_tpos.nodo;
            }
        }
    //cout << '\n';
    return ret;
}
int Diametro (int N)
{
    int ve = bfs(0, N).first;
    return bfs(ve, N).second;
}
struct dsu
{
    struct componente
    {
        int representante;
        int inicio_diametro, fin_diametro;
        int punto_medio, distancia_punto_medio;
        vector <int> miembros;
        int diametro;
        map<int, int> distancia_diametro1, distancia_diametro2;
        void BFS (int nodo)
        {
            queue<tpos> q; 
            q.push({nodo, 0, -1});
            tpos temp_tpos;
            while (!q.empty())
            {
                temp_tpos = q.front(); q.pop();
                distancia_diametro2[temp_tpos.nodo] = temp_tpos.dist;
                for (edge e: adj[temp_tpos.nodo])
                {
                    if (e.u == temp_tpos.padre) continue;
                    q.push({e.u, temp_tpos.dist+e.w, temp_tpos.nodo}); 
                }
            }
        }

        pair<int, int> other_bfs (int nodo, bool pasada)
        {
            pair<int, int> ret;
            ret.second = -1;
            queue<tpos> q; 
            q.push({nodo, 0, -1});
            tpos temp_tpos;
            while (!q.empty())
            {
                temp_tpos = q.front(); q.pop();
                if (pasada)
                    distancia_diametro1[temp_tpos.nodo] = temp_tpos.dist;
                
                for (edge e: adj[temp_tpos.nodo])
                {
                    if (e.u == temp_tpos.padre) continue;
                    q.push({e.u, temp_tpos.dist+e.w, temp_tpos.nodo}); 
                }
                if (temp_tpos.dist > ret.second)
                {
                    ret.second = temp_tpos.dist;
                    ret.first = temp_tpos.nodo;
                }
            }
            return ret;
        }

        void get_punto_medio ()
        {
            int mini = 1<<30;
            BFS(fin_diametro);
            for (int i = 0; i < miembros.size(); i++)
            {
                int temp_dist = distancia_diametro1[miembros[i]];
              //  cout << miembros[i] << " -> " << temp_dist << '\n';
                int temp_longlong = max(temp_dist, distancia_diametro2[miembros[i]]);
                if (mini > temp_longlong)
                {
                    mini = temp_longlong;
                    punto_medio = miembros[i];
                }
                distancia_punto_medio = mini;
            }
        }

        void get_diametro()
        {   
            if (miembros.size() > 1)  
            {
                int resp = other_bfs(representante, 0).first;
                inicio_diametro = resp;
                pair<int, int> temp_pair = other_bfs(resp, 1);
                fin_diametro = temp_pair.first;
                diametro = temp_pair.second;            
            }
            else
            {   
                diametro = 0;
                distancia_diametro1[miembros[0]] = 0;
                distancia_diametro2[miembros[0]] = 0;
                inicio_diametro = miembros[0];
                fin_diametro = miembros[0];
            } 
       //     cout << representante << ": \n";
            get_punto_medio();
        }
    };

    int N;
    vector<int>parent;
    vector<componente> arboles;
    vector<vector<int>> miembros_de_componente;
    dsu(int n)
    {
        parent.resize(n);
        N = n;
        miembros_de_componente.resize(n);
        for (int i = 0; i < N; i++)
            parent[i] = i;
    }
    void une (int a, int b) 
    {
        parent[busca(a)] = busca(b);
    }
    int busca (int a)
    {
        if (parent[a] == a) return a;
        return (parent[a] = busca(parent[a]));
    }
    void crea_componentes()
    {
        for (int i = 0; i < N; i++)
            miembros_de_componente[busca(i)].push_back(i);

        for (int i = 0; i < N; i++)
        {
            if (miembros_de_componente[i].empty()) continue;
            componente comp_temp;
            comp_temp.representante = i;
            comp_temp.miembros = miembros_de_componente[i];
            arboles.push_back(comp_temp);
            arboles.back().get_diametro();
            //cout << '\n';
        }
        
    }
};

int travelTime(int N, int M, int L, int A[], int B[], int T[]) 
{
  //  cout << '\n';
    adj.resize(N);
    edge temp_edge;
    dsu bosque(N);
    for (int i = 0; i < M; i++)
    {
        temp_edge.u = B[i];
        temp_edge.w = T[i];
        adj[A[i]].push_back(temp_edge);
        temp_edge.u = A[i];
        adj[B[i]].push_back(temp_edge);
        bosque.une(A[i], B[i]);
    }
    bosque.crea_componentes();
    int temp_mid_pnt;
    int cnt = 1;
    vector<int> mid_points;
    for (dsu::componente c: bosque.arboles)
        mid_points.push_back(c.punto_medio);
    
 //   cout << '\n';
    
    for (int i = 1; i < mid_points.size(); i++)
    {
        edge temp_edge; 
        temp_edge.u = mid_points[i-1];
        temp_edge.w = L;
        adj[mid_points[i]].push_back(temp_edge);
        temp_edge.u = mid_points[i];
        adj[mid_points[i-1]].push_back(temp_edge);
    }

  /*  for (int i = 0; i < N; i++)
    {
        cout << i << ": ";
        for (edge e: adj[i])    
            cout << e.u << " ";
        cout << '\n';
    }
    */
    return Diametro(N);
}

Compilation message

dreaming.cpp: In member function 'void dsu::componente::get_punto_medio()':
dreaming.cpp:105:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  105 |             for (int i = 0; i < miembros.size(); i++)
      |                             ~~^~~~~~~~~~~~~~~~~
dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:206:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  206 |     for (int i = 1; i < mid_points.size(); i++)
      |                     ~~^~~~~~~~~~~~~~~~~~~
dreaming.cpp:198:9: warning: unused variable 'temp_mid_pnt' [-Wunused-variable]
  198 |     int temp_mid_pnt;
      |         ^~~~~~~~~~~~
dreaming.cpp:199:9: warning: unused variable 'cnt' [-Wunused-variable]
  199 |     int cnt = 1;
      |         ^~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 27420 KB Output is correct
2 Correct 150 ms 27632 KB Output is correct
3 Correct 78 ms 17984 KB Output is correct
4 Correct 15 ms 4444 KB Output is correct
5 Correct 11 ms 2924 KB Output is correct
6 Correct 25 ms 6236 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 54 ms 10584 KB Output is correct
9 Correct 76 ms 14060 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 120 ms 18636 KB Output is correct
12 Correct 145 ms 22784 KB Output is correct
13 Correct 1 ms 600 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 27420 KB Output is correct
2 Correct 150 ms 27632 KB Output is correct
3 Correct 78 ms 17984 KB Output is correct
4 Correct 15 ms 4444 KB Output is correct
5 Correct 11 ms 2924 KB Output is correct
6 Correct 25 ms 6236 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 54 ms 10584 KB Output is correct
9 Correct 76 ms 14060 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 120 ms 18636 KB Output is correct
12 Correct 145 ms 22784 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 420 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 548 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 500 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 174 ms 28844 KB Output is correct
40 Correct 158 ms 28776 KB Output is correct
41 Correct 99 ms 18920 KB Output is correct
42 Correct 15 ms 4444 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 1 ms 600 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 177 ms 31336 KB Output is correct
58 Correct 189 ms 27412 KB Output is correct
59 Correct 161 ms 30324 KB Output is correct
60 Correct 192 ms 26880 KB Output is correct
61 Correct 173 ms 30608 KB Output is correct
62 Correct 171 ms 28380 KB Output is correct
63 Correct 174 ms 31472 KB Output is correct
64 Correct 173 ms 31564 KB Output is correct
65 Correct 162 ms 31976 KB Output is correct
66 Correct 173 ms 31816 KB Output is correct
67 Correct 170 ms 30752 KB Output is correct
68 Correct 212 ms 30420 KB Output is correct
69 Correct 156 ms 27844 KB Output is correct
70 Correct 198 ms 27976 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 4 ms 1224 KB Output is correct
73 Correct 4 ms 1112 KB Output is correct
74 Correct 4 ms 1372 KB Output is correct
75 Correct 3 ms 1116 KB Output is correct
76 Correct 3 ms 1116 KB Output is correct
77 Correct 3 ms 1224 KB Output is correct
78 Correct 3 ms 1116 KB Output is correct
79 Correct 3 ms 1116 KB Output is correct
80 Correct 192 ms 28596 KB Output is correct
81 Correct 158 ms 28636 KB Output is correct
82 Correct 185 ms 30616 KB Output is correct
83 Correct 168 ms 31752 KB Output is correct
84 Correct 3 ms 860 KB Output is correct
85 Correct 2 ms 1000 KB Output is correct
86 Correct 3 ms 860 KB Output is correct
87 Correct 3 ms 904 KB Output is correct
88 Correct 3 ms 1116 KB Output is correct
89 Correct 3 ms 1116 KB Output is correct
90 Correct 3 ms 1116 KB Output is correct
91 Correct 4 ms 1320 KB Output is correct
92 Correct 3 ms 1112 KB Output is correct
93 Correct 3 ms 1116 KB Output is correct
94 Correct 1 ms 348 KB Output is correct
95 Correct 1 ms 344 KB Output is correct
96 Correct 1 ms 348 KB Output is correct
97 Correct 1 ms 344 KB Output is correct
98 Correct 0 ms 348 KB Output is correct
99 Correct 1 ms 348 KB Output is correct
100 Correct 1 ms 348 KB Output is correct
101 Correct 1 ms 348 KB Output is correct
102 Correct 1 ms 348 KB Output is correct
103 Correct 1 ms 348 KB Output is correct
104 Correct 11 ms 2896 KB Output is correct
105 Correct 25 ms 6560 KB Output is correct
106 Correct 1 ms 348 KB Output is correct
107 Correct 48 ms 11192 KB Output is correct
108 Correct 74 ms 14780 KB Output is correct
109 Correct 1 ms 604 KB Output is correct
110 Correct 108 ms 19968 KB Output is correct
111 Correct 119 ms 23800 KB Output is correct
112 Correct 1 ms 604 KB Output is correct
113 Correct 168 ms 31280 KB Output is correct

Subtask #4
0 / 18.0

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

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 420 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 548 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 500 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Incorrect 1 ms 604 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 27420 KB Output is correct
2 Correct 150 ms 27632 KB Output is correct
3 Correct 78 ms 17984 KB Output is correct
4 Correct 15 ms 4444 KB Output is correct
5 Correct 11 ms 2924 KB Output is correct
6 Correct 25 ms 6236 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 54 ms 10584 KB Output is correct
9 Correct 76 ms 14060 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 120 ms 18636 KB Output is correct
12 Correct 145 ms 22784 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 420 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 548 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 500 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 174 ms 28844 KB Output is correct
40 Correct 158 ms 28776 KB Output is correct
41 Correct 99 ms 18920 KB Output is correct
42 Correct 15 ms 4444 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 1 ms 600 KB Output is correct
46 Correct 1 ms 344 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 177 ms 31336 KB Output is correct
58 Correct 189 ms 27412 KB Output is correct
59 Correct 161 ms 30324 KB Output is correct
60 Correct 192 ms 26880 KB Output is correct
61 Correct 173 ms 30608 KB Output is correct
62 Correct 171 ms 28380 KB Output is correct
63 Correct 174 ms 31472 KB Output is correct
64 Correct 173 ms 31564 KB Output is correct
65 Correct 162 ms 31976 KB Output is correct
66 Correct 173 ms 31816 KB Output is correct
67 Correct 170 ms 30752 KB Output is correct
68 Correct 212 ms 30420 KB Output is correct
69 Correct 156 ms 27844 KB Output is correct
70 Correct 198 ms 27976 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 4 ms 1224 KB Output is correct
73 Correct 4 ms 1112 KB Output is correct
74 Correct 4 ms 1372 KB Output is correct
75 Correct 3 ms 1116 KB Output is correct
76 Correct 3 ms 1116 KB Output is correct
77 Correct 3 ms 1224 KB Output is correct
78 Correct 3 ms 1116 KB Output is correct
79 Correct 3 ms 1116 KB Output is correct
80 Correct 192 ms 28596 KB Output is correct
81 Correct 158 ms 28636 KB Output is correct
82 Correct 185 ms 30616 KB Output is correct
83 Correct 168 ms 31752 KB Output is correct
84 Correct 3 ms 860 KB Output is correct
85 Correct 2 ms 1000 KB Output is correct
86 Correct 3 ms 860 KB Output is correct
87 Correct 3 ms 904 KB Output is correct
88 Correct 3 ms 1116 KB Output is correct
89 Correct 3 ms 1116 KB Output is correct
90 Correct 3 ms 1116 KB Output is correct
91 Correct 4 ms 1320 KB Output is correct
92 Correct 3 ms 1112 KB Output is correct
93 Correct 3 ms 1116 KB Output is correct
94 Correct 1 ms 348 KB Output is correct
95 Correct 1 ms 344 KB Output is correct
96 Correct 1 ms 348 KB Output is correct
97 Correct 1 ms 344 KB Output is correct
98 Correct 0 ms 348 KB Output is correct
99 Correct 1 ms 348 KB Output is correct
100 Correct 1 ms 348 KB Output is correct
101 Correct 1 ms 348 KB Output is correct
102 Correct 1 ms 348 KB Output is correct
103 Correct 1 ms 348 KB Output is correct
104 Correct 11 ms 2896 KB Output is correct
105 Correct 25 ms 6560 KB Output is correct
106 Correct 1 ms 348 KB Output is correct
107 Correct 48 ms 11192 KB Output is correct
108 Correct 74 ms 14780 KB Output is correct
109 Correct 1 ms 604 KB Output is correct
110 Correct 108 ms 19968 KB Output is correct
111 Correct 119 ms 23800 KB Output is correct
112 Correct 1 ms 604 KB Output is correct
113 Correct 168 ms 31280 KB Output is correct
114 Incorrect 81 ms 31184 KB Output isn't correct
115 Halted 0 ms 0 KB -