oj.uz

답안 #526217

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
526217 2022-02-14T01:11:51 Z mjhmjh1104 Mountains and Valleys (CCO20_day1problem3) C++17
21 / 25
 7000 ms 380284 KB 
#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];

inline Item query_sp_res(int l, int x) {
    if (l == x) return Item{ (int)-1e9, (int)-1e9, (int)-1e9 };
    Item ret = { prev_depth[x][0] + depth[x], prev_depth[x][0] - depth[x], (int)-1e9 };
    if (l == sp[0][x]) return ret;
    for (int t = 18; t >= 0; t--) if (sp[t][x] != -1 && depth[sp[t][x]] > depth[l]) {
        ret.ans = max({ sp_split[t][x].ans, ret.ans, sp_split[t][x].posde + ret.negde });
        ret.posde = max(sp_split[t][x].posde, ret.posde);
        ret.negde = max(sp_split[t][x].negde, ret.negde);
        x = sp[t][x];
    }
    return ret;
}

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];
}

inline int query_sp_dist(int u, int v, int l) {
    int ret = 0;
    if (u != l) {
        ret = max(prev_depth[u][0] + prev_depth[u][1], prev_dist[u]);
        u = sp[0][u];
    }
    if (v != l) {
        ret = max(prev_depth[v][0] + prev_depth[v][1], prev_dist[v]);
        v = sp[0][v];
    }
    for (int t = 18; t >= 0; t--) if (sp[t][u] != -1 && depth[sp[t][u]] > depth[l]) {
        ret = max(ret, sp_dist[t][u]);
        u = sp[t][u];
    }
    for (int t = 18; t >= 0; t--) if (sp[t][v] != -1 && depth[sp[t][v]] > depth[l]) {
        ret = max(ret, sp_dist[t][v]);
        v = sp[t][v];
    }
    return ret;
}

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 = query_sp_res(l, i);
        Item second = query_sp_res(l, 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, query_sp_dist(i, j, l) - 1 }));
    }
    printf("%d", res);
}

