oj.uz

Submission #962315

# Submission time Handle Problem Language Result Execution time Memory
962315 2024-04-13T10:31:11 Z n3rm1n Dreaming (IOI13_dreaming) C++17
59 / 100
 1000 ms 39128 KB 
#include<bits/stdc++.h>
#include "dreaming.h"
using namespace std;
const long long MAXN = 5e5 + 10;
vector < pair < long long, long long > > g[MAXN];
long long mark[MAXN];
long long used[MAXN];
void dfs0(long long beg)
{
    mark[beg] = 1;
    used[beg] = 1;
    long long nb;
    for (long long i = 0; i < g[beg].size(); ++ i)
    {
        nb = g[beg][i].first;
        if(!used[nb])
            dfs0(nb);
    }
}
long long 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);
    }
}
long long maxdist = 0;
long long dfs(long long beg)
{
    used[beg] = 1;
    long long nb, distt;
    long long maxx = 0;
    for (long long 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 < long long, long long >  > path;
long long st, fi;
long long marked[MAXN];
long long dfs_form(long long beg, long long add)
{
    marked[beg] = 1;
    used[beg] = 1;
    if(beg == fi)
    {
        path.push_back(make_pair(beg, add));
        return 1;
    }
    long long nb, distt;
    long long found = 0;
    for (long long 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 (long long 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]));
    }

    long long 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);

        long long index1 = path[0].first;
        long long total1 = path[0].second;
        long long 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(long long int)':
