oj.uz

답안 #526046

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
526046 2022-02-13T15:41:42 Z mjhmjh1104 Mountains and Valleys (CCO20_day1problem3) C++17
21 / 25
 7000 ms 483976 KB 
#include <set>
#include <cstdio>
#include <vector>
#include <utility>
#include <iterator>
#include <algorithm>
using namespace std;

struct Item {
    int posde = (int)-1e9;
    int negde = (int)-1e9;
    int ans = (int)-1e9;
} tree_split[1048576];

Item f(const Item a, const Item b) {
    Item ret = { max(a.posde, b.posde), max(a.negde, b.negde), max(a.ans, b.ans) };
    ret.ans = max(ret.ans, a.posde + b.negde);
    return ret;
}

int query_deg(int i, int b, int e, int l, int r) {
    if (r < l || r < b || e < l) return (int)-1e9;
    if (l <= b && e <= r) return tree_split[i].negde;
    int m = (b + e) / 2;
    return max(query_deg(i * 2 + 1, b, m, l, r), query_deg(i * 2 + 2, m + 1, e, l, r));
}

Item query_split(int i, int b, int e, int l, int r) {
    if (r < l || r < b || e < l) return Item{ (int)-1e9, (int)-1e9, (int)-1e9 };
    if (l <= b && e <= r) return tree_split[i];
    int m = (b + e) / 2;
    return f(query_split(i * 2 + 1, b, m, l, r), query_split(i * 2 + 2, m + 1, e, l, r));
}

int n, m;
vector<int> tree[500006], child[500006];
vector<pair<int, int>> adj[500006];
int sz[500006], depth[500006], par[500006];
int in[500006], top[500006], T;
int 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 f_dist[500006], edge[500006];

int query_hld_half(int u, int v) {
    int ret = (int)-1e9;
    int pv = -1;
    while (top[u] != top[v]) {
        if (depth[top[u]] < depth[top[v]]) swap(u, v);
        if (pv != -1) lt_depth[u].erase(lt_depth[u].find(max_depth[pv] + 1));
        ret = max(ret, (lt_depth[u].empty() ? 0 : *lt_depth[u].rbegin()) - depth[u]);
        if (pv != -1) lt_depth[u].insert(max_depth[pv] + 1);
        ret = max(ret, query_deg(0, 0, 524287, in[top[u]], in[u] - 1));
        pv = top[u];
        u = par[top[u]];
    }
    if (depth[u] < depth[v]) swap(u, v);
    if (pv != -1) lt_depth[u].erase(lt_depth[u].find(max_depth[pv] + 1));
    ret = max(ret, (lt_depth[u].empty() ? 0 : *lt_depth[u].rbegin()) - depth[u]);
    if (pv != -1) lt_depth[u].insert(max_depth[pv] + 1);
    ret = max(ret, query_deg(0, 0, 524287, in[v], in[u] - 1));
    return ret;
}

int query_hld_res(int u, int v) {
    vector<Item> z;
    int pv = -1;
    while (top[u] != top[v]) {
        if (depth[top[u]] < depth[top[v]]) swap(u, v);
        if (pv != -1) lt_depth[u].erase(lt_depth[u].find(max_depth[pv] + 1));
        int V = (lt_depth[u].empty() ? 0 : *lt_depth[u].rbegin());
        z.push_back(Item{ V + depth[u], V - depth[u], (int)-1e9 });
        if (pv != -1) lt_depth[u].insert(max_depth[pv] + 1);
        z.push_back(query_split(0, 0, 524287, in[top[u]], in[u] - 1));
        if (z.back().posde == (int)-1e9) z.pop_back();
        pv = top[u];
        u = par[top[u]];
    }
    if (depth[u] < depth[v]) swap(u, v);
    if (pv != -1) lt_depth[u].erase(lt_depth[u].find(max_depth[pv] + 1));
    int V = (lt_depth[u].empty() ? 0 : *lt_depth[u].rbegin());
    z.push_back(Item{ V + depth[u], V - depth[u], (int)-1e9 });
    if (pv != -1) lt_depth[u].insert(max_depth[pv] + 1);
    z.push_back(query_split(0, 0, 524287, in[v], in[u] - 1));
    if (z.back().posde == (int)-1e9) z.pop_back();
    reverse(z.begin(), z.end());
    int ret = (int)-1e9;
    for (auto &i: z) ret = max(ret, i.ans);
    for (int i = 0; i < (int)z.size(); i++) for (int j = i + 1; j < (int)z.size(); j++) ret = max(ret, z[i].posde + z[j].negde);
    return ret;
}

