oj.uz

답안 #1057563

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1057563 2024-08-13T21:39:51 Z Zicrus 분수 공원 (IOI21_parks) C++17
70 / 100
 3500 ms 100880 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(8765);
    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

# 결과 실행 시간 메모리 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 0 ms 348 KB Output is correct
9 Correct 186 ms 50240 KB Output is correct
10 Correct 12 ms 4824 KB Output is correct
11 Correct 72 ms 26772 KB Output is correct
12 Correct 16 ms 7408 KB Output is correct
13 Correct 57 ms 21808 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 186 ms 50216 KB Output is correct

Subtask #2
10.0 / 10.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 0 ms 348 KB Output is correct
9 Correct 186 ms 50240 KB Output is correct
10 Correct 12 ms 4824 KB Output is correct
11 Correct 72 ms 26772 KB Output is correct
12 Correct 16 ms 7408 KB Output is correct
13 Correct 57 ms 21808 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 186 ms 50216 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 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 391 ms 74580 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 2 ms 1288 KB Output is correct
27 Correct 3 ms 1628 KB Output is correct
28 Correct 97 ms 27096 KB Output is correct
29 Correct 187 ms 42960 KB Output is correct
30 Correct 262 ms 54596 KB Output is correct
31 Correct 426 ms 74552 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 344 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 1 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 1372 KB Output is correct
45 Correct 175 ms 40600 KB Output is correct
46 Correct 281 ms 62172 KB Output is correct
47 Correct 310 ms 60900 KB Output is correct

Subtask #3
15.0 / 15.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 0 ms 348 KB Output is correct
9 Correct 186 ms 50240 KB Output is correct
10 Correct 12 ms 4824 KB Output is correct
11 Correct 72 ms 26772 KB Output is correct
12 Correct 16 ms 7408 KB Output is correct
13 Correct 57 ms 21808 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 186 ms 50216 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 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 391 ms 74580 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 2 ms 1288 KB Output is correct
27 Correct 3 ms 1628 KB Output is correct
28 Correct 97 ms 27096 KB Output is correct
29 Correct 187 ms 42960 KB Output is correct
30 Correct 262 ms 54596 KB Output is correct
31 Correct 426 ms 74552 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 344 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 1 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 1372 KB Output is correct
45 Correct 175 ms 40600 KB Output is correct
46 Correct 281 ms 62172 KB Output is correct
47 Correct 310 ms 60900 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 0 ms 344 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 382 ms 75716 KB Output is correct
56 Correct 0 ms 344 KB Output is correct
57 Correct 2 ms 1112 KB Output is correct
58 Correct 6 ms 2584 KB Output is correct
59 Correct 10 ms 3400 KB Output is correct
60 Correct 154 ms 37240 KB Output is correct
61 Correct 224 ms 50296 KB Output is correct
62 Correct 291 ms 57508 KB Output is correct
63 Correct 363 ms 74812 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 497 ms 100504 KB Output is correct
68 Correct 500 ms 100372 KB Output is correct
69 Correct 494 ms 100132 KB Output is correct
70 Correct 4 ms 1880 KB Output is correct
71 Correct 8 ms 3420 KB Output is correct
72 Correct 167 ms 40208 KB Output is correct
73 Correct 310 ms 62360 KB Output is correct
74 Correct 478 ms 80708 KB Output is correct
75 Correct 519 ms 82500 KB Output is correct
76 Correct 516 ms 100368 KB Output is correct
77 Correct 5 ms 2136 KB Output is correct
78 Correct 10 ms 3808 KB Output is correct
79 Correct 172 ms 40272 KB Output is correct
80 Correct 336 ms 62764 KB Output is correct
81 Correct 450 ms 80204 KB Output is correct

