oj.uz

답안 #526230

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
526230 2022-02-14T01:49:39 Z mjhmjh1104 Mountains and Valleys (CCO20_day1problem3) C++17
25 / 25
 6516 ms 380036 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#include <cstdio>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;

struct Item {
    int posde;
    int negde;
    int ans;
    Item () {}
    Item (int posde, int negde, int ans): posde(posde), negde(negde), ans(ans) {}
} sp_split[19][500000];

int lt_depth[500000][3], lt_dist[500000][3];

void push(int *v, int x) {
    auto t = min_element(v, v + 3);
    if (x > *t) *t = x;
}

void pop(int *v, int x) {
    *find(v, v + 3, x) = 0;
}

int first(int *v) {
    return *max_element(v, v + 3);
}

int second(int *v) {
    return v[0] + v[1] + v[2] - *min_element(v, v + 3);
}

int n, m;
vector<int> tree[500000], child[500000];
vector<pair<int, int>> adj[500000];
int depth[500000], sp[19][500000], sp_dist[19][500000];
int max_depth[500000], rev_max_depth[500000], dist[500000], rev_dist[500000];
int prev_dist[500000], prev_depth[500000][2];

int dfs_dist(int x) {
    max_depth[x] = 0;
    dist[x] = 0;
    int mx0 = (int)-1e9, mx1 = (int)-1e9;
    for (auto &i: child[x]) {
        int t = dfs_dist(i) + 1;
        max_depth[x] = max(max_depth[x], t);
        if (t > mx0) mx1 = mx0, mx0 = t;
        else if (t > mx1) mx1 = t;
        dist[x] = max(dist[x], dist[i]);
    }
    dist[x] = max(dist[x], mx0 + max(mx1, 0));
    return max_depth[x];
}

void dfs_rev_dist(int x) {
    for (auto &i: child[x]) {
        push(lt_depth[x], max_depth[i] + 1);
        if (prev_depth[x][0] < max_depth[i] + 1) prev_depth[x][1] = prev_depth[x][0], prev_depth[x][0] = max_depth[i] + 1;
        else if (prev_depth[x][1] < max_depth[i] + 1) prev_depth[x][1] = max_depth[i] + 1;
        push(lt_dist[x], dist[i]);
        if (prev_dist[x] < dist[i]) prev_dist[x] = dist[i];
    }
    for (auto &i: child[x]) {
        pop(lt_depth[x], max_depth[i] + 1);
        pop(lt_dist[x], dist[i]);
        rev_dist[i] = max({ rev_max_depth[i] = max(first(lt_depth[x]), rev_max_depth[x]) + 1, second(lt_depth[x]), first(lt_depth[x]) + rev_dist[x]});
        push(lt_depth[x], max_depth[i] + 1);
        push(lt_dist[x], dist[i]);
    }
    for (auto &i: child[x]) dfs_rev_dist(i);
}

void dfs_construct(int x) {
    for (auto &i: child[x]) {
        pop(lt_dist[x], dist[i]);
        sp_dist[0][i] = first(lt_dist[x]);
        push(lt_dist[x], dist[i]);
        pop(lt_depth[x], max_depth[i] + 1);
        int V = first(lt_depth[x]);
        sp_dist[0][i] = max(sp_dist[0][i], second(lt_depth[x]));
        sp_split[0][i].posde = V + depth[x];
        sp_split[0][i].negde = V - depth[x];
        push(lt_depth[x], max_depth[i] + 1);
    }
    for (auto &i: child[x]) dfs_construct(i);
}

void dfs_child(int x, int prev = -1) {
    sp[0][x] = prev;
    for (auto &i: tree[x]) if (i != prev) {
        depth[i] = depth[x] + 1;
        child[x].push_back(i);
        dfs_child(i, x);
    }
}

int A, B;

inline int lca(int u, int v) {
    bool sw = false;
    if (depth[u] < depth[v]) swap(u, v), sw = true;
    int diff = depth[u] - depth[v] - 1;
    if (~diff) {
        for (int t = 18; t >= 0; t--) if (diff >= 1 << t) {
            diff -= 1 << t;
            u = sp[t][u];
        }
        if (sw) B = u;
        else A = u;
        u = sp[0][u];
        if (u == v) return u;
    }
    for (int t = 18; t >= 0; t--) if (sp[t][u] != -1 && sp[t][v] != -1 && sp[t][u] != sp[t][v]) {
        u = sp[t][u];
        v = sp[t][v];
    }
    A = u, B = v;
    if (sw) swap(A, B);
    return sp[0][u];
}