int dfs_dist(int x) {
    vector<int> v;
    max_depth[x] = 0;
    dist[x] = 0;
    for (auto &i: child[x]) {
        v.push_back(dfs_dist(i) + 1);
        max_depth[x] = max(max_depth[x], v.back());
        dist[x] = max(dist[x], dist[i]);
    }
    int v0 = max_element(v.begin(), v.end()) - v.begin();
    int X = v[v0];
    if (!v.empty()) v[v0] = 0;
    int v1 = max_element(v.begin(), v.end()) - v.begin();
    v[v0] = X;
    if (!v.empty()) dist[x] = max(dist[x], v[v0]);
    if ((int)v.size() > 1) dist[x] = max(dist[x], v[v0] + v[v1]);
    return max_depth[x];
}

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

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

int dfs_sz(int x) {
    sz[x] = 1;
    for (auto &i: child[x]) {
        depth[i] = depth[x] + 1;
        sz[x] += dfs_sz(i);
        if (sz[i] > sz[child[x][0]]) swap(child[x][0], i);
    }
    return sz[x];
}

void dfs_hld(int x) {
    in[x] = T++;
    for (auto &i: child[x]) {
        top[i] = (i == child[x][0] ? top[x] : i);
        dfs_hld(i);
    }
}

int lca(int u, int v) {
    int ret = 0;
    while (top[u] != top[v]) {
        if (depth[top[u]] < depth[top[v]]) swap(u, v);
        ret += depth[u] - depth[par[top[u]]];
        u = par[top[u]];
    }
    if (depth[u] > depth[v]) swap(u, v);
    return 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) {
        if (!lt_dist[u].empty()) ret = max(ret, *lt_dist[u].rbegin());
        if ((int)lt_depth[u].size() > 1) ret = max(ret, *lt_depth[u].rbegin() + *prev(prev(lt_depth[u].end())));
        u = sp[0][u];
    }
    if (v != l) {
        if (!lt_dist[v].empty()) ret = max(ret, *lt_dist[v].rbegin());
        if ((int)lt_depth[v].size() > 1) ret = max(ret, *lt_depth[v].rbegin() + *prev(prev(lt_depth[v].end())));
        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[x].push_back({ y, w });
            adj[y].push_back({ x, w });
        }
    }
    dfs_child(0);
    dfs_sz(0);
    dfs_hld(0);
    dfs_dist(0);
    dfs_rev_dist(0);
    dfs_edge(0);
    for (int i = 0; i < n; i++) for (auto &j: child[i]) {
        lt_depth[i].insert(max_depth[j] + 1);
        lt_dist[i].insert(dist[j]);
    }
    dfs_f_dist(0);
    for (int i = 0; i < n; i++) sp[0][i] = par[i], sp_dist[0][i] = max(f_dist[i], edge[i]);
    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];
        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]]);
    }
    for (int i = 0; i < n; i++) {
        int v = 0;
        if (!child[i].empty()) lt_depth[i].erase(lt_depth[i].find(max_depth[child[i][0]] + 1));
        if (!lt_depth[i].empty()) v = *lt_depth[i].rbegin();
        if (!child[i].empty()) lt_depth[i].insert(max_depth[child[i][0]] + 1);
        tree_split[524287 + in[i]] = { v + depth[i], v - depth[i], (int)-1e9 };
    }
    for (int i = 524286; i >= 0; i--) {
        tree_split[i] = f(tree_split[i * 2 + 1], tree_split[i * 2 + 2]);
    }
    int zero = 2 * (n - 1) - dist[0], one = (int)1e9;
    for (int i = 0; i < n; i++) for (auto &j: adj[i]) if (i < j.first) {
        int l = lca(i, j.first);
        int ds = depth[i] + depth[j.first] - depth[l] - depth[l];
        int curr = j.second + 2 * (n - 1) - ds - 1;
        int A = (i == l ? -1 : pr(i, depth[i] - depth[l] - 1));
        int B = (j.first == l ? -1 : pr(j.first, depth[j.first] - depth[l] - 1));
        int y = max(rev_dist[l] - 1, query_sp_dist(i, j.first, l, A, B) - 1);
        int Ap = (depth[i] - depth[l] - 2 >= 0 ? pr(i, depth[i] - depth[l] - 2) : -1);
        int Bp = (depth[j.first] - depth[l] - 2 >= 0 ? pr(j.first, depth[j.first] - depth[l] - 2) : -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_hld_half(A, i) + depth[l]);
        int Brt = (B == -1 ? (int)-1e9 : query_hld_half(B, j.first) + 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_hld_res(A, i) + 1);
        if (B != -1) y = max(y, query_hld_res(B, j.first) + 1);
        curr -= y;
        one = min(one, curr);
    }
    printf("%d", min(zero, one));
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:281:13: warning: unused variable 'Ap' [-Wunused-variable]
  281 |         int Ap = (depth[i] - depth[l] - 2 >= 0 ? pr(i, depth[i] - depth[l] - 2) : -1);
      |             ^~
