oj.uz

Submission #439983

# Submission time Handle Problem Language Result Execution time Memory
439983 2021-07-01T10:36:06 Z cheeheng Fountain Parks (IOI21_parks) C++17
70 / 100
 3500 ms 655420 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: {0, 3}){
            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 28 ms 33100 KB Output is correct
2 Correct 49 ms 83272 KB Output is correct
3 Correct 23 ms 33100 KB Output is correct
4 Correct 52 ms 83300 KB Output is correct
5 Correct 52 ms 83264 KB Output is correct
6 Correct 24 ms 33128 KB Output is correct
7 Correct 24 ms 33208 KB Output is correct
8 Correct 27 ms 33092 KB Output is correct
9 Correct 526 ms 156856 KB Output is correct
10 Correct 78 ms 90820 KB Output is correct
11 Correct 263 ms 123248 KB Output is correct
12 Correct 97 ms 94660 KB Output is correct
13 Correct 86 ms 43056 KB Output is correct
14 Correct 23 ms 33376 KB Output is correct
15 Correct 25 ms 33612 KB Output is correct
16 Correct 493 ms 156856 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 33100 KB Output is correct
2 Correct 49 ms 83272 KB Output is correct
3 Correct 23 ms 33100 KB Output is correct
4 Correct 52 ms 83300 KB Output is correct
5 Correct 52 ms 83264 KB Output is correct
6 Correct 24 ms 33128 KB Output is correct
7 Correct 24 ms 33208 KB Output is correct
8 Correct 27 ms 33092 KB Output is correct
9 Correct 526 ms 156856 KB Output is correct
10 Correct 78 ms 90820 KB Output is correct
11 Correct 263 ms 123248 KB Output is correct
12 Correct 97 ms 94660 KB Output is correct
13 Correct 86 ms 43056 KB Output is correct
14 Correct 23 ms 33376 KB Output is correct
15 Correct 25 ms 33612 KB Output is correct
16 Correct 493 ms 156856 KB Output is correct
17 Correct 47 ms 83264 KB Output is correct
18 Correct 51 ms 83308 KB Output is correct
19 Correct 53 ms 83268 KB Output is correct
20 Correct 53 ms 83300 KB Output is correct
21 Correct 25 ms 33100 KB Output is correct
22 Correct 52 ms 83220 KB Output is correct
23 Correct 1186 ms 216760 KB Output is correct
24 Correct 51 ms 83276 KB Output is correct
25 Correct 55 ms 84004 KB Output is correct
26 Correct 25 ms 33856 KB Output is correct
27 Correct 28 ms 34068 KB Output is correct
28 Correct 400 ms 137020 KB Output is correct
29 Correct 615 ms 163384 KB Output is correct
30 Correct 846 ms 190480 KB Output is correct
31 Correct 1158 ms 216756 KB Output is correct
32 Correct 53 ms 83204 KB Output is correct
33 Correct 52 ms 83296 KB Output is correct
34 Correct 53 ms 83304 KB Output is correct
35 Correct 22 ms 33156 KB Output is correct
36 Correct 23 ms 33100 KB Output is correct
37 Correct 47 ms 83256 KB Output is correct
38 Correct 51 ms 83296 KB Output is correct
39 Correct 51 ms 83256 KB Output is correct
40 Correct 53 ms 83268 KB Output is correct
41 Correct 24 ms 33228 KB Output is correct
42 Correct 52 ms 83268 KB Output is correct
43 Correct 27 ms 33548 KB Output is correct
44 Correct 26 ms 33868 KB Output is correct
45 Correct 525 ms 147716 KB Output is correct
46 Correct 754 ms 176776 KB Output is correct
47 Correct 794 ms 176812 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 33100 KB Output is correct
2 Correct 49 ms 83272 KB Output is correct
3 Correct 23 ms 33100 KB Output is correct
4 Correct 52 ms 83300 KB Output is correct
5 Correct 52 ms 83264 KB Output is correct
6 Correct 24 ms 33128 KB Output is correct
7 Correct 24 ms 33208 KB Output is correct
8 Correct 27 ms 33092 KB Output is correct
9 Correct 526 ms 156856 KB Output is correct
10 Correct 78 ms 90820 KB Output is correct
11 Correct 263 ms 123248 KB Output is correct
12 Correct 97 ms 94660 KB Output is correct
13 Correct 86 ms 43056 KB Output is correct
14 Correct 23 ms 33376 KB Output is correct
15 Correct 25 ms 33612 KB Output is correct
16 Correct 493 ms 156856 KB Output is correct
17 Correct 47 ms 83264 KB Output is correct
18 Correct 51 ms 83308 KB Output is correct
19 Correct 53 ms 83268 KB Output is correct
20 Correct 53 ms 83300 KB Output is correct
21 Correct 25 ms 33100 KB Output is correct
22 Correct 52 ms 83220 KB Output is correct
23 Correct 1186 ms 216760 KB Output is correct
24 Correct 51 ms 83276 KB Output is correct
25 Correct 55 ms 84004 KB Output is correct
26 Correct 25 ms 33856 KB Output is correct
27 Correct 28 ms 34068 KB Output is correct
28 Correct 400 ms 137020 KB Output is correct
29 Correct 615 ms 163384 KB Output is correct
30 Correct 846 ms 190480 KB Output is correct
31 Correct 1158 ms 216756 KB Output is correct
32 Correct 53 ms 83204 KB Output is correct
33 Correct 52 ms 83296 KB Output is correct
34 Correct 53 ms 83304 KB Output is correct
35 Correct 22 ms 33156 KB Output is correct
36 Correct 23 ms 33100 KB Output is correct
37 Correct 47 ms 83256 KB Output is correct
38 Correct 51 ms 83296 KB Output is correct
39 Correct 51 ms 83256 KB Output is correct
40 Correct 53 ms 83268 KB Output is correct
41 Correct 24 ms 33228 KB Output is correct
42 Correct 52 ms 83268 KB Output is correct
43 Correct 27 ms 33548 KB Output is correct
44 Correct 26 ms 33868 KB Output is correct
45 Correct 525 ms 147716 KB Output is correct
46 Correct 754 ms 176776 KB Output is correct
47 Correct 794 ms 176812 KB Output is correct
48 Correct 50 ms 83308 KB Output is correct
49 Correct 54 ms 83280 KB Output is correct
50 Correct 49 ms 83232 KB Output is correct
51 Correct 49 ms 83276 KB Output is correct
52 Correct 48 ms 83220 KB Output is correct
53 Correct 49 ms 83200 KB Output is correct
54 Correct 53 ms 83440 KB Output is correct
55 Correct 1260 ms 212232 KB Output is correct
56 Correct 54 ms 83268 KB Output is correct
57 Correct 53 ms 84420 KB Output is correct
58 Correct 74 ms 87244 KB Output is correct
59 Correct 41 ms 35408 KB Output is correct
60 Correct 493 ms 147756 KB Output is correct
61 Correct 674 ms 170592 KB Output is correct
62 Correct 893 ms 189932 KB Output is correct
63 Correct 1064 ms 212536 KB Output is correct
64 Correct 24 ms 33100 KB Output is correct
65 Correct 52 ms 83348 KB Output is correct
66 Correct 24 ms 33208 KB Output is correct
67 Correct 1078 ms 230536 KB Output is correct
68 Correct 1149 ms 230580 KB Output is correct
69 Correct 1094 ms 229848 KB Output is correct
70 Correct 28 ms 34060 KB Output is correct
71 Correct 35 ms 34892 KB Output is correct
72 Correct 532 ms 147148 KB Output is correct
73 Correct 956 ms 179320 KB Output is correct
74 Correct 1354 ms 210976 KB Output is correct
75 Correct 1176 ms 219732 KB Output is correct
76 Correct 1257 ms 230440 KB Output is correct
77 Correct 34 ms 34252 KB Output is correct
78 Correct 40 ms 35096 KB Output is correct
79 Correct 671 ms 148664 KB Output is correct
80 Correct 973 ms 181880 KB Output is correct
81 Correct 1368 ms 214212 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 33100 KB Output is correct
2 Correct 49 ms 83272 KB Output is correct
3 Correct 23 ms 33100 KB Output is correct
4 Correct 52 ms 83300 KB Output is correct
5 Correct 52 ms 83264 KB Output is correct
6 Correct 24 ms 33128 KB Output is correct
7 Correct 24 ms 33208 KB Output is correct
8 Correct 27 ms 33092 KB Output is correct
9 Correct 526 ms 156856 KB Output is correct
10 Correct 78 ms 90820 KB Output is correct
11 Correct 263 ms 123248 KB Output is correct
12 Correct 97 ms 94660 KB Output is correct
13 Correct 86 ms 43056 KB Output is correct
14 Correct 23 ms 33376 KB Output is correct
15 Correct 25 ms 33612 KB Output is correct
16 Correct 493 ms 156856 KB Output is correct
17 Correct 51 ms 83212 KB Output is correct
18 Correct 53 ms 83288 KB Output is correct
19 Correct 25 ms 33204 KB Output is correct
20 Correct 1048 ms 201288 KB Output is correct
21 Correct 1147 ms 201204 KB Output is correct
22 Correct 1117 ms 201276 KB Output is correct
23 Correct 945 ms 208388 KB Output is correct
24 Correct 306 ms 54416 KB Output is correct
25 Correct 721 ms 77720 KB Output is correct
26 Correct 646 ms 77700 KB Output is correct
27 Correct 1056 ms 230476 KB Output is correct
28 Correct 1049 ms 230380 KB Output is correct
29 Correct 1197 ms 230340 KB Output is correct
30 Correct 1167 ms 230352 KB Output is correct
31 Correct 54 ms 83248 KB Output is correct
32 Correct 107 ms 92500 KB Output is correct
33 Correct 139 ms 43752 KB Output is correct
34 Correct 1111 ms 201316 KB Output is correct
35 Correct 38 ms 35404 KB Output is correct
36 Correct 129 ms 44344 KB Output is correct
37 Correct 266 ms 55460 KB Output is correct
38 Correct 526 ms 132800 KB Output is correct
39 Correct 740 ms 151024 KB Output is correct
40 Correct 881 ms 169400 KB Output is correct
41 Correct 1231 ms 188416 KB Output is correct
42 Correct 1424 ms 207040 KB Output is correct
43 Correct 51 ms 83268 KB Output is correct
44 Correct 52 ms 83264 KB Output is correct
45 Correct 52 ms 83224 KB Output is correct
46 Correct 22 ms 33156 KB Output is correct
47 Correct 24 ms 33100 KB Output is correct
48 Correct 51 ms 83284 KB Output is correct
49 Correct 49 ms 83292 KB Output is correct
50 Correct 48 ms 83316 KB Output is correct
51 Correct 55 ms 83396 KB Output is correct
52 Correct 22 ms 33136 KB Output is correct
53 Correct 46 ms 83304 KB Output is correct
54 Correct 28 ms 33612 KB Output is correct
55 Correct 26 ms 33776 KB Output is correct
56 Correct 523 ms 147788 KB Output is correct
57 Correct 852 ms 176824 KB Output is correct
58 Correct 794 ms 176764 KB Output is correct
59 Correct 25 ms 33100 KB Output is correct
60 Correct 47 ms 83260 KB Output is correct
61 Correct 23 ms 33180 KB Output is correct
62 Correct 1155 ms 230628 KB Output is correct
63 Correct 1172 ms 230428 KB Output is correct
64 Correct 1090 ms 229836 KB Output is correct
65 Correct 30 ms 33996 KB Output is correct
66 Correct 34 ms 34924 KB Output is correct
67 Correct 537 ms 147152 KB Output is correct
68 Correct 924 ms 179356 KB Output is correct
69 Correct 1288 ms 210936 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 33100 KB Output is correct
2 Correct 49 ms 83272 KB Output is correct
3 Correct 23 ms 33100 KB Output is correct
4 Correct 52 ms 83300 KB Output is correct
5 Correct 52 ms 83264 KB Output is correct
6 Correct 24 ms 33128 KB Output is correct
7 Correct 24 ms 33208 KB Output is correct
8 Correct 27 ms 33092 KB Output is correct
9 Correct 526 ms 156856 KB Output is correct
10 Correct 78 ms 90820 KB Output is correct
11 Correct 263 ms 123248 KB Output is correct
12 Correct 97 ms 94660 KB Output is correct
13 Correct 86 ms 43056 KB Output is correct
14 Correct 23 ms 33376 KB Output is correct
15 Correct 25 ms 33612 KB Output is correct
16 Correct 493 ms 156856 KB Output is correct
17 Correct 1074 ms 230520 KB Output is correct
18 Correct 1088 ms 230808 KB Output is correct
19 Correct 1117 ms 207980 KB Output is correct
20 Correct 1067 ms 210092 KB Output is correct
21 Correct 930 ms 206648 KB Output is correct
22 Correct 47 ms 83276 KB Output is correct
23 Correct 185 ms 103744 KB Output is correct
24 Correct 59 ms 37700 KB Output is correct
25 Correct 206 ms 49040 KB Output is correct
26 Correct 444 ms 60396 KB Output is correct
27 Correct 639 ms 146980 KB Output is correct
28 Correct 879 ms 162992 KB Output is correct
29 Correct 1160 ms 178960 KB Output is correct
30 Correct 1098 ms 194252 KB Output is correct
31 Correct 1464 ms 210728 KB Output is correct
32 Correct 1136 ms 219700 KB Output is correct
33 Correct 1051 ms 230584 KB Output is correct
34 Correct 30 ms 34252 KB Output is correct
35 Correct 36 ms 35176 KB Output is correct
36 Correct 509 ms 148668 KB Output is correct
37 Correct 883 ms 182000 KB Output is correct
38 Correct 1274 ms 214224 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 33100 KB Output is correct
2 Correct 49 ms 83272 KB Output is correct
3 Correct 23 ms 33100 KB Output is correct
4 Correct 52 ms 83300 KB Output is correct
5 Correct 52 ms 83264 KB Output is correct
6 Correct 24 ms 33128 KB Output is correct
7 Correct 24 ms 33208 KB Output is correct
8 Correct 27 ms 33092 KB Output is correct
9 Correct 526 ms 156856 KB Output is correct
10 Correct 78 ms 90820 KB Output is correct
11 Correct 263 ms 123248 KB Output is correct
12 Correct 97 ms 94660 KB Output is correct
13 Correct 86 ms 43056 KB Output is correct
14 Correct 23 ms 33376 KB Output is correct
15 Correct 25 ms 33612 KB Output is correct
16 Correct 493 ms 156856 KB Output is correct
17 Correct 47 ms 83264 KB Output is correct
18 Correct 51 ms 83308 KB Output is correct
19 Correct 53 ms 83268 KB Output is correct
20 Correct 53 ms 83300 KB Output is correct
21 Correct 25 ms 33100 KB Output is correct
22 Correct 52 ms 83220 KB Output is correct
23 Correct 1186 ms 216760 KB Output is correct
24 Correct 51 ms 83276 KB Output is correct
25 Correct 55 ms 84004 KB Output is correct
26 Correct 25 ms 33856 KB Output is correct
27 Correct 28 ms 34068 KB Output is correct
28 Correct 400 ms 137020 KB Output is correct
29 Correct 615 ms 163384 KB Output is correct
30 Correct 846 ms 190480 KB Output is correct
31 Correct 1158 ms 216756 KB Output is correct
32 Correct 53 ms 83204 KB Output is correct
33 Correct 52 ms 83296 KB Output is correct
34 Correct 53 ms 83304 KB Output is correct
35 Correct 22 ms 33156 KB Output is correct
36 Correct 23 ms 33100 KB Output is correct
37 Correct 47 ms 83256 KB Output is correct
38 Correct 51 ms 83296 KB Output is correct
39 Correct 51 ms 83256 KB Output is correct
40 Correct 53 ms 83268 KB Output is correct
41 Correct 24 ms 33228 KB Output is correct
42 Correct 52 ms 83268 KB Output is correct
43 Correct 27 ms 33548 KB Output is correct
44 Correct 26 ms 33868 KB Output is correct
45 Correct 525 ms 147716 KB Output is correct
46 Correct 754 ms 176776 KB Output is correct
47 Correct 794 ms 176812 KB Output is correct
48 Correct 50 ms 83308 KB Output is correct
49 Correct 54 ms 83280 KB Output is correct
50 Correct 49 ms 83232 KB Output is correct
51 Correct 49 ms 83276 KB Output is correct
52 Correct 48 ms 83220 KB Output is correct
53 Correct 49 ms 83200 KB Output is correct
54 Correct 53 ms 83440 KB Output is correct
55 Correct 1260 ms 212232 KB Output is correct
56 Correct 54 ms 83268 KB Output is correct
57 Correct 53 ms 84420 KB Output is correct
58 Correct 74 ms 87244 KB Output is correct
59 Correct 41 ms 35408 KB Output is correct
60 Correct 493 ms 147756 KB Output is correct
61 Correct 674 ms 170592 KB Output is correct
62 Correct 893 ms 189932 KB Output is correct
63 Correct 1064 ms 212536 KB Output is correct
64 Correct 24 ms 33100 KB Output is correct
65 Correct 52 ms 83348 KB Output is correct
66 Correct 24 ms 33208 KB Output is correct
67 Correct 1078 ms 230536 KB Output is correct
68 Correct 1149 ms 230580 KB Output is correct
69 Correct 1094 ms 229848 KB Output is correct
70 Correct 28 ms 34060 KB Output is correct
71 Correct 35 ms 34892 KB Output is correct
72 Correct 532 ms 147148 KB Output is correct
73 Correct 956 ms 179320 KB Output is correct
74 Correct 1354 ms 210976 KB Output is correct
75 Correct 1176 ms 219732 KB Output is correct
76 Correct 1257 ms 230440 KB Output is correct
77 Correct 34 ms 34252 KB Output is correct
78 Correct 40 ms 35096 KB Output is correct
79 Correct 671 ms 148664 KB Output is correct
80 Correct 973 ms 181880 KB Output is correct
81 Correct 1368 ms 214212 KB Output is correct
82 Correct 51 ms 83212 KB Output is correct
83 Correct 53 ms 83288 KB Output is correct
84 Correct 25 ms 33204 KB Output is correct
85 Correct 1048 ms 201288 KB Output is correct
86 Correct 1147 ms 201204 KB Output is correct
87 Correct 1117 ms 201276 KB Output is correct
88 Correct 945 ms 208388 KB Output is correct
89 Correct 306 ms 54416 KB Output is correct
90 Correct 721 ms 77720 KB Output is correct
91 Correct 646 ms 77700 KB Output is correct
92 Correct 1056 ms 230476 KB Output is correct
93 Correct 1049 ms 230380 KB Output is correct
94 Correct 1197 ms 230340 KB Output is correct
95 Correct 1167 ms 230352 KB Output is correct
96 Correct 54 ms 83248 KB Output is correct
97 Correct 107 ms 92500 KB Output is correct
98 Correct 139 ms 43752 KB Output is correct
99 Correct 1111 ms 201316 KB Output is correct
100 Correct 38 ms 35404 KB Output is correct
101 Correct 129 ms 44344 KB Output is correct
102 Correct 266 ms 55460 KB Output is correct
103 Correct 526 ms 132800 KB Output is correct
104 Correct 740 ms 151024 KB Output is correct
105 Correct 881 ms 169400 KB Output is correct
106 Correct 1231 ms 188416 KB Output is correct
107 Correct 1424 ms 207040 KB Output is correct
108 Correct 51 ms 83268 KB Output is correct
109 Correct 52 ms 83264 KB Output is correct
110 Correct 52 ms 83224 KB Output is correct
111 Correct 22 ms 33156 KB Output is correct
112 Correct 24 ms 33100 KB Output is correct
113 Correct 51 ms 83284 KB Output is correct
114 Correct 49 ms 83292 KB Output is correct
115 Correct 48 ms 83316 KB Output is correct
116 Correct 55 ms 83396 KB Output is correct
117 Correct 22 ms 33136 KB Output is correct
118 Correct 46 ms 83304 KB Output is correct
119 Correct 28 ms 33612 KB Output is correct
120 Correct 26 ms 33776 KB Output is correct
121 Correct 523 ms 147788 KB Output is correct
122 Correct 852 ms 176824 KB Output is correct
123 Correct 794 ms 176764 KB Output is correct
124 Correct 25 ms 33100 KB Output is correct
125 Correct 47 ms 83260 KB Output is correct
126 Correct 23 ms 33180 KB Output is correct
127 Correct 1155 ms 230628 KB Output is correct
128 Correct 1172 ms 230428 KB Output is correct
129 Correct 1090 ms 229836 KB Output is correct
130 Correct 30 ms 33996 KB Output is correct
131 Correct 34 ms 34924 KB Output is correct
132 Correct 537 ms 147152 KB Output is correct
133 Correct 924 ms 179356 KB Output is correct
134 Correct 1288 ms 210936 KB Output is correct
135 Correct 1074 ms 230520 KB Output is correct
136 Correct 1088 ms 230808 KB Output is correct
137 Correct 1117 ms 207980 KB Output is correct
138 Correct 1067 ms 210092 KB Output is correct
139 Correct 930 ms 206648 KB Output is correct
140 Correct 47 ms 83276 KB Output is correct
141 Correct 185 ms 103744 KB Output is correct
142 Correct 59 ms 37700 KB Output is correct
143 Correct 206 ms 49040 KB Output is correct
144 Correct 444 ms 60396 KB Output is correct
145 Correct 639 ms 146980 KB Output is correct
146 Correct 879 ms 162992 KB Output is correct
147 Correct 1160 ms 178960 KB Output is correct
148 Correct 1098 ms 194252 KB Output is correct
149 Correct 1464 ms 210728 KB Output is correct
150 Correct 1136 ms 219700 KB Output is correct
151 Correct 1051 ms 230584 KB Output is correct
152 Correct 30 ms 34252 KB Output is correct
153 Correct 36 ms 35176 KB Output is correct
154 Correct 509 ms 148668 KB Output is correct
155 Correct 883 ms 182000 KB Output is correct
156 Correct 1274 ms 214224 KB Output is correct
157 Correct 48 ms 83292 KB Output is correct
158 Correct 22 ms 33100 KB Output is correct
159 Correct 48 ms 83260 KB Output is correct
160 Correct 50 ms 83316 KB Output is correct
161 Correct 1123 ms 203276 KB Output is correct
162 Correct 1100 ms 201272 KB Output is correct
163 Correct 1079 ms 202324 KB Output is correct
164 Correct 1058 ms 202172 KB Output is correct
165 Correct 1054 ms 203336 KB Output is correct
166 Correct 1081 ms 202892 KB Output is correct
167 Execution timed out 3620 ms 655420 KB Time limit exceeded
168 Halted 0 ms 0 KB -