답안 #439968

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
439968	2021-07-01T10:16:48 Z	cheeheng	분수 공원 (IOI21_parks)	C++17	70 / 100	1336 ms	230644 KB

parks

#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 = 0; k < 4; k ++){
            int nx = x[i2] + 2*dx[k];
            int ny = y[i2] + 2*dy[k];

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	20 ms	33100 KB	Output is correct
2	Correct	44 ms	83260 KB	Output is correct
3	Correct	21 ms	33100 KB	Output is correct
4	Correct	42 ms	83204 KB	Output is correct
5	Correct	42 ms	83272 KB	Output is correct
6	Correct	24 ms	33204 KB	Output is correct
7	Correct	22 ms	33160 KB	Output is correct
8	Correct	19 ms	33184 KB	Output is correct
9	Correct	514 ms	156864 KB	Output is correct
10	Correct	90 ms	90848 KB	Output is correct
11	Correct	289 ms	123168 KB	Output is correct
12	Correct	91 ms	94620 KB	Output is correct
13	Correct	82 ms	43004 KB	Output is correct
14	Correct	23 ms	33356 KB	Output is correct
15	Correct	23 ms	33604 KB	Output is correct
16	Correct	566 ms	156920 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	20 ms	33100 KB	Output is correct
2	Correct	44 ms	83260 KB	Output is correct
3	Correct	21 ms	33100 KB	Output is correct
4	Correct	42 ms	83204 KB	Output is correct
5	Correct	42 ms	83272 KB	Output is correct
6	Correct	24 ms	33204 KB	Output is correct
7	Correct	22 ms	33160 KB	Output is correct
8	Correct	19 ms	33184 KB	Output is correct
9	Correct	514 ms	156864 KB	Output is correct
10	Correct	90 ms	90848 KB	Output is correct
11	Correct	289 ms	123168 KB	Output is correct
12	Correct	91 ms	94620 KB	Output is correct
13	Correct	82 ms	43004 KB	Output is correct
14	Correct	23 ms	33356 KB	Output is correct
15	Correct	23 ms	33604 KB	Output is correct
16	Correct	566 ms	156920 KB	Output is correct
17	Correct	43 ms	83268 KB	Output is correct
18	Correct	51 ms	83268 KB	Output is correct
19	Correct	46 ms	83284 KB	Output is correct
20	Correct	47 ms	83224 KB	Output is correct
21	Correct	25 ms	33144 KB	Output is correct
22	Correct	49 ms	83292 KB	Output is correct
23	Correct	1068 ms	201536 KB	Output is correct
24	Correct	43 ms	83208 KB	Output is correct
25	Correct	50 ms	84000 KB	Output is correct
26	Correct	26 ms	33840 KB	Output is correct
27	Correct	31 ms	34032 KB	Output is correct
28	Correct	408 ms	130656 KB	Output is correct
29	Correct	640 ms	154300 KB	Output is correct
30	Correct	870 ms	177912 KB	Output is correct
31	Correct	1121 ms	201692 KB	Output is correct
32	Correct	50 ms	83372 KB	Output is correct
33	Correct	46 ms	83276 KB	Output is correct
34	Correct	47 ms	83320 KB	Output is correct
35	Correct	21 ms	33148 KB	Output is correct
36	Correct	23 ms	33092 KB	Output is correct
37	Correct	52 ms	83264 KB	Output is correct
38	Correct	46 ms	83288 KB	Output is correct
39	Correct	47 ms	83212 KB	Output is correct
40	Correct	46 ms	83316 KB	Output is correct
41	Correct	21 ms	33100 KB	Output is correct
42	Correct	47 ms	83252 KB	Output is correct
43	Correct	35 ms	33528 KB	Output is correct
44	Correct	33 ms	33740 KB	Output is correct
45	Correct	540 ms	147404 KB	Output is correct
46	Correct	906 ms	176496 KB	Output is correct
47	Correct	797 ms	176540 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	20 ms	33100 KB	Output is correct
2	Correct	44 ms	83260 KB	Output is correct
3	Correct	21 ms	33100 KB	Output is correct
4	Correct	42 ms	83204 KB	Output is correct
5	Correct	42 ms	83272 KB	Output is correct
6	Correct	24 ms	33204 KB	Output is correct
7	Correct	22 ms	33160 KB	Output is correct
8	Correct	19 ms	33184 KB	Output is correct
9	Correct	514 ms	156864 KB	Output is correct
10	Correct	90 ms	90848 KB	Output is correct
11	Correct	289 ms	123168 KB	Output is correct
12	Correct	91 ms	94620 KB	Output is correct
13	Correct	82 ms	43004 KB	Output is correct
14	Correct	23 ms	33356 KB	Output is correct
15	Correct	23 ms	33604 KB	Output is correct
16	Correct	566 ms	156920 KB	Output is correct
17	Correct	43 ms	83268 KB	Output is correct
18	Correct	51 ms	83268 KB	Output is correct
19	Correct	46 ms	83284 KB	Output is correct
20	Correct	47 ms	83224 KB	Output is correct
21	Correct	25 ms	33144 KB	Output is correct
22	Correct	49 ms	83292 KB	Output is correct
23	Correct	1068 ms	201536 KB	Output is correct
24	Correct	43 ms	83208 KB	Output is correct
25	Correct	50 ms	84000 KB	Output is correct
26	Correct	26 ms	33840 KB	Output is correct
27	Correct	31 ms	34032 KB	Output is correct
28	Correct	408 ms	130656 KB	Output is correct
29	Correct	640 ms	154300 KB	Output is correct
30	Correct	870 ms	177912 KB	Output is correct
31	Correct	1121 ms	201692 KB	Output is correct
32	Correct	50 ms	83372 KB	Output is correct
33	Correct	46 ms	83276 KB	Output is correct
34	Correct	47 ms	83320 KB	Output is correct
35	Correct	21 ms	33148 KB	Output is correct
36	Correct	23 ms	33092 KB	Output is correct
37	Correct	52 ms	83264 KB	Output is correct
38	Correct	46 ms	83288 KB	Output is correct
39	Correct	47 ms	83212 KB	Output is correct
40	Correct	46 ms	83316 KB	Output is correct
41	Correct	21 ms	33100 KB	Output is correct
42	Correct	47 ms	83252 KB	Output is correct
43	Correct	35 ms	33528 KB	Output is correct
44	Correct	33 ms	33740 KB	Output is correct
45	Correct	540 ms	147404 KB	Output is correct
46	Correct	906 ms	176496 KB	Output is correct
47	Correct	797 ms	176540 KB	Output is correct
48	Correct	47 ms	83260 KB	Output is correct
49	Correct	48 ms	83236 KB	Output is correct
50	Correct	44 ms	83308 KB	Output is correct
51	Correct	44 ms	83268 KB	Output is correct
52	Correct	45 ms	83196 KB	Output is correct
53	Correct	46 ms	83272 KB	Output is correct
54	Correct	47 ms	83212 KB	Output is correct
55	Correct	1259 ms	202020 KB	Output is correct
56	Correct	47 ms	83304 KB	Output is correct
57	Correct	47 ms	84452 KB	Output is correct
58	Correct	67 ms	86948 KB	Output is correct
59	Correct	35 ms	35588 KB	Output is correct
60	Correct	588 ms	145592 KB	Output is correct
61	Correct	804 ms	164116 KB	Output is correct
62	Correct	1018 ms	181268 KB	Output is correct
63	Correct	1140 ms	202148 KB	Output is correct
64	Correct	19 ms	33100 KB	Output is correct
65	Correct	51 ms	83268 KB	Output is correct
66	Correct	19 ms	33100 KB	Output is correct
67	Correct	1134 ms	230476 KB	Output is correct
68	Correct	1221 ms	230416 KB	Output is correct
69	Correct	1229 ms	229808 KB	Output is correct
70	Correct	25 ms	33988 KB	Output is correct
71	Correct	37 ms	34888 KB	Output is correct
72	Correct	664 ms	146708 KB	Output is correct
73	Correct	937 ms	178512 KB	Output is correct
74	Correct	1204 ms	210024 KB	Output is correct
75	Correct	1242 ms	212840 KB	Output is correct
76	Correct	1247 ms	230644 KB	Output is correct
77	Correct	32 ms	34252 KB	Output is correct
78	Correct	37 ms	35128 KB	Output is correct
79	Correct	535 ms	146712 KB	Output is correct
80	Correct	792 ms	178720 KB	Output is correct
81	Correct	1168 ms	210116 KB	Output is correct