Main.cpp:282:13: warning: unused variable 'Bp' [-Wunused-variable]
  282 |         int Bp = (depth[j.first] - depth[l] - 2 >= 0 ? pr(j.first, depth[j.first] - depth[l] - 2) : -1);
      |             ^~
Main.cpp:235:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  235 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp:238:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  238 |         scanf("%d%d%d", &x, &y, &w);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 88908 KB Output is correct
2 Correct 47 ms 88944 KB Output is correct
3 Correct 47 ms 88896 KB Output is correct
4 Correct 46 ms 88988 KB Output is correct
5 Correct 48 ms 88888 KB Output is correct
6 Correct 47 ms 88900 KB Output is correct
7 Correct 47 ms 89008 KB Output is correct
8 Correct 47 ms 88968 KB Output is correct
9 Correct 47 ms 88940 KB Output is correct
10 Correct 46 ms 89008 KB Output is correct
11 Correct 47 ms 88892 KB Output is correct
12 Correct 48 ms 88908 KB Output is correct
13 Correct 47 ms 89056 KB Output is correct
14 Correct 46 ms 88896 KB Output is correct
15 Correct 50 ms 89032 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 88908 KB Output is correct
2 Correct 47 ms 88944 KB Output is correct
3 Correct 47 ms 88896 KB Output is correct
4 Correct 46 ms 88988 KB Output is correct
5 Correct 48 ms 88888 KB Output is correct
6 Correct 47 ms 88900 KB Output is correct
7 Correct 47 ms 89008 KB Output is correct
8 Correct 47 ms 88968 KB Output is correct
9 Correct 47 ms 88940 KB Output is correct
10 Correct 46 ms 89008 KB Output is correct
11 Correct 47 ms 88892 KB Output is correct
12 Correct 48 ms 88908 KB Output is correct
13 Correct 47 ms 89056 KB Output is correct
14 Correct 46 ms 88896 KB Output is correct
15 Correct 50 ms 89032 KB Output is correct
16 Correct 47 ms 88904 KB Output is correct
17 Correct 47 ms 88908 KB Output is correct
18 Correct 47 ms 89008 KB Output is correct
19 Correct 47 ms 89008 KB Output is correct
20 Correct 45 ms 88900 KB Output is correct
21 Correct 47 ms 89004 KB Output is correct
22 Correct 47 ms 88908 KB Output is correct
23 Correct 47 ms 88940 KB Output is correct
24 Correct 47 ms 88900 KB Output is correct
25 Correct 48 ms 89012 KB Output is correct
26 Correct 52 ms 89012 KB Output is correct
27 Correct 48 ms 89012 KB Output is correct
28 Correct 47 ms 88900 KB Output is correct
29 Correct 47 ms 88980 KB Output is correct
30 Correct 47 ms 88900 KB Output is correct
31 Correct 47 ms 88948 KB Output is correct
32 Correct 53 ms 88992 KB Output is correct
33 Correct 51 ms 88936 KB Output is correct
34 Correct 47 ms 88900 KB Output is correct
35 Correct 47 ms 88988 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 67 ms 92100 KB Output is correct
2 Correct 64 ms 92592 KB Output is correct
3 Correct 80 ms 91692 KB Output is correct
4 Correct 67 ms 91380 KB Output is correct
5 Correct 67 ms 91220 KB Output is correct
6 Correct 67 ms 90856 KB Output is correct
7 Correct 65 ms 92328 KB Output is correct
8 Correct 75 ms 91848 KB Output is correct
9 Correct 64 ms 92336 KB Output is correct
10 Correct 70 ms 91372 KB Output is correct
11 Correct 68 ms 91768 KB Output is correct
12 Correct 65 ms 91152 KB Output is correct
13 Correct 74 ms 91608 KB Output is correct
14 Correct 66 ms 91524 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 88908 KB Output is correct
2 Correct 47 ms 88944 KB Output is correct
3 Correct 47 ms 88896 KB Output is correct
4 Correct 46 ms 88988 KB Output is correct
5 Correct 48 ms 88888 KB Output is correct
6 Correct 47 ms 88900 KB Output is correct
7 Correct 47 ms 89008 KB Output is correct
8 Correct 47 ms 88968 KB Output is correct
9 Correct 47 ms 88940 KB Output is correct
10 Correct 46 ms 89008 KB Output is correct
11 Correct 47 ms 88892 KB Output is correct
12 Correct 48 ms 88908 KB Output is correct
13 Correct 47 ms 89056 KB Output is correct
14 Correct 46 ms 88896 KB Output is correct
15 Correct 50 ms 89032 KB Output is correct
16 Correct 47 ms 88904 KB Output is correct
17 Correct 47 ms 88908 KB Output is correct
18 Correct 47 ms 89008 KB Output is correct
19 Correct 47 ms 89008 KB Output is correct
20 Correct 45 ms 88900 KB Output is correct
21 Correct 47 ms 89004 KB Output is correct
22 Correct 47 ms 88908 KB Output is correct
23 Correct 47 ms 88940 KB Output is correct
24 Correct 47 ms 88900 KB Output is correct
25 Correct 48 ms 89012 KB Output is correct
26 Correct 52 ms 89012 KB Output is correct
27 Correct 48 ms 89012 KB Output is correct
28 Correct 47 ms 88900 KB Output is correct
29 Correct 47 ms 88980 KB Output is correct
30 Correct 47 ms 88900 KB Output is correct
31 Correct 47 ms 88948 KB Output is correct
32 Correct 53 ms 88992 KB Output is correct
33 Correct 51 ms 88936 KB Output is correct
34 Correct 47 ms 88900 KB Output is correct
35 Correct 47 ms 88988 KB Output is correct
36 Correct 47 ms 89040 KB Output is correct
37 Correct 47 ms 89040 KB Output is correct
38 Correct 49 ms 89028 KB Output is correct
39 Correct 48 ms 88980 KB Output is correct
40 Correct 53 ms 89156 KB Output is correct
41 Correct 49 ms 89032 KB Output is correct
42 Correct 53 ms 88952 KB Output is correct
43 Correct 47 ms 89044 KB Output is correct
44 Correct 47 ms 88924 KB Output is correct
45 Correct 50 ms 88940 KB Output is correct
46 Correct 52 ms 89028 KB Output is correct
47 Correct 50 ms 88948 KB Output is correct
48 Correct 48 ms 89016 KB Output is correct
49 Correct 47 ms 89028 KB Output is correct

