답안 #439971

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
439971	2021-07-01T10:18:47 Z	cheeheng	분수 공원 (IOI21_parks)	C++17	70 / 100	1443 ms	230592 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	83276 KB	Output is correct
3	Correct	20 ms	33112 KB	Output is correct
4	Correct	42 ms	83220 KB	Output is correct
5	Correct	42 ms	83248 KB	Output is correct
6	Correct	22 ms	33100 KB	Output is correct
7	Correct	21 ms	33100 KB	Output is correct
8	Correct	19 ms	33192 KB	Output is correct
9	Correct	521 ms	156868 KB	Output is correct
10	Correct	74 ms	90820 KB	Output is correct
11	Correct	242 ms	123160 KB	Output is correct
12	Correct	96 ms	94656 KB	Output is correct
13	Correct	88 ms	43076 KB	Output is correct
14	Correct	22 ms	33332 KB	Output is correct
15	Correct	23 ms	33612 KB	Output is correct
16	Correct	508 ms	156916 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	83276 KB	Output is correct
3	Correct	20 ms	33112 KB	Output is correct
4	Correct	42 ms	83220 KB	Output is correct
5	Correct	42 ms	83248 KB	Output is correct
6	Correct	22 ms	33100 KB	Output is correct
7	Correct	21 ms	33100 KB	Output is correct
8	Correct	19 ms	33192 KB	Output is correct
9	Correct	521 ms	156868 KB	Output is correct
10	Correct	74 ms	90820 KB	Output is correct
11	Correct	242 ms	123160 KB	Output is correct
12	Correct	96 ms	94656 KB	Output is correct
13	Correct	88 ms	43076 KB	Output is correct
14	Correct	22 ms	33332 KB	Output is correct
15	Correct	23 ms	33612 KB	Output is correct
16	Correct	508 ms	156916 KB	Output is correct
17	Correct	47 ms	83224 KB	Output is correct
18	Correct	44 ms	83272 KB	Output is correct
19	Correct	44 ms	83236 KB	Output is correct
20	Correct	45 ms	83268 KB	Output is correct
21	Correct	20 ms	33100 KB	Output is correct
22	Correct	45 ms	83212 KB	Output is correct
23	Correct	1074 ms	201544 KB	Output is correct
24	Correct	47 ms	83268 KB	Output is correct
25	Correct	48 ms	84028 KB	Output is correct
26	Correct	26 ms	33888 KB	Output is correct
27	Correct	30 ms	34124 KB	Output is correct
28	Correct	382 ms	131044 KB	Output is correct
29	Correct	612 ms	154288 KB	Output is correct
30	Correct	854 ms	177916 KB	Output is correct
31	Correct	1058 ms	201544 KB	Output is correct
32	Correct	44 ms	83268 KB	Output is correct
33	Correct	47 ms	83288 KB	Output is correct
34	Correct	45 ms	83276 KB	Output is correct
35	Correct	22 ms	33100 KB	Output is correct
36	Correct	24 ms	33120 KB	Output is correct
37	Correct	47 ms	83248 KB	Output is correct
38	Correct	48 ms	83268 KB	Output is correct
39	Correct	45 ms	83236 KB	Output is correct
40	Correct	48 ms	83208 KB	Output is correct
41	Correct	21 ms	33100 KB	Output is correct
42	Correct	45 ms	83232 KB	Output is correct
43	Correct	27 ms	33604 KB	Output is correct
44	Correct	26 ms	33868 KB	Output is correct
45	Correct	495 ms	147388 KB	Output is correct
46	Correct	779 ms	176584 KB	Output is correct
47	Correct	740 ms	176504 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	83276 KB	Output is correct
3	Correct	20 ms	33112 KB	Output is correct
4	Correct	42 ms	83220 KB	Output is correct
5	Correct	42 ms	83248 KB	Output is correct
6	Correct	22 ms	33100 KB	Output is correct
7	Correct	21 ms	33100 KB	Output is correct
8	Correct	19 ms	33192 KB	Output is correct
9	Correct	521 ms	156868 KB	Output is correct
10	Correct	74 ms	90820 KB	Output is correct
11	Correct	242 ms	123160 KB	Output is correct
12	Correct	96 ms	94656 KB	Output is correct
13	Correct	88 ms	43076 KB	Output is correct
14	Correct	22 ms	33332 KB	Output is correct
15	Correct	23 ms	33612 KB	Output is correct
16	Correct	508 ms	156916 KB	Output is correct
17	Correct	47 ms	83224 KB	Output is correct
18	Correct	44 ms	83272 KB	Output is correct
19	Correct	44 ms	83236 KB	Output is correct
20	Correct	45 ms	83268 KB	Output is correct
21	Correct	20 ms	33100 KB	Output is correct
22	Correct	45 ms	83212 KB	Output is correct
23	Correct	1074 ms	201544 KB	Output is correct
24	Correct	47 ms	83268 KB	Output is correct
25	Correct	48 ms	84028 KB	Output is correct
26	Correct	26 ms	33888 KB	Output is correct
27	Correct	30 ms	34124 KB	Output is correct
28	Correct	382 ms	131044 KB	Output is correct
29	Correct	612 ms	154288 KB	Output is correct
30	Correct	854 ms	177916 KB	Output is correct
31	Correct	1058 ms	201544 KB	Output is correct
32	Correct	44 ms	83268 KB	Output is correct
33	Correct	47 ms	83288 KB	Output is correct
34	Correct	45 ms	83276 KB	Output is correct
35	Correct	22 ms	33100 KB	Output is correct
36	Correct	24 ms	33120 KB	Output is correct
37	Correct	47 ms	83248 KB	Output is correct
38	Correct	48 ms	83268 KB	Output is correct
39	Correct	45 ms	83236 KB	Output is correct
40	Correct	48 ms	83208 KB	Output is correct
41	Correct	21 ms	33100 KB	Output is correct
42	Correct	45 ms	83232 KB	Output is correct
43	Correct	27 ms	33604 KB	Output is correct
44	Correct	26 ms	33868 KB	Output is correct
45	Correct	495 ms	147388 KB	Output is correct
46	Correct	779 ms	176584 KB	Output is correct
47	Correct	740 ms	176504 KB	Output is correct
48	Correct	47 ms	83268 KB	Output is correct
49	Correct	48 ms	83236 KB	Output is correct
50	Correct	47 ms	83220 KB	Output is correct
51	Correct	43 ms	83276 KB	Output is correct
52	Correct	48 ms	83332 KB	Output is correct
53	Correct	46 ms	83200 KB	Output is correct
54	Correct	45 ms	83280 KB	Output is correct
55	Correct	1080 ms	202172 KB	Output is correct
56	Correct	48 ms	83276 KB	Output is correct
57	Correct	52 ms	84340 KB	Output is correct
58	Correct	66 ms	86968 KB	Output is correct
59	Correct	38 ms	35396 KB	Output is correct
60	Correct	490 ms	145596 KB	Output is correct
61	Correct	690 ms	163924 KB	Output is correct
62	Correct	844 ms	181304 KB	Output is correct
63	Correct	1119 ms	202136 KB	Output is correct
64	Correct	21 ms	33100 KB	Output is correct
65	Correct	44 ms	83252 KB	Output is correct
66	Correct	23 ms	33164 KB	Output is correct
67	Correct	1118 ms	230488 KB	Output is correct
68	Correct	1120 ms	230580 KB	Output is correct
69	Correct	1083 ms	229812 KB	Output is correct
70	Correct	29 ms	33984 KB	Output is correct
71	Correct	34 ms	34892 KB	Output is correct
72	Correct	516 ms	146912 KB	Output is correct
73	Correct	785 ms	178484 KB	Output is correct
74	Correct	1123 ms	210284 KB	Output is correct
75	Correct	1179 ms	213164 KB	Output is correct
76	Correct	1196 ms	230480 KB	Output is correct
77	Correct	31 ms	34380 KB	Output is correct
78	Correct	38 ms	35196 KB	Output is correct
79	Correct	480 ms	146692 KB	Output is correct
80	Correct	769 ms	178672 KB	Output is correct
81	Correct	1125 ms	210416 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	83276 KB	Output is correct
3	Correct	20 ms	33112 KB	Output is correct
4	Correct	42 ms	83220 KB	Output is correct
5	Correct	42 ms	83248 KB	Output is correct
6	Correct	22 ms	33100 KB	Output is correct
7	Correct	21 ms	33100 KB	Output is correct
8	Correct	19 ms	33192 KB	Output is correct
9	Correct	521 ms	156868 KB	Output is correct
10	Correct	74 ms	90820 KB	Output is correct
11	Correct	242 ms	123160 KB	Output is correct
12	Correct	96 ms	94656 KB	Output is correct
13	Correct	88 ms	43076 KB	Output is correct
14	Correct	22 ms	33332 KB	Output is correct
15	Correct	23 ms	33612 KB	Output is correct
16	Correct	508 ms	156916 KB	Output is correct
17	Correct	46 ms	83304 KB	Output is correct
18	Correct	46 ms	83220 KB	Output is correct
19	Correct	23 ms	33100 KB	Output is correct
20	Correct	1014 ms	200020 KB	Output is correct
21	Correct	1089 ms	199976 KB	Output is correct
22	Correct	1026 ms	200032 KB	Output is correct
23	Correct	970 ms	208432 KB	Output is correct
24	Correct	283 ms	54408 KB	Output is correct
25	Correct	652 ms	77720 KB	Output is correct
26	Correct	622 ms	77736 KB	Output is correct
27	Correct	1056 ms	230396 KB	Output is correct
28	Correct	1099 ms	230296 KB	Output is correct
29	Correct	1208 ms	230376 KB	Output is correct
30	Correct	1112 ms	230368 KB	Output is correct
31	Correct	41 ms	83248 KB	Output is correct
32	Correct	90 ms	92448 KB	Output is correct
33	Correct	158 ms	43696 KB	Output is correct
34	Correct	1060 ms	200020 KB	Output is correct
35	Correct	38 ms	35320 KB	Output is correct
36	Correct	133 ms	44340 KB	Output is correct
37	Correct	322 ms	55448 KB	Output is correct
38	Correct	497 ms	132696 KB	Output is correct
39	Correct	655 ms	151168 KB	Output is correct
40	Correct	781 ms	169588 KB	Output is correct
41	Correct	1069 ms	187524 KB	Output is correct
42	Correct	1443 ms	206716 KB	Output is correct
43	Correct	50 ms	83216 KB	Output is correct
44	Correct	45 ms	83212 KB	Output is correct
45	Correct	41 ms	83316 KB	Output is correct
46	Correct	22 ms	33100 KB	Output is correct
47	Correct	30 ms	33128 KB	Output is correct
48	Correct	47 ms	83276 KB	Output is correct
49	Correct	48 ms	83312 KB	Output is correct
50	Correct	44 ms	83208 KB	Output is correct
51	Correct	42 ms	83268 KB	Output is correct
52	Correct	19 ms	33172 KB	Output is correct
53	Correct	43 ms	83284 KB	Output is correct
54	Correct	26 ms	33524 KB	Output is correct
55	Correct	28 ms	33832 KB	Output is correct
56	Correct	544 ms	147388 KB	Output is correct
57	Correct	800 ms	176608 KB	Output is correct
58	Correct	798 ms	176508 KB	Output is correct
59	Correct	22 ms	33228 KB	Output is correct
60	Correct	50 ms	83320 KB	Output is correct
61	Correct	19 ms	33132 KB	Output is correct
62	Correct	1225 ms	230500 KB	Output is correct
63	Correct	1153 ms	230536 KB	Output is correct
64	Correct	1219 ms	229696 KB	Output is correct
65	Correct	26 ms	33996 KB	Output is correct
66	Correct	34 ms	34884 KB	Output is correct
67	Correct	516 ms	146652 KB	Output is correct
68	Correct	843 ms	178576 KB	Output is correct
69	Correct	1355 ms	210228 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	83276 KB	Output is correct
3	Correct	20 ms	33112 KB	Output is correct
4	Correct	42 ms	83220 KB	Output is correct
5	Correct	42 ms	83248 KB	Output is correct
6	Correct	22 ms	33100 KB	Output is correct
7	Correct	21 ms	33100 KB	Output is correct
8	Correct	19 ms	33192 KB	Output is correct
9	Correct	521 ms	156868 KB	Output is correct
10	Correct	74 ms	90820 KB	Output is correct
11	Correct	242 ms	123160 KB	Output is correct
12	Correct	96 ms	94656 KB	Output is correct
13	Correct	88 ms	43076 KB	Output is correct
14	Correct	22 ms	33332 KB	Output is correct
15	Correct	23 ms	33612 KB	Output is correct
16	Correct	508 ms	156916 KB	Output is correct
17	Correct	1106 ms	230476 KB	Output is correct
18	Correct	1236 ms	230592 KB	Output is correct
19	Correct	998 ms	200080 KB	Output is correct
20	Correct	1046 ms	209060 KB	Output is correct
21	Correct	945 ms	206632 KB	Output is correct
22	Correct	46 ms	83208 KB	Output is correct
23	Correct	163 ms	103816 KB	Output is correct
24	Correct	54 ms	37588 KB	Output is correct
25	Correct	237 ms	48972 KB	Output is correct
26	Correct	379 ms	60272 KB	Output is correct
27	Correct	486 ms	146492 KB	Output is correct
28	Correct	728 ms	162544 KB	Output is correct
29	Correct	842 ms	178064 KB	Output is correct
30	Correct	1090 ms	193908 KB	Output is correct
31	Correct	1189 ms	209668 KB	Output is correct
32	Correct	1144 ms	212840 KB	Output is correct
33	Correct	1272 ms	230428 KB	Output is correct
34	Correct	28 ms	34252 KB	Output is correct
35	Correct	35 ms	35228 KB	Output is correct
36	Correct	561 ms	146624 KB	Output is correct
37	Correct	840 ms	178692 KB	Output is correct
38	Correct	1205 ms	210140 KB	Output is correct

