oj.uz

답안 #525721

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
525721 2022-02-12T16:07:49 Z qwerasdfzxcl Mountains and Valleys (CCO20_day1problem3) C++14
25 / 25
 6923 ms 469800 KB 
#include <bits/stdc++.h>

typedef long long ll;
using namespace std;
struct Query{
    int x, y, z;
    Query(){}
    Query(int _x, int _y, int _z): x(_x), y(_y), z(_z) {}
};
vector<int> adj[500500];
vector<Query> E;
int n;

int dep[500500], par[500500], dp_D[500500], dp_far[500500], D[500500], deep[500500];
void dfs_dp1(int s, int pa = -1){
    //printf(" %d", s);
    par[s] = pa;
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pqD, pqfar;

    for (auto &v:adj[s]) if (v!=pa){
        dep[v] = dep[s]+1;
        dfs_dp1(v, s);

        dp_D[s] = max(dp_D[s], dp_D[v]);
        dp_far[s] = max(dp_far[s], dp_far[v]+1);

        pqD.emplace(dp_D[v], v);
        pqfar.emplace(dp_far[v]+1, v);
        if (pqD.size()>3) {pqD.pop(); pqfar.pop();}
    }

    pair<int, int> Drr[3], Frr[3];
    for (int i=pqD.size();i<3;i++) Drr[i] = Frr[i] = {0, -1};

    for (int i=(int)pqD.size()-1;i>=0;i--){
        Drr[i] = pqD.top(); pqD.pop();
    }
    for (int i=(int)pqfar.size()-1;i>=0;i--){
        Frr[i] = pqfar.top(); pqfar.pop();
    }

    dp_D[s] = max(dp_D[s], Frr[0].first + Frr[1].first);

    ///calc D, deep
    for (auto &v:adj[s]) if (v!=pa){
        if (v==Drr[0].second) D[v] = Drr[1].first;
        else D[v] = Drr[0].first;

        if (v==Frr[0].second){
            D[v] = max(D[v], Frr[1].first + Frr[2].first);
            deep[v] = Frr[1].first;
        }
        else if (v==Frr[1].second){
            D[v] = max(D[v], Frr[0].first + Frr[2].first);
            deep[v] = Frr[0].first;
        }
        else{
            D[v] = max(D[v], Frr[0].first + Frr[1].first);
            deep[v] = Frr[0].first;
        }
    }
}

pair<int, int> Dc[500500][4], Fc[500500][4];
int dp_parD[500500], dp_parF[500500];

void dfs_dp2(int s, int pa = -1){
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pqD, pqF;
    if (pa!=-1){
        pqD.emplace(dp_parD[s], pa);
        pqF.emplace(dp_parF[s]+1, pa);
    }

    for (auto &v:adj[s]) if (v!=pa){
        pqD.emplace(dp_D[v], v);
        pqF.emplace(dp_far[v]+1, v);
        if (pqD.size()>4) {pqD.pop(); pqF.pop();}
    }


    for (int i=pqD.size();i<4;i++) Dc[s][i] = Fc[s][i] = {0, -1};

    for (int i=(int)pqD.size()-1;i>=0;i--){
        Dc[s][i] = pqD.top(); pqD.pop();
    }
    for (int i=(int)pqF.size()-1;i>=0;i--){
        Fc[s][i] = pqF.top(); pqF.pop();
    }

    ///calc dp_par
    for (auto &v:adj[s]) if (v!=pa){
        if (v==Dc[s][0].second) dp_parD[v] = Dc[s][1].first;
        else dp_parD[v] = Dc[s][0].first;

        if (v==Fc[s][0].second){
            dp_parD[v] = max(dp_parD[v], Fc[s][1].first + Fc[s][2].first);
            dp_parF[v] = Fc[s][1].first;
        }
        else if (v==Fc[s][1].second){
            dp_parD[v] = max(dp_parD[v], Fc[s][0].first + Fc[s][2].first);
            dp_parF[v] = Fc[s][0].first;
        }
        else{
            dp_parD[v] = max(dp_parD[v], Fc[s][0].first + Fc[s][1].first);
            dp_parF[v] = Fc[s][0].first;
        }
    }

    for (auto &v:adj[s]) if (v!=pa) dfs_dp2(v, s);
}

struct Node{
    int ans, a, b;
    Node(){}
    Node(int _ans, int _a, int _b): ans(_ans), a(_a), b(_b) {}
    Node operator +(const Node &R) const{
        return Node(max(max(ans, R.ans), a+R.b), max(a, R.a), max(b, R.b));
    }
};
pair<int, int> sp1[500500][20];
Node sp2[500500][20];

