oj.uz

Submission #439986

# Submission time Handle Problem Language Result Execution time Memory
439986 2021-07-01T10:40:07 Z cheeheng Fountain Parks (IOI21_parks) C++17
70 / 100
 3500 ms 730532 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];

mt19937 rng(1);

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: {2, 1}){
            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);
            }
        }
    }

    for(int i = 0; i < n; i ++){
        int i2 = p[i];
        for(int k: {3, 0}){
            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);
        if(res != n-1){
            shuffle(EdgeList, EdgeList+m, rng);
            continue;
        }

        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;
        }
        shuffle(EdgeList, EdgeList+m, rng);
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 33228 KB Output is correct
2 Correct 48 ms 83312 KB Output is correct
3 Correct 21 ms 33100 KB Output is correct
4 Correct 49 ms 83288 KB Output is correct
5 Correct 45 ms 83268 KB Output is correct
6 Correct 26 ms 33100 KB Output is correct
7 Correct 22 ms 33100 KB Output is correct
8 Correct 21 ms 33100 KB Output is correct
9 Correct 517 ms 156864 KB Output is correct
10 Correct 80 ms 90848 KB Output is correct
11 Correct 242 ms 123212 KB Output is correct
12 Correct 96 ms 94660 KB Output is correct
13 Correct 98 ms 43032 KB Output is correct
14 Correct 22 ms 33368 KB Output is correct
15 Correct 23 ms 33604 KB Output is correct
16 Correct 558 ms 156916 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 33228 KB Output is correct
2 Correct 48 ms 83312 KB Output is correct
3 Correct 21 ms 33100 KB Output is correct
4 Correct 49 ms 83288 KB Output is correct
5 Correct 45 ms 83268 KB Output is correct
6 Correct 26 ms 33100 KB Output is correct
7 Correct 22 ms 33100 KB Output is correct
8 Correct 21 ms 33100 KB Output is correct
9 Correct 517 ms 156864 KB Output is correct
10 Correct 80 ms 90848 KB Output is correct
11 Correct 242 ms 123212 KB Output is correct
12 Correct 96 ms 94660 KB Output is correct
13 Correct 98 ms 43032 KB Output is correct
14 Correct 22 ms 33368 KB Output is correct
15 Correct 23 ms 33604 KB Output is correct
16 Correct 558 ms 156916 KB Output is correct
17 Correct 49 ms 83264 KB Output is correct
18 Correct 51 ms 83340 KB Output is correct
19 Correct 46 ms 83316 KB Output is correct
20 Correct 53 ms 83268 KB Output is correct
21 Correct 22 ms 33100 KB Output is correct
22 Correct 46 ms 83232 KB Output is correct
23 Correct 1170 ms 216836 KB Output is correct
24 Correct 54 ms 83268 KB Output is correct
25 Correct 56 ms 84008 KB Output is correct
26 Correct 29 ms 33868 KB Output is correct
27 Correct 28 ms 34120 KB Output is correct
28 Correct 403 ms 136836 KB Output is correct
29 Correct 665 ms 163412 KB Output is correct
30 Correct 877 ms 190508 KB Output is correct
31 Correct 1334 ms 216736 KB Output is correct
32 Correct 45 ms 83272 KB Output is correct
33 Correct 52 ms 83216 KB Output is correct
34 Correct 49 ms 83268 KB Output is correct
35 Correct 20 ms 33196 KB Output is correct
36 Correct 21 ms 33224 KB Output is correct
37 Correct 45 ms 83212 KB Output is correct
38 Correct 45 ms 83276 KB Output is correct
39 Correct 49 ms 83272 KB Output is correct
40 Correct 56 ms 83268 KB Output is correct
41 Correct 23 ms 33100 KB Output is correct
42 Correct 49 ms 83232 KB Output is correct
43 Correct 27 ms 33524 KB Output is correct
44 Correct 25 ms 33740 KB Output is correct
45 Correct 538 ms 147788 KB Output is correct
46 Correct 860 ms 176800 KB Output is correct
47 Correct 793 ms 176716 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 33228 KB Output is correct
2 Correct 48 ms 83312 KB Output is correct
3 Correct 21 ms 33100 KB Output is correct
4 Correct 49 ms 83288 KB Output is correct
5 Correct 45 ms 83268 KB Output is correct
6 Correct 26 ms 33100 KB Output is correct
7 Correct 22 ms 33100 KB Output is correct
8 Correct 21 ms 33100 KB Output is correct
9 Correct 517 ms 156864 KB Output is correct
10 Correct 80 ms 90848 KB Output is correct
11 Correct 242 ms 123212 KB Output is correct
12 Correct 96 ms 94660 KB Output is correct
13 Correct 98 ms 43032 KB Output is correct
14 Correct 22 ms 33368 KB Output is correct
15 Correct 23 ms 33604 KB Output is correct
16 Correct 558 ms 156916 KB Output is correct
17 Correct 49 ms 83264 KB Output is correct
18 Correct 51 ms 83340 KB Output is correct
19 Correct 46 ms 83316 KB Output is correct
20 Correct 53 ms 83268 KB Output is correct
21 Correct 22 ms 33100 KB Output is correct
22 Correct 46 ms 83232 KB Output is correct
23 Correct 1170 ms 216836 KB Output is correct
24 Correct 54 ms 83268 KB Output is correct
25 Correct 56 ms 84008 KB Output is correct
26 Correct 29 ms 33868 KB Output is correct
27 Correct 28 ms 34120 KB Output is correct
28 Correct 403 ms 136836 KB Output is correct
29 Correct 665 ms 163412 KB Output is correct
30 Correct 877 ms 190508 KB Output is correct
31 Correct 1334 ms 216736 KB Output is correct
32 Correct 45 ms 83272 KB Output is correct
33 Correct 52 ms 83216 KB Output is correct
34 Correct 49 ms 83268 KB Output is correct
35 Correct 20 ms 33196 KB Output is correct
36 Correct 21 ms 33224 KB Output is correct
37 Correct 45 ms 83212 KB Output is correct
38 Correct 45 ms 83276 KB Output is correct
39 Correct 49 ms 83272 KB Output is correct
40 Correct 56 ms 83268 KB Output is correct
41 Correct 23 ms 33100 KB Output is correct
42 Correct 49 ms 83232 KB Output is correct
43 Correct 27 ms 33524 KB Output is correct
44 Correct 25 ms 33740 KB Output is correct
45 Correct 538 ms 147788 KB Output is correct
46 Correct 860 ms 176800 KB Output is correct
47 Correct 793 ms 176716 KB Output is correct
48 Correct 45 ms 83232 KB Output is correct
49 Correct 49 ms 83204 KB Output is correct
50 Correct 47 ms 83304 KB Output is correct
51 Correct 57 ms 83268 KB Output is correct
52 Correct 44 ms 83336 KB Output is correct
53 Correct 47 ms 83268 KB Output is correct
54 Correct 48 ms 83196 KB Output is correct
55 Correct 1270 ms 212180 KB Output is correct
56 Correct 50 ms 83244 KB Output is correct
57 Correct 56 ms 84476 KB Output is correct
58 Correct 70 ms 87216 KB Output is correct
59 Correct 40 ms 35488 KB Output is correct
60 Correct 547 ms 147772 KB Output is correct
61 Correct 735 ms 170488 KB Output is correct
62 Correct 944 ms 189928 KB Output is correct
63 Correct 1210 ms 212280 KB Output is correct
64 Correct 23 ms 33100 KB Output is correct
65 Correct 53 ms 83260 KB Output is correct
66 Correct 21 ms 33176 KB Output is correct
67 Correct 1138 ms 230580 KB Output is correct
68 Correct 1173 ms 230436 KB Output is correct
69 Correct 1186 ms 229780 KB Output is correct
70 Correct 30 ms 33996 KB Output is correct
71 Correct 37 ms 34888 KB Output is correct
72 Correct 538 ms 146976 KB Output is correct
73 Correct 985 ms 179364 KB Output is correct
74 Correct 1325 ms 210868 KB Output is correct
75 Correct 1195 ms 219520 KB Output is correct
76 Correct 1235 ms 230440 KB Output is correct
77 Correct 30 ms 34252 KB Output is correct
78 Correct 35 ms 35128 KB Output is correct
79 Correct 554 ms 148760 KB Output is correct
80 Correct 940 ms 181976 KB Output is correct
81 Correct 1406 ms 214204 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 33228 KB Output is correct
2 Correct 48 ms 83312 KB Output is correct
3 Correct 21 ms 33100 KB Output is correct
4 Correct 49 ms 83288 KB Output is correct
5 Correct 45 ms 83268 KB Output is correct
6 Correct 26 ms 33100 KB Output is correct
7 Correct 22 ms 33100 KB Output is correct
8 Correct 21 ms 33100 KB Output is correct
9 Correct 517 ms 156864 KB Output is correct
10 Correct 80 ms 90848 KB Output is correct
11 Correct 242 ms 123212 KB Output is correct
12 Correct 96 ms 94660 KB Output is correct
13 Correct 98 ms 43032 KB Output is correct
14 Correct 22 ms 33368 KB Output is correct
15 Correct 23 ms 33604 KB Output is correct
16 Correct 558 ms 156916 KB Output is correct
17 Correct 48 ms 83220 KB Output is correct
18 Correct 50 ms 83216 KB Output is correct
19 Correct 24 ms 33168 KB Output is correct
20 Correct 1170 ms 201184 KB Output is correct
21 Correct 1150 ms 201232 KB Output is correct
22 Correct 1100 ms 201180 KB Output is correct
23 Correct 1082 ms 208440 KB Output is correct
24 Correct 350 ms 54248 KB Output is correct
25 Correct 735 ms 77780 KB Output is correct
26 Correct 680 ms 77892 KB Output is correct
27 Correct 1129 ms 230468 KB Output is correct
28 Correct 1065 ms 230360 KB Output is correct
29 Correct 1159 ms 230288 KB Output is correct
30 Correct 1246 ms 230456 KB Output is correct
31 Correct 48 ms 83236 KB Output is correct
32 Correct 117 ms 92552 KB Output is correct
33 Correct 148 ms 43752 KB Output is correct
34 Correct 1149 ms 201180 KB Output is correct
35 Correct 38 ms 35404 KB Output is correct
36 Correct 165 ms 44288 KB Output is correct
37 Correct 350 ms 55504 KB Output is correct
38 Correct 485 ms 132776 KB Output is correct
39 Correct 788 ms 150996 KB Output is correct
40 Correct 995 ms 169200 KB Output is correct
41 Correct 1279 ms 188548 KB Output is correct
42 Correct 1382 ms 206968 KB Output is correct
43 Correct 48 ms 83272 KB Output is correct
44 Correct 46 ms 83276 KB Output is correct
45 Correct 46 ms 83272 KB Output is correct
46 Correct 26 ms 33164 KB Output is correct
47 Correct 23 ms 33140 KB Output is correct
48 Correct 45 ms 83240 KB Output is correct
49 Correct 48 ms 83220 KB Output is correct
50 Correct 45 ms 83304 KB Output is correct
51 Correct 45 ms 83284 KB Output is correct
52 Correct 21 ms 33088 KB Output is correct
53 Correct 53 ms 83304 KB Output is correct
54 Correct 23 ms 33596 KB Output is correct
55 Correct 24 ms 33868 KB Output is correct
56 Correct 495 ms 147720 KB Output is correct
57 Correct 770 ms 176732 KB Output is correct
58 Correct 884 ms 176744 KB Output is correct
59 Correct 20 ms 33100 KB Output is correct
60 Correct 45 ms 83276 KB Output is correct
61 Correct 22 ms 33108 KB Output is correct
62 Correct 1133 ms 230488 KB Output is correct
63 Correct 1103 ms 230572 KB Output is correct
64 Correct 1202 ms 229808 KB Output is correct
65 Correct 26 ms 33996 KB Output is correct
66 Correct 35 ms 34984 KB Output is correct
67 Correct 586 ms 147148 KB Output is correct
68 Correct 921 ms 179264 KB Output is correct
69 Correct 1245 ms 210872 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 33228 KB Output is correct
2 Correct 48 ms 83312 KB Output is correct
3 Correct 21 ms 33100 KB Output is correct
4 Correct 49 ms 83288 KB Output is correct
5 Correct 45 ms 83268 KB Output is correct
6 Correct 26 ms 33100 KB Output is correct
7 Correct 22 ms 33100 KB Output is correct
8 Correct 21 ms 33100 KB Output is correct
9 Correct 517 ms 156864 KB Output is correct
10 Correct 80 ms 90848 KB Output is correct
11 Correct 242 ms 123212 KB Output is correct
12 Correct 96 ms 94660 KB Output is correct
13 Correct 98 ms 43032 KB Output is correct
14 Correct 22 ms 33368 KB Output is correct
15 Correct 23 ms 33604 KB Output is correct
16 Correct 558 ms 156916 KB Output is correct
17 Correct 1184 ms 230600 KB Output is correct
18 Correct 1183 ms 230764 KB Output is correct
19 Correct 1214 ms 207976 KB Output is correct
20 Correct 1137 ms 210080 KB Output is correct
21 Correct 935 ms 206800 KB Output is correct
22 Correct 49 ms 83308 KB Output is correct
23 Correct 187 ms 103772 KB Output is correct
24 Correct 55 ms 37640 KB Output is correct
25 Correct 191 ms 48916 KB Output is correct
26 Correct 352 ms 60264 KB Output is correct
27 Correct 621 ms 147036 KB Output is correct
28 Correct 789 ms 163136 KB Output is correct
29 Correct 928 ms 179000 KB Output is correct
30 Correct 1149 ms 194064 KB Output is correct
31 Correct 1345 ms 210864 KB Output is correct
32 Correct 1099 ms 219560 KB Output is correct
33 Correct 1177 ms 230596 KB Output is correct
34 Correct 31 ms 34244 KB Output is correct
35 Correct 36 ms 35148 KB Output is correct
36 Correct 532 ms 148652 KB Output is correct
37 Correct 832 ms 182068 KB Output is correct
38 Correct 1197 ms 214132 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 33228 KB Output is correct
2 Correct 48 ms 83312 KB Output is correct
3 Correct 21 ms 33100 KB Output is correct
4 Correct 49 ms 83288 KB Output is correct
5 Correct 45 ms 83268 KB Output is correct
6 Correct 26 ms 33100 KB Output is correct
7 Correct 22 ms 33100 KB Output is correct
8 Correct 21 ms 33100 KB Output is correct
9 Correct 517 ms 156864 KB Output is correct
10 Correct 80 ms 90848 KB Output is correct
11 Correct 242 ms 123212 KB Output is correct
12 Correct 96 ms 94660 KB Output is correct
13 Correct 98 ms 43032 KB Output is correct
14 Correct 22 ms 33368 KB Output is correct
15 Correct 23 ms 33604 KB Output is correct
16 Correct 558 ms 156916 KB Output is correct
17 Correct 49 ms 83264 KB Output is correct
18 Correct 51 ms 83340 KB Output is correct
19 Correct 46 ms 83316 KB Output is correct
20 Correct 53 ms 83268 KB Output is correct
21 Correct 22 ms 33100 KB Output is correct
22 Correct 46 ms 83232 KB Output is correct
23 Correct 1170 ms 216836 KB Output is correct
24 Correct 54 ms 83268 KB Output is correct
25 Correct 56 ms 84008 KB Output is correct
26 Correct 29 ms 33868 KB Output is correct
27 Correct 28 ms 34120 KB Output is correct
28 Correct 403 ms 136836 KB Output is correct
29 Correct 665 ms 163412 KB Output is correct
30 Correct 877 ms 190508 KB Output is correct
31 Correct 1334 ms 216736 KB Output is correct
32 Correct 45 ms 83272 KB Output is correct
33 Correct 52 ms 83216 KB Output is correct
34 Correct 49 ms 83268 KB Output is correct
35 Correct 20 ms 33196 KB Output is correct
36 Correct 21 ms 33224 KB Output is correct
37 Correct 45 ms 83212 KB Output is correct
38 Correct 45 ms 83276 KB Output is correct
39 Correct 49 ms 83272 KB Output is correct
40 Correct 56 ms 83268 KB Output is correct
41 Correct 23 ms 33100 KB Output is correct
42 Correct 49 ms 83232 KB Output is correct
43 Correct 27 ms 33524 KB Output is correct
44 Correct 25 ms 33740 KB Output is correct
45 Correct 538 ms 147788 KB Output is correct
46 Correct 860 ms 176800 KB Output is correct
47 Correct 793 ms 176716 KB Output is correct
48 Correct 45 ms 83232 KB Output is correct
49 Correct 49 ms 83204 KB Output is correct
50 Correct 47 ms 83304 KB Output is correct
51 Correct 57 ms 83268 KB Output is correct
52 Correct 44 ms 83336 KB Output is correct
53 Correct 47 ms 83268 KB Output is correct
54 Correct 48 ms 83196 KB Output is correct
55 Correct 1270 ms 212180 KB Output is correct
56 Correct 50 ms 83244 KB Output is correct
57 Correct 56 ms 84476 KB Output is correct
58 Correct 70 ms 87216 KB Output is correct
59 Correct 40 ms 35488 KB Output is correct
60 Correct 547 ms 147772 KB Output is correct
61 Correct 735 ms 170488 KB Output is correct
62 Correct 944 ms 189928 KB Output is correct
63 Correct 1210 ms 212280 KB Output is correct
64 Correct 23 ms 33100 KB Output is correct
65 Correct 53 ms 83260 KB Output is correct
66 Correct 21 ms 33176 KB Output is correct
67 Correct 1138 ms 230580 KB Output is correct
68 Correct 1173 ms 230436 KB Output is correct
69 Correct 1186 ms 229780 KB Output is correct
70 Correct 30 ms 33996 KB Output is correct
71 Correct 37 ms 34888 KB Output is correct
72 Correct 538 ms 146976 KB Output is correct
73 Correct 985 ms 179364 KB Output is correct
74 Correct 1325 ms 210868 KB Output is correct
75 Correct 1195 ms 219520 KB Output is correct
76 Correct 1235 ms 230440 KB Output is correct
77 Correct 30 ms 34252 KB Output is correct
78 Correct 35 ms 35128 KB Output is correct
79 Correct 554 ms 148760 KB Output is correct
80 Correct 940 ms 181976 KB Output is correct
81 Correct 1406 ms 214204 KB Output is correct
82 Correct 48 ms 83220 KB Output is correct
83 Correct 50 ms 83216 KB Output is correct
84 Correct 24 ms 33168 KB Output is correct
85 Correct 1170 ms 201184 KB Output is correct
86 Correct 1150 ms 201232 KB Output is correct
87 Correct 1100 ms 201180 KB Output is correct
88 Correct 1082 ms 208440 KB Output is correct
89 Correct 350 ms 54248 KB Output is correct
90 Correct 735 ms 77780 KB Output is correct
91 Correct 680 ms 77892 KB Output is correct
92 Correct 1129 ms 230468 KB Output is correct
93 Correct 1065 ms 230360 KB Output is correct
94 Correct 1159 ms 230288 KB Output is correct
95 Correct 1246 ms 230456 KB Output is correct
96 Correct 48 ms 83236 KB Output is correct
97 Correct 117 ms 92552 KB Output is correct
98 Correct 148 ms 43752 KB Output is correct
99 Correct 1149 ms 201180 KB Output is correct
100 Correct 38 ms 35404 KB Output is correct
101 Correct 165 ms 44288 KB Output is correct
102 Correct 350 ms 55504 KB Output is correct
103 Correct 485 ms 132776 KB Output is correct
104 Correct 788 ms 150996 KB Output is correct
105 Correct 995 ms 169200 KB Output is correct
106 Correct 1279 ms 188548 KB Output is correct
107 Correct 1382 ms 206968 KB Output is correct
108 Correct 48 ms 83272 KB Output is correct
109 Correct 46 ms 83276 KB Output is correct
110 Correct 46 ms 83272 KB Output is correct
111 Correct 26 ms 33164 KB Output is correct
112 Correct 23 ms 33140 KB Output is correct
113 Correct 45 ms 83240 KB Output is correct
114 Correct 48 ms 83220 KB Output is correct
115 Correct 45 ms 83304 KB Output is correct
116 Correct 45 ms 83284 KB Output is correct
117 Correct 21 ms 33088 KB Output is correct
118 Correct 53 ms 83304 KB Output is correct
119 Correct 23 ms 33596 KB Output is correct
120 Correct 24 ms 33868 KB Output is correct
121 Correct 495 ms 147720 KB Output is correct
122 Correct 770 ms 176732 KB Output is correct
123 Correct 884 ms 176744 KB Output is correct
124 Correct 20 ms 33100 KB Output is correct
125 Correct 45 ms 83276 KB Output is correct
126 Correct 22 ms 33108 KB Output is correct
127 Correct 1133 ms 230488 KB Output is correct
128 Correct 1103 ms 230572 KB Output is correct
129 Correct 1202 ms 229808 KB Output is correct
130 Correct 26 ms 33996 KB Output is correct
131 Correct 35 ms 34984 KB Output is correct
132 Correct 586 ms 147148 KB Output is correct
133 Correct 921 ms 179264 KB Output is correct
134 Correct 1245 ms 210872 KB Output is correct
135 Correct 1184 ms 230600 KB Output is correct
136 Correct 1183 ms 230764 KB Output is correct
137 Correct 1214 ms 207976 KB Output is correct
138 Correct 1137 ms 210080 KB Output is correct
139 Correct 935 ms 206800 KB Output is correct
140 Correct 49 ms 83308 KB Output is correct
141 Correct 187 ms 103772 KB Output is correct
142 Correct 55 ms 37640 KB Output is correct
143 Correct 191 ms 48916 KB Output is correct
144 Correct 352 ms 60264 KB Output is correct
145 Correct 621 ms 147036 KB Output is correct
146 Correct 789 ms 163136 KB Output is correct
147 Correct 928 ms 179000 KB Output is correct
148 Correct 1149 ms 194064 KB Output is correct
149 Correct 1345 ms 210864 KB Output is correct
150 Correct 1099 ms 219560 KB Output is correct
151 Correct 1177 ms 230596 KB Output is correct
152 Correct 31 ms 34244 KB Output is correct
153 Correct 36 ms 35148 KB Output is correct
154 Correct 532 ms 148652 KB Output is correct
155 Correct 832 ms 182068 KB Output is correct
156 Correct 1197 ms 214132 KB Output is correct
157 Correct 49 ms 83284 KB Output is correct
158 Correct 21 ms 33108 KB Output is correct
159 Correct 50 ms 83208 KB Output is correct
160 Correct 45 ms 83304 KB Output is correct
161 Correct 1107 ms 203372 KB Output is correct
162 Correct 1091 ms 201400 KB Output is correct
163 Correct 1069 ms 202088 KB Output is correct
164 Correct 1006 ms 202168 KB Output is correct
165 Correct 1067 ms 203320 KB Output is correct
166 Correct 1004 ms 202948 KB Output is correct
167 Execution timed out 3628 ms 730532 KB Time limit exceeded
168 Halted 0 ms 0 KB -