int main() {
    scanf("%d%d", &n, &m);
    while (m--) {
        int x, y, w;
        scanf("%d%d%d", &x, &y, &w);
        if (w == 1) {
            tree[x].push_back(y);
            tree[y].push_back(x);
        } else adj[x].push_back({ y, w });
    }
    for (int i = 0; i < n; i++) prev_dist[i] = prev_depth[i][0] = prev_depth[i][1] = (int)-1e9;
    dfs_child(0);
    dfs_dist(0);
    dfs_rev_dist(0);
    dfs_construct(0);
    for (int t = 1; t < 19; t++) for (int i = 0; i < n; i++) {
        if (sp[t - 1][i] == -1) {
            sp[t][i] = -1;
            sp_dist[t][i] = sp_dist[t - 1][i];
            sp_split[t][i] = sp_split[t - 1][i];
        } else {
            sp[t][i] = sp[t - 1][sp[t - 1][i]];
            sp_dist[t][i] = max(sp_dist[t - 1][i], sp_dist[t - 1][sp[t - 1][i]]);
            sp_split[t][i].ans = max({ sp_split[t - 1][sp[t - 1][i]].ans, sp_split[t - 1][i].ans, sp_split[t - 1][sp[t - 1][i]].posde + sp_split[t - 1][i].negde });
            sp_split[t][i].posde = max(sp_split[t - 1][sp[t - 1][i]].posde, sp_split[t - 1][i].posde);
            sp_split[t][i].negde = max(sp_split[t - 1][sp[t - 1][i]].negde, sp_split[t - 1][i].negde);
        }
    }
    int res = 2 * (n - 1) - dist[0];
    for (int i = 0; i < n; i++) for (auto [ j, w ]: adj[i]) {
        A = B = -1;
        int l = lca(i, j);
        int ds = depth[i] + depth[j] - depth[l] - depth[l];
        int curr = w + 2 * (n - 1) - ds - 1;
        int G = 0, y = 0;
        if (A != -1) pop(lt_depth[l], max_depth[A] + 1);
        if (B != -1) pop(lt_depth[l], max_depth[B] + 1);
        if (A != -1) pop(lt_dist[l], dist[A]);
        if (B != -1) pop(lt_dist[l], dist[B]);
        G = first(lt_depth[l]);
        y = max({ y, G + rev_max_depth[l] - 1, second(lt_depth[l]) - 1, first(lt_dist[l]) - 1 });
        if (A != -1) push(lt_depth[l], max_depth[A] + 1);
        if (B != -1) push(lt_depth[l], max_depth[B] + 1);
        if (A != -1) push(lt_dist[l], dist[A]);
        if (B != -1) push(lt_dist[l], dist[B]);
        Item first = { (int)-1e9, (int)-1e9, (int)-1e9 };
        Item second = { (int)-1e9, (int)-1e9, (int)-1e9 };
        if (i != l) {
            y = max({ y, prev_depth[i][0] + prev_depth[i][1] - 1, prev_dist[i] - 1 });
            first.posde = prev_depth[i][0] + depth[i];
            first.negde = prev_depth[i][0] - depth[i];
        }
        if (j != l) {
            y = max({ y, prev_depth[j][0] + prev_depth[j][1] - 1, prev_dist[j] - 1 });
            second.posde = prev_depth[j][0] + depth[j];
            second.negde = prev_depth[j][0] - depth[j];
        }
        int I = i, J = j;
        for (int t = 18; t >= 0; t--) {
            if (sp[t][I] != -1 && depth[sp[t][I]] > depth[l]) {
                y = max(y, sp_dist[t][I] - 1);
                first.ans = max({ sp_split[t][I].ans, first.ans, sp_split[t][I].posde + first.negde });
                first.posde = max(sp_split[t][I].posde, first.posde);
                first.negde = max(sp_split[t][I].negde, first.negde);
                I = sp[t][I];
            }
            if (sp[t][J] != -1 && depth[sp[t][J]] > depth[l]) {
                y = max(y, sp_dist[t][J] - 1);
                second.ans = max({ sp_split[t][J].ans, second.ans, sp_split[t][J].posde + second.negde });
                second.posde = max(sp_split[t][J].posde, second.posde);
                second.negde = max(sp_split[t][J].negde, second.negde);
                J = sp[t][J];
            }
        }
        int Alt = first.negde + depth[l];
        int Brt = second.negde + depth[l];
        int Lt = max(rev_max_depth[l], G);
        res = min(res, curr - max({ y, Alt + max(Brt, Lt) + 1, max(Alt, Lt) + Brt + 1, first.ans + 1, second.ans + 1, rev_dist[l] - 1 }));
    }
    printf("%d", res);
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:128:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  128 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp:131:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  131 |         scanf("%d%d%d", &x, &y, &w);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 35916 KB Output is correct
2 Correct 19 ms 35996 KB Output is correct
3 Correct 19 ms 35996 KB Output is correct
4 Correct 19 ms 36032 KB Output is correct
5 Correct 20 ms 35892 KB Output is correct
6 Correct 19 ms 35916 KB Output is correct
7 Correct 20 ms 35932 KB Output is correct
8 Correct 20 ms 36032 KB Output is correct
9 Correct 20 ms 35932 KB Output is correct
10 Correct 19 ms 35916 KB Output is correct
11 Correct 20 ms 36060 KB Output is correct
12 Correct 19 ms 35916 KB Output is correct
13 Correct 20 ms 35984 KB Output is correct
14 Correct 20 ms 35948 KB Output is correct
15 Correct 20 ms 35912 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 35916 KB Output is correct
2 Correct 19 ms 35996 KB Output is correct
3 Correct 19 ms 35996 KB Output is correct
4 Correct 19 ms 36032 KB Output is correct
5 Correct 20 ms 35892 KB Output is correct
6 Correct 19 ms 35916 KB Output is correct
7 Correct 20 ms 35932 KB Output is correct
8 Correct 20 ms 36032 KB Output is correct
9 Correct 20 ms 35932 KB Output is correct
10 Correct 19 ms 35916 KB Output is correct
11 Correct 20 ms 36060 KB Output is correct
12 Correct 19 ms 35916 KB Output is correct
13 Correct 20 ms 35984 KB Output is correct
14 Correct 20 ms 35948 KB Output is correct
15 Correct 20 ms 35912 KB Output is correct
16 Correct 19 ms 35916 KB Output is correct
17 Correct 19 ms 36036 KB Output is correct
18 Correct 18 ms 35936 KB Output is correct
19 Correct 19 ms 36016 KB Output is correct
20 Correct 19 ms 35916 KB Output is correct
21 Correct 19 ms 35916 KB Output is correct
22 Correct 20 ms 35972 KB Output is correct
23 Correct 20 ms 35916 KB Output is correct
24 Correct 22 ms 35916 KB Output is correct
25 Correct 23 ms 35956 KB Output is correct
26 Correct 20 ms 35956 KB Output is correct
27 Correct 19 ms 35908 KB Output is correct
28 Correct 19 ms 36032 KB Output is correct
29 Correct 19 ms 35916 KB Output is correct
30 Correct 19 ms 35916 KB Output is correct
31 Correct 19 ms 35916 KB Output is correct
32 Correct 19 ms 35916 KB Output is correct
33 Correct 18 ms 35984 KB Output is correct
34 Correct 19 ms 36028 KB Output is correct
35 Correct 19 ms 35988 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 39024 KB Output is correct
2 Correct 27 ms 39196 KB Output is correct
3 Correct 28 ms 38852 KB Output is correct
4 Correct 33 ms 38732 KB Output is correct
5 Correct 30 ms 38780 KB Output is correct
6 Correct 26 ms 38336 KB Output is correct
7 Correct 28 ms 39180 KB Output is correct
8 Correct 27 ms 38916 KB Output is correct
9 Correct 27 ms 39116 KB Output is correct
10 Correct 28 ms 38804 KB Output is correct
11 Correct 27 ms 38996 KB Output is correct
12 Correct 26 ms 38604 KB Output is correct
13 Correct 28 ms 38828 KB Output is correct
14 Correct 27 ms 38860 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 35916 KB Output is correct
2 Correct 19 ms 35996 KB Output is correct
3 Correct 19 ms 35996 KB Output is correct
4 Correct 19 ms 36032 KB Output is correct
5 Correct 20 ms 35892 KB Output is correct
6 Correct 19 ms 35916 KB Output is correct
7 Correct 20 ms 35932 KB Output is correct
8 Correct 20 ms 36032 KB Output is correct
9 Correct 20 ms 35932 KB Output is correct
10 Correct 19 ms 35916 KB Output is correct
11 Correct 20 ms 36060 KB Output is correct
12 Correct 19 ms 35916 KB Output is correct
13 Correct 20 ms 35984 KB Output is correct
14 Correct 20 ms 35948 KB Output is correct
15 Correct 20 ms 35912 KB Output is correct
16 Correct 19 ms 35916 KB Output is correct
17 Correct 19 ms 36036 KB Output is correct
18 Correct 18 ms 35936 KB Output is correct
19 Correct 19 ms 36016 KB Output is correct
20 Correct 19 ms 35916 KB Output is correct
21 Correct 19 ms 35916 KB Output is correct
22 Correct 20 ms 35972 KB Output is correct
23 Correct 20 ms 35916 KB Output is correct
24 Correct 22 ms 35916 KB Output is correct
25 Correct 23 ms 35956 KB Output is correct
26 Correct 20 ms 35956 KB Output is correct
27 Correct 19 ms 35908 KB Output is correct
28 Correct 19 ms 36032 KB Output is correct
29 Correct 19 ms 35916 KB Output is correct
30 Correct 19 ms 35916 KB Output is correct
31 Correct 19 ms 35916 KB Output is correct
32 Correct 19 ms 35916 KB Output is correct
33 Correct 18 ms 35984 KB Output is correct
34 Correct 19 ms 36028 KB Output is correct
35 Correct 19 ms 35988 KB Output is correct
36 Correct 19 ms 35972 KB Output is correct
37 Correct 19 ms 35984 KB Output is correct
38 Correct 19 ms 36080 KB Output is correct
39 Correct 19 ms 36044 KB Output is correct
40 Correct 21 ms 36024 KB Output is correct
41 Correct 20 ms 36044 KB Output is correct
42 Correct 20 ms 36088 KB Output is correct
43 Correct 20 ms 35980 KB Output is correct
44 Correct 19 ms 36000 KB Output is correct
45 Correct 20 ms 35972 KB Output is correct
46 Correct 20 ms 36044 KB Output is correct
47 Correct 20 ms 36032 KB Output is correct
48 Correct 20 ms 36044 KB Output is correct
49 Correct 21 ms 36044 KB Output is correct

Subtask #5
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 35916 KB Output is correct
2 Correct 19 ms 35996 KB Output is correct
3 Correct 19 ms 35996 KB Output is correct
4 Correct 19 ms 36032 KB Output is correct
5 Correct 20 ms 35892 KB Output is correct
6 Correct 19 ms 35916 KB Output is correct
7 Correct 20 ms 35932 KB Output is correct
8 Correct 20 ms 36032 KB Output is correct
9 Correct 20 ms 35932 KB Output is correct
10 Correct 19 ms 35916 KB Output is correct
11 Correct 20 ms 36060 KB Output is correct
12 Correct 19 ms 35916 KB Output is correct
13 Correct 20 ms 35984 KB Output is correct
14 Correct 20 ms 35948 KB Output is correct
15 Correct 20 ms 35912 KB Output is correct
16 Correct 19 ms 35916 KB Output is correct
17 Correct 19 ms 36036 KB Output is correct
18 Correct 18 ms 35936 KB Output is correct
19 Correct 19 ms 36016 KB Output is correct
20 Correct 19 ms 35916 KB Output is correct
21 Correct 19 ms 35916 KB Output is correct
22 Correct 20 ms 35972 KB Output is correct
23 Correct 20 ms 35916 KB Output is correct
24 Correct 22 ms 35916 KB Output is correct
25 Correct 23 ms 35956 KB Output is correct
26 Correct 20 ms 35956 KB Output is correct
27 Correct 19 ms 35908 KB Output is correct
28 Correct 19 ms 36032 KB Output is correct
29 Correct 19 ms 35916 KB Output is correct
30 Correct 19 ms 35916 KB Output is correct
31 Correct 19 ms 35916 KB Output is correct
32 Correct 19 ms 35916 KB Output is correct
33 Correct 18 ms 35984 KB Output is correct
34 Correct 19 ms 36028 KB Output is correct
35 Correct 19 ms 35988 KB Output is correct
36 Correct 19 ms 35972 KB Output is correct
37 Correct 19 ms 35984 KB Output is correct
38 Correct 19 ms 36080 KB Output is correct
39 Correct 19 ms 36044 KB Output is correct
40 Correct 21 ms 36024 KB Output is correct
41 Correct 20 ms 36044 KB Output is correct
42 Correct 20 ms 36088 KB Output is correct
43 Correct 20 ms 35980 KB Output is correct
44 Correct 19 ms 36000 KB Output is correct
45 Correct 20 ms 35972 KB Output is correct
46 Correct 20 ms 36044 KB Output is correct
47 Correct 20 ms 36032 KB Output is correct
48 Correct 20 ms 36044 KB Output is correct
49 Correct 21 ms 36044 KB Output is correct
50 Correct 20 ms 36304 KB Output is correct
51 Correct 20 ms 36332 KB Output is correct
52 Correct 20 ms 36316 KB Output is correct
53 Correct 21 ms 36300 KB Output is correct
54 Correct 20 ms 36172 KB Output is correct
55 Correct 20 ms 36180 KB Output is correct
56 Correct 19 ms 36300 KB Output is correct
57 Correct 19 ms 36296 KB Output is correct
58 Correct 20 ms 36300 KB Output is correct
59 Correct 20 ms 36216 KB Output is correct
60 Correct 21 ms 36180 KB Output is correct
61 Correct 20 ms 36300 KB Output is correct
62 Correct 20 ms 36280 KB Output is correct
63 Correct 19 ms 36252 KB Output is correct

Subtask #6
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 35916 KB Output is correct
2 Correct 19 ms 35996 KB Output is correct
3 Correct 19 ms 35996 KB Output is correct
4 Correct 19 ms 36032 KB Output is correct
5 Correct 20 ms 35892 KB Output is correct
6 Correct 19 ms 35916 KB Output is correct
7 Correct 20 ms 35932 KB Output is correct
8 Correct 20 ms 36032 KB Output is correct
9 Correct 20 ms 35932 KB Output is correct
10 Correct 19 ms 35916 KB Output is correct
11 Correct 20 ms 36060 KB Output is correct
12 Correct 19 ms 35916 KB Output is correct
13 Correct 20 ms 35984 KB Output is correct
14 Correct 20 ms 35948 KB Output is correct
15 Correct 20 ms 35912 KB Output is correct
16 Correct 19 ms 35916 KB Output is correct
17 Correct 19 ms 36036 KB Output is correct
18 Correct 18 ms 35936 KB Output is correct
19 Correct 19 ms 36016 KB Output is correct
20 Correct 19 ms 35916 KB Output is correct
21 Correct 19 ms 35916 KB Output is correct
22 Correct 20 ms 35972 KB Output is correct
23 Correct 20 ms 35916 KB Output is correct
24 Correct 22 ms 35916 KB Output is correct
25 Correct 23 ms 35956 KB Output is correct
26 Correct 20 ms 35956 KB Output is correct
27 Correct 19 ms 35908 KB Output is correct
28 Correct 19 ms 36032 KB Output is correct
29 Correct 19 ms 35916 KB Output is correct
30 Correct 19 ms 35916 KB Output is correct
31 Correct 19 ms 35916 KB Output is correct
32 Correct 19 ms 35916 KB Output is correct
33 Correct 18 ms 35984 KB Output is correct
34 Correct 19 ms 36028 KB Output is correct
35 Correct 19 ms 35988 KB Output is correct
36 Correct 27 ms 39024 KB Output is correct
37 Correct 27 ms 39196 KB Output is correct
38 Correct 28 ms 38852 KB Output is correct
39 Correct 33 ms 38732 KB Output is correct
40 Correct 30 ms 38780 KB Output is correct
41 Correct 26 ms 38336 KB Output is correct
42 Correct 28 ms 39180 KB Output is correct
43 Correct 27 ms 38916 KB Output is correct
44 Correct 27 ms 39116 KB Output is correct
45 Correct 28 ms 38804 KB Output is correct
46 Correct 27 ms 38996 KB Output is correct
47 Correct 26 ms 38604 KB Output is correct
48 Correct 28 ms 38828 KB Output is correct
49 Correct 27 ms 38860 KB Output is correct
50 Correct 19 ms 35972 KB Output is correct
51 Correct 19 ms 35984 KB Output is correct
52 Correct 19 ms 36080 KB Output is correct
53 Correct 19 ms 36044 KB Output is correct
54 Correct 21 ms 36024 KB Output is correct
55 Correct 20 ms 36044 KB Output is correct
56 Correct 20 ms 36088 KB Output is correct
57 Correct 20 ms 35980 KB Output is correct
58 Correct 19 ms 36000 KB Output is correct
59 Correct 20 ms 35972 KB Output is correct
60 Correct 20 ms 36044 KB Output is correct
61 Correct 20 ms 36032 KB Output is correct
62 Correct 20 ms 36044 KB Output is correct
63 Correct 21 ms 36044 KB Output is correct
64 Correct 20 ms 36304 KB Output is correct
65 Correct 20 ms 36332 KB Output is correct
66 Correct 20 ms 36316 KB Output is correct
67 Correct 21 ms 36300 KB Output is correct
68 Correct 20 ms 36172 KB Output is correct
69 Correct 20 ms 36180 KB Output is correct
70 Correct 19 ms 36300 KB Output is correct
71 Correct 19 ms 36296 KB Output is correct
72 Correct 20 ms 36300 KB Output is correct
73 Correct 20 ms 36216 KB Output is correct
74 Correct 21 ms 36180 KB Output is correct
75 Correct 20 ms 36300 KB Output is correct
76 Correct 20 ms 36280 KB Output is correct
77 Correct 19 ms 36252 KB Output is correct
78 Correct 27 ms 38988 KB Output is correct
79 Correct 26 ms 38960 KB Output is correct
80 Correct 26 ms 38800 KB Output is correct
81 Correct 36 ms 38808 KB Output is correct
82 Correct 27 ms 38684 KB Output is correct
83 Correct 25 ms 38388 KB Output is correct
84 Correct 27 ms 39004 KB Output is correct
85 Correct 27 ms 38988 KB Output is correct
86 Correct 28 ms 39016 KB Output is correct
87 Correct 27 ms 38824 KB Output is correct
88 Correct 27 ms 38816 KB Output is correct
89 Correct 26 ms 38772 KB Output is correct
90 Correct 24 ms 38732 KB Output is correct
91 Correct 24 ms 38836 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 35916 KB Output is correct
2 Correct 19 ms 35996 KB Output is correct
3 Correct 19 ms 35996 KB Output is correct
4 Correct 19 ms 36032 KB Output is correct
5 Correct 20 ms 35892 KB Output is correct
6 Correct 19 ms 35916 KB Output is correct
7 Correct 20 ms 35932 KB Output is correct
8 Correct 20 ms 36032 KB Output is correct
9 Correct 20 ms 35932 KB Output is correct
10 Correct 19 ms 35916 KB Output is correct
11 Correct 20 ms 36060 KB Output is correct
12 Correct 19 ms 35916 KB Output is correct
13 Correct 20 ms 35984 KB Output is correct
14 Correct 20 ms 35948 KB Output is correct
15 Correct 20 ms 35912 KB Output is correct
16 Correct 19 ms 35916 KB Output is correct
17 Correct 19 ms 36036 KB Output is correct
18 Correct 18 ms 35936 KB Output is correct
19 Correct 19 ms 36016 KB Output is correct
20 Correct 19 ms 35916 KB Output is correct
21 Correct 19 ms 35916 KB Output is correct
22 Correct 20 ms 35972 KB Output is correct
23 Correct 20 ms 35916 KB Output is correct
24 Correct 22 ms 35916 KB Output is correct
25 Correct 23 ms 35956 KB Output is correct
26 Correct 20 ms 35956 KB Output is correct
27 Correct 19 ms 35908 KB Output is correct
28 Correct 19 ms 36032 KB Output is correct
29 Correct 19 ms 35916 KB Output is correct
30 Correct 19 ms 35916 KB Output is correct
31 Correct 19 ms 35916 KB Output is correct
32 Correct 19 ms 35916 KB Output is correct
33 Correct 18 ms 35984 KB Output is correct
34 Correct 19 ms 36028 KB Output is correct
35 Correct 19 ms 35988 KB Output is correct
36 Correct 27 ms 39024 KB Output is correct
37 Correct 27 ms 39196 KB Output is correct
38 Correct 28 ms 38852 KB Output is correct
39 Correct 33 ms 38732 KB Output is correct
40 Correct 30 ms 38780 KB Output is correct
41 Correct 26 ms 38336 KB Output is correct
42 Correct 28 ms 39180 KB Output is correct
43 Correct 27 ms 38916 KB Output is correct
44 Correct 27 ms 39116 KB Output is correct
45 Correct 28 ms 38804 KB Output is correct
46 Correct 27 ms 38996 KB Output is correct
47 Correct 26 ms 38604 KB Output is correct
48 Correct 28 ms 38828 KB Output is correct
49 Correct 27 ms 38860 KB Output is correct
50 Correct 19 ms 35972 KB Output is correct
51 Correct 19 ms 35984 KB Output is correct
52 Correct 19 ms 36080 KB Output is correct
53 Correct 19 ms 36044 KB Output is correct
54 Correct 21 ms 36024 KB Output is correct
55 Correct 20 ms 36044 KB Output is correct
56 Correct 20 ms 36088 KB Output is correct
57 Correct 20 ms 35980 KB Output is correct
58 Correct 19 ms 36000 KB Output is correct
59 Correct 20 ms 35972 KB Output is correct
60 Correct 20 ms 36044 KB Output is correct
61 Correct 20 ms 36032 KB Output is correct
62 Correct 20 ms 36044 KB Output is correct
63 Correct 21 ms 36044 KB Output is correct
64 Correct 20 ms 36304 KB Output is correct
65 Correct 20 ms 36332 KB Output is correct
66 Correct 20 ms 36316 KB Output is correct
67 Correct 21 ms 36300 KB Output is correct
68 Correct 20 ms 36172 KB Output is correct
69 Correct 20 ms 36180 KB Output is correct
70 Correct 19 ms 36300 KB Output is correct
71 Correct 19 ms 36296 KB Output is correct
72 Correct 20 ms 36300 KB Output is correct
73 Correct 20 ms 36216 KB Output is correct
74 Correct 21 ms 36180 KB Output is correct
75 Correct 20 ms 36300 KB Output is correct
76 Correct 20 ms 36280 KB Output is correct
77 Correct 19 ms 36252 KB Output is correct
78 Correct 27 ms 38988 KB Output is correct
79 Correct 26 ms 38960 KB Output is correct
80 Correct 26 ms 38800 KB Output is correct
81 Correct 36 ms 38808 KB Output is correct
82 Correct 27 ms 38684 KB Output is correct
83 Correct 25 ms 38388 KB Output is correct
84 Correct 27 ms 39004 KB Output is correct
85 Correct 27 ms 38988 KB Output is correct
86 Correct 28 ms 39016 KB Output is correct
87 Correct 27 ms 38824 KB Output is correct
88 Correct 27 ms 38816 KB Output is correct
89 Correct 26 ms 38772 KB Output is correct
90 Correct 24 ms 38732 KB Output is correct
91 Correct 24 ms 38836 KB Output is correct
92 Correct 260 ms 81616 KB Output is correct
93 Correct 245 ms 81452 KB Output is correct
94 Correct 179 ms 79580 KB Output is correct
95 Correct 123 ms 81492 KB Output is correct
96 Correct 133 ms 81452 KB Output is correct
97 Correct 266 ms 86340 KB Output is correct
98 Correct 248 ms 87180 KB Output is correct
99 Correct 263 ms 81236 KB Output is correct
100 Correct 240 ms 81988 KB Output is correct
101 Correct 245 ms 80964 KB Output is correct
102 Correct 128 ms 73148 KB Output is correct
103 Correct 243 ms 85188 KB Output is correct
104 Correct 239 ms 81416 KB Output is correct
105 Correct 258 ms 82924 KB Output is correct

Subtask #8
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 35916 KB Output is correct
2 Correct 19 ms 35996 KB Output is correct
3 Correct 19 ms 35996 KB Output is correct
4 Correct 19 ms 36032 KB Output is correct
5 Correct 20 ms 35892 KB Output is correct
6 Correct 19 ms 35916 KB Output is correct
7 Correct 20 ms 35932 KB Output is correct
8 Correct 20 ms 36032 KB Output is correct
9 Correct 20 ms 35932 KB Output is correct
10 Correct 19 ms 35916 KB Output is correct
11 Correct 20 ms 36060 KB Output is correct
12 Correct 19 ms 35916 KB Output is correct
13 Correct 20 ms 35984 KB Output is correct
14 Correct 20 ms 35948 KB Output is correct
15 Correct 20 ms 35912 KB Output is correct
16 Correct 19 ms 35916 KB Output is correct
17 Correct 19 ms 36036 KB Output is correct
18 Correct 18 ms 35936 KB Output is correct
19 Correct 19 ms 36016 KB Output is correct
20 Correct 19 ms 35916 KB Output is correct
21 Correct 19 ms 35916 KB Output is correct
22 Correct 20 ms 35972 KB Output is correct
23 Correct 20 ms 35916 KB Output is correct
24 Correct 22 ms 35916 KB Output is correct
25 Correct 23 ms 35956 KB Output is correct
26 Correct 20 ms 35956 KB Output is correct
27 Correct 19 ms 35908 KB Output is correct
28 Correct 19 ms 36032 KB Output is correct
29 Correct 19 ms 35916 KB Output is correct
30 Correct 19 ms 35916 KB Output is correct
31 Correct 19 ms 35916 KB Output is correct
32 Correct 19 ms 35916 KB Output is correct
33 Correct 18 ms 35984 KB Output is correct
34 Correct 19 ms 36028 KB Output is correct
35 Correct 19 ms 35988 KB Output is correct
36 Correct 27 ms 39024 KB Output is correct
37 Correct 27 ms 39196 KB Output is correct
38 Correct 28 ms 38852 KB Output is correct
39 Correct 33 ms 38732 KB Output is correct
40 Correct 30 ms 38780 KB Output is correct
41 Correct 26 ms 38336 KB Output is correct
42 Correct 28 ms 39180 KB Output is correct
43 Correct 27 ms 38916 KB Output is correct
44 Correct 27 ms 39116 KB Output is correct
45 Correct 28 ms 38804 KB Output is correct
46 Correct 27 ms 38996 KB Output is correct
47 Correct 26 ms 38604 KB Output is correct
48 Correct 28 ms 38828 KB Output is correct
49 Correct 27 ms 38860 KB Output is correct
50 Correct 19 ms 35972 KB Output is correct
51 Correct 19 ms 35984 KB Output is correct
52 Correct 19 ms 36080 KB Output is correct
53 Correct 19 ms 36044 KB Output is correct
54 Correct 21 ms 36024 KB Output is correct
55 Correct 20 ms 36044 KB Output is correct
56 Correct 20 ms 36088 KB Output is correct
57 Correct 20 ms 35980 KB Output is correct
58 Correct 19 ms 36000 KB Output is correct
59 Correct 20 ms 35972 KB Output is correct
60 Correct 20 ms 36044 KB Output is correct
61 Correct 20 ms 36032 KB Output is correct
62 Correct 20 ms 36044 KB Output is correct
63 Correct 21 ms 36044 KB Output is correct
64 Correct 20 ms 36304 KB Output is correct
65 Correct 20 ms 36332 KB Output is correct
66 Correct 20 ms 36316 KB Output is correct
67 Correct 21 ms 36300 KB Output is correct
68 Correct 20 ms 36172 KB Output is correct
69 Correct 20 ms 36180 KB Output is correct
70 Correct 19 ms 36300 KB Output is correct
71 Correct 19 ms 36296 KB Output is correct
72 Correct 20 ms 36300 KB Output is correct
73 Correct 20 ms 36216 KB Output is correct
74 Correct 21 ms 36180 KB Output is correct
75 Correct 20 ms 36300 KB Output is correct
76 Correct 20 ms 36280 KB Output is correct
77 Correct 19 ms 36252 KB Output is correct
78 Correct 27 ms 38988 KB Output is correct
79 Correct 26 ms 38960 KB Output is correct
80 Correct 26 ms 38800 KB Output is correct
81 Correct 36 ms 38808 KB Output is correct
82 Correct 27 ms 38684 KB Output is correct
83 Correct 25 ms 38388 KB Output is correct
84 Correct 27 ms 39004 KB Output is correct
85 Correct 27 ms 38988 KB Output is correct
86 Correct 28 ms 39016 KB Output is correct
87 Correct 27 ms 38824 KB Output is correct
88 Correct 27 ms 38816 KB Output is correct
89 Correct 26 ms 38772 KB Output is correct
90 Correct 24 ms 38732 KB Output is correct
91 Correct 24 ms 38836 KB Output is correct
92 Correct 260 ms 81616 KB Output is correct
93 Correct 245 ms 81452 KB Output is correct
94 Correct 179 ms 79580 KB Output is correct
95 Correct 123 ms 81492 KB Output is correct
96 Correct 133 ms 81452 KB Output is correct
97 Correct 266 ms 86340 KB Output is correct
98 Correct 248 ms 87180 KB Output is correct
99 Correct 263 ms 81236 KB Output is correct
100 Correct 240 ms 81988 KB Output is correct
101 Correct 245 ms 80964 KB Output is correct
102 Correct 128 ms 73148 KB Output is correct
103 Correct 243 ms 85188 KB Output is correct
104 Correct 239 ms 81416 KB Output is correct
105 Correct 258 ms 82924 KB Output is correct
106 Correct 5618 ms 380036 KB Output is correct
107 Correct 5805 ms 378140 KB Output is correct
108 Correct 6516 ms 332752 KB Output is correct
109 Correct 6397 ms 329640 KB Output is correct
110 Correct 6002 ms 328996 KB Output is correct
111 Correct 2060 ms 280144 KB Output is correct
112 Correct 5367 ms 372736 KB Output is correct
113 Correct 5806 ms 341308 KB Output is correct
114 Correct 5715 ms 346872 KB Output is correct
115 Correct 6269 ms 327984 KB Output is correct
116 Correct 6480 ms 338056 KB Output is correct
117 Correct 3905 ms 334008 KB Output is correct
118 Correct 1433 ms 320268 KB Output is correct
119 Correct 1391 ms 307908 KB Output is correct