Compilation message

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

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 35912 KB Output is correct
2 Correct 18 ms 36036 KB Output is correct
3 Correct 19 ms 35956 KB Output is correct
4 Correct 21 ms 36000 KB Output is correct
5 Correct 19 ms 35916 KB Output is correct
6 Correct 19 ms 35944 KB Output is correct
7 Correct 18 ms 35940 KB Output is correct
8 Correct 18 ms 35916 KB Output is correct
9 Correct 18 ms 36036 KB Output is correct
10 Correct 18 ms 35952 KB Output is correct
11 Correct 17 ms 36004 KB Output is correct
12 Correct 16 ms 35916 KB Output is correct
13 Correct 17 ms 35916 KB Output is correct
14 Correct 18 ms 36036 KB Output is correct
15 Correct 17 ms 35916 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 35912 KB Output is correct
2 Correct 18 ms 36036 KB Output is correct
3 Correct 19 ms 35956 KB Output is correct
4 Correct 21 ms 36000 KB Output is correct
5 Correct 19 ms 35916 KB Output is correct
6 Correct 19 ms 35944 KB Output is correct
7 Correct 18 ms 35940 KB Output is correct
8 Correct 18 ms 35916 KB Output is correct
9 Correct 18 ms 36036 KB Output is correct
10 Correct 18 ms 35952 KB Output is correct
11 Correct 17 ms 36004 KB Output is correct
12 Correct 16 ms 35916 KB Output is correct
13 Correct 17 ms 35916 KB Output is correct
14 Correct 18 ms 36036 KB Output is correct
15 Correct 17 ms 35916 KB Output is correct
16 Correct 21 ms 36024 KB Output is correct
17 Correct 18 ms 35968 KB Output is correct
18 Correct 19 ms 35964 KB Output is correct
19 Correct 21 ms 35972 KB Output is correct
20 Correct 23 ms 36016 KB Output is correct
21 Correct 18 ms 35916 KB Output is correct
22 Correct 18 ms 35952 KB Output is correct
23 Correct 18 ms 35916 KB Output is correct
24 Correct 18 ms 35908 KB Output is correct
25 Correct 18 ms 35952 KB Output is correct
26 Correct 20 ms 35948 KB Output is correct
27 Correct 18 ms 36036 KB Output is correct
28 Correct 18 ms 36036 KB Output is correct
29 Correct 17 ms 36044 KB Output is correct
30 Correct 20 ms 36032 KB Output is correct
31 Correct 17 ms 36008 KB Output is correct
32 Correct 17 ms 35916 KB Output is correct
33 Correct 19 ms 35896 KB Output is correct
34 Correct 18 ms 35996 KB Output is correct
35 Correct 18 ms 35980 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 39356 KB Output is correct
2 Correct 31 ms 39392 KB Output is correct
3 Correct 29 ms 38980 KB Output is correct
4 Correct 28 ms 38860 KB Output is correct
5 Correct 28 ms 38860 KB Output is correct
6 Correct 24 ms 38404 KB Output is correct
7 Correct 27 ms 39244 KB Output is correct
8 Correct 27 ms 38968 KB Output is correct
9 Correct 26 ms 39216 KB Output is correct
10 Correct 27 ms 38868 KB Output is correct
11 Correct 28 ms 39108 KB Output is correct
12 Correct 26 ms 38732 KB Output is correct
13 Correct 30 ms 38900 KB Output is correct
14 Correct 28 ms 38992 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 35912 KB Output is correct
2 Correct 18 ms 36036 KB Output is correct
3 Correct 19 ms 35956 KB Output is correct
4 Correct 21 ms 36000 KB Output is correct
5 Correct 19 ms 35916 KB Output is correct
6 Correct 19 ms 35944 KB Output is correct
7 Correct 18 ms 35940 KB Output is correct
8 Correct 18 ms 35916 KB Output is correct
9 Correct 18 ms 36036 KB Output is correct
10 Correct 18 ms 35952 KB Output is correct
11 Correct 17 ms 36004 KB Output is correct
12 Correct 16 ms 35916 KB Output is correct
13 Correct 17 ms 35916 KB Output is correct
14 Correct 18 ms 36036 KB Output is correct
15 Correct 17 ms 35916 KB Output is correct
16 Correct 21 ms 36024 KB Output is correct
17 Correct 18 ms 35968 KB Output is correct
18 Correct 19 ms 35964 KB Output is correct
19 Correct 21 ms 35972 KB Output is correct
20 Correct 23 ms 36016 KB Output is correct
21 Correct 18 ms 35916 KB Output is correct
22 Correct 18 ms 35952 KB Output is correct
23 Correct 18 ms 35916 KB Output is correct
24 Correct 18 ms 35908 KB Output is correct
25 Correct 18 ms 35952 KB Output is correct
26 Correct 20 ms 35948 KB Output is correct
27 Correct 18 ms 36036 KB Output is correct
28 Correct 18 ms 36036 KB Output is correct
29 Correct 17 ms 36044 KB Output is correct
30 Correct 20 ms 36032 KB Output is correct
31 Correct 17 ms 36008 KB Output is correct
32 Correct 17 ms 35916 KB Output is correct
33 Correct 19 ms 35896 KB Output is correct
34 Correct 18 ms 35996 KB Output is correct
35 Correct 18 ms 35980 KB Output is correct
36 Correct 18 ms 36044 KB Output is correct
37 Correct 18 ms 36064 KB Output is correct
38 Correct 17 ms 36000 KB Output is correct
39 Correct 17 ms 36044 KB Output is correct
40 Correct 19 ms 35944 KB Output is correct
41 Correct 22 ms 36044 KB Output is correct
42 Correct 19 ms 36044 KB Output is correct
43 Correct 18 ms 36084 KB Output is correct
44 Correct 23 ms 35996 KB Output is correct
45 Correct 18 ms 36044 KB Output is correct
46 Correct 19 ms 36076 KB Output is correct
47 Correct 18 ms 35968 KB Output is correct
48 Correct 18 ms 36020 KB Output is correct
49 Correct 18 ms 36044 KB Output is correct

