oj.uz

답안 #526124

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
526124 2022-02-13T19:33:44 Z mjhmjh1104 Mountains and Valleys (CCO20_day1problem3) C++17
21 / 25
 7000 ms 580104 KB 
#include <set>
#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];

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 n, m;
vector<int> tree[500006], child[500006];
vector<pair<int, int>> adj[500006];
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 Ap, int x) {
    int ret = prev_depth[x][0] - depth[x];
    if (Ap == -1) return ret;
    for (int t = 18; t >= 0; t--) if (sp[t][x] != -1 && depth[sp[t][x]] >= depth[Ap]) {
        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 Ap, int x) {
    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[Ap]) {
        ret = f(sp_split[t][x], ret);
        x = sp[t][x];
    }
    return f(sp_split[0][x], ret).ans;
}

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]));
        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 lca(int u, int v) {
    if (depth[u] < depth[v]) swap(u, v);
    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];
    }
    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[x].push_back({ y, w });
            adj[y].push_back({ x, w });
        }
    }
    dfs_child(0);
    dfs_dist(0);
    dfs_rev_dist(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]);
    }
    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] = f(sp_split[t - 1][sp[t - 1][i]], sp_split[t - 1][i]);
        }
    }
    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_sp_half(Ap, i) + depth[l]);
        int Brt = (B == -1 ? (int)-1e9 : query_sp_half(Bp, 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 (Ap != -1) y = max(y, query_sp_res(Ap, i) + 1);
        if (Bp != -1) y = max(y, query_sp_res(Bp, j.first) + 1);
        curr -= y;
        one = min(one, curr);
    }
    printf("%d", min(zero, one));
}