void build(int n){
    for (int i=0;i<n;i++){
        sp1[i][0] = {D[i], par[i]};
        sp2[i][0] = Node(-1e9, deep[i]-(dep[i]-1), deep[i]+(dep[i]-1));
    }

    for (int j=1;j<20;j++){
        for (int i=0;i<n;i++){
            int tmp = sp1[i][j-1].second;
            if (sp1[i][j-1].second==-1 || sp1[tmp][j-1].second==-1) {sp1[i][j].second = -1; continue;}

            sp1[i][j].first = max(sp1[i][j-1].first, sp1[tmp][j-1].first);
            sp1[i][j].second = sp1[tmp][j-1].second;
            sp2[i][j] = sp2[i][j-1] + sp2[tmp][j-1];
        }
    }
}

int prV, prW;
int get_lca(int v, int w){
    if (dep[v]<dep[w]) swap(v, w);

    if(dep[v]!=dep[w]){
        int dist = dep[v] - dep[w] - 1;
        for (int j=0;dist>0;j++) if (dist&(1<<j)){
            v = sp1[v][j].second;
            dist -= 1<<j;
        }
    }
    prV = v, prW = w;
    if (dep[v]!=dep[w]) v = sp1[v][0].second;

    if (v==w) return v;

    for (int j=19;j>=0;j--) if (sp1[v][j].second!=sp1[w][j].second){
        v = sp1[v][j].second;
        w = sp1[w][j].second;
    }
    prV = v, prW = w;
    return sp1[v][0].second;
}

int calc1(int x, int y, int w){
    int lca = get_lca(x, y);
    int ret = 0;

    if (x!=lca) ret = max(ret, dp_D[x]);
    if (y!=lca) ret = max(ret, dp_D[y]);

    int rdist = dep[x] + dep[y] - dep[lca]*2;

    int dist = dep[x] - dep[lca] - 1;
    for (int j=0;dist>0;j++) if (dist&(1<<j)){
        ret = max(ret, sp1[x][j].first);
        x = sp1[x][j].second;
        dist -= 1<<j;
    }

    dist = dep[y] - dep[lca] - 1;
    for (int j=0;dist>0;j++) if (dist&(1<<j)){
        ret = max(ret, sp1[y][j].first);
        y = sp1[y][j].second;
        dist -= 1<<j;
    }

    int S = 0, cnt = 0;
    for (int i=0;i<4;i++) if (Dc[lca][i].second!=x && Dc[lca][i].second!=y) ret = max(ret, Dc[lca][i].first);
    for (int i=0;i<4;i++) if (Fc[lca][i].second!=x && Fc[lca][i].second!=y){
        S += Fc[lca][i].first;
        cnt++;
        if (cnt==2) break;
    }
    ret = max(ret, S);

    return (n-1+w)*2 - ret - rdist - w;
}

int calc2(int x, int y, int w){
    int lca = get_lca(x, y);
    int ret = -1e9, rdist = dep[x] + dep[y] - dep[lca]*2;

    int val = -1;
    for (int i=0;i<4;i++) if (Fc[lca][i].second!=prV && Fc[lca][i].second!=prW) {val = Fc[lca][i].first; break;}
    assert(val!=-1);

    ///left chain
    int tx = x, ty = y;
    Node cur(-1e9, dp_far[tx] - dep[tx], dp_far[tx] + dep[tx]);
    Node Top(-1e9, val - dep[lca], val + dep[lca]);

    int dist = dep[tx] - dep[lca] - 1;
    for (int j=0;dist>0;j++) if (dist&(1<<j)){
        cur = cur + sp2[tx][j];
        tx = sp1[tx][j].second;
        dist -= 1<<j;
    }

    if (tx!=lca) cur = cur + Top;
    ret = max(ret, cur.ans);

    ///right chain
    cur = Node(-1e9, dp_far[ty] - dep[ty], dp_far[ty] + dep[ty]);
    dist = dep[ty] - dep[lca] - 1;
    for (int j=0;dist>0;j++) if (dist&(1<<j)){
        cur = cur + sp2[ty][j];
        ty = sp1[ty][j].second;
        dist -= 1<<j;
    }

    if (ty!=lca) cur = cur + Top;
    ret = max(ret, cur.ans);

    ///left and right
    if (x==lca || y==lca) return (n-2+w) * 2 - (rdist+w+ret);

    int L = dp_far[x] - dep[x], R = dp_far[y] - dep[y];
    tx = x, ty = y;

    dist = dep[tx] - dep[lca] - 1;
    for (int j=0;dist>0;j++) if (dist&(1<<j)){
        L = max(L, sp2[tx][j].a);
        tx = sp1[tx][j].second;
        dist -= 1<<j;
    }

    dist = dep[ty] - dep[lca] - 1;
    for (int j=0;dist>0;j++) if (dist&(1<<j)){
        R = max(R, sp2[ty][j].a);
        ty = sp1[ty][j].second;
        dist -= 1<<j;
    }

    ret = max(ret, L+R + dep[lca]*2);

    return (n-2+w) * 2 - (rdist+w+ret);
}

