oj.uz

답안 #439967

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
439967 2021-07-01T10:15:22 Z cheeheng 분수 공원 (IOI21_parks) C++17
70 / 100
 1308 ms 230636 KB 
#include "parks.h"
#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;

const int dx[] = {-1,0,0,1};
const int dy[] = {0,1,-1,0};

vector<int> AdjList[200005];
ii EdgeList[800005];
ii EdgeList2[800005];
map<ii, int> indx;
map<ii, int> indxEdge;
map<ii, int> indxBench;

vector<int> AdjListBench[800005];
set<int> AdjListRoad[200005];
int degBench[800005];
ii benchXY[800005];

struct Dinic{
    static const int MAX_E = 1000005;
    static const int MAX_V = 1000005;

    // Edge List
    ii EdgeList[MAX_E<<1];
    int flow[MAX_E<<1];
    int capacity[MAX_E<<1];

    vector<int> AdjList[MAX_V];
    int level[MAX_V];
    int ptr[MAX_V];

    int E = 0;

    int s, t;

    Dinic(int _s, int _t){
        s = _s;
        t = _t;
    }

    void add_edge(int u, int v, int c){
        EdgeList[E] = ii(u, v);
        EdgeList[E+1] = ii(v, u);
        flow[E] = 0;
        flow[E+1] = 0;
        capacity[E] = c;
        capacity[E+1] = 0;

        AdjList[u].push_back(E);
        AdjList[v].push_back(E+1);

        E += 2;
    }

    bool bfs(){
        memset(level, -1, sizeof(level));
        queue<int> q;
        level[s] = 0;
        q.push(s);
        while(!q.empty()){
            int u = q.front(); q.pop();
            for(int indx: AdjList[u]){
                int v = EdgeList[indx].second;
                if(level[v] == -1 && capacity[indx] > flow[indx]){
                    level[v] = level[u] + 1;
                    q.push(v);
                }
            }
        }
        return level[t] != -1;
    }

    int dfs(int u, int flowToSend){
        if(u == t){return flowToSend;}
        if(flowToSend == 0){return 0;}

        while(ptr[u] < (int)AdjList[u].size()){
            int indx = AdjList[u][ptr[u]];
            int v = EdgeList[indx].second;
            if(capacity[indx] > flow[indx] && level[v] == level[u] + 1){
                int nxtFlow = min(flowToSend, capacity[indx] - flow[indx]);
                int flowSent = dfs(v, nxtFlow);
                if(flowSent > 0){
                    flow[indx] += flowSent; // flow from u to v
                    flow[indx^1] -= flowSent; // flow from v to u
                    return flowSent;
                }
            }
            ptr[u] ++;
        }
        return 0;
    }

    int findMaxFlow(){
        int maxFlow = 0;
        while(1){
            if(!bfs()){return maxFlow;}

            memset(ptr, 0, sizeof(ptr));
            while(1){
                int temp = dfs(s, INT_MAX);
                maxFlow += temp;
                if(temp == 0){break;}
            }
        }
    }
};

struct UnionFind{
    vector<int> p;
    vector<int> rank1;
    void init(int n){
        p.assign(n, 0);
        rank1.assign(n, 0);
        for(int i = 0; i < n; i ++){
            p[i] = i;
            rank1[i] = 0;
        }
    }

    int findSet(int i){
        return (p[i] == i) ? i : (p[i] = findSet(p[i]));
    }

    bool isSameSet(int i, int j){
        return findSet(i) == findSet(j);
    }

    void unionSet(int i, int j){
        int x = findSet(i);
        int y = findSet(j);

        if(x != y){
            if(rank1[x] > rank1[y]){
                p[y] = x;
            }else{
                p[x] = y;
                if(rank1[x] == rank1[y]){
                    rank1[y] ++;
                }
            }
        }
    }
};

int p[200005];