Compilation message

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

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 194304 KB Output is correct
2 Correct 87 ms 194272 KB Output is correct
3 Correct 84 ms 194268 KB Output is correct
4 Correct 84 ms 194244 KB Output is correct
5 Correct 82 ms 194272 KB Output is correct
6 Correct 83 ms 194244 KB Output is correct
7 Correct 87 ms 194280 KB Output is correct
8 Correct 82 ms 194244 KB Output is correct
9 Correct 83 ms 194348 KB Output is correct
10 Correct 83 ms 194272 KB Output is correct
11 Correct 87 ms 194292 KB Output is correct
12 Correct 82 ms 194340 KB Output is correct
13 Correct 84 ms 194316 KB Output is correct
14 Correct 85 ms 194312 KB Output is correct
15 Correct 89 ms 194360 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 194304 KB Output is correct
2 Correct 87 ms 194272 KB Output is correct
3 Correct 84 ms 194268 KB Output is correct
4 Correct 84 ms 194244 KB Output is correct
5 Correct 82 ms 194272 KB Output is correct
6 Correct 83 ms 194244 KB Output is correct
7 Correct 87 ms 194280 KB Output is correct
8 Correct 82 ms 194244 KB Output is correct
9 Correct 83 ms 194348 KB Output is correct
10 Correct 83 ms 194272 KB Output is correct
11 Correct 87 ms 194292 KB Output is correct
12 Correct 82 ms 194340 KB Output is correct
13 Correct 84 ms 194316 KB Output is correct
14 Correct 85 ms 194312 KB Output is correct
15 Correct 89 ms 194360 KB Output is correct
16 Correct 85 ms 194300 KB Output is correct
17 Correct 88 ms 194320 KB Output is correct
18 Correct 84 ms 194288 KB Output is correct
19 Correct 84 ms 194344 KB Output is correct
20 Correct 83 ms 194240 KB Output is correct
21 Correct 85 ms 194244 KB Output is correct
22 Correct 91 ms 194332 KB Output is correct
23 Correct 86 ms 194280 KB Output is correct
24 Correct 84 ms 194296 KB Output is correct
25 Correct 84 ms 194304 KB Output is correct
26 Correct 97 ms 194320 KB Output is correct
27 Correct 84 ms 194244 KB Output is correct
28 Correct 84 ms 194348 KB Output is correct
29 Correct 83 ms 194244 KB Output is correct
30 Correct 84 ms 194316 KB Output is correct
31 Correct 85 ms 194276 KB Output is correct
32 Correct 84 ms 194240 KB Output is correct
33 Correct 86 ms 194500 KB Output is correct
34 Correct 84 ms 194360 KB Output is correct
35 Correct 84 ms 194244 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 101 ms 197472 KB Output is correct
2 Correct 99 ms 197860 KB Output is correct
3 Correct 104 ms 197060 KB Output is correct
4 Correct 99 ms 196700 KB Output is correct
5 Correct 98 ms 196708 KB Output is correct
6 Correct 100 ms 196164 KB Output is correct
7 Correct 99 ms 197712 KB Output is correct
8 Correct 101 ms 197228 KB Output is correct
9 Correct 126 ms 197700 KB Output is correct
10 Correct 99 ms 196652 KB Output is correct
11 Correct 103 ms 197116 KB Output is correct
12 Correct 97 ms 196556 KB Output is correct
13 Correct 103 ms 196916 KB Output is correct
14 Correct 98 ms 196940 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 194304 KB Output is correct
2 Correct 87 ms 194272 KB Output is correct
3 Correct 84 ms 194268 KB Output is correct
4 Correct 84 ms 194244 KB Output is correct
5 Correct 82 ms 194272 KB Output is correct
6 Correct 83 ms 194244 KB Output is correct
7 Correct 87 ms 194280 KB Output is correct
8 Correct 82 ms 194244 KB Output is correct
9 Correct 83 ms 194348 KB Output is correct
10 Correct 83 ms 194272 KB Output is correct
11 Correct 87 ms 194292 KB Output is correct
12 Correct 82 ms 194340 KB Output is correct
13 Correct 84 ms 194316 KB Output is correct
14 Correct 85 ms 194312 KB Output is correct
15 Correct 89 ms 194360 KB Output is correct
16 Correct 85 ms 194300 KB Output is correct
17 Correct 88 ms 194320 KB Output is correct
18 Correct 84 ms 194288 KB Output is correct
19 Correct 84 ms 194344 KB Output is correct
20 Correct 83 ms 194240 KB Output is correct
21 Correct 85 ms 194244 KB Output is correct
22 Correct 91 ms 194332 KB Output is correct
23 Correct 86 ms 194280 KB Output is correct
24 Correct 84 ms 194296 KB Output is correct
25 Correct 84 ms 194304 KB Output is correct
26 Correct 97 ms 194320 KB Output is correct
27 Correct 84 ms 194244 KB Output is correct
28 Correct 84 ms 194348 KB Output is correct
29 Correct 83 ms 194244 KB Output is correct
30 Correct 84 ms 194316 KB Output is correct
31 Correct 85 ms 194276 KB Output is correct
32 Correct 84 ms 194240 KB Output is correct
33 Correct 86 ms 194500 KB Output is correct
34 Correct 84 ms 194360 KB Output is correct
35 Correct 84 ms 194244 KB Output is correct
36 Correct 83 ms 194320 KB Output is correct
37 Correct 85 ms 194348 KB Output is correct
38 Correct 87 ms 194388 KB Output is correct
39 Correct 83 ms 194372 KB Output is correct
40 Correct 86 ms 194476 KB Output is correct
41 Correct 84 ms 194372 KB Output is correct
42 Correct 85 ms 194292 KB Output is correct
43 Correct 83 ms 194372 KB Output is correct
44 Correct 84 ms 194348 KB Output is correct
45 Correct 86 ms 194272 KB Output is correct
46 Correct 85 ms 194284 KB Output is correct
47 Correct 85 ms 194380 KB Output is correct
48 Correct 84 ms 194272 KB Output is correct
49 Correct 85 ms 194400 KB Output is correct