Subtask #4
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	20 ms	33100 KB	Output is correct
2	Correct	44 ms	83260 KB	Output is correct
3	Correct	21 ms	33100 KB	Output is correct
4	Correct	42 ms	83204 KB	Output is correct
5	Correct	42 ms	83272 KB	Output is correct
6	Correct	24 ms	33204 KB	Output is correct
7	Correct	22 ms	33160 KB	Output is correct
8	Correct	19 ms	33184 KB	Output is correct
9	Correct	514 ms	156864 KB	Output is correct
10	Correct	90 ms	90848 KB	Output is correct
11	Correct	289 ms	123168 KB	Output is correct
12	Correct	91 ms	94620 KB	Output is correct
13	Correct	82 ms	43004 KB	Output is correct
14	Correct	23 ms	33356 KB	Output is correct
15	Correct	23 ms	33604 KB	Output is correct
16	Correct	566 ms	156920 KB	Output is correct
17	Correct	47 ms	83300 KB	Output is correct
18	Correct	51 ms	83316 KB	Output is correct
19	Correct	22 ms	33132 KB	Output is correct
20	Correct	1099 ms	199960 KB	Output is correct
21	Correct	1124 ms	200104 KB	Output is correct
22	Correct	1067 ms	200044 KB	Output is correct
23	Correct	944 ms	208556 KB	Output is correct
24	Correct	293 ms	54308 KB	Output is correct
25	Correct	715 ms	77888 KB	Output is correct
26	Correct	658 ms	77756 KB	Output is correct
27	Correct	1034 ms	230384 KB	Output is correct
28	Correct	1034 ms	230324 KB	Output is correct
29	Correct	1126 ms	230436 KB	Output is correct
30	Correct	1181 ms	230384 KB	Output is correct
31	Correct	44 ms	83340 KB	Output is correct
32	Correct	91 ms	92512 KB	Output is correct
33	Correct	124 ms	43700 KB	Output is correct
34	Correct	1108 ms	199944 KB	Output is correct
35	Correct	45 ms	35308 KB	Output is correct
36	Correct	115 ms	44324 KB	Output is correct
37	Correct	249 ms	55500 KB	Output is correct
38	Correct	441 ms	132696 KB	Output is correct
39	Correct	641 ms	151236 KB	Output is correct
40	Correct	832 ms	169656 KB	Output is correct
41	Correct	1070 ms	187620 KB	Output is correct
42	Correct	1246 ms	206784 KB	Output is correct
43	Correct	44 ms	83312 KB	Output is correct
44	Correct	50 ms	83264 KB	Output is correct
45	Correct	49 ms	83316 KB	Output is correct
46	Correct	25 ms	33092 KB	Output is correct
47	Correct	24 ms	33100 KB	Output is correct
48	Correct	47 ms	83260 KB	Output is correct
49	Correct	45 ms	83276 KB	Output is correct
50	Correct	49 ms	83268 KB	Output is correct
51	Correct	45 ms	83244 KB	Output is correct
52	Correct	22 ms	33156 KB	Output is correct
53	Correct	49 ms	83276 KB	Output is correct
54	Correct	26 ms	33584 KB	Output is correct
55	Correct	26 ms	33872 KB	Output is correct
56	Correct	479 ms	147504 KB	Output is correct
57	Correct	781 ms	176660 KB	Output is correct
58	Correct	806 ms	176520 KB	Output is correct
59	Correct	22 ms	33100 KB	Output is correct
60	Correct	45 ms	83320 KB	Output is correct
61	Correct	22 ms	33104 KB	Output is correct
62	Correct	1153 ms	230540 KB	Output is correct
63	Correct	1198 ms	230428 KB	Output is correct
64	Correct	1070 ms	229812 KB	Output is correct
65	Correct	29 ms	33996 KB	Output is correct
66	Correct	35 ms	34956 KB	Output is correct
67	Correct	500 ms	146600 KB	Output is correct
68	Correct	812 ms	178584 KB	Output is correct
69	Correct	1214 ms	210104 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	20 ms	33100 KB	Output is correct
2	Correct	44 ms	83260 KB	Output is correct
3	Correct	21 ms	33100 KB	Output is correct
4	Correct	42 ms	83204 KB	Output is correct
5	Correct	42 ms	83272 KB	Output is correct
6	Correct	24 ms	33204 KB	Output is correct
7	Correct	22 ms	33160 KB	Output is correct
8	Correct	19 ms	33184 KB	Output is correct
9	Correct	514 ms	156864 KB	Output is correct
10	Correct	90 ms	90848 KB	Output is correct
11	Correct	289 ms	123168 KB	Output is correct
12	Correct	91 ms	94620 KB	Output is correct
13	Correct	82 ms	43004 KB	Output is correct
14	Correct	23 ms	33356 KB	Output is correct
15	Correct	23 ms	33604 KB	Output is correct
16	Correct	566 ms	156920 KB	Output is correct
17	Correct	1184 ms	230492 KB	Output is correct
18	Correct	1152 ms	230560 KB	Output is correct
19	Correct	1000 ms	200108 KB	Output is correct
20	Correct	1057 ms	209004 KB	Output is correct
21	Correct	885 ms	206724 KB	Output is correct
22	Correct	47 ms	83296 KB	Output is correct
23	Correct	162 ms	103788 KB	Output is correct
24	Correct	59 ms	37688 KB	Output is correct
25	Correct	199 ms	49152 KB	Output is correct
26	Correct	340 ms	60416 KB	Output is correct
27	Correct	556 ms	146560 KB	Output is correct
28	Correct	678 ms	162532 KB	Output is correct
29	Correct	804 ms	178052 KB	Output is correct
30	Correct	1033 ms	194028 KB	Output is correct
31	Correct	1245 ms	209672 KB	Output is correct
32	Correct	1336 ms	212792 KB	Output is correct
33	Correct	1090 ms	230628 KB	Output is correct
34	Correct	29 ms	34244 KB	Output is correct
35	Correct	36 ms	35188 KB	Output is correct
36	Correct	478 ms	146620 KB	Output is correct
37	Correct	844 ms	178636 KB	Output is correct
38	Correct	1068 ms	210228 KB	Output is correct

