oj.uz

답안 #1057553

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1057553 2024-08-13T21:32:31 Z Zicrus 분수 공원 (IOI21_parks) C++17
70 / 100
 3500 ms 101652 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);
            }
        }
        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: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 344 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 98 ms 50076 KB Output is correct
10 Correct 8 ms 4820 KB Output is correct
11 Correct 51 ms 26764 KB Output is correct
12 Correct 12 ms 7408 KB Output is correct
13 Correct 32 ms 21748 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 121 ms 50124 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 344 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 98 ms 50076 KB Output is correct
10 Correct 8 ms 4820 KB Output is correct
11 Correct 51 ms 26764 KB Output is correct
12 Correct 12 ms 7408 KB Output is correct
13 Correct 32 ms 21748 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 121 ms 50124 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 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 203 ms 74804 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 1372 KB Output is correct
27 Correct 3 ms 1628 KB Output is correct
28 Correct 66 ms 27356 KB Output is correct
29 Correct 126 ms 43056 KB Output is correct
30 Correct 159 ms 55500 KB Output is correct
31 Correct 212 ms 74532 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 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 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
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 129 ms 40868 KB Output is correct
46 Correct 242 ms 61088 KB Output is correct
47 Correct 247 ms 61660 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 344 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 98 ms 50076 KB Output is correct
10 Correct 8 ms 4820 KB Output is correct
11 Correct 51 ms 26764 KB Output is correct
12 Correct 12 ms 7408 KB Output is correct
13 Correct 32 ms 21748 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 121 ms 50124 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 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 203 ms 74804 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 1372 KB Output is correct
27 Correct 3 ms 1628 KB Output is correct
28 Correct 66 ms 27356 KB Output is correct
29 Correct 126 ms 43056 KB Output is correct
30 Correct 159 ms 55500 KB Output is correct
31 Correct 212 ms 74532 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 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 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
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 129 ms 40868 KB Output is correct
46 Correct 242 ms 61088 KB Output is correct
47 Correct 247 ms 61660 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 1 ms 432 KB Output is correct
55 Correct 223 ms 75076 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 860 KB Output is correct
58 Correct 5 ms 2652 KB Output is correct
59 Correct 7 ms 3468 KB Output is correct
60 Correct 121 ms 37468 KB Output is correct
61 Correct 150 ms 49028 KB Output is correct
62 Correct 156 ms 57824 KB Output is correct
63 Correct 215 ms 75588 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 260 ms 100660 KB Output is correct
68 Correct 257 ms 100820 KB Output is correct
69 Correct 249 ms 101280 KB Output is correct
70 Correct 5 ms 1884 KB Output is correct
71 Correct 8 ms 3420 KB Output is correct
72 Correct 174 ms 40356 KB Output is correct
73 Correct 259 ms 62740 KB Output is correct
74 Correct 408 ms 80184 KB Output is correct
75 Correct 228 ms 81604 KB Output is correct
76 Correct 258 ms 100880 KB Output is correct
77 Correct 4 ms 2136 KB Output is correct
78 Correct 8 ms 3808 KB Output is correct
79 Correct 128 ms 40224 KB Output is correct
80 Correct 267 ms 61464 KB Output is correct
81 Correct 381 ms 80064 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 344 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 98 ms 50076 KB Output is correct
10 Correct 8 ms 4820 KB Output is correct
11 Correct 51 ms 26764 KB Output is correct
12 Correct 12 ms 7408 KB Output is correct
13 Correct 32 ms 21748 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 121 ms 50124 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 257 ms 75248 KB Output is correct
21 Correct 457 ms 75556 KB Output is correct
22 Correct 430 ms 76356 KB Output is correct
23 Correct 330 ms 77656 KB Output is correct
24 Correct 64 ms 21764 KB Output is correct
25 Correct 230 ms 95180 KB Output is correct
26 Correct 204 ms 94484 KB Output is correct
27 Correct 247 ms 100108 KB Output is correct
28 Correct 291 ms 99984 KB Output is correct
29 Correct 208 ms 100116 KB Output is correct
30 Correct 216 ms 100252 KB Output is correct
31 Correct 0 ms 352 KB Output is correct
32 Correct 18 ms 5780 KB Output is correct
33 Correct 25 ms 10948 KB Output is correct
34 Correct 268 ms 75568 KB Output is correct
35 Correct 10 ms 3800 KB Output is correct
36 Correct 51 ms 18096 KB Output is correct
37 Correct 146 ms 36000 KB Output is correct
38 Correct 129 ms 31348 KB Output is correct
39 Correct 158 ms 42764 KB Output is correct
40 Correct 191 ms 53888 KB Output is correct
41 Correct 341 ms 66392 KB Output is correct
42 Correct 388 ms 77640 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 1 ms 344 KB Output is correct
47 Correct 0 ms 344 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 1372 KB Output is correct
56 Correct 154 ms 40804 KB Output is correct
57 Correct 215 ms 60380 KB Output is correct
58 Correct 194 ms 61796 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 344 KB Output is correct
62 Correct 223 ms 100804 KB Output is correct
63 Correct 235 ms 101652 KB Output is correct
64 Correct 227 ms 100380 KB Output is correct
65 Correct 4 ms 1884 KB Output is correct
66 Correct 7 ms 3420 KB Output is correct
67 Correct 126 ms 40368 KB Output is correct
68 Correct 214 ms 61588 KB Output is correct
69 Correct 301 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 344 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 98 ms 50076 KB Output is correct
10 Correct 8 ms 4820 KB Output is correct
11 Correct 51 ms 26764 KB Output is correct
12 Correct 12 ms 7408 KB Output is correct
13 Correct 32 ms 21748 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 121 ms 50124 KB Output is correct
17 Correct 395 ms 100360 KB Output is correct
18 Correct 415 ms 101140 KB Output is correct
19 Correct 297 ms 75460 KB Output is correct
20 Correct 204 ms 79996 KB Output is correct
21 Correct 230 ms 80012 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 37 ms 12240 KB Output is correct
24 Correct 19 ms 7832 KB Output is correct
25 Correct 72 ms 27296 KB Output is correct
26 Correct 126 ms 43184 KB Output is correct
27 Correct 129 ms 39844 KB Output is correct
28 Correct 174 ms 48480 KB Output is correct
29 Correct 205 ms 60564 KB Output is correct
30 Correct 246 ms 72392 KB Output is correct
31 Correct 288 ms 79416 KB Output is correct
32 Correct 202 ms 81612 KB Output is correct
33 Correct 252 ms 101560 KB Output is correct
34 Correct 4 ms 2136 KB Output is correct
35 Correct 8 ms 3808 KB Output is correct
36 Correct 121 ms 40260 KB Output is correct
37 Correct 197 ms 61336 KB Output is correct
38 Correct 281 ms 80616 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 344 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 98 ms 50076 KB Output is correct
10 Correct 8 ms 4820 KB Output is correct
11 Correct 51 ms 26764 KB Output is correct
12 Correct 12 ms 7408 KB Output is correct
13 Correct 32 ms 21748 KB Output is correct
14 Correct 2 ms 860 KB Output is correct
15 Correct 1 ms 1116 KB Output is correct
16 Correct 121 ms 50124 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 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 203 ms 74804 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 1372 KB Output is correct
27 Correct 3 ms 1628 KB Output is correct
28 Correct 66 ms 27356 KB Output is correct
29 Correct 126 ms 43056 KB Output is correct
30 Correct 159 ms 55500 KB Output is correct
31 Correct 212 ms 74532 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 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 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
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 129 ms 40868 KB Output is correct
46 Correct 242 ms 61088 KB Output is correct
47 Correct 247 ms 61660 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 1 ms 432 KB Output is correct
55 Correct 223 ms 75076 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 1 ms 860 KB Output is correct
58 Correct 5 ms 2652 KB Output is correct
59 Correct 7 ms 3468 KB Output is correct
60 Correct 121 ms 37468 KB Output is correct
61 Correct 150 ms 49028 KB Output is correct
62 Correct 156 ms 57824 KB Output is correct
63 Correct 215 ms 75588 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 260 ms 100660 KB Output is correct
68 Correct 257 ms 100820 KB Output is correct
69 Correct 249 ms 101280 KB Output is correct
70 Correct 5 ms 1884 KB Output is correct
71 Correct 8 ms 3420 KB Output is correct
72 Correct 174 ms 40356 KB Output is correct
73 Correct 259 ms 62740 KB Output is correct
74 Correct 408 ms 80184 KB Output is correct
75 Correct 228 ms 81604 KB Output is correct
76 Correct 258 ms 100880 KB Output is correct
77 Correct 4 ms 2136 KB Output is correct
78 Correct 8 ms 3808 KB Output is correct
79 Correct 128 ms 40224 KB Output is correct
80 Correct 267 ms 61464 KB Output is correct
81 Correct 381 ms 80064 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 1 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 257 ms 75248 KB Output is correct
86 Correct 457 ms 75556 KB Output is correct
87 Correct 430 ms 76356 KB Output is correct
88 Correct 330 ms 77656 KB Output is correct
89 Correct 64 ms 21764 KB Output is correct
90 Correct 230 ms 95180 KB Output is correct
91 Correct 204 ms 94484 KB Output is correct
92 Correct 247 ms 100108 KB Output is correct
93 Correct 291 ms 99984 KB Output is correct
94 Correct 208 ms 100116 KB Output is correct
95 Correct 216 ms 100252 KB Output is correct
96 Correct 0 ms 352 KB Output is correct
97 Correct 18 ms 5780 KB Output is correct
98 Correct 25 ms 10948 KB Output is correct
99 Correct 268 ms 75568 KB Output is correct
100 Correct 10 ms 3800 KB Output is correct
101 Correct 51 ms 18096 KB Output is correct
102 Correct 146 ms 36000 KB Output is correct
103 Correct 129 ms 31348 KB Output is correct
104 Correct 158 ms 42764 KB Output is correct
105 Correct 191 ms 53888 KB Output is correct
106 Correct 341 ms 66392 KB Output is correct
107 Correct 388 ms 77640 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 1 ms 344 KB Output is correct
112 Correct 0 ms 344 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 1372 KB Output is correct
121 Correct 154 ms 40804 KB Output is correct
122 Correct 215 ms 60380 KB Output is correct
123 Correct 194 ms 61796 KB Output is correct
124 Correct 0 ms 344 KB Output is correct
125 Correct 0 ms 348 KB Output is correct
126 Correct 0 ms 344 KB Output is correct
127 Correct 223 ms 100804 KB Output is correct
128 Correct 235 ms 101652 KB Output is correct
129 Correct 227 ms 100380 KB Output is correct
130 Correct 4 ms 1884 KB Output is correct
131 Correct 7 ms 3420 KB Output is correct
132 Correct 126 ms 40368 KB Output is correct
133 Correct 214 ms 61588 KB Output is correct
134 Correct 301 ms 80188 KB Output is correct
135 Correct 395 ms 100360 KB Output is correct
136 Correct 415 ms 101140 KB Output is correct
137 Correct 297 ms 75460 KB Output is correct
138 Correct 204 ms 79996 KB Output is correct
139 Correct 230 ms 80012 KB Output is correct
140 Correct 1 ms 344 KB Output is correct
141 Correct 37 ms 12240 KB Output is correct
142 Correct 19 ms 7832 KB Output is correct
143 Correct 72 ms 27296 KB Output is correct
144 Correct 126 ms 43184 KB Output is correct
145 Correct 129 ms 39844 KB Output is correct
146 Correct 174 ms 48480 KB Output is correct
147 Correct 205 ms 60564 KB Output is correct
148 Correct 246 ms 72392 KB Output is correct
149 Correct 288 ms 79416 KB Output is correct
150 Correct 202 ms 81612 KB Output is correct
151 Correct 252 ms 101560 KB Output is correct
152 Correct 4 ms 2136 KB Output is correct
153 Correct 8 ms 3808 KB Output is correct
154 Correct 121 ms 40260 KB Output is correct
155 Correct 197 ms 61336 KB Output is correct
156 Correct 281 ms 80616 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 236 ms 75920 KB Output is correct
162 Correct 228 ms 75700 KB Output is correct
163 Correct 242 ms 74812 KB Output is correct
164 Correct 239 ms 74816 KB Output is correct
165 Correct 274 ms 76196 KB Output is correct
166 Correct 243 ms 75472 KB Output is correct
167 Execution timed out 3577 ms 16480 KB Time limit exceeded
168 Halted 0 ms 0 KB -