Subtask #5
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 194304 KB Output is correct
2 Correct 87 ms 194272 KB Output is correct
3 Correct 84 ms 194268 KB Output is correct
4 Correct 84 ms 194244 KB Output is correct
5 Correct 82 ms 194272 KB Output is correct
6 Correct 83 ms 194244 KB Output is correct
7 Correct 87 ms 194280 KB Output is correct
8 Correct 82 ms 194244 KB Output is correct
9 Correct 83 ms 194348 KB Output is correct
10 Correct 83 ms 194272 KB Output is correct
11 Correct 87 ms 194292 KB Output is correct
12 Correct 82 ms 194340 KB Output is correct
13 Correct 84 ms 194316 KB Output is correct
14 Correct 85 ms 194312 KB Output is correct
15 Correct 89 ms 194360 KB Output is correct
16 Correct 85 ms 194300 KB Output is correct
17 Correct 88 ms 194320 KB Output is correct
18 Correct 84 ms 194288 KB Output is correct
19 Correct 84 ms 194344 KB Output is correct
20 Correct 83 ms 194240 KB Output is correct
21 Correct 85 ms 194244 KB Output is correct
22 Correct 91 ms 194332 KB Output is correct
23 Correct 86 ms 194280 KB Output is correct
24 Correct 84 ms 194296 KB Output is correct
25 Correct 84 ms 194304 KB Output is correct
26 Correct 97 ms 194320 KB Output is correct
27 Correct 84 ms 194244 KB Output is correct
28 Correct 84 ms 194348 KB Output is correct
29 Correct 83 ms 194244 KB Output is correct
30 Correct 84 ms 194316 KB Output is correct
31 Correct 85 ms 194276 KB Output is correct
32 Correct 84 ms 194240 KB Output is correct
33 Correct 86 ms 194500 KB Output is correct
34 Correct 84 ms 194360 KB Output is correct
35 Correct 84 ms 194244 KB Output is correct
36 Correct 83 ms 194320 KB Output is correct
37 Correct 85 ms 194348 KB Output is correct
38 Correct 87 ms 194388 KB Output is correct
39 Correct 83 ms 194372 KB Output is correct
40 Correct 86 ms 194476 KB Output is correct
41 Correct 84 ms 194372 KB Output is correct
42 Correct 85 ms 194292 KB Output is correct
43 Correct 83 ms 194372 KB Output is correct
44 Correct 84 ms 194348 KB Output is correct
45 Correct 86 ms 194272 KB Output is correct
46 Correct 85 ms 194284 KB Output is correct
47 Correct 85 ms 194380 KB Output is correct
48 Correct 84 ms 194272 KB Output is correct
49 Correct 85 ms 194400 KB Output is correct
50 Correct 85 ms 194644 KB Output is correct
51 Correct 90 ms 194632 KB Output is correct
52 Correct 85 ms 194556 KB Output is correct
53 Correct 85 ms 194500 KB Output is correct
54 Correct 87 ms 194580 KB Output is correct
55 Correct 85 ms 194440 KB Output is correct
56 Correct 89 ms 194620 KB Output is correct
57 Correct 90 ms 194572 KB Output is correct
58 Correct 85 ms 194596 KB Output is correct
59 Correct 85 ms 194496 KB Output is correct
60 Correct 86 ms 194512 KB Output is correct
61 Correct 86 ms 194564 KB Output is correct
62 Correct 92 ms 194500 KB Output is correct
63 Correct 89 ms 194512 KB Output is correct

