답안 #674258

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
674258 2022-12-23T15:10:32 Z a_aguilo 꿈 (IOI13_dreaming) C++14
100 / 100
137 ms 24132 KB
#include "dreaming.h"
#include<bits/stdc++.h>

using namespace std;

int diameter;
vector<vector<int>> AdjList, Weights;
vector<int> component, father, distFather, LongestDepth, NodeForLongestDepth, SecondLongestDepth;

void dfs(int node){//Primera pasada de la dp
    //Existe el caso de que sea una hoja, así que sus máximas profundidades serían 0
    LongestDepth[node] = 0;
    SecondLongestDepth[node] = 0;
    //actualizamos máximas profundidades teniendo en cuenta los hijos del nodo
    for(int next = 0; next < AdjList[node].size(); ++next){
        int neighbour = AdjList[node][next];
        int time = Weights[node][next];
        if(neighbour == father[node]) continue;//Descartamos visitar al padre del nodo
        //El hijo es visitado por primera vez, así que hay que completar la información de su padre (este nodo)
        father[neighbour] = node;
        distFather[neighbour] = time;
        component[neighbour] = component[node];
        dfs(neighbour);//visitamos al hijo
        int DepthNeighbour = LongestDepth[neighbour] + time; //máxima profundidad obtenida si contiene al hijo del nodo
        if(DepthNeighbour >= LongestDepth[node]){
            //Si es mayor que la máxima profundidad obtenida hasta ahora, actualizamos
            SecondLongestDepth[node] = LongestDepth[node];
            LongestDepth[node] = DepthNeighbour;
            NodeForLongestDepth[node] = neighbour;
        }else if(DepthNeighbour >= SecondLongestDepth[node]){//También podría ser la segunda mayor profundidad
            SecondLongestDepth[node] = DepthNeighbour;
        }
    }
}
int getDepthComponent(int node){//segunda pasada de la dp: ahora calculamos las profundidades de 
    //manera absoluta, no respecto al subárbol de un nodo. Por eso toca tener en cuenta los 
    //caminos que salgan del nodo y pasen por su padre.
    if(father[node] != node){//Si el nodo no es la raíz que hemos usado para explorar la componente
        //porque de lo contrario ya tenemos la máxima profundidad absoluta
        int predecesor = father[node];
        int optative = 0;
        //Casos
        //  -La máxima profundidad del padre no pasa por este nodo -> probar la profundidad que obtenemos 
        //  yendo de este nodo a su padre y de allí a su máxima profundidad
        if(node != NodeForLongestDepth[predecesor]) optative = LongestDepth[predecesor]+distFather[node];
        //  -La máxima profundidad del padre pasa por este nodo -> no nos sirve, así que probar la profundidad
        //  que obtenemos yendo de este nodo a su padre y de allí a su segunda máxima profundidad
        else optative = SecondLongestDepth[predecesor]+distFather[node];
        //Actualizamos los valores de máxima profundidad y segunda máxima profundidad con respecto a la 
        //profundidad del camino que pasa por el padre
        if(optative >= LongestDepth[node]){
            SecondLongestDepth[node] = LongestDepth[node];
            LongestDepth[node] = optative;
            NodeForLongestDepth[node] = predecesor;
        }else if(optative >= SecondLongestDepth[node]) SecondLongestDepth[node] = optative;
    }
    int ans = LongestDepth[node];//Obtenemos la profundidad si tomamos este nodo como raíz
    diameter = max(diameter, ans);//Actualizamos el valor del diámetro como la máxima distancia si salimos de este nodo
    //Como pasaremos por todos los nodos de una componente acabaremos obteniendo el diámetro de esa componente en forma
    // de máxima profundidad de una hoja, y como visitamos todas las componentes obtendremos el máximo diámetro entre
    //ellas, que es otra de las posibles máximas rutas.
    for(int neighbour: AdjList[node]) {
        if(neighbour != father[node])ans = min(ans, getDepthComponent(neighbour));//Buscar la profundidad si cogemos su 
        //hijo como raíz, para el que también actualizaremos las profundidades teniendo en cuenta los caminos que pasen 
        //por su padre. Cada vez nos vamos quedando con la menor profundidad, que es lo que buscamos.
    }
    return ans;
}
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    //Pasamos los datos a formato de lista de adyacencia
    AdjList = vector<vector<int>>(N);
    Weights = vector<vector<int>>(N);
    for(int i = 0; i < M; ++i){
        AdjList[A[i]].push_back(B[i]);
        AdjList[B[i]].push_back(A[i]);
        Weights[B[i]].push_back(T[i]);
        Weights[A[i]].push_back(T[i]);
    }
    component = vector<int>(N, -1); // Indica la componente conexa a que pertenece cada nodo
    LongestDepth = vector<int>(N, -1); //Indica la máxima profundidad que se consigue desde cada nodo
    SecondLongestDepth = vector<int> (N, -1); //Indica el camino con segunda máxima profundidad saliendo de cada nodo
    //dicho camino es diferente del de la máxima profundidad: no comparten ninguna arista
    NodeForLongestDepth = vector<int>(N, -1); //NodeForLongestDepth[i] = j cuando j es el hijo de i mediante el que
    //se accede al camino de máxima profundidad
    distFather = vector<int>(N, 1); //Indica la distancia que cada nodo tiene con su padre si empezamos el dfs 
    //de la componente en el nodo numerado más pequeño
    father = vector<int>(N, -1); //Indica el padre de cada nodo
    vector<int> depthsComponents;//Indica la profundidad que cada componente conexa tendrá 
    // si accedemos a ella desde su centroide
    diameter = 0; //La máxima distancia para atravesar el grafo también puede ser el diámetro de una de las componentes
    for(int i = 0; i < N; ++i){
        if(component[i] == -1){//Si no ha sido visitado al formar una componente
            component[i] = i; //Creamos nueva componente
            //Este nodo es raíz para explorar la componente, por lo que es su mismo padre
            distFather[i] = 0;
            father[i] = i;
            dfs(i);//Primera pasada de la dp -> Se calculan las profundidades usando la raíz como referencia
            depthsComponents.push_back(getDepthComponent(i));//Segunda pasada de la dp para que ahora las profundidades 
            //sean en general. Añadimos a la lista de profundidades de las componentes 
            //la profundidad de la componente que venimos de explorar si tomamos como raíz el centroide
        }
    }
    sort(depthsComponents.rbegin(), depthsComponents.rend()); //Ordenamos la lista de profundidades de mayor a menor
    //Posibles casos
    //  -La máxima ruta es uno de los diámetros -> Número de componentes >= 1
    //      -> esto se ha ido calculando haciendo el máximo en la variable diameter
    //  -La máxima ruta es L + la mayor profundidad + la segunda mayor profundidad -> Número de componentes >= 2
    //  -La máxima ruta es 2*L + la segunda mayor profundidad + la tercera mayor profundidad -> Número de componentes >= 3
    if(M == N-1) return diameter;
    int MaxTravel = max(diameter, depthsComponents[0] + depthsComponents[1] + L);
    if((N-M-1) == 1) return MaxTravel;
    MaxTravel= max(MaxTravel, depthsComponents[1] + depthsComponents[2] + 2*L);
    return MaxTravel;
}

