oj.uz

답안 #920080

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
920080 2024-02-02T03:30:50 Z Juanchoki 꿈 (IOI13_dreaming) C++14
47 / 100
 187 ms 51396 KB 
#include"dreaming.h"
#include <bits/stdc++.h>
using namespace std;
struct edge
{
    int u, w;
};
struct tpos
{
    int nodo, dist, padre;
};
int max_tam;
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});
            vector<bool> visi(max_tam);
            
            tpos temp_tpos;
            while (!q.empty())
            {
                temp_tpos = q.front(); q.pop();
                visi[temp_tpos.nodo] = 1;
                distancia_diametro2[temp_tpos.nodo] = temp_tpos.dist;
                for (edge e: adj[temp_tpos.nodo])
                {
                    if (visi[e.u]) 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});
            vector<bool> visi(max_tam);
            tpos temp_tpos;
            while (!q.empty())
            {
                temp_tpos = q.front(); q.pop();
                 visi[temp_tpos.nodo] = 1;
                if (pasada)
                    distancia_diametro1[temp_tpos.nodo] = temp_tpos.dist;
                
                for (edge e: adj[temp_tpos.nodo])
                {
                    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;
                }
            }
            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()
        {   
                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;            
             
       //     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';
    max_tam = 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<dsu::componente> vector_componentes;
    for (dsu::componente comp: bosque.arboles)
        vector_componentes.push_back(comp);

    for (int i = 1; i < vector_componentes.size(); i++)
    {
        dsu::componente comp = vector_componentes[i], sig = vector_componentes[i-1];
        adj[comp.punto_medio].push_back({sig.punto_medio, L});
        adj[sig.punto_medio].push_back({comp.punto_medio, L});
        bosque.une(comp.punto_medio, sig.punto_medio);
        int temp_int = min (max (comp.distancia_punto_medio+L, sig.distancia_punto_medio+L), max(comp.distancia_punto_medio, sig.distancia_punto_medio+L));
        vector_componentes[i].distancia_punto_medio = temp_int;
        vector_componentes[i].diametro = max (comp.diametro, max (sig.diametro, comp.distancia_punto_medio + sig.distancia_punto_medio + L));
    }
   // bosque.crea_componentes();

    return vector_componentes.back().diametro;
}

Compilation message

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

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 140 ms 37736 KB Output is correct
2 Correct 147 ms 37560 KB Output is correct
3 Correct 96 ms 25056 KB Output is correct
4 Correct 17 ms 5712 KB Output is correct
5 Correct 12 ms 4292 KB Output is correct
6 Correct 27 ms 8528 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 60 ms 16440 KB Output is correct
9 Correct 76 ms 20720 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 108 ms 28824 KB Output is correct
12 Correct 126 ms 32700 KB Output is correct
13 Correct 1 ms 600 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 436 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 548 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 140 ms 37736 KB Output is correct
2 Correct 147 ms 37560 KB Output is correct
3 Correct 96 ms 25056 KB Output is correct
4 Correct 17 ms 5712 KB Output is correct
5 Correct 12 ms 4292 KB Output is correct
6 Correct 27 ms 8528 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 60 ms 16440 KB Output is correct
9 Correct 76 ms 20720 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 108 ms 28824 KB Output is correct
12 Correct 126 ms 32700 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 436 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 548 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 143 ms 37688 KB Output is correct
40 Correct 160 ms 37764 KB Output is correct
41 Correct 86 ms 24804 KB Output is correct
42 Correct 17 ms 5724 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 616 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 174 ms 41560 KB Output is correct
58 Correct 167 ms 41556 KB Output is correct
59 Correct 187 ms 41476 KB Output is correct
60 Correct 166 ms 41372 KB Output is correct
61 Correct 174 ms 41656 KB Output is correct
62 Correct 176 ms 41680 KB Output is correct
63 Correct 167 ms 41288 KB Output is correct
64 Correct 165 ms 41364 KB Output is correct
65 Correct 174 ms 41548 KB Output is correct
66 Correct 169 ms 41596 KB Output is correct
67 Correct 170 ms 41464 KB Output is correct
68 Correct 181 ms 41488 KB Output is correct
69 Correct 166 ms 41700 KB Output is correct
70 Correct 162 ms 41704 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 4 ms 1624 KB Output is correct
73 Correct 4 ms 1624 KB Output is correct
74 Correct 5 ms 1624 KB Output is correct
75 Correct 4 ms 1624 KB Output is correct
76 Correct 4 ms 1624 KB Output is correct
77 Correct 4 ms 1624 KB Output is correct
78 Correct 4 ms 1628 KB Output is correct
79 Correct 4 ms 1624 KB Output is correct
80 Correct 165 ms 41404 KB Output is correct
81 Correct 175 ms 41552 KB Output is correct
82 Correct 183 ms 41656 KB Output is correct
83 Correct 173 ms 41800 KB Output is correct
84 Correct 4 ms 1368 KB Output is correct
85 Correct 3 ms 1116 KB Output is correct
86 Correct 3 ms 1368 KB Output is correct
87 Correct 4 ms 1368 KB Output is correct
88 Correct 4 ms 1368 KB Output is correct
89 Correct 3 ms 1368 KB Output is correct
90 Correct 4 ms 1372 KB Output is correct
91 Correct 4 ms 1624 KB Output is correct
92 Correct 4 ms 1368 KB Output is correct
93 Correct 5 ms 1368 KB Output is correct
94 Correct 0 ms 348 KB Output is correct
95 Correct 1 ms 344 KB Output is correct
96 Correct 1 ms 344 KB Output is correct
97 Correct 1 ms 344 KB Output is correct
98 Correct 0 ms 344 KB Output is correct
99 Correct 1 ms 344 KB Output is correct
100 Correct 0 ms 344 KB Output is correct
101 Correct 1 ms 344 KB Output is correct
102 Correct 1 ms 500 KB Output is correct
103 Correct 1 ms 348 KB Output is correct
104 Correct 12 ms 4440 KB Output is correct
105 Correct 27 ms 8536 KB Output is correct
106 Correct 1 ms 344 KB Output is correct
107 Correct 55 ms 16464 KB Output is correct
108 Correct 74 ms 20684 KB Output is correct
109 Correct 1 ms 444 KB Output is correct
110 Correct 110 ms 28876 KB Output is correct
111 Correct 127 ms 32712 KB Output is correct
112 Correct 1 ms 604 KB Output is correct
113 Correct 168 ms 41084 KB Output is correct

