oj.uz

답안 #917927

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
917927 2024-01-29T05:46:06 Z Juanchoki 꿈 (IOI13_dreaming) C++14
47 / 100
 291 ms 31184 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<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);
        bosque.une(mid_points[i], mid_points[i-1]);
    }
    bosque.arboles.clear();
    for (int i = 0; i < N; i++) 
        bosque.miembros_de_componente[i].clear();

    bosque.crea_componentes();
    
    //cout << bosque.miembros_de_componente[4].size() << "\n";

    
  /*  for (int i = 0; i < N; i++)
    {
        cout << i << ": ";
        for (edge e: adj[i])    
            cout << e.u << " ";
        cout << '\n';
    }
    */
    return bosque.arboles[0].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:205:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  205 |     for (int i = 1; i < mid_points.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 197 ms 27432 KB Output is correct
2 Correct 254 ms 27580 KB Output is correct
3 Correct 117 ms 18148 KB Output is correct
4 Correct 21 ms 4440 KB Output is correct
5 Correct 16 ms 2936 KB Output is correct
6 Correct 35 ms 6228 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 82 ms 10836 KB Output is correct
9 Correct 104 ms 14132 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 174 ms 18736 KB Output is correct
12 Correct 184 ms 22704 KB Output is correct
13 Correct 2 ms 600 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 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 0 ms 348 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

# 결과 실행 시간 메모리 Grader output
1 Correct 197 ms 27432 KB Output is correct
2 Correct 254 ms 27580 KB Output is correct
3 Correct 117 ms 18148 KB Output is correct
4 Correct 21 ms 4440 KB Output is correct
5 Correct 16 ms 2936 KB Output is correct
6 Correct 35 ms 6228 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 82 ms 10836 KB Output is correct
9 Correct 104 ms 14132 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 174 ms 18736 KB Output is correct
12 Correct 184 ms 22704 KB Output is correct
13 Correct 2 ms 600 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 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 0 ms 348 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 195 ms 27404 KB Output is correct
40 Correct 207 ms 27476 KB Output is correct
41 Correct 124 ms 17932 KB Output is correct
42 Correct 21 ms 4440 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 229 ms 30040 KB Output is correct
58 Correct 220 ms 26168 KB Output is correct
59 Correct 229 ms 29044 KB Output is correct
60 Correct 290 ms 25500 KB Output is correct
61 Correct 236 ms 29088 KB Output is correct
62 Correct 238 ms 26844 KB Output is correct
63 Correct 282 ms 30308 KB Output is correct
64 Correct 231 ms 30284 KB Output is correct
65 Correct 265 ms 30280 KB Output is correct
66 Correct 228 ms 30192 KB Output is correct
67 Correct 233 ms 29428 KB Output is correct
68 Correct 244 ms 29172 KB Output is correct
69 Correct 230 ms 26308 KB Output is correct
70 Correct 232 ms 26348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 4 ms 1116 KB Output is correct
73 Correct 5 ms 1116 KB Output is correct
74 Correct 5 ms 1112 KB Output is correct
75 Correct 5 ms 1116 KB Output is correct
76 Correct 4 ms 1116 KB Output is correct
77 Correct 5 ms 1116 KB Output is correct
78 Correct 5 ms 1112 KB Output is correct
79 Correct 4 ms 1116 KB Output is correct
80 Correct 234 ms 27352 KB Output is correct
81 Correct 291 ms 27452 KB Output is correct
82 Correct 234 ms 29136 KB Output is correct
83 Correct 288 ms 30280 KB Output is correct
84 Correct 3 ms 856 KB Output is correct
85 Correct 3 ms 860 KB Output is correct
86 Correct 3 ms 860 KB Output is correct
87 Correct 4 ms 860 KB Output is correct
88 Correct 4 ms 1116 KB Output is correct
89 Correct 4 ms 1116 KB Output is correct
90 Correct 4 ms 980 KB Output is correct
91 Correct 5 ms 1116 KB Output is correct
92 Correct 4 ms 1068 KB Output is correct
93 Correct 5 ms 1116 KB Output is correct
94 Correct 1 ms 344 KB Output is correct
95 Correct 1 ms 344 KB Output is correct
96 Correct 0 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 348 KB Output is correct
101 Correct 0 ms 348 KB Output is correct
102 Correct 0 ms 348 KB Output is correct
103 Correct 1 ms 348 KB Output is correct
104 Correct 16 ms 2908 KB Output is correct
105 Correct 35 ms 6236 KB Output is correct
106 Correct 1 ms 348 KB Output is correct
107 Correct 84 ms 10608 KB Output is correct
108 Correct 104 ms 14156 KB Output is correct
109 Correct 1 ms 604 KB Output is correct
110 Correct 143 ms 18708 KB Output is correct
111 Correct 172 ms 22784 KB Output is correct
112 Correct 2 ms 856 KB Output is correct
113 Correct 243 ms 29768 KB Output is correct

Subtask #4
0 / 18.0

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

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 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 0 ms 348 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 2 ms 604 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 197 ms 27432 KB Output is correct
2 Correct 254 ms 27580 KB Output is correct
3 Correct 117 ms 18148 KB Output is correct
4 Correct 21 ms 4440 KB Output is correct
5 Correct 16 ms 2936 KB Output is correct
6 Correct 35 ms 6228 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 82 ms 10836 KB Output is correct
9 Correct 104 ms 14132 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 174 ms 18736 KB Output is correct
12 Correct 184 ms 22704 KB Output is correct
13 Correct 2 ms 600 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 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 0 ms 348 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 195 ms 27404 KB Output is correct
40 Correct 207 ms 27476 KB Output is correct
41 Correct 124 ms 17932 KB Output is correct
42 Correct 21 ms 4440 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 229 ms 30040 KB Output is correct
58 Correct 220 ms 26168 KB Output is correct
59 Correct 229 ms 29044 KB Output is correct
60 Correct 290 ms 25500 KB Output is correct
61 Correct 236 ms 29088 KB Output is correct
62 Correct 238 ms 26844 KB Output is correct
63 Correct 282 ms 30308 KB Output is correct
64 Correct 231 ms 30284 KB Output is correct
65 Correct 265 ms 30280 KB Output is correct
66 Correct 228 ms 30192 KB Output is correct
67 Correct 233 ms 29428 KB Output is correct
68 Correct 244 ms 29172 KB Output is correct
69 Correct 230 ms 26308 KB Output is correct
70 Correct 232 ms 26348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 4 ms 1116 KB Output is correct
73 Correct 5 ms 1116 KB Output is correct
74 Correct 5 ms 1112 KB Output is correct
75 Correct 5 ms 1116 KB Output is correct
76 Correct 4 ms 1116 KB Output is correct
77 Correct 5 ms 1116 KB Output is correct
78 Correct 5 ms 1112 KB Output is correct
79 Correct 4 ms 1116 KB Output is correct
80 Correct 234 ms 27352 KB Output is correct
81 Correct 291 ms 27452 KB Output is correct
82 Correct 234 ms 29136 KB Output is correct
83 Correct 288 ms 30280 KB Output is correct
84 Correct 3 ms 856 KB Output is correct
85 Correct 3 ms 860 KB Output is correct
86 Correct 3 ms 860 KB Output is correct
87 Correct 4 ms 860 KB Output is correct
88 Correct 4 ms 1116 KB Output is correct
89 Correct 4 ms 1116 KB Output is correct
90 Correct 4 ms 980 KB Output is correct
91 Correct 5 ms 1116 KB Output is correct
92 Correct 4 ms 1068 KB Output is correct
93 Correct 5 ms 1116 KB Output is correct
94 Correct 1 ms 344 KB Output is correct
95 Correct 1 ms 344 KB Output is correct
96 Correct 0 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 348 KB Output is correct
101 Correct 0 ms 348 KB Output is correct
102 Correct 0 ms 348 KB Output is correct
103 Correct 1 ms 348 KB Output is correct
104 Correct 16 ms 2908 KB Output is correct
105 Correct 35 ms 6236 KB Output is correct
106 Correct 1 ms 348 KB Output is correct
107 Correct 84 ms 10608 KB Output is correct
108 Correct 104 ms 14156 KB Output is correct
109 Correct 1 ms 604 KB Output is correct
110 Correct 143 ms 18708 KB Output is correct
111 Correct 172 ms 22784 KB Output is correct
112 Correct 2 ms 856 KB Output is correct
113 Correct 243 ms 29768 KB Output is correct
114 Incorrect 166 ms 31184 KB Output isn't correct
115 Halted 0 ms 0 KB -