oj.uz

Submission #439987

# Submission time Handle Problem Language Result Execution time Memory
439987 2021-07-01T10:45:22 Z cheeheng Fountain Parks (IOI21_parks) C++17
70 / 100
 3500 ms 671400 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> indx2;
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;
    }

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

    int cnt3 = 0;
    for(pair<ii, int> temp: indx2){
        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 21 ms 33196 KB Output is correct
2 Correct 45 ms 83244 KB Output is correct
3 Correct 21 ms 33180 KB Output is correct
4 Correct 51 ms 83276 KB Output is correct
5 Correct 51 ms 83276 KB Output is correct
6 Correct 26 ms 33100 KB Output is correct
7 Correct 26 ms 33100 KB Output is correct
8 Correct 26 ms 33196 KB Output is correct
9 Correct 544 ms 163124 KB Output is correct
10 Correct 82 ms 91516 KB Output is correct
11 Correct 260 ms 126528 KB Output is correct
12 Correct 96 ms 95556 KB Output is correct
13 Correct 98 ms 45792 KB Output is correct
14 Correct 23 ms 33456 KB Output is correct
15 Correct 23 ms 33740 KB Output is correct
16 Correct 550 ms 163108 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 33196 KB Output is correct
2 Correct 45 ms 83244 KB Output is correct
3 Correct 21 ms 33180 KB Output is correct
4 Correct 51 ms 83276 KB Output is correct
5 Correct 51 ms 83276 KB Output is correct
6 Correct 26 ms 33100 KB Output is correct
7 Correct 26 ms 33100 KB Output is correct
8 Correct 26 ms 33196 KB Output is correct
9 Correct 544 ms 163124 KB Output is correct
10 Correct 82 ms 91516 KB Output is correct
11 Correct 260 ms 126528 KB Output is correct
12 Correct 96 ms 95556 KB Output is correct
13 Correct 98 ms 45792 KB Output is correct
14 Correct 23 ms 33456 KB Output is correct
15 Correct 23 ms 33740 KB Output is correct
16 Correct 550 ms 163108 KB Output is correct
17 Correct 46 ms 83268 KB Output is correct
18 Correct 45 ms 83320 KB Output is correct
19 Correct 49 ms 83252 KB Output is correct
20 Correct 51 ms 83296 KB Output is correct
21 Correct 21 ms 33100 KB Output is correct
22 Correct 48 ms 83324 KB Output is correct
23 Correct 1336 ms 229568 KB Output is correct
24 Correct 45 ms 83200 KB Output is correct
25 Correct 52 ms 84136 KB Output is correct
26 Correct 26 ms 34084 KB Output is correct
27 Correct 28 ms 34336 KB Output is correct
28 Correct 492 ms 141848 KB Output is correct
29 Correct 793 ms 171040 KB Output is correct
30 Correct 1063 ms 200456 KB Output is correct
31 Correct 1310 ms 229364 KB Output is correct
32 Correct 49 ms 83256 KB Output is correct
33 Correct 45 ms 83300 KB Output is correct
34 Correct 49 ms 83268 KB Output is correct
35 Correct 21 ms 33140 KB Output is correct
36 Correct 23 ms 33100 KB Output is correct
37 Correct 45 ms 83320 KB Output is correct
38 Correct 45 ms 83292 KB Output is correct
39 Correct 56 ms 83260 KB Output is correct
40 Correct 45 ms 83268 KB Output is correct
41 Correct 21 ms 33100 KB Output is correct
42 Correct 49 ms 83260 KB Output is correct
43 Correct 24 ms 33744 KB Output is correct
44 Correct 26 ms 34020 KB Output is correct
45 Correct 670 ms 153956 KB Output is correct
46 Correct 887 ms 185760 KB Output is correct
47 Correct 982 ms 185880 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 33196 KB Output is correct
2 Correct 45 ms 83244 KB Output is correct
3 Correct 21 ms 33180 KB Output is correct
4 Correct 51 ms 83276 KB Output is correct
5 Correct 51 ms 83276 KB Output is correct
6 Correct 26 ms 33100 KB Output is correct
7 Correct 26 ms 33100 KB Output is correct
8 Correct 26 ms 33196 KB Output is correct
9 Correct 544 ms 163124 KB Output is correct
10 Correct 82 ms 91516 KB Output is correct
11 Correct 260 ms 126528 KB Output is correct
12 Correct 96 ms 95556 KB Output is correct
13 Correct 98 ms 45792 KB Output is correct
14 Correct 23 ms 33456 KB Output is correct
15 Correct 23 ms 33740 KB Output is correct
16 Correct 550 ms 163108 KB Output is correct
17 Correct 46 ms 83268 KB Output is correct
18 Correct 45 ms 83320 KB Output is correct
19 Correct 49 ms 83252 KB Output is correct
20 Correct 51 ms 83296 KB Output is correct
21 Correct 21 ms 33100 KB Output is correct
22 Correct 48 ms 83324 KB Output is correct
23 Correct 1336 ms 229568 KB Output is correct
24 Correct 45 ms 83200 KB Output is correct
25 Correct 52 ms 84136 KB Output is correct
26 Correct 26 ms 34084 KB Output is correct
27 Correct 28 ms 34336 KB Output is correct
28 Correct 492 ms 141848 KB Output is correct
29 Correct 793 ms 171040 KB Output is correct
30 Correct 1063 ms 200456 KB Output is correct
31 Correct 1310 ms 229364 KB Output is correct
32 Correct 49 ms 83256 KB Output is correct
33 Correct 45 ms 83300 KB Output is correct
34 Correct 49 ms 83268 KB Output is correct
35 Correct 21 ms 33140 KB Output is correct
36 Correct 23 ms 33100 KB Output is correct
37 Correct 45 ms 83320 KB Output is correct
38 Correct 45 ms 83292 KB Output is correct
39 Correct 56 ms 83260 KB Output is correct
40 Correct 45 ms 83268 KB Output is correct
41 Correct 21 ms 33100 KB Output is correct
42 Correct 49 ms 83260 KB Output is correct
43 Correct 24 ms 33744 KB Output is correct
44 Correct 26 ms 34020 KB Output is correct
45 Correct 670 ms 153956 KB Output is correct
46 Correct 887 ms 185760 KB Output is correct
47 Correct 982 ms 185880 KB Output is correct
48 Correct 48 ms 83208 KB Output is correct
49 Correct 53 ms 83240 KB Output is correct
50 Correct 57 ms 83268 KB Output is correct
51 Correct 46 ms 83332 KB Output is correct
52 Correct 48 ms 83264 KB Output is correct
53 Correct 48 ms 83308 KB Output is correct
54 Correct 51 ms 83284 KB Output is correct
55 Correct 1381 ms 224912 KB Output is correct
56 Correct 49 ms 83276 KB Output is correct
57 Correct 52 ms 84488 KB Output is correct
58 Correct 67 ms 87660 KB Output is correct
59 Correct 44 ms 36084 KB Output is correct
60 Correct 552 ms 153980 KB Output is correct
61 Correct 835 ms 178972 KB Output is correct
62 Correct 1106 ms 200312 KB Output is correct
63 Correct 1413 ms 224888 KB Output is correct
64 Correct 22 ms 33100 KB Output is correct
65 Correct 49 ms 83272 KB Output is correct
66 Correct 23 ms 33120 KB Output is correct
67 Correct 1283 ms 243056 KB Output is correct
68 Correct 1355 ms 243144 KB Output is correct
69 Correct 1511 ms 242244 KB Output is correct
70 Correct 32 ms 34248 KB Output is correct
71 Correct 36 ms 35404 KB Output is correct
72 Correct 626 ms 153236 KB Output is correct
73 Correct 983 ms 188684 KB Output is correct
74 Correct 1432 ms 223432 KB Output is correct
75 Correct 1392 ms 232068 KB Output is correct
76 Correct 1421 ms 242988 KB Output is correct
77 Correct 31 ms 34588 KB Output is correct
78 Correct 39 ms 35736 KB Output is correct
79 Correct 679 ms 155072 KB Output is correct
80 Correct 1157 ms 191472 KB Output is correct
81 Correct 1472 ms 226820 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 33196 KB Output is correct
2 Correct 45 ms 83244 KB Output is correct
3 Correct 21 ms 33180 KB Output is correct
4 Correct 51 ms 83276 KB Output is correct
5 Correct 51 ms 83276 KB Output is correct
6 Correct 26 ms 33100 KB Output is correct
7 Correct 26 ms 33100 KB Output is correct
8 Correct 26 ms 33196 KB Output is correct
9 Correct 544 ms 163124 KB Output is correct
10 Correct 82 ms 91516 KB Output is correct
11 Correct 260 ms 126528 KB Output is correct
12 Correct 96 ms 95556 KB Output is correct
13 Correct 98 ms 45792 KB Output is correct
14 Correct 23 ms 33456 KB Output is correct
15 Correct 23 ms 33740 KB Output is correct
16 Correct 550 ms 163108 KB Output is correct
17 Correct 48 ms 83316 KB Output is correct
18 Correct 50 ms 83232 KB Output is correct
19 Correct 21 ms 33100 KB Output is correct
20 Correct 1413 ms 213712 KB Output is correct
21 Correct 1310 ms 213684 KB Output is correct
22 Correct 1294 ms 213828 KB Output is correct
23 Correct 1059 ms 219220 KB Output is correct
24 Correct 558 ms 66828 KB Output is correct
25 Correct 1002 ms 90192 KB Output is correct
26 Correct 1022 ms 90236 KB Output is correct
27 Correct 1501 ms 242988 KB Output is correct
28 Correct 1549 ms 242928 KB Output is correct
29 Correct 1519 ms 243000 KB Output is correct
30 Correct 1491 ms 242896 KB Output is correct
31 Correct 50 ms 83276 KB Output is correct
32 Correct 120 ms 93336 KB Output is correct
33 Correct 212 ms 49920 KB Output is correct
34 Correct 1298 ms 213648 KB Output is correct
35 Correct 43 ms 36036 KB Output is correct
36 Correct 161 ms 47416 KB Output is correct
37 Correct 393 ms 61732 KB Output is correct
38 Correct 697 ms 137756 KB Output is correct
39 Correct 978 ms 158120 KB Output is correct
40 Correct 1219 ms 178184 KB Output is correct
41 Correct 1746 ms 199100 KB Output is correct
42 Correct 1798 ms 219516 KB Output is correct
43 Correct 47 ms 83224 KB Output is correct
44 Correct 49 ms 83328 KB Output is correct
45 Correct 50 ms 83300 KB Output is correct
46 Correct 22 ms 33100 KB Output is correct
47 Correct 23 ms 33196 KB Output is correct
48 Correct 45 ms 83268 KB Output is correct
49 Correct 49 ms 83256 KB Output is correct
50 Correct 46 ms 83208 KB Output is correct
51 Correct 49 ms 83320 KB Output is correct
52 Correct 22 ms 33176 KB Output is correct
53 Correct 50 ms 83300 KB Output is correct
54 Correct 25 ms 33700 KB Output is correct
55 Correct 26 ms 33996 KB Output is correct
56 Correct 615 ms 153956 KB Output is correct
57 Correct 864 ms 185844 KB Output is correct
58 Correct 862 ms 185876 KB Output is correct
59 Correct 22 ms 33100 KB Output is correct
60 Correct 49 ms 83312 KB Output is correct
61 Correct 23 ms 33168 KB Output is correct
62 Correct 1332 ms 243048 KB Output is correct
63 Correct 1309 ms 243204 KB Output is correct
64 Correct 1385 ms 242224 KB Output is correct
65 Correct 30 ms 34252 KB Output is correct
66 Correct 37 ms 35364 KB Output is correct
67 Correct 567 ms 153356 KB Output is correct
68 Correct 968 ms 188848 KB Output is correct
69 Correct 1283 ms 223400 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 33196 KB Output is correct
2 Correct 45 ms 83244 KB Output is correct
3 Correct 21 ms 33180 KB Output is correct
4 Correct 51 ms 83276 KB Output is correct
5 Correct 51 ms 83276 KB Output is correct
6 Correct 26 ms 33100 KB Output is correct
7 Correct 26 ms 33100 KB Output is correct
8 Correct 26 ms 33196 KB Output is correct
9 Correct 544 ms 163124 KB Output is correct
10 Correct 82 ms 91516 KB Output is correct
11 Correct 260 ms 126528 KB Output is correct
12 Correct 96 ms 95556 KB Output is correct
13 Correct 98 ms 45792 KB Output is correct
14 Correct 23 ms 33456 KB Output is correct
15 Correct 23 ms 33740 KB Output is correct
16 Correct 550 ms 163108 KB Output is correct
17 Correct 1441 ms 243080 KB Output is correct
18 Correct 1329 ms 243228 KB Output is correct
19 Correct 1551 ms 216944 KB Output is correct
20 Correct 1365 ms 222292 KB Output is correct
21 Correct 1256 ms 217876 KB Output is correct
22 Correct 48 ms 83244 KB Output is correct
23 Correct 223 ms 105648 KB Output is correct
24 Correct 69 ms 38852 KB Output is correct
25 Correct 235 ms 53368 KB Output is correct
26 Correct 456 ms 67780 KB Output is correct
27 Correct 822 ms 153368 KB Output is correct
28 Correct 975 ms 170928 KB Output is correct
29 Correct 1219 ms 188228 KB Output is correct
30 Correct 1549 ms 205696 KB Output is correct
31 Correct 1809 ms 223288 KB Output is correct
32 Correct 1418 ms 232160 KB Output is correct
33 Correct 1254 ms 243076 KB Output is correct
34 Correct 29 ms 34636 KB Output is correct
35 Correct 39 ms 35672 KB Output is correct
36 Correct 595 ms 155068 KB Output is correct
37 Correct 980 ms 191284 KB Output is correct
38 Correct 1357 ms 227104 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 33196 KB Output is correct
2 Correct 45 ms 83244 KB Output is correct
3 Correct 21 ms 33180 KB Output is correct
4 Correct 51 ms 83276 KB Output is correct
5 Correct 51 ms 83276 KB Output is correct
6 Correct 26 ms 33100 KB Output is correct
7 Correct 26 ms 33100 KB Output is correct
8 Correct 26 ms 33196 KB Output is correct
9 Correct 544 ms 163124 KB Output is correct
10 Correct 82 ms 91516 KB Output is correct
11 Correct 260 ms 126528 KB Output is correct
12 Correct 96 ms 95556 KB Output is correct
13 Correct 98 ms 45792 KB Output is correct
14 Correct 23 ms 33456 KB Output is correct
15 Correct 23 ms 33740 KB Output is correct
16 Correct 550 ms 163108 KB Output is correct
17 Correct 46 ms 83268 KB Output is correct
18 Correct 45 ms 83320 KB Output is correct
19 Correct 49 ms 83252 KB Output is correct
20 Correct 51 ms 83296 KB Output is correct
21 Correct 21 ms 33100 KB Output is correct
22 Correct 48 ms 83324 KB Output is correct
23 Correct 1336 ms 229568 KB Output is correct
24 Correct 45 ms 83200 KB Output is correct
25 Correct 52 ms 84136 KB Output is correct
26 Correct 26 ms 34084 KB Output is correct
27 Correct 28 ms 34336 KB Output is correct
28 Correct 492 ms 141848 KB Output is correct
29 Correct 793 ms 171040 KB Output is correct
30 Correct 1063 ms 200456 KB Output is correct
31 Correct 1310 ms 229364 KB Output is correct
32 Correct 49 ms 83256 KB Output is correct
33 Correct 45 ms 83300 KB Output is correct
34 Correct 49 ms 83268 KB Output is correct
35 Correct 21 ms 33140 KB Output is correct
36 Correct 23 ms 33100 KB Output is correct
37 Correct 45 ms 83320 KB Output is correct
38 Correct 45 ms 83292 KB Output is correct
39 Correct 56 ms 83260 KB Output is correct
40 Correct 45 ms 83268 KB Output is correct
41 Correct 21 ms 33100 KB Output is correct
42 Correct 49 ms 83260 KB Output is correct
43 Correct 24 ms 33744 KB Output is correct
44 Correct 26 ms 34020 KB Output is correct
45 Correct 670 ms 153956 KB Output is correct
46 Correct 887 ms 185760 KB Output is correct
47 Correct 982 ms 185880 KB Output is correct
48 Correct 48 ms 83208 KB Output is correct
49 Correct 53 ms 83240 KB Output is correct
50 Correct 57 ms 83268 KB Output is correct
51 Correct 46 ms 83332 KB Output is correct
52 Correct 48 ms 83264 KB Output is correct
53 Correct 48 ms 83308 KB Output is correct
54 Correct 51 ms 83284 KB Output is correct
55 Correct 1381 ms 224912 KB Output is correct
56 Correct 49 ms 83276 KB Output is correct
57 Correct 52 ms 84488 KB Output is correct
58 Correct 67 ms 87660 KB Output is correct
59 Correct 44 ms 36084 KB Output is correct
60 Correct 552 ms 153980 KB Output is correct
61 Correct 835 ms 178972 KB Output is correct
62 Correct 1106 ms 200312 KB Output is correct
63 Correct 1413 ms 224888 KB Output is correct
64 Correct 22 ms 33100 KB Output is correct
65 Correct 49 ms 83272 KB Output is correct
66 Correct 23 ms 33120 KB Output is correct
67 Correct 1283 ms 243056 KB Output is correct
68 Correct 1355 ms 243144 KB Output is correct
69 Correct 1511 ms 242244 KB Output is correct
70 Correct 32 ms 34248 KB Output is correct
71 Correct 36 ms 35404 KB Output is correct
72 Correct 626 ms 153236 KB Output is correct
73 Correct 983 ms 188684 KB Output is correct
74 Correct 1432 ms 223432 KB Output is correct
75 Correct 1392 ms 232068 KB Output is correct
76 Correct 1421 ms 242988 KB Output is correct
77 Correct 31 ms 34588 KB Output is correct
78 Correct 39 ms 35736 KB Output is correct
79 Correct 679 ms 155072 KB Output is correct
80 Correct 1157 ms 191472 KB Output is correct
81 Correct 1472 ms 226820 KB Output is correct
82 Correct 48 ms 83316 KB Output is correct
83 Correct 50 ms 83232 KB Output is correct
84 Correct 21 ms 33100 KB Output is correct
85 Correct 1413 ms 213712 KB Output is correct
86 Correct 1310 ms 213684 KB Output is correct
87 Correct 1294 ms 213828 KB Output is correct
88 Correct 1059 ms 219220 KB Output is correct
89 Correct 558 ms 66828 KB Output is correct
90 Correct 1002 ms 90192 KB Output is correct
91 Correct 1022 ms 90236 KB Output is correct
92 Correct 1501 ms 242988 KB Output is correct
93 Correct 1549 ms 242928 KB Output is correct
94 Correct 1519 ms 243000 KB Output is correct
95 Correct 1491 ms 242896 KB Output is correct
96 Correct 50 ms 83276 KB Output is correct
97 Correct 120 ms 93336 KB Output is correct
98 Correct 212 ms 49920 KB Output is correct
99 Correct 1298 ms 213648 KB Output is correct
100 Correct 43 ms 36036 KB Output is correct
101 Correct 161 ms 47416 KB Output is correct
102 Correct 393 ms 61732 KB Output is correct
103 Correct 697 ms 137756 KB Output is correct
104 Correct 978 ms 158120 KB Output is correct
105 Correct 1219 ms 178184 KB Output is correct
106 Correct 1746 ms 199100 KB Output is correct
107 Correct 1798 ms 219516 KB Output is correct
108 Correct 47 ms 83224 KB Output is correct
109 Correct 49 ms 83328 KB Output is correct
110 Correct 50 ms 83300 KB Output is correct
111 Correct 22 ms 33100 KB Output is correct
112 Correct 23 ms 33196 KB Output is correct
113 Correct 45 ms 83268 KB Output is correct
114 Correct 49 ms 83256 KB Output is correct
115 Correct 46 ms 83208 KB Output is correct
116 Correct 49 ms 83320 KB Output is correct
117 Correct 22 ms 33176 KB Output is correct
118 Correct 50 ms 83300 KB Output is correct
119 Correct 25 ms 33700 KB Output is correct
120 Correct 26 ms 33996 KB Output is correct
121 Correct 615 ms 153956 KB Output is correct
122 Correct 864 ms 185844 KB Output is correct
123 Correct 862 ms 185876 KB Output is correct
124 Correct 22 ms 33100 KB Output is correct
125 Correct 49 ms 83312 KB Output is correct
126 Correct 23 ms 33168 KB Output is correct
127 Correct 1332 ms 243048 KB Output is correct
128 Correct 1309 ms 243204 KB Output is correct
129 Correct 1385 ms 242224 KB Output is correct
130 Correct 30 ms 34252 KB Output is correct
131 Correct 37 ms 35364 KB Output is correct
132 Correct 567 ms 153356 KB Output is correct
133 Correct 968 ms 188848 KB Output is correct
134 Correct 1283 ms 223400 KB Output is correct
135 Correct 1441 ms 243080 KB Output is correct
136 Correct 1329 ms 243228 KB Output is correct
137 Correct 1551 ms 216944 KB Output is correct
138 Correct 1365 ms 222292 KB Output is correct
139 Correct 1256 ms 217876 KB Output is correct
140 Correct 48 ms 83244 KB Output is correct
141 Correct 223 ms 105648 KB Output is correct
142 Correct 69 ms 38852 KB Output is correct
143 Correct 235 ms 53368 KB Output is correct
144 Correct 456 ms 67780 KB Output is correct
145 Correct 822 ms 153368 KB Output is correct
146 Correct 975 ms 170928 KB Output is correct
147 Correct 1219 ms 188228 KB Output is correct
148 Correct 1549 ms 205696 KB Output is correct
149 Correct 1809 ms 223288 KB Output is correct
150 Correct 1418 ms 232160 KB Output is correct
151 Correct 1254 ms 243076 KB Output is correct
152 Correct 29 ms 34636 KB Output is correct
153 Correct 39 ms 35672 KB Output is correct
154 Correct 595 ms 155068 KB Output is correct
155 Correct 980 ms 191284 KB Output is correct
156 Correct 1357 ms 227104 KB Output is correct
157 Correct 47 ms 83216 KB Output is correct
158 Correct 24 ms 33192 KB Output is correct
159 Correct 48 ms 83204 KB Output is correct
160 Correct 48 ms 83268 KB Output is correct
161 Correct 1407 ms 215888 KB Output is correct
162 Correct 1141 ms 213656 KB Output is correct
163 Correct 1253 ms 214740 KB Output is correct
164 Correct 1166 ms 214612 KB Output is correct
165 Correct 1307 ms 215880 KB Output is correct
166 Correct 1261 ms 215564 KB Output is correct
167 Execution timed out 3587 ms 671400 KB Time limit exceeded
168 Halted 0 ms 0 KB -