oj.uz

답안 #1095363

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1095363 2024-10-02T02:02:18 Z raphaelp Team Coding (EGOI24_teamcoding) C++14
81 / 100
 2285 ms 57232 KB 
#include <bits/stdc++.h>
using namespace std;
void dfs(int x, vector<vector<int>> &AR, vector<int> &depth, int cur)
{
    depth[x] = cur;
    for (int i = 0; i < AR[x].size(); i++)
    {
        dfs(AR[x][i], AR, depth, cur + 1);
    }
}
void dfs2(int x, vector<vector<int>> &AR, vector<vector<pair<int, int>>> &colorpos, vector<int> &available, map<int, int> &M, vector<int> &C, vector<vector<int>> &colors, int cur, int &best, int &best2)
{
    available.push_back(1);
    vector<int> available2;
    map<int, int> M2;
    M[C[x]] += 1;
    for (int i = 0; i < AR[x].size(); i++)
    {
        available2.clear();
        M2.clear();
        dfs2(AR[x][i], AR, colorpos, available2, M2, C, colors, cur + 1, best, best2);
        available2.push_back(0);
        if (available2.size() > available.size())
            swap(available2, available);
        for (int j = 0; j < available2.size(); j++)
        {
            available[j + available.size() - available2.size()] += available2[j];
        }
        if (M2.size() > M.size())
            swap(M, M2);
        for (auto j : M2)
        {
            M[j.first] += j.second;
        }
    }
    if (colors[C[x]].size() <= sqrt(AR.size()))
    {
        int ans1 = 0, ans2 = 0;
        for (int i = 0; i < colorpos[C[x]].size(); i++)
        {
            if (colorpos[C[x]][i].first >= cur && colorpos[C[x]][i].first < cur + available.size())
                ans1 += min(colorpos[C[x]][i].second, available[available.size() - colorpos[C[x]][i].first - 1 + cur]);
        }
        ans2 = ans1 - M[C[x]];
        if (ans1 > best || (ans1 == best && ans2 < best2))
        {
            best = ans1, best2 = ans2;
        }
    }
}
pair<int, int> dfs3(int x, vector<vector<int>> &AR, vector<int> &C, int c, vector<int> &used, vector<int> &maxx, int cur, int &best, int &best2)
{
    vector<int> used2;
    int tot = 0, tot2 = 0;
    if (C[x] == c)
        tot2++;
    used.push_back(0);
    if (maxx[cur] != 0)
    {
        used[0] = 1;
        tot++;
    }
    for (int i = 0; i < AR[x].size(); i++)
    {
        used2.clear();
        pair<int, int> temp = dfs3(AR[x][i], AR, C, c, used2, maxx, cur + 1, best, best2);
        tot2 += temp.second;
        used2.push_back(0);
        if (used2.size() > used.size())
        {
            swap(used2, used);
            swap(tot, temp.first);
        }
        for (int j = 0; j < used2.size(); j++)
        {
            tot -= used[j + used.size() - used2.size()];
            used[j + used.size() - used2.size()] = min(used[j + used.size() - used2.size()] + used2[j], maxx[cur + used2.size() - j - 1]);
            tot += used[j + used.size() - used2.size()];
        }
    }
    if (C[x] == c && (tot > best || (tot == best && tot2 < best2)))
    {
        best = tot, best2 = tot - tot2;
    }
    return {tot, tot2};
}
int main()
{
    cin.tie(0);
    cout.tie(0);
    ios_base::sync_with_stdio(0);
    int N, K;
    cin >> N >> K;
    vector<int> C(N);
    vector<vector<int>> colors(K);
    for (int i = 0; i < N; i++)
    {
        cin >> C[i];
        colors[C[i]].push_back(i);
    }
    vector<int> p(N, 0);
    vector<vector<int>> AR(N);
    for (int i = 1; i < N; i++)
    {
        cin >> p[i];
        AR[p[i]].push_back(i);
    }
    vector<int> depth(N);
    vector<vector<pair<int, int>>> colorpos(K);
    dfs(0, AR, depth, 0);
    int best = 0, best2 = 0;
    for (int i = 0; i < K; i++)
    {
        for (int j = 0; j < colors[i].size(); j++)
        {
            colorpos[i].push_back({depth[colors[i][j]], 1});
        }
        sort(colorpos[i].begin(), colorpos[i].end());
        vector<pair<int, int>> temp;
        int cur = 0;
        for (int j = 0; j < colors[i].size(); j++)
        {
            if (j > 0 && colorpos[i][j].first != colorpos[i][j - 1].first)
            {
                temp.push_back({colorpos[i][j - 1].first, cur});
                cur = 0;
            }
            cur++;
        }
        if (colors[i].size() > 0)
            temp.push_back({colorpos[i].back().first, cur});
        swap(temp, colorpos[i]);
    }
    vector<int> available;
    map<int, int> M;
    dfs2(0, AR, colorpos, available, M, C, colors, 0, best, best2);
    for (int i = 0; i < K; i++)
    {
        if (colors[i].size() >= sqrt(N) - 1)
        {
            vector<int> used, maxx(N);
            for (int j = 0; j < colors[i].size(); j++)
                maxx[depth[colors[i][j]]]++;
            pair<int, int> temp = dfs3(0, AR, C, i, used, maxx, 0, best, best2);
        }
    }
    cout << best << ' ' << best2;
}

