oj.uz

Submission #962337

# Submission time Handle Problem Language Result Execution time Memory
962337 2024-04-13T10:47:33 Z n3rm1n Dreaming (IOI13_dreaming) C++17
59 / 100
 1000 ms 18608 KB 
#include<bits/stdc++.h>
#include "dreaming.h"
using namespace std;
const int MAXN = 1e5 + 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;

    vector < 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_back(make_pair(best1, index1));
       // cout << "component " << best1 << "  " << index1 << endl;
    }
    sort(pq.begin(), pq.end());

    int sz = pq.size();
    int diam1, ii1;
    int diam2, ii2;
    int neww;
    for (int i = pq.size()-1; i >= 1; -- i)
    {
        diam1 = pq[i].first;
        ii1 = pq[i].second;

        diam2 = pq[i-1].first;
        ii2 = pq[i-1].second;



        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[i-1] = make_pair(neww, ii1);
        else pq[i-1] = 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:152:22: warning: unused variable 'bb1' [-Wunused-variable]
  152 |         int aa1 = 0, bb1 = 0;
      |                      ^~~
dreaming.cpp:153:13: warning: unused variable 'aa2' [-Wunused-variable]
  153 |         int aa2 = 0, bb2 = 0;
      |             ^~~
dreaming.cpp:153:22: warning: unused variable 'bb2' [-Wunused-variable]
  153 |         int aa2 = 0, bb2 = 0;
      |                      ^~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 17844 KB Output is correct
2 Correct 43 ms 17868 KB Output is correct
3 Correct 32 ms 13336 KB Output is correct
4 Correct 7 ms 6744 KB Output is correct
5 Correct 6 ms 5724 KB Output is correct
6 Correct 12 ms 7780 KB Output is correct
7 Correct 1 ms 5208 KB Output is correct
8 Correct 22 ms 9000 KB Output is correct
9 Correct 31 ms 10964 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 43 ms 12416 KB Output is correct
12 Correct 48 ms 15064 KB Output is correct
13 Correct 2 ms 4952 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 2 ms 4744 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 5208 KB Output is correct
12 Correct 1 ms 4952 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 2 ms 4956 KB Output is correct
17 Correct 1 ms 4956 KB Output is correct
18 Correct 2 ms 4956 KB Output is correct
19 Correct 1 ms 4968 KB Output is correct
20 Correct 1 ms 4956 KB Output is correct
21 Correct 1 ms 4956 KB Output is correct
22 Correct 1 ms 4956 KB Output is correct
23 Correct 1 ms 4956 KB Output is correct
24 Correct 1 ms 4956 KB Output is correct
25 Correct 1 ms 4968 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 17844 KB Output is correct
2 Correct 43 ms 17868 KB Output is correct
3 Correct 32 ms 13336 KB Output is correct
4 Correct 7 ms 6744 KB Output is correct
5 Correct 6 ms 5724 KB Output is correct
6 Correct 12 ms 7780 KB Output is correct
7 Correct 1 ms 5208 KB Output is correct
8 Correct 22 ms 9000 KB Output is correct
9 Correct 31 ms 10964 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 43 ms 12416 KB Output is correct
12 Correct 48 ms 15064 KB Output is correct
13 Correct 2 ms 4952 KB Output is correct
14 Correct 1 ms 4952 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 1 ms 4956 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 2 ms 4744 KB Output is correct
20 Correct 2 ms 4956 KB Output is correct
21 Correct 1 ms 4956 KB Output is correct
22 Correct 1 ms 4956 KB Output is correct
23 Correct 1 ms 4956 KB Output is correct
24 Correct 1 ms 5208 KB Output is correct
25 Correct 1 ms 4952 KB Output is correct
26 Correct 1 ms 4956 KB Output is correct
27 Correct 1 ms 4956 KB Output is correct
28 Correct 1 ms 4956 KB Output is correct
29 Correct 2 ms 4956 KB Output is correct
30 Correct 1 ms 4956 KB Output is correct
31 Correct 2 ms 4956 KB Output is correct
32 Correct 1 ms 4968 KB Output is correct
33 Correct 1 ms 4956 KB Output is correct
34 Correct 1 ms 4956 KB Output is correct
35 Correct 1 ms 4956 KB Output is correct
36 Correct 1 ms 4956 KB Output is correct
37 Correct 1 ms 4956 KB Output is correct
38 Correct 1 ms 4968 KB Output is correct
39 Correct 48 ms 17872 KB Output is correct
40 Correct 50 ms 17924 KB Output is correct
41 Correct 27 ms 13288 KB Output is correct
42 Correct 8 ms 6760 KB Output is correct
43 Correct 1 ms 4952 KB Output is correct
44 Correct 1 ms 4952 KB Output is correct
45 Correct 1 ms 4956 KB Output is correct
46 Correct 1 ms 4956 KB Output is correct
47 Correct 1 ms 4956 KB Output is correct
48 Correct 1 ms 4788 KB Output is correct
49 Correct 1 ms 4956 KB Output is correct
50 Correct 1 ms 4956 KB Output is correct
51 Correct 1 ms 4956 KB Output is correct
52 Correct 1 ms 4960 KB Output is correct
53 Correct 2 ms 4956 KB Output is correct
54 Correct 1 ms 4956 KB Output is correct
55 Correct 1 ms 4956 KB Output is correct
56 Correct 1 ms 4956 KB Output is correct
57 Correct 52 ms 9468 KB Output is correct
58 Correct 50 ms 9296 KB Output is correct
59 Correct 51 ms 9320 KB Output is correct
60 Correct 55 ms 9540 KB Output is correct
61 Correct 48 ms 9220 KB Output is correct
62 Correct 49 ms 9304 KB Output is correct
63 Correct 46 ms 9064 KB Output is correct
64 Correct 44 ms 9044 KB Output is correct
65 Correct 63 ms 9284 KB Output is correct
66 Correct 46 ms 9424 KB Output is correct
67 Correct 51 ms 9264 KB Output is correct
68 Correct 52 ms 9036 KB Output is correct
69 Correct 68 ms 9964 KB Output is correct
70 Correct 51 ms 9308 KB Output is correct
71 Correct 1 ms 4956 KB Output is correct
72 Correct 2 ms 4972 KB Output is correct
73 Correct 2 ms 5208 KB Output is correct
74 Correct 2 ms 4956 KB Output is correct
75 Correct 2 ms 4952 KB Output is correct
76 Correct 2 ms 4956 KB Output is correct
77 Correct 2 ms 4956 KB Output is correct
78 Correct 2 ms 4956 KB Output is correct
79 Correct 2 ms 4956 KB Output is correct
80 Correct 60 ms 9536 KB Output is correct
81 Correct 50 ms 9420 KB Output is correct
82 Correct 52 ms 9044 KB Output is correct
83 Correct 51 ms 9100 KB Output is correct
84 Correct 2 ms 4956 KB Output is correct
85 Correct 2 ms 4956 KB Output is correct
86 Correct 3 ms 4956 KB Output is correct
87 Correct 2 ms 4956 KB Output is correct
88 Correct 2 ms 4956 KB Output is correct
89 Correct 2 ms 4956 KB Output is correct
90 Correct 2 ms 4956 KB Output is correct
91 Correct 2 ms 4956 KB Output is correct
92 Correct 2 ms 4956 KB Output is correct
93 Correct 2 ms 4956 KB Output is correct
94 Correct 1 ms 4952 KB Output is correct
95 Correct 1 ms 4952 KB Output is correct
96 Correct 1 ms 4956 KB Output is correct
97 Correct 1 ms 4956 KB Output is correct
98 Correct 1 ms 4784 KB Output is correct
99 Correct 1 ms 4956 KB Output is correct
100 Correct 1 ms 4952 KB Output is correct
101 Correct 1 ms 4956 KB Output is correct
102 Correct 1 ms 4952 KB Output is correct
103 Correct 1 ms 4956 KB Output is correct
104 Correct 6 ms 5820 KB Output is correct
105 Correct 12 ms 7772 KB Output is correct
106 Correct 1 ms 4956 KB Output is correct
107 Correct 21 ms 8892 KB Output is correct
108 Correct 29 ms 10972 KB Output is correct
109 Correct 1 ms 5208 KB Output is correct
110 Correct 43 ms 12508 KB Output is correct
111 Correct 45 ms 15312 KB Output is correct
112 Correct 2 ms 5004 KB Output is correct
113 Correct 62 ms 18608 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 938 ms 9104 KB Output is correct
2 Correct 921 ms 8992 KB Output is correct
3 Correct 941 ms 8844 KB Output is correct
4 Correct 914 ms 8832 KB Output is correct
5 Correct 929 ms 8932 KB Output is correct
6 Correct 979 ms 9656 KB Output is correct
7 Correct 966 ms 9156 KB Output is correct
8 Correct 931 ms 8948 KB Output is correct
9 Execution timed out 1008 ms 8800 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4952 KB Output is correct
2 Correct 1 ms 4956 KB Output is correct
3 Correct 1 ms 4956 KB Output is correct
4 Correct 1 ms 4956 KB Output is correct
5 Correct 1 ms 4956 KB Output is correct
6 Correct 2 ms 4744 KB Output is correct
7 Correct 2 ms 4956 KB Output is correct
8 Correct 1 ms 4956 KB Output is correct
9 Correct 1 ms 4956 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 1 ms 5208 KB Output is correct
12 Correct 1 ms 4952 KB Output is correct
13 Correct 1 ms 4956 KB Output is correct
14 Correct 1 ms 4956 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 2 ms 4956 KB Output is correct
17 Correct 1 ms 4956 KB Output is correct
18 Correct 2 ms 4956 KB Output is correct
19 Correct 1 ms 4968 KB Output is correct
20 Correct 1 ms 4956 KB Output is correct
21 Correct 1 ms 4956 KB Output is correct
22 Correct 1 ms 4956 KB Output is correct
23 Correct 1 ms 4956 KB Output is correct
24 Correct 1 ms 4956 KB Output is correct
25 Correct 1 ms 4968 KB Output is correct
26 Correct 4 ms 4976 KB Output is correct
27 Correct 6 ms 4956 KB Output is correct
28 Correct 9 ms 4952 KB Output is correct
29 Correct 4 ms 4956 KB Output is correct
30 Correct 6 ms 4956 KB Output is correct
31 Correct 8 ms 4956 KB Output is correct
32 Correct 3 ms 4956 KB Output is correct
33 Correct 6 ms 4956 KB Output is correct
34 Correct 8 ms 4956 KB Output is correct
35 Correct 1 ms 4956 KB Output is correct
36 Correct 1 ms 4956 KB Output is correct
37 Correct 1 ms 4956 KB Output is correct
38 Correct 1 ms 4956 KB Output is correct
39 Correct 1 ms 4956 KB Output is correct
40 Correct 3 ms 4948 KB Output is correct
41 Correct 2 ms 4956 KB Output is correct
42 Correct 2 ms 4956 KB Output is correct
43 Correct 2 ms 4956 KB Output is correct
44 Correct 1 ms 4956 KB Output is correct
45 Correct 1 ms 4956 KB Output is correct
46 Correct 2 ms 4956 KB Output is correct
47 Correct 1 ms 4956 KB Output is correct
48 Correct 1 ms 4956 KB Output is correct
49 Correct 1 ms 4956 KB Output is correct
50 Correct 1 ms 4952 KB Output is correct
51 Correct 1 ms 4956 KB Output is correct
52 Correct 2 ms 4956 KB Output is correct
53 Correct 1 ms 4956 KB Output is correct
54 Correct 2 ms 5212 KB Output is correct
55 Correct 2 ms 5212 KB Output is correct
56 Correct 20 ms 4952 KB Output is correct
57 Correct 35 ms 5024 KB Output is correct
58 Correct 2 ms 4956 KB Output is correct
59 Correct 3 ms 5004 KB Output is correct
60 Correct 26 ms 4956 KB Output is correct
61 Correct 32 ms 4956 KB Output is correct
62 Correct 3 ms 4956 KB Output is correct
63 Correct 2 ms 4956 KB Output is correct
64 Correct 41 ms 5004 KB Output is correct
65 Correct 18 ms 5044 KB Output is correct
66 Correct 2 ms 4956 KB Output is correct
67 Correct 2 ms 4956 KB Output is correct
68 Correct 17 ms 5072 KB Output is correct
69 Correct 16 ms 4956 KB Output is correct
70 Correct 30 ms 4956 KB Output is correct
71 Correct 29 ms 4956 KB Output is correct
72 Correct 2 ms 4952 KB Output is correct
73 Correct 2 ms 4956 KB Output is correct
74 Correct 7 ms 5088 KB Output is correct
75 Correct 4 ms 4956 KB Output is correct
76 Correct 2 ms 4952 KB Output is correct
77 Correct 2 ms 4956 KB Output is correct
78 Correct 30 ms 5048 KB Output is correct
79 Correct 33 ms 5300 KB Output is correct
80 Correct 41 ms 4952 KB Output is correct
81 Correct 45 ms 4996 KB Output is correct
82 Correct 7 ms 4956 KB Output is correct
83 Correct 7 ms 5096 KB Output is correct
84 Correct 30 ms 4952 KB Output is correct
85 Correct 39 ms 4980 KB Output is correct
86 Correct 20 ms 5056 KB Output is correct
87 Correct 6 ms 4956 KB Output is correct
88 Correct 19 ms 5072 KB Output is correct
89 Correct 20 ms 4956 KB Output is correct
90 Correct 28 ms 4952 KB Output is correct
91 Correct 29 ms 4956 KB Output is correct
92 Correct 2 ms 4956 KB Output is correct
93 Correct 2 ms 4952 KB Output is correct
94 Correct 2 ms 4956 KB Output is correct
95 Correct 3 ms 4956 KB Output is correct
96 Correct 2 ms 4956 KB Output is correct
97 Correct 2 ms 4956 KB Output is correct
98 Correct 2 ms 5108 KB Output is correct
99 Correct 2 ms 4956 KB Output is correct
100 Correct 3 ms 4984 KB Output is correct
101 Correct 2 ms 4956 KB Output is correct
102 Correct 1 ms 4956 KB Output is correct
103 Correct 1 ms 4956 KB Output is correct
104 Correct 1 ms 4956 KB Output is correct
105 Correct 1 ms 4956 KB Output is correct
106 Correct 1 ms 4956 KB Output is correct
107 Correct 1 ms 4956 KB Output is correct
108 Correct 1 ms 4956 KB Output is correct
109 Correct 1 ms 4952 KB Output is correct
110 Correct 2 ms 5208 KB Output is correct
111 Correct 1 ms 4952 KB Output is correct
112 Correct 2 ms 4956 KB Output is correct
113 Correct 1 ms 4952 KB Output is correct
114 Correct 2 ms 4956 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 17844 KB Output is correct
2 Correct 43 ms 17868 KB Output is correct
3 Correct 32 ms 13336 KB Output is correct
4 Correct 7 ms 6744 KB Output is correct
5 Correct 6 ms 5724 KB Output is correct
6 Correct 12 ms 7780 KB Output is correct
7 Correct 1 ms 5208 KB Output is correct
8 Correct 22 ms 9000 KB Output is correct
9 Correct 31 ms 10964 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 43 ms 12416 KB Output is correct
12 Correct 48 ms 15064 KB Output is correct
13 Correct 2 ms 4952 KB Output is correct
14 Correct 1 ms 4952 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 1 ms 4956 KB Output is correct
17 Correct 1 ms 4956 KB Output is correct
18 Correct 1 ms 4956 KB Output is correct
19 Correct 2 ms 4744 KB Output is correct
20 Correct 2 ms 4956 KB Output is correct
21 Correct 1 ms 4956 KB Output is correct
22 Correct 1 ms 4956 KB Output is correct
23 Correct 1 ms 4956 KB Output is correct
24 Correct 1 ms 5208 KB Output is correct
25 Correct 1 ms 4952 KB Output is correct
26 Correct 1 ms 4956 KB Output is correct
27 Correct 1 ms 4956 KB Output is correct
28 Correct 1 ms 4956 KB Output is correct
29 Correct 2 ms 4956 KB Output is correct
30 Correct 1 ms 4956 KB Output is correct
31 Correct 2 ms 4956 KB Output is correct
32 Correct 1 ms 4968 KB Output is correct
33 Correct 1 ms 4956 KB Output is correct
34 Correct 1 ms 4956 KB Output is correct
35 Correct 1 ms 4956 KB Output is correct
36 Correct 1 ms 4956 KB Output is correct
37 Correct 1 ms 4956 KB Output is correct
38 Correct 1 ms 4968 KB Output is correct
39 Correct 48 ms 17872 KB Output is correct
40 Correct 50 ms 17924 KB Output is correct
41 Correct 27 ms 13288 KB Output is correct
42 Correct 8 ms 6760 KB Output is correct
43 Correct 1 ms 4952 KB Output is correct
44 Correct 1 ms 4952 KB Output is correct
45 Correct 1 ms 4956 KB Output is correct
46 Correct 1 ms 4956 KB Output is correct
47 Correct 1 ms 4956 KB Output is correct
48 Correct 1 ms 4788 KB Output is correct
49 Correct 1 ms 4956 KB Output is correct
50 Correct 1 ms 4956 KB Output is correct
51 Correct 1 ms 4956 KB Output is correct
52 Correct 1 ms 4960 KB Output is correct
53 Correct 2 ms 4956 KB Output is correct
54 Correct 1 ms 4956 KB Output is correct
55 Correct 1 ms 4956 KB Output is correct
56 Correct 1 ms 4956 KB Output is correct
57 Correct 52 ms 9468 KB Output is correct
58 Correct 50 ms 9296 KB Output is correct
59 Correct 51 ms 9320 KB Output is correct
60 Correct 55 ms 9540 KB Output is correct
61 Correct 48 ms 9220 KB Output is correct
62 Correct 49 ms 9304 KB Output is correct
63 Correct 46 ms 9064 KB Output is correct
64 Correct 44 ms 9044 KB Output is correct
65 Correct 63 ms 9284 KB Output is correct
66 Correct 46 ms 9424 KB Output is correct
67 Correct 51 ms 9264 KB Output is correct
68 Correct 52 ms 9036 KB Output is correct
69 Correct 68 ms 9964 KB Output is correct
70 Correct 51 ms 9308 KB Output is correct
71 Correct 1 ms 4956 KB Output is correct
72 Correct 2 ms 4972 KB Output is correct
73 Correct 2 ms 5208 KB Output is correct
74 Correct 2 ms 4956 KB Output is correct
75 Correct 2 ms 4952 KB Output is correct
76 Correct 2 ms 4956 KB Output is correct
77 Correct 2 ms 4956 KB Output is correct
78 Correct 2 ms 4956 KB Output is correct
79 Correct 2 ms 4956 KB Output is correct
80 Correct 60 ms 9536 KB Output is correct
81 Correct 50 ms 9420 KB Output is correct
82 Correct 52 ms 9044 KB Output is correct
83 Correct 51 ms 9100 KB Output is correct
84 Correct 2 ms 4956 KB Output is correct
85 Correct 2 ms 4956 KB Output is correct
86 Correct 3 ms 4956 KB Output is correct
87 Correct 2 ms 4956 KB Output is correct
88 Correct 2 ms 4956 KB Output is correct
89 Correct 2 ms 4956 KB Output is correct
90 Correct 2 ms 4956 KB Output is correct
91 Correct 2 ms 4956 KB Output is correct
92 Correct 2 ms 4956 KB Output is correct
93 Correct 2 ms 4956 KB Output is correct
94 Correct 1 ms 4952 KB Output is correct
95 Correct 1 ms 4952 KB Output is correct
96 Correct 1 ms 4956 KB Output is correct
97 Correct 1 ms 4956 KB Output is correct
98 Correct 1 ms 4784 KB Output is correct
99 Correct 1 ms 4956 KB Output is correct
100 Correct 1 ms 4952 KB Output is correct
101 Correct 1 ms 4956 KB Output is correct
102 Correct 1 ms 4952 KB Output is correct
103 Correct 1 ms 4956 KB Output is correct
104 Correct 6 ms 5820 KB Output is correct
105 Correct 12 ms 7772 KB Output is correct
106 Correct 1 ms 4956 KB Output is correct
107 Correct 21 ms 8892 KB Output is correct
108 Correct 29 ms 10972 KB Output is correct
109 Correct 1 ms 5208 KB Output is correct
110 Correct 43 ms 12508 KB Output is correct
111 Correct 45 ms 15312 KB Output is correct
112 Correct 2 ms 5004 KB Output is correct
113 Correct 62 ms 18608 KB Output is correct
114 Correct 938 ms 9104 KB Output is correct
115 Correct 921 ms 8992 KB Output is correct
116 Correct 941 ms 8844 KB Output is correct
117 Correct 914 ms 8832 KB Output is correct
118 Correct 929 ms 8932 KB Output is correct
119 Correct 979 ms 9656 KB Output is correct
120 Correct 966 ms 9156 KB Output is correct
121 Correct 931 ms 8948 KB Output is correct
122 Execution timed out 1008 ms 8800 KB Time limit exceeded
123 Halted 0 ms 0 KB -