Subtask #5
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 88908 KB Output is correct
2 Correct 47 ms 88944 KB Output is correct
3 Correct 47 ms 88896 KB Output is correct
4 Correct 46 ms 88988 KB Output is correct
5 Correct 48 ms 88888 KB Output is correct
6 Correct 47 ms 88900 KB Output is correct
7 Correct 47 ms 89008 KB Output is correct
8 Correct 47 ms 88968 KB Output is correct
9 Correct 47 ms 88940 KB Output is correct
10 Correct 46 ms 89008 KB Output is correct
11 Correct 47 ms 88892 KB Output is correct
12 Correct 48 ms 88908 KB Output is correct
13 Correct 47 ms 89056 KB Output is correct
14 Correct 46 ms 88896 KB Output is correct
15 Correct 50 ms 89032 KB Output is correct
16 Correct 47 ms 88904 KB Output is correct
17 Correct 47 ms 88908 KB Output is correct
18 Correct 47 ms 89008 KB Output is correct
19 Correct 47 ms 89008 KB Output is correct
20 Correct 45 ms 88900 KB Output is correct
21 Correct 47 ms 89004 KB Output is correct
22 Correct 47 ms 88908 KB Output is correct
23 Correct 47 ms 88940 KB Output is correct
24 Correct 47 ms 88900 KB Output is correct
25 Correct 48 ms 89012 KB Output is correct
26 Correct 52 ms 89012 KB Output is correct
27 Correct 48 ms 89012 KB Output is correct
28 Correct 47 ms 88900 KB Output is correct
29 Correct 47 ms 88980 KB Output is correct
30 Correct 47 ms 88900 KB Output is correct
31 Correct 47 ms 88948 KB Output is correct
32 Correct 53 ms 88992 KB Output is correct
33 Correct 51 ms 88936 KB Output is correct
34 Correct 47 ms 88900 KB Output is correct
35 Correct 47 ms 88988 KB Output is correct
36 Correct 47 ms 89040 KB Output is correct
37 Correct 47 ms 89040 KB Output is correct
38 Correct 49 ms 89028 KB Output is correct
39 Correct 48 ms 88980 KB Output is correct
40 Correct 53 ms 89156 KB Output is correct
41 Correct 49 ms 89032 KB Output is correct
42 Correct 53 ms 88952 KB Output is correct
43 Correct 47 ms 89044 KB Output is correct
44 Correct 47 ms 88924 KB Output is correct
45 Correct 50 ms 88940 KB Output is correct
46 Correct 52 ms 89028 KB Output is correct
47 Correct 50 ms 88948 KB Output is correct
48 Correct 48 ms 89016 KB Output is correct
49 Correct 47 ms 89028 KB Output is correct
50 Correct 53 ms 89224 KB Output is correct
51 Correct 49 ms 89284 KB Output is correct
52 Correct 54 ms 89188 KB Output is correct
53 Correct 49 ms 89224 KB Output is correct
54 Correct 49 ms 89168 KB Output is correct
55 Correct 48 ms 89164 KB Output is correct
56 Correct 55 ms 89216 KB Output is correct
57 Correct 48 ms 89216 KB Output is correct
58 Correct 48 ms 89176 KB Output is correct
59 Correct 55 ms 89248 KB Output is correct
60 Correct 54 ms 89184 KB Output is correct
61 Correct 48 ms 89164 KB Output is correct
62 Correct 48 ms 89132 KB Output is correct
63 Correct 53 ms 89332 KB Output is correct

