oj.uz

Submission #761486

# Submission time Handle Problem Language Result Execution time Memory
761486 2023-06-19T19:17:03 Z caganyanmaz Fountain Parks (IOI21_parks) C++17
70 / 100
 264 ms 63856 KB 
#include <bits/stdc++.h>
#define pb push_back
using namespace std;

void build(vector<int> u, vector<int> v, vector<int> a, vector<int> b);
int construct_roads(vector<int> x, vector<int> y);

#ifdef __DEBUG__
void build(vector<int> u, vector<int> v, vector<int> a, vector<int> b){}
#endif


constexpr static int SIZE = 200001;

vector<array<int, 3>> m;
vector<array<int, 2>> pos;
set<array<int, 2>> fountains;
bitset<SIZE> visited;
vector<int> uu, vv, aa, bb;

int get_node(int x, int y)
{
        array<int, 3> a = {x, y, 0};
        auto it = lower_bound(m.begin(), m.end(), a);
        if (it != m.end() && (*it)[0] == x && (*it)[1] == y)
                return (*it)[2];
        return -1;
}

void dfs(int node, int last, int fx, int fy);

bool try_insert(int u, int v, int fx, int fy)
{
        if (v != -1 && !visited[v] && fountains.find({fx, fy}) == fountains.end())
        {
                uu.pb(u), vv.pb(v), aa.pb(fx), bb.pb(fy);
                fountains.insert({fx, fy});
                dfs(v, u, fx, fy);
                return true;
        }
        return false;
}

// direction: 1 vertical, 0 horizontal
// orientation: 1 ccw, 0 cw
void dfs(int node, int last, int fx, int fy)
{
        visited[node] = true;
        auto [node_x, node_y] = pos[node];
        auto [last_x, last_y] = pos[last];
        int left_x = 2 * fx - last_x, left_y = 2 * fy - last_y;
        int top_x = 2 * node_x - last_x, top_y = 2 * node_y - last_y;
        int right_x = 2 * node_x - left_x, right_y = 2 * node_y - left_y;
        int left_fx = node_x + left_x - fx, left_fy = node_y + left_y - fy;
        int left = get_node(left_x, left_y), top = get_node(top_x, top_y), right = get_node(right_x, right_y);
        if (try_insert(node, left, left_fx, left_fy))
        {
                int top_fx = top_x + node_x - left_fx, top_fy = top_y + node_y - left_fy;
                int right_fx, right_fy;
                if (try_insert(node, top, top_fx, top_fy))
                        right_fx = node_x + right_x - top_fx, right_fy = node_y + right_y - top_fy;
                else
                        right_fx = top_fx, right_fy = top_fy;
                try_insert(node, right, right_fx, right_fy);
        }
        else
        {
                int right_fx = node_x * 2 - fx, right_fy = node_y * 2 - fy;
                try_insert(node, right, right_fx, right_fy);
                int top_fx = left_fx, top_fy = left_fy;
                try_insert(node, top, top_fx, top_fy);
        }
}

int construct_roads(vector<int> x, vector<int> y)
{
        for (int i = 0; i < x.size(); i++)
        {
                m.pb({x[i], y[i], i});
                pos.pb({x[i], y[i]});
        }
        sort(m.begin(), m.end());
        int a = m[0][2];
        visited[a] = true;
        int b = get_node(m[0][0], m[0][1] + 2);
        try_insert(a, b, m[0][0] - 1, m[0][1] + 1);
        int c = get_node(m[0][0] + 2, m[0][1]);
        try_insert(a, c, m[0][0] + 1, m[0][1] - 1);
        if (visited.count() == x.size())
        {
                build(uu, vv, aa, bb);
                return 1;
        }
        return 0;

}

#ifdef __DEBUG__
int main()
{
        int n;
        cin >> n;
        vector<int> x(n), y(n);
        for (int i = 0; i < n; i++)
                cin >> x[i] >> y[i];
        if (construct_roads(x, y))
        {
                cout << "YES\n";
                for (int i = 0; i < uu.size(); i++)
                        cout << uu[i] << "-" << vv[i] << ": (" << aa[i] << ", " << bb[i] <<")\n";
        }
        else
        {
                cout << "NO\n";
        }
}

#endif

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:77:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |         for (int i = 0; i < x.size(); i++)
      |                         ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 122 ms 19180 KB Output is correct