Compilation message

dreaming.cpp: In function 'void dfs(int)':
dreaming.cpp:15:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     for(int next = 0; next < AdjList[node].size(); ++next){
      |                       ~~~~~^~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 18612 KB Output is correct
2 Correct 61 ms 18264 KB Output is correct
3 Correct 40 ms 13952 KB Output is correct
4 Correct 7 ms 2900 KB Output is correct
5 Correct 6 ms 2076 KB Output is correct
6 Correct 13 ms 4364 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 30 ms 8132 KB Output is correct
9 Correct 42 ms 11292 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 61 ms 14156 KB Output is correct
12 Correct 73 ms 16208 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 232 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 308 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 18612 KB Output is correct
2 Correct 61 ms 18264 KB Output is correct
3 Correct 40 ms 13952 KB Output is correct
4 Correct 7 ms 2900 KB Output is correct
5 Correct 6 ms 2076 KB Output is correct
6 Correct 13 ms 4364 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 30 ms 8132 KB Output is correct
9 Correct 42 ms 11292 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 61 ms 14156 KB Output is correct
12 Correct 73 ms 16208 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 304 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 232 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 308 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 61 ms 18712 KB Output is correct
40 Correct 67 ms 18252 KB Output is correct
41 Correct 38 ms 13900 KB Output is correct
42 Correct 8 ms 3012 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 1 ms 308 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 308 KB Output is correct
51 Correct 1 ms 308 KB Output is correct
52 Correct 1 ms 304 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 1 ms 308 KB Output is correct
56 Correct 1 ms 312 KB Output is correct
57 Correct 94 ms 16092 KB Output is correct
58 Correct 105 ms 16200 KB Output is correct
59 Correct 96 ms 16188 KB Output is correct
60 Correct 96 ms 16204 KB Output is correct
61 Correct 91 ms 16460 KB Output is correct
62 Correct 124 ms 16484 KB Output is correct
63 Correct 137 ms 16224 KB Output is correct
64 Correct 87 ms 16204 KB Output is correct
65 Correct 97 ms 16476 KB Output is correct
66 Correct 91 ms 16460 KB Output is correct
67 Correct 95 ms 16276 KB Output is correct
68 Correct 97 ms 16284 KB Output is correct
69 Correct 115 ms 16516 KB Output is correct
70 Correct 108 ms 16528 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 2 ms 740 KB Output is correct
73 Correct 2 ms 724 KB Output is correct
74 Correct 2 ms 724 KB Output is correct
75 Correct 2 ms 724 KB Output is correct
76 Correct 2 ms 724 KB Output is correct
77 Correct 2 ms 724 KB Output is correct
78 Correct 2 ms 724 KB Output is correct
79 Correct 2 ms 724 KB Output is correct
80 Correct 104 ms 16248 KB Output is correct
81 Correct 97 ms 16152 KB Output is correct
82 Correct 98 ms 16520 KB Output is correct
83 Correct 91 ms 16576 KB Output is correct
84 Correct 2 ms 596 KB Output is correct
85 Correct 1 ms 572 KB Output is correct
86 Correct 2 ms 596 KB Output is correct
87 Correct 2 ms 724 KB Output is correct
88 Correct 2 ms 724 KB Output is correct
89 Correct 2 ms 708 KB Output is correct
90 Correct 2 ms 724 KB Output is correct
91 Correct 2 ms 724 KB Output is correct
92 Correct 2 ms 724 KB Output is correct
93 Correct 2 ms 724 KB Output is correct
94 Correct 1 ms 304 KB Output is correct
95 Correct 1 ms 340 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 1 ms 212 KB Output is correct
98 Correct 0 ms 304 KB Output is correct
99 Correct 0 ms 212 KB Output is correct
100 Correct 1 ms 308 KB Output is correct
101 Correct 1 ms 308 KB Output is correct
102 Correct 1 ms 212 KB Output is correct
103 Correct 1 ms 304 KB Output is correct
104 Correct 6 ms 2004 KB Output is correct
105 Correct 13 ms 4288 KB Output is correct
106 Correct 1 ms 340 KB Output is correct
107 Correct 26 ms 8140 KB Output is correct
108 Correct 39 ms 11216 KB Output is correct
109 Correct 1 ms 340 KB Output is correct
110 Correct 67 ms 14084 KB Output is correct
111 Correct 98 ms 16236 KB Output is correct
112 Correct 1 ms 468 KB Output is correct
113 Correct 111 ms 24132 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 11976 KB Output is correct
2 Correct 32 ms 12024 KB Output is correct
3 Correct 28 ms 11980 KB Output is correct
4 Correct 30 ms 11928 KB Output is correct
5 Correct 28 ms 11928 KB Output is correct
6 Correct 43 ms 12868 KB Output is correct
7 Correct 31 ms 12492 KB Output is correct
8 Correct 31 ms 11768 KB Output is correct
9 Correct 28 ms 11704 KB Output is correct
10 Correct 29 ms 12320 KB Output is correct
11 Correct 0 ms 308 KB Output is correct
12 Correct 7 ms 8016 KB Output is correct
13 Correct 9 ms 7996 KB Output is correct
14 Correct 8 ms 8016 KB Output is correct
15 Correct 7 ms 8016 KB Output is correct
16 Correct 8 ms 8016 KB Output is correct
17 Correct 7 ms 7980 KB Output is correct
18 Correct 7 ms 8108 KB Output is correct
19 Correct 7 ms 8016 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 7 ms 7980 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 312 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 232 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 308 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 2 ms 596 KB Output is correct
28 Correct 2 ms 740 KB Output is correct
29 Correct 2 ms 468 KB Output is correct
30 Correct 2 ms 576 KB Output is correct
31 Correct 2 ms 724 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 2 ms 744 KB Output is correct
35 Correct 1 ms 308 KB Output is correct
36 Correct 1 ms 304 KB Output is correct
37 Correct 1 ms 296 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 312 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 2 ms 852 KB Output is correct
55 Correct 2 ms 852 KB Output is correct
56 Correct 2 ms 732 KB Output is correct
57 Correct 1 ms 596 KB Output is correct
58 Correct 2 ms 724 KB Output is correct
59 Correct 2 ms 724 KB Output is correct
60 Correct 1 ms 572 KB Output is correct
61 Correct 1 ms 576 KB Output is correct
62 Correct 2 ms 700 KB Output is correct
63 Correct 2 ms 740 KB Output is correct
64 Correct 1 ms 468 KB Output is correct
65 Correct 2 ms 700 KB Output is correct
66 Correct 2 ms 700 KB Output is correct
67 Correct 2 ms 724 KB Output is correct
68 Correct 2 ms 724 KB Output is correct
69 Correct 2 ms 740 KB Output is correct
70 Correct 1 ms 596 KB Output is correct
71 Correct 1 ms 580 KB Output is correct
72 Correct 2 ms 724 KB Output is correct
73 Correct 2 ms 724 KB Output is correct
74 Correct 2 ms 724 KB Output is correct
75 Correct 2 ms 788 KB Output is correct
76 Correct 2 ms 724 KB Output is correct
77 Correct 2 ms 708 KB Output is correct
78 Correct 1 ms 596 KB Output is correct
79 Correct 1 ms 596 KB Output is correct
80 Correct 1 ms 468 KB Output is correct
81 Correct 1 ms 468 KB Output is correct
82 Correct 2 ms 736 KB Output is correct
83 Correct 2 ms 724 KB Output is correct
84 Correct 1 ms 596 KB Output is correct
85 Correct 1 ms 468 KB Output is correct
86 Correct 2 ms 724 KB Output is correct
87 Correct 2 ms 704 KB Output is correct
88 Correct 2 ms 724 KB Output is correct
89 Correct 2 ms 700 KB Output is correct
90 Correct 1 ms 576 KB Output is correct
91 Correct 2 ms 596 KB Output is correct
92 Correct 2 ms 596 KB Output is correct
93 Correct 2 ms 600 KB Output is correct
94 Correct 2 ms 668 KB Output is correct
95 Correct 2 ms 724 KB Output is correct
96 Correct 2 ms 724 KB Output is correct
97 Correct 2 ms 724 KB Output is correct
98 Correct 2 ms 724 KB Output is correct
99 Correct 2 ms 704 KB Output is correct
100 Correct 3 ms 724 KB Output is correct
101 Correct 2 ms 724 KB Output is correct
102 Correct 1 ms 304 KB Output is correct
103 Correct 1 ms 312 KB Output is correct
104 Correct 1 ms 304 KB Output is correct
105 Correct 0 ms 212 KB Output is correct
106 Correct 0 ms 212 KB Output is correct
107 Correct 1 ms 212 KB Output is correct
108 Correct 0 ms 212 KB Output is correct
109 Correct 1 ms 304 KB Output is correct
110 Correct 0 ms 212 KB Output is correct
111 Correct 1 ms 212 KB Output is correct
112 Correct 1 ms 344 KB Output is correct
113 Correct 1 ms 440 KB Output is correct
114 Correct 1 ms 472 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 18612 KB Output is correct
2 Correct 61 ms 18264 KB Output is correct
3 Correct 40 ms 13952 KB Output is correct
4 Correct 7 ms 2900 KB Output is correct
5 Correct 6 ms 2076 KB Output is correct
6 Correct 13 ms 4364 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 30 ms 8132 KB Output is correct
9 Correct 42 ms 11292 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 61 ms 14156 KB Output is correct
12 Correct 73 ms 16208 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 304 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 312 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 304 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 232 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 308 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 61 ms 18712 KB Output is correct
40 Correct 67 ms 18252 KB Output is correct
41 Correct 38 ms 13900 KB Output is correct
42 Correct 8 ms 3012 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 1 ms 308 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 308 KB Output is correct
51 Correct 1 ms 308 KB Output is correct
52 Correct 1 ms 304 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 1 ms 308 KB Output is correct
56 Correct 1 ms 312 KB Output is correct
57 Correct 94 ms 16092 KB Output is correct
58 Correct 105 ms 16200 KB Output is correct
59 Correct 96 ms 16188 KB Output is correct
60 Correct 96 ms 16204 KB Output is correct
61 Correct 91 ms 16460 KB Output is correct
62 Correct 124 ms 16484 KB Output is correct
63 Correct 137 ms 16224 KB Output is correct
64 Correct 87 ms 16204 KB Output is correct
65 Correct 97 ms 16476 KB Output is correct
66 Correct 91 ms 16460 KB Output is correct
67 Correct 95 ms 16276 KB Output is correct
68 Correct 97 ms 16284 KB Output is correct
69 Correct 115 ms 16516 KB Output is correct
70 Correct 108 ms 16528 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 2 ms 740 KB Output is correct
73 Correct 2 ms 724 KB Output is correct
74 Correct 2 ms 724 KB Output is correct
75 Correct 2 ms 724 KB Output is correct
76 Correct 2 ms 724 KB Output is correct
77 Correct 2 ms 724 KB Output is correct
78 Correct 2 ms 724 KB Output is correct
79 Correct 2 ms 724 KB Output is correct
80 Correct 104 ms 16248 KB Output is correct
81 Correct 97 ms 16152 KB Output is correct
82 Correct 98 ms 16520 KB Output is correct
83 Correct 91 ms 16576 KB Output is correct
84 Correct 2 ms 596 KB Output is correct
85 Correct 1 ms 572 KB Output is correct
86 Correct 2 ms 596 KB Output is correct
87 Correct 2 ms 724 KB Output is correct
88 Correct 2 ms 724 KB Output is correct
89 Correct 2 ms 708 KB Output is correct
90 Correct 2 ms 724 KB Output is correct
91 Correct 2 ms 724 KB Output is correct
92 Correct 2 ms 724 KB Output is correct
93 Correct 2 ms 724 KB Output is correct
94 Correct 1 ms 304 KB Output is correct
95 Correct 1 ms 340 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 1 ms 212 KB Output is correct
98 Correct 0 ms 304 KB Output is correct
99 Correct 0 ms 212 KB Output is correct
100 Correct 1 ms 308 KB Output is correct
101 Correct 1 ms 308 KB Output is correct
102 Correct 1 ms 212 KB Output is correct
103 Correct 1 ms 304 KB Output is correct
104 Correct 6 ms 2004 KB Output is correct
105 Correct 13 ms 4288 KB Output is correct
106 Correct 1 ms 340 KB Output is correct
107 Correct 26 ms 8140 KB Output is correct
108 Correct 39 ms 11216 KB Output is correct
109 Correct 1 ms 340 KB Output is correct
110 Correct 67 ms 14084 KB Output is correct
111 Correct 98 ms 16236 KB Output is correct
112 Correct 1 ms 468 KB Output is correct
113 Correct 111 ms 24132 KB Output is correct
114 Correct 29 ms 11976 KB Output is correct
115 Correct 32 ms 12024 KB Output is correct
116 Correct 28 ms 11980 KB Output is correct
117 Correct 30 ms 11928 KB Output is correct
118 Correct 28 ms 11928 KB Output is correct
119 Correct 43 ms 12868 KB Output is correct
120 Correct 31 ms 12492 KB Output is correct
121 Correct 31 ms 11768 KB Output is correct
122 Correct 28 ms 11704 KB Output is correct
123 Correct 29 ms 12320 KB Output is correct
124 Correct 0 ms 308 KB Output is correct
125 Correct 7 ms 8016 KB Output is correct
126 Correct 9 ms 7996 KB Output is correct
127 Correct 8 ms 8016 KB Output is correct
128 Correct 7 ms 8016 KB Output is correct
129 Correct 8 ms 8016 KB Output is correct
130 Correct 7 ms 7980 KB Output is correct
131 Correct 7 ms 8108 KB Output is correct
132 Correct 7 ms 8016 KB Output is correct
133 Correct 0 ms 212 KB Output is correct
134 Correct 1 ms 212 KB Output is correct
135 Correct 1 ms 468 KB Output is correct
136 Correct 7 ms 7980 KB Output is correct
137 Correct 1 ms 468 KB Output is correct
138 Correct 2 ms 596 KB Output is correct
139 Correct 2 ms 740 KB Output is correct
140 Correct 2 ms 468 KB Output is correct
141 Correct 2 ms 576 KB Output is correct
142 Correct 2 ms 724 KB Output is correct
143 Correct 1 ms 468 KB Output is correct
144 Correct 1 ms 596 KB Output is correct
145 Correct 2 ms 744 KB Output is correct
146 Correct 1 ms 308 KB Output is correct
147 Correct 1 ms 304 KB Output is correct
148 Correct 1 ms 296 KB Output is correct
149 Correct 1 ms 212 KB Output is correct
150 Correct 0 ms 212 KB Output is correct
151 Correct 0 ms 212 KB Output is correct
152 Correct 1 ms 212 KB Output is correct
153 Correct 1 ms 312 KB Output is correct
154 Correct 0 ms 212 KB Output is correct
155 Correct 1 ms 212 KB Output is correct
156 Correct 1 ms 212 KB Output is correct
157 Correct 1 ms 212 KB Output is correct
158 Correct 1 ms 212 KB Output is correct
159 Correct 0 ms 212 KB Output is correct
160 Correct 1 ms 212 KB Output is correct
161 Correct 0 ms 212 KB Output is correct
162 Correct 1 ms 212 KB Output is correct
163 Correct 0 ms 212 KB Output is correct
164 Correct 0 ms 212 KB Output is correct
165 Correct 2 ms 852 KB Output is correct
166 Correct 2 ms 852 KB Output is correct
167 Correct 2 ms 732 KB Output is correct
168 Correct 1 ms 596 KB Output is correct
169 Correct 2 ms 724 KB Output is correct
170 Correct 2 ms 724 KB Output is correct
171 Correct 1 ms 572 KB Output is correct
172 Correct 1 ms 576 KB Output is correct
173 Correct 2 ms 700 KB Output is correct
174 Correct 2 ms 740 KB Output is correct
175 Correct 1 ms 468 KB Output is correct
176 Correct 2 ms 700 KB Output is correct
177 Correct 2 ms 700 KB Output is correct
178 Correct 2 ms 724 KB Output is correct
179 Correct 2 ms 724 KB Output is correct
180 Correct 2 ms 740 KB Output is correct
181 Correct 1 ms 596 KB Output is correct
182 Correct 1 ms 580 KB Output is correct
183 Correct 2 ms 724 KB Output is correct
184 Correct 2 ms 724 KB Output is correct
185 Correct 2 ms 724 KB Output is correct
186 Correct 2 ms 788 KB Output is correct
187 Correct 2 ms 724 KB Output is correct
188 Correct 2 ms 708 KB Output is correct
189 Correct 1 ms 596 KB Output is correct
190 Correct 1 ms 596 KB Output is correct
191 Correct 1 ms 468 KB Output is correct
192 Correct 1 ms 468 KB Output is correct
193 Correct 2 ms 736 KB Output is correct
194 Correct 2 ms 724 KB Output is correct
195 Correct 1 ms 596 KB Output is correct
196 Correct 1 ms 468 KB Output is correct
197 Correct 2 ms 724 KB Output is correct
198 Correct 2 ms 704 KB Output is correct
199 Correct 2 ms 724 KB Output is correct
200 Correct 2 ms 700 KB Output is correct
201 Correct 1 ms 576 KB Output is correct
202 Correct 2 ms 596 KB Output is correct
203 Correct 2 ms 596 KB Output is correct
204 Correct 2 ms 600 KB Output is correct
205 Correct 2 ms 668 KB Output is correct
206 Correct 2 ms 724 KB Output is correct
207 Correct 2 ms 724 KB Output is correct
208 Correct 2 ms 724 KB Output is correct
209 Correct 2 ms 724 KB Output is correct
210 Correct 2 ms 704 KB Output is correct
211 Correct 3 ms 724 KB Output is correct
212 Correct 2 ms 724 KB Output is correct
213 Correct 1 ms 304 KB Output is correct
214 Correct 1 ms 312 KB Output is correct
215 Correct 1 ms 304 KB Output is correct
216 Correct 0 ms 212 KB Output is correct
217 Correct 0 ms 212 KB Output is correct
218 Correct 1 ms 212 KB Output is correct
219 Correct 0 ms 212 KB Output is correct
220 Correct 1 ms 304 KB Output is correct
221 Correct 0 ms 212 KB Output is correct
222 Correct 1 ms 212 KB Output is correct
223 Correct 1 ms 344 KB Output is correct
224 Correct 1 ms 440 KB Output is correct
225 Correct 1 ms 472 KB Output is correct
226 Correct 1 ms 448 KB Output is correct
227 Correct 1 ms 596 KB Output is correct
228 Correct 2 ms 724 KB Output is correct
229 Correct 58 ms 12840 KB Output is correct
230 Correct 73 ms 15960 KB Output is correct
231 Correct 1 ms 440 KB Output is correct
232 Correct 1 ms 576 KB Output is correct
233 Correct 2 ms 724 KB Output is correct
234 Correct 56 ms 12920 KB Output is correct
235 Correct 74 ms 16052 KB Output is correct
236 Correct 1 ms 468 KB Output is correct
237 Correct 2 ms 604 KB Output is correct
238 Correct 2 ms 724 KB Output is correct
239 Correct 55 ms 13004 KB Output is correct
240 Correct 75 ms 16212 KB Output is correct
241 Correct 29 ms 11988 KB Output is correct
242 Correct 31 ms 11992 KB Output is correct
243 Correct 31 ms 11920 KB Output is correct
244 Correct 28 ms 12016 KB Output is correct
245 Correct 28 ms 11912 KB Output is correct
246 Correct 31 ms 12868 KB Output is correct
247 Correct 31 ms 12496 KB Output is correct
248 Correct 28 ms 11780 KB Output is correct
249 Correct 31 ms 11696 KB Output is correct
250 Correct 30 ms 12368 KB Output is correct
251 Correct 1 ms 212 KB Output is correct
252 Correct 74 ms 18792 KB Output is correct
253 Correct 63 ms 18308 KB Output is correct
254 Correct 37 ms 13916 KB Output is correct
255 Correct 7 ms 2876 KB Output is correct
256 Correct 1 ms 212 KB Output is correct
257 Correct 1 ms 312 KB Output is correct
258 Correct 0 ms 212 KB Output is correct
259 Correct 0 ms 304 KB Output is correct
260 Correct 1 ms 212 KB Output is correct
261 Correct 0 ms 212 KB Output is correct
262 Correct 1 ms 212 KB Output is correct
263 Correct 1 ms 212 KB Output is correct
264 Correct 1 ms 212 KB Output is correct
265 Correct 0 ms 212 KB Output is correct
266 Correct 1 ms 212 KB Output is correct
267 Correct 0 ms 212 KB Output is correct
268 Correct 1 ms 212 KB Output is correct
269 Correct 0 ms 312 KB Output is correct
270 Correct 1 ms 308 KB Output is correct
271 Correct 0 ms 212 KB Output is correct
272 Correct 97 ms 16176 KB Output is correct
273 Correct 92 ms 16076 KB Output is correct
274 Correct 97 ms 16232 KB Output is correct
275 Correct 100 ms 16260 KB Output is correct
276 Correct 8 ms 8016 KB Output is correct
277 Correct 7 ms 8004 KB Output is correct
278 Correct 106 ms 16588 KB Output is correct
279 Correct 90 ms 16492 KB Output is correct
280 Correct 100 ms 16204 KB Output is correct
281 Correct 103 ms 16312 KB Output is correct
282 Correct 96 ms 16584 KB Output is correct
283 Correct 97 ms 16628 KB Output is correct
284 Correct 96 ms 16208 KB Output is correct
285 Correct 95 ms 16220 KB Output is correct
286 Correct 102 ms 16568 KB Output is correct
287 Correct 103 ms 16528 KB Output is correct
288 Correct 7 ms 8016 KB Output is correct
289 Correct 7 ms 8016 KB Output is correct
290 Correct 7 ms 8016 KB Output is correct
291 Correct 7 ms 8016 KB Output is correct
292 Correct 8 ms 8120 KB Output is correct
293 Correct 8 ms 7984 KB Output is correct
294 Correct 1 ms 308 KB Output is correct
295 Correct 1 ms 212 KB Output is correct
296 Correct 2 ms 828 KB Output is correct
297 Correct 2 ms 852 KB Output is correct
298 Correct 95 ms 15112 KB Output is correct
299 Correct 88 ms 14904 KB Output is correct
300 Correct 2 ms 724 KB Output is correct
301 Correct 1 ms 568 KB Output is correct
302 Correct 2 ms 704 KB Output is correct
303 Correct 2 ms 724 KB Output is correct
304 Correct 1 ms 596 KB Output is correct
305 Correct 1 ms 596 KB Output is correct
306 Correct 2 ms 748 KB Output is correct
307 Correct 3 ms 724 KB Output is correct
308 Correct 1 ms 468 KB Output is correct
309 Correct 2 ms 724 KB Output is correct
310 Correct 2 ms 748 KB Output is correct
311 Correct 3 ms 800 KB Output is correct
312 Correct 2 ms 724 KB Output is correct
313 Correct 3 ms 724 KB Output is correct
314 Correct 1 ms 596 KB Output is correct
315 Correct 2 ms 596 KB Output is correct
316 Correct 2 ms 724 KB Output is correct
317 Correct 2 ms 724 KB Output is correct
318 Correct 2 ms 724 KB Output is correct
319 Correct 2 ms 724 KB Output is correct
320 Correct 2 ms 744 KB Output is correct
321 Correct 2 ms 764 KB Output is correct
322 Correct 1 ms 596 KB Output is correct
323 Correct 1 ms 596 KB Output is correct
324 Correct 1 ms 564 KB Output is correct
325 Correct 1 ms 468 KB Output is correct
326 Correct 2 ms 724 KB Output is correct
327 Correct 2 ms 724 KB Output is correct
328 Correct 1 ms 596 KB Output is correct
329 Correct 1 ms 560 KB Output is correct
330 Correct 2 ms 704 KB Output is correct
331 Correct 2 ms 724 KB Output is correct
332 Correct 1 ms 704 KB Output is correct
333 Correct 2 ms 724 KB Output is correct
334 Correct 1 ms 568 KB Output is correct
335 Correct 1 ms 596 KB Output is correct
336 Correct 93 ms 18708 KB Output is correct
337 Correct 103 ms 21688 KB Output is correct
338 Correct 86 ms 15156 KB Output is correct
339 Correct 90 ms 15464 KB Output is correct
340 Correct 21 ms 10576 KB Output is correct
341 Correct 36 ms 12624 KB Output is correct
342 Correct 96 ms 16188 KB Output is correct
343 Correct 100 ms 16188 KB Output is correct
344 Correct 48 ms 13960 KB Output is correct
345 Correct 30 ms 12076 KB Output is correct
346 Correct 97 ms 16184 KB Output is correct
347 Correct 95 ms 16264 KB Output is correct
348 Correct 80 ms 16192 KB Output is correct
349 Correct 72 ms 15708 KB Output is correct
350 Correct 89 ms 16460 KB Output is correct
351 Correct 108 ms 16468 KB Output is correct
352 Correct 10 ms 8428 KB Output is correct
353 Correct 97 ms 15900 KB Output is correct
354 Correct 31 ms 12360 KB Output is correct
355 Correct 36 ms 12360 KB Output is correct
356 Correct 69 ms 15380 KB Output is correct
357 Correct 16 ms 9640 KB Output is correct
358 Correct 32 ms 12336 KB Output is correct
359 Correct 34 ms 12380 KB Output is correct
360 Correct 7 ms 8016 KB Output is correct
361 Correct 7 ms 7980 KB Output is correct
362 Correct 90 ms 16636 KB Output is correct
363 Correct 90 ms 16536 KB Output is correct
364 Correct 50 ms 12980 KB Output is correct
365 Correct 34 ms 11308 KB Output is correct
366 Correct 49 ms 13148 KB Output is correct
367 Correct 65 ms 14016 KB Output is correct
368 Correct 71 ms 15472 KB Output is correct
369 Correct 56 ms 14580 KB Output is correct
370 Correct 40 ms 12852 KB Output is correct
371 Correct 77 ms 15496 KB Output is correct
372 Correct 2 ms 596 KB Output is correct
373 Correct 1 ms 596 KB Output is correct
374 Correct 2 ms 596 KB Output is correct
375 Correct 2 ms 620 KB Output is correct
376 Correct 2 ms 724 KB Output is correct
377 Correct 2 ms 724 KB Output is correct
378 Correct 2 ms 608 KB Output is correct
379 Correct 2 ms 724 KB Output is correct
380 Correct 2 ms 672 KB Output is correct
381 Correct 2 ms 704 KB Output is correct
382 Correct 1 ms 212 KB Output is correct
383 Correct 1 ms 212 KB Output is correct
384 Correct 1 ms 212 KB Output is correct
385 Correct 1 ms 308 KB Output is correct
386 Correct 0 ms 212 KB Output is correct
387 Correct 0 ms 212 KB Output is correct
388 Correct 1 ms 304 KB Output is correct
389 Correct 1 ms 212 KB Output is correct
390 Correct 1 ms 212 KB Output is correct
391 Correct 0 ms 304 KB Output is correct
392 Correct 6 ms 2080 KB Output is correct
393 Correct 13 ms 4308 KB Output is correct
394 Correct 1 ms 340 KB Output is correct
395 Correct 36 ms 8100 KB Output is correct
396 Correct 39 ms 11252 KB Output is correct
397 Correct 1 ms 340 KB Output is correct
398 Correct 63 ms 14096 KB Output is correct
399 Correct 79 ms 16204 KB Output is correct
400 Correct 1 ms 468 KB Output is correct
401 Correct 121 ms 24064 KB Output is correct