dreaming.cpp:13:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for (long long 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<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for (int i = 0; i < g[beg].size(); ++ i)
      |                     ~~^~~~~~~~~~~~~~~
dreaming.cpp: In function 'long long int dfs(long long int)':
dreaming.cpp:43:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |     for (long long i = 0; i < g[beg].size(); ++ i)
      |                           ~~^~~~~~~~~~~~~~~
dreaming.cpp: In function 'long long int dfs_form(long long int, long long int)':
dreaming.cpp:65:29: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |     for (long long 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<long long int, long long 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

# Verdict Execution time Memory Grader output
1 Correct 54 ms 37576 KB Output is correct
2 Correct 55 ms 37736 KB Output is correct
3 Correct 36 ms 31436 KB Output is correct
4 Correct 11 ms 23384 KB Output is correct
5 Correct 10 ms 22104 KB Output is correct
6 Correct 19 ms 25036 KB Output is correct
7 Correct 5 ms 20828 KB Output is correct
8 Correct 29 ms 26232 KB Output is correct
9 Correct 48 ms 29136 KB Output is correct
10 Correct 5 ms 20828 KB Output is correct
11 Correct 56 ms 30924 KB Output is correct
12 Correct 64 ms 34760 KB Output is correct
13 Correct 7 ms 20824 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 20824 KB Output is correct
2 Correct 6 ms 20824 KB Output is correct
3 Correct 5 ms 20828 KB Output is correct
4 Correct 5 ms 20572 KB Output is correct
5 Correct 7 ms 20828 KB Output is correct
6 Correct 5 ms 20828 KB Output is correct
7 Correct 5 ms 20572 KB Output is correct
8 Correct 5 ms 20828 KB Output is correct
9 Correct 5 ms 20828 KB Output is correct
10 Correct 6 ms 20828 KB Output is correct
11 Correct 5 ms 20572 KB Output is correct
12 Correct 5 ms 20676 KB Output is correct
13 Correct 5 ms 20828 KB Output is correct
14 Correct 5 ms 20572 KB Output is correct
15 Correct 5 ms 18772 KB Output is correct
16 Correct 5 ms 20828 KB Output is correct
17 Correct 5 ms 21080 KB Output is correct
18 Correct 5 ms 20792 KB Output is correct
19 Correct 5 ms 20828 KB Output is correct
20 Correct 5 ms 20680 KB Output is correct
21 Correct 6 ms 20828 KB Output is correct
22 Correct 6 ms 20572 KB Output is correct
23 Correct 7 ms 20724 KB Output is correct
24 Correct 5 ms 20572 KB Output is correct
25 Correct 5 ms 20572 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 37576 KB Output is correct
2 Correct 55 ms 37736 KB Output is correct
3 Correct 36 ms 31436 KB Output is correct
4 Correct 11 ms 23384 KB Output is correct
5 Correct 10 ms 22104 KB Output is correct
6 Correct 19 ms 25036 KB Output is correct
7 Correct 5 ms 20828 KB Output is correct
8 Correct 29 ms 26232 KB Output is correct
9 Correct 48 ms 29136 KB Output is correct
10 Correct 5 ms 20828 KB Output is correct
11 Correct 56 ms 30924 KB Output is correct
12 Correct 64 ms 34760 KB Output is correct
13 Correct 7 ms 20824 KB Output is correct
14 Correct 5 ms 20824 KB Output is correct
15 Correct 6 ms 20824 KB Output is correct
16 Correct 5 ms 20828 KB Output is correct
17 Correct 5 ms 20572 KB Output is correct
18 Correct 7 ms 20828 KB Output is correct
19 Correct 5 ms 20828 KB Output is correct
20 Correct 5 ms 20572 KB Output is correct
21 Correct 5 ms 20828 KB Output is correct
22 Correct 5 ms 20828 KB Output is correct
23 Correct 6 ms 20828 KB Output is correct
24 Correct 5 ms 20572 KB Output is correct
25 Correct 5 ms 20676 KB Output is correct
26 Correct 5 ms 20828 KB Output is correct
27 Correct 5 ms 20572 KB Output is correct
28 Correct 5 ms 18772 KB Output is correct
29 Correct 5 ms 20828 KB Output is correct
30 Correct 5 ms 21080 KB Output is correct
31 Correct 5 ms 20792 KB Output is correct
32 Correct 5 ms 20828 KB Output is correct
33 Correct 5 ms 20680 KB Output is correct
34 Correct 6 ms 20828 KB Output is correct
35 Correct 6 ms 20572 KB Output is correct
36 Correct 7 ms 20724 KB Output is correct
37 Correct 5 ms 20572 KB Output is correct
38 Correct 5 ms 20572 KB Output is correct
39 Correct 52 ms 37536 KB Output is correct
40 Correct 56 ms 37968 KB Output is correct
41 Correct 37 ms 31692 KB Output is correct
42 Correct 11 ms 23388 KB Output is correct
43 Correct 5 ms 20828 KB Output is correct
44 Correct 6 ms 20828 KB Output is correct
45 Correct 5 ms 20824 KB Output is correct
46 Correct 5 ms 20824 KB Output is correct
47 Correct 5 ms 20828 KB Output is correct
48 Correct 6 ms 20828 KB Output is correct
49 Correct 5 ms 20828 KB Output is correct
50 Correct 5 ms 20828 KB Output is correct
51 Correct 5 ms 20824 KB Output is correct
52 Correct 5 ms 20828 KB Output is correct
53 Correct 5 ms 20828 KB Output is correct
54 Correct 5 ms 20572 KB Output is correct
55 Correct 9 ms 20828 KB Output is correct
56 Correct 5 ms 20572 KB Output is correct
57 Correct 69 ms 27280 KB Output is correct
58 Correct 73 ms 27172 KB Output is correct
59 Correct 66 ms 26960 KB Output is correct
60 Correct 70 ms 26936 KB Output is correct
61 Correct 83 ms 26800 KB Output is correct
62 Correct 62 ms 26708 KB Output is correct
63 Correct 54 ms 26476 KB Output is correct
64 Correct 65 ms 26192 KB Output is correct
65 Correct 72 ms 26648 KB Output is correct
66 Correct 72 ms 26880 KB Output is correct
67 Correct 63 ms 26996 KB Output is correct
68 Correct 77 ms 26712 KB Output is correct
69 Correct 68 ms 27208 KB Output is correct
70 Correct 68 ms 26876 KB Output is correct
71 Correct 5 ms 18780 KB Output is correct
72 Correct 7 ms 20828 KB Output is correct
73 Correct 6 ms 20828 KB Output is correct
74 Correct 6 ms 21012 KB Output is correct
75 Correct 7 ms 21024 KB Output is correct
76 Correct 7 ms 20828 KB Output is correct
77 Correct 7 ms 20828 KB Output is correct
78 Correct 6 ms 20828 KB Output is correct
79 Correct 7 ms 20824 KB Output is correct
80 Correct 68 ms 27092 KB Output is correct
81 Correct 70 ms 27024 KB Output is correct
82 Correct 68 ms 26692 KB Output is correct
83 Correct 62 ms 26460 KB Output is correct
84 Correct 6 ms 20828 KB Output is correct
85 Correct 6 ms 20952 KB Output is correct
86 Correct 7 ms 20816 KB Output is correct
87 Correct 6 ms 20828 KB Output is correct
88 Correct 7 ms 20828 KB Output is correct
89 Correct 8 ms 20828 KB Output is correct
90 Correct 6 ms 20908 KB Output is correct
91 Correct 7 ms 20828 KB Output is correct
92 Correct 7 ms 20828 KB Output is correct
93 Correct 6 ms 20828 KB Output is correct
94 Correct 5 ms 20828 KB Output is correct
95 Correct 5 ms 20668 KB Output is correct
96 Correct 5 ms 20824 KB Output is correct
97 Correct 5 ms 20572 KB Output is correct
98 Correct 5 ms 20828 KB Output is correct
99 Correct 5 ms 20828 KB Output is correct
100 Correct 5 ms 21024 KB Output is correct
101 Correct 7 ms 20828 KB Output is correct
102 Correct 5 ms 20828 KB Output is correct
103 Correct 5 ms 20808 KB Output is correct
104 Correct 11 ms 22104 KB Output is correct
105 Correct 18 ms 24792 KB Output is correct
106 Correct 5 ms 20828 KB Output is correct
107 Correct 30 ms 26384 KB Output is correct
108 Correct 44 ms 29080 KB Output is correct
109 Correct 5 ms 20828 KB Output is correct
110 Correct 53 ms 30920 KB Output is correct
111 Correct 64 ms 34760 KB Output is correct
112 Correct 6 ms 20828 KB Output is correct
113 Correct 94 ms 39128 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1055 ms 23180 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 20824 KB Output is correct
2 Correct 6 ms 20824 KB Output is correct
3 Correct 5 ms 20828 KB Output is correct
4 Correct 5 ms 20572 KB Output is correct
5 Correct 7 ms 20828 KB Output is correct
6 Correct 5 ms 20828 KB Output is correct
7 Correct 5 ms 20572 KB Output is correct
8 Correct 5 ms 20828 KB Output is correct
9 Correct 5 ms 20828 KB Output is correct
10 Correct 6 ms 20828 KB Output is correct
11 Correct 5 ms 20572 KB Output is correct
12 Correct 5 ms 20676 KB Output is correct
13 Correct 5 ms 20828 KB Output is correct
14 Correct 5 ms 20572 KB Output is correct
15 Correct 5 ms 18772 KB Output is correct
16 Correct 5 ms 20828 KB Output is correct
17 Correct 5 ms 21080 KB Output is correct
18 Correct 5 ms 20792 KB Output is correct
19 Correct 5 ms 20828 KB Output is correct
20 Correct 5 ms 20680 KB Output is correct
21 Correct 6 ms 20828 KB Output is correct
22 Correct 6 ms 20572 KB Output is correct
23 Correct 7 ms 20724 KB Output is correct
24 Correct 5 ms 20572 KB Output is correct
25 Correct 5 ms 20572 KB Output is correct
26 Correct 41 ms 21076 KB Output is correct
27 Correct 64 ms 20896 KB Output is correct
28 Correct 97 ms 20824 KB Output is correct
29 Correct 36 ms 20824 KB Output is correct
30 Correct 61 ms 20824 KB Output is correct
31 Correct 91 ms 20964 KB Output is correct
32 Correct 31 ms 20784 KB Output is correct
33 Correct 62 ms 20896 KB Output is correct
34 Correct 80 ms 20824 KB Output is correct
35 Correct 5 ms 20572 KB Output is correct
36 Correct 5 ms 20832 KB Output is correct
37 Correct 5 ms 20824 KB Output is correct
38 Correct 5 ms 20824 KB Output is correct
39 Correct 5 ms 20828 KB Output is correct
40 Correct 27 ms 20828 KB Output is correct
41 Correct 23 ms 20828 KB Output is correct
42 Correct 6 ms 20828 KB Output is correct
43 Correct 5 ms 20828 KB Output is correct
44 Correct 5 ms 20572 KB Output is correct
45 Correct 5 ms 20828 KB Output is correct
46 Correct 5 ms 20828 KB Output is correct
47 Correct 5 ms 20828 KB Output is correct
48 Correct 5 ms 20828 KB Output is correct
49 Correct 5 ms 20572 KB Output is correct
50 Correct 5 ms 20572 KB Output is correct
51 Correct 5 ms 20572 KB Output is correct
52 Correct 5 ms 18524 KB Output is correct
53 Correct 5 ms 18616 KB Output is correct
54 Correct 7 ms 21340 KB Output is correct
55 Correct 8 ms 21324 KB Output is correct
56 Correct 258 ms 20900 KB Output is correct
57 Correct 467 ms 21104 KB Output is correct
58 Correct 7 ms 20824 KB Output is correct
59 Correct 7 ms 20824 KB Output is correct
60 Correct 336 ms 20892 KB Output is correct
61 Correct 425 ms 20880 KB Output is correct
62 Correct 7 ms 20828 KB Output is correct
63 Correct 7 ms 21024 KB Output is correct
64 Correct 537 ms 21076 KB Output is correct
65 Correct 225 ms 20924 KB Output is correct
66 Correct 6 ms 20828 KB Output is correct
67 Correct 6 ms 20828 KB Output is correct
68 Correct 211 ms 20912 KB Output is correct
69 Correct 182 ms 20932 KB Output is correct
70 Correct 390 ms 21132 KB Output is correct
71 Correct 376 ms 20876 KB Output is correct
72 Correct 8 ms 20828 KB Output is correct
73 Correct 6 ms 20828 KB Output is correct
74 Correct 43 ms 20984 KB Output is correct
75 Correct 34 ms 20988 KB Output is correct
76 Correct 8 ms 20824 KB Output is correct
77 Correct 7 ms 20828 KB Output is correct
78 Correct 372 ms 20856 KB Output is correct
79 Correct 384 ms 21120 KB Output is correct
80 Correct 535 ms 20828 KB Output is correct
81 Correct 564 ms 20844 KB Output is correct
82 Correct 73 ms 20980 KB Output is correct
83 Correct 67 ms 20968 KB Output is correct
84 Correct 371 ms 20856 KB Output is correct
85 Correct 519 ms 20848 KB Output is correct
86 Correct 211 ms 20912 KB Output is correct
87 Correct 54 ms 20972 KB Output is correct
88 Correct 225 ms 20928 KB Output is correct
89 Correct 248 ms 20928 KB Output is correct
90 Correct 337 ms 20896 KB Output is correct
91 Correct 382 ms 20900 KB Output is correct
92 Correct 7 ms 21080 KB Output is correct
93 Correct 6 ms 20828 KB Output is correct
94 Correct 7 ms 20828 KB Output is correct
95 Correct 6 ms 20828 KB Output is correct
96 Correct 6 ms 20824 KB Output is correct
97 Correct 6 ms 20828 KB Output is correct
98 Correct 8 ms 20860 KB Output is correct
99 Correct 6 ms 20828 KB Output is correct
100 Correct 6 ms 20828 KB Output is correct
101 Correct 6 ms 20816 KB Output is correct
102 Correct 5 ms 20572 KB Output is correct
103 Correct 7 ms 20824 KB Output is correct
104 Correct 5 ms 20828 KB Output is correct
105 Correct 5 ms 20568 KB Output is correct
106 Correct 5 ms 20828 KB Output is correct
107 Correct 6 ms 20664 KB Output is correct
108 Correct 5 ms 20676 KB Output is correct
109 Correct 6 ms 20804 KB Output is correct
110 Correct 5 ms 20824 KB Output is correct
111 Correct 5 ms 20732 KB Output is correct
112 Correct 5 ms 20828 KB Output is correct
113 Correct 5 ms 21080 KB Output is correct
114 Correct 5 ms 20824 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 37576 KB Output is correct
2 Correct 55 ms 37736 KB Output is correct
3 Correct 36 ms 31436 KB Output is correct
4 Correct 11 ms 23384 KB Output is correct
5 Correct 10 ms 22104 KB Output is correct
6 Correct 19 ms 25036 KB Output is correct
7 Correct 5 ms 20828 KB Output is correct
8 Correct 29 ms 26232 KB Output is correct
9 Correct 48 ms 29136 KB Output is correct
10 Correct 5 ms 20828 KB Output is correct
11 Correct 56 ms 30924 KB Output is correct
12 Correct 64 ms 34760 KB Output is correct
13 Correct 7 ms 20824 KB Output is correct
14 Correct 5 ms 20824 KB Output is correct
15 Correct 6 ms 20824 KB Output is correct
16 Correct 5 ms 20828 KB Output is correct
17 Correct 5 ms 20572 KB Output is correct
18 Correct 7 ms 20828 KB Output is correct
19 Correct 5 ms 20828 KB Output is correct
20 Correct 5 ms 20572 KB Output is correct
21 Correct 5 ms 20828 KB Output is correct
22 Correct 5 ms 20828 KB Output is correct
23 Correct 6 ms 20828 KB Output is correct
24 Correct 5 ms 20572 KB Output is correct
25 Correct 5 ms 20676 KB Output is correct
26 Correct 5 ms 20828 KB Output is correct
27 Correct 5 ms 20572 KB Output is correct
28 Correct 5 ms 18772 KB Output is correct
29 Correct 5 ms 20828 KB Output is correct
30 Correct 5 ms 21080 KB Output is correct
31 Correct 5 ms 20792 KB Output is correct
32 Correct 5 ms 20828 KB Output is correct
33 Correct 5 ms 20680 KB Output is correct
34 Correct 6 ms 20828 KB Output is correct
35 Correct 6 ms 20572 KB Output is correct
36 Correct 7 ms 20724 KB Output is correct
37 Correct 5 ms 20572 KB Output is correct
38 Correct 5 ms 20572 KB Output is correct
39 Correct 52 ms 37536 KB Output is correct
40 Correct 56 ms 37968 KB Output is correct
41 Correct 37 ms 31692 KB Output is correct
42 Correct 11 ms 23388 KB Output is correct
43 Correct 5 ms 20828 KB Output is correct
44 Correct 6 ms 20828 KB Output is correct
45 Correct 5 ms 20824 KB Output is correct
46 Correct 5 ms 20824 KB Output is correct
47 Correct 5 ms 20828 KB Output is correct
48 Correct 6 ms 20828 KB Output is correct
49 Correct 5 ms 20828 KB Output is correct
50 Correct 5 ms 20828 KB Output is correct
51 Correct 5 ms 20824 KB Output is correct
52 Correct 5 ms 20828 KB Output is correct
53 Correct 5 ms 20828 KB Output is correct
54 Correct 5 ms 20572 KB Output is correct
55 Correct 9 ms 20828 KB Output is correct
56 Correct 5 ms 20572 KB Output is correct
57 Correct 69 ms 27280 KB Output is correct
58 Correct 73 ms 27172 KB Output is correct
59 Correct 66 ms 26960 KB Output is correct
60 Correct 70 ms 26936 KB Output is correct
61 Correct 83 ms 26800 KB Output is correct
62 Correct 62 ms 26708 KB Output is correct
63 Correct 54 ms 26476 KB Output is correct
64 Correct 65 ms 26192 KB Output is correct
65 Correct 72 ms 26648 KB Output is correct
66 Correct 72 ms 26880 KB Output is correct
67 Correct 63 ms 26996 KB Output is correct
68 Correct 77 ms 26712 KB Output is correct
69 Correct 68 ms 27208 KB Output is correct
70 Correct 68 ms 26876 KB Output is correct
71 Correct 5 ms 18780 KB Output is correct
72 Correct 7 ms 20828 KB Output is correct
73 Correct 6 ms 20828 KB Output is correct
74 Correct 6 ms 21012 KB Output is correct
75 Correct 7 ms 21024 KB Output is correct
76 Correct 7 ms 20828 KB Output is correct
77 Correct 7 ms 20828 KB Output is correct
78 Correct 6 ms 20828 KB Output is correct
79 Correct 7 ms 20824 KB Output is correct
80 Correct 68 ms 27092 KB Output is correct
81 Correct 70 ms 27024 KB Output is correct
82 Correct 68 ms 26692 KB Output is correct
83 Correct 62 ms 26460 KB Output is correct
84 Correct 6 ms 20828 KB Output is correct
85 Correct 6 ms 20952 KB Output is correct
86 Correct 7 ms 20816 KB Output is correct
87 Correct 6 ms 20828 KB Output is correct
88 Correct 7 ms 20828 KB Output is correct
89 Correct 8 ms 20828 KB Output is correct
90 Correct 6 ms 20908 KB Output is correct
91 Correct 7 ms 20828 KB Output is correct
92 Correct 7 ms 20828 KB Output is correct
93 Correct 6 ms 20828 KB Output is correct
94 Correct 5 ms 20828 KB Output is correct
95 Correct 5 ms 20668 KB Output is correct
96 Correct 5 ms 20824 KB Output is correct
97 Correct 5 ms 20572 KB Output is correct
98 Correct 5 ms 20828 KB Output is correct
99 Correct 5 ms 20828 KB Output is correct
100 Correct 5 ms 21024 KB Output is correct
101 Correct 7 ms 20828 KB Output is correct
102 Correct 5 ms 20828 KB Output is correct
103 Correct 5 ms 20808 KB Output is correct
104 Correct 11 ms 22104 KB Output is correct
105 Correct 18 ms 24792 KB Output is correct
106 Correct 5 ms 20828 KB Output is correct
107 Correct 30 ms 26384 KB Output is correct
108 Correct 44 ms 29080 KB Output is correct
109 Correct 5 ms 20828 KB Output is correct
110 Correct 53 ms 30920 KB Output is correct
111 Correct 64 ms 34760 KB Output is correct
112 Correct 6 ms 20828 KB Output is correct
113 Correct 94 ms 39128 KB Output is correct
114 Execution timed out 1055 ms 23180 KB Time limit exceeded
115 Halted 0 ms 0 KB -