oj.uz

답안 #526142

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
526142 2022-02-13T20:09:17 Z mjhmjh1104 Mountains and Valleys (CCO20_day1problem3) C++17
21 / 25
 7000 ms 430540 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

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

struct Item {
    int posde;
    int negde;
    int ans;
    Item (): posde((int)-1e9), negde((int)-1e9), ans((int)-1e9) {}
    Item (int posde, int negde, int ans): posde(posde), negde(negde), ans(ans) {}
} sp_split[19][500006];

int n, m;
vector<int> tree[500006], child[500006];
vector<tuple<int, int, int>> adj;
int depth[500006], sp[19][500006], sp_dist[19][500006];
multiset<int> lt_depth[500006], lt_dist[500006];
int max_depth[500006], rev_max_depth[500006], dist[500006], rev_dist[500006];
int prev_dist[500006], prev_depth[500006][2];

int query_sp_half(int A, int x) {
    int ret = prev_depth[x][0] - depth[x];
    if (A == x) return ret;
    for (int t = 18; t >= 0; t--) if (sp[t][x] != -1 && depth[sp[t][x]] > depth[A]) {
        ret = max(ret, sp_split[t][x].negde);
        x = sp[t][x];
    }
    return max(ret, sp_split[0][x].negde);
}

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

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) {
    lt_depth[x].insert(rev_max_depth[x]);
    lt_dist[x].insert(rev_dist[x]);
    for (auto &i: child[x]) {
        lt_depth[x].insert(max_depth[i] + 1);
        lt_dist[x].insert(dist[i]);
    }
    for (auto &i: child[x]) {
        lt_depth[x].erase(lt_depth[x].find(max_depth[i] + 1));
        lt_dist[x].erase(lt_dist[x].find(dist[i]));
        if (!lt_dist[x].empty()) rev_dist[i] = *lt_dist[x].rbegin();
        if (!lt_depth[x].empty()) rev_dist[i] = max(rev_dist[i], rev_max_depth[i] = *lt_depth[x].rbegin() + 1);
        if ((int)lt_depth[x].size() > 1) rev_dist[i] = max(rev_dist[i], *lt_depth[x].rbegin() + *prev(prev(lt_depth[x].end())));
        lt_depth[x].insert(max_depth[i] + 1);
        lt_dist[x].insert(dist[i]);
    }
    lt_depth[x].erase(lt_depth[x].find(rev_max_depth[x]));
    lt_dist[x].erase(lt_dist[x].find(rev_dist[x]));
    for (auto &i: child[x]) dfs_rev_dist(i);
}


void dfs_f_dist(int x) {
    for (auto &i: child[x]) {
        lt_dist[x].erase(lt_dist[x].find(dist[i]));
        sp_dist[0][i] = (lt_dist[x].empty() ? 0 : *lt_dist[x].rbegin());
        lt_dist[x].insert(dist[i]);
    }
    for (auto &i: child[x]) dfs_f_dist(i);
}