void Debug(){
    printf("dep: ");
    for (int i=0;i<n;i++) printf("%d ", dep[i]);
    printf("\npar: ");
    for (int i=0;i<n;i++) printf("%d ", par[i]);
    printf("\ndp_D: ");
    for (int i=0;i<n;i++) printf("%d ", dp_D[i]);
    printf("\ndp_far: ");
    for (int i=0;i<n;i++) printf("%d ", dp_far[i]);
    printf("\nD: ");
    for (int i=0;i<n;i++) printf("%d ", D[i]);
    printf("\ndeep: ");
    for (int i=0;i<n;i++) printf("%d ", deep[i]);
    printf("\ndp_parD: ");
    for (int i=0;i<n;i++) printf("%d ", dp_parD[i]);
    printf("\ndp_parF: ");
    for (int i=0;i<n;i++) printf("%d ", dp_parF[i]);
    printf("\n");
}

int main(){
    cin.tie(NULL);
    ios_base::sync_with_stdio(false);
    int m;
    cin >> n >> m;
    for (int i=1;i<=m;i++){
        int x, y, z;
        cin >> x >> y >> z;
        if (z!=1) {E.emplace_back(x, y, z); continue;}

        adj[x].push_back(y);
        adj[y].push_back(x);
    }

    dfs_dp1(0);
    dfs_dp2(0);

    //Debug();

    build(n);

    //if (n>80000) exit(0);

    int ans = (n-1)*2 - dp_D[0];

    for (auto &e:E){
        ans = min(ans, calc1(e.x, e.y, e.z));
        ans = min(ans, calc2(e.x, e.y, e.z));
    }

    printf("%d\n", ans);
    return 0;
}

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12108 KB Output is correct
2 Correct 6 ms 12108 KB Output is correct
3 Correct 6 ms 12108 KB Output is correct
4 Correct 6 ms 12108 KB Output is correct
5 Correct 6 ms 12108 KB Output is correct
6 Correct 6 ms 12108 KB Output is correct
7 Correct 6 ms 12108 KB Output is correct
8 Correct 6 ms 12108 KB Output is correct
9 Correct 6 ms 12108 KB Output is correct
10 Correct 6 ms 12164 KB Output is correct
11 Correct 7 ms 12164 KB Output is correct
12 Correct 7 ms 12108 KB Output is correct
13 Correct 7 ms 12108 KB Output is correct
14 Correct 6 ms 12108 KB Output is correct
15 Correct 7 ms 12108 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12108 KB Output is correct
2 Correct 6 ms 12108 KB Output is correct
3 Correct 6 ms 12108 KB Output is correct
4 Correct 6 ms 12108 KB Output is correct
5 Correct 6 ms 12108 KB Output is correct
6 Correct 6 ms 12108 KB Output is correct
7 Correct 6 ms 12108 KB Output is correct
8 Correct 6 ms 12108 KB Output is correct
9 Correct 6 ms 12108 KB Output is correct
10 Correct 6 ms 12164 KB Output is correct
11 Correct 7 ms 12164 KB Output is correct
12 Correct 7 ms 12108 KB Output is correct
13 Correct 7 ms 12108 KB Output is correct
14 Correct 6 ms 12108 KB Output is correct
15 Correct 7 ms 12108 KB Output is correct
16 Correct 7 ms 12108 KB Output is correct
17 Correct 6 ms 12160 KB Output is correct
18 Correct 7 ms 12104 KB Output is correct
19 Correct 7 ms 12108 KB Output is correct
20 Correct 7 ms 12044 KB Output is correct
21 Correct 7 ms 12108 KB Output is correct
22 Correct 7 ms 12108 KB Output is correct
23 Correct 7 ms 12108 KB Output is correct
24 Correct 6 ms 12108 KB Output is correct
25 Correct 8 ms 12108 KB Output is correct
26 Correct 7 ms 12108 KB Output is correct
27 Correct 6 ms 12108 KB Output is correct
28 Correct 7 ms 12088 KB Output is correct
29 Correct 6 ms 12108 KB Output is correct
30 Correct 7 ms 12108 KB Output is correct
31 Correct 8 ms 12108 KB Output is correct
32 Correct 6 ms 12108 KB Output is correct
33 Correct 6 ms 12108 KB Output is correct
34 Correct 6 ms 12108 KB Output is correct
35 Correct 6 ms 12128 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 15948 KB Output is correct
2 Correct 16 ms 16248 KB Output is correct
3 Correct 17 ms 15564 KB Output is correct
4 Correct 16 ms 15372 KB Output is correct
5 Correct 16 ms 15316 KB Output is correct
6 Correct 13 ms 14796 KB Output is correct
7 Correct 16 ms 16096 KB Output is correct
8 Correct 16 ms 15692 KB Output is correct
9 Correct 16 ms 16100 KB Output is correct
10 Correct 15 ms 15304 KB Output is correct
11 Correct 16 ms 15668 KB Output is correct
12 Correct 17 ms 15180 KB Output is correct
13 Correct 15 ms 15436 KB Output is correct
14 Correct 16 ms 15564 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12108 KB Output is correct
2 Correct 6 ms 12108 KB Output is correct
3 Correct 6 ms 12108 KB Output is correct
4 Correct 6 ms 12108 KB Output is correct
5 Correct 6 ms 12108 KB Output is correct
6 Correct 6 ms 12108 KB Output is correct
7 Correct 6 ms 12108 KB Output is correct
8 Correct 6 ms 12108 KB Output is correct
9 Correct 6 ms 12108 KB Output is correct
10 Correct 6 ms 12164 KB Output is correct
11 Correct 7 ms 12164 KB Output is correct
12 Correct 7 ms 12108 KB Output is correct
13 Correct 7 ms 12108 KB Output is correct
14 Correct 6 ms 12108 KB Output is correct
15 Correct 7 ms 12108 KB Output is correct
16 Correct 7 ms 12108 KB Output is correct
17 Correct 6 ms 12160 KB Output is correct
18 Correct 7 ms 12104 KB Output is correct
19 Correct 7 ms 12108 KB Output is correct
20 Correct 7 ms 12044 KB Output is correct
21 Correct 7 ms 12108 KB Output is correct
22 Correct 7 ms 12108 KB Output is correct
23 Correct 7 ms 12108 KB Output is correct
24 Correct 6 ms 12108 KB Output is correct
25 Correct 8 ms 12108 KB Output is correct
26 Correct 7 ms 12108 KB Output is correct
27 Correct 6 ms 12108 KB Output is correct
28 Correct 7 ms 12088 KB Output is correct
29 Correct 6 ms 12108 KB Output is correct
30 Correct 7 ms 12108 KB Output is correct
31 Correct 8 ms 12108 KB Output is correct
32 Correct 6 ms 12108 KB Output is correct
33 Correct 6 ms 12108 KB Output is correct
34 Correct 6 ms 12108 KB Output is correct
35 Correct 6 ms 12128 KB Output is correct
36 Correct 6 ms 12128 KB Output is correct
37 Correct 6 ms 12204 KB Output is correct
38 Correct 6 ms 12236 KB Output is correct
39 Correct 6 ms 12108 KB Output is correct
40 Correct 6 ms 12192 KB Output is correct
41 Correct 7 ms 12108 KB Output is correct
42 Correct 6 ms 12212 KB Output is correct
43 Correct 7 ms 12236 KB Output is correct
44 Correct 6 ms 12108 KB Output is correct
45 Correct 7 ms 12108 KB Output is correct
46 Correct 7 ms 12108 KB Output is correct
47 Correct 6 ms 12132 KB Output is correct
48 Correct 6 ms 12108 KB Output is correct
49 Correct 7 ms 12108 KB Output is correct

