oj.uz

답안 #962319

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
962319 2024-04-13T10:33:02 Z n3rm1n 꿈 (IOI13_dreaming) C++17
59 / 100
 1000 ms 32708 KB 
#include<bits/stdc++.h>
#include "dreaming.h"
using namespace std;
const int MAXN = 5e5 + 10;
vector < pair < int, int > > g[MAXN];
int mark[MAXN];
int used[MAXN];
void dfs0(int beg)
{
    mark[beg] = 1;
    used[beg] = 1;
    int nb;
    for (int i = 0; i < g[beg].size(); ++ i)
    {
        nb = g[beg][i].first;
        if(!used[nb])
            dfs0(nb);
    }
}
int far = 0, far_index = 0;
void dfs_diam(int beg, int to_there)
{
    if(far <= to_there)
    {
        far = to_there;
        far_index = beg;
    }
    used[beg] = 1;
    int nb, distt;
    for (int i = 0; i < g[beg].size(); ++ i)
    {
        nb = g[beg][i].first;
        distt = g[beg][i].second;
        if(!used[nb])dfs_diam(nb, to_there + distt);
    }
}
int maxdist = 0;
int dfs(int beg)
{
    used[beg] = 1;
    int nb, distt;
    int maxx = 0;
    for (int i = 0; i < g[beg].size(); ++ i)
    {
        nb = g[beg][i].first;
        distt = g[beg][i].second;
        if(!used[nb])maxx = max(maxx, dfs(nb)+distt);
    }
    return maxx;
}
vector < pair < int, int >  > path;
int st, fi;
int marked[MAXN];
int dfs_form(int beg, int add)
{
    marked[beg] = 1;
    used[beg] = 1;
    if(beg == fi)
    {
        path.push_back(make_pair(beg, add));
        return 1;
    }
    int nb, distt;
    int found = 0;
    for (int i = 0; i < g[beg].size(); ++ i)
    {
        nb = g[beg][i].first;
        distt = g[beg][i].second;
        if(!used[nb])
        {
            if(dfs_form(nb, add + distt))found = 1;
        }
    }
    if(found)path.push_back(make_pair(beg, add));
    return found;
}

int travelTime(int N, int M, int L, int A[], int B[], int T[])
{
    for (int i = 0; i < M; ++ i)
    {
        g[A[i]].push_back(make_pair(B[i], T[i]));
        g[B[i]].push_back(make_pair(A[i], T[i]));
    }

    int n = N;

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

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

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

        pq.push(make_pair(best1, index1));
       // cout << "component " << best1 << "  " << index1 << endl;
    }


    int sz = pq.size();

    while(pq.size() > 1)
    {
        int diam1 = pq.top().first;
        int ii1 = pq.top().second;
        pq.pop();
        int diam2 = pq.top().first;
        int ii2 = pq.top().second;
        pq.pop();


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

    }


        int aa1 = 0, bb1 = 0;
        int aa2 = 0, bb2 = 0;
        memset(used, 0, sizeof(used));
        far = 0;
        far_index = 0;
        dfs_diam(0, 0);
        aa1 = far_index;
        memset(used, 0, sizeof(used));
    return dfs(aa1);

    ///

}