Subtask #6
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 194304 KB Output is correct
2 Correct 87 ms 194272 KB Output is correct
3 Correct 84 ms 194268 KB Output is correct
4 Correct 84 ms 194244 KB Output is correct
5 Correct 82 ms 194272 KB Output is correct
6 Correct 83 ms 194244 KB Output is correct
7 Correct 87 ms 194280 KB Output is correct
8 Correct 82 ms 194244 KB Output is correct
9 Correct 83 ms 194348 KB Output is correct
10 Correct 83 ms 194272 KB Output is correct
11 Correct 87 ms 194292 KB Output is correct
12 Correct 82 ms 194340 KB Output is correct
13 Correct 84 ms 194316 KB Output is correct
14 Correct 85 ms 194312 KB Output is correct
15 Correct 89 ms 194360 KB Output is correct
16 Correct 85 ms 194300 KB Output is correct
17 Correct 88 ms 194320 KB Output is correct
18 Correct 84 ms 194288 KB Output is correct
19 Correct 84 ms 194344 KB Output is correct
20 Correct 83 ms 194240 KB Output is correct
21 Correct 85 ms 194244 KB Output is correct
22 Correct 91 ms 194332 KB Output is correct
23 Correct 86 ms 194280 KB Output is correct
24 Correct 84 ms 194296 KB Output is correct
25 Correct 84 ms 194304 KB Output is correct
26 Correct 97 ms 194320 KB Output is correct
27 Correct 84 ms 194244 KB Output is correct
28 Correct 84 ms 194348 KB Output is correct
29 Correct 83 ms 194244 KB Output is correct
30 Correct 84 ms 194316 KB Output is correct
31 Correct 85 ms 194276 KB Output is correct
32 Correct 84 ms 194240 KB Output is correct
33 Correct 86 ms 194500 KB Output is correct
34 Correct 84 ms 194360 KB Output is correct
35 Correct 84 ms 194244 KB Output is correct
36 Correct 101 ms 197472 KB Output is correct
37 Correct 99 ms 197860 KB Output is correct
38 Correct 104 ms 197060 KB Output is correct
39 Correct 99 ms 196700 KB Output is correct
40 Correct 98 ms 196708 KB Output is correct
41 Correct 100 ms 196164 KB Output is correct
42 Correct 99 ms 197712 KB Output is correct
43 Correct 101 ms 197228 KB Output is correct
44 Correct 126 ms 197700 KB Output is correct
45 Correct 99 ms 196652 KB Output is correct
46 Correct 103 ms 197116 KB Output is correct
47 Correct 97 ms 196556 KB Output is correct
48 Correct 103 ms 196916 KB Output is correct
49 Correct 98 ms 196940 KB Output is correct
50 Correct 83 ms 194320 KB Output is correct
51 Correct 85 ms 194348 KB Output is correct
52 Correct 87 ms 194388 KB Output is correct
53 Correct 83 ms 194372 KB Output is correct
54 Correct 86 ms 194476 KB Output is correct
55 Correct 84 ms 194372 KB Output is correct
56 Correct 85 ms 194292 KB Output is correct
57 Correct 83 ms 194372 KB Output is correct
58 Correct 84 ms 194348 KB Output is correct
59 Correct 86 ms 194272 KB Output is correct
60 Correct 85 ms 194284 KB Output is correct
61 Correct 85 ms 194380 KB Output is correct
62 Correct 84 ms 194272 KB Output is correct
63 Correct 85 ms 194400 KB Output is correct
64 Correct 85 ms 194644 KB Output is correct
65 Correct 90 ms 194632 KB Output is correct
66 Correct 85 ms 194556 KB Output is correct
67 Correct 85 ms 194500 KB Output is correct
68 Correct 87 ms 194580 KB Output is correct
69 Correct 85 ms 194440 KB Output is correct
70 Correct 89 ms 194620 KB Output is correct
71 Correct 90 ms 194572 KB Output is correct
72 Correct 85 ms 194596 KB Output is correct
73 Correct 85 ms 194496 KB Output is correct
74 Correct 86 ms 194512 KB Output is correct
75 Correct 86 ms 194564 KB Output is correct
76 Correct 92 ms 194500 KB Output is correct
77 Correct 89 ms 194512 KB Output is correct
78 Correct 99 ms 197068 KB Output is correct
79 Correct 109 ms 197212 KB Output is correct
80 Correct 102 ms 196808 KB Output is correct
81 Correct 100 ms 196864 KB Output is correct
82 Correct 97 ms 196672 KB Output is correct
83 Correct 101 ms 196108 KB Output is correct
84 Correct 96 ms 197068 KB Output is correct
85 Correct 98 ms 197308 KB Output is correct
86 Correct 98 ms 197448 KB Output is correct
87 Correct 98 ms 196816 KB Output is correct
88 Correct 99 ms 196844 KB Output is correct
89 Correct 96 ms 196668 KB Output is correct
90 Correct 92 ms 196568 KB Output is correct
91 Correct 91 ms 196724 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 194304 KB Output is correct
2 Correct 87 ms 194272 KB Output is correct
3 Correct 84 ms 194268 KB Output is correct
4 Correct 84 ms 194244 KB Output is correct
5 Correct 82 ms 194272 KB Output is correct
6 Correct 83 ms 194244 KB Output is correct
7 Correct 87 ms 194280 KB Output is correct
8 Correct 82 ms 194244 KB Output is correct
9 Correct 83 ms 194348 KB Output is correct
10 Correct 83 ms 194272 KB Output is correct
11 Correct 87 ms 194292 KB Output is correct
12 Correct 82 ms 194340 KB Output is correct
13 Correct 84 ms 194316 KB Output is correct
14 Correct 85 ms 194312 KB Output is correct
15 Correct 89 ms 194360 KB Output is correct
16 Correct 85 ms 194300 KB Output is correct
17 Correct 88 ms 194320 KB Output is correct
18 Correct 84 ms 194288 KB Output is correct
19 Correct 84 ms 194344 KB Output is correct
20 Correct 83 ms 194240 KB Output is correct
21 Correct 85 ms 194244 KB Output is correct
22 Correct 91 ms 194332 KB Output is correct
23 Correct 86 ms 194280 KB Output is correct
24 Correct 84 ms 194296 KB Output is correct
25 Correct 84 ms 194304 KB Output is correct
26 Correct 97 ms 194320 KB Output is correct
27 Correct 84 ms 194244 KB Output is correct
28 Correct 84 ms 194348 KB Output is correct
29 Correct 83 ms 194244 KB Output is correct
30 Correct 84 ms 194316 KB Output is correct
31 Correct 85 ms 194276 KB Output is correct
32 Correct 84 ms 194240 KB Output is correct
33 Correct 86 ms 194500 KB Output is correct
34 Correct 84 ms 194360 KB Output is correct
35 Correct 84 ms 194244 KB Output is correct
36 Correct 101 ms 197472 KB Output is correct
37 Correct 99 ms 197860 KB Output is correct
38 Correct 104 ms 197060 KB Output is correct
39 Correct 99 ms 196700 KB Output is correct
40 Correct 98 ms 196708 KB Output is correct
41 Correct 100 ms 196164 KB Output is correct
42 Correct 99 ms 197712 KB Output is correct
43 Correct 101 ms 197228 KB Output is correct
44 Correct 126 ms 197700 KB Output is correct
45 Correct 99 ms 196652 KB Output is correct
46 Correct 103 ms 197116 KB Output is correct
47 Correct 97 ms 196556 KB Output is correct
48 Correct 103 ms 196916 KB Output is correct
49 Correct 98 ms 196940 KB Output is correct
50 Correct 83 ms 194320 KB Output is correct
51 Correct 85 ms 194348 KB Output is correct
52 Correct 87 ms 194388 KB Output is correct
53 Correct 83 ms 194372 KB Output is correct
54 Correct 86 ms 194476 KB Output is correct
55 Correct 84 ms 194372 KB Output is correct
56 Correct 85 ms 194292 KB Output is correct
57 Correct 83 ms 194372 KB Output is correct
58 Correct 84 ms 194348 KB Output is correct
59 Correct 86 ms 194272 KB Output is correct
60 Correct 85 ms 194284 KB Output is correct
61 Correct 85 ms 194380 KB Output is correct
62 Correct 84 ms 194272 KB Output is correct
63 Correct 85 ms 194400 KB Output is correct
64 Correct 85 ms 194644 KB Output is correct
65 Correct 90 ms 194632 KB Output is correct
66 Correct 85 ms 194556 KB Output is correct
67 Correct 85 ms 194500 KB Output is correct
68 Correct 87 ms 194580 KB Output is correct
69 Correct 85 ms 194440 KB Output is correct
70 Correct 89 ms 194620 KB Output is correct
71 Correct 90 ms 194572 KB Output is correct
72 Correct 85 ms 194596 KB Output is correct
73 Correct 85 ms 194496 KB Output is correct
74 Correct 86 ms 194512 KB Output is correct
75 Correct 86 ms 194564 KB Output is correct
76 Correct 92 ms 194500 KB Output is correct
77 Correct 89 ms 194512 KB Output is correct
78 Correct 99 ms 197068 KB Output is correct
79 Correct 109 ms 197212 KB Output is correct
80 Correct 102 ms 196808 KB Output is correct
81 Correct 100 ms 196864 KB Output is correct
82 Correct 97 ms 196672 KB Output is correct
83 Correct 101 ms 196108 KB Output is correct
84 Correct 96 ms 197068 KB Output is correct
85 Correct 98 ms 197308 KB Output is correct
86 Correct 98 ms 197448 KB Output is correct
87 Correct 98 ms 196816 KB Output is correct
88 Correct 99 ms 196844 KB Output is correct
89 Correct 96 ms 196668 KB Output is correct
90 Correct 92 ms 196568 KB Output is correct
91 Correct 91 ms 196724 KB Output is correct
92 Correct 517 ms 232860 KB Output is correct
93 Correct 507 ms 232748 KB Output is correct
94 Correct 387 ms 229728 KB Output is correct
95 Correct 263 ms 232772 KB Output is correct
96 Correct 275 ms 232644 KB Output is correct
97 Correct 516 ms 244784 KB Output is correct
98 Correct 509 ms 247400 KB Output is correct
99 Correct 525 ms 232264 KB Output is correct
100 Correct 497 ms 233748 KB Output is correct
101 Correct 492 ms 231876 KB Output is correct
102 Correct 544 ms 222604 KB Output is correct
103 Correct 494 ms 242116 KB Output is correct
104 Correct 515 ms 233948 KB Output is correct
105 Correct 488 ms 236436 KB Output is correct

