oj.uz

Submission #1057557

# Submission time Handle Problem Language Result Execution time Memory
1057557 2024-08-13T21:34:44 Z Zicrus Fountain Parks (IOI21_parks) C++17
70 / 100
 486 ms 103188 KB 
#include <bits/stdc++.h>
#include "parks.h"
using namespace std;
 
typedef long long ll;
 
ll n;
 
vector<ll> uflnk;
vector<ll> sz;
 
ll find(ll a) {
    if (a != uflnk[a]) uflnk[a] = find(uflnk[a]);
    return uflnk[a];
}

bool same(ll a, ll b) {
    return find(a) == find(b);
}
 
bool unite(ll a, ll b) {
    a = find(a); b = find(b);
    if (a == b) return false;
    if (sz[a] > sz[b]) swap(a, b);
    uflnk[a] = b;
    sz[b] += sz[a];
    return true;
}
 
int construct_roads(vector<int> x, vector<int> y) {
    n = x.size();
    vector<pair<pair<ll, ll>, ll>> coords(n);
    for (int i = 0; i < n; i++) coords[i] = {{x[i], y[i]}, i};
    sort(coords.begin(), coords.end());
    for (int i = 0; i < n; i++) {
        x[i] = coords[i].first.first;
        y[i] = coords[i].first.second;
    }
    uflnk = vector<ll>(n);
    sz = vector<ll>(n, 1);
    for (int i = 0; i < n; i++) uflnk[i] = i;
    unordered_map<ll, ll> pts;
    vector<pair<ll, ll>> edges;
    unordered_set<ll> hasEdge;
    for (int i = 0; i < n; i++) {
        ll hash = ((ll)x[i] << 31) | (ll)y[i];
        pts[hash] = i;
    }
    for (ll i = 0; i < n; i++) {
        ll hashL = (((ll)x[i]-2) << 31) | ((ll)y[i]);
        if (pts.count(hashL)) {
            if (!same(i, pts[hashL])) {
                edges.push_back({i, pts[hashL]});
                unite(i, pts[hashL]);
            }
        }
        ll hashR = (((ll)x[i]+2) << 31) | ((ll)y[i]);
        if (pts.count(hashR)) {
            if (!same(i, pts[hashR])) {
                edges.push_back({i, pts[hashR]});
                unite(i, pts[hashR]);
            }
        }
        ll hashD = (((ll)x[i]) << 31) | ((ll)y[i]-2);
        if (pts.count(hashD)) {
            if (!same(i, pts[hashD])) {
                edges.push_back({i, pts[hashD]});
                unite(i, pts[hashD]);
            }
        }
        ll hashU = (((ll)x[i]) << 31) | ((ll)y[i]+2);
        if (pts.count(hashU)) {
            if (!same(i, pts[hashU])) {
                edges.push_back({i, pts[hashU]});
                unite(i, pts[hashU]);
            }
        }
    }
 
    unordered_map<ll, ll> poss;
    unordered_set<ll> twos;
    unordered_map<ll, ll> lnk, lnkU;
    vector<pair<ll, ll>> edgeHashes(edges.size());
    for (int i = 0; i < edges.size(); i++) {
        auto e = edges[i];
        ll midX = (x[e.first] + x[e.second]) / 2;
        ll midY = (y[e.first] + y[e.second]) / 2;
        ll leftX = midX - (midY - y[e.second]);
        ll leftY = midY + (midX - x[e.second]);
        ll rightX = midX + (midY - y[e.second]);
        ll rightY = midY - (midX - x[e.second]);
        ll hashL = (leftX << 31) | leftY;
        ll hashR = (rightX << 31) | rightY;
        if (twos.count(hashL)) twos.erase(hashL);
        poss[hashL]++;
        if (poss[hashL] >= 2) twos.insert(hashL);
        if (twos.count(hashR)) twos.erase(hashR);
        poss[hashR]++;
        if (poss[hashR] >= 2) twos.insert(hashR);
        lnk[hashL] ^= i;
        lnk[hashR] ^= i;
        lnkU[hashL] = i;
        lnkU[hashR] = i;
        edgeHashes[i] = {hashL, hashR};
    }
 
    vector<int> a(edges.size()), b(edges.size());
    queue<ll> q;
    for (auto &e : poss) {
        if (e.second != 1) continue;
        q.push(e.first);
    }
    unordered_set<ll> used;
    while (used.size() < edges.size()) {
        while (!q.empty()) {
            ll hash = q.front(); q.pop();
            if (poss[hash] != 1 || used.count(hash)) continue;
            ll id = lnk[hash];
            a[id] = hash >> 31;
            b[id] = hash & ~(1 << 31);
            used.insert(id);
            if (twos.count(edgeHashes[id].first)) twos.erase(edgeHashes[id].first);
            if (--poss[edgeHashes[id].first] == 1) q.push(edgeHashes[id].first);
            if (poss[edgeHashes[id].first] >= 2) twos.insert(edgeHashes[id].first);
            if (twos.count(edgeHashes[id].second)) twos.erase(edgeHashes[id].second);
            if (--poss[edgeHashes[id].second] == 1) q.push(edgeHashes[id].second);
            if (poss[edgeHashes[id].second] >= 2) twos.insert(edgeHashes[id].second);
            lnk[edgeHashes[id].first] ^= id;
            lnk[edgeHashes[id].second] ^= id;
        }
        if (used.size() < edges.size() && twos.empty()) {
            for (auto &e : poss) {
                if (e.second == 1) q.push(e.first);
                if (e.second >= 2) twos.insert(e.first);
            }
            if (q.empty() && twos.empty()) throw;
        }
        else if (used.size() < edges.size() && !twos.empty()) {
            ll v = *twos.begin();
            twos.erase(v);
            for (int i = 0; i < 1; i = 10) {
                i = lnkU[v];
                if (used.count(i)) continue;
                auto e = edges[i];
                ll midX = (x[e.first] + x[e.second]) / 2;
                ll midY = (y[e.first] + y[e.second]) / 2;
                if (abs(midX - (v >> 31)) + abs(midY - (v & ~(1 << 31))) > 1) continue;
                a[i] = v >> 31;
                b[i] = v & ~(1 << 31);
                poss[v] = 0;
                ll otherX = a[i] + 2 * (midX - a[i]);
                ll otherY = b[i] + 2 * (midY - b[i]);
                ll otherHash = (otherX << 31) | otherY;
                if (twos.count(otherHash)) twos.erase(otherHash);
                poss[otherHash]--;
                if (poss[otherHash] >= 2) twos.insert(otherHash);
                lnk[otherHash] ^= i;
                while (poss[otherHash] == 1) {
                    ll edge = lnk[otherHash];
                    auto e = edges[edge];
                    ll midX = (x[e.first] + x[e.second]) / 2;
                    ll midY = (y[e.first] + y[e.second]) / 2;
                    a[edge] = otherHash >> 31;
                    b[edge] = otherHash & ~(1 << 31);
                    ll otherX = a[edge] + 2 * (midX - a[edge]);
                    ll otherY = b[edge] + 2 * (midY - b[edge]);
                    otherHash = (otherX << 31) | otherY;
                    if (twos.count(otherHash)) twos.erase(otherHash);
                    poss[otherHash]--;
                    if (poss[otherHash] >= 2) twos.insert(otherHash);
                    lnk[otherHash] ^= edge;
                    used.insert(edge);
                }
                used.insert(i);
                break;
            }
        }
    }
 
    uflnk = vector<ll>(n);
    sz = vector<ll>(n, 1);
    for (int i = 0; i < n; i++) uflnk[i] = i;
    vector<int> u, v;
    for (int i = 0; i < edges.size(); i++) {
        u.push_back(coords[edges[i].first].second);
        v.push_back(coords[edges[i].second].second);
        unite(edges[i].first, edges[i].second);
    }
 
    if (sz[find(0)] < n) return 0;
 
    build(u, v, a, b);
    return 1;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:84: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]
   84 |     for (int i = 0; i < edges.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~
parks.cpp:184: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]
  184 |     for (int i = 0; i < edges.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 432 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 344 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 0 ms 348 KB Output is correct
9 Correct 113 ms 50864 KB Output is correct
10 Correct 8 ms 5080 KB Output is correct
11 Correct 45 ms 27084 KB Output is correct
12 Correct 13 ms 7664 KB Output is correct
13 Correct 39 ms 22040 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 107 ms 50872 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 432 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 344 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 0 ms 348 KB Output is correct
9 Correct 113 ms 50864 KB Output is correct
10 Correct 8 ms 5080 KB Output is correct
11 Correct 45 ms 27084 KB Output is correct
12 Correct 13 ms 7664 KB Output is correct
13 Correct 39 ms 22040 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 107 ms 50872 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 404 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 225 ms 76240 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 2 ms 856 KB Output is correct
26 Correct 3 ms 1372 KB Output is correct
27 Correct 3 ms 1628 KB Output is correct
28 Correct 61 ms 27752 KB Output is correct
29 Correct 104 ms 44100 KB Output is correct
30 Correct 138 ms 55656 KB Output is correct
31 Correct 209 ms 76160 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 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 348 KB Output is correct
37 Correct 1 ms 348 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 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 2 ms 1116 KB Output is correct
44 Correct 4 ms 1468 KB Output is correct
45 Correct 119 ms 41656 KB Output is correct
46 Correct 208 ms 63016 KB Output is correct
47 Correct 236 ms 62876 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 432 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 344 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 0 ms 348 KB Output is correct
9 Correct 113 ms 50864 KB Output is correct
10 Correct 8 ms 5080 KB Output is correct
11 Correct 45 ms 27084 KB Output is correct
12 Correct 13 ms 7664 KB Output is correct
13 Correct 39 ms 22040 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 107 ms 50872 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 404 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 225 ms 76240 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 2 ms 856 KB Output is correct
26 Correct 3 ms 1372 KB Output is correct
27 Correct 3 ms 1628 KB Output is correct
28 Correct 61 ms 27752 KB Output is correct
29 Correct 104 ms 44100 KB Output is correct
30 Correct 138 ms 55656 KB Output is correct
31 Correct 209 ms 76160 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 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 348 KB Output is correct
37 Correct 1 ms 348 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 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 2 ms 1116 KB Output is correct
44 Correct 4 ms 1468 KB Output is correct
45 Correct 119 ms 41656 KB Output is correct
46 Correct 208 ms 63016 KB Output is correct
47 Correct 236 ms 62876 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 257 ms 76588 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 1116 KB Output is correct
58 Correct 5 ms 2652 KB Output is correct
59 Correct 7 ms 3648 KB Output is correct
60 Correct 94 ms 38180 KB Output is correct
61 Correct 134 ms 51068 KB Output is correct
62 Correct 175 ms 58276 KB Output is correct
63 Correct 221 ms 76608 KB Output is correct
64 Correct 1 ms 344 KB Output is correct
65 Correct 1 ms 344 KB Output is correct
66 Correct 1 ms 344 KB Output is correct
67 Correct 244 ms 102528 KB Output is correct
68 Correct 244 ms 102420 KB Output is correct
69 Correct 251 ms 102436 KB Output is correct
70 Correct 4 ms 1884 KB Output is correct
71 Correct 10 ms 3492 KB Output is correct
72 Correct 182 ms 41204 KB Output is correct
73 Correct 337 ms 62868 KB Output is correct
74 Correct 486 ms 82232 KB Output is correct
75 Correct 230 ms 83012 KB Output is correct
76 Correct 274 ms 102412 KB Output is correct
77 Correct 7 ms 2140 KB Output is correct
78 Correct 10 ms 3768 KB Output is correct
79 Correct 161 ms 41308 KB Output is correct
80 Correct 235 ms 62616 KB Output is correct
81 Correct 324 ms 82212 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 432 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 344 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 0 ms 348 KB Output is correct
9 Correct 113 ms 50864 KB Output is correct
10 Correct 8 ms 5080 KB Output is correct
11 Correct 45 ms 27084 KB Output is correct
12 Correct 13 ms 7664 KB Output is correct
13 Correct 39 ms 22040 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 107 ms 50872 KB Output is correct
17 Correct 1 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 281 ms 77748 KB Output is correct
21 Correct 367 ms 77612 KB Output is correct
22 Correct 338 ms 77636 KB Output is correct
23 Correct 308 ms 79192 KB Output is correct
24 Correct 67 ms 23680 KB Output is correct
25 Correct 156 ms 96624 KB Output is correct
26 Correct 199 ms 96008 KB Output is correct
27 Correct 237 ms 101688 KB Output is correct
28 Correct 253 ms 101644 KB Output is correct
29 Correct 228 ms 101648 KB Output is correct
30 Correct 212 ms 101404 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 16 ms 5840 KB Output is correct
33 Correct 26 ms 12440 KB Output is correct
34 Correct 283 ms 77964 KB Output is correct
35 Correct 11 ms 4052 KB Output is correct
36 Correct 53 ms 18756 KB Output is correct
37 Correct 148 ms 37024 KB Output is correct
38 Correct 96 ms 32428 KB Output is correct
39 Correct 138 ms 44060 KB Output is correct
40 Correct 182 ms 55344 KB Output is correct
41 Correct 258 ms 67408 KB Output is correct
42 Correct 327 ms 80188 KB Output is correct
43 Correct 0 ms 600 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 2 ms 1116 KB Output is correct
55 Correct 2 ms 1372 KB Output is correct
56 Correct 114 ms 41576 KB Output is correct
57 Correct 179 ms 61668 KB Output is correct
58 Correct 176 ms 62256 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 344 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 229 ms 102380 KB Output is correct
63 Correct 238 ms 102420 KB Output is correct
64 Correct 229 ms 101912 KB Output is correct
65 Correct 4 ms 1880 KB Output is correct
66 Correct 8 ms 3424 KB Output is correct
67 Correct 130 ms 41000 KB Output is correct
68 Correct 229 ms 64216 KB Output is correct
69 Correct 310 ms 82428 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 432 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 344 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 0 ms 348 KB Output is correct
9 Correct 113 ms 50864 KB Output is correct
10 Correct 8 ms 5080 KB Output is correct
11 Correct 45 ms 27084 KB Output is correct
12 Correct 13 ms 7664 KB Output is correct
13 Correct 39 ms 22040 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 107 ms 50872 KB Output is correct
17 Correct 404 ms 102900 KB Output is correct
18 Correct 418 ms 102408 KB Output is correct
19 Correct 290 ms 77888 KB Output is correct
20 Correct 202 ms 80764 KB Output is correct
21 Correct 215 ms 80580 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 43 ms 12740 KB Output is correct
24 Correct 19 ms 8076 KB Output is correct
25 Correct 74 ms 28028 KB Output is correct
26 Correct 128 ms 44648 KB Output is correct
27 Correct 119 ms 41120 KB Output is correct
28 Correct 163 ms 50204 KB Output is correct
29 Correct 206 ms 62448 KB Output is correct
30 Correct 248 ms 73712 KB Output is correct
31 Correct 285 ms 81980 KB Output is correct
32 Correct 199 ms 83776 KB Output is correct
33 Correct 258 ms 103188 KB Output is correct
34 Correct 4 ms 2140 KB Output is correct
35 Correct 8 ms 3784 KB Output is correct
36 Correct 126 ms 41060 KB Output is correct
37 Correct 220 ms 63224 KB Output is correct
38 Correct 287 ms 81732 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 432 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 344 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 0 ms 348 KB Output is correct
9 Correct 113 ms 50864 KB Output is correct
10 Correct 8 ms 5080 KB Output is correct
11 Correct 45 ms 27084 KB Output is correct
12 Correct 13 ms 7664 KB Output is correct
13 Correct 39 ms 22040 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 107 ms 50872 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 404 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 225 ms 76240 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 2 ms 856 KB Output is correct
26 Correct 3 ms 1372 KB Output is correct
27 Correct 3 ms 1628 KB Output is correct
28 Correct 61 ms 27752 KB Output is correct
29 Correct 104 ms 44100 KB Output is correct
30 Correct 138 ms 55656 KB Output is correct
31 Correct 209 ms 76160 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 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 348 KB Output is correct
37 Correct 1 ms 348 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 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 2 ms 1116 KB Output is correct
44 Correct 4 ms 1468 KB Output is correct
45 Correct 119 ms 41656 KB Output is correct
46 Correct 208 ms 63016 KB Output is correct
47 Correct 236 ms 62876 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 257 ms 76588 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 1116 KB Output is correct
58 Correct 5 ms 2652 KB Output is correct
59 Correct 7 ms 3648 KB Output is correct
60 Correct 94 ms 38180 KB Output is correct
61 Correct 134 ms 51068 KB Output is correct
62 Correct 175 ms 58276 KB Output is correct
63 Correct 221 ms 76608 KB Output is correct
64 Correct 1 ms 344 KB Output is correct
65 Correct 1 ms 344 KB Output is correct
66 Correct 1 ms 344 KB Output is correct
67 Correct 244 ms 102528 KB Output is correct
68 Correct 244 ms 102420 KB Output is correct
69 Correct 251 ms 102436 KB Output is correct
70 Correct 4 ms 1884 KB Output is correct
71 Correct 10 ms 3492 KB Output is correct
72 Correct 182 ms 41204 KB Output is correct
73 Correct 337 ms 62868 KB Output is correct
74 Correct 486 ms 82232 KB Output is correct
75 Correct 230 ms 83012 KB Output is correct
76 Correct 274 ms 102412 KB Output is correct
77 Correct 7 ms 2140 KB Output is correct
78 Correct 10 ms 3768 KB Output is correct
79 Correct 161 ms 41308 KB Output is correct
80 Correct 235 ms 62616 KB Output is correct
81 Correct 324 ms 82212 KB Output is correct
82 Correct 1 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 281 ms 77748 KB Output is correct
86 Correct 367 ms 77612 KB Output is correct
87 Correct 338 ms 77636 KB Output is correct
88 Correct 308 ms 79192 KB Output is correct
89 Correct 67 ms 23680 KB Output is correct
90 Correct 156 ms 96624 KB Output is correct
91 Correct 199 ms 96008 KB Output is correct
92 Correct 237 ms 101688 KB Output is correct
93 Correct 253 ms 101644 KB Output is correct
94 Correct 228 ms 101648 KB Output is correct
95 Correct 212 ms 101404 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 16 ms 5840 KB Output is correct
98 Correct 26 ms 12440 KB Output is correct
99 Correct 283 ms 77964 KB Output is correct
100 Correct 11 ms 4052 KB Output is correct
101 Correct 53 ms 18756 KB Output is correct
102 Correct 148 ms 37024 KB Output is correct
103 Correct 96 ms 32428 KB Output is correct
104 Correct 138 ms 44060 KB Output is correct
105 Correct 182 ms 55344 KB Output is correct
106 Correct 258 ms 67408 KB Output is correct
107 Correct 327 ms 80188 KB Output is correct
108 Correct 0 ms 600 KB Output is correct
109 Correct 0 ms 344 KB Output is correct
110 Correct 0 ms 348 KB Output is correct
111 Correct 0 ms 348 KB Output is correct
112 Correct 1 ms 348 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 348 KB Output is correct
117 Correct 0 ms 348 KB Output is correct
118 Correct 0 ms 348 KB Output is correct
119 Correct 2 ms 1116 KB Output is correct
120 Correct 2 ms 1372 KB Output is correct
121 Correct 114 ms 41576 KB Output is correct
122 Correct 179 ms 61668 KB Output is correct
123 Correct 176 ms 62256 KB Output is correct
124 Correct 0 ms 348 KB Output is correct
125 Correct 0 ms 344 KB Output is correct
126 Correct 0 ms 348 KB Output is correct
127 Correct 229 ms 102380 KB Output is correct
128 Correct 238 ms 102420 KB Output is correct
129 Correct 229 ms 101912 KB Output is correct
130 Correct 4 ms 1880 KB Output is correct
131 Correct 8 ms 3424 KB Output is correct
132 Correct 130 ms 41000 KB Output is correct
133 Correct 229 ms 64216 KB Output is correct
134 Correct 310 ms 82428 KB Output is correct
135 Correct 404 ms 102900 KB Output is correct
136 Correct 418 ms 102408 KB Output is correct
137 Correct 290 ms 77888 KB Output is correct
138 Correct 202 ms 80764 KB Output is correct
139 Correct 215 ms 80580 KB Output is correct
140 Correct 0 ms 348 KB Output is correct
141 Correct 43 ms 12740 KB Output is correct
142 Correct 19 ms 8076 KB Output is correct
143 Correct 74 ms 28028 KB Output is correct
144 Correct 128 ms 44648 KB Output is correct
145 Correct 119 ms 41120 KB Output is correct
146 Correct 163 ms 50204 KB Output is correct
147 Correct 206 ms 62448 KB Output is correct
148 Correct 248 ms 73712 KB Output is correct
149 Correct 285 ms 81980 KB Output is correct
150 Correct 199 ms 83776 KB Output is correct
151 Correct 258 ms 103188 KB Output is correct
152 Correct 4 ms 2140 KB Output is correct
153 Correct 8 ms 3784 KB Output is correct
154 Correct 126 ms 41060 KB Output is correct
155 Correct 220 ms 63224 KB Output is correct
156 Correct 287 ms 81732 KB Output is correct
157 Correct 0 ms 344 KB Output is correct
158 Correct 0 ms 348 KB Output is correct
159 Correct 0 ms 348 KB Output is correct
160 Correct 0 ms 348 KB Output is correct
161 Correct 237 ms 77268 KB Output is correct
162 Correct 240 ms 77884 KB Output is correct
163 Correct 252 ms 77368 KB Output is correct
164 Correct 239 ms 77228 KB Output is correct
165 Correct 253 ms 78148 KB Output is correct
166 Correct 243 ms 77540 KB Output is correct
167 Runtime error 49 ms 33632 KB Execution killed with signal 6
168 Halted 0 ms 0 KB -