Subtask #4
20.0 / 20.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 0 ms 348 KB Output is correct
9 Correct 186 ms 50240 KB Output is correct
10 Correct 12 ms 4824 KB Output is correct
11 Correct 72 ms 26772 KB Output is correct
12 Correct 16 ms 7408 KB Output is correct
13 Correct 57 ms 21808 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 186 ms 50216 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 388 ms 75588 KB Output is correct
21 Correct 441 ms 76488 KB Output is correct
22 Correct 389 ms 76348 KB Output is correct
23 Correct 316 ms 77140 KB Output is correct
24 Correct 48 ms 21884 KB Output is correct
25 Correct 337 ms 94612 KB Output is correct
26 Correct 405 ms 94996 KB Output is correct
27 Correct 433 ms 100112 KB Output is correct
28 Correct 434 ms 100116 KB Output is correct
29 Correct 392 ms 100624 KB Output is correct
30 Correct 392 ms 100180 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 18 ms 5852 KB Output is correct
33 Correct 24 ms 11200 KB Output is correct
34 Correct 388 ms 75752 KB Output is correct
35 Correct 13 ms 3800 KB Output is correct
36 Correct 62 ms 18152 KB Output is correct
37 Correct 158 ms 36000 KB Output is correct
38 Correct 119 ms 31344 KB Output is correct
39 Correct 174 ms 42588 KB Output is correct
40 Correct 248 ms 53808 KB Output is correct
41 Correct 330 ms 65620 KB Output is correct
42 Correct 408 ms 77504 KB Output is correct
43 Correct 0 ms 344 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 384 KB Output is correct
47 Correct 0 ms 348 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 2 ms 1116 KB Output is correct
55 Correct 3 ms 1372 KB Output is correct
56 Correct 162 ms 40748 KB Output is correct
57 Correct 295 ms 61664 KB Output is correct
58 Correct 285 ms 60896 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 502 ms 100504 KB Output is correct
63 Correct 515 ms 100360 KB Output is correct
64 Correct 501 ms 100640 KB Output is correct
65 Correct 4 ms 1884 KB Output is correct
66 Correct 9 ms 3420 KB Output is correct
67 Correct 165 ms 40212 KB Output is correct
68 Correct 298 ms 61844 KB Output is correct
69 Correct 465 ms 80188 KB Output is correct

Subtask #5
20.0 / 20.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 0 ms 348 KB Output is correct
9 Correct 186 ms 50240 KB Output is correct
10 Correct 12 ms 4824 KB Output is correct
11 Correct 72 ms 26772 KB Output is correct
12 Correct 16 ms 7408 KB Output is correct
13 Correct 57 ms 21808 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 186 ms 50216 KB Output is correct
17 Correct 583 ms 100880 KB Output is correct
18 Correct 516 ms 100360 KB Output is correct
19 Correct 425 ms 76612 KB Output is correct
20 Correct 477 ms 80508 KB Output is correct
21 Correct 343 ms 80068 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 42 ms 12268 KB Output is correct
24 Correct 23 ms 7828 KB Output is correct
25 Correct 96 ms 27288 KB Output is correct
26 Correct 208 ms 43064 KB Output is correct
27 Correct 159 ms 39980 KB Output is correct
28 Correct 221 ms 48408 KB Output is correct
29 Correct 306 ms 60820 KB Output is correct
30 Correct 375 ms 71608 KB Output is correct
31 Correct 433 ms 79684 KB Output is correct
32 Correct 497 ms 81716 KB Output is correct
33 Correct 546 ms 100356 KB Output is correct
34 Correct 5 ms 2140 KB Output is correct
35 Correct 9 ms 3808 KB Output is correct
36 Correct 176 ms 40276 KB Output is correct
37 Correct 311 ms 61480 KB Output is correct
38 Correct 472 ms 80700 KB Output is correct