Subtask #6
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	20 ms	33100 KB	Output is correct
2	Correct	44 ms	83276 KB	Output is correct
3	Correct	20 ms	33112 KB	Output is correct
4	Correct	42 ms	83220 KB	Output is correct
5	Correct	42 ms	83248 KB	Output is correct
6	Correct	22 ms	33100 KB	Output is correct
7	Correct	21 ms	33100 KB	Output is correct
8	Correct	19 ms	33192 KB	Output is correct
9	Correct	521 ms	156868 KB	Output is correct
10	Correct	74 ms	90820 KB	Output is correct
11	Correct	242 ms	123160 KB	Output is correct
12	Correct	96 ms	94656 KB	Output is correct
13	Correct	88 ms	43076 KB	Output is correct
14	Correct	22 ms	33332 KB	Output is correct
15	Correct	23 ms	33612 KB	Output is correct
16	Correct	508 ms	156916 KB	Output is correct
17	Correct	47 ms	83224 KB	Output is correct
18	Correct	44 ms	83272 KB	Output is correct
19	Correct	44 ms	83236 KB	Output is correct
20	Correct	45 ms	83268 KB	Output is correct
21	Correct	20 ms	33100 KB	Output is correct
22	Correct	45 ms	83212 KB	Output is correct
23	Correct	1074 ms	201544 KB	Output is correct
24	Correct	47 ms	83268 KB	Output is correct
25	Correct	48 ms	84028 KB	Output is correct
26	Correct	26 ms	33888 KB	Output is correct
27	Correct	30 ms	34124 KB	Output is correct
28	Correct	382 ms	131044 KB	Output is correct
29	Correct	612 ms	154288 KB	Output is correct
30	Correct	854 ms	177916 KB	Output is correct
31	Correct	1058 ms	201544 KB	Output is correct
32	Correct	44 ms	83268 KB	Output is correct
33	Correct	47 ms	83288 KB	Output is correct
34	Correct	45 ms	83276 KB	Output is correct
35	Correct	22 ms	33100 KB	Output is correct
36	Correct	24 ms	33120 KB	Output is correct
37	Correct	47 ms	83248 KB	Output is correct
38	Correct	48 ms	83268 KB	Output is correct
39	Correct	45 ms	83236 KB	Output is correct
40	Correct	48 ms	83208 KB	Output is correct
41	Correct	21 ms	33100 KB	Output is correct
42	Correct	45 ms	83232 KB	Output is correct
43	Correct	27 ms	33604 KB	Output is correct
44	Correct	26 ms	33868 KB	Output is correct
45	Correct	495 ms	147388 KB	Output is correct
46	Correct	779 ms	176584 KB	Output is correct
47	Correct	740 ms	176504 KB	Output is correct
48	Correct	47 ms	83268 KB	Output is correct
49	Correct	48 ms	83236 KB	Output is correct
50	Correct	47 ms	83220 KB	Output is correct
51	Correct	43 ms	83276 KB	Output is correct
52	Correct	48 ms	83332 KB	Output is correct
53	Correct	46 ms	83200 KB	Output is correct
54	Correct	45 ms	83280 KB	Output is correct
55	Correct	1080 ms	202172 KB	Output is correct
56	Correct	48 ms	83276 KB	Output is correct
57	Correct	52 ms	84340 KB	Output is correct
58	Correct	66 ms	86968 KB	Output is correct
59	Correct	38 ms	35396 KB	Output is correct
60	Correct	490 ms	145596 KB	Output is correct
61	Correct	690 ms	163924 KB	Output is correct
62	Correct	844 ms	181304 KB	Output is correct
63	Correct	1119 ms	202136 KB	Output is correct
64	Correct	21 ms	33100 KB	Output is correct
65	Correct	44 ms	83252 KB	Output is correct
66	Correct	23 ms	33164 KB	Output is correct
67	Correct	1118 ms	230488 KB	Output is correct
68	Correct	1120 ms	230580 KB	Output is correct
69	Correct	1083 ms	229812 KB	Output is correct
70	Correct	29 ms	33984 KB	Output is correct
71	Correct	34 ms	34892 KB	Output is correct
72	Correct	516 ms	146912 KB	Output is correct
73	Correct	785 ms	178484 KB	Output is correct
74	Correct	1123 ms	210284 KB	Output is correct
75	Correct	1179 ms	213164 KB	Output is correct
76	Correct	1196 ms	230480 KB	Output is correct
77	Correct	31 ms	34380 KB	Output is correct
78	Correct	38 ms	35196 KB	Output is correct
79	Correct	480 ms	146692 KB	Output is correct
80	Correct	769 ms	178672 KB	Output is correct
81	Correct	1125 ms	210416 KB	Output is correct
82	Correct	46 ms	83304 KB	Output is correct
83	Correct	46 ms	83220 KB	Output is correct
84	Correct	23 ms	33100 KB	Output is correct
85	Correct	1014 ms	200020 KB	Output is correct
86	Correct	1089 ms	199976 KB	Output is correct
87	Correct	1026 ms	200032 KB	Output is correct
88	Correct	970 ms	208432 KB	Output is correct
89	Correct	283 ms	54408 KB	Output is correct
90	Correct	652 ms	77720 KB	Output is correct
91	Correct	622 ms	77736 KB	Output is correct
92	Correct	1056 ms	230396 KB	Output is correct
93	Correct	1099 ms	230296 KB	Output is correct
94	Correct	1208 ms	230376 KB	Output is correct
95	Correct	1112 ms	230368 KB	Output is correct
96	Correct	41 ms	83248 KB	Output is correct
97	Correct	90 ms	92448 KB	Output is correct
98	Correct	158 ms	43696 KB	Output is correct
99	Correct	1060 ms	200020 KB	Output is correct
100	Correct	38 ms	35320 KB	Output is correct
101	Correct	133 ms	44340 KB	Output is correct
102	Correct	322 ms	55448 KB	Output is correct
103	Correct	497 ms	132696 KB	Output is correct
104	Correct	655 ms	151168 KB	Output is correct
105	Correct	781 ms	169588 KB	Output is correct
106	Correct	1069 ms	187524 KB	Output is correct
107	Correct	1443 ms	206716 KB	Output is correct
108	Correct	50 ms	83216 KB	Output is correct
109	Correct	45 ms	83212 KB	Output is correct
110	Correct	41 ms	83316 KB	Output is correct
111	Correct	22 ms	33100 KB	Output is correct
112	Correct	30 ms	33128 KB	Output is correct
113	Correct	47 ms	83276 KB	Output is correct
114	Correct	48 ms	83312 KB	Output is correct
115	Correct	44 ms	83208 KB	Output is correct
116	Correct	42 ms	83268 KB	Output is correct
117	Correct	19 ms	33172 KB	Output is correct
118	Correct	43 ms	83284 KB	Output is correct
119	Correct	26 ms	33524 KB	Output is correct
120	Correct	28 ms	33832 KB	Output is correct
121	Correct	544 ms	147388 KB	Output is correct
122	Correct	800 ms	176608 KB	Output is correct
123	Correct	798 ms	176508 KB	Output is correct
124	Correct	22 ms	33228 KB	Output is correct
125	Correct	50 ms	83320 KB	Output is correct
126	Correct	19 ms	33132 KB	Output is correct
127	Correct	1225 ms	230500 KB	Output is correct
128	Correct	1153 ms	230536 KB	Output is correct
129	Correct	1219 ms	229696 KB	Output is correct
130	Correct	26 ms	33996 KB	Output is correct
131	Correct	34 ms	34884 KB	Output is correct
132	Correct	516 ms	146652 KB	Output is correct
133	Correct	843 ms	178576 KB	Output is correct
134	Correct	1355 ms	210228 KB	Output is correct
135	Correct	1106 ms	230476 KB	Output is correct
136	Correct	1236 ms	230592 KB	Output is correct
137	Correct	998 ms	200080 KB	Output is correct
138	Correct	1046 ms	209060 KB	Output is correct
139	Correct	945 ms	206632 KB	Output is correct
140	Correct	46 ms	83208 KB	Output is correct
141	Correct	163 ms	103816 KB	Output is correct
142	Correct	54 ms	37588 KB	Output is correct
143	Correct	237 ms	48972 KB	Output is correct
144	Correct	379 ms	60272 KB	Output is correct
145	Correct	486 ms	146492 KB	Output is correct
146	Correct	728 ms	162544 KB	Output is correct
147	Correct	842 ms	178064 KB	Output is correct
148	Correct	1090 ms	193908 KB	Output is correct
149	Correct	1189 ms	209668 KB	Output is correct
150	Correct	1144 ms	212840 KB	Output is correct
151	Correct	1272 ms	230428 KB	Output is correct
152	Correct	28 ms	34252 KB	Output is correct
153	Correct	35 ms	35228 KB	Output is correct
154	Correct	561 ms	146624 KB	Output is correct
155	Correct	840 ms	178692 KB	Output is correct
156	Correct	1205 ms	210140 KB	Output is correct
157	Correct	43 ms	83228 KB	Output is correct
158	Correct	23 ms	33100 KB	Output is correct
159	Correct	50 ms	83220 KB	Output is correct
160	Correct	43 ms	83340 KB	Output is correct
161	Correct	1087 ms	203232 KB	Output is correct
162	Correct	1125 ms	200036 KB	Output is correct
163	Correct	1048 ms	201024 KB	Output is correct
164	Correct	1012 ms	201068 KB	Output is correct
165	Correct	1197 ms	203328 KB	Output is correct
166	Correct	1174 ms	203048 KB	Output is correct
167	Runtime error	699 ms	223144 KB	Execution killed with signal 6
168	Halted	0 ms	0 KB	-

답안 #439971

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