Compilation message

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

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 32012 KB Output is correct
2 Correct 49 ms 31884 KB Output is correct
3 Correct 34 ms 27344 KB Output is correct
4 Correct 13 ms 20828 KB Output is correct
5 Correct 12 ms 19916 KB Output is correct
6 Correct 16 ms 21996 KB Output is correct
7 Correct 4 ms 19032 KB Output is correct
8 Correct 27 ms 22968 KB Output is correct
9 Correct 32 ms 25000 KB Output is correct
10 Correct 4 ms 19036 KB Output is correct
11 Correct 49 ms 26372 KB Output is correct
12 Correct 52 ms 29128 KB Output is correct
13 Correct 5 ms 19032 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 19288 KB Output is correct
2 Correct 4 ms 19032 KB Output is correct
3 Correct 4 ms 19036 KB Output is correct
4 Correct 4 ms 19036 KB Output is correct
5 Correct 4 ms 19036 KB Output is correct
6 Correct 4 ms 19032 KB Output is correct
7 Correct 5 ms 19036 KB Output is correct
8 Correct 5 ms 19036 KB Output is correct
9 Correct 5 ms 19056 KB Output is correct
10 Correct 5 ms 19036 KB Output is correct
11 Correct 4 ms 19036 KB Output is correct
12 Correct 4 ms 19036 KB Output is correct
13 Correct 4 ms 19060 KB Output is correct
14 Correct 4 ms 19036 KB Output is correct
15 Correct 4 ms 16984 KB Output is correct
16 Correct 4 ms 19032 KB Output is correct
17 Correct 4 ms 19036 KB Output is correct
18 Correct 4 ms 19032 KB Output is correct
19 Correct 5 ms 19048 KB Output is correct
20 Correct 5 ms 18888 KB Output is correct
21 Correct 4 ms 19060 KB Output is correct
22 Correct 4 ms 19036 KB Output is correct
23 Correct 4 ms 19036 KB Output is correct
24 Correct 5 ms 19036 KB Output is correct
25 Correct 4 ms 19036 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 32012 KB Output is correct
2 Correct 49 ms 31884 KB Output is correct
3 Correct 34 ms 27344 KB Output is correct
4 Correct 13 ms 20828 KB Output is correct
5 Correct 12 ms 19916 KB Output is correct
6 Correct 16 ms 21996 KB Output is correct
7 Correct 4 ms 19032 KB Output is correct
8 Correct 27 ms 22968 KB Output is correct
9 Correct 32 ms 25000 KB Output is correct
10 Correct 4 ms 19036 KB Output is correct
11 Correct 49 ms 26372 KB Output is correct
12 Correct 52 ms 29128 KB Output is correct
13 Correct 5 ms 19032 KB Output is correct
14 Correct 4 ms 19288 KB Output is correct
15 Correct 4 ms 19032 KB Output is correct
16 Correct 4 ms 19036 KB Output is correct
17 Correct 4 ms 19036 KB Output is correct
18 Correct 4 ms 19036 KB Output is correct
19 Correct 4 ms 19032 KB Output is correct
20 Correct 5 ms 19036 KB Output is correct
21 Correct 5 ms 19036 KB Output is correct
22 Correct 5 ms 19056 KB Output is correct
23 Correct 5 ms 19036 KB Output is correct
24 Correct 4 ms 19036 KB Output is correct
25 Correct 4 ms 19036 KB Output is correct
26 Correct 4 ms 19060 KB Output is correct
27 Correct 4 ms 19036 KB Output is correct
28 Correct 4 ms 16984 KB Output is correct
29 Correct 4 ms 19032 KB Output is correct
30 Correct 4 ms 19036 KB Output is correct
31 Correct 4 ms 19032 KB Output is correct
32 Correct 5 ms 19048 KB Output is correct
33 Correct 5 ms 18888 KB Output is correct
34 Correct 4 ms 19060 KB Output is correct
35 Correct 4 ms 19036 KB Output is correct
36 Correct 4 ms 19036 KB Output is correct
37 Correct 5 ms 19036 KB Output is correct
38 Correct 4 ms 19036 KB Output is correct
39 Correct 50 ms 31816 KB Output is correct
40 Correct 65 ms 31900 KB Output is correct
41 Correct 34 ms 27620 KB Output is correct
42 Correct 12 ms 20828 KB Output is correct
43 Correct 4 ms 19036 KB Output is correct
44 Correct 4 ms 19292 KB Output is correct
45 Correct 4 ms 19060 KB Output is correct
46 Correct 4 ms 19036 KB Output is correct
47 Correct 5 ms 19036 KB Output is correct
48 Correct 4 ms 18872 KB Output is correct
49 Correct 4 ms 19036 KB Output is correct
50 Correct 4 ms 19036 KB Output is correct
51 Correct 4 ms 19036 KB Output is correct
52 Correct 5 ms 19036 KB Output is correct
53 Correct 4 ms 19032 KB Output is correct
54 Correct 5 ms 19036 KB Output is correct
55 Correct 4 ms 19036 KB Output is correct
56 Correct 4 ms 19036 KB Output is correct
57 Correct 60 ms 23548 KB Output is correct
58 Correct 65 ms 23500 KB Output is correct
59 Correct 80 ms 23440 KB Output is correct
60 Correct 65 ms 23576 KB Output is correct
61 Correct 76 ms 23368 KB Output is correct
62 Correct 54 ms 23236 KB Output is correct
63 Correct 52 ms 23108 KB Output is correct
64 Correct 55 ms 23144 KB Output is correct
65 Correct 68 ms 23396 KB Output is correct
66 Correct 58 ms 23388 KB Output is correct
67 Correct 70 ms 23580 KB Output is correct
68 Correct 68 ms 23156 KB Output is correct
69 Correct 67 ms 23640 KB Output is correct
70 Correct 80 ms 23496 KB Output is correct
71 Correct 4 ms 16988 KB Output is correct
72 Correct 5 ms 19056 KB Output is correct
73 Correct 5 ms 19032 KB Output is correct
74 Correct 6 ms 19052 KB Output is correct
75 Correct 6 ms 19072 KB Output is correct
76 Correct 7 ms 19036 KB Output is correct
77 Correct 5 ms 19036 KB Output is correct
78 Correct 5 ms 19188 KB Output is correct
79 Correct 6 ms 19188 KB Output is correct
80 Correct 74 ms 23664 KB Output is correct
81 Correct 61 ms 23540 KB Output is correct
82 Correct 70 ms 23316 KB Output is correct
83 Correct 56 ms 23144 KB Output is correct
84 Correct 5 ms 19036 KB Output is correct
85 Correct 7 ms 19036 KB Output is correct
86 Correct 5 ms 19144 KB Output is correct
87 Correct 7 ms 19036 KB Output is correct
88 Correct 5 ms 19036 KB Output is correct
89 Correct 7 ms 19036 KB Output is correct
90 Correct 5 ms 19032 KB Output is correct
91 Correct 6 ms 19288 KB Output is correct
92 Correct 5 ms 19036 KB Output is correct
93 Correct 5 ms 19064 KB Output is correct
94 Correct 4 ms 19036 KB Output is correct
95 Correct 5 ms 19056 KB Output is correct
96 Correct 5 ms 19048 KB Output is correct
97 Correct 4 ms 19036 KB Output is correct
98 Correct 5 ms 19036 KB Output is correct
99 Correct 4 ms 19036 KB Output is correct
100 Correct 4 ms 19036 KB Output is correct
101 Correct 5 ms 19040 KB Output is correct
102 Correct 4 ms 19056 KB Output is correct
103 Correct 4 ms 19040 KB Output is correct
104 Correct 9 ms 19812 KB Output is correct
105 Correct 20 ms 21892 KB Output is correct
106 Correct 5 ms 19048 KB Output is correct
107 Correct 27 ms 23004 KB Output is correct
108 Correct 35 ms 25096 KB Output is correct
109 Correct 4 ms 19036 KB Output is correct
110 Correct 46 ms 26580 KB Output is correct
111 Correct 57 ms 29208 KB Output is correct
112 Correct 6 ms 19036 KB Output is correct
113 Correct 93 ms 32708 KB Output is correct

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1074 ms 21372 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 19288 KB Output is correct
2 Correct 4 ms 19032 KB Output is correct
3 Correct 4 ms 19036 KB Output is correct
4 Correct 4 ms 19036 KB Output is correct
5 Correct 4 ms 19036 KB Output is correct
6 Correct 4 ms 19032 KB Output is correct
7 Correct 5 ms 19036 KB Output is correct
8 Correct 5 ms 19036 KB Output is correct
9 Correct 5 ms 19056 KB Output is correct
10 Correct 5 ms 19036 KB Output is correct
11 Correct 4 ms 19036 KB Output is correct
12 Correct 4 ms 19036 KB Output is correct
13 Correct 4 ms 19060 KB Output is correct
14 Correct 4 ms 19036 KB Output is correct
15 Correct 4 ms 16984 KB Output is correct
16 Correct 4 ms 19032 KB Output is correct
17 Correct 4 ms 19036 KB Output is correct
18 Correct 4 ms 19032 KB Output is correct
19 Correct 5 ms 19048 KB Output is correct
20 Correct 5 ms 18888 KB Output is correct
21 Correct 4 ms 19060 KB Output is correct
22 Correct 4 ms 19036 KB Output is correct
23 Correct 4 ms 19036 KB Output is correct
24 Correct 5 ms 19036 KB Output is correct
25 Correct 4 ms 19036 KB Output is correct
26 Correct 20 ms 19032 KB Output is correct
27 Correct 36 ms 19116 KB Output is correct
28 Correct 51 ms 19036 KB Output is correct
29 Correct 23 ms 19036 KB Output is correct
30 Correct 33 ms 19032 KB Output is correct
31 Correct 44 ms 19148 KB Output is correct
32 Correct 16 ms 19036 KB Output is correct
33 Correct 32 ms 19112 KB Output is correct
34 Correct 44 ms 19036 KB Output is correct
35 Correct 5 ms 19036 KB Output is correct
36 Correct 4 ms 19036 KB Output is correct
37 Correct 4 ms 19048 KB Output is correct
38 Correct 4 ms 19036 KB Output is correct
39 Correct 4 ms 19036 KB Output is correct
40 Correct 13 ms 19036 KB Output is correct
41 Correct 10 ms 19036 KB Output is correct
42 Correct 5 ms 19056 KB Output is correct
43 Correct 5 ms 19036 KB Output is correct
44 Correct 4 ms 19036 KB Output is correct
45 Correct 5 ms 19036 KB Output is correct
46 Correct 4 ms 19036 KB Output is correct
47 Correct 4 ms 19060 KB Output is correct
48 Correct 4 ms 19032 KB Output is correct
49 Correct 5 ms 19044 KB Output is correct
50 Correct 4 ms 19036 KB Output is correct
51 Correct 5 ms 19036 KB Output is correct
52 Correct 4 ms 16988 KB Output is correct
53 Correct 4 ms 16988 KB Output is correct
54 Correct 7 ms 19304 KB Output is correct
55 Correct 5 ms 19292 KB Output is correct
56 Correct 136 ms 19124 KB Output is correct
57 Correct 225 ms 19088 KB Output is correct
58 Correct 5 ms 19032 KB Output is correct
59 Correct 7 ms 19036 KB Output is correct
60 Correct 177 ms 19036 KB Output is correct
61 Correct 205 ms 19084 KB Output is correct
62 Correct 6 ms 19036 KB Output is correct
63 Correct 5 ms 19036 KB Output is correct
64 Correct 255 ms 19052 KB Output is correct
65 Correct 119 ms 19388 KB Output is correct
66 Correct 6 ms 19036 KB Output is correct
67 Correct 5 ms 19036 KB Output is correct
68 Correct 101 ms 19140 KB Output is correct
69 Correct 95 ms 19148 KB Output is correct
70 Correct 190 ms 19036 KB Output is correct
71 Correct 190 ms 19032 KB Output is correct
72 Correct 5 ms 19032 KB Output is correct
73 Correct 5 ms 19036 KB Output is correct
74 Correct 27 ms 19032 KB Output is correct
75 Correct 19 ms 19036 KB Output is correct
76 Correct 7 ms 19052 KB Output is correct
77 Correct 5 ms 19216 KB Output is correct
78 Correct 189 ms 19116 KB Output is correct
79 Correct 185 ms 19100 KB Output is correct
80 Correct 273 ms 19036 KB Output is correct
81 Correct 283 ms 19036 KB Output is correct
82 Correct 39 ms 19172 KB Output is correct
83 Correct 34 ms 19032 KB Output is correct
84 Correct 182 ms 19104 KB Output is correct
85 Correct 267 ms 19052 KB Output is correct
86 Correct 105 ms 19032 KB Output is correct
87 Correct 29 ms 19036 KB Output is correct
88 Correct 110 ms 19056 KB Output is correct
89 Correct 125 ms 19152 KB Output is correct
90 Correct 170 ms 19132 KB Output is correct
91 Correct 187 ms 19116 KB Output is correct
92 Correct 5 ms 19032 KB Output is correct
93 Correct 5 ms 19036 KB Output is correct
94 Correct 5 ms 19048 KB Output is correct
95 Correct 6 ms 19036 KB Output is correct
96 Correct 5 ms 19036 KB Output is correct
97 Correct 5 ms 19032 KB Output is correct
98 Correct 5 ms 19288 KB Output is correct
99 Correct 5 ms 19044 KB Output is correct
100 Correct 5 ms 19036 KB Output is correct
101 Correct 6 ms 19036 KB Output is correct
102 Correct 4 ms 19036 KB Output is correct
103 Correct 4 ms 19036 KB Output is correct
104 Correct 4 ms 19036 KB Output is correct
105 Correct 4 ms 19036 KB Output is correct
106 Correct 4 ms 19032 KB Output is correct
107 Correct 4 ms 19036 KB Output is correct
108 Correct 4 ms 19036 KB Output is correct
109 Correct 4 ms 18884 KB Output is correct
110 Correct 4 ms 19036 KB Output is correct
111 Correct 5 ms 19052 KB Output is correct
112 Correct 4 ms 19288 KB Output is correct
113 Correct 4 ms 19032 KB Output is correct
114 Correct 5 ms 19032 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 32012 KB Output is correct
2 Correct 49 ms 31884 KB Output is correct
3 Correct 34 ms 27344 KB Output is correct
4 Correct 13 ms 20828 KB Output is correct
5 Correct 12 ms 19916 KB Output is correct
6 Correct 16 ms 21996 KB Output is correct
7 Correct 4 ms 19032 KB Output is correct
8 Correct 27 ms 22968 KB Output is correct
9 Correct 32 ms 25000 KB Output is correct
10 Correct 4 ms 19036 KB Output is correct
11 Correct 49 ms 26372 KB Output is correct
12 Correct 52 ms 29128 KB Output is correct
13 Correct 5 ms 19032 KB Output is correct
14 Correct 4 ms 19288 KB Output is correct
15 Correct 4 ms 19032 KB Output is correct
16 Correct 4 ms 19036 KB Output is correct
17 Correct 4 ms 19036 KB Output is correct
18 Correct 4 ms 19036 KB Output is correct
19 Correct 4 ms 19032 KB Output is correct
20 Correct 5 ms 19036 KB Output is correct
21 Correct 5 ms 19036 KB Output is correct
22 Correct 5 ms 19056 KB Output is correct
23 Correct 5 ms 19036 KB Output is correct
24 Correct 4 ms 19036 KB Output is correct
25 Correct 4 ms 19036 KB Output is correct
26 Correct 4 ms 19060 KB Output is correct
27 Correct 4 ms 19036 KB Output is correct
28 Correct 4 ms 16984 KB Output is correct
29 Correct 4 ms 19032 KB Output is correct
30 Correct 4 ms 19036 KB Output is correct
31 Correct 4 ms 19032 KB Output is correct
32 Correct 5 ms 19048 KB Output is correct
33 Correct 5 ms 18888 KB Output is correct
34 Correct 4 ms 19060 KB Output is correct
35 Correct 4 ms 19036 KB Output is correct
36 Correct 4 ms 19036 KB Output is correct
37 Correct 5 ms 19036 KB Output is correct
38 Correct 4 ms 19036 KB Output is correct
39 Correct 50 ms 31816 KB Output is correct
40 Correct 65 ms 31900 KB Output is correct
41 Correct 34 ms 27620 KB Output is correct
42 Correct 12 ms 20828 KB Output is correct
43 Correct 4 ms 19036 KB Output is correct
44 Correct 4 ms 19292 KB Output is correct
45 Correct 4 ms 19060 KB Output is correct
46 Correct 4 ms 19036 KB Output is correct
47 Correct 5 ms 19036 KB Output is correct
48 Correct 4 ms 18872 KB Output is correct
49 Correct 4 ms 19036 KB Output is correct
50 Correct 4 ms 19036 KB Output is correct
51 Correct 4 ms 19036 KB Output is correct
52 Correct 5 ms 19036 KB Output is correct
53 Correct 4 ms 19032 KB Output is correct
54 Correct 5 ms 19036 KB Output is correct
55 Correct 4 ms 19036 KB Output is correct
56 Correct 4 ms 19036 KB Output is correct
57 Correct 60 ms 23548 KB Output is correct
58 Correct 65 ms 23500 KB Output is correct
59 Correct 80 ms 23440 KB Output is correct
60 Correct 65 ms 23576 KB Output is correct
61 Correct 76 ms 23368 KB Output is correct
62 Correct 54 ms 23236 KB Output is correct
63 Correct 52 ms 23108 KB Output is correct
64 Correct 55 ms 23144 KB Output is correct
65 Correct 68 ms 23396 KB Output is correct
66 Correct 58 ms 23388 KB Output is correct
67 Correct 70 ms 23580 KB Output is correct
68 Correct 68 ms 23156 KB Output is correct
69 Correct 67 ms 23640 KB Output is correct
70 Correct 80 ms 23496 KB Output is correct
71 Correct 4 ms 16988 KB Output is correct
72 Correct 5 ms 19056 KB Output is correct
73 Correct 5 ms 19032 KB Output is correct
74 Correct 6 ms 19052 KB Output is correct
75 Correct 6 ms 19072 KB Output is correct
76 Correct 7 ms 19036 KB Output is correct
77 Correct 5 ms 19036 KB Output is correct
78 Correct 5 ms 19188 KB Output is correct
79 Correct 6 ms 19188 KB Output is correct
80 Correct 74 ms 23664 KB Output is correct
81 Correct 61 ms 23540 KB Output is correct
82 Correct 70 ms 23316 KB Output is correct
83 Correct 56 ms 23144 KB Output is correct
84 Correct 5 ms 19036 KB Output is correct
85 Correct 7 ms 19036 KB Output is correct
86 Correct 5 ms 19144 KB Output is correct
87 Correct 7 ms 19036 KB Output is correct
88 Correct 5 ms 19036 KB Output is correct
89 Correct 7 ms 19036 KB Output is correct
90 Correct 5 ms 19032 KB Output is correct
91 Correct 6 ms 19288 KB Output is correct
92 Correct 5 ms 19036 KB Output is correct
93 Correct 5 ms 19064 KB Output is correct
94 Correct 4 ms 19036 KB Output is correct
95 Correct 5 ms 19056 KB Output is correct
96 Correct 5 ms 19048 KB Output is correct
97 Correct 4 ms 19036 KB Output is correct
98 Correct 5 ms 19036 KB Output is correct
99 Correct 4 ms 19036 KB Output is correct
100 Correct 4 ms 19036 KB Output is correct
101 Correct 5 ms 19040 KB Output is correct
102 Correct 4 ms 19056 KB Output is correct
103 Correct 4 ms 19040 KB Output is correct
104 Correct 9 ms 19812 KB Output is correct
105 Correct 20 ms 21892 KB Output is correct
106 Correct 5 ms 19048 KB Output is correct
107 Correct 27 ms 23004 KB Output is correct
108 Correct 35 ms 25096 KB Output is correct
109 Correct 4 ms 19036 KB Output is correct
110 Correct 46 ms 26580 KB Output is correct
111 Correct 57 ms 29208 KB Output is correct
112 Correct 6 ms 19036 KB Output is correct
113 Correct 93 ms 32708 KB Output is correct
114 Execution timed out 1074 ms 21372 KB Time limit exceeded
115 Halted 0 ms 0 KB -