Subtask #8
0.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 194304 KB Output is correct
2 Correct 87 ms 194272 KB Output is correct
3 Correct 84 ms 194268 KB Output is correct
4 Correct 84 ms 194244 KB Output is correct
5 Correct 82 ms 194272 KB Output is correct
6 Correct 83 ms 194244 KB Output is correct
7 Correct 87 ms 194280 KB Output is correct
8 Correct 82 ms 194244 KB Output is correct
9 Correct 83 ms 194348 KB Output is correct
10 Correct 83 ms 194272 KB Output is correct
11 Correct 87 ms 194292 KB Output is correct
12 Correct 82 ms 194340 KB Output is correct
13 Correct 84 ms 194316 KB Output is correct
14 Correct 85 ms 194312 KB Output is correct
15 Correct 89 ms 194360 KB Output is correct
16 Correct 85 ms 194300 KB Output is correct
17 Correct 88 ms 194320 KB Output is correct
18 Correct 84 ms 194288 KB Output is correct
19 Correct 84 ms 194344 KB Output is correct
20 Correct 83 ms 194240 KB Output is correct
21 Correct 85 ms 194244 KB Output is correct
22 Correct 91 ms 194332 KB Output is correct
23 Correct 86 ms 194280 KB Output is correct
24 Correct 84 ms 194296 KB Output is correct
25 Correct 84 ms 194304 KB Output is correct
26 Correct 97 ms 194320 KB Output is correct
27 Correct 84 ms 194244 KB Output is correct
28 Correct 84 ms 194348 KB Output is correct
29 Correct 83 ms 194244 KB Output is correct
30 Correct 84 ms 194316 KB Output is correct
31 Correct 85 ms 194276 KB Output is correct
32 Correct 84 ms 194240 KB Output is correct
33 Correct 86 ms 194500 KB Output is correct
34 Correct 84 ms 194360 KB Output is correct
35 Correct 84 ms 194244 KB Output is correct
36 Correct 101 ms 197472 KB Output is correct
37 Correct 99 ms 197860 KB Output is correct
38 Correct 104 ms 197060 KB Output is correct
39 Correct 99 ms 196700 KB Output is correct
40 Correct 98 ms 196708 KB Output is correct
41 Correct 100 ms 196164 KB Output is correct
42 Correct 99 ms 197712 KB Output is correct
43 Correct 101 ms 197228 KB Output is correct
44 Correct 126 ms 197700 KB Output is correct
45 Correct 99 ms 196652 KB Output is correct
46 Correct 103 ms 197116 KB Output is correct
47 Correct 97 ms 196556 KB Output is correct
48 Correct 103 ms 196916 KB Output is correct
49 Correct 98 ms 196940 KB Output is correct
50 Correct 83 ms 194320 KB Output is correct
51 Correct 85 ms 194348 KB Output is correct
52 Correct 87 ms 194388 KB Output is correct
53 Correct 83 ms 194372 KB Output is correct
54 Correct 86 ms 194476 KB Output is correct
55 Correct 84 ms 194372 KB Output is correct
56 Correct 85 ms 194292 KB Output is correct
57 Correct 83 ms 194372 KB Output is correct
58 Correct 84 ms 194348 KB Output is correct
59 Correct 86 ms 194272 KB Output is correct
60 Correct 85 ms 194284 KB Output is correct
61 Correct 85 ms 194380 KB Output is correct
62 Correct 84 ms 194272 KB Output is correct
63 Correct 85 ms 194400 KB Output is correct
64 Correct 85 ms 194644 KB Output is correct
65 Correct 90 ms 194632 KB Output is correct
66 Correct 85 ms 194556 KB Output is correct
67 Correct 85 ms 194500 KB Output is correct
68 Correct 87 ms 194580 KB Output is correct
69 Correct 85 ms 194440 KB Output is correct
70 Correct 89 ms 194620 KB Output is correct
71 Correct 90 ms 194572 KB Output is correct
72 Correct 85 ms 194596 KB Output is correct
73 Correct 85 ms 194496 KB Output is correct
74 Correct 86 ms 194512 KB Output is correct
75 Correct 86 ms 194564 KB Output is correct
76 Correct 92 ms 194500 KB Output is correct
77 Correct 89 ms 194512 KB Output is correct
78 Correct 99 ms 197068 KB Output is correct
79 Correct 109 ms 197212 KB Output is correct
80 Correct 102 ms 196808 KB Output is correct
81 Correct 100 ms 196864 KB Output is correct
82 Correct 97 ms 196672 KB Output is correct
83 Correct 101 ms 196108 KB Output is correct
84 Correct 96 ms 197068 KB Output is correct
85 Correct 98 ms 197308 KB Output is correct
86 Correct 98 ms 197448 KB Output is correct
87 Correct 98 ms 196816 KB Output is correct
88 Correct 99 ms 196844 KB Output is correct
89 Correct 96 ms 196668 KB Output is correct
90 Correct 92 ms 196568 KB Output is correct
91 Correct 91 ms 196724 KB Output is correct
92 Correct 517 ms 232860 KB Output is correct
93 Correct 507 ms 232748 KB Output is correct
94 Correct 387 ms 229728 KB Output is correct
95 Correct 263 ms 232772 KB Output is correct
96 Correct 275 ms 232644 KB Output is correct
97 Correct 516 ms 244784 KB Output is correct
98 Correct 509 ms 247400 KB Output is correct
99 Correct 525 ms 232264 KB Output is correct
100 Correct 497 ms 233748 KB Output is correct
101 Correct 492 ms 231876 KB Output is correct
102 Correct 544 ms 222604 KB Output is correct
103 Correct 494 ms 242116 KB Output is correct
104 Correct 515 ms 233948 KB Output is correct
105 Correct 488 ms 236436 KB Output is correct
106 Execution timed out 7081 ms 580104 KB Time limit exceeded
107 Halted 0 ms 0 KB -