Subtask #5
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12108 KB Output is correct
2 Correct 6 ms 12108 KB Output is correct
3 Correct 6 ms 12108 KB Output is correct
4 Correct 6 ms 12108 KB Output is correct
5 Correct 6 ms 12108 KB Output is correct
6 Correct 6 ms 12108 KB Output is correct
7 Correct 6 ms 12108 KB Output is correct
8 Correct 6 ms 12108 KB Output is correct
9 Correct 6 ms 12108 KB Output is correct
10 Correct 6 ms 12164 KB Output is correct
11 Correct 7 ms 12164 KB Output is correct
12 Correct 7 ms 12108 KB Output is correct
13 Correct 7 ms 12108 KB Output is correct
14 Correct 6 ms 12108 KB Output is correct
15 Correct 7 ms 12108 KB Output is correct
16 Correct 7 ms 12108 KB Output is correct
17 Correct 6 ms 12160 KB Output is correct
18 Correct 7 ms 12104 KB Output is correct
19 Correct 7 ms 12108 KB Output is correct
20 Correct 7 ms 12044 KB Output is correct
21 Correct 7 ms 12108 KB Output is correct
22 Correct 7 ms 12108 KB Output is correct
23 Correct 7 ms 12108 KB Output is correct
24 Correct 6 ms 12108 KB Output is correct
25 Correct 8 ms 12108 KB Output is correct
26 Correct 7 ms 12108 KB Output is correct
27 Correct 6 ms 12108 KB Output is correct
28 Correct 7 ms 12088 KB Output is correct
29 Correct 6 ms 12108 KB Output is correct
30 Correct 7 ms 12108 KB Output is correct
31 Correct 8 ms 12108 KB Output is correct
32 Correct 6 ms 12108 KB Output is correct
33 Correct 6 ms 12108 KB Output is correct
34 Correct 6 ms 12108 KB Output is correct
35 Correct 6 ms 12128 KB Output is correct
36 Correct 6 ms 12128 KB Output is correct
37 Correct 6 ms 12204 KB Output is correct
38 Correct 6 ms 12236 KB Output is correct
39 Correct 6 ms 12108 KB Output is correct
40 Correct 6 ms 12192 KB Output is correct
41 Correct 7 ms 12108 KB Output is correct
42 Correct 6 ms 12212 KB Output is correct
43 Correct 7 ms 12236 KB Output is correct
44 Correct 6 ms 12108 KB Output is correct
45 Correct 7 ms 12108 KB Output is correct
46 Correct 7 ms 12108 KB Output is correct
47 Correct 6 ms 12132 KB Output is correct
48 Correct 6 ms 12108 KB Output is correct
49 Correct 7 ms 12108 KB Output is correct
50 Correct 7 ms 12556 KB Output is correct
51 Correct 8 ms 12528 KB Output is correct
52 Correct 8 ms 12492 KB Output is correct
53 Correct 7 ms 12364 KB Output is correct
54 Correct 7 ms 12364 KB Output is correct
55 Correct 7 ms 12344 KB Output is correct
56 Correct 7 ms 12492 KB Output is correct
57 Correct 7 ms 12384 KB Output is correct
58 Correct 8 ms 12492 KB Output is correct
59 Correct 7 ms 12476 KB Output is correct
60 Correct 7 ms 12364 KB Output is correct
61 Correct 7 ms 12364 KB Output is correct
62 Correct 7 ms 12332 KB Output is correct
63 Correct 7 ms 12364 KB Output is correct

