oj.uz

답안 #335211

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
335211 2020-12-11T13:44:34 Z blue 꿈 (IOI13_dreaming) C++17
65 / 100
 198 ms 16236 KB 
#include "dreaming.h"
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <queue>
using namespace std;

/*
0 --(1)-- 1
          |
         (4)
          |
          4 --(3)-- 5
          |
         (4)
          |
2 --(2)-- 3

*/

vector<int> edge[100001];
vector<int> weight[100001];
vector<int> maxdist(100001, 0);
vector<int> children(100001, 0);
vector<int> visit(100001, 0);
vector<int> roots;

struct distcomp
{
    int i;
};

bool operator < (distcomp a, distcomp b)
{
    if(maxdist[a.i] == maxdist[b.i]) return a.i < b.i;
    return maxdist[a.i] < maxdist[b.i];
}

int travelTime(int N, int M, int L, int A[], int B[], int T[])
//number of nodes, number of edges, common length, edge A[i]-A[i] with length T[i]
{
    for(int i = 0; i < M; i++)
    {
        edge[A[i]].push_back(B[i]);
        weight[A[i]].push_back(T[i]);
        edge[B[i]].push_back(A[i]);
        weight[B[i]].push_back(T[i]);
    }

    //set<int, distcomp> tbv;
    set<distcomp> tbv;
    for(int i = 0; i < N; i++)
    {
        if(edge[i].size() == 1) tbv.insert(distcomp{i});
        if(edge[i].size() == 0) roots.push_back(i);
    }

    int u, v, w;
    while(!tbv.empty())
    {
        u = tbv.begin()->i;
        tbv.erase(tbv.begin());
        if(visit[u]) continue;
        visit[u] = 1;

        for(int i = 0; i < edge[u].size(); i++)
        {
            v = edge[u][i];
            w = weight[u][i];

            if(!visit[v])
            {
                children[v]++;
                maxdist[v] = max(maxdist[v], maxdist[u] + w);
                if(children[v] >= edge[v].size() - 1) tbv.insert(distcomp{v});
            }
        }
        if(edge[u].size() == children[u])
        {
            //cout << "roots <- " << u << '\n';
            roots.push_back(u);
        }
    }
    int res = 0;
    for(int r: roots)
    {
        int max1 = 0, max2 = 0;
        for(int i = 0; i < edge[r].size(); i++)
        {
            v = edge[r][i];
            w = weight[r][i];
            if(maxdist[v] + w >= max1)
            {
                max2 = max1;
                max1 = maxdist[v] + w;
            }
            else if(maxdist[v] + w >= max2)
            {
                max2 = maxdist[v] + w;
            }
        }
        res = max(res, max1 + max2);
    }
    //cout << res << '\n';
    for(int i = 0; i < roots.size(); i++) roots[i] = maxdist[roots[i]];
    sort(roots.begin(), roots.end());
    if(roots.size() >= 2)res = max(res, roots[roots.size() - 2] + L + roots[roots.size() - 1]);
    if(roots.size() >= 3) res = max(res, roots[roots.size() - 2] + 2*L + roots[roots.size() - 3]);

    return res;
}

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:67:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |         for(int i = 0; i < edge[u].size(); i++)
      |                        ~~^~~~~~~~~~~~~~~~
dreaming.cpp:76:32: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |                 if(children[v] >= edge[v].size() - 1) tbv.insert(distcomp{v});
dreaming.cpp:79:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} [-Wsign-compare]
   79 |         if(edge[u].size() == children[u])
dreaming.cpp:89:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |         for(int i = 0; i < edge[r].size(); i++)
      |                        ~~^~~~~~~~~~~~~~~~
dreaming.cpp:106:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  106 |     for(int i = 0; i < roots.size(); i++) roots[i] = maxdist[roots[i]];
      |                    ~~^~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 91 ms 13292 KB Output is correct