void dfs_edge(int x) {
    for (auto &i: child[x]) {
        lt_depth[x].erase(lt_depth[x].find(max_depth[i] + 1));
        if ((int)lt_depth[x].size() > 1) sp_dist[0][i] = max(sp_dist[0][i], *lt_depth[x].rbegin() + *prev(prev(lt_depth[x].end())));
        else if (!lt_depth[x].empty()) sp_dist[0][i] = max(sp_dist[0][i], *lt_depth[x].rbegin());
        int V = (lt_depth[x].empty() ? 0 : *lt_depth[x].rbegin());
        sp_split[0][i].posde = V + depth[x];
        sp_split[0][i].negde = V - depth[x];
        lt_depth[x].insert(max_depth[i] + 1);
    }
    for (auto &i: child[x]) dfs_edge(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;

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];
    for (int t = 18; t >= 0; t--) if (diff >= 1 << t) {
        diff -= 1 << t;
        u = sp[t][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 pr(int x, int y) {
    for (int t = 18; t >= 0; t--) if (y >= 1 << t) {
        y -= 1 << t;
        x = sp[t][x];
    }
    return x;
}

int query_sp_dist(int u, int v, int l, int A, int B) {
    int ret = 0;
    if (u != l) {
        ret = max(prev_depth[u][1], prev_dist[u]);
        u = sp[0][u];
    }
    if (v != l) {
        ret = max(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];
    }
    if (A != -1) lt_dist[l].erase(lt_dist[l].find(dist[A]));
    if (B != -1) lt_dist[l].erase(lt_dist[l].find(dist[B]));
    ret = max(ret, lt_dist[l].empty() ? 0 : *lt_dist[l].rbegin());
    if (A != -1) lt_dist[l].insert(dist[A]);
    if (B != -1) lt_dist[l].insert(dist[B]);
    if (A != -1) lt_depth[l].erase(lt_depth[l].find(max_depth[A] + 1));
    if (B != -1) lt_depth[l].erase(lt_depth[l].find(max_depth[B] + 1));
    if (!lt_depth[l].empty()) ret = max(ret, *lt_depth[l].rbegin() + rev_max_depth[l]);
    else ret = max(ret, rev_max_depth[l]);
    if ((int)lt_depth[l].size() > 1) ret = max(ret, *lt_depth[l].rbegin() + *prev(prev(lt_depth[l].end())));
    if (A != -1) lt_depth[l].insert(max_depth[A] + 1);
    if (B != -1) lt_depth[l].insert(max_depth[B] + 1);
    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.push_back({ x, y, w });
    }
    dfs_child(0);
    dfs_dist(0);
    dfs_rev_dist(0);
    for (int i = 0; i < n; i++) {
        prev_dist[i] = (lt_dist[i].empty() ? (int)-1e9 : *lt_dist[i].rbegin());
        prev_depth[i][0] = (lt_depth[i].empty() ? (int)-1e9 : *lt_depth[i].rbegin());
        prev_depth[i][1] = ((int)lt_depth[i].size() < 2 ? (int)-1e9 : *lt_depth[i].rbegin() + *prev(prev(lt_depth[i].end())));
    }
    dfs_f_dist(0);
    dfs_edge(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 (auto [ i, j, w ]: adj) {
        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;
        if (A == -1) A = (i == l ? -1 : pr(i, depth[i] - depth[l] - 1));
        if (B == -1) B = (j == l ? -1 : pr(j, depth[j] - depth[l] - 1));
        int y = max(rev_dist[l] - 1, query_sp_dist(i, j, l, A, B) - 1);
        if (A != -1) lt_depth[l].erase(lt_depth[l].find(max_depth[A] + 1));
        if (B != -1) lt_depth[l].erase(lt_depth[l].find(max_depth[B] + 1));
        int G = 0;
        if (!lt_depth[l].empty()) G = *lt_depth[l].rbegin();
        else y = max(y, rev_max_depth[l] - 1);
        if ((int)lt_depth[l].size() > 1) y = max(y, *lt_depth[l].rbegin() + *prev(prev(lt_depth[l].end())) - 1);
        if (A != -1) lt_depth[l].insert(max_depth[A] + 1);
        if (B != -1) lt_depth[l].insert(max_depth[B] + 1);
        int Alt = (A == -1 ? (int)-1e9 : query_sp_half(A, i) + depth[l]);
        int Brt = (B == -1 ? (int)-1e9 : query_sp_half(B, j) + depth[l]);
        int Lt = max(rev_max_depth[l], G);
        y = max(y, Alt + max(Brt, Lt) + 1);
        y = max(y, max(Alt, Lt) + Brt + 1);
        if (A != -1) y = max(y, query_sp_res(A, i) + 1);
        if (B != -1) y = max(y, query_sp_res(B, j) + 1);
        res = min(res, curr - y);
    }
    printf("%d", res);
}

Compilation message

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

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 182496 KB Output is correct
2 Correct 87 ms 182576 KB Output is correct
3 Correct 97 ms 182512 KB Output is correct
4 Correct 95 ms 182612 KB Output is correct
5 Correct 88 ms 182540 KB Output is correct
6 Correct 95 ms 182504 KB Output is correct
7 Correct 92 ms 182508 KB Output is correct
8 Correct 91 ms 182548 KB Output is correct
9 Correct 110 ms 182528 KB Output is correct
10 Correct 88 ms 182604 KB Output is correct
11 Correct 88 ms 182496 KB Output is correct
12 Correct 91 ms 182724 KB Output is correct
13 Correct 100 ms 182600 KB Output is correct
14 Correct 90 ms 182588 KB Output is correct
15 Correct 90 ms 182592 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 182496 KB Output is correct
2 Correct 87 ms 182576 KB Output is correct
3 Correct 97 ms 182512 KB Output is correct
4 Correct 95 ms 182612 KB Output is correct
5 Correct 88 ms 182540 KB Output is correct
6 Correct 95 ms 182504 KB Output is correct
7 Correct 92 ms 182508 KB Output is correct
8 Correct 91 ms 182548 KB Output is correct
9 Correct 110 ms 182528 KB Output is correct
10 Correct 88 ms 182604 KB Output is correct
11 Correct 88 ms 182496 KB Output is correct
12 Correct 91 ms 182724 KB Output is correct
13 Correct 100 ms 182600 KB Output is correct
14 Correct 90 ms 182588 KB Output is correct
15 Correct 90 ms 182592 KB Output is correct
16 Correct 89 ms 182576 KB Output is correct
17 Correct 96 ms 182540 KB Output is correct
18 Correct 89 ms 182548 KB Output is correct
19 Correct 93 ms 182596 KB Output is correct
20 Correct 100 ms 182524 KB Output is correct
21 Correct 90 ms 182612 KB Output is correct
22 Correct 88 ms 182540 KB Output is correct
23 Correct 93 ms 182572 KB Output is correct
24 Correct 90 ms 182600 KB Output is correct
25 Correct 95 ms 182692 KB Output is correct
26 Correct 89 ms 182496 KB Output is correct
27 Correct 89 ms 182532 KB Output is correct
28 Correct 92 ms 182604 KB Output is correct
29 Correct 92 ms 182596 KB Output is correct
30 Correct 91 ms 182588 KB Output is correct
31 Correct 95 ms 182524 KB Output is correct
32 Correct 88 ms 182556 KB Output is correct
33 Correct 91 ms 182612 KB Output is correct
34 Correct 91 ms 182512 KB Output is correct
35 Correct 96 ms 182528 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 110 ms 184780 KB Output is correct
2 Correct 102 ms 184860 KB Output is correct
3 Correct 103 ms 184700 KB Output is correct
4 Correct 112 ms 184568 KB Output is correct
5 Correct 125 ms 184476 KB Output is correct
6 Correct 102 ms 184168 KB Output is correct
7 Correct 108 ms 184820 KB Output is correct
8 Correct 102 ms 184536 KB Output is correct
9 Correct 120 ms 184852 KB Output is correct
10 Correct 115 ms 184548 KB Output is correct
11 Correct 109 ms 184636 KB Output is correct
12 Correct 102 ms 184468 KB Output is correct
13 Correct 104 ms 184592 KB Output is correct
14 Correct 105 ms 184588 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 182496 KB Output is correct
2 Correct 87 ms 182576 KB Output is correct
3 Correct 97 ms 182512 KB Output is correct
4 Correct 95 ms 182612 KB Output is correct
5 Correct 88 ms 182540 KB Output is correct
6 Correct 95 ms 182504 KB Output is correct
7 Correct 92 ms 182508 KB Output is correct
8 Correct 91 ms 182548 KB Output is correct
9 Correct 110 ms 182528 KB Output is correct
10 Correct 88 ms 182604 KB Output is correct
11 Correct 88 ms 182496 KB Output is correct
12 Correct 91 ms 182724 KB Output is correct
13 Correct 100 ms 182600 KB Output is correct
14 Correct 90 ms 182588 KB Output is correct
15 Correct 90 ms 182592 KB Output is correct
16 Correct 89 ms 182576 KB Output is correct
17 Correct 96 ms 182540 KB Output is correct
18 Correct 89 ms 182548 KB Output is correct
19 Correct 93 ms 182596 KB Output is correct
20 Correct 100 ms 182524 KB Output is correct
21 Correct 90 ms 182612 KB Output is correct
22 Correct 88 ms 182540 KB Output is correct
23 Correct 93 ms 182572 KB Output is correct
24 Correct 90 ms 182600 KB Output is correct
25 Correct 95 ms 182692 KB Output is correct
26 Correct 89 ms 182496 KB Output is correct
27 Correct 89 ms 182532 KB Output is correct
28 Correct 92 ms 182604 KB Output is correct
29 Correct 92 ms 182596 KB Output is correct
30 Correct 91 ms 182588 KB Output is correct
31 Correct 95 ms 182524 KB Output is correct
32 Correct 88 ms 182556 KB Output is correct
33 Correct 91 ms 182612 KB Output is correct
34 Correct 91 ms 182512 KB Output is correct
35 Correct 96 ms 182528 KB Output is correct
36 Correct 100 ms 182596 KB Output is correct
37 Correct 89 ms 182612 KB Output is correct
38 Correct 89 ms 182532 KB Output is correct
39 Correct 97 ms 182600 KB Output is correct
40 Correct 103 ms 182632 KB Output is correct
41 Correct 89 ms 182572 KB Output is correct
42 Correct 92 ms 182572 KB Output is correct
43 Correct 88 ms 182556 KB Output is correct
44 Correct 107 ms 182580 KB Output is correct
45 Correct 96 ms 182560 KB Output is correct
46 Correct 89 ms 182568 KB Output is correct
47 Correct 89 ms 182572 KB Output is correct
48 Correct 89 ms 182548 KB Output is correct
49 Correct 99 ms 182632 KB Output is correct

Subtask #5
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 182496 KB Output is correct
2 Correct 87 ms 182576 KB Output is correct
3 Correct 97 ms 182512 KB Output is correct
4 Correct 95 ms 182612 KB Output is correct
5 Correct 88 ms 182540 KB Output is correct
6 Correct 95 ms 182504 KB Output is correct
7 Correct 92 ms 182508 KB Output is correct
8 Correct 91 ms 182548 KB Output is correct
9 Correct 110 ms 182528 KB Output is correct
10 Correct 88 ms 182604 KB Output is correct
11 Correct 88 ms 182496 KB Output is correct
12 Correct 91 ms 182724 KB Output is correct
13 Correct 100 ms 182600 KB Output is correct
14 Correct 90 ms 182588 KB Output is correct
15 Correct 90 ms 182592 KB Output is correct
16 Correct 89 ms 182576 KB Output is correct
17 Correct 96 ms 182540 KB Output is correct
18 Correct 89 ms 182548 KB Output is correct
19 Correct 93 ms 182596 KB Output is correct
20 Correct 100 ms 182524 KB Output is correct
21 Correct 90 ms 182612 KB Output is correct
22 Correct 88 ms 182540 KB Output is correct
23 Correct 93 ms 182572 KB Output is correct
24 Correct 90 ms 182600 KB Output is correct
25 Correct 95 ms 182692 KB Output is correct
26 Correct 89 ms 182496 KB Output is correct
27 Correct 89 ms 182532 KB Output is correct
28 Correct 92 ms 182604 KB Output is correct
29 Correct 92 ms 182596 KB Output is correct
30 Correct 91 ms 182588 KB Output is correct
31 Correct 95 ms 182524 KB Output is correct
32 Correct 88 ms 182556 KB Output is correct
33 Correct 91 ms 182612 KB Output is correct
34 Correct 91 ms 182512 KB Output is correct
35 Correct 96 ms 182528 KB Output is correct
36 Correct 100 ms 182596 KB Output is correct
37 Correct 89 ms 182612 KB Output is correct
38 Correct 89 ms 182532 KB Output is correct
39 Correct 97 ms 182600 KB Output is correct
40 Correct 103 ms 182632 KB Output is correct
41 Correct 89 ms 182572 KB Output is correct
42 Correct 92 ms 182572 KB Output is correct
43 Correct 88 ms 182556 KB Output is correct
44 Correct 107 ms 182580 KB Output is correct
45 Correct 96 ms 182560 KB Output is correct
46 Correct 89 ms 182568 KB Output is correct
47 Correct 89 ms 182572 KB Output is correct
48 Correct 89 ms 182548 KB Output is correct
49 Correct 99 ms 182632 KB Output is correct
50 Correct 98 ms 182836 KB Output is correct
51 Correct 92 ms 182740 KB Output is correct
52 Correct 90 ms 182744 KB Output is correct
53 Correct 93 ms 182768 KB Output is correct
54 Correct 97 ms 182724 KB Output is correct
55 Correct 109 ms 182716 KB Output is correct
56 Correct 96 ms 182756 KB Output is correct
57 Correct 91 ms 182724 KB Output is correct
58 Correct 92 ms 182716 KB Output is correct
59 Correct 92 ms 182776 KB Output is correct
60 Correct 96 ms 182672 KB Output is correct
61 Correct 96 ms 182740 KB Output is correct
62 Correct 89 ms 182724 KB Output is correct
63 Correct 91 ms 182732 KB Output is correct

Subtask #6
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 182496 KB Output is correct
2 Correct 87 ms 182576 KB Output is correct
3 Correct 97 ms 182512 KB Output is correct
4 Correct 95 ms 182612 KB Output is correct
5 Correct 88 ms 182540 KB Output is correct
6 Correct 95 ms 182504 KB Output is correct
7 Correct 92 ms 182508 KB Output is correct
8 Correct 91 ms 182548 KB Output is correct
9 Correct 110 ms 182528 KB Output is correct
10 Correct 88 ms 182604 KB Output is correct
11 Correct 88 ms 182496 KB Output is correct
12 Correct 91 ms 182724 KB Output is correct
13 Correct 100 ms 182600 KB Output is correct
14 Correct 90 ms 182588 KB Output is correct
15 Correct 90 ms 182592 KB Output is correct
16 Correct 89 ms 182576 KB Output is correct
17 Correct 96 ms 182540 KB Output is correct
18 Correct 89 ms 182548 KB Output is correct
19 Correct 93 ms 182596 KB Output is correct
20 Correct 100 ms 182524 KB Output is correct
21 Correct 90 ms 182612 KB Output is correct
22 Correct 88 ms 182540 KB Output is correct
23 Correct 93 ms 182572 KB Output is correct
24 Correct 90 ms 182600 KB Output is correct
25 Correct 95 ms 182692 KB Output is correct
26 Correct 89 ms 182496 KB Output is correct
27 Correct 89 ms 182532 KB Output is correct
28 Correct 92 ms 182604 KB Output is correct
29 Correct 92 ms 182596 KB Output is correct
30 Correct 91 ms 182588 KB Output is correct
31 Correct 95 ms 182524 KB Output is correct
32 Correct 88 ms 182556 KB Output is correct
33 Correct 91 ms 182612 KB Output is correct
34 Correct 91 ms 182512 KB Output is correct
35 Correct 96 ms 182528 KB Output is correct
36 Correct 110 ms 184780 KB Output is correct
37 Correct 102 ms 184860 KB Output is correct
38 Correct 103 ms 184700 KB Output is correct
39 Correct 112 ms 184568 KB Output is correct
40 Correct 125 ms 184476 KB Output is correct
41 Correct 102 ms 184168 KB Output is correct
42 Correct 108 ms 184820 KB Output is correct
43 Correct 102 ms 184536 KB Output is correct
44 Correct 120 ms 184852 KB Output is correct
45 Correct 115 ms 184548 KB Output is correct
46 Correct 109 ms 184636 KB Output is correct
47 Correct 102 ms 184468 KB Output is correct
48 Correct 104 ms 184592 KB Output is correct
49 Correct 105 ms 184588 KB Output is correct
50 Correct 100 ms 182596 KB Output is correct
51 Correct 89 ms 182612 KB Output is correct
52 Correct 89 ms 182532 KB Output is correct
53 Correct 97 ms 182600 KB Output is correct
54 Correct 103 ms 182632 KB Output is correct
55 Correct 89 ms 182572 KB Output is correct
56 Correct 92 ms 182572 KB Output is correct
57 Correct 88 ms 182556 KB Output is correct
58 Correct 107 ms 182580 KB Output is correct
59 Correct 96 ms 182560 KB Output is correct
60 Correct 89 ms 182568 KB Output is correct
61 Correct 89 ms 182572 KB Output is correct
62 Correct 89 ms 182548 KB Output is correct
63 Correct 99 ms 182632 KB Output is correct
64 Correct 98 ms 182836 KB Output is correct
65 Correct 92 ms 182740 KB Output is correct
66 Correct 90 ms 182744 KB Output is correct
67 Correct 93 ms 182768 KB Output is correct
68 Correct 97 ms 182724 KB Output is correct
69 Correct 109 ms 182716 KB Output is correct
70 Correct 96 ms 182756 KB Output is correct
71 Correct 91 ms 182724 KB Output is correct
72 Correct 92 ms 182716 KB Output is correct
73 Correct 92 ms 182776 KB Output is correct
74 Correct 96 ms 182672 KB Output is correct
75 Correct 96 ms 182740 KB Output is correct
76 Correct 89 ms 182724 KB Output is correct
77 Correct 91 ms 182732 KB Output is correct
78 Correct 110 ms 184612 KB Output is correct
79 Correct 128 ms 184748 KB Output is correct
80 Correct 119 ms 184612 KB Output is correct
81 Correct 102 ms 184644 KB Output is correct
82 Correct 104 ms 184440 KB Output is correct
83 Correct 129 ms 184256 KB Output is correct
84 Correct 106 ms 184632 KB Output is correct
85 Correct 102 ms 184700 KB Output is correct
86 Correct 105 ms 184672 KB Output is correct
87 Correct 106 ms 184620 KB Output is correct
88 Correct 105 ms 184564 KB Output is correct
89 Correct 104 ms 184592 KB Output is correct
90 Correct 99 ms 184420 KB Output is correct
91 Correct 96 ms 184504 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 182496 KB Output is correct
2 Correct 87 ms 182576 KB Output is correct
3 Correct 97 ms 182512 KB Output is correct
4 Correct 95 ms 182612 KB Output is correct
5 Correct 88 ms 182540 KB Output is correct
6 Correct 95 ms 182504 KB Output is correct
7 Correct 92 ms 182508 KB Output is correct
8 Correct 91 ms 182548 KB Output is correct
9 Correct 110 ms 182528 KB Output is correct
10 Correct 88 ms 182604 KB Output is correct
11 Correct 88 ms 182496 KB Output is correct
12 Correct 91 ms 182724 KB Output is correct
13 Correct 100 ms 182600 KB Output is correct
14 Correct 90 ms 182588 KB Output is correct
15 Correct 90 ms 182592 KB Output is correct
16 Correct 89 ms 182576 KB Output is correct
17 Correct 96 ms 182540 KB Output is correct
18 Correct 89 ms 182548 KB Output is correct
19 Correct 93 ms 182596 KB Output is correct
20 Correct 100 ms 182524 KB Output is correct
21 Correct 90 ms 182612 KB Output is correct
22 Correct 88 ms 182540 KB Output is correct
23 Correct 93 ms 182572 KB Output is correct
24 Correct 90 ms 182600 KB Output is correct
25 Correct 95 ms 182692 KB Output is correct
26 Correct 89 ms 182496 KB Output is correct
27 Correct 89 ms 182532 KB Output is correct
28 Correct 92 ms 182604 KB Output is correct
29 Correct 92 ms 182596 KB Output is correct
30 Correct 91 ms 182588 KB Output is correct
31 Correct 95 ms 182524 KB Output is correct
32 Correct 88 ms 182556 KB Output is correct
33 Correct 91 ms 182612 KB Output is correct
34 Correct 91 ms 182512 KB Output is correct
35 Correct 96 ms 182528 KB Output is correct
36 Correct 110 ms 184780 KB Output is correct
37 Correct 102 ms 184860 KB Output is correct
38 Correct 103 ms 184700 KB Output is correct
39 Correct 112 ms 184568 KB Output is correct
40 Correct 125 ms 184476 KB Output is correct
41 Correct 102 ms 184168 KB Output is correct
42 Correct 108 ms 184820 KB Output is correct
43 Correct 102 ms 184536 KB Output is correct
44 Correct 120 ms 184852 KB Output is correct
45 Correct 115 ms 184548 KB Output is correct
46 Correct 109 ms 184636 KB Output is correct
47 Correct 102 ms 184468 KB Output is correct
48 Correct 104 ms 184592 KB Output is correct
49 Correct 105 ms 184588 KB Output is correct
50 Correct 100 ms 182596 KB Output is correct
51 Correct 89 ms 182612 KB Output is correct
52 Correct 89 ms 182532 KB Output is correct
53 Correct 97 ms 182600 KB Output is correct
54 Correct 103 ms 182632 KB Output is correct
55 Correct 89 ms 182572 KB Output is correct
56 Correct 92 ms 182572 KB Output is correct
57 Correct 88 ms 182556 KB Output is correct
58 Correct 107 ms 182580 KB Output is correct
59 Correct 96 ms 182560 KB Output is correct
60 Correct 89 ms 182568 KB Output is correct
61 Correct 89 ms 182572 KB Output is correct
62 Correct 89 ms 182548 KB Output is correct
63 Correct 99 ms 182632 KB Output is correct
64 Correct 98 ms 182836 KB Output is correct
65 Correct 92 ms 182740 KB Output is correct
66 Correct 90 ms 182744 KB Output is correct
67 Correct 93 ms 182768 KB Output is correct
68 Correct 97 ms 182724 KB Output is correct
69 Correct 109 ms 182716 KB Output is correct
70 Correct 96 ms 182756 KB Output is correct
71 Correct 91 ms 182724 KB Output is correct
72 Correct 92 ms 182716 KB Output is correct
73 Correct 92 ms 182776 KB Output is correct
74 Correct 96 ms 182672 KB Output is correct
75 Correct 96 ms 182740 KB Output is correct
76 Correct 89 ms 182724 KB Output is correct
77 Correct 91 ms 182732 KB Output is correct
78 Correct 110 ms 184612 KB Output is correct
79 Correct 128 ms 184748 KB Output is correct
80 Correct 119 ms 184612 KB Output is correct
81 Correct 102 ms 184644 KB Output is correct
82 Correct 104 ms 184440 KB Output is correct
83 Correct 129 ms 184256 KB Output is correct
84 Correct 106 ms 184632 KB Output is correct
85 Correct 102 ms 184700 KB Output is correct
86 Correct 105 ms 184672 KB Output is correct
87 Correct 106 ms 184620 KB Output is correct
88 Correct 105 ms 184564 KB Output is correct
89 Correct 104 ms 184592 KB Output is correct
90 Correct 99 ms 184420 KB Output is correct
91 Correct 96 ms 184504 KB Output is correct
92 Correct 494 ms 214680 KB Output is correct
93 Correct 541 ms 214604 KB Output is correct
94 Correct 398 ms 213264 KB Output is correct
95 Correct 238 ms 214528 KB Output is correct
96 Correct 262 ms 214504 KB Output is correct
97 Correct 517 ms 218148 KB Output is correct
98 Correct 525 ms 219000 KB Output is correct
99 Correct 536 ms 214444 KB Output is correct
100 Correct 470 ms 215120 KB Output is correct
101 Correct 475 ms 214240 KB Output is correct
102 Correct 437 ms 208588 KB Output is correct
103 Correct 468 ms 217552 KB Output is correct
104 Correct 496 ms 214428 KB Output is correct
105 Correct 488 ms 215692 KB Output is correct

Subtask #8
0.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 182496 KB Output is correct
2 Correct 87 ms 182576 KB Output is correct
3 Correct 97 ms 182512 KB Output is correct
4 Correct 95 ms 182612 KB Output is correct
5 Correct 88 ms 182540 KB Output is correct
6 Correct 95 ms 182504 KB Output is correct
7 Correct 92 ms 182508 KB Output is correct
8 Correct 91 ms 182548 KB Output is correct
9 Correct 110 ms 182528 KB Output is correct
10 Correct 88 ms 182604 KB Output is correct
11 Correct 88 ms 182496 KB Output is correct
12 Correct 91 ms 182724 KB Output is correct
13 Correct 100 ms 182600 KB Output is correct
14 Correct 90 ms 182588 KB Output is correct
15 Correct 90 ms 182592 KB Output is correct
16 Correct 89 ms 182576 KB Output is correct
17 Correct 96 ms 182540 KB Output is correct
18 Correct 89 ms 182548 KB Output is correct
19 Correct 93 ms 182596 KB Output is correct
20 Correct 100 ms 182524 KB Output is correct
21 Correct 90 ms 182612 KB Output is correct
22 Correct 88 ms 182540 KB Output is correct
23 Correct 93 ms 182572 KB Output is correct
24 Correct 90 ms 182600 KB Output is correct
25 Correct 95 ms 182692 KB Output is correct
26 Correct 89 ms 182496 KB Output is correct
27 Correct 89 ms 182532 KB Output is correct
28 Correct 92 ms 182604 KB Output is correct
29 Correct 92 ms 182596 KB Output is correct
30 Correct 91 ms 182588 KB Output is correct
31 Correct 95 ms 182524 KB Output is correct
32 Correct 88 ms 182556 KB Output is correct
33 Correct 91 ms 182612 KB Output is correct
34 Correct 91 ms 182512 KB Output is correct
35 Correct 96 ms 182528 KB Output is correct
36 Correct 110 ms 184780 KB Output is correct
37 Correct 102 ms 184860 KB Output is correct
38 Correct 103 ms 184700 KB Output is correct
39 Correct 112 ms 184568 KB Output is correct
40 Correct 125 ms 184476 KB Output is correct
41 Correct 102 ms 184168 KB Output is correct
42 Correct 108 ms 184820 KB Output is correct
43 Correct 102 ms 184536 KB Output is correct
44 Correct 120 ms 184852 KB Output is correct
45 Correct 115 ms 184548 KB Output is correct
46 Correct 109 ms 184636 KB Output is correct
47 Correct 102 ms 184468 KB Output is correct
48 Correct 104 ms 184592 KB Output is correct
49 Correct 105 ms 184588 KB Output is correct
50 Correct 100 ms 182596 KB Output is correct
51 Correct 89 ms 182612 KB Output is correct
52 Correct 89 ms 182532 KB Output is correct
53 Correct 97 ms 182600 KB Output is correct
54 Correct 103 ms 182632 KB Output is correct
55 Correct 89 ms 182572 KB Output is correct
56 Correct 92 ms 182572 KB Output is correct
57 Correct 88 ms 182556 KB Output is correct
58 Correct 107 ms 182580 KB Output is correct
59 Correct 96 ms 182560 KB Output is correct
60 Correct 89 ms 182568 KB Output is correct
61 Correct 89 ms 182572 KB Output is correct
62 Correct 89 ms 182548 KB Output is correct
63 Correct 99 ms 182632 KB Output is correct
64 Correct 98 ms 182836 KB Output is correct
65 Correct 92 ms 182740 KB Output is correct
66 Correct 90 ms 182744 KB Output is correct
67 Correct 93 ms 182768 KB Output is correct
68 Correct 97 ms 182724 KB Output is correct
69 Correct 109 ms 182716 KB Output is correct
70 Correct 96 ms 182756 KB Output is correct
71 Correct 91 ms 182724 KB Output is correct
72 Correct 92 ms 182716 KB Output is correct
73 Correct 92 ms 182776 KB Output is correct
74 Correct 96 ms 182672 KB Output is correct
75 Correct 96 ms 182740 KB Output is correct
76 Correct 89 ms 182724 KB Output is correct
77 Correct 91 ms 182732 KB Output is correct
78 Correct 110 ms 184612 KB Output is correct
79 Correct 128 ms 184748 KB Output is correct
80 Correct 119 ms 184612 KB Output is correct
81 Correct 102 ms 184644 KB Output is correct
82 Correct 104 ms 184440 KB Output is correct
83 Correct 129 ms 184256 KB Output is correct
84 Correct 106 ms 184632 KB Output is correct
85 Correct 102 ms 184700 KB Output is correct
86 Correct 105 ms 184672 KB Output is correct
87 Correct 106 ms 184620 KB Output is correct
88 Correct 105 ms 184564 KB Output is correct
89 Correct 104 ms 184592 KB Output is correct
90 Correct 99 ms 184420 KB Output is correct
91 Correct 96 ms 184504 KB Output is correct
92 Correct 494 ms 214680 KB Output is correct
93 Correct 541 ms 214604 KB Output is correct
94 Correct 398 ms 213264 KB Output is correct
95 Correct 238 ms 214528 KB Output is correct
96 Correct 262 ms 214504 KB Output is correct
97 Correct 517 ms 218148 KB Output is correct
98 Correct 525 ms 219000 KB Output is correct
99 Correct 536 ms 214444 KB Output is correct
100 Correct 470 ms 215120 KB Output is correct
101 Correct 475 ms 214240 KB Output is correct
102 Correct 437 ms 208588 KB Output is correct
103 Correct 468 ms 217552 KB Output is correct
104 Correct 496 ms 214428 KB Output is correct
105 Correct 488 ms 215692 KB Output is correct
106 Execution timed out 7116 ms 430540 KB Time limit exceeded
107 Halted 0 ms 0 KB -