Subtask #6
0 / 30.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 0 ms 348 KB Output is correct
9 Correct 186 ms 50240 KB Output is correct
10 Correct 12 ms 4824 KB Output is correct
11 Correct 72 ms 26772 KB Output is correct
12 Correct 16 ms 7408 KB Output is correct
13 Correct 57 ms 21808 KB Output is correct
14 Correct 1 ms 860 KB Output is correct
15 Correct 2 ms 1116 KB Output is correct
16 Correct 186 ms 50216 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 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 391 ms 74580 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 860 KB Output is correct
26 Correct 2 ms 1288 KB Output is correct
27 Correct 3 ms 1628 KB Output is correct
28 Correct 97 ms 27096 KB Output is correct
29 Correct 187 ms 42960 KB Output is correct
30 Correct 262 ms 54596 KB Output is correct
31 Correct 426 ms 74552 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 344 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 1 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 1372 KB Output is correct
45 Correct 175 ms 40600 KB Output is correct
46 Correct 281 ms 62172 KB Output is correct
47 Correct 310 ms 60900 KB Output is correct
48 Correct 0 ms 344 KB Output is correct
49 Correct 0 ms 344 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 382 ms 75716 KB Output is correct
56 Correct 0 ms 344 KB Output is correct
57 Correct 2 ms 1112 KB Output is correct
58 Correct 6 ms 2584 KB Output is correct
59 Correct 10 ms 3400 KB Output is correct
60 Correct 154 ms 37240 KB Output is correct
61 Correct 224 ms 50296 KB Output is correct
62 Correct 291 ms 57508 KB Output is correct
63 Correct 363 ms 74812 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 497 ms 100504 KB Output is correct
68 Correct 500 ms 100372 KB Output is correct
69 Correct 494 ms 100132 KB Output is correct
70 Correct 4 ms 1880 KB Output is correct
71 Correct 8 ms 3420 KB Output is correct
72 Correct 167 ms 40208 KB Output is correct
73 Correct 310 ms 62360 KB Output is correct
74 Correct 478 ms 80708 KB Output is correct
75 Correct 519 ms 82500 KB Output is correct
76 Correct 516 ms 100368 KB Output is correct
77 Correct 5 ms 2136 KB Output is correct
78 Correct 10 ms 3808 KB Output is correct
79 Correct 172 ms 40272 KB Output is correct
80 Correct 336 ms 62764 KB Output is correct
81 Correct 450 ms 80204 KB Output is correct
82 Correct 0 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 388 ms 75588 KB Output is correct
86 Correct 441 ms 76488 KB Output is correct
87 Correct 389 ms 76348 KB Output is correct
88 Correct 316 ms 77140 KB Output is correct
89 Correct 48 ms 21884 KB Output is correct
90 Correct 337 ms 94612 KB Output is correct
91 Correct 405 ms 94996 KB Output is correct
92 Correct 433 ms 100112 KB Output is correct
93 Correct 434 ms 100116 KB Output is correct
94 Correct 392 ms 100624 KB Output is correct
95 Correct 392 ms 100180 KB Output is correct
96 Correct 0 ms 344 KB Output is correct
97 Correct 18 ms 5852 KB Output is correct
98 Correct 24 ms 11200 KB Output is correct
99 Correct 388 ms 75752 KB Output is correct
100 Correct 13 ms 3800 KB Output is correct
101 Correct 62 ms 18152 KB Output is correct
102 Correct 158 ms 36000 KB Output is correct
103 Correct 119 ms 31344 KB Output is correct
104 Correct 174 ms 42588 KB Output is correct
105 Correct 248 ms 53808 KB Output is correct
106 Correct 330 ms 65620 KB Output is correct
107 Correct 408 ms 77504 KB Output is correct
108 Correct 0 ms 344 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 384 KB Output is correct
112 Correct 0 ms 348 KB Output is correct
113 Correct 0 ms 344 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 1372 KB Output is correct
121 Correct 162 ms 40748 KB Output is correct
122 Correct 295 ms 61664 KB Output is correct
123 Correct 285 ms 60896 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 502 ms 100504 KB Output is correct
128 Correct 515 ms 100360 KB Output is correct
129 Correct 501 ms 100640 KB Output is correct
130 Correct 4 ms 1884 KB Output is correct
131 Correct 9 ms 3420 KB Output is correct
132 Correct 165 ms 40212 KB Output is correct
133 Correct 298 ms 61844 KB Output is correct
134 Correct 465 ms 80188 KB Output is correct
135 Correct 583 ms 100880 KB Output is correct
136 Correct 516 ms 100360 KB Output is correct
137 Correct 425 ms 76612 KB Output is correct
138 Correct 477 ms 80508 KB Output is correct
139 Correct 343 ms 80068 KB Output is correct
140 Correct 0 ms 348 KB Output is correct
141 Correct 42 ms 12268 KB Output is correct
142 Correct 23 ms 7828 KB Output is correct
143 Correct 96 ms 27288 KB Output is correct
144 Correct 208 ms 43064 KB Output is correct
145 Correct 159 ms 39980 KB Output is correct
146 Correct 221 ms 48408 KB Output is correct
147 Correct 306 ms 60820 KB Output is correct
148 Correct 375 ms 71608 KB Output is correct
149 Correct 433 ms 79684 KB Output is correct
150 Correct 497 ms 81716 KB Output is correct
151 Correct 546 ms 100356 KB Output is correct
152 Correct 5 ms 2140 KB Output is correct
153 Correct 9 ms 3808 KB Output is correct
154 Correct 176 ms 40276 KB Output is correct
155 Correct 311 ms 61480 KB Output is correct
156 Correct 472 ms 80700 KB Output is correct
157 Correct 1 ms 344 KB Output is correct
158 Correct 0 ms 344 KB Output is correct
159 Correct 0 ms 348 KB Output is correct
160 Correct 0 ms 348 KB Output is correct
161 Correct 369 ms 76504 KB Output is correct
162 Correct 400 ms 76100 KB Output is correct
163 Correct 414 ms 75004 KB Output is correct
164 Correct 416 ms 75068 KB Output is correct
165 Correct 421 ms 75332 KB Output is correct
166 Correct 361 ms 76088 KB Output is correct
167 Execution timed out 3570 ms 16480 KB Time limit exceeded
168 Halted 0 ms 0 KB -