Subtask #6
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	20 ms	33100 KB	Output is correct
2	Correct	44 ms	83260 KB	Output is correct
3	Correct	21 ms	33100 KB	Output is correct
4	Correct	42 ms	83204 KB	Output is correct
5	Correct	42 ms	83272 KB	Output is correct
6	Correct	24 ms	33204 KB	Output is correct
7	Correct	22 ms	33160 KB	Output is correct
8	Correct	19 ms	33184 KB	Output is correct
9	Correct	514 ms	156864 KB	Output is correct
10	Correct	90 ms	90848 KB	Output is correct
11	Correct	289 ms	123168 KB	Output is correct
12	Correct	91 ms	94620 KB	Output is correct
13	Correct	82 ms	43004 KB	Output is correct
14	Correct	23 ms	33356 KB	Output is correct
15	Correct	23 ms	33604 KB	Output is correct
16	Correct	566 ms	156920 KB	Output is correct
17	Correct	43 ms	83268 KB	Output is correct
18	Correct	51 ms	83268 KB	Output is correct
19	Correct	46 ms	83284 KB	Output is correct
20	Correct	47 ms	83224 KB	Output is correct
21	Correct	25 ms	33144 KB	Output is correct
22	Correct	49 ms	83292 KB	Output is correct
23	Correct	1068 ms	201536 KB	Output is correct
24	Correct	43 ms	83208 KB	Output is correct
25	Correct	50 ms	84000 KB	Output is correct
26	Correct	26 ms	33840 KB	Output is correct
27	Correct	31 ms	34032 KB	Output is correct
28	Correct	408 ms	130656 KB	Output is correct
29	Correct	640 ms	154300 KB	Output is correct
30	Correct	870 ms	177912 KB	Output is correct
31	Correct	1121 ms	201692 KB	Output is correct
32	Correct	50 ms	83372 KB	Output is correct
33	Correct	46 ms	83276 KB	Output is correct
34	Correct	47 ms	83320 KB	Output is correct
35	Correct	21 ms	33148 KB	Output is correct
36	Correct	23 ms	33092 KB	Output is correct
37	Correct	52 ms	83264 KB	Output is correct
38	Correct	46 ms	83288 KB	Output is correct
39	Correct	47 ms	83212 KB	Output is correct
40	Correct	46 ms	83316 KB	Output is correct
41	Correct	21 ms	33100 KB	Output is correct
42	Correct	47 ms	83252 KB	Output is correct
43	Correct	35 ms	33528 KB	Output is correct
44	Correct	33 ms	33740 KB	Output is correct
45	Correct	540 ms	147404 KB	Output is correct
46	Correct	906 ms	176496 KB	Output is correct
47	Correct	797 ms	176540 KB	Output is correct
48	Correct	47 ms	83260 KB	Output is correct
49	Correct	48 ms	83236 KB	Output is correct
50	Correct	44 ms	83308 KB	Output is correct
51	Correct	44 ms	83268 KB	Output is correct
52	Correct	45 ms	83196 KB	Output is correct
53	Correct	46 ms	83272 KB	Output is correct
54	Correct	47 ms	83212 KB	Output is correct
55	Correct	1259 ms	202020 KB	Output is correct
56	Correct	47 ms	83304 KB	Output is correct
57	Correct	47 ms	84452 KB	Output is correct
58	Correct	67 ms	86948 KB	Output is correct
59	Correct	35 ms	35588 KB	Output is correct
60	Correct	588 ms	145592 KB	Output is correct
61	Correct	804 ms	164116 KB	Output is correct
62	Correct	1018 ms	181268 KB	Output is correct
63	Correct	1140 ms	202148 KB	Output is correct
64	Correct	19 ms	33100 KB	Output is correct
65	Correct	51 ms	83268 KB	Output is correct
66	Correct	19 ms	33100 KB	Output is correct
67	Correct	1134 ms	230476 KB	Output is correct
68	Correct	1221 ms	230416 KB	Output is correct
69	Correct	1229 ms	229808 KB	Output is correct
70	Correct	25 ms	33988 KB	Output is correct
71	Correct	37 ms	34888 KB	Output is correct
72	Correct	664 ms	146708 KB	Output is correct
73	Correct	937 ms	178512 KB	Output is correct
74	Correct	1204 ms	210024 KB	Output is correct
75	Correct	1242 ms	212840 KB	Output is correct
76	Correct	1247 ms	230644 KB	Output is correct
77	Correct	32 ms	34252 KB	Output is correct
78	Correct	37 ms	35128 KB	Output is correct
79	Correct	535 ms	146712 KB	Output is correct
80	Correct	792 ms	178720 KB	Output is correct
81	Correct	1168 ms	210116 KB	Output is correct
82	Correct	47 ms	83300 KB	Output is correct
83	Correct	51 ms	83316 KB	Output is correct
84	Correct	22 ms	33132 KB	Output is correct
85	Correct	1099 ms	199960 KB	Output is correct
86	Correct	1124 ms	200104 KB	Output is correct
87	Correct	1067 ms	200044 KB	Output is correct
88	Correct	944 ms	208556 KB	Output is correct
89	Correct	293 ms	54308 KB	Output is correct
90	Correct	715 ms	77888 KB	Output is correct
91	Correct	658 ms	77756 KB	Output is correct
92	Correct	1034 ms	230384 KB	Output is correct
93	Correct	1034 ms	230324 KB	Output is correct
94	Correct	1126 ms	230436 KB	Output is correct
95	Correct	1181 ms	230384 KB	Output is correct
96	Correct	44 ms	83340 KB	Output is correct
97	Correct	91 ms	92512 KB	Output is correct
98	Correct	124 ms	43700 KB	Output is correct
99	Correct	1108 ms	199944 KB	Output is correct
100	Correct	45 ms	35308 KB	Output is correct
101	Correct	115 ms	44324 KB	Output is correct
102	Correct	249 ms	55500 KB	Output is correct
103	Correct	441 ms	132696 KB	Output is correct
104	Correct	641 ms	151236 KB	Output is correct
105	Correct	832 ms	169656 KB	Output is correct
106	Correct	1070 ms	187620 KB	Output is correct
107	Correct	1246 ms	206784 KB	Output is correct
108	Correct	44 ms	83312 KB	Output is correct
109	Correct	50 ms	83264 KB	Output is correct
110	Correct	49 ms	83316 KB	Output is correct
111	Correct	25 ms	33092 KB	Output is correct
112	Correct	24 ms	33100 KB	Output is correct
113	Correct	47 ms	83260 KB	Output is correct
114	Correct	45 ms	83276 KB	Output is correct
115	Correct	49 ms	83268 KB	Output is correct
116	Correct	45 ms	83244 KB	Output is correct
117	Correct	22 ms	33156 KB	Output is correct
118	Correct	49 ms	83276 KB	Output is correct
119	Correct	26 ms	33584 KB	Output is correct
120	Correct	26 ms	33872 KB	Output is correct
121	Correct	479 ms	147504 KB	Output is correct
122	Correct	781 ms	176660 KB	Output is correct
123	Correct	806 ms	176520 KB	Output is correct
124	Correct	22 ms	33100 KB	Output is correct
125	Correct	45 ms	83320 KB	Output is correct
126	Correct	22 ms	33104 KB	Output is correct
127	Correct	1153 ms	230540 KB	Output is correct
128	Correct	1198 ms	230428 KB	Output is correct
129	Correct	1070 ms	229812 KB	Output is correct
130	Correct	29 ms	33996 KB	Output is correct
131	Correct	35 ms	34956 KB	Output is correct
132	Correct	500 ms	146600 KB	Output is correct
133	Correct	812 ms	178584 KB	Output is correct
134	Correct	1214 ms	210104 KB	Output is correct
135	Correct	1184 ms	230492 KB	Output is correct
136	Correct	1152 ms	230560 KB	Output is correct
137	Correct	1000 ms	200108 KB	Output is correct
138	Correct	1057 ms	209004 KB	Output is correct
139	Correct	885 ms	206724 KB	Output is correct
140	Correct	47 ms	83296 KB	Output is correct
141	Correct	162 ms	103788 KB	Output is correct
142	Correct	59 ms	37688 KB	Output is correct
143	Correct	199 ms	49152 KB	Output is correct
144	Correct	340 ms	60416 KB	Output is correct
145	Correct	556 ms	146560 KB	Output is correct
146	Correct	678 ms	162532 KB	Output is correct
147	Correct	804 ms	178052 KB	Output is correct
148	Correct	1033 ms	194028 KB	Output is correct
149	Correct	1245 ms	209672 KB	Output is correct
150	Correct	1336 ms	212792 KB	Output is correct
151	Correct	1090 ms	230628 KB	Output is correct
152	Correct	29 ms	34244 KB	Output is correct
153	Correct	36 ms	35188 KB	Output is correct
154	Correct	478 ms	146620 KB	Output is correct
155	Correct	844 ms	178636 KB	Output is correct
156	Correct	1068 ms	210228 KB	Output is correct
157	Correct	48 ms	83268 KB	Output is correct
158	Correct	23 ms	33068 KB	Output is correct
159	Correct	50 ms	83280 KB	Output is correct
160	Correct	48 ms	83276 KB	Output is correct
161	Correct	1039 ms	203276 KB	Output is correct
162	Correct	1185 ms	200020 KB	Output is correct
163	Correct	1058 ms	201088 KB	Output is correct
164	Correct	1065 ms	201016 KB	Output is correct
165	Correct	1162 ms	203264 KB	Output is correct
166	Correct	1286 ms	202916 KB	Output is correct
167	Runtime error	683 ms	223172 KB	Execution killed with signal 6
168	Halted	0 ms	0 KB	-

답안 #439968

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 15.0 / 15.0

Subtask #4 20.0 / 20.0

Subtask #5 20.0 / 20.0

Subtask #6 0 / 30.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
15.0 / 15.0

Subtask #4
20.0 / 20.0

Subtask #5
20.0 / 20.0

Subtask #6
0 / 30.0