Subtask #4
0 / 18.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 140 ms 37736 KB Output is correct
2 Correct 147 ms 37560 KB Output is correct
3 Correct 96 ms 25056 KB Output is correct
4 Correct 17 ms 5712 KB Output is correct
5 Correct 12 ms 4292 KB Output is correct
6 Correct 27 ms 8528 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 60 ms 16440 KB Output is correct
9 Correct 76 ms 20720 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 108 ms 28824 KB Output is correct
12 Correct 126 ms 32700 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 436 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 548 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 143 ms 37688 KB Output is correct
40 Correct 160 ms 37764 KB Output is correct
41 Correct 86 ms 24804 KB Output is correct
42 Correct 17 ms 5724 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 616 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 1 ms 344 KB Output is correct
51 Correct 1 ms 344 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 174 ms 41560 KB Output is correct
58 Correct 167 ms 41556 KB Output is correct
59 Correct 187 ms 41476 KB Output is correct
60 Correct 166 ms 41372 KB Output is correct
61 Correct 174 ms 41656 KB Output is correct
62 Correct 176 ms 41680 KB Output is correct
63 Correct 167 ms 41288 KB Output is correct
64 Correct 165 ms 41364 KB Output is correct
65 Correct 174 ms 41548 KB Output is correct
66 Correct 169 ms 41596 KB Output is correct
67 Correct 170 ms 41464 KB Output is correct
68 Correct 181 ms 41488 KB Output is correct
69 Correct 166 ms 41700 KB Output is correct
70 Correct 162 ms 41704 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 4 ms 1624 KB Output is correct
73 Correct 4 ms 1624 KB Output is correct
74 Correct 5 ms 1624 KB Output is correct
75 Correct 4 ms 1624 KB Output is correct
76 Correct 4 ms 1624 KB Output is correct
77 Correct 4 ms 1624 KB Output is correct
78 Correct 4 ms 1628 KB Output is correct
79 Correct 4 ms 1624 KB Output is correct
80 Correct 165 ms 41404 KB Output is correct
81 Correct 175 ms 41552 KB Output is correct
82 Correct 183 ms 41656 KB Output is correct
83 Correct 173 ms 41800 KB Output is correct
84 Correct 4 ms 1368 KB Output is correct
85 Correct 3 ms 1116 KB Output is correct
86 Correct 3 ms 1368 KB Output is correct
87 Correct 4 ms 1368 KB Output is correct
88 Correct 4 ms 1368 KB Output is correct
89 Correct 3 ms 1368 KB Output is correct
90 Correct 4 ms 1372 KB Output is correct
91 Correct 4 ms 1624 KB Output is correct
92 Correct 4 ms 1368 KB Output is correct
93 Correct 5 ms 1368 KB Output is correct
94 Correct 0 ms 348 KB Output is correct
95 Correct 1 ms 344 KB Output is correct
96 Correct 1 ms 344 KB Output is correct
97 Correct 1 ms 344 KB Output is correct
98 Correct 0 ms 344 KB Output is correct
99 Correct 1 ms 344 KB Output is correct
100 Correct 0 ms 344 KB Output is correct
101 Correct 1 ms 344 KB Output is correct
102 Correct 1 ms 500 KB Output is correct
103 Correct 1 ms 348 KB Output is correct
104 Correct 12 ms 4440 KB Output is correct
105 Correct 27 ms 8536 KB Output is correct
106 Correct 1 ms 344 KB Output is correct
107 Correct 55 ms 16464 KB Output is correct
108 Correct 74 ms 20684 KB Output is correct
109 Correct 1 ms 444 KB Output is correct
110 Correct 110 ms 28876 KB Output is correct
111 Correct 127 ms 32712 KB Output is correct
112 Correct 1 ms 604 KB Output is correct
113 Correct 168 ms 41084 KB Output is correct
114 Incorrect 141 ms 51396 KB Output isn't correct
115 Halted 0 ms 0 KB -