Subtask #6
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12108 KB Output is correct
2 Correct 6 ms 12108 KB Output is correct
3 Correct 6 ms 12108 KB Output is correct
4 Correct 6 ms 12108 KB Output is correct
5 Correct 6 ms 12108 KB Output is correct
6 Correct 6 ms 12108 KB Output is correct
7 Correct 6 ms 12108 KB Output is correct
8 Correct 6 ms 12108 KB Output is correct
9 Correct 6 ms 12108 KB Output is correct
10 Correct 6 ms 12164 KB Output is correct
11 Correct 7 ms 12164 KB Output is correct
12 Correct 7 ms 12108 KB Output is correct
13 Correct 7 ms 12108 KB Output is correct
14 Correct 6 ms 12108 KB Output is correct
15 Correct 7 ms 12108 KB Output is correct
16 Correct 7 ms 12108 KB Output is correct
17 Correct 6 ms 12160 KB Output is correct
18 Correct 7 ms 12104 KB Output is correct
19 Correct 7 ms 12108 KB Output is correct
20 Correct 7 ms 12044 KB Output is correct
21 Correct 7 ms 12108 KB Output is correct
22 Correct 7 ms 12108 KB Output is correct
23 Correct 7 ms 12108 KB Output is correct
24 Correct 6 ms 12108 KB Output is correct
25 Correct 8 ms 12108 KB Output is correct
26 Correct 7 ms 12108 KB Output is correct
27 Correct 6 ms 12108 KB Output is correct
28 Correct 7 ms 12088 KB Output is correct
29 Correct 6 ms 12108 KB Output is correct
30 Correct 7 ms 12108 KB Output is correct
31 Correct 8 ms 12108 KB Output is correct
32 Correct 6 ms 12108 KB Output is correct
33 Correct 6 ms 12108 KB Output is correct
34 Correct 6 ms 12108 KB Output is correct
35 Correct 6 ms 12128 KB Output is correct
36 Correct 18 ms 15948 KB Output is correct
37 Correct 16 ms 16248 KB Output is correct
38 Correct 17 ms 15564 KB Output is correct
39 Correct 16 ms 15372 KB Output is correct
40 Correct 16 ms 15316 KB Output is correct
41 Correct 13 ms 14796 KB Output is correct
42 Correct 16 ms 16096 KB Output is correct
43 Correct 16 ms 15692 KB Output is correct
44 Correct 16 ms 16100 KB Output is correct
45 Correct 15 ms 15304 KB Output is correct
46 Correct 16 ms 15668 KB Output is correct
47 Correct 17 ms 15180 KB Output is correct
48 Correct 15 ms 15436 KB Output is correct
49 Correct 16 ms 15564 KB Output is correct
50 Correct 6 ms 12128 KB Output is correct
51 Correct 6 ms 12204 KB Output is correct
52 Correct 6 ms 12236 KB Output is correct
53 Correct 6 ms 12108 KB Output is correct
54 Correct 6 ms 12192 KB Output is correct
55 Correct 7 ms 12108 KB Output is correct
56 Correct 6 ms 12212 KB Output is correct
57 Correct 7 ms 12236 KB Output is correct
58 Correct 6 ms 12108 KB Output is correct
59 Correct 7 ms 12108 KB Output is correct
60 Correct 7 ms 12108 KB Output is correct
61 Correct 6 ms 12132 KB Output is correct
62 Correct 6 ms 12108 KB Output is correct
63 Correct 7 ms 12108 KB Output is correct
64 Correct 7 ms 12556 KB Output is correct
65 Correct 8 ms 12528 KB Output is correct
66 Correct 8 ms 12492 KB Output is correct
67 Correct 7 ms 12364 KB Output is correct
68 Correct 7 ms 12364 KB Output is correct
69 Correct 7 ms 12344 KB Output is correct
70 Correct 7 ms 12492 KB Output is correct
71 Correct 7 ms 12384 KB Output is correct
72 Correct 8 ms 12492 KB Output is correct
73 Correct 7 ms 12476 KB Output is correct
74 Correct 7 ms 12364 KB Output is correct
75 Correct 7 ms 12364 KB Output is correct
76 Correct 7 ms 12332 KB Output is correct
77 Correct 7 ms 12364 KB Output is correct
78 Correct 18 ms 15564 KB Output is correct
79 Correct 18 ms 15844 KB Output is correct
80 Correct 16 ms 15544 KB Output is correct
81 Correct 16 ms 15492 KB Output is correct
82 Correct 17 ms 15208 KB Output is correct
83 Correct 11 ms 14796 KB Output is correct
84 Correct 15 ms 15744 KB Output is correct
85 Correct 16 ms 15728 KB Output is correct
86 Correct 16 ms 15948 KB Output is correct
87 Correct 16 ms 15376 KB Output is correct
88 Correct 16 ms 15396 KB Output is correct
89 Correct 16 ms 15284 KB Output is correct
90 Correct 12 ms 15324 KB Output is correct
91 Correct 15 ms 15420 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12108 KB Output is correct
2 Correct 6 ms 12108 KB Output is correct
3 Correct 6 ms 12108 KB Output is correct
4 Correct 6 ms 12108 KB Output is correct
5 Correct 6 ms 12108 KB Output is correct
6 Correct 6 ms 12108 KB Output is correct
7 Correct 6 ms 12108 KB Output is correct
8 Correct 6 ms 12108 KB Output is correct
9 Correct 6 ms 12108 KB Output is correct
10 Correct 6 ms 12164 KB Output is correct
11 Correct 7 ms 12164 KB Output is correct
12 Correct 7 ms 12108 KB Output is correct
13 Correct 7 ms 12108 KB Output is correct
14 Correct 6 ms 12108 KB Output is correct
15 Correct 7 ms 12108 KB Output is correct
16 Correct 7 ms 12108 KB Output is correct
17 Correct 6 ms 12160 KB Output is correct
18 Correct 7 ms 12104 KB Output is correct
19 Correct 7 ms 12108 KB Output is correct
20 Correct 7 ms 12044 KB Output is correct
21 Correct 7 ms 12108 KB Output is correct
22 Correct 7 ms 12108 KB Output is correct
23 Correct 7 ms 12108 KB Output is correct
24 Correct 6 ms 12108 KB Output is correct
25 Correct 8 ms 12108 KB Output is correct
26 Correct 7 ms 12108 KB Output is correct
27 Correct 6 ms 12108 KB Output is correct
28 Correct 7 ms 12088 KB Output is correct
29 Correct 6 ms 12108 KB Output is correct
30 Correct 7 ms 12108 KB Output is correct
31 Correct 8 ms 12108 KB Output is correct
32 Correct 6 ms 12108 KB Output is correct
33 Correct 6 ms 12108 KB Output is correct
34 Correct 6 ms 12108 KB Output is correct
35 Correct 6 ms 12128 KB Output is correct
36 Correct 18 ms 15948 KB Output is correct
37 Correct 16 ms 16248 KB Output is correct
38 Correct 17 ms 15564 KB Output is correct
39 Correct 16 ms 15372 KB Output is correct
40 Correct 16 ms 15316 KB Output is correct
41 Correct 13 ms 14796 KB Output is correct
42 Correct 16 ms 16096 KB Output is correct
43 Correct 16 ms 15692 KB Output is correct
44 Correct 16 ms 16100 KB Output is correct
45 Correct 15 ms 15304 KB Output is correct
46 Correct 16 ms 15668 KB Output is correct
47 Correct 17 ms 15180 KB Output is correct
48 Correct 15 ms 15436 KB Output is correct
49 Correct 16 ms 15564 KB Output is correct
50 Correct 6 ms 12128 KB Output is correct
51 Correct 6 ms 12204 KB Output is correct
52 Correct 6 ms 12236 KB Output is correct
53 Correct 6 ms 12108 KB Output is correct
54 Correct 6 ms 12192 KB Output is correct
55 Correct 7 ms 12108 KB Output is correct
56 Correct 6 ms 12212 KB Output is correct
57 Correct 7 ms 12236 KB Output is correct
58 Correct 6 ms 12108 KB Output is correct
59 Correct 7 ms 12108 KB Output is correct
60 Correct 7 ms 12108 KB Output is correct
61 Correct 6 ms 12132 KB Output is correct
62 Correct 6 ms 12108 KB Output is correct
63 Correct 7 ms 12108 KB Output is correct
64 Correct 7 ms 12556 KB Output is correct
65 Correct 8 ms 12528 KB Output is correct
66 Correct 8 ms 12492 KB Output is correct
67 Correct 7 ms 12364 KB Output is correct
68 Correct 7 ms 12364 KB Output is correct
69 Correct 7 ms 12344 KB Output is correct
70 Correct 7 ms 12492 KB Output is correct
71 Correct 7 ms 12384 KB Output is correct
72 Correct 8 ms 12492 KB Output is correct
73 Correct 7 ms 12476 KB Output is correct
74 Correct 7 ms 12364 KB Output is correct
75 Correct 7 ms 12364 KB Output is correct
76 Correct 7 ms 12332 KB Output is correct
77 Correct 7 ms 12364 KB Output is correct
78 Correct 18 ms 15564 KB Output is correct
79 Correct 18 ms 15844 KB Output is correct
80 Correct 16 ms 15544 KB Output is correct
81 Correct 16 ms 15492 KB Output is correct
82 Correct 17 ms 15208 KB Output is correct
83 Correct 11 ms 14796 KB Output is correct
84 Correct 15 ms 15744 KB Output is correct
85 Correct 16 ms 15728 KB Output is correct
86 Correct 16 ms 15948 KB Output is correct
87 Correct 16 ms 15376 KB Output is correct
88 Correct 16 ms 15396 KB Output is correct
89 Correct 16 ms 15284 KB Output is correct
90 Correct 12 ms 15324 KB Output is correct
91 Correct 15 ms 15420 KB Output is correct
92 Correct 330 ms 64904 KB Output is correct
93 Correct 392 ms 64732 KB Output is correct
94 Correct 254 ms 61396 KB Output is correct
95 Correct 188 ms 65972 KB Output is correct
96 Correct 190 ms 65732 KB Output is correct
97 Correct 383 ms 73592 KB Output is correct
98 Correct 345 ms 75676 KB Output is correct
99 Correct 336 ms 64104 KB Output is correct
100 Correct 316 ms 65908 KB Output is correct
101 Correct 305 ms 63880 KB Output is correct
102 Correct 113 ms 54392 KB Output is correct
103 Correct 345 ms 71984 KB Output is correct
104 Correct 359 ms 66296 KB Output is correct
105 Correct 342 ms 68276 KB Output is correct

