oj.uz

Submission #1057561

# Submission time Handle Problem Language Result Execution time Memory
1057561 2024-08-13T21:38:22 Z Zicrus Fountain Parks (IOI21_parks) C++17
70 / 100
 3500 ms 101396 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());
    mt19937 mt(67234);
    shuffle(edges.begin(), edges.end(), mt);
    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);
            ll 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);
        }
    }
 
    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:86: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]
   86 |     for (int i = 0; i < edges.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~
parks.cpp:183: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]
  183 |     for (int i = 0; i < edges.size(); i++) {
      |                     ~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 388 KB Output is correct
4 Correct 1 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 190 ms 51176 KB Output is correct
10 Correct 10 ms 5080 KB Output is correct
11 Correct 75 ms 27036 KB Output is correct
12 Correct 24 ms 7664 KB Output is correct
13 Correct 51 ms 22152 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 183 ms 51072 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 388 KB Output is correct
4 Correct 1 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 190 ms 51176 KB Output is correct
10 Correct 10 ms 5080 KB Output is correct
11 Correct 75 ms 27036 KB Output is correct
12 Correct 24 ms 7664 KB Output is correct
13 Correct 51 ms 22152 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 183 ms 51072 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 0 ms 600 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 431 ms 76656 KB Output is correct
24 Correct 1 ms 440 KB Output is correct
25 Correct 1 ms 848 KB Output is correct
26 Correct 3 ms 1372 KB Output is correct
27 Correct 3 ms 1624 KB Output is correct
28 Correct 100 ms 27868 KB Output is correct
29 Correct 181 ms 43736 KB Output is correct
30 Correct 291 ms 55348 KB Output is correct
31 Correct 420 ms 74812 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 0 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 3 ms 1496 KB Output is correct
45 Correct 177 ms 40656 KB Output is correct
46 Correct 325 ms 60636 KB Output is correct
47 Correct 300 ms 61920 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 388 KB Output is correct
4 Correct 1 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 190 ms 51176 KB Output is correct
10 Correct 10 ms 5080 KB Output is correct
11 Correct 75 ms 27036 KB Output is correct
12 Correct 24 ms 7664 KB Output is correct
13 Correct 51 ms 22152 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 183 ms 51072 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 0 ms 600 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 431 ms 76656 KB Output is correct
24 Correct 1 ms 440 KB Output is correct
25 Correct 1 ms 848 KB Output is correct
26 Correct 3 ms 1372 KB Output is correct
27 Correct 3 ms 1624 KB Output is correct
28 Correct 100 ms 27868 KB Output is correct
29 Correct 181 ms 43736 KB Output is correct
30 Correct 291 ms 55348 KB Output is correct
31 Correct 420 ms 74812 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 0 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 3 ms 1496 KB Output is correct
45 Correct 177 ms 40656 KB Output is correct
46 Correct 325 ms 60636 KB Output is correct
47 Correct 300 ms 61920 KB Output is correct
48 Correct 0 ms 344 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 417 ms 75580 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 2 ms 860 KB Output is correct
58 Correct 6 ms 2652 KB Output is correct
59 Correct 10 ms 3448 KB Output is correct
60 Correct 148 ms 37272 KB Output is correct
61 Correct 229 ms 48520 KB Output is correct
62 Correct 291 ms 57764 KB Output is correct
63 Correct 395 ms 74816 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 484 ms 100368 KB Output is correct
68 Correct 543 ms 100628 KB Output is correct
69 Correct 514 ms 100096 KB Output is correct
70 Correct 4 ms 1880 KB Output is correct
71 Correct 8 ms 3364 KB Output is correct
72 Correct 194 ms 40356 KB Output is correct
73 Correct 327 ms 61912 KB Output is correct
74 Correct 504 ms 80192 KB Output is correct
75 Correct 468 ms 81724 KB Output is correct
76 Correct 541 ms 101396 KB Output is correct
77 Correct 5 ms 2136 KB Output is correct
78 Correct 10 ms 3804 KB Output is correct
79 Correct 171 ms 40264 KB Output is correct
80 Correct 353 ms 62484 KB Output is correct
81 Correct 470 ms 79976 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 388 KB Output is correct
4 Correct 1 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 190 ms 51176 KB Output is correct
10 Correct 10 ms 5080 KB Output is correct
11 Correct 75 ms 27036 KB Output is correct
12 Correct 24 ms 7664 KB Output is correct
13 Correct 51 ms 22152 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 183 ms 51072 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 402 ms 75948 KB Output is correct
21 Correct 410 ms 75580 KB Output is correct
22 Correct 431 ms 75588 KB Output is correct
23 Correct 344 ms 76992 KB Output is correct
24 Correct 48 ms 21880 KB Output is correct
25 Correct 405 ms 94484 KB Output is correct
26 Correct 412 ms 95300 KB Output is correct
27 Correct 430 ms 100108 KB Output is correct
28 Correct 445 ms 100108 KB Output is correct
29 Correct 397 ms 100112 KB Output is correct
30 Correct 393 ms 100624 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 18 ms 5856 KB Output is correct
33 Correct 24 ms 11200 KB Output is correct
34 Correct 427 ms 76352 KB Output is correct
35 Correct 10 ms 4024 KB Output is correct
36 Correct 63 ms 18296 KB Output is correct
37 Correct 147 ms 36004 KB Output is correct
38 Correct 123 ms 31600 KB Output is correct
39 Correct 190 ms 42764 KB Output is correct
40 Correct 263 ms 54060 KB Output is correct
41 Correct 410 ms 66176 KB Output is correct
42 Correct 426 ms 77616 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 0 ms 348 KB Output is correct
47 Correct 0 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 3 ms 1500 KB Output is correct
56 Correct 176 ms 40600 KB Output is correct
57 Correct 330 ms 62172 KB Output is correct
58 Correct 317 ms 61660 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 491 ms 100916 KB Output is correct
63 Correct 479 ms 100880 KB Output is correct
64 Correct 522 ms 100132 KB Output is correct
65 Correct 4 ms 1884 KB Output is correct
66 Correct 8 ms 3340 KB Output is correct
67 Correct 183 ms 40332 KB Output is correct
68 Correct 349 ms 61524 KB Output is correct
69 Correct 521 ms 80188 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 388 KB Output is correct
4 Correct 1 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 190 ms 51176 KB Output is correct
10 Correct 10 ms 5080 KB Output is correct
11 Correct 75 ms 27036 KB Output is correct
12 Correct 24 ms 7664 KB Output is correct
13 Correct 51 ms 22152 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 183 ms 51072 KB Output is correct
17 Correct 640 ms 100360 KB Output is correct
18 Correct 524 ms 100364 KB Output is correct
19 Correct 417 ms 76612 KB Output is correct
20 Correct 420 ms 79456 KB Output is correct
21 Correct 392 ms 79236 KB Output is correct
22 Correct 0 ms 596 KB Output is correct
23 Correct 41 ms 12224 KB Output is correct
24 Correct 24 ms 7820 KB Output is correct
25 Correct 99 ms 27408 KB Output is correct
26 Correct 223 ms 43112 KB Output is correct
27 Correct 163 ms 40120 KB Output is correct
28 Correct 210 ms 48408 KB Output is correct
29 Correct 305 ms 60820 KB Output is correct
30 Correct 365 ms 72652 KB Output is correct
31 Correct 431 ms 79940 KB Output is correct
32 Correct 530 ms 82504 KB Output is correct
33 Correct 550 ms 100356 KB Output is correct
34 Correct 6 ms 2140 KB Output is correct
35 Correct 10 ms 3876 KB Output is correct
36 Correct 176 ms 40564 KB Output is correct
37 Correct 311 ms 61856 KB Output is correct
38 Correct 507 ms 80944 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 388 KB Output is correct
4 Correct 1 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 190 ms 51176 KB Output is correct
10 Correct 10 ms 5080 KB Output is correct
11 Correct 75 ms 27036 KB Output is correct
12 Correct 24 ms 7664 KB Output is correct
13 Correct 51 ms 22152 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 183 ms 51072 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 0 ms 600 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 431 ms 76656 KB Output is correct
24 Correct 1 ms 440 KB Output is correct
25 Correct 1 ms 848 KB Output is correct
26 Correct 3 ms 1372 KB Output is correct
27 Correct 3 ms 1624 KB Output is correct
28 Correct 100 ms 27868 KB Output is correct
29 Correct 181 ms 43736 KB Output is correct
30 Correct 291 ms 55348 KB Output is correct
31 Correct 420 ms 74812 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 0 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 3 ms 1496 KB Output is correct
45 Correct 177 ms 40656 KB Output is correct
46 Correct 325 ms 60636 KB Output is correct
47 Correct 300 ms 61920 KB Output is correct
48 Correct 0 ms 344 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 417 ms 75580 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 2 ms 860 KB Output is correct
58 Correct 6 ms 2652 KB Output is correct
59 Correct 10 ms 3448 KB Output is correct
60 Correct 148 ms 37272 KB Output is correct
61 Correct 229 ms 48520 KB Output is correct
62 Correct 291 ms 57764 KB Output is correct
63 Correct 395 ms 74816 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 484 ms 100368 KB Output is correct
68 Correct 543 ms 100628 KB Output is correct
69 Correct 514 ms 100096 KB Output is correct
70 Correct 4 ms 1880 KB Output is correct
71 Correct 8 ms 3364 KB Output is correct
72 Correct 194 ms 40356 KB Output is correct
73 Correct 327 ms 61912 KB Output is correct
74 Correct 504 ms 80192 KB Output is correct
75 Correct 468 ms 81724 KB Output is correct
76 Correct 541 ms 101396 KB Output is correct
77 Correct 5 ms 2136 KB Output is correct
78 Correct 10 ms 3804 KB Output is correct
79 Correct 171 ms 40264 KB Output is correct
80 Correct 353 ms 62484 KB Output is correct
81 Correct 470 ms 79976 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 402 ms 75948 KB Output is correct
86 Correct 410 ms 75580 KB Output is correct
87 Correct 431 ms 75588 KB Output is correct
88 Correct 344 ms 76992 KB Output is correct
89 Correct 48 ms 21880 KB Output is correct
90 Correct 405 ms 94484 KB Output is correct
91 Correct 412 ms 95300 KB Output is correct
92 Correct 430 ms 100108 KB Output is correct
93 Correct 445 ms 100108 KB Output is correct
94 Correct 397 ms 100112 KB Output is correct
95 Correct 393 ms 100624 KB Output is correct
96 Correct 0 ms 344 KB Output is correct
97 Correct 18 ms 5856 KB Output is correct
98 Correct 24 ms 11200 KB Output is correct
99 Correct 427 ms 76352 KB Output is correct
100 Correct 10 ms 4024 KB Output is correct
101 Correct 63 ms 18296 KB Output is correct
102 Correct 147 ms 36004 KB Output is correct
103 Correct 123 ms 31600 KB Output is correct
104 Correct 190 ms 42764 KB Output is correct
105 Correct 263 ms 54060 KB Output is correct
106 Correct 410 ms 66176 KB Output is correct
107 Correct 426 ms 77616 KB Output is correct
108 Correct 0 ms 348 KB Output is correct
109 Correct 0 ms 348 KB Output is correct
110 Correct 0 ms 348 KB Output is correct
111 Correct 0 ms 348 KB Output is correct
112 Correct 0 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 3 ms 1500 KB Output is correct
121 Correct 176 ms 40600 KB Output is correct
122 Correct 330 ms 62172 KB Output is correct
123 Correct 317 ms 61660 KB Output is correct
124 Correct 0 ms 348 KB Output is correct
125 Correct 0 ms 348 KB Output is correct
126 Correct 0 ms 348 KB Output is correct
127 Correct 491 ms 100916 KB Output is correct
128 Correct 479 ms 100880 KB Output is correct
129 Correct 522 ms 100132 KB Output is correct
130 Correct 4 ms 1884 KB Output is correct
131 Correct 8 ms 3340 KB Output is correct
132 Correct 183 ms 40332 KB Output is correct
133 Correct 349 ms 61524 KB Output is correct
134 Correct 521 ms 80188 KB Output is correct
135 Correct 640 ms 100360 KB Output is correct
136 Correct 524 ms 100364 KB Output is correct
137 Correct 417 ms 76612 KB Output is correct
138 Correct 420 ms 79456 KB Output is correct
139 Correct 392 ms 79236 KB Output is correct
140 Correct 0 ms 596 KB Output is correct
141 Correct 41 ms 12224 KB Output is correct
142 Correct 24 ms 7820 KB Output is correct
143 Correct 99 ms 27408 KB Output is correct
144 Correct 223 ms 43112 KB Output is correct
145 Correct 163 ms 40120 KB Output is correct
146 Correct 210 ms 48408 KB Output is correct
147 Correct 305 ms 60820 KB Output is correct
148 Correct 365 ms 72652 KB Output is correct
149 Correct 431 ms 79940 KB Output is correct
150 Correct 530 ms 82504 KB Output is correct
151 Correct 550 ms 100356 KB Output is correct
152 Correct 6 ms 2140 KB Output is correct
153 Correct 10 ms 3876 KB Output is correct
154 Correct 176 ms 40564 KB Output is correct
155 Correct 311 ms 61856 KB Output is correct
156 Correct 507 ms 80944 KB Output is correct
157 Correct 0 ms 348 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 377 ms 76456 KB Output is correct
162 Correct 435 ms 75572 KB Output is correct
163 Correct 437 ms 75328 KB Output is correct
164 Correct 435 ms 74820 KB Output is correct
165 Correct 422 ms 75588 KB Output is correct
166 Correct 373 ms 75720 KB Output is correct
167 Execution timed out 3551 ms 16476 KB Time limit exceeded
168 Halted 0 ms 0 KB -