oj.uz

답안 #617859

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
617859 2022-08-01T15:41:46 Z happypotato 분수 공원 (IOI21_parks) C++17
55 / 100
 1460 ms 74020 KB 
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
const int mxN = 2e5 + 1;
const int dx[mxN] = {0, 1, 0, -1}, dy[mxN] = {1, 0, -1, 0};
bool vis[mxN];
pair<pii, int> pts[mxN];
pii opts[mxN];
map<pii, int> allpts;
int n;
vector<pii> edges;
map<pair<pii, pii>, int> alledges;
vector<pii> imp;
bool CheckConnected() {
    queue<pii> q;
    set<pii> track;
    q.push(pts[0].ff);
    track.insert(pts[0].ff);
    while (!q.empty()) {
        pii cur = q.front();
        q.pop();
        for (int k = 0; k < 4; k++) {
            int nx = cur.ff + dx[k] * 2;
            int ny = cur.ss + dy[k] * 2;
            if (allpts.find({nx, ny}) != allpts.end() && track.find({nx, ny}) == track.end()) {
                q.push({nx, ny});
                track.insert({nx, ny});
                edges.pb({allpts[cur], allpts[{nx, ny}]});
            }
        }
    }
    return (int(track.size()) == n);
}
void st123() {
    int arr[3][mxN + 10];
    for (int i = 0; i < 3; i++) {
        for (int j = 0; j < mxN + 10; j++) {
            arr[i][j] = -1;
        }
    }
    for (int i = 0; i < n; i++) {
        arr[(pts[i].ff.ff >> 1) - 1][pts[i].ff.ss] = pts[i].ss;
    }
    bool con01 = false, con12 = false;
    bool notfix = false;
    vector<int> u, v, a, b;
    for (int i = 0; i < mxN + 6; i += 2) {
        // if (i <= 10) cout << arr[0][i] << ' ' << arr[1][i] << ' ' << arr[2][i] << endl;
        if (arr[0][i] >= 0 && arr[0][i + 2] >= 0) {
            u.pb(arr[0][i]); v.pb(arr[0][i + 2]);
            a.pb(1); b.pb(i + 1);
        }
        if (arr[2][i] >= 0 && arr[2][i + 2] >= 0) {
            u.pb(arr[2][i]); v.pb(arr[2][i + 2]);
            a.pb(7); b.pb(i + 1);
        }
        bool special = false;
        if (notfix) {
            u.pb(arr[0][i]); v.pb(arr[1][i]);
            a.pb(3); b.pb(i + 1);
            special = true;
            notfix = false;
        }
        bool usemid = false;
        if (!(arr[1][i + 2] >= 0 && arr[2][i + 2] >= 0 && !con12)) special = true;
        if (arr[1][i] >= 0 && arr[1][i + 2] >= 0) {
            u.pb(arr[1][i]); v.pb(arr[1][i + 2]);
            a.pb((special ? 5 : 3)); b.pb(i + 1);
            usemid = !special;
        }
        if (arr[0][i + 2] >= 0 && arr[1][i + 2] >= 0 && !con01) {
            if (!usemid) {
                u.pb(arr[0][i + 2]); v.pb(arr[1][i + 2]);
                a.pb(3); b.pb(i + 1);
            } else notfix = true;
            con01 = true;
        } else con01 = false;
        if (arr[1][i + 2] >= 0 && arr[2][i + 2] >= 0 && !con12) {
            u.pb(arr[1][i + 2]); v.pb(arr[2][i + 2]);
            a.pb(5); b.pb(i + 1);
            con12 = true;
        } else con12 = false;
    }
    build(u, v, a, b);
    return;
}
void st45() {
    set<pair<pii, pii> > edgeset;
    for (pii &cur : edges) {
        pair<pii, pii> edge = {opts[cur.ff], opts[cur.ss]};
        if (edge.ff.ff > edge.ss.ff) {
            swap(edge.ff, edge.ss);
            swap(cur.ff, cur.ss);
        } else if (edge.ff.ff == edge.ss.ff && edge.ff.ss > edge.ss.ss) {
            swap(edge.ff, edge.ss);
            swap(cur.ff, cur.ss);
        }
        edgeset.insert(edge);
    }
    vector<int> ordering[4];
    for (int i = 0; i < int(edges.size()); i++) {
        pii fir = opts[edges[i].ff], sec = opts[edges[i].ss];
        alledges[{fir, sec}] = i;
        pii important;
        bool left, right, middle;
        if (fir.ff == sec.ff) {
            // -2
            left = (edgeset.find({{fir.ff - 2, fir.ss}, fir}) != edgeset.end());
            right = (edgeset.find({{sec.ff - 2, sec.ss}, sec}) != edgeset.end());
            middle = (edgeset.find({{fir.ff - 2, fir.ss}, {sec.ff - 2, sec.ss}}) != edgeset.end());
            if (left && right) important.ff = 3;
            else if (middle) important.ff = 2;
            else if (left || right) important.ff = 1;
            else important.ff = 0;
            // +2
            left = (edgeset.find({fir, {fir.ff + 2, fir.ss}}) != edgeset.end());
            right = (edgeset.find({sec, {sec.ff + 2, sec.ss}}) != edgeset.end());
            middle = (edgeset.find({{fir.ff + 2, fir.ss}, {sec.ff + 2, sec.ss}}) != edgeset.end());
            if (left && right) important.ss = 3;
            else if (middle) important.ss = 2;
            else if (left || right) important.ss = 1;
            else important.ss = 0;
        } else if (fir.ss == sec.ss) {
            // -2
            left = (edgeset.find({{fir.ff, fir.ss - 2}, fir}) != edgeset.end());
            right = (edgeset.find({{sec.ff, sec.ss - 2}, sec}) != edgeset.end());
            middle = (edgeset.find({{fir.ff, fir.ss - 2}, {sec.ff, sec.ss - 2}}) != edgeset.end());
            if (left && right) important.ff = 3;
            else if (middle) important.ff = 2;
            else if (left || right) important.ff = 1;
            else important.ff = 0;
            // +2
            left = (edgeset.find({fir, {fir.ff, fir.ss + 2}}) != edgeset.end());
            right = (edgeset.find({sec, {sec.ff, sec.ss + 2}}) != edgeset.end());
            middle = (edgeset.find({{fir.ff, fir.ss + 2}, {sec.ff, sec.ss + 2}}) != edgeset.end());
            if (left && right) important.ss = 3;
            else if (middle) important.ss = 2;
            else if (left || right) important.ss = 1;
            else important.ss = 0;
        }
        imp.pb(important);
        ordering[max(important.ff, important.ss)].pb(i);
    }
    int m = edges.size();
    vector<pii> coor(m);
    set<pii> appear;
    for (int urgency = 3; urgency >= 0; urgency--) {
        for (int &starting : ordering[urgency]) {
            if (vis[starting]) continue;
            queue<int> q;
            q.push(starting);
            vis[starting] = true;
            while (!q.empty()) {
                int cur = q.front();
                q.pop();
                pii fir = opts[edges[cur].ff], sec = opts[edges[cur].ss];
                if (imp[cur].ff >= imp[cur].ss && appear.find({fir.ff + 1, fir.ss + 1}) == appear.end()) {
                    // add
                    coor[cur] = {fir.ff + 1, fir.ss + 1};
                    if (alledges.find({fir, {fir.ff + 2, fir.ss}}) != alledges.end()) {
                        int ptr = alledges[{fir, {fir.ff + 2, fir.ss}}];
                        if (!vis[ptr]) {
                            q.push(ptr);
                            vis[ptr] = true;
                        }
                    }
                    if (alledges.find({fir, {fir.ff, fir.ss + 2}}) != alledges.end()) {
                        int ptr = alledges[{fir, {fir.ff, fir.ss + 2}}];
                        if (!vis[ptr]) {
                            q.push(ptr);
                            vis[ptr] = true;
                        }
                    }
                    if (alledges.find({{fir.ff + 2, fir.ss}, {fir.ff + 2, fir.ss + 2}}) != alledges.end()) {
                        int ptr = alledges[{{fir.ff + 2, fir.ss}, {fir.ff + 2, fir.ss + 2}}];
                        if (!vis[ptr]) {
                            q.push(ptr);
                            vis[ptr] = true;
                        }
                    }
                    if (alledges.find({{fir.ff, fir.ss + 2}, {fir.ff + 2, fir.ss + 2}}) != alledges.end()) {
                        int ptr = alledges[{{fir.ff, fir.ss + 2}, {fir.ff + 2, fir.ss + 2}}];
                        if (!vis[ptr]) {
                            q.push(ptr);
                            vis[ptr] = true;
                        }
                    }
                } else if (appear.find({sec.ff - 1, sec.ss - 1}) == appear.end()) {
                    // minus
                    coor[cur] = {sec.ff - 1, sec.ss - 1};
                    if (alledges.find({{sec.ff - 2, sec.ss}, sec}) != alledges.end()) {
                        int ptr = alledges[{{sec.ff - 2, sec.ss}, sec}];
                        if (!vis[ptr]) {
                            q.push(ptr);
                            vis[ptr] = true;
                        }
                    }
                    if (alledges.find({{sec.ff, sec.ss - 2}, sec}) != alledges.end()) {
                        int ptr = alledges[{{sec.ff, sec.ss - 2}, sec}];
                        if (!vis[ptr]) {
                            q.push(ptr);
                            vis[ptr] = true;
                        }
                    }
                    if (alledges.find({{sec.ff - 2, sec.ss - 2}, {sec.ff - 2, sec.ss}}) != alledges.end()) {
                        int ptr = alledges[{{sec.ff - 2, sec.ss - 2}, {sec.ff - 2, sec.ss}}];
                        if (!vis[ptr]) {
                            q.push(ptr);
                            vis[ptr] = true;
                        }
                    }
                    if (alledges.find({{sec.ff - 2, sec.ss - 2}, {sec.ff, sec.ss - 2}}) != alledges.end()) {
                        int ptr = alledges[{{sec.ff - 2, sec.ss - 2}, {sec.ff, sec.ss - 2}}];
                        if (!vis[ptr]) {
                            q.push(ptr);
                            vis[ptr] = true;
                        }
                    }
                } else throw runtime_error("fucked up");
                appear.insert(coor[cur]);
                // cout << edges[cur].ff << ' ' << edges[cur].ss << ' ' << coor[cur].ff << ' ' << coor[cur].ss << endl;
            }
        }
    }
    vector<int> u(m), v(m), a(m), b(m);
    for (int i = 0; i < m; i++) {
        u[i] = edges[i].ff;
        v[i] = edges[i].ss;
        a[i] = coor[i].ff;
        b[i] = coor[i].ss;
    }
    build(u, v, a, b);
    return;
}
int construct_roads(vector<int> ox, vector<int> oy) {
    n = ox.size();
    int maxx = 0;
    for (int i = 0; i < n; i++) {
        pts[i] = {{ox[i], oy[i]}, i};
        opts[i] = pts[i].ff;
        allpts[pts[i].ff] = i;
        maxx = max(maxx, pts[i].ff.ff);
    }
    // for (int i = 0; i < n; i++) {
    //     cout << pts[i].ff.ff << ' ' << pts[i].ff.ss << ' ' << pts[i].ss << endl;
    // }
    if (!CheckConnected()) return 0;
    st45();
    return 1;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 383 ms 35400 KB Output is correct
10 Correct 27 ms 3916 KB Output is correct
11 Correct 193 ms 19180 KB Output is correct
12 Correct 41 ms 5708 KB Output is correct
13 Correct 42 ms 6276 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 386 ms 35356 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 383 ms 35400 KB Output is correct
10 Correct 27 ms 3916 KB Output is correct
11 Correct 193 ms 19180 KB Output is correct
12 Correct 41 ms 5708 KB Output is correct
13 Correct 42 ms 6276 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 386 ms 35356 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 948 ms 70600 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 4 ms 724 KB Output is correct
26 Correct 3 ms 596 KB Output is correct
27 Correct 2 ms 724 KB Output is correct
28 Correct 302 ms 28316 KB Output is correct
29 Correct 530 ms 42332 KB Output is correct
30 Correct 725 ms 56536 KB Output is correct
31 Correct 939 ms 70616 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 361 ms 35344 KB Output is correct
46 Correct 543 ms 51240 KB Output is correct
47 Correct 544 ms 51120 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 383 ms 35400 KB Output is correct
10 Correct 27 ms 3916 KB Output is correct
11 Correct 193 ms 19180 KB Output is correct
12 Correct 41 ms 5708 KB Output is correct
13 Correct 42 ms 6276 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 386 ms 35356 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 948 ms 70600 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 4 ms 724 KB Output is correct
26 Correct 3 ms 596 KB Output is correct
27 Correct 2 ms 724 KB Output is correct
28 Correct 302 ms 28316 KB Output is correct
29 Correct 530 ms 42332 KB Output is correct
30 Correct 725 ms 56536 KB Output is correct
31 Correct 939 ms 70616 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 361 ms 35344 KB Output is correct
46 Correct 543 ms 51240 KB Output is correct
47 Correct 544 ms 51120 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Runtime error 2 ms 596 KB Execution killed with signal 6
52 Halted 0 ms 0 KB -

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 383 ms 35400 KB Output is correct
10 Correct 27 ms 3916 KB Output is correct
11 Correct 193 ms 19180 KB Output is correct
12 Correct 41 ms 5708 KB Output is correct
13 Correct 42 ms 6276 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 386 ms 35356 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 849 ms 71668 KB Output is correct
21 Correct 850 ms 71200 KB Output is correct
22 Correct 836 ms 71280 KB Output is correct
23 Correct 686 ms 60304 KB Output is correct
24 Correct 157 ms 19764 KB Output is correct
25 Correct 143 ms 19796 KB Output is correct
26 Correct 146 ms 19800 KB Output is correct
27 Correct 1095 ms 70468 KB Output is correct
28 Correct 1117 ms 70436 KB Output is correct
29 Correct 1141 ms 70444 KB Output is correct
30 Correct 1241 ms 70408 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 63 ms 5416 KB Output is correct
33 Correct 55 ms 10060 KB Output is correct
34 Correct 784 ms 71740 KB Output is correct
35 Correct 11 ms 1492 KB Output is correct
36 Correct 40 ms 5684 KB Output is correct
37 Correct 68 ms 10772 KB Output is correct
38 Correct 435 ms 28700 KB Output is correct
39 Correct 631 ms 39360 KB Output is correct
40 Correct 808 ms 49964 KB Output is correct
41 Correct 1052 ms 60772 KB Output is correct
42 Correct 1460 ms 71360 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 324 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 3 ms 468 KB Output is correct
55 Correct 2 ms 636 KB Output is correct
56 Correct 394 ms 35352 KB Output is correct
57 Correct 605 ms 51148 KB Output is correct
58 Correct 589 ms 51336 KB Output is correct
59 Correct 1 ms 320 KB Output is correct
60 Correct 1 ms 320 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 916 ms 70656 KB Output is correct
63 Correct 909 ms 70612 KB Output is correct
64 Correct 848 ms 70256 KB Output is correct
65 Correct 4 ms 852 KB Output is correct
66 Correct 6 ms 1180 KB Output is correct
67 Correct 468 ms 35424 KB Output is correct
68 Correct 675 ms 53168 KB Output is correct
69 Correct 1020 ms 70624 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 383 ms 35400 KB Output is correct
10 Correct 27 ms 3916 KB Output is correct
11 Correct 193 ms 19180 KB Output is correct
12 Correct 41 ms 5708 KB Output is correct
13 Correct 42 ms 6276 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 386 ms 35356 KB Output is correct
17 Correct 1033 ms 70992 KB Output is correct
18 Correct 1014 ms 71180 KB Output is correct
19 Correct 1061 ms 71476 KB Output is correct
20 Correct 1336 ms 69212 KB Output is correct
21 Correct 1353 ms 62080 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 140 ms 11724 KB Output is correct
24 Correct 21 ms 3056 KB Output is correct
25 Correct 62 ms 8628 KB Output is correct
26 Correct 91 ms 14096 KB Output is correct
27 Correct 692 ms 37068 KB Output is correct
28 Correct 811 ms 46544 KB Output is correct
29 Correct 1111 ms 55760 KB Output is correct
30 Correct 1266 ms 64424 KB Output is correct
31 Correct 1411 ms 74020 KB Output is correct
32 Correct 1078 ms 72072 KB Output is correct
33 Correct 997 ms 72140 KB Output is correct
34 Correct 5 ms 980 KB Output is correct
35 Correct 7 ms 1452 KB Output is correct
36 Correct 439 ms 36032 KB Output is correct
37 Correct 843 ms 54184 KB Output is correct
38 Correct 1048 ms 72148 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 383 ms 35400 KB Output is correct
10 Correct 27 ms 3916 KB Output is correct
11 Correct 193 ms 19180 KB Output is correct
12 Correct 41 ms 5708 KB Output is correct
13 Correct 42 ms 6276 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 386 ms 35356 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 948 ms 70600 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 4 ms 724 KB Output is correct
26 Correct 3 ms 596 KB Output is correct
27 Correct 2 ms 724 KB Output is correct
28 Correct 302 ms 28316 KB Output is correct
29 Correct 530 ms 42332 KB Output is correct
30 Correct 725 ms 56536 KB Output is correct
31 Correct 939 ms 70616 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 361 ms 35344 KB Output is correct
46 Correct 543 ms 51240 KB Output is correct
47 Correct 544 ms 51120 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Runtime error 2 ms 596 KB Execution killed with signal 6
52 Halted 0 ms 0 KB -