Subtask #8
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12108 KB Output is correct
2 Correct 6 ms 12108 KB Output is correct
3 Correct 6 ms 12108 KB Output is correct
4 Correct 6 ms 12108 KB Output is correct
5 Correct 6 ms 12108 KB Output is correct
6 Correct 6 ms 12108 KB Output is correct
7 Correct 6 ms 12108 KB Output is correct
8 Correct 6 ms 12108 KB Output is correct
9 Correct 6 ms 12108 KB Output is correct
10 Correct 6 ms 12164 KB Output is correct
11 Correct 7 ms 12164 KB Output is correct
12 Correct 7 ms 12108 KB Output is correct
13 Correct 7 ms 12108 KB Output is correct
14 Correct 6 ms 12108 KB Output is correct
15 Correct 7 ms 12108 KB Output is correct
16 Correct 7 ms 12108 KB Output is correct
17 Correct 6 ms 12160 KB Output is correct
18 Correct 7 ms 12104 KB Output is correct
19 Correct 7 ms 12108 KB Output is correct
20 Correct 7 ms 12044 KB Output is correct
21 Correct 7 ms 12108 KB Output is correct
22 Correct 7 ms 12108 KB Output is correct
23 Correct 7 ms 12108 KB Output is correct
24 Correct 6 ms 12108 KB Output is correct
25 Correct 8 ms 12108 KB Output is correct
26 Correct 7 ms 12108 KB Output is correct
27 Correct 6 ms 12108 KB Output is correct
28 Correct 7 ms 12088 KB Output is correct
29 Correct 6 ms 12108 KB Output is correct
30 Correct 7 ms 12108 KB Output is correct
31 Correct 8 ms 12108 KB Output is correct
32 Correct 6 ms 12108 KB Output is correct
33 Correct 6 ms 12108 KB Output is correct
34 Correct 6 ms 12108 KB Output is correct
35 Correct 6 ms 12128 KB Output is correct
36 Correct 18 ms 15948 KB Output is correct
37 Correct 16 ms 16248 KB Output is correct
38 Correct 17 ms 15564 KB Output is correct
39 Correct 16 ms 15372 KB Output is correct
40 Correct 16 ms 15316 KB Output is correct
41 Correct 13 ms 14796 KB Output is correct
42 Correct 16 ms 16096 KB Output is correct
43 Correct 16 ms 15692 KB Output is correct
44 Correct 16 ms 16100 KB Output is correct
45 Correct 15 ms 15304 KB Output is correct
46 Correct 16 ms 15668 KB Output is correct
47 Correct 17 ms 15180 KB Output is correct
48 Correct 15 ms 15436 KB Output is correct
49 Correct 16 ms 15564 KB Output is correct
50 Correct 6 ms 12128 KB Output is correct
51 Correct 6 ms 12204 KB Output is correct
52 Correct 6 ms 12236 KB Output is correct
53 Correct 6 ms 12108 KB Output is correct
54 Correct 6 ms 12192 KB Output is correct
55 Correct 7 ms 12108 KB Output is correct
56 Correct 6 ms 12212 KB Output is correct
57 Correct 7 ms 12236 KB Output is correct
58 Correct 6 ms 12108 KB Output is correct
59 Correct 7 ms 12108 KB Output is correct
60 Correct 7 ms 12108 KB Output is correct
61 Correct 6 ms 12132 KB Output is correct
62 Correct 6 ms 12108 KB Output is correct
63 Correct 7 ms 12108 KB Output is correct
64 Correct 7 ms 12556 KB Output is correct
65 Correct 8 ms 12528 KB Output is correct
66 Correct 8 ms 12492 KB Output is correct
67 Correct 7 ms 12364 KB Output is correct
68 Correct 7 ms 12364 KB Output is correct
69 Correct 7 ms 12344 KB Output is correct
70 Correct 7 ms 12492 KB Output is correct
71 Correct 7 ms 12384 KB Output is correct
72 Correct 8 ms 12492 KB Output is correct
73 Correct 7 ms 12476 KB Output is correct
74 Correct 7 ms 12364 KB Output is correct
75 Correct 7 ms 12364 KB Output is correct
76 Correct 7 ms 12332 KB Output is correct
77 Correct 7 ms 12364 KB Output is correct
78 Correct 18 ms 15564 KB Output is correct
79 Correct 18 ms 15844 KB Output is correct
80 Correct 16 ms 15544 KB Output is correct
81 Correct 16 ms 15492 KB Output is correct
82 Correct 17 ms 15208 KB Output is correct
83 Correct 11 ms 14796 KB Output is correct
84 Correct 15 ms 15744 KB Output is correct
85 Correct 16 ms 15728 KB Output is correct
86 Correct 16 ms 15948 KB Output is correct
87 Correct 16 ms 15376 KB Output is correct
88 Correct 16 ms 15396 KB Output is correct
89 Correct 16 ms 15284 KB Output is correct
90 Correct 12 ms 15324 KB Output is correct
91 Correct 15 ms 15420 KB Output is correct
92 Correct 330 ms 64904 KB Output is correct
93 Correct 392 ms 64732 KB Output is correct
94 Correct 254 ms 61396 KB Output is correct
95 Correct 188 ms 65972 KB Output is correct
96 Correct 190 ms 65732 KB Output is correct
97 Correct 383 ms 73592 KB Output is correct
98 Correct 345 ms 75676 KB Output is correct
99 Correct 336 ms 64104 KB Output is correct
100 Correct 316 ms 65908 KB Output is correct
101 Correct 305 ms 63880 KB Output is correct
102 Correct 113 ms 54392 KB Output is correct
103 Correct 345 ms 71984 KB Output is correct
104 Correct 359 ms 66296 KB Output is correct
105 Correct 342 ms 68276 KB Output is correct
106 Correct 4653 ms 443684 KB Output is correct
107 Correct 4934 ms 437816 KB Output is correct
108 Correct 6923 ms 347892 KB Output is correct
109 Correct 6808 ms 381836 KB Output is correct
110 Correct 6287 ms 382852 KB Output is correct
111 Correct 1491 ms 326024 KB Output is correct
112 Correct 4560 ms 469800 KB Output is correct
113 Correct 6278 ms 417524 KB Output is correct
114 Correct 6658 ms 424556 KB Output is correct
115 Correct 6762 ms 379312 KB Output is correct
116 Correct 6519 ms 397896 KB Output is correct
117 Correct 4113 ms 399532 KB Output is correct
118 Correct 1590 ms 355856 KB Output is correct
119 Correct 1563 ms 331364 KB Output is correct