Subtask #5
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 35912 KB Output is correct
2 Correct 18 ms 36036 KB Output is correct
3 Correct 19 ms 35956 KB Output is correct
4 Correct 21 ms 36000 KB Output is correct
5 Correct 19 ms 35916 KB Output is correct
6 Correct 19 ms 35944 KB Output is correct
7 Correct 18 ms 35940 KB Output is correct
8 Correct 18 ms 35916 KB Output is correct
9 Correct 18 ms 36036 KB Output is correct
10 Correct 18 ms 35952 KB Output is correct
11 Correct 17 ms 36004 KB Output is correct
12 Correct 16 ms 35916 KB Output is correct
13 Correct 17 ms 35916 KB Output is correct
14 Correct 18 ms 36036 KB Output is correct
15 Correct 17 ms 35916 KB Output is correct
16 Correct 21 ms 36024 KB Output is correct
17 Correct 18 ms 35968 KB Output is correct
18 Correct 19 ms 35964 KB Output is correct
19 Correct 21 ms 35972 KB Output is correct
20 Correct 23 ms 36016 KB Output is correct
21 Correct 18 ms 35916 KB Output is correct
22 Correct 18 ms 35952 KB Output is correct
23 Correct 18 ms 35916 KB Output is correct
24 Correct 18 ms 35908 KB Output is correct
25 Correct 18 ms 35952 KB Output is correct
26 Correct 20 ms 35948 KB Output is correct
27 Correct 18 ms 36036 KB Output is correct
28 Correct 18 ms 36036 KB Output is correct
29 Correct 17 ms 36044 KB Output is correct
30 Correct 20 ms 36032 KB Output is correct
31 Correct 17 ms 36008 KB Output is correct
32 Correct 17 ms 35916 KB Output is correct
33 Correct 19 ms 35896 KB Output is correct
34 Correct 18 ms 35996 KB Output is correct
35 Correct 18 ms 35980 KB Output is correct
36 Correct 18 ms 36044 KB Output is correct
37 Correct 18 ms 36064 KB Output is correct
38 Correct 17 ms 36000 KB Output is correct
39 Correct 17 ms 36044 KB Output is correct
40 Correct 19 ms 35944 KB Output is correct
41 Correct 22 ms 36044 KB Output is correct
42 Correct 19 ms 36044 KB Output is correct
43 Correct 18 ms 36084 KB Output is correct
44 Correct 23 ms 35996 KB Output is correct
45 Correct 18 ms 36044 KB Output is correct
46 Correct 19 ms 36076 KB Output is correct
47 Correct 18 ms 35968 KB Output is correct
48 Correct 18 ms 36020 KB Output is correct
49 Correct 18 ms 36044 KB Output is correct
50 Correct 21 ms 36296 KB Output is correct
51 Correct 18 ms 36280 KB Output is correct
52 Correct 18 ms 36276 KB Output is correct
53 Correct 21 ms 36296 KB Output is correct
54 Correct 20 ms 36296 KB Output is correct
55 Correct 18 ms 36164 KB Output is correct
56 Correct 19 ms 36300 KB Output is correct
57 Correct 19 ms 36428 KB Output is correct
58 Correct 18 ms 36300 KB Output is correct
59 Correct 19 ms 36312 KB Output is correct
60 Correct 19 ms 36320 KB Output is correct
61 Correct 19 ms 36400 KB Output is correct
62 Correct 19 ms 36164 KB Output is correct
63 Correct 19 ms 36300 KB Output is correct