Subtask #6
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 88908 KB Output is correct
2 Correct 47 ms 88944 KB Output is correct
3 Correct 47 ms 88896 KB Output is correct
4 Correct 46 ms 88988 KB Output is correct
5 Correct 48 ms 88888 KB Output is correct
6 Correct 47 ms 88900 KB Output is correct
7 Correct 47 ms 89008 KB Output is correct
8 Correct 47 ms 88968 KB Output is correct
9 Correct 47 ms 88940 KB Output is correct
10 Correct 46 ms 89008 KB Output is correct
11 Correct 47 ms 88892 KB Output is correct
12 Correct 48 ms 88908 KB Output is correct
13 Correct 47 ms 89056 KB Output is correct
14 Correct 46 ms 88896 KB Output is correct
15 Correct 50 ms 89032 KB Output is correct
16 Correct 47 ms 88904 KB Output is correct
17 Correct 47 ms 88908 KB Output is correct
18 Correct 47 ms 89008 KB Output is correct
19 Correct 47 ms 89008 KB Output is correct
20 Correct 45 ms 88900 KB Output is correct
21 Correct 47 ms 89004 KB Output is correct
22 Correct 47 ms 88908 KB Output is correct
23 Correct 47 ms 88940 KB Output is correct
24 Correct 47 ms 88900 KB Output is correct
25 Correct 48 ms 89012 KB Output is correct
26 Correct 52 ms 89012 KB Output is correct
27 Correct 48 ms 89012 KB Output is correct
28 Correct 47 ms 88900 KB Output is correct
29 Correct 47 ms 88980 KB Output is correct
30 Correct 47 ms 88900 KB Output is correct
31 Correct 47 ms 88948 KB Output is correct
32 Correct 53 ms 88992 KB Output is correct
33 Correct 51 ms 88936 KB Output is correct
34 Correct 47 ms 88900 KB Output is correct
35 Correct 47 ms 88988 KB Output is correct
36 Correct 67 ms 92100 KB Output is correct
37 Correct 64 ms 92592 KB Output is correct
38 Correct 80 ms 91692 KB Output is correct
39 Correct 67 ms 91380 KB Output is correct
40 Correct 67 ms 91220 KB Output is correct
41 Correct 67 ms 90856 KB Output is correct
42 Correct 65 ms 92328 KB Output is correct
43 Correct 75 ms 91848 KB Output is correct
44 Correct 64 ms 92336 KB Output is correct
45 Correct 70 ms 91372 KB Output is correct
46 Correct 68 ms 91768 KB Output is correct
47 Correct 65 ms 91152 KB Output is correct
48 Correct 74 ms 91608 KB Output is correct
49 Correct 66 ms 91524 KB Output is correct
50 Correct 47 ms 89040 KB Output is correct
51 Correct 47 ms 89040 KB Output is correct
52 Correct 49 ms 89028 KB Output is correct
53 Correct 48 ms 88980 KB Output is correct
54 Correct 53 ms 89156 KB Output is correct
55 Correct 49 ms 89032 KB Output is correct
56 Correct 53 ms 88952 KB Output is correct
57 Correct 47 ms 89044 KB Output is correct
58 Correct 47 ms 88924 KB Output is correct
59 Correct 50 ms 88940 KB Output is correct
60 Correct 52 ms 89028 KB Output is correct
61 Correct 50 ms 88948 KB Output is correct
62 Correct 48 ms 89016 KB Output is correct
63 Correct 47 ms 89028 KB Output is correct
64 Correct 53 ms 89224 KB Output is correct
65 Correct 49 ms 89284 KB Output is correct
66 Correct 54 ms 89188 KB Output is correct
67 Correct 49 ms 89224 KB Output is correct
68 Correct 49 ms 89168 KB Output is correct
69 Correct 48 ms 89164 KB Output is correct
70 Correct 55 ms 89216 KB Output is correct
71 Correct 48 ms 89216 KB Output is correct
72 Correct 48 ms 89176 KB Output is correct
73 Correct 55 ms 89248 KB Output is correct
74 Correct 54 ms 89184 KB Output is correct
75 Correct 48 ms 89164 KB Output is correct
76 Correct 48 ms 89132 KB Output is correct
77 Correct 53 ms 89332 KB Output is correct
78 Correct 67 ms 91656 KB Output is correct
79 Correct 68 ms 91844 KB Output is correct
80 Correct 72 ms 91552 KB Output is correct
81 Correct 68 ms 91600 KB Output is correct
82 Correct 76 ms 91204 KB Output is correct
83 Correct 70 ms 90792 KB Output is correct
84 Correct 65 ms 91716 KB Output is correct
85 Correct 67 ms 91924 KB Output is correct
86 Correct 69 ms 92136 KB Output is correct
87 Correct 70 ms 91452 KB Output is correct
88 Correct 78 ms 91516 KB Output is correct
89 Correct 68 ms 91312 KB Output is correct
90 Correct 57 ms 91312 KB Output is correct
91 Correct 56 ms 91392 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 88908 KB Output is correct
2 Correct 47 ms 88944 KB Output is correct
3 Correct 47 ms 88896 KB Output is correct
4 Correct 46 ms 88988 KB Output is correct
5 Correct 48 ms 88888 KB Output is correct
6 Correct 47 ms 88900 KB Output is correct
7 Correct 47 ms 89008 KB Output is correct
8 Correct 47 ms 88968 KB Output is correct
9 Correct 47 ms 88940 KB Output is correct
10 Correct 46 ms 89008 KB Output is correct
11 Correct 47 ms 88892 KB Output is correct
12 Correct 48 ms 88908 KB Output is correct
13 Correct 47 ms 89056 KB Output is correct
14 Correct 46 ms 88896 KB Output is correct
15 Correct 50 ms 89032 KB Output is correct
16 Correct 47 ms 88904 KB Output is correct
17 Correct 47 ms 88908 KB Output is correct
18 Correct 47 ms 89008 KB Output is correct
19 Correct 47 ms 89008 KB Output is correct
20 Correct 45 ms 88900 KB Output is correct
21 Correct 47 ms 89004 KB Output is correct
22 Correct 47 ms 88908 KB Output is correct
23 Correct 47 ms 88940 KB Output is correct
24 Correct 47 ms 88900 KB Output is correct
25 Correct 48 ms 89012 KB Output is correct
26 Correct 52 ms 89012 KB Output is correct
27 Correct 48 ms 89012 KB Output is correct
28 Correct 47 ms 88900 KB Output is correct
29 Correct 47 ms 88980 KB Output is correct
30 Correct 47 ms 88900 KB Output is correct
31 Correct 47 ms 88948 KB Output is correct
32 Correct 53 ms 88992 KB Output is correct
33 Correct 51 ms 88936 KB Output is correct
34 Correct 47 ms 88900 KB Output is correct
35 Correct 47 ms 88988 KB Output is correct
36 Correct 67 ms 92100 KB Output is correct
37 Correct 64 ms 92592 KB Output is correct
38 Correct 80 ms 91692 KB Output is correct
39 Correct 67 ms 91380 KB Output is correct
40 Correct 67 ms 91220 KB Output is correct
41 Correct 67 ms 90856 KB Output is correct
42 Correct 65 ms 92328 KB Output is correct
43 Correct 75 ms 91848 KB Output is correct
44 Correct 64 ms 92336 KB Output is correct
45 Correct 70 ms 91372 KB Output is correct
46 Correct 68 ms 91768 KB Output is correct
47 Correct 65 ms 91152 KB Output is correct
48 Correct 74 ms 91608 KB Output is correct
49 Correct 66 ms 91524 KB Output is correct
50 Correct 47 ms 89040 KB Output is correct
51 Correct 47 ms 89040 KB Output is correct
52 Correct 49 ms 89028 KB Output is correct
53 Correct 48 ms 88980 KB Output is correct
54 Correct 53 ms 89156 KB Output is correct
55 Correct 49 ms 89032 KB Output is correct
56 Correct 53 ms 88952 KB Output is correct
57 Correct 47 ms 89044 KB Output is correct
58 Correct 47 ms 88924 KB Output is correct
59 Correct 50 ms 88940 KB Output is correct
60 Correct 52 ms 89028 KB Output is correct
61 Correct 50 ms 88948 KB Output is correct
62 Correct 48 ms 89016 KB Output is correct
63 Correct 47 ms 89028 KB Output is correct
64 Correct 53 ms 89224 KB Output is correct
65 Correct 49 ms 89284 KB Output is correct
66 Correct 54 ms 89188 KB Output is correct
67 Correct 49 ms 89224 KB Output is correct
68 Correct 49 ms 89168 KB Output is correct
69 Correct 48 ms 89164 KB Output is correct
70 Correct 55 ms 89216 KB Output is correct
71 Correct 48 ms 89216 KB Output is correct
72 Correct 48 ms 89176 KB Output is correct
73 Correct 55 ms 89248 KB Output is correct
74 Correct 54 ms 89184 KB Output is correct
75 Correct 48 ms 89164 KB Output is correct
76 Correct 48 ms 89132 KB Output is correct
77 Correct 53 ms 89332 KB Output is correct
78 Correct 67 ms 91656 KB Output is correct
79 Correct 68 ms 91844 KB Output is correct
80 Correct 72 ms 91552 KB Output is correct
81 Correct 68 ms 91600 KB Output is correct
82 Correct 76 ms 91204 KB Output is correct
83 Correct 70 ms 90792 KB Output is correct
84 Correct 65 ms 91716 KB Output is correct
85 Correct 67 ms 91924 KB Output is correct
86 Correct 69 ms 92136 KB Output is correct
87 Correct 70 ms 91452 KB Output is correct
88 Correct 78 ms 91516 KB Output is correct
89 Correct 68 ms 91312 KB Output is correct
90 Correct 57 ms 91312 KB Output is correct
91 Correct 56 ms 91392 KB Output is correct
92 Correct 529 ms 128652 KB Output is correct
93 Correct 541 ms 128468 KB Output is correct
94 Correct 428 ms 125356 KB Output is correct
95 Correct 261 ms 128452 KB Output is correct
96 Correct 233 ms 128300 KB Output is correct
97 Correct 519 ms 140364 KB Output is correct
98 Correct 518 ms 143224 KB Output is correct
99 Correct 560 ms 127940 KB Output is correct
100 Correct 539 ms 129600 KB Output is correct
101 Correct 518 ms 127620 KB Output is correct
102 Correct 503 ms 118500 KB Output is correct
103 Correct 535 ms 137852 KB Output is correct
104 Correct 600 ms 129960 KB Output is correct
105 Correct 563 ms 132676 KB Output is correct

