oj.uz

Submission #439976

# Submission time Handle Problem Language Result Execution time Memory
439976 2021-07-01T10:23:33 Z cheeheng Fountain Parks (IOI21_parks) C++17
70 / 100
 3500 ms 672456 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: {1, 2}){
            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 22 ms 33100 KB Output is correct
2 Correct 46 ms 83300 KB Output is correct
3 Correct 20 ms 33136 KB Output is correct
4 Correct 48 ms 83256 KB Output is correct
5 Correct 44 ms 83300 KB Output is correct
6 Correct 20 ms 33100 KB Output is correct
7 Correct 21 ms 33100 KB Output is correct
8 Correct 20 ms 33200 KB Output is correct
9 Correct 498 ms 156936 KB Output is correct
10 Correct 78 ms 90832 KB Output is correct
11 Correct 244 ms 123176 KB Output is correct
12 Correct 92 ms 94660 KB Output is correct
13 Correct 85 ms 43032 KB Output is correct
14 Correct 22 ms 33356 KB Output is correct
15 Correct 25 ms 33612 KB Output is correct
16 Correct 488 ms 156856 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 33100 KB Output is correct
2 Correct 46 ms 83300 KB Output is correct
3 Correct 20 ms 33136 KB Output is correct
4 Correct 48 ms 83256 KB Output is correct
5 Correct 44 ms 83300 KB Output is correct
6 Correct 20 ms 33100 KB Output is correct
7 Correct 21 ms 33100 KB Output is correct
8 Correct 20 ms 33200 KB Output is correct
9 Correct 498 ms 156936 KB Output is correct
10 Correct 78 ms 90832 KB Output is correct
11 Correct 244 ms 123176 KB Output is correct
12 Correct 92 ms 94660 KB Output is correct
13 Correct 85 ms 43032 KB Output is correct
14 Correct 22 ms 33356 KB Output is correct
15 Correct 25 ms 33612 KB Output is correct
16 Correct 488 ms 156856 KB Output is correct
17 Correct 48 ms 83212 KB Output is correct
18 Correct 42 ms 83244 KB Output is correct
19 Correct 49 ms 83276 KB Output is correct
20 Correct 48 ms 83216 KB Output is correct
21 Correct 24 ms 33228 KB Output is correct
22 Correct 44 ms 83280 KB Output is correct
23 Correct 1190 ms 216940 KB Output is correct
24 Correct 45 ms 83268 KB Output is correct
25 Correct 46 ms 84032 KB Output is correct
26 Correct 24 ms 33896 KB Output is correct
27 Correct 30 ms 34072 KB Output is correct
28 Correct 398 ms 136936 KB Output is correct
29 Correct 627 ms 163384 KB Output is correct
30 Correct 871 ms 190740 KB Output is correct
31 Correct 1163 ms 216940 KB Output is correct
32 Correct 44 ms 83268 KB Output is correct
33 Correct 46 ms 83256 KB Output is correct
34 Correct 47 ms 83276 KB Output is correct
35 Correct 22 ms 33176 KB Output is correct
36 Correct 19 ms 33072 KB Output is correct
37 Correct 44 ms 83268 KB Output is correct
38 Correct 47 ms 83316 KB Output is correct
39 Correct 47 ms 83276 KB Output is correct
40 Correct 49 ms 83268 KB Output is correct
41 Correct 22 ms 33144 KB Output is correct
42 Correct 46 ms 83260 KB Output is correct
43 Correct 25 ms 33588 KB Output is correct
44 Correct 26 ms 33832 KB Output is correct
45 Correct 489 ms 147680 KB Output is correct
46 Correct 806 ms 176820 KB Output is correct
47 Correct 757 ms 176696 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 33100 KB Output is correct
2 Correct 46 ms 83300 KB Output is correct
3 Correct 20 ms 33136 KB Output is correct
4 Correct 48 ms 83256 KB Output is correct
5 Correct 44 ms 83300 KB Output is correct
6 Correct 20 ms 33100 KB Output is correct
7 Correct 21 ms 33100 KB Output is correct
8 Correct 20 ms 33200 KB Output is correct
9 Correct 498 ms 156936 KB Output is correct
10 Correct 78 ms 90832 KB Output is correct
11 Correct 244 ms 123176 KB Output is correct
12 Correct 92 ms 94660 KB Output is correct
13 Correct 85 ms 43032 KB Output is correct
14 Correct 22 ms 33356 KB Output is correct
15 Correct 25 ms 33612 KB Output is correct
16 Correct 488 ms 156856 KB Output is correct
17 Correct 48 ms 83212 KB Output is correct
18 Correct 42 ms 83244 KB Output is correct
19 Correct 49 ms 83276 KB Output is correct
20 Correct 48 ms 83216 KB Output is correct
21 Correct 24 ms 33228 KB Output is correct
22 Correct 44 ms 83280 KB Output is correct
23 Correct 1190 ms 216940 KB Output is correct
24 Correct 45 ms 83268 KB Output is correct
25 Correct 46 ms 84032 KB Output is correct
26 Correct 24 ms 33896 KB Output is correct
27 Correct 30 ms 34072 KB Output is correct
28 Correct 398 ms 136936 KB Output is correct
29 Correct 627 ms 163384 KB Output is correct
30 Correct 871 ms 190740 KB Output is correct
31 Correct 1163 ms 216940 KB Output is correct
32 Correct 44 ms 83268 KB Output is correct
33 Correct 46 ms 83256 KB Output is correct
34 Correct 47 ms 83276 KB Output is correct
35 Correct 22 ms 33176 KB Output is correct
36 Correct 19 ms 33072 KB Output is correct
37 Correct 44 ms 83268 KB Output is correct
38 Correct 47 ms 83316 KB Output is correct
39 Correct 47 ms 83276 KB Output is correct
40 Correct 49 ms 83268 KB Output is correct
41 Correct 22 ms 33144 KB Output is correct
42 Correct 46 ms 83260 KB Output is correct
43 Correct 25 ms 33588 KB Output is correct
44 Correct 26 ms 33832 KB Output is correct
45 Correct 489 ms 147680 KB Output is correct
46 Correct 806 ms 176820 KB Output is correct
47 Correct 757 ms 176696 KB Output is correct
48 Correct 43 ms 83292 KB Output is correct
49 Correct 45 ms 83296 KB Output is correct
50 Correct 54 ms 83320 KB Output is correct
51 Correct 46 ms 83344 KB Output is correct
52 Correct 46 ms 83224 KB Output is correct
53 Correct 49 ms 83256 KB Output is correct
54 Correct 47 ms 83268 KB Output is correct
55 Correct 1206 ms 212260 KB Output is correct
56 Correct 44 ms 83268 KB Output is correct
57 Correct 53 ms 84520 KB Output is correct
58 Correct 67 ms 87248 KB Output is correct
59 Correct 43 ms 35396 KB Output is correct
60 Correct 493 ms 147776 KB Output is correct
61 Correct 746 ms 170500 KB Output is correct
62 Correct 926 ms 190020 KB Output is correct
63 Correct 1106 ms 212296 KB Output is correct
64 Correct 20 ms 33100 KB Output is correct
65 Correct 44 ms 83312 KB Output is correct
66 Correct 20 ms 33100 KB Output is correct
67 Correct 1117 ms 230612 KB Output is correct
68 Correct 1142 ms 230648 KB Output is correct
69 Correct 1131 ms 229812 KB Output is correct
70 Correct 26 ms 34052 KB Output is correct
71 Correct 36 ms 34892 KB Output is correct
72 Correct 569 ms 147124 KB Output is correct
73 Correct 881 ms 179380 KB Output is correct
74 Correct 1227 ms 210836 KB Output is correct
75 Correct 1260 ms 219572 KB Output is correct
76 Correct 1117 ms 230592 KB Output is correct
77 Correct 28 ms 34252 KB Output is correct
78 Correct 34 ms 35148 KB Output is correct
79 Correct 552 ms 148752 KB Output is correct
80 Correct 914 ms 181980 KB Output is correct
81 Correct 1263 ms 214420 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 33100 KB Output is correct
2 Correct 46 ms 83300 KB Output is correct
3 Correct 20 ms 33136 KB Output is correct
4 Correct 48 ms 83256 KB Output is correct
5 Correct 44 ms 83300 KB Output is correct
6 Correct 20 ms 33100 KB Output is correct
7 Correct 21 ms 33100 KB Output is correct
8 Correct 20 ms 33200 KB Output is correct
9 Correct 498 ms 156936 KB Output is correct
10 Correct 78 ms 90832 KB Output is correct
11 Correct 244 ms 123176 KB Output is correct
12 Correct 92 ms 94660 KB Output is correct
13 Correct 85 ms 43032 KB Output is correct
14 Correct 22 ms 33356 KB Output is correct
15 Correct 25 ms 33612 KB Output is correct
16 Correct 488 ms 156856 KB Output is correct
17 Correct 47 ms 83260 KB Output is correct
18 Correct 47 ms 83272 KB Output is correct
19 Correct 22 ms 33132 KB Output is correct
20 Correct 1083 ms 201548 KB Output is correct
21 Correct 1105 ms 201244 KB Output is correct
22 Correct 1065 ms 201144 KB Output is correct
23 Correct 908 ms 208420 KB Output is correct
24 Correct 316 ms 54240 KB Output is correct
25 Correct 704 ms 77684 KB Output is correct
26 Correct 644 ms 77764 KB Output is correct
27 Correct 1067 ms 230424 KB Output is correct
28 Correct 1065 ms 230472 KB Output is correct
29 Correct 1266 ms 230416 KB Output is correct
30 Correct 1165 ms 230512 KB Output is correct
31 Correct 44 ms 83276 KB Output is correct
32 Correct 108 ms 92504 KB Output is correct
33 Correct 153 ms 43716 KB Output is correct
34 Correct 1187 ms 201144 KB Output is correct
35 Correct 37 ms 35360 KB Output is correct
36 Correct 127 ms 44280 KB Output is correct
37 Correct 301 ms 55492 KB Output is correct
38 Correct 517 ms 132836 KB Output is correct
39 Correct 766 ms 151016 KB Output is correct
40 Correct 981 ms 169464 KB Output is correct
41 Correct 1187 ms 188488 KB Output is correct
42 Correct 1469 ms 207036 KB Output is correct
43 Correct 43 ms 83276 KB Output is correct
44 Correct 44 ms 83404 KB Output is correct
45 Correct 43 ms 83276 KB Output is correct
46 Correct 20 ms 33196 KB Output is correct
47 Correct 20 ms 33100 KB Output is correct
48 Correct 46 ms 83228 KB Output is correct
49 Correct 43 ms 83208 KB Output is correct
50 Correct 46 ms 83204 KB Output is correct
51 Correct 47 ms 83336 KB Output is correct
52 Correct 21 ms 33100 KB Output is correct
53 Correct 44 ms 83196 KB Output is correct
54 Correct 24 ms 33612 KB Output is correct
55 Correct 24 ms 33796 KB Output is correct
56 Correct 498 ms 147688 KB Output is correct
57 Correct 784 ms 176772 KB Output is correct
58 Correct 797 ms 176696 KB Output is correct
59 Correct 20 ms 33100 KB Output is correct
60 Correct 46 ms 83244 KB Output is correct
61 Correct 21 ms 33132 KB Output is correct
62 Correct 1157 ms 230576 KB Output is correct
63 Correct 1067 ms 230452 KB Output is correct
64 Correct 1182 ms 229812 KB Output is correct
65 Correct 27 ms 33992 KB Output is correct
66 Correct 32 ms 34892 KB Output is correct
67 Correct 556 ms 147180 KB Output is correct
68 Correct 975 ms 179404 KB Output is correct
69 Correct 1362 ms 210868 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 33100 KB Output is correct
2 Correct 46 ms 83300 KB Output is correct
3 Correct 20 ms 33136 KB Output is correct
4 Correct 48 ms 83256 KB Output is correct
5 Correct 44 ms 83300 KB Output is correct
6 Correct 20 ms 33100 KB Output is correct
7 Correct 21 ms 33100 KB Output is correct
8 Correct 20 ms 33200 KB Output is correct
9 Correct 498 ms 156936 KB Output is correct
10 Correct 78 ms 90832 KB Output is correct
11 Correct 244 ms 123176 KB Output is correct
12 Correct 92 ms 94660 KB Output is correct
13 Correct 85 ms 43032 KB Output is correct
14 Correct 22 ms 33356 KB Output is correct
15 Correct 25 ms 33612 KB Output is correct
16 Correct 488 ms 156856 KB Output is correct
17 Correct 1153 ms 230544 KB Output is correct
18 Correct 1136 ms 230700 KB Output is correct
19 Correct 1050 ms 207948 KB Output is correct
20 Correct 1118 ms 210060 KB Output is correct
21 Correct 945 ms 206736 KB Output is correct
22 Correct 47 ms 83272 KB Output is correct
23 Correct 213 ms 103780 KB Output is correct
24 Correct 57 ms 37700 KB Output is correct
25 Correct 209 ms 48944 KB Output is correct
26 Correct 418 ms 60292 KB Output is correct
27 Correct 598 ms 147076 KB Output is correct
28 Correct 761 ms 163044 KB Output is correct
29 Correct 971 ms 178956 KB Output is correct
30 Correct 1189 ms 194052 KB Output is correct
31 Correct 1389 ms 210832 KB Output is correct
32 Correct 1130 ms 219576 KB Output is correct
33 Correct 1123 ms 230624 KB Output is correct
34 Correct 30 ms 34252 KB Output is correct
35 Correct 33 ms 35148 KB Output is correct
36 Correct 560 ms 148796 KB Output is correct
37 Correct 847 ms 181940 KB Output is correct
38 Correct 1237 ms 214476 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 33100 KB Output is correct
2 Correct 46 ms 83300 KB Output is correct
3 Correct 20 ms 33136 KB Output is correct
4 Correct 48 ms 83256 KB Output is correct
5 Correct 44 ms 83300 KB Output is correct
6 Correct 20 ms 33100 KB Output is correct
7 Correct 21 ms 33100 KB Output is correct
8 Correct 20 ms 33200 KB Output is correct
9 Correct 498 ms 156936 KB Output is correct
10 Correct 78 ms 90832 KB Output is correct
11 Correct 244 ms 123176 KB Output is correct
12 Correct 92 ms 94660 KB Output is correct
13 Correct 85 ms 43032 KB Output is correct
14 Correct 22 ms 33356 KB Output is correct
15 Correct 25 ms 33612 KB Output is correct
16 Correct 488 ms 156856 KB Output is correct
17 Correct 48 ms 83212 KB Output is correct
18 Correct 42 ms 83244 KB Output is correct
19 Correct 49 ms 83276 KB Output is correct
20 Correct 48 ms 83216 KB Output is correct
21 Correct 24 ms 33228 KB Output is correct
22 Correct 44 ms 83280 KB Output is correct
23 Correct 1190 ms 216940 KB Output is correct
24 Correct 45 ms 83268 KB Output is correct
25 Correct 46 ms 84032 KB Output is correct
26 Correct 24 ms 33896 KB Output is correct
27 Correct 30 ms 34072 KB Output is correct
28 Correct 398 ms 136936 KB Output is correct
29 Correct 627 ms 163384 KB Output is correct
30 Correct 871 ms 190740 KB Output is correct
31 Correct 1163 ms 216940 KB Output is correct
32 Correct 44 ms 83268 KB Output is correct
33 Correct 46 ms 83256 KB Output is correct
34 Correct 47 ms 83276 KB Output is correct
35 Correct 22 ms 33176 KB Output is correct
36 Correct 19 ms 33072 KB Output is correct
37 Correct 44 ms 83268 KB Output is correct
38 Correct 47 ms 83316 KB Output is correct
39 Correct 47 ms 83276 KB Output is correct
40 Correct 49 ms 83268 KB Output is correct
41 Correct 22 ms 33144 KB Output is correct
42 Correct 46 ms 83260 KB Output is correct
43 Correct 25 ms 33588 KB Output is correct
44 Correct 26 ms 33832 KB Output is correct
45 Correct 489 ms 147680 KB Output is correct
46 Correct 806 ms 176820 KB Output is correct
47 Correct 757 ms 176696 KB Output is correct
48 Correct 43 ms 83292 KB Output is correct
49 Correct 45 ms 83296 KB Output is correct
50 Correct 54 ms 83320 KB Output is correct
51 Correct 46 ms 83344 KB Output is correct
52 Correct 46 ms 83224 KB Output is correct
53 Correct 49 ms 83256 KB Output is correct
54 Correct 47 ms 83268 KB Output is correct
55 Correct 1206 ms 212260 KB Output is correct
56 Correct 44 ms 83268 KB Output is correct
57 Correct 53 ms 84520 KB Output is correct
58 Correct 67 ms 87248 KB Output is correct
59 Correct 43 ms 35396 KB Output is correct
60 Correct 493 ms 147776 KB Output is correct
61 Correct 746 ms 170500 KB Output is correct
62 Correct 926 ms 190020 KB Output is correct
63 Correct 1106 ms 212296 KB Output is correct
64 Correct 20 ms 33100 KB Output is correct
65 Correct 44 ms 83312 KB Output is correct
66 Correct 20 ms 33100 KB Output is correct
67 Correct 1117 ms 230612 KB Output is correct
68 Correct 1142 ms 230648 KB Output is correct
69 Correct 1131 ms 229812 KB Output is correct
70 Correct 26 ms 34052 KB Output is correct
71 Correct 36 ms 34892 KB Output is correct
72 Correct 569 ms 147124 KB Output is correct
73 Correct 881 ms 179380 KB Output is correct
74 Correct 1227 ms 210836 KB Output is correct
75 Correct 1260 ms 219572 KB Output is correct
76 Correct 1117 ms 230592 KB Output is correct
77 Correct 28 ms 34252 KB Output is correct
78 Correct 34 ms 35148 KB Output is correct
79 Correct 552 ms 148752 KB Output is correct
80 Correct 914 ms 181980 KB Output is correct
81 Correct 1263 ms 214420 KB Output is correct
82 Correct 47 ms 83260 KB Output is correct
83 Correct 47 ms 83272 KB Output is correct
84 Correct 22 ms 33132 KB Output is correct
85 Correct 1083 ms 201548 KB Output is correct
86 Correct 1105 ms 201244 KB Output is correct
87 Correct 1065 ms 201144 KB Output is correct
88 Correct 908 ms 208420 KB Output is correct
89 Correct 316 ms 54240 KB Output is correct
90 Correct 704 ms 77684 KB Output is correct
91 Correct 644 ms 77764 KB Output is correct
92 Correct 1067 ms 230424 KB Output is correct
93 Correct 1065 ms 230472 KB Output is correct
94 Correct 1266 ms 230416 KB Output is correct
95 Correct 1165 ms 230512 KB Output is correct
96 Correct 44 ms 83276 KB Output is correct
97 Correct 108 ms 92504 KB Output is correct
98 Correct 153 ms 43716 KB Output is correct
99 Correct 1187 ms 201144 KB Output is correct
100 Correct 37 ms 35360 KB Output is correct
101 Correct 127 ms 44280 KB Output is correct
102 Correct 301 ms 55492 KB Output is correct
103 Correct 517 ms 132836 KB Output is correct
104 Correct 766 ms 151016 KB Output is correct
105 Correct 981 ms 169464 KB Output is correct
106 Correct 1187 ms 188488 KB Output is correct
107 Correct 1469 ms 207036 KB Output is correct
108 Correct 43 ms 83276 KB Output is correct
109 Correct 44 ms 83404 KB Output is correct
110 Correct 43 ms 83276 KB Output is correct
111 Correct 20 ms 33196 KB Output is correct
112 Correct 20 ms 33100 KB Output is correct
113 Correct 46 ms 83228 KB Output is correct
114 Correct 43 ms 83208 KB Output is correct
115 Correct 46 ms 83204 KB Output is correct
116 Correct 47 ms 83336 KB Output is correct
117 Correct 21 ms 33100 KB Output is correct
118 Correct 44 ms 83196 KB Output is correct
119 Correct 24 ms 33612 KB Output is correct
120 Correct 24 ms 33796 KB Output is correct
121 Correct 498 ms 147688 KB Output is correct
122 Correct 784 ms 176772 KB Output is correct
123 Correct 797 ms 176696 KB Output is correct
124 Correct 20 ms 33100 KB Output is correct
125 Correct 46 ms 83244 KB Output is correct
126 Correct 21 ms 33132 KB Output is correct
127 Correct 1157 ms 230576 KB Output is correct
128 Correct 1067 ms 230452 KB Output is correct
129 Correct 1182 ms 229812 KB Output is correct
130 Correct 27 ms 33992 KB Output is correct
131 Correct 32 ms 34892 KB Output is correct
132 Correct 556 ms 147180 KB Output is correct
133 Correct 975 ms 179404 KB Output is correct
134 Correct 1362 ms 210868 KB Output is correct
135 Correct 1153 ms 230544 KB Output is correct
136 Correct 1136 ms 230700 KB Output is correct
137 Correct 1050 ms 207948 KB Output is correct
138 Correct 1118 ms 210060 KB Output is correct
139 Correct 945 ms 206736 KB Output is correct
140 Correct 47 ms 83272 KB Output is correct
141 Correct 213 ms 103780 KB Output is correct
142 Correct 57 ms 37700 KB Output is correct
143 Correct 209 ms 48944 KB Output is correct
144 Correct 418 ms 60292 KB Output is correct
145 Correct 598 ms 147076 KB Output is correct
146 Correct 761 ms 163044 KB Output is correct
147 Correct 971 ms 178956 KB Output is correct
148 Correct 1189 ms 194052 KB Output is correct
149 Correct 1389 ms 210832 KB Output is correct
150 Correct 1130 ms 219576 KB Output is correct
151 Correct 1123 ms 230624 KB Output is correct
152 Correct 30 ms 34252 KB Output is correct
153 Correct 33 ms 35148 KB Output is correct
154 Correct 560 ms 148796 KB Output is correct
155 Correct 847 ms 181940 KB Output is correct
156 Correct 1237 ms 214476 KB Output is correct
157 Correct 45 ms 83220 KB Output is correct
158 Correct 24 ms 33196 KB Output is correct
159 Correct 44 ms 83248 KB Output is correct
160 Correct 44 ms 83252 KB Output is correct
161 Correct 1113 ms 203352 KB Output is correct
162 Correct 1137 ms 201248 KB Output is correct
163 Correct 1022 ms 202040 KB Output is correct
164 Correct 1006 ms 202040 KB Output is correct
165 Correct 1127 ms 203384 KB Output is correct
166 Correct 1150 ms 203164 KB Output is correct
167 Execution timed out 3597 ms 672456 KB Time limit exceeded
168 Halted 0 ms 0 KB -