Subtask #6
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 35912 KB Output is correct
2 Correct 18 ms 36036 KB Output is correct
3 Correct 19 ms 35956 KB Output is correct
4 Correct 21 ms 36000 KB Output is correct
5 Correct 19 ms 35916 KB Output is correct
6 Correct 19 ms 35944 KB Output is correct
7 Correct 18 ms 35940 KB Output is correct
8 Correct 18 ms 35916 KB Output is correct
9 Correct 18 ms 36036 KB Output is correct
10 Correct 18 ms 35952 KB Output is correct
11 Correct 17 ms 36004 KB Output is correct
12 Correct 16 ms 35916 KB Output is correct
13 Correct 17 ms 35916 KB Output is correct
14 Correct 18 ms 36036 KB Output is correct
15 Correct 17 ms 35916 KB Output is correct
16 Correct 21 ms 36024 KB Output is correct
17 Correct 18 ms 35968 KB Output is correct
18 Correct 19 ms 35964 KB Output is correct
19 Correct 21 ms 35972 KB Output is correct
20 Correct 23 ms 36016 KB Output is correct
21 Correct 18 ms 35916 KB Output is correct
22 Correct 18 ms 35952 KB Output is correct
23 Correct 18 ms 35916 KB Output is correct
24 Correct 18 ms 35908 KB Output is correct
25 Correct 18 ms 35952 KB Output is correct
26 Correct 20 ms 35948 KB Output is correct
27 Correct 18 ms 36036 KB Output is correct
28 Correct 18 ms 36036 KB Output is correct
29 Correct 17 ms 36044 KB Output is correct
30 Correct 20 ms 36032 KB Output is correct
31 Correct 17 ms 36008 KB Output is correct
32 Correct 17 ms 35916 KB Output is correct
33 Correct 19 ms 35896 KB Output is correct
34 Correct 18 ms 35996 KB Output is correct
35 Correct 18 ms 35980 KB Output is correct
36 Correct 27 ms 39356 KB Output is correct
37 Correct 31 ms 39392 KB Output is correct
38 Correct 29 ms 38980 KB Output is correct
39 Correct 28 ms 38860 KB Output is correct
40 Correct 28 ms 38860 KB Output is correct
41 Correct 24 ms 38404 KB Output is correct
42 Correct 27 ms 39244 KB Output is correct
43 Correct 27 ms 38968 KB Output is correct
44 Correct 26 ms 39216 KB Output is correct
45 Correct 27 ms 38868 KB Output is correct
46 Correct 28 ms 39108 KB Output is correct
47 Correct 26 ms 38732 KB Output is correct
48 Correct 30 ms 38900 KB Output is correct
49 Correct 28 ms 38992 KB Output is correct
50 Correct 18 ms 36044 KB Output is correct
51 Correct 18 ms 36064 KB Output is correct
52 Correct 17 ms 36000 KB Output is correct
53 Correct 17 ms 36044 KB Output is correct
54 Correct 19 ms 35944 KB Output is correct
55 Correct 22 ms 36044 KB Output is correct
56 Correct 19 ms 36044 KB Output is correct
57 Correct 18 ms 36084 KB Output is correct
58 Correct 23 ms 35996 KB Output is correct
59 Correct 18 ms 36044 KB Output is correct
60 Correct 19 ms 36076 KB Output is correct
61 Correct 18 ms 35968 KB Output is correct
62 Correct 18 ms 36020 KB Output is correct
63 Correct 18 ms 36044 KB Output is correct
64 Correct 21 ms 36296 KB Output is correct
65 Correct 18 ms 36280 KB Output is correct
66 Correct 18 ms 36276 KB Output is correct
67 Correct 21 ms 36296 KB Output is correct
68 Correct 20 ms 36296 KB Output is correct
69 Correct 18 ms 36164 KB Output is correct
70 Correct 19 ms 36300 KB Output is correct
71 Correct 19 ms 36428 KB Output is correct
72 Correct 18 ms 36300 KB Output is correct
73 Correct 19 ms 36312 KB Output is correct
74 Correct 19 ms 36320 KB Output is correct
75 Correct 19 ms 36400 KB Output is correct
76 Correct 19 ms 36164 KB Output is correct
77 Correct 19 ms 36300 KB Output is correct
78 Correct 26 ms 39120 KB Output is correct
79 Correct 27 ms 39116 KB Output is correct
80 Correct 31 ms 38932 KB Output is correct
81 Correct 29 ms 38988 KB Output is correct
82 Correct 27 ms 38876 KB Output is correct
83 Correct 26 ms 38524 KB Output is correct
84 Correct 27 ms 39108 KB Output is correct
85 Correct 27 ms 39116 KB Output is correct
86 Correct 30 ms 39120 KB Output is correct
87 Correct 27 ms 38972 KB Output is correct
88 Correct 28 ms 38988 KB Output is correct
89 Correct 25 ms 38864 KB Output is correct
90 Correct 23 ms 38752 KB Output is correct
91 Correct 24 ms 38844 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 35912 KB Output is correct
2 Correct 18 ms 36036 KB Output is correct
3 Correct 19 ms 35956 KB Output is correct
4 Correct 21 ms 36000 KB Output is correct
5 Correct 19 ms 35916 KB Output is correct
6 Correct 19 ms 35944 KB Output is correct
7 Correct 18 ms 35940 KB Output is correct
8 Correct 18 ms 35916 KB Output is correct
9 Correct 18 ms 36036 KB Output is correct
10 Correct 18 ms 35952 KB Output is correct
11 Correct 17 ms 36004 KB Output is correct
12 Correct 16 ms 35916 KB Output is correct
13 Correct 17 ms 35916 KB Output is correct
14 Correct 18 ms 36036 KB Output is correct
15 Correct 17 ms 35916 KB Output is correct
16 Correct 21 ms 36024 KB Output is correct
17 Correct 18 ms 35968 KB Output is correct
18 Correct 19 ms 35964 KB Output is correct
19 Correct 21 ms 35972 KB Output is correct
20 Correct 23 ms 36016 KB Output is correct
21 Correct 18 ms 35916 KB Output is correct
22 Correct 18 ms 35952 KB Output is correct
23 Correct 18 ms 35916 KB Output is correct
24 Correct 18 ms 35908 KB Output is correct
25 Correct 18 ms 35952 KB Output is correct
26 Correct 20 ms 35948 KB Output is correct
27 Correct 18 ms 36036 KB Output is correct
28 Correct 18 ms 36036 KB Output is correct
29 Correct 17 ms 36044 KB Output is correct
30 Correct 20 ms 36032 KB Output is correct
31 Correct 17 ms 36008 KB Output is correct
32 Correct 17 ms 35916 KB Output is correct
33 Correct 19 ms 35896 KB Output is correct
34 Correct 18 ms 35996 KB Output is correct
35 Correct 18 ms 35980 KB Output is correct
36 Correct 27 ms 39356 KB Output is correct
37 Correct 31 ms 39392 KB Output is correct
38 Correct 29 ms 38980 KB Output is correct
39 Correct 28 ms 38860 KB Output is correct
40 Correct 28 ms 38860 KB Output is correct
41 Correct 24 ms 38404 KB Output is correct
42 Correct 27 ms 39244 KB Output is correct
43 Correct 27 ms 38968 KB Output is correct
44 Correct 26 ms 39216 KB Output is correct
45 Correct 27 ms 38868 KB Output is correct
46 Correct 28 ms 39108 KB Output is correct
47 Correct 26 ms 38732 KB Output is correct
48 Correct 30 ms 38900 KB Output is correct
49 Correct 28 ms 38992 KB Output is correct
50 Correct 18 ms 36044 KB Output is correct
51 Correct 18 ms 36064 KB Output is correct
52 Correct 17 ms 36000 KB Output is correct
53 Correct 17 ms 36044 KB Output is correct
54 Correct 19 ms 35944 KB Output is correct
55 Correct 22 ms 36044 KB Output is correct
56 Correct 19 ms 36044 KB Output is correct
57 Correct 18 ms 36084 KB Output is correct
58 Correct 23 ms 35996 KB Output is correct
59 Correct 18 ms 36044 KB Output is correct
60 Correct 19 ms 36076 KB Output is correct
61 Correct 18 ms 35968 KB Output is correct
62 Correct 18 ms 36020 KB Output is correct
63 Correct 18 ms 36044 KB Output is correct
64 Correct 21 ms 36296 KB Output is correct
65 Correct 18 ms 36280 KB Output is correct
66 Correct 18 ms 36276 KB Output is correct
67 Correct 21 ms 36296 KB Output is correct
68 Correct 20 ms 36296 KB Output is correct
69 Correct 18 ms 36164 KB Output is correct
70 Correct 19 ms 36300 KB Output is correct
71 Correct 19 ms 36428 KB Output is correct
72 Correct 18 ms 36300 KB Output is correct
73 Correct 19 ms 36312 KB Output is correct
74 Correct 19 ms 36320 KB Output is correct
75 Correct 19 ms 36400 KB Output is correct
76 Correct 19 ms 36164 KB Output is correct
77 Correct 19 ms 36300 KB Output is correct
78 Correct 26 ms 39120 KB Output is correct
79 Correct 27 ms 39116 KB Output is correct
80 Correct 31 ms 38932 KB Output is correct
81 Correct 29 ms 38988 KB Output is correct
82 Correct 27 ms 38876 KB Output is correct
83 Correct 26 ms 38524 KB Output is correct
84 Correct 27 ms 39108 KB Output is correct
85 Correct 27 ms 39116 KB Output is correct
86 Correct 30 ms 39120 KB Output is correct
87 Correct 27 ms 38972 KB Output is correct
88 Correct 28 ms 38988 KB Output is correct
89 Correct 25 ms 38864 KB Output is correct
90 Correct 23 ms 38752 KB Output is correct
91 Correct 24 ms 38844 KB Output is correct
92 Correct 333 ms 83040 KB Output is correct
93 Correct 329 ms 82532 KB Output is correct
94 Correct 214 ms 80492 KB Output is correct
95 Correct 138 ms 82168 KB Output is correct
96 Correct 145 ms 82052 KB Output is correct
97 Correct 316 ms 87196 KB Output is correct
98 Correct 352 ms 88036 KB Output is correct
99 Correct 342 ms 82168 KB Output is correct
100 Correct 315 ms 82884 KB Output is correct
101 Correct 300 ms 81872 KB Output is correct
102 Correct 128 ms 74044 KB Output is correct
103 Correct 328 ms 86200 KB Output is correct
104 Correct 302 ms 82404 KB Output is correct
105 Correct 293 ms 83772 KB Output is correct