Compilation message

Main.cpp: In function 'void dfs(int, std::vector<std::vector<int> >&, std::vector<int>&, int)':
Main.cpp:6:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    6 |     for (int i = 0; i < AR[x].size(); i++)
      |                     ~~^~~~~~~~~~~~~~
Main.cpp: In function 'void dfs2(int, std::vector<std::vector<int> >&, std::vector<std::vector<std::pair<int, int> > >&, std::vector<int>&, std::map<int, int>&, std::vector<int>&, std::vector<std::vector<int> >&, int, int&, int&)':
Main.cpp:17:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     for (int i = 0; i < AR[x].size(); i++)
      |                     ~~^~~~~~~~~~~~~~
Main.cpp:25:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |         for (int j = 0; j < available2.size(); j++)
      |                         ~~^~~~~~~~~~~~~~~~~~~
Main.cpp:39: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]
   39 |         for (int i = 0; i < colorpos[C[x]].size(); i++)
      |                         ~~^~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:41:75: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |             if (colorpos[C[x]][i].first >= cur && colorpos[C[x]][i].first < cur + available.size())
Main.cpp: In function 'std::pair<int, int> dfs3(int, std::vector<std::vector<int> >&, std::vector<int>&, int, std::vector<int>&, std::vector<int>&, int, int&, int&)':
Main.cpp:63:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |     for (int i = 0; i < AR[x].size(); i++)
      |                     ~~^~~~~~~~~~~~~~
Main.cpp:74:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |         for (int j = 0; j < used2.size(); j++)
      |                         ~~^~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:114:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |         for (int j = 0; j < colors[i].size(); j++)
      |                         ~~^~~~~~~~~~~~~~~~~~
Main.cpp:121:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  121 |         for (int j = 0; j < colors[i].size(); j++)
      |                         ~~^~~~~~~~~~~~~~~~~~
Main.cpp:142:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  142 |             for (int j = 0; j < colors[i].size(); j++)
      |                             ~~^~~~~~~~~~~~~~~~~~
Main.cpp:144:28: warning: variable 'temp' set but not used [-Wunused-but-set-variable]
  144 |             pair<int, int> temp = dfs3(0, AR, C, i, used, maxx, 0, best, best2);
      |                            ^~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 4 ms 1372 KB Output is correct