Subtask #8
0.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 88908 KB Output is correct
2 Correct 47 ms 88944 KB Output is correct
3 Correct 47 ms 88896 KB Output is correct
4 Correct 46 ms 88988 KB Output is correct
5 Correct 48 ms 88888 KB Output is correct
6 Correct 47 ms 88900 KB Output is correct
7 Correct 47 ms 89008 KB Output is correct
8 Correct 47 ms 88968 KB Output is correct
9 Correct 47 ms 88940 KB Output is correct
10 Correct 46 ms 89008 KB Output is correct
11 Correct 47 ms 88892 KB Output is correct
12 Correct 48 ms 88908 KB Output is correct
13 Correct 47 ms 89056 KB Output is correct
14 Correct 46 ms 88896 KB Output is correct
15 Correct 50 ms 89032 KB Output is correct
16 Correct 47 ms 88904 KB Output is correct
17 Correct 47 ms 88908 KB Output is correct
18 Correct 47 ms 89008 KB Output is correct
19 Correct 47 ms 89008 KB Output is correct
20 Correct 45 ms 88900 KB Output is correct
21 Correct 47 ms 89004 KB Output is correct
22 Correct 47 ms 88908 KB Output is correct
23 Correct 47 ms 88940 KB Output is correct
24 Correct 47 ms 88900 KB Output is correct
25 Correct 48 ms 89012 KB Output is correct
26 Correct 52 ms 89012 KB Output is correct
27 Correct 48 ms 89012 KB Output is correct
28 Correct 47 ms 88900 KB Output is correct
29 Correct 47 ms 88980 KB Output is correct
30 Correct 47 ms 88900 KB Output is correct
31 Correct 47 ms 88948 KB Output is correct
32 Correct 53 ms 88992 KB Output is correct
33 Correct 51 ms 88936 KB Output is correct
34 Correct 47 ms 88900 KB Output is correct
35 Correct 47 ms 88988 KB Output is correct
36 Correct 67 ms 92100 KB Output is correct
37 Correct 64 ms 92592 KB Output is correct
38 Correct 80 ms 91692 KB Output is correct
39 Correct 67 ms 91380 KB Output is correct
40 Correct 67 ms 91220 KB Output is correct
41 Correct 67 ms 90856 KB Output is correct
42 Correct 65 ms 92328 KB Output is correct
43 Correct 75 ms 91848 KB Output is correct
44 Correct 64 ms 92336 KB Output is correct
45 Correct 70 ms 91372 KB Output is correct
46 Correct 68 ms 91768 KB Output is correct
47 Correct 65 ms 91152 KB Output is correct
48 Correct 74 ms 91608 KB Output is correct
49 Correct 66 ms 91524 KB Output is correct
50 Correct 47 ms 89040 KB Output is correct
51 Correct 47 ms 89040 KB Output is correct
52 Correct 49 ms 89028 KB Output is correct
53 Correct 48 ms 88980 KB Output is correct
54 Correct 53 ms 89156 KB Output is correct
55 Correct 49 ms 89032 KB Output is correct
56 Correct 53 ms 88952 KB Output is correct
57 Correct 47 ms 89044 KB Output is correct
58 Correct 47 ms 88924 KB Output is correct
59 Correct 50 ms 88940 KB Output is correct
60 Correct 52 ms 89028 KB Output is correct
61 Correct 50 ms 88948 KB Output is correct
62 Correct 48 ms 89016 KB Output is correct
63 Correct 47 ms 89028 KB Output is correct
64 Correct 53 ms 89224 KB Output is correct
65 Correct 49 ms 89284 KB Output is correct
66 Correct 54 ms 89188 KB Output is correct
67 Correct 49 ms 89224 KB Output is correct
68 Correct 49 ms 89168 KB Output is correct
69 Correct 48 ms 89164 KB Output is correct
70 Correct 55 ms 89216 KB Output is correct
71 Correct 48 ms 89216 KB Output is correct
72 Correct 48 ms 89176 KB Output is correct
73 Correct 55 ms 89248 KB Output is correct
74 Correct 54 ms 89184 KB Output is correct
75 Correct 48 ms 89164 KB Output is correct
76 Correct 48 ms 89132 KB Output is correct
77 Correct 53 ms 89332 KB Output is correct
78 Correct 67 ms 91656 KB Output is correct
79 Correct 68 ms 91844 KB Output is correct
80 Correct 72 ms 91552 KB Output is correct
81 Correct 68 ms 91600 KB Output is correct
82 Correct 76 ms 91204 KB Output is correct
83 Correct 70 ms 90792 KB Output is correct
84 Correct 65 ms 91716 KB Output is correct
85 Correct 67 ms 91924 KB Output is correct
86 Correct 69 ms 92136 KB Output is correct
87 Correct 70 ms 91452 KB Output is correct
88 Correct 78 ms 91516 KB Output is correct
89 Correct 68 ms 91312 KB Output is correct
90 Correct 57 ms 91312 KB Output is correct
91 Correct 56 ms 91392 KB Output is correct
92 Correct 529 ms 128652 KB Output is correct
93 Correct 541 ms 128468 KB Output is correct
94 Correct 428 ms 125356 KB Output is correct
95 Correct 261 ms 128452 KB Output is correct
96 Correct 233 ms 128300 KB Output is correct
97 Correct 519 ms 140364 KB Output is correct
98 Correct 518 ms 143224 KB Output is correct
99 Correct 560 ms 127940 KB Output is correct
100 Correct 539 ms 129600 KB Output is correct
101 Correct 518 ms 127620 KB Output is correct
102 Correct 503 ms 118500 KB Output is correct
103 Correct 535 ms 137852 KB Output is correct
104 Correct 600 ms 129960 KB Output is correct
105 Correct 563 ms 132676 KB Output is correct
106 Execution timed out 7083 ms 483976 KB Time limit exceeded
107 Halted 0 ms 0 KB -