int construct_roads(std::vector<int> x, std::vector<int> y) {
    int n = (int)x.size();
    if (n == 1) {
        build({}, {}, {}, {});
        return 1;
    }

    vector<int> U(n-1);
    vector<int> V(n-1);
    vector<int> A(n-1);
    vector<int> B(n-1);

    for(int i = 0; i < n; i ++){
        indx[ii(x[i], y[i])] = i;
    }

    int cnt3 = 0;
    for(pair<ii, int> temp: indx){
        p[cnt3 ++] = temp.second;
    }

    int m = 0;
    for(int i = 0; i < n; i ++){
        int i2 = p[i];
        for(int k = 0; k < 4; k ++){
            int nx = x[i2] + 2*dx[k];
            int ny = y[i2] + 2*dy[k];

            if(indx.find(ii(nx, ny)) != indx.end()){
                int j = indx[ii(nx, ny)];
                EdgeList[m ++] = ii(i2, j);
            }
        }
    }

    UnionFind* uf = new UnionFind();
    while(1){
        uf->init(n);

        int cnt = 0;
        for(int i = 0; i < m; i ++){
            int u, v;
            tie(u, v) = EdgeList[i];
            if(!uf->isSameSet(u, v)){
                uf->unionSet(u, v);
                AdjList[u].push_back(v);
                AdjList[v].push_back(u);
                EdgeList2[cnt] = ii(u, v);
                indxEdge[ii(u, v)] = cnt;
                cnt ++;
            }
        }

        if(cnt != n-1){
            return 0;
        }

        int benches = 0;
        memset(degBench, 0, sizeof(degBench));
        for(int i = 0; i < n-1; i ++){
            int u, v;
            tie(u, v) = EdgeList2[i];
            int x2 = (x[u] + x[v])/2;
            int y2 = (y[u] + y[v])/2;

            for(int k = 0; k < 4; k ++){
                int nx = x2 + dx[k];
                int ny = y2 + dy[k];
                if(nx%2 == 1 && ny%2 == 1){
                    int indx2 = benches;
                    if(indxBench.find(ii(nx, ny)) != indxBench.end()){
                        indx2 = indxBench[ii(nx, ny)];
                    }else{
                        benchXY[benches] = ii(nx, ny);
                        indxBench[ii(nx, ny)] = benches;
                        //printf("bench %d; (%d, %d)\n", benches, nx, ny);
                        benches ++;
                    }

                    AdjListBench[indx2].push_back(i);
                    AdjListRoad[i].insert(indx2);
                    //printf("road %d; bench %d\n", i, indx2);
                    degBench[i] ++;
                }
            }
        }

        int S = n+benches;
        int T = n+benches+1;
        Dinic* mf = new Dinic(S, T);

        for(int i = 0; i < n; i ++){
            mf->add_edge(S, i, 1);
        }

        for(int i = 0; i < benches; i ++){
            mf->add_edge(n+i, T, 1);
        }

        for(int i = 0; i < n; i ++){
            for(int j: AdjListRoad[i]){
                mf->add_edge(i, n+j, 1);
            }
        }

        int res = mf->findMaxFlow();
        //printf("res=%d\n", res);
        assert(res == n-1);

        int cnt2 = 0;
        for(int i = 0; i < mf->E; i ++){
            int u, v;
            tie(u, v) = mf->EdgeList[i];
            //printf("u=%d v=%d\n", u, v);
            if(u >= n){continue;}

            if(mf->flow[i] > 0){
                tie(U[cnt2], V[cnt2]) = EdgeList2[u];
                tie(A[cnt2], B[cnt2]) = benchXY[v-n];
                cnt2 ++;
            }
        }

        if(cnt2 == n-1){
            build(U, V, A, B);
            return 1;
        }
        random_shuffle(EdgeList, EdgeList+m);
    }
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 33100 KB Output is correct
2 Correct 44 ms 83220 KB Output is correct
3 Correct 20 ms 33108 KB Output is correct
4 Correct 44 ms 83252 KB Output is correct
5 Correct 43 ms 83200 KB Output is correct
6 Correct 21 ms 33100 KB Output is correct
7 Correct 20 ms 33100 KB Output is correct
8 Correct 21 ms 33100 KB Output is correct
9 Correct 482 ms 156876 KB Output is correct
10 Correct 80 ms 90980 KB Output is correct
11 Correct 248 ms 123196 KB Output is correct
12 Correct 106 ms 94660 KB Output is correct
13 Correct 99 ms 42980 KB Output is correct
14 Correct 23 ms 33308 KB Output is correct
15 Correct 24 ms 33612 KB Output is correct
16 Correct 564 ms 156908 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 33100 KB Output is correct
2 Correct 44 ms 83220 KB Output is correct
3 Correct 20 ms 33108 KB Output is correct
4 Correct 44 ms 83252 KB Output is correct
5 Correct 43 ms 83200 KB Output is correct
6 Correct 21 ms 33100 KB Output is correct
7 Correct 20 ms 33100 KB Output is correct
8 Correct 21 ms 33100 KB Output is correct
9 Correct 482 ms 156876 KB Output is correct
10 Correct 80 ms 90980 KB Output is correct
11 Correct 248 ms 123196 KB Output is correct
12 Correct 106 ms 94660 KB Output is correct
13 Correct 99 ms 42980 KB Output is correct
14 Correct 23 ms 33308 KB Output is correct
15 Correct 24 ms 33612 KB Output is correct
16 Correct 564 ms 156908 KB Output is correct
17 Correct 44 ms 83240 KB Output is correct
18 Correct 47 ms 83308 KB Output is correct
19 Correct 46 ms 83268 KB Output is correct
20 Correct 43 ms 83268 KB Output is correct
21 Correct 22 ms 33156 KB Output is correct
22 Correct 43 ms 83284 KB Output is correct
23 Correct 1067 ms 201580 KB Output is correct
24 Correct 45 ms 83308 KB Output is correct
25 Correct 57 ms 84036 KB Output is correct
26 Correct 26 ms 33796 KB Output is correct
27 Correct 28 ms 33988 KB Output is correct
28 Correct 424 ms 130660 KB Output is correct
29 Correct 583 ms 154372 KB Output is correct
30 Correct 897 ms 177924 KB Output is correct
31 Correct 1107 ms 201784 KB Output is correct
32 Correct 42 ms 83268 KB Output is correct
33 Correct 43 ms 83232 KB Output is correct
34 Correct 43 ms 83272 KB Output is correct
35 Correct 21 ms 33100 KB Output is correct
36 Correct 22 ms 33132 KB Output is correct
37 Correct 50 ms 83232 KB Output is correct
38 Correct 49 ms 83204 KB Output is correct
39 Correct 44 ms 83396 KB Output is correct
40 Correct 44 ms 83348 KB Output is correct
41 Correct 20 ms 33100 KB Output is correct
42 Correct 44 ms 83316 KB Output is correct
43 Correct 24 ms 33624 KB Output is correct
44 Correct 29 ms 33756 KB Output is correct
45 Correct 506 ms 147448 KB Output is correct
46 Correct 784 ms 176656 KB Output is correct
47 Correct 765 ms 176648 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 33100 KB Output is correct
2 Correct 44 ms 83220 KB Output is correct
3 Correct 20 ms 33108 KB Output is correct
4 Correct 44 ms 83252 KB Output is correct
5 Correct 43 ms 83200 KB Output is correct
6 Correct 21 ms 33100 KB Output is correct
7 Correct 20 ms 33100 KB Output is correct
8 Correct 21 ms 33100 KB Output is correct
9 Correct 482 ms 156876 KB Output is correct
10 Correct 80 ms 90980 KB Output is correct
11 Correct 248 ms 123196 KB Output is correct
12 Correct 106 ms 94660 KB Output is correct
13 Correct 99 ms 42980 KB Output is correct
14 Correct 23 ms 33308 KB Output is correct
15 Correct 24 ms 33612 KB Output is correct
16 Correct 564 ms 156908 KB Output is correct
17 Correct 44 ms 83240 KB Output is correct
18 Correct 47 ms 83308 KB Output is correct
19 Correct 46 ms 83268 KB Output is correct
20 Correct 43 ms 83268 KB Output is correct
21 Correct 22 ms 33156 KB Output is correct
22 Correct 43 ms 83284 KB Output is correct
23 Correct 1067 ms 201580 KB Output is correct
24 Correct 45 ms 83308 KB Output is correct
25 Correct 57 ms 84036 KB Output is correct
26 Correct 26 ms 33796 KB Output is correct
27 Correct 28 ms 33988 KB Output is correct
28 Correct 424 ms 130660 KB Output is correct
29 Correct 583 ms 154372 KB Output is correct
30 Correct 897 ms 177924 KB Output is correct
31 Correct 1107 ms 201784 KB Output is correct
32 Correct 42 ms 83268 KB Output is correct
33 Correct 43 ms 83232 KB Output is correct
34 Correct 43 ms 83272 KB Output is correct
35 Correct 21 ms 33100 KB Output is correct
36 Correct 22 ms 33132 KB Output is correct
37 Correct 50 ms 83232 KB Output is correct
38 Correct 49 ms 83204 KB Output is correct
39 Correct 44 ms 83396 KB Output is correct
40 Correct 44 ms 83348 KB Output is correct
41 Correct 20 ms 33100 KB Output is correct
42 Correct 44 ms 83316 KB Output is correct
43 Correct 24 ms 33624 KB Output is correct
44 Correct 29 ms 33756 KB Output is correct
45 Correct 506 ms 147448 KB Output is correct
46 Correct 784 ms 176656 KB Output is correct
47 Correct 765 ms 176648 KB Output is correct
48 Correct 45 ms 83288 KB Output is correct
49 Correct 47 ms 83276 KB Output is correct
50 Correct 52 ms 83284 KB Output is correct
51 Correct 55 ms 83244 KB Output is correct
52 Correct 41 ms 83264 KB Output is correct
53 Correct 43 ms 83276 KB Output is correct
54 Correct 44 ms 83256 KB Output is correct
55 Correct 1158 ms 202144 KB Output is correct
56 Correct 46 ms 83320 KB Output is correct
57 Correct 49 ms 84396 KB Output is correct
58 Correct 61 ms 86984 KB Output is correct
59 Correct 39 ms 35412 KB Output is correct
60 Correct 528 ms 145684 KB Output is correct
61 Correct 696 ms 163996 KB Output is correct
62 Correct 902 ms 181356 KB Output is correct
63 Correct 1130 ms 202072 KB Output is correct
64 Correct 20 ms 33100 KB Output is correct
65 Correct 46 ms 83264 KB Output is correct
66 Correct 22 ms 33172 KB Output is correct
67 Correct 1108 ms 230476 KB Output is correct
68 Correct 1161 ms 230572 KB Output is correct
69 Correct 1114 ms 229764 KB Output is correct
70 Correct 27 ms 33996 KB Output is correct
71 Correct 32 ms 34924 KB Output is correct
72 Correct 530 ms 146744 KB Output is correct
73 Correct 853 ms 178504 KB Output is correct
74 Correct 1223 ms 210088 KB Output is correct
75 Correct 1150 ms 212848 KB Output is correct
76 Correct 1239 ms 230504 KB Output is correct
77 Correct 33 ms 34244 KB Output is correct
78 Correct 40 ms 35084 KB Output is correct
79 Correct 495 ms 146688 KB Output is correct
80 Correct 761 ms 178836 KB Output is correct
81 Correct 1125 ms 210180 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 33100 KB Output is correct
2 Correct 44 ms 83220 KB Output is correct
3 Correct 20 ms 33108 KB Output is correct
4 Correct 44 ms 83252 KB Output is correct
5 Correct 43 ms 83200 KB Output is correct
6 Correct 21 ms 33100 KB Output is correct
7 Correct 20 ms 33100 KB Output is correct
8 Correct 21 ms 33100 KB Output is correct
9 Correct 482 ms 156876 KB Output is correct
10 Correct 80 ms 90980 KB Output is correct
11 Correct 248 ms 123196 KB Output is correct
12 Correct 106 ms 94660 KB Output is correct
13 Correct 99 ms 42980 KB Output is correct
14 Correct 23 ms 33308 KB Output is correct
15 Correct 24 ms 33612 KB Output is correct
16 Correct 564 ms 156908 KB Output is correct
17 Correct 47 ms 83256 KB Output is correct
18 Correct 45 ms 83300 KB Output is correct
19 Correct 22 ms 33172 KB Output is correct
20 Correct 958 ms 200092 KB Output is correct
21 Correct 1051 ms 200088 KB Output is correct
22 Correct 961 ms 199936 KB Output is correct
23 Correct 909 ms 208428 KB Output is correct
24 Correct 336 ms 54384 KB Output is correct
25 Correct 665 ms 77900 KB Output is correct
26 Correct 629 ms 77760 KB Output is correct
27 Correct 1022 ms 230496 KB Output is correct
28 Correct 1061 ms 230436 KB Output is correct
29 Correct 1146 ms 230356 KB Output is correct
30 Correct 1085 ms 230316 KB Output is correct
31 Correct 58 ms 83268 KB Output is correct
32 Correct 96 ms 92472 KB Output is correct
33 Correct 148 ms 43700 KB Output is correct
34 Correct 1057 ms 199976 KB Output is correct
35 Correct 39 ms 35392 KB Output is correct
36 Correct 127 ms 44228 KB Output is correct
37 Correct 257 ms 55388 KB Output is correct
38 Correct 476 ms 132704 KB Output is correct
39 Correct 630 ms 151164 KB Output is correct
40 Correct 797 ms 169704 KB Output is correct
41 Correct 1018 ms 187580 KB Output is correct
42 Correct 1185 ms 206664 KB Output is correct
43 Correct 44 ms 83268 KB Output is correct
44 Correct 43 ms 83320 KB Output is correct
45 Correct 49 ms 83228 KB Output is correct
46 Correct 22 ms 33100 KB Output is correct
47 Correct 20 ms 33100 KB Output is correct
48 Correct 43 ms 83256 KB Output is correct
49 Correct 45 ms 83236 KB Output is correct
50 Correct 44 ms 83264 KB Output is correct
51 Correct 43 ms 83276 KB Output is correct
52 Correct 22 ms 33124 KB Output is correct
53 Correct 50 ms 83212 KB Output is correct
54 Correct 27 ms 33604 KB Output is correct
55 Correct 25 ms 33868 KB Output is correct
56 Correct 485 ms 147364 KB Output is correct
57 Correct 757 ms 176568 KB Output is correct
58 Correct 780 ms 176568 KB Output is correct
59 Correct 21 ms 33100 KB Output is correct
60 Correct 43 ms 83320 KB Output is correct
61 Correct 23 ms 33100 KB Output is correct
62 Correct 1151 ms 230468 KB Output is correct
63 Correct 1191 ms 230632 KB Output is correct
64 Correct 1141 ms 229728 KB Output is correct
65 Correct 26 ms 33996 KB Output is correct
66 Correct 33 ms 34888 KB Output is correct
67 Correct 491 ms 146608 KB Output is correct
68 Correct 932 ms 178604 KB Output is correct
69 Correct 1144 ms 210036 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 33100 KB Output is correct
2 Correct 44 ms 83220 KB Output is correct
3 Correct 20 ms 33108 KB Output is correct
4 Correct 44 ms 83252 KB Output is correct
5 Correct 43 ms 83200 KB Output is correct
6 Correct 21 ms 33100 KB Output is correct
7 Correct 20 ms 33100 KB Output is correct
8 Correct 21 ms 33100 KB Output is correct
9 Correct 482 ms 156876 KB Output is correct
10 Correct 80 ms 90980 KB Output is correct
11 Correct 248 ms 123196 KB Output is correct
12 Correct 106 ms 94660 KB Output is correct
13 Correct 99 ms 42980 KB Output is correct
14 Correct 23 ms 33308 KB Output is correct
15 Correct 24 ms 33612 KB Output is correct
16 Correct 564 ms 156908 KB Output is correct
17 Correct 1127 ms 230472 KB Output is correct
18 Correct 1199 ms 230636 KB Output is correct
19 Correct 1080 ms 200020 KB Output is correct
20 Correct 1165 ms 208996 KB Output is correct
21 Correct 1051 ms 206704 KB Output is correct
22 Correct 51 ms 83240 KB Output is correct
23 Correct 177 ms 103692 KB Output is correct
24 Correct 55 ms 37616 KB Output is correct
25 Correct 207 ms 48956 KB Output is correct
26 Correct 408 ms 60240 KB Output is correct
27 Correct 530 ms 146432 KB Output is correct
28 Correct 702 ms 162524 KB Output is correct
29 Correct 947 ms 178040 KB Output is correct
30 Correct 1044 ms 193896 KB Output is correct
31 Correct 1210 ms 209632 KB Output is correct
32 Correct 1219 ms 212828 KB Output is correct
33 Correct 1228 ms 230512 KB Output is correct
34 Correct 28 ms 34248 KB Output is correct
35 Correct 35 ms 35132 KB Output is correct
36 Correct 518 ms 146644 KB Output is correct
37 Correct 938 ms 178704 KB Output is correct
38 Correct 1230 ms 210108 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 33100 KB Output is correct
2 Correct 44 ms 83220 KB Output is correct
3 Correct 20 ms 33108 KB Output is correct
4 Correct 44 ms 83252 KB Output is correct
5 Correct 43 ms 83200 KB Output is correct
6 Correct 21 ms 33100 KB Output is correct
7 Correct 20 ms 33100 KB Output is correct
8 Correct 21 ms 33100 KB Output is correct
9 Correct 482 ms 156876 KB Output is correct
10 Correct 80 ms 90980 KB Output is correct
11 Correct 248 ms 123196 KB Output is correct
12 Correct 106 ms 94660 KB Output is correct
13 Correct 99 ms 42980 KB Output is correct
14 Correct 23 ms 33308 KB Output is correct
15 Correct 24 ms 33612 KB Output is correct
16 Correct 564 ms 156908 KB Output is correct
17 Correct 44 ms 83240 KB Output is correct
18 Correct 47 ms 83308 KB Output is correct
19 Correct 46 ms 83268 KB Output is correct
20 Correct 43 ms 83268 KB Output is correct
21 Correct 22 ms 33156 KB Output is correct
22 Correct 43 ms 83284 KB Output is correct
23 Correct 1067 ms 201580 KB Output is correct
24 Correct 45 ms 83308 KB Output is correct
25 Correct 57 ms 84036 KB Output is correct
26 Correct 26 ms 33796 KB Output is correct
27 Correct 28 ms 33988 KB Output is correct
28 Correct 424 ms 130660 KB Output is correct
29 Correct 583 ms 154372 KB Output is correct
30 Correct 897 ms 177924 KB Output is correct
31 Correct 1107 ms 201784 KB Output is correct
32 Correct 42 ms 83268 KB Output is correct
33 Correct 43 ms 83232 KB Output is correct
34 Correct 43 ms 83272 KB Output is correct
35 Correct 21 ms 33100 KB Output is correct
36 Correct 22 ms 33132 KB Output is correct
37 Correct 50 ms 83232 KB Output is correct
38 Correct 49 ms 83204 KB Output is correct
39 Correct 44 ms 83396 KB Output is correct
40 Correct 44 ms 83348 KB Output is correct
41 Correct 20 ms 33100 KB Output is correct
42 Correct 44 ms 83316 KB Output is correct
43 Correct 24 ms 33624 KB Output is correct
44 Correct 29 ms 33756 KB Output is correct
45 Correct 506 ms 147448 KB Output is correct
46 Correct 784 ms 176656 KB Output is correct
47 Correct 765 ms 176648 KB Output is correct
48 Correct 45 ms 83288 KB Output is correct
49 Correct 47 ms 83276 KB Output is correct
50 Correct 52 ms 83284 KB Output is correct
51 Correct 55 ms 83244 KB Output is correct
52 Correct 41 ms 83264 KB Output is correct
53 Correct 43 ms 83276 KB Output is correct
54 Correct 44 ms 83256 KB Output is correct
55 Correct 1158 ms 202144 KB Output is correct
56 Correct 46 ms 83320 KB Output is correct
57 Correct 49 ms 84396 KB Output is correct
58 Correct 61 ms 86984 KB Output is correct
59 Correct 39 ms 35412 KB Output is correct
60 Correct 528 ms 145684 KB Output is correct
61 Correct 696 ms 163996 KB Output is correct
62 Correct 902 ms 181356 KB Output is correct
63 Correct 1130 ms 202072 KB Output is correct
64 Correct 20 ms 33100 KB Output is correct
65 Correct 46 ms 83264 KB Output is correct
66 Correct 22 ms 33172 KB Output is correct
67 Correct 1108 ms 230476 KB Output is correct
68 Correct 1161 ms 230572 KB Output is correct
69 Correct 1114 ms 229764 KB Output is correct
70 Correct 27 ms 33996 KB Output is correct
71 Correct 32 ms 34924 KB Output is correct
72 Correct 530 ms 146744 KB Output is correct
73 Correct 853 ms 178504 KB Output is correct
74 Correct 1223 ms 210088 KB Output is correct
75 Correct 1150 ms 212848 KB Output is correct
76 Correct 1239 ms 230504 KB Output is correct
77 Correct 33 ms 34244 KB Output is correct
78 Correct 40 ms 35084 KB Output is correct
79 Correct 495 ms 146688 KB Output is correct
80 Correct 761 ms 178836 KB Output is correct
81 Correct 1125 ms 210180 KB Output is correct
82 Correct 47 ms 83256 KB Output is correct
83 Correct 45 ms 83300 KB Output is correct
84 Correct 22 ms 33172 KB Output is correct
85 Correct 958 ms 200092 KB Output is correct
86 Correct 1051 ms 200088 KB Output is correct
87 Correct 961 ms 199936 KB Output is correct
88 Correct 909 ms 208428 KB Output is correct
89 Correct 336 ms 54384 KB Output is correct
90 Correct 665 ms 77900 KB Output is correct
91 Correct 629 ms 77760 KB Output is correct
92 Correct 1022 ms 230496 KB Output is correct
93 Correct 1061 ms 230436 KB Output is correct
94 Correct 1146 ms 230356 KB Output is correct
95 Correct 1085 ms 230316 KB Output is correct
96 Correct 58 ms 83268 KB Output is correct
97 Correct 96 ms 92472 KB Output is correct
98 Correct 148 ms 43700 KB Output is correct
99 Correct 1057 ms 199976 KB Output is correct
100 Correct 39 ms 35392 KB Output is correct
101 Correct 127 ms 44228 KB Output is correct
102 Correct 257 ms 55388 KB Output is correct
103 Correct 476 ms 132704 KB Output is correct
104 Correct 630 ms 151164 KB Output is correct
105 Correct 797 ms 169704 KB Output is correct
106 Correct 1018 ms 187580 KB Output is correct
107 Correct 1185 ms 206664 KB Output is correct
108 Correct 44 ms 83268 KB Output is correct
109 Correct 43 ms 83320 KB Output is correct
110 Correct 49 ms 83228 KB Output is correct
111 Correct 22 ms 33100 KB Output is correct
112 Correct 20 ms 33100 KB Output is correct
113 Correct 43 ms 83256 KB Output is correct
114 Correct 45 ms 83236 KB Output is correct
115 Correct 44 ms 83264 KB Output is correct
116 Correct 43 ms 83276 KB Output is correct
117 Correct 22 ms 33124 KB Output is correct
118 Correct 50 ms 83212 KB Output is correct
119 Correct 27 ms 33604 KB Output is correct
120 Correct 25 ms 33868 KB Output is correct
121 Correct 485 ms 147364 KB Output is correct
122 Correct 757 ms 176568 KB Output is correct
123 Correct 780 ms 176568 KB Output is correct
124 Correct 21 ms 33100 KB Output is correct
125 Correct 43 ms 83320 KB Output is correct
126 Correct 23 ms 33100 KB Output is correct
127 Correct 1151 ms 230468 KB Output is correct
128 Correct 1191 ms 230632 KB Output is correct
129 Correct 1141 ms 229728 KB Output is correct
130 Correct 26 ms 33996 KB Output is correct
131 Correct 33 ms 34888 KB Output is correct
132 Correct 491 ms 146608 KB Output is correct
133 Correct 932 ms 178604 KB Output is correct
134 Correct 1144 ms 210036 KB Output is correct
135 Correct 1127 ms 230472 KB Output is correct
136 Correct 1199 ms 230636 KB Output is correct
137 Correct 1080 ms 200020 KB Output is correct
138 Correct 1165 ms 208996 KB Output is correct
139 Correct 1051 ms 206704 KB Output is correct
140 Correct 51 ms 83240 KB Output is correct
141 Correct 177 ms 103692 KB Output is correct
142 Correct 55 ms 37616 KB Output is correct
143 Correct 207 ms 48956 KB Output is correct
144 Correct 408 ms 60240 KB Output is correct
145 Correct 530 ms 146432 KB Output is correct
146 Correct 702 ms 162524 KB Output is correct
147 Correct 947 ms 178040 KB Output is correct
148 Correct 1044 ms 193896 KB Output is correct
149 Correct 1210 ms 209632 KB Output is correct
150 Correct 1219 ms 212828 KB Output is correct
151 Correct 1228 ms 230512 KB Output is correct
152 Correct 28 ms 34248 KB Output is correct
153 Correct 35 ms 35132 KB Output is correct
154 Correct 518 ms 146644 KB Output is correct
155 Correct 938 ms 178704 KB Output is correct
156 Correct 1230 ms 210108 KB Output is correct
157 Correct 46 ms 83272 KB Output is correct
158 Correct 21 ms 33160 KB Output is correct
159 Correct 45 ms 83268 KB Output is correct
160 Correct 42 ms 83268 KB Output is correct
161 Correct 1162 ms 203316 KB Output is correct
162 Correct 1179 ms 199992 KB Output is correct
163 Correct 1112 ms 201108 KB Output is correct
164 Correct 1072 ms 201004 KB Output is correct
165 Correct 1210 ms 203212 KB Output is correct
166 Correct 1308 ms 202876 KB Output is correct
167 Runtime error 667 ms 223248 KB Execution killed with signal 6
168 Halted 0 ms 0 KB -