10 Correct 13 ms 2260 KB Output is correct
11 Correct 44 ms 10452 KB Output is correct
12 Correct 12 ms 3200 KB Output is correct
13 Correct 20 ms 5120 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 99 ms 19288 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 122 ms 19180 KB Output is correct
10 Correct 13 ms 2260 KB Output is correct
11 Correct 44 ms 10452 KB Output is correct
12 Correct 12 ms 3200 KB Output is correct
13 Correct 20 ms 5120 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 99 ms 19288 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 256 ms 62020 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 2 ms 724 KB Output is correct
27 Correct 2 ms 596 KB Output is correct
28 Correct 132 ms 24892 KB Output is correct
29 Correct 131 ms 37164 KB Output is correct
30 Correct 180 ms 49900 KB Output is correct
31 Correct 231 ms 62016 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 300 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 304 KB Output is correct
37 Correct 1 ms 308 KB Output is correct
38 Correct 1 ms 304 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 308 KB Output is correct
42 Correct 1 ms 304 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 101 ms 21416 KB Output is correct
46 Correct 150 ms 31692 KB Output is correct
47 Correct 149 ms 31632 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 122 ms 19180 KB Output is correct
10 Correct 13 ms 2260 KB Output is correct
11 Correct 44 ms 10452 KB Output is correct
12 Correct 12 ms 3200 KB Output is correct
13 Correct 20 ms 5120 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 99 ms 19288 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 256 ms 62020 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 2 ms 724 KB Output is correct
27 Correct 2 ms 596 KB Output is correct
28 Correct 132 ms 24892 KB Output is correct
29 Correct 131 ms 37164 KB Output is correct
30 Correct 180 ms 49900 KB Output is correct
31 Correct 231 ms 62016 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 300 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 304 KB Output is correct
37 Correct 1 ms 308 KB Output is correct
38 Correct 1 ms 304 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 308 KB Output is correct
42 Correct 1 ms 304 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 101 ms 21416 KB Output is correct
46 Correct 150 ms 31692 KB Output is correct
47 Correct 149 ms 31632 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 308 KB Output is correct
50 Correct 1 ms 300 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 304 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 229 ms 51480 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 2 ms 724 KB Output is correct
58 Correct 6 ms 1816 KB Output is correct
59 Correct 5 ms 1108 KB Output is correct
60 Correct 111 ms 25628 KB Output is correct
61 Correct 165 ms 35916 KB Output is correct
62 Correct 193 ms 42972 KB Output is correct
63 Correct 241 ms 51660 KB Output is correct
64 Correct 1 ms 228 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 192 ms 40104 KB Output is correct
68 Correct 244 ms 35484 KB Output is correct
69 Correct 210 ms 37568 KB Output is correct
70 Correct 3 ms 696 KB Output is correct
71 Correct 5 ms 852 KB Output is correct
72 Correct 105 ms 20852 KB Output is correct
73 Correct 164 ms 31896 KB Output is correct
74 Correct 225 ms 41920 KB Output is correct
75 Correct 224 ms 47004 KB Output is correct
76 Correct 200 ms 40068 KB Output is correct
77 Correct 3 ms 852 KB Output is correct
78 Correct 4 ms 952 KB Output is correct
79 Correct 107 ms 22872 KB Output is correct
80 Correct 167 ms 34836 KB Output is correct
81 Correct 226 ms 45912 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 122 ms 19180 KB Output is correct
10 Correct 13 ms 2260 KB Output is correct
11 Correct 44 ms 10452 KB Output is correct
12 Correct 12 ms 3200 KB Output is correct
13 Correct 20 ms 5120 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 99 ms 19288 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 231 ms 61256 KB Output is correct
21 Correct 262 ms 45440 KB Output is correct
22 Correct 233 ms 61084 KB Output is correct
23 Correct 173 ms 31284 KB Output is correct
24 Correct 60 ms 7680 KB Output is correct
25 Correct 55 ms 7680 KB Output is correct
26 Correct 55 ms 7668 KB Output is correct
27 Correct 188 ms 29052 KB Output is correct
28 Correct 181 ms 29176 KB Output is correct
29 Correct 230 ms 29136 KB Output is correct
30 Correct 228 ms 29148 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 15 ms 3028 KB Output is correct
33 Correct 33 ms 5360 KB Output is correct
34 Correct 226 ms 63804 KB Output is correct
35 Correct 6 ms 1108 KB Output is correct
36 Correct 23 ms 3312 KB Output is correct
37 Correct 34 ms 5816 KB Output is correct
38 Correct 89 ms 13416 KB Output is correct
39 Correct 122 ms 17956 KB Output is correct
40 Correct 187 ms 23832 KB Output is correct
41 Correct 237 ms 27892 KB Output is correct
42 Correct 230 ms 32624 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 0 ms 304 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 304 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 1 ms 468 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 104 ms 21408 KB Output is correct
57 Correct 157 ms 31708 KB Output is correct
58 Correct 150 ms 31668 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 1 ms 300 KB Output is correct
62 Correct 196 ms 40112 KB Output is correct
63 Correct 203 ms 35452 KB Output is correct
64 Correct 216 ms 37584 KB Output is correct
65 Correct 2 ms 696 KB Output is correct
66 Correct 3 ms 852 KB Output is correct
67 Correct 104 ms 20800 KB Output is correct
68 Correct 189 ms 31848 KB Output is correct
69 Correct 222 ms 41948 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 122 ms 19180 KB Output is correct
10 Correct 13 ms 2260 KB Output is correct
11 Correct 44 ms 10452 KB Output is correct
12 Correct 12 ms 3200 KB Output is correct
13 Correct 20 ms 5120 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 99 ms 19288 KB Output is correct
17 Correct 207 ms 39008 KB Output is correct
18 Correct 215 ms 36624 KB Output is correct
19 Correct 236 ms 63428 KB Output is correct
20 Correct 226 ms 36680 KB Output is correct
21 Correct 203 ms 30416 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 33 ms 5908 KB Output is correct
24 Correct 14 ms 2052 KB Output is correct
25 Correct 26 ms 4564 KB Output is correct
26 Correct 42 ms 7044 KB Output is correct
27 Correct 112 ms 17940 KB Output is correct
28 Correct 169 ms 22480 KB Output is correct
29 Correct 193 ms 27872 KB Output is correct
30 Correct 238 ms 31332 KB Output is correct
31 Correct 262 ms 35576 KB Output is correct
32 Correct 236 ms 46928 KB Output is correct
33 Correct 202 ms 40080 KB Output is correct
34 Correct 3 ms 852 KB Output is correct
35 Correct 3 ms 980 KB Output is correct
36 Correct 117 ms 22816 KB Output is correct
37 Correct 196 ms 34848 KB Output is correct
38 Correct 226 ms 45836 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 122 ms 19180 KB Output is correct
10 Correct 13 ms 2260 KB Output is correct
11 Correct 44 ms 10452 KB Output is correct
12 Correct 12 ms 3200 KB Output is correct
13 Correct 20 ms 5120 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 99 ms 19288 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 256 ms 62020 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 2 ms 724 KB Output is correct
27 Correct 2 ms 596 KB Output is correct
28 Correct 132 ms 24892 KB Output is correct
29 Correct 131 ms 37164 KB Output is correct
30 Correct 180 ms 49900 KB Output is correct
31 Correct 231 ms 62016 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 300 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 304 KB Output is correct
37 Correct 1 ms 308 KB Output is correct
38 Correct 1 ms 304 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 308 KB Output is correct
42 Correct 1 ms 304 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 101 ms 21416 KB Output is correct
46 Correct 150 ms 31692 KB Output is correct
47 Correct 149 ms 31632 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 308 KB Output is correct
50 Correct 1 ms 300 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 304 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 229 ms 51480 KB Output is correct
56 Correct 0 ms 212 KB Output is correct
57 Correct 2 ms 724 KB Output is correct
58 Correct 6 ms 1816 KB Output is correct
59 Correct 5 ms 1108 KB Output is correct
60 Correct 111 ms 25628 KB Output is correct
61 Correct 165 ms 35916 KB Output is correct
62 Correct 193 ms 42972 KB Output is correct
63 Correct 241 ms 51660 KB Output is correct
64 Correct 1 ms 228 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 192 ms 40104 KB Output is correct
68 Correct 244 ms 35484 KB Output is correct
69 Correct 210 ms 37568 KB Output is correct
70 Correct 3 ms 696 KB Output is correct
71 Correct 5 ms 852 KB Output is correct
72 Correct 105 ms 20852 KB Output is correct
73 Correct 164 ms 31896 KB Output is correct
74 Correct 225 ms 41920 KB Output is correct
75 Correct 224 ms 47004 KB Output is correct
76 Correct 200 ms 40068 KB Output is correct
77 Correct 3 ms 852 KB Output is correct
78 Correct 4 ms 952 KB Output is correct
79 Correct 107 ms 22872 KB Output is correct
80 Correct 167 ms 34836 KB Output is correct
81 Correct 226 ms 45912 KB Output is correct
82 Correct 0 ms 212 KB Output is correct
83 Correct 0 ms 212 KB Output is correct
84 Correct 0 ms 212 KB Output is correct
85 Correct 231 ms 61256 KB Output is correct
86 Correct 262 ms 45440 KB Output is correct
87 Correct 233 ms 61084 KB Output is correct
88 Correct 173 ms 31284 KB Output is correct
89 Correct 60 ms 7680 KB Output is correct
90 Correct 55 ms 7680 KB Output is correct
91 Correct 55 ms 7668 KB Output is correct
92 Correct 188 ms 29052 KB Output is correct
93 Correct 181 ms 29176 KB Output is correct
94 Correct 230 ms 29136 KB Output is correct
95 Correct 228 ms 29148 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 15 ms 3028 KB Output is correct
98 Correct 33 ms 5360 KB Output is correct
99 Correct 226 ms 63804 KB Output is correct
100 Correct 6 ms 1108 KB Output is correct
101 Correct 23 ms 3312 KB Output is correct
102 Correct 34 ms 5816 KB Output is correct
103 Correct 89 ms 13416 KB Output is correct
104 Correct 122 ms 17956 KB Output is correct
105 Correct 187 ms 23832 KB Output is correct
106 Correct 237 ms 27892 KB Output is correct
107 Correct 230 ms 32624 KB Output is correct
108 Correct 1 ms 212 KB Output is correct
109 Correct 0 ms 304 KB Output is correct
110 Correct 1 ms 212 KB Output is correct
111 Correct 0 ms 212 KB Output is correct
112 Correct 0 ms 212 KB Output is correct
113 Correct 1 ms 212 KB Output is correct
114 Correct 1 ms 304 KB Output is correct
115 Correct 0 ms 212 KB Output is correct
116 Correct 0 ms 212 KB Output is correct
117 Correct 1 ms 212 KB Output is correct
118 Correct 0 ms 212 KB Output is correct
119 Correct 1 ms 468 KB Output is correct
120 Correct 1 ms 468 KB Output is correct
121 Correct 104 ms 21408 KB Output is correct
122 Correct 157 ms 31708 KB Output is correct
123 Correct 150 ms 31668 KB Output is correct
124 Correct 1 ms 212 KB Output is correct
125 Correct 1 ms 212 KB Output is correct
126 Correct 1 ms 300 KB Output is correct
127 Correct 196 ms 40112 KB Output is correct
128 Correct 203 ms 35452 KB Output is correct
129 Correct 216 ms 37584 KB Output is correct
130 Correct 2 ms 696 KB Output is correct
131 Correct 3 ms 852 KB Output is correct
132 Correct 104 ms 20800 KB Output is correct
133 Correct 189 ms 31848 KB Output is correct
134 Correct 222 ms 41948 KB Output is correct
135 Correct 207 ms 39008 KB Output is correct
136 Correct 215 ms 36624 KB Output is correct
137 Correct 236 ms 63428 KB Output is correct
138 Correct 226 ms 36680 KB Output is correct
139 Correct 203 ms 30416 KB Output is correct
140 Correct 1 ms 212 KB Output is correct
141 Correct 33 ms 5908 KB Output is correct
142 Correct 14 ms 2052 KB Output is correct
143 Correct 26 ms 4564 KB Output is correct
144 Correct 42 ms 7044 KB Output is correct
145 Correct 112 ms 17940 KB Output is correct
146 Correct 169 ms 22480 KB Output is correct
147 Correct 193 ms 27872 KB Output is correct
148 Correct 238 ms 31332 KB Output is correct
149 Correct 262 ms 35576 KB Output is correct
150 Correct 236 ms 46928 KB Output is correct
151 Correct 202 ms 40080 KB Output is correct
152 Correct 3 ms 852 KB Output is correct
153 Correct 3 ms 980 KB Output is correct
154 Correct 117 ms 22816 KB Output is correct
155 Correct 196 ms 34848 KB Output is correct
156 Correct 226 ms 45836 KB Output is correct
157 Correct 1 ms 212 KB Output is correct
158 Correct 1 ms 212 KB Output is correct
159 Correct 1 ms 212 KB Output is correct
160 Correct 1 ms 212 KB Output is correct
161 Correct 264 ms 43944 KB Output is correct
162 Correct 254 ms 63856 KB Output is correct
163 Correct 241 ms 53144 KB Output is correct
164 Correct 218 ms 53196 KB Output is correct
165 Correct 263 ms 59824 KB Output is correct
166 Correct 230 ms 61728 KB Output is correct
167 Incorrect 44 ms 6072 KB Solution announced impossible, but it is possible.
168 Halted 0 ms 0 KB -