2 Correct 83 ms 13116 KB Output is correct
3 Correct 50 ms 10752 KB Output is correct
4 Correct 14 ms 7276 KB Output is correct
5 Correct 11 ms 7020 KB Output is correct
6 Correct 19 ms 7788 KB Output is correct
7 Correct 5 ms 6252 KB Output is correct
8 Correct 40 ms 9452 KB Output is correct
9 Correct 55 ms 10220 KB Output is correct
10 Correct 5 ms 6380 KB Output is correct
11 Correct 80 ms 11628 KB Output is correct
12 Correct 97 ms 12396 KB Output is correct
13 Correct 5 ms 6252 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 91 ms 13292 KB Output is correct
2 Correct 83 ms 13116 KB Output is correct
3 Correct 50 ms 10752 KB Output is correct
4 Correct 14 ms 7276 KB Output is correct
5 Correct 11 ms 7020 KB Output is correct
6 Correct 19 ms 7788 KB Output is correct
7 Correct 5 ms 6252 KB Output is correct
8 Correct 40 ms 9452 KB Output is correct
9 Correct 55 ms 10220 KB Output is correct
10 Correct 5 ms 6380 KB Output is correct
11 Correct 80 ms 11628 KB Output is correct
12 Correct 97 ms 12396 KB Output is correct
13 Correct 5 ms 6252 KB Output is correct
14 Correct 5 ms 6252 KB Output is correct
15 Correct 5 ms 6252 KB Output is correct
16 Correct 5 ms 6252 KB Output is correct
17 Correct 5 ms 6272 KB Output is correct
18 Correct 5 ms 6252 KB Output is correct
19 Correct 5 ms 6252 KB Output is correct
20 Correct 5 ms 6252 KB Output is correct
21 Correct 5 ms 6252 KB Output is correct
22 Correct 5 ms 6252 KB Output is correct
23 Correct 5 ms 6252 KB Output is correct
24 Correct 5 ms 6252 KB Output is correct
25 Correct 5 ms 6252 KB Output is correct
26 Correct 5 ms 6252 KB Output is correct
27 Correct 5 ms 6252 KB Output is correct
28 Correct 5 ms 6252 KB Output is correct
29 Correct 5 ms 6252 KB Output is correct
30 Correct 5 ms 6252 KB Output is correct
31 Correct 5 ms 6252 KB Output is correct
32 Correct 5 ms 6252 KB Output is correct
33 Correct 5 ms 6252 KB Output is correct
34 Correct 5 ms 6252 KB Output is correct
35 Correct 5 ms 6252 KB Output is correct
36 Correct 5 ms 6252 KB Output is correct
37 Correct 5 ms 6252 KB Output is correct
38 Correct 6 ms 6252 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 91 ms 13292 KB Output is correct
2 Correct 83 ms 13116 KB Output is correct
3 Correct 50 ms 10752 KB Output is correct
4 Correct 14 ms 7276 KB Output is correct
5 Correct 11 ms 7020 KB Output is correct
6 Correct 19 ms 7788 KB Output is correct
7 Correct 5 ms 6252 KB Output is correct
8 Correct 40 ms 9452 KB Output is correct
9 Correct 55 ms 10220 KB Output is correct
10 Correct 5 ms 6380 KB Output is correct
11 Correct 80 ms 11628 KB Output is correct
12 Correct 97 ms 12396 KB Output is correct
13 Correct 5 ms 6252 KB Output is correct
14 Correct 5 ms 6252 KB Output is correct
15 Correct 5 ms 6252 KB Output is correct
16 Correct 5 ms 6252 KB Output is correct
17 Correct 5 ms 6272 KB Output is correct
18 Correct 5 ms 6252 KB Output is correct
19 Correct 5 ms 6252 KB Output is correct
20 Correct 5 ms 6252 KB Output is correct
21 Correct 5 ms 6252 KB Output is correct
22 Correct 5 ms 6252 KB Output is correct
23 Correct 5 ms 6252 KB Output is correct
24 Correct 5 ms 6252 KB Output is correct
25 Correct 5 ms 6252 KB Output is correct
26 Correct 5 ms 6252 KB Output is correct
27 Correct 5 ms 6252 KB Output is correct
28 Correct 5 ms 6252 KB Output is correct
29 Correct 5 ms 6252 KB Output is correct
30 Correct 5 ms 6252 KB Output is correct
31 Correct 5 ms 6252 KB Output is correct
32 Correct 5 ms 6252 KB Output is correct
33 Correct 5 ms 6252 KB Output is correct
34 Correct 5 ms 6252 KB Output is correct
35 Correct 5 ms 6252 KB Output is correct
36 Correct 5 ms 6252 KB Output is correct
37 Correct 5 ms 6252 KB Output is correct
38 Correct 6 ms 6252 KB Output is correct
39 Correct 86 ms 13292 KB Output is correct
40 Correct 82 ms 13164 KB Output is correct
41 Correct 52 ms 10860 KB Output is correct
42 Correct 16 ms 7404 KB Output is correct
43 Correct 5 ms 6252 KB Output is correct
44 Correct 5 ms 6252 KB Output is correct
45 Correct 5 ms 6252 KB Output is correct
46 Correct 5 ms 6252 KB Output is correct
47 Correct 5 ms 6252 KB Output is correct
48 Correct 5 ms 6252 KB Output is correct
49 Correct 5 ms 6252 KB Output is correct
50 Correct 5 ms 6252 KB Output is correct
51 Correct 6 ms 6252 KB Output is correct
52 Correct 5 ms 6252 KB Output is correct
53 Correct 5 ms 6252 KB Output is correct
54 Correct 5 ms 6252 KB Output is correct
55 Correct 5 ms 6252 KB Output is correct
56 Correct 5 ms 6252 KB Output is correct
57 Correct 168 ms 15212 KB Output is correct
58 Correct 167 ms 15212 KB Output is correct
59 Correct 178 ms 15468 KB Output is correct
60 Correct 170 ms 15468 KB Output is correct
61 Correct 198 ms 16236 KB Output is correct
62 Correct 174 ms 16236 KB Output is correct
63 Correct 171 ms 16108 KB Output is correct
64 Correct 171 ms 16108 KB Output is correct
65 Correct 192 ms 16108 KB Output is correct
66 Correct 181 ms 16108 KB Output is correct
67 Correct 168 ms 15468 KB Output is correct
68 Correct 185 ms 15596 KB Output is correct
69 Correct 178 ms 15468 KB Output is correct
70 Correct 166 ms 15468 KB Output is correct
71 Correct 4 ms 6252 KB Output is correct
72 Correct 7 ms 6508 KB Output is correct
73 Correct 7 ms 6508 KB Output is correct
74 Correct 7 ms 6508 KB Output is correct
75 Correct 7 ms 6508 KB Output is correct
76 Correct 7 ms 6508 KB Output is correct
77 Correct 7 ms 6508 KB Output is correct
78 Correct 7 ms 6508 KB Output is correct
79 Correct 7 ms 6508 KB Output is correct
80 Correct 168 ms 15468 KB Output is correct
81 Correct 167 ms 15340 KB Output is correct
82 Correct 183 ms 16236 KB Output is correct
83 Correct 176 ms 16108 KB Output is correct
84 Correct 6 ms 6508 KB Output is correct
85 Correct 6 ms 6508 KB Output is correct
86 Correct 7 ms 6528 KB Output is correct
87 Correct 7 ms 6508 KB Output is correct
88 Correct 7 ms 6508 KB Output is correct
89 Correct 7 ms 6508 KB Output is correct
90 Correct 7 ms 6508 KB Output is correct
91 Correct 7 ms 6508 KB Output is correct
92 Correct 7 ms 6508 KB Output is correct
93 Correct 7 ms 6508 KB Output is correct
94 Correct 5 ms 6252 KB Output is correct
95 Correct 5 ms 6252 KB Output is correct
96 Correct 5 ms 6252 KB Output is correct
97 Correct 5 ms 6252 KB Output is correct
98 Correct 5 ms 6252 KB Output is correct
99 Correct 5 ms 6252 KB Output is correct
100 Correct 5 ms 6252 KB Output is correct
101 Correct 5 ms 6252 KB Output is correct
102 Correct 5 ms 6252 KB Output is correct
103 Correct 5 ms 6252 KB Output is correct
104 Correct 11 ms 7040 KB Output is correct
105 Correct 19 ms 7788 KB Output is correct
106 Correct 5 ms 6252 KB Output is correct
107 Correct 37 ms 9324 KB Output is correct
108 Correct 51 ms 10092 KB Output is correct
109 Correct 5 ms 6252 KB Output is correct
110 Correct 106 ms 11628 KB Output is correct
111 Correct 98 ms 12396 KB Output is correct
112 Correct 5 ms 6252 KB Output is correct
113 Correct 129 ms 13804 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 13676 KB Output is correct
2 Correct 86 ms 13932 KB Output is correct
3 Correct 82 ms 13804 KB Output is correct
4 Correct 80 ms 13804 KB Output is correct
5 Correct 84 ms 13948 KB Output is correct
6 Correct 86 ms 14440 KB Output is correct
7 Correct 87 ms 14188 KB Output is correct
8 Correct 78 ms 13632 KB Output is correct
9 Correct 78 ms 13676 KB Output is correct
10 Correct 82 ms 14060 KB Output is correct
11 Correct 4 ms 6252 KB Output is correct
12 Correct 8 ms 6888 KB Output is correct
13 Correct 8 ms 6912 KB Output is correct
14 Correct 8 ms 6888 KB Output is correct
15 Correct 8 ms 6888 KB Output is correct
16 Correct 7 ms 6888 KB Output is correct
17 Correct 7 ms 6888 KB Output is correct
18 Correct 9 ms 7192 KB Output is correct
19 Correct 8 ms 6888 KB Output is correct
20 Correct 4 ms 6252 KB Output is correct
21 Correct 5 ms 6252 KB Output is correct
22 Correct 5 ms 6252 KB Output is correct
23 Correct 7 ms 6888 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 91 ms 13292 KB Output is correct
2 Correct 83 ms 13116 KB Output is correct
3 Correct 50 ms 10752 KB Output is correct
4 Correct 14 ms 7276 KB Output is correct
5 Correct 11 ms 7020 KB Output is correct
6 Correct 19 ms 7788 KB Output is correct
7 Correct 5 ms 6252 KB Output is correct
8 Correct 40 ms 9452 KB Output is correct
9 Correct 55 ms 10220 KB Output is correct
10 Correct 5 ms 6380 KB Output is correct
11 Correct 80 ms 11628 KB Output is correct
12 Correct 97 ms 12396 KB Output is correct
13 Correct 5 ms 6252 KB Output is correct
14 Correct 5 ms 6252 KB Output is correct
15 Correct 6 ms 6380 KB Output is correct
16 Correct 8 ms 6508 KB Output is correct
17 Correct 5 ms 6380 KB Output is correct
18 Correct 6 ms 6380 KB Output is correct
19 Correct 7 ms 6508 KB Output is correct
20 Correct 5 ms 6252 KB Output is correct
21 Correct 6 ms 6380 KB Output is correct
22 Correct 7 ms 6528 KB Output is correct
23 Correct 5 ms 6252 KB Output is correct
24 Correct 5 ms 6252 KB Output is correct
25 Correct 5 ms 6252 KB Output is correct
26 Correct 5 ms 6252 KB Output is correct
27 Correct 5 ms 6252 KB Output is correct
28 Correct 5 ms 6252 KB Output is correct
29 Incorrect 4 ms 6252 KB Output isn't correct
30 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 91 ms 13292 KB Output is correct
2 Correct 83 ms 13116 KB Output is correct
3 Correct 50 ms 10752 KB Output is correct
4 Correct 14 ms 7276 KB Output is correct
5 Correct 11 ms 7020 KB Output is correct
6 Correct 19 ms 7788 KB Output is correct
7 Correct 5 ms 6252 KB Output is correct
8 Correct 40 ms 9452 KB Output is correct
9 Correct 55 ms 10220 KB Output is correct
10 Correct 5 ms 6380 KB Output is correct
11 Correct 80 ms 11628 KB Output is correct
12 Correct 97 ms 12396 KB Output is correct
13 Correct 5 ms 6252 KB Output is correct
14 Correct 5 ms 6252 KB Output is correct
15 Correct 5 ms 6252 KB Output is correct
16 Correct 5 ms 6252 KB Output is correct
17 Correct 5 ms 6272 KB Output is correct
18 Correct 5 ms 6252 KB Output is correct
19 Correct 5 ms 6252 KB Output is correct
20 Correct 5 ms 6252 KB Output is correct
21 Correct 5 ms 6252 KB Output is correct
22 Correct 5 ms 6252 KB Output is correct
23 Correct 5 ms 6252 KB Output is correct
24 Correct 5 ms 6252 KB Output is correct
25 Correct 5 ms 6252 KB Output is correct
26 Correct 5 ms 6252 KB Output is correct
27 Correct 5 ms 6252 KB Output is correct
28 Correct 5 ms 6252 KB Output is correct
29 Correct 5 ms 6252 KB Output is correct
30 Correct 5 ms 6252 KB Output is correct
31 Correct 5 ms 6252 KB Output is correct
32 Correct 5 ms 6252 KB Output is correct
33 Correct 5 ms 6252 KB Output is correct
34 Correct 5 ms 6252 KB Output is correct
35 Correct 5 ms 6252 KB Output is correct
36 Correct 5 ms 6252 KB Output is correct
37 Correct 5 ms 6252 KB Output is correct
38 Correct 6 ms 6252 KB Output is correct
39 Correct 86 ms 13292 KB Output is correct
40 Correct 82 ms 13164 KB Output is correct
41 Correct 52 ms 10860 KB Output is correct
42 Correct 16 ms 7404 KB Output is correct
43 Correct 5 ms 6252 KB Output is correct
44 Correct 5 ms 6252 KB Output is correct
45 Correct 5 ms 6252 KB Output is correct
46 Correct 5 ms 6252 KB Output is correct
47 Correct 5 ms 6252 KB Output is correct
48 Correct 5 ms 6252 KB Output is correct
49 Correct 5 ms 6252 KB Output is correct
50 Correct 5 ms 6252 KB Output is correct
51 Correct 6 ms 6252 KB Output is correct
52 Correct 5 ms 6252 KB Output is correct
53 Correct 5 ms 6252 KB Output is correct
54 Correct 5 ms 6252 KB Output is correct
55 Correct 5 ms 6252 KB Output is correct
56 Correct 5 ms 6252 KB Output is correct
57 Correct 168 ms 15212 KB Output is correct
58 Correct 167 ms 15212 KB Output is correct
59 Correct 178 ms 15468 KB Output is correct
60 Correct 170 ms 15468 KB Output is correct
61 Correct 198 ms 16236 KB Output is correct
62 Correct 174 ms 16236 KB Output is correct
63 Correct 171 ms 16108 KB Output is correct
64 Correct 171 ms 16108 KB Output is correct
65 Correct 192 ms 16108 KB Output is correct
66 Correct 181 ms 16108 KB Output is correct
67 Correct 168 ms 15468 KB Output is correct
68 Correct 185 ms 15596 KB Output is correct
69 Correct 178 ms 15468 KB Output is correct
70 Correct 166 ms 15468 KB Output is correct
71 Correct 4 ms 6252 KB Output is correct
72 Correct 7 ms 6508 KB Output is correct
73 Correct 7 ms 6508 KB Output is correct
74 Correct 7 ms 6508 KB Output is correct
75 Correct 7 ms 6508 KB Output is correct
76 Correct 7 ms 6508 KB Output is correct
77 Correct 7 ms 6508 KB Output is correct
78 Correct 7 ms 6508 KB Output is correct
79 Correct 7 ms 6508 KB Output is correct
80 Correct 168 ms 15468 KB Output is correct
81 Correct 167 ms 15340 KB Output is correct
82 Correct 183 ms 16236 KB Output is correct
83 Correct 176 ms 16108 KB Output is correct
84 Correct 6 ms 6508 KB Output is correct
85 Correct 6 ms 6508 KB Output is correct
86 Correct 7 ms 6528 KB Output is correct
87 Correct 7 ms 6508 KB Output is correct
88 Correct 7 ms 6508 KB Output is correct
89 Correct 7 ms 6508 KB Output is correct
90 Correct 7 ms 6508 KB Output is correct
91 Correct 7 ms 6508 KB Output is correct
92 Correct 7 ms 6508 KB Output is correct
93 Correct 7 ms 6508 KB Output is correct
94 Correct 5 ms 6252 KB Output is correct
95 Correct 5 ms 6252 KB Output is correct
96 Correct 5 ms 6252 KB Output is correct
97 Correct 5 ms 6252 KB Output is correct
98 Correct 5 ms 6252 KB Output is correct
99 Correct 5 ms 6252 KB Output is correct
100 Correct 5 ms 6252 KB Output is correct
101 Correct 5 ms 6252 KB Output is correct
102 Correct 5 ms 6252 KB Output is correct
103 Correct 5 ms 6252 KB Output is correct
104 Correct 11 ms 7040 KB Output is correct
105 Correct 19 ms 7788 KB Output is correct
106 Correct 5 ms 6252 KB Output is correct
107 Correct 37 ms 9324 KB Output is correct
108 Correct 51 ms 10092 KB Output is correct
109 Correct 5 ms 6252 KB Output is correct
110 Correct 106 ms 11628 KB Output is correct
111 Correct 98 ms 12396 KB Output is correct
112 Correct 5 ms 6252 KB Output is correct
113 Correct 129 ms 13804 KB Output is correct
114 Correct 78 ms 13676 KB Output is correct
115 Correct 86 ms 13932 KB Output is correct
116 Correct 82 ms 13804 KB Output is correct
117 Correct 80 ms 13804 KB Output is correct
118 Correct 84 ms 13948 KB Output is correct
119 Correct 86 ms 14440 KB Output is correct
120 Correct 87 ms 14188 KB Output is correct
121 Correct 78 ms 13632 KB Output is correct
122 Correct 78 ms 13676 KB Output is correct
123 Correct 82 ms 14060 KB Output is correct
124 Correct 4 ms 6252 KB Output is correct
125 Correct 8 ms 6888 KB Output is correct
126 Correct 8 ms 6912 KB Output is correct
127 Correct 8 ms 6888 KB Output is correct
128 Correct 8 ms 6888 KB Output is correct
129 Correct 7 ms 6888 KB Output is correct
130 Correct 7 ms 6888 KB Output is correct
131 Correct 9 ms 7192 KB Output is correct
132 Correct 8 ms 6888 KB Output is correct
133 Correct 4 ms 6252 KB Output is correct
134 Correct 5 ms 6252 KB Output is correct
135 Correct 5 ms 6252 KB Output is correct
136 Correct 7 ms 6888 KB Output is correct
137 Correct 5 ms 6252 KB Output is correct
138 Correct 6 ms 6380 KB Output is correct
139 Correct 8 ms 6508 KB Output is correct
140 Correct 5 ms 6380 KB Output is correct
141 Correct 6 ms 6380 KB Output is correct
142 Correct 7 ms 6508 KB Output is correct
143 Correct 5 ms 6252 KB Output is correct
144 Correct 6 ms 6380 KB Output is correct
145 Correct 7 ms 6528 KB Output is correct
146 Correct 5 ms 6252 KB Output is correct
147 Correct 5 ms 6252 KB Output is correct
148 Correct 5 ms 6252 KB Output is correct
149 Correct 5 ms 6252 KB Output is correct
150 Correct 5 ms 6252 KB Output is correct
151 Correct 5 ms 6252 KB Output is correct
152 Incorrect 4 ms 6252 KB Output isn't correct
153 Halted 0 ms 0 KB -