9 Correct 96 ms 54480 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 62 ms 48964 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 1372 KB Output is correct
15 Correct 100 ms 57232 KB Output is correct
16 Correct 1 ms 600 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 1372 KB Output is correct
5 Correct 65 ms 48776 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 32 ms 7260 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 860 KB Output is correct
11 Correct 66 ms 28112 KB Output is correct
12 Correct 17 ms 5856 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 49 ms 6856 KB Output is correct
16 Correct 47 ms 6768 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 47 ms 7064 KB Output is correct
20 Correct 49 ms 7084 KB Output is correct
21 Correct 47 ms 7064 KB Output is correct
22 Correct 0 ms 348 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 404 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 99 ms 54420 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 1372 KB Output is correct
11 Correct 102 ms 57188 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 107 ms 16124 KB Output is correct
19 Correct 108 ms 14164 KB Output is correct
20 Correct 87 ms 19756 KB Output is correct
21 Correct 70 ms 8028 KB Output is correct
22 Correct 89 ms 17116 KB Output is correct
23 Correct 102 ms 35240 KB Output is correct
24 Correct 93 ms 26448 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 2 ms 1116 KB Output is correct
27 Correct 2 ms 604 KB Output is correct
28 Correct 2 ms 604 KB Output is correct
29 Correct 9 ms 2204 KB Output is correct
30 Correct 105 ms 14416 KB Output is correct
31 Correct 109 ms 18640 KB Output is correct
32 Correct 106 ms 25664 KB Output is correct
33 Correct 87 ms 15132 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 5 ms 1372 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 1372 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 2 ms 1372 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 860 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 2 ms 1116 KB Output is correct
28 Correct 2 ms 600 KB Output is correct
29 Correct 3 ms 604 KB Output is correct
30 Correct 1 ms 1116 KB Output is correct
31 Correct 4 ms 468 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 2 ms 348 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 344 KB Output is correct