Subtask #8
0.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 35912 KB Output is correct
2 Correct 18 ms 36036 KB Output is correct
3 Correct 19 ms 35956 KB Output is correct
4 Correct 21 ms 36000 KB Output is correct
5 Correct 19 ms 35916 KB Output is correct
6 Correct 19 ms 35944 KB Output is correct
7 Correct 18 ms 35940 KB Output is correct
8 Correct 18 ms 35916 KB Output is correct
9 Correct 18 ms 36036 KB Output is correct
10 Correct 18 ms 35952 KB Output is correct
11 Correct 17 ms 36004 KB Output is correct
12 Correct 16 ms 35916 KB Output is correct
13 Correct 17 ms 35916 KB Output is correct
14 Correct 18 ms 36036 KB Output is correct
15 Correct 17 ms 35916 KB Output is correct
16 Correct 21 ms 36024 KB Output is correct
17 Correct 18 ms 35968 KB Output is correct
18 Correct 19 ms 35964 KB Output is correct
19 Correct 21 ms 35972 KB Output is correct
20 Correct 23 ms 36016 KB Output is correct
21 Correct 18 ms 35916 KB Output is correct
22 Correct 18 ms 35952 KB Output is correct
23 Correct 18 ms 35916 KB Output is correct
24 Correct 18 ms 35908 KB Output is correct
25 Correct 18 ms 35952 KB Output is correct
26 Correct 20 ms 35948 KB Output is correct
27 Correct 18 ms 36036 KB Output is correct
28 Correct 18 ms 36036 KB Output is correct
29 Correct 17 ms 36044 KB Output is correct
30 Correct 20 ms 36032 KB Output is correct
31 Correct 17 ms 36008 KB Output is correct
32 Correct 17 ms 35916 KB Output is correct
33 Correct 19 ms 35896 KB Output is correct
34 Correct 18 ms 35996 KB Output is correct
35 Correct 18 ms 35980 KB Output is correct
36 Correct 27 ms 39356 KB Output is correct
37 Correct 31 ms 39392 KB Output is correct
38 Correct 29 ms 38980 KB Output is correct
39 Correct 28 ms 38860 KB Output is correct
40 Correct 28 ms 38860 KB Output is correct
41 Correct 24 ms 38404 KB Output is correct
42 Correct 27 ms 39244 KB Output is correct
43 Correct 27 ms 38968 KB Output is correct
44 Correct 26 ms 39216 KB Output is correct
45 Correct 27 ms 38868 KB Output is correct
46 Correct 28 ms 39108 KB Output is correct
47 Correct 26 ms 38732 KB Output is correct
48 Correct 30 ms 38900 KB Output is correct
49 Correct 28 ms 38992 KB Output is correct
50 Correct 18 ms 36044 KB Output is correct
51 Correct 18 ms 36064 KB Output is correct
52 Correct 17 ms 36000 KB Output is correct
53 Correct 17 ms 36044 KB Output is correct
54 Correct 19 ms 35944 KB Output is correct
55 Correct 22 ms 36044 KB Output is correct
56 Correct 19 ms 36044 KB Output is correct
57 Correct 18 ms 36084 KB Output is correct
58 Correct 23 ms 35996 KB Output is correct
59 Correct 18 ms 36044 KB Output is correct
60 Correct 19 ms 36076 KB Output is correct
61 Correct 18 ms 35968 KB Output is correct
62 Correct 18 ms 36020 KB Output is correct
63 Correct 18 ms 36044 KB Output is correct
64 Correct 21 ms 36296 KB Output is correct
65 Correct 18 ms 36280 KB Output is correct
66 Correct 18 ms 36276 KB Output is correct
67 Correct 21 ms 36296 KB Output is correct
68 Correct 20 ms 36296 KB Output is correct
69 Correct 18 ms 36164 KB Output is correct
70 Correct 19 ms 36300 KB Output is correct
71 Correct 19 ms 36428 KB Output is correct
72 Correct 18 ms 36300 KB Output is correct
73 Correct 19 ms 36312 KB Output is correct
74 Correct 19 ms 36320 KB Output is correct
75 Correct 19 ms 36400 KB Output is correct
76 Correct 19 ms 36164 KB Output is correct
77 Correct 19 ms 36300 KB Output is correct
78 Correct 26 ms 39120 KB Output is correct
79 Correct 27 ms 39116 KB Output is correct
80 Correct 31 ms 38932 KB Output is correct
81 Correct 29 ms 38988 KB Output is correct
82 Correct 27 ms 38876 KB Output is correct
83 Correct 26 ms 38524 KB Output is correct
84 Correct 27 ms 39108 KB Output is correct
85 Correct 27 ms 39116 KB Output is correct
86 Correct 30 ms 39120 KB Output is correct
87 Correct 27 ms 38972 KB Output is correct
88 Correct 28 ms 38988 KB Output is correct
89 Correct 25 ms 38864 KB Output is correct
90 Correct 23 ms 38752 KB Output is correct
91 Correct 24 ms 38844 KB Output is correct
92 Correct 333 ms 83040 KB Output is correct
93 Correct 329 ms 82532 KB Output is correct
94 Correct 214 ms 80492 KB Output is correct
95 Correct 138 ms 82168 KB Output is correct
96 Correct 145 ms 82052 KB Output is correct
97 Correct 316 ms 87196 KB Output is correct
98 Correct 352 ms 88036 KB Output is correct
99 Correct 342 ms 82168 KB Output is correct
100 Correct 315 ms 82884 KB Output is correct
101 Correct 300 ms 81872 KB Output is correct
102 Correct 128 ms 74044 KB Output is correct
103 Correct 328 ms 86200 KB Output is correct
104 Correct 302 ms 82404 KB Output is correct
105 Correct 293 ms 83772 KB Output is correct
106 Execution timed out 7030 ms 380284 KB Time limit exceeded
107 Halted 0 ms 0 KB -