Subtask #5
0.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 356 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 4 ms 1372 KB Output is correct
9 Correct 96 ms 54480 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 1372 KB Output is correct
12 Correct 62 ms 48964 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 1372 KB Output is correct
15 Correct 100 ms 57232 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 1372 KB Output is correct
21 Correct 65 ms 48776 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 32 ms 7260 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 860 KB Output is correct
27 Correct 66 ms 28112 KB Output is correct
28 Correct 17 ms 5856 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 49 ms 6856 KB Output is correct
32 Correct 47 ms 6768 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 47 ms 7064 KB Output is correct
36 Correct 49 ms 7084 KB Output is correct
37 Correct 47 ms 7064 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 404 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 99 ms 54420 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 2 ms 1372 KB Output is correct
49 Correct 102 ms 57188 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 2 ms 604 KB Output is correct
54 Correct 2 ms 604 KB Output is correct
55 Correct 1 ms 604 KB Output is correct
56 Correct 107 ms 16124 KB Output is correct
57 Correct 108 ms 14164 KB Output is correct
58 Correct 87 ms 19756 KB Output is correct
59 Correct 70 ms 8028 KB Output is correct
60 Correct 89 ms 17116 KB Output is correct
61 Correct 102 ms 35240 KB Output is correct
62 Correct 93 ms 26448 KB Output is correct
63 Correct 1 ms 860 KB Output is correct
64 Correct 2 ms 1116 KB Output is correct
65 Correct 2 ms 604 KB Output is correct
66 Correct 2 ms 604 KB Output is correct
67 Correct 9 ms 2204 KB Output is correct
68 Correct 105 ms 14416 KB Output is correct
69 Correct 109 ms 18640 KB Output is correct
70 Correct 106 ms 25664 KB Output is correct
71 Correct 87 ms 15132 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 0 ms 348 KB Output is correct
74 Correct 0 ms 344 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 0 ms 348 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 0 ms 348 KB Output is correct
81 Correct 0 ms 348 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 5 ms 1372 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 2 ms 1372 KB Output is correct
86 Correct 0 ms 348 KB Output is correct
87 Correct 2 ms 1372 KB Output is correct
88 Correct 0 ms 348 KB Output is correct
89 Correct 1 ms 604 KB Output is correct
90 Correct 0 ms 348 KB Output is correct
91 Correct 1 ms 860 KB Output is correct
92 Correct 0 ms 348 KB Output is correct
93 Correct 0 ms 348 KB Output is correct
94 Correct 0 ms 348 KB Output is correct
95 Correct 1 ms 348 KB Output is correct
96 Correct 1 ms 348 KB Output is correct
97 Correct 0 ms 348 KB Output is correct
98 Correct 2 ms 604 KB Output is correct
99 Correct 2 ms 604 KB Output is correct
100 Correct 1 ms 604 KB Output is correct
101 Correct 1 ms 860 KB Output is correct
102 Correct 2 ms 1116 KB Output is correct
103 Correct 2 ms 600 KB Output is correct
104 Correct 3 ms 604 KB Output is correct
105 Correct 1 ms 1116 KB Output is correct
106 Correct 4 ms 468 KB Output is correct
107 Correct 1 ms 348 KB Output is correct
108 Correct 1 ms 604 KB Output is correct
109 Correct 1 ms 600 KB Output is correct
110 Correct 1 ms 604 KB Output is correct
111 Correct 2 ms 348 KB Output is correct
112 Correct 1 ms 604 KB Output is correct
113 Correct 0 ms 348 KB Output is correct
114 Correct 0 ms 348 KB Output is correct
115 Correct 0 ms 348 KB Output is correct
116 Correct 0 ms 344 KB Output is correct
117 Correct 0 ms 348 KB Output is correct
118 Correct 0 ms 348 KB Output is correct
119 Correct 0 ms 348 KB Output is correct
120 Correct 0 ms 348 KB Output is correct
121 Correct 0 ms 348 KB Output is correct
122 Correct 0 ms 344 KB Output is correct
123 Correct 0 ms 348 KB Output is correct
124 Correct 4 ms 1372 KB Output is correct
125 Correct 100 ms 54468 KB Output is correct
126 Correct 0 ms 344 KB Output is correct
127 Correct 1 ms 1372 KB Output is correct
128 Correct 67 ms 48964 KB Output is correct
129 Correct 0 ms 344 KB Output is correct
130 Correct 2 ms 1372 KB Output is correct
131 Correct 102 ms 57068 KB Output is correct
132 Correct 0 ms 348 KB Output is correct
133 Correct 1 ms 348 KB Output is correct
134 Correct 29 ms 7260 KB Output is correct
135 Correct 0 ms 344 KB Output is correct
136 Correct 1 ms 860 KB Output is correct
137 Correct 68 ms 28052 KB Output is correct
138 Correct 17 ms 5860 KB Output is correct
139 Correct 0 ms 348 KB Output is correct
140 Correct 0 ms 348 KB Output is correct
141 Correct 47 ms 6860 KB Output is correct
142 Correct 46 ms 6744 KB Output is correct
143 Correct 0 ms 348 KB Output is correct
144 Correct 1 ms 348 KB Output is correct
145 Correct 46 ms 7068 KB Output is correct
146 Correct 46 ms 7348 KB Output is correct
147 Correct 46 ms 7064 KB Output is correct
148 Correct 0 ms 348 KB Output is correct
149 Correct 0 ms 348 KB Output is correct
150 Correct 2 ms 592 KB Output is correct
151 Correct 1 ms 604 KB Output is correct
152 Correct 1 ms 604 KB Output is correct
153 Correct 108 ms 15952 KB Output is correct
154 Correct 107 ms 14160 KB Output is correct
155 Correct 81 ms 19532 KB Output is correct
156 Correct 66 ms 8020 KB Output is correct
157 Correct 84 ms 17236 KB Output is correct
158 Correct 96 ms 35284 KB Output is correct
159 Correct 88 ms 26540 KB Output is correct
160 Correct 1 ms 856 KB Output is correct
161 Correct 2 ms 1116 KB Output is correct
162 Correct 2 ms 604 KB Output is correct
163 Correct 2 ms 604 KB Output is correct
164 Correct 9 ms 2140 KB Output is correct
165 Correct 105 ms 14420 KB Output is correct
166 Correct 119 ms 18768 KB Output is correct
167 Correct 103 ms 25680 KB Output is correct
168 Correct 82 ms 14936 KB Output is correct
169 Correct 2 ms 1116 KB Output is correct
170 Correct 4 ms 604 KB Output is correct
171 Correct 1 ms 604 KB Output is correct
172 Correct 1 ms 616 KB Output is correct
173 Correct 1 ms 604 KB Output is correct
174 Correct 1 ms 604 KB Output is correct
175 Correct 2 ms 348 KB Output is correct
176 Correct 1 ms 604 KB Output is correct
177 Correct 90 ms 36292 KB Output is correct
178 Correct 2285 ms 9552 KB Output is correct
179 Correct 73 ms 11860 KB Output is correct
180 Correct 5 ms 1368 KB Output is correct
181 Correct 49 ms 10032 KB Output is correct
182 Incorrect 5 ms 1116 KB Output isn't correct
183 Halted 0 ms 0 KB -