oj.uz

답안 #525827

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
525827 2022-02-13T01:12:03 Z mjhmjh1104 Mountains and Valleys (CCO20_day1problem3) C++17
16 / 25
 7000 ms 26888 KB 
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")

#include <cstdio>
#include <vector>
#include <utility>
#include <algorithm>
using namespace std;
 
int n, m;
vector<int> tree[200006];
vector<pair<int, int>> adj[200006];
int par[200006], sz[200006];
bool cl[200006];
 
int dfs(int x, int prev = -1) {
    par[x] = prev;
    sz[x] = 1;
    for (auto &i: tree[x]) if (i != prev) {
        sz[x] = max(sz[x], dfs(i, x) + 1);
    }
    return sz[x];
}

int dist[200006];
 
int dfs_dist(int x, int prev = -1) {
    vector<int> v;
    int ret = 0;
    dist[x] = 0;
    for (auto &i: tree[x]) if (i != prev) {
        v.push_back(dfs_dist(i, x) + 1);
        ret = max(ret, v.back());
        dist[x] = max(dist[x], dist[i]);
    }
    sort(v.rbegin(), v.rend());
    if (!v.empty()) dist[x] = max(dist[x], v[0]);
    if ((int)v.size() > 1) dist[x] = max(dist[x], v[0] + v[1]);
    return ret;
}

int sp[18][200006], depth[200006];

void dfs_depth(int x, int prev = -1) {
    par[x] = prev;
    for (auto &i: tree[x]) if (i != prev) {
        depth[i] = depth[x] + 1;
        dfs_depth(i, x);
    }
}

int get_dist(int u, int v) {
    if (depth[u] < depth[v]) swap(u, v);
    int diff = depth[u] - depth[v], ret = diff;
    for (int t = 17; t >= 0; t--) if (diff >= 1 << t) {
        diff -= 1 << t;
        u = sp[t][u];
    }
    if (u == v) return ret;
    for (int t = 17; t >= 0; t--) if (sp[t][u] != -1 && sp[t][v] != -1 && sp[t][u] != sp[t][v]) {
        ret += 1 << t + 1;
        u = sp[t][u], v = sp[t][v];
    }
    return ret + 2;
}
 
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_dist(0);
    dfs_depth(0);
    for (int i = 0; i < n; i++) sp[0][i] = par[i];
    for (int t = 1; t < 18; t++) for (int i = 0; i < n; i++) {
        if (sp[t - 1][i] == -1) sp[t][i] = -1;
        else sp[t][i] = sp[t - 1][sp[t - 1][i]];
    }
    int zero = 2 * (n - 1) - dist[0], one = (int)1e9;
    for (int i = 0; i < n; i++) {
        dfs(i);
        dfs_dist(i);
        for (auto &j: adj[i]) if (i < j.first) {
            int curr = j.second + 2 * (n - 1) - get_dist(i, j.first) - 1;
            int x = j.first, pv = -1;
            vector<pair<int, int>> v;
            int y = -1, T = 0;
            while (x != -1) {
                for (auto &k: tree[x]) if (k != pv && k != par[x]) {
                    if (sz[k]) {
                        if (!v.empty() && v.back().second == T) {
                            y = max(y, v.back().first + sz[k] - 1);
                            v.back().first = max(v.back().first, sz[k]);
                        } else v.push_back({ sz[k], T });
                    }
                    y = max(y, dist[k] - 1);
                }
                T++;
                pv = x;
                x = par[x];
            }
            int ans = -(int)1e9;
            for (int i = 0; i < (int)v.size(); i++) {
                if (i) ans -= v[i].second - v[i - 1].second;
                y = max(y, ans + v[i].first + 1);
                ans = max(ans, v[i].first);
            }
            curr -= y;
            one = min(one, curr);
        }
    }
    printf("%d", min(zero, one));
}

Compilation message

Main.cpp: In function 'int get_dist(int, int)':
Main.cpp:63:23: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
   63 |         ret += 1 << t + 1;
      |                     ~~^~~
Main.cpp: In function 'int main()':
Main.cpp:70:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp:73:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |         scanf("%d%d%d", &x, &y, &w);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 5 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9800 KB Output is correct
5 Correct 5 ms 9800 KB Output is correct
6 Correct 6 ms 9804 KB Output is correct
7 Correct 6 ms 9676 KB Output is correct
8 Correct 6 ms 9796 KB Output is correct
9 Correct 6 ms 9676 KB Output is correct
10 Correct 6 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 6 ms 9676 KB Output is correct
13 Correct 8 ms 9732 KB Output is correct
14 Correct 6 ms 9676 KB Output is correct
15 Correct 5 ms 9692 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 5 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9800 KB Output is correct
5 Correct 5 ms 9800 KB Output is correct
6 Correct 6 ms 9804 KB Output is correct
7 Correct 6 ms 9676 KB Output is correct
8 Correct 6 ms 9796 KB Output is correct
9 Correct 6 ms 9676 KB Output is correct
10 Correct 6 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 6 ms 9676 KB Output is correct
13 Correct 8 ms 9732 KB Output is correct
14 Correct 6 ms 9676 KB Output is correct
15 Correct 5 ms 9692 KB Output is correct
16 Correct 6 ms 9804 KB Output is correct
17 Correct 6 ms 9788 KB Output is correct
18 Correct 5 ms 9676 KB Output is correct
19 Correct 5 ms 9676 KB Output is correct
20 Correct 5 ms 9776 KB Output is correct
21 Correct 5 ms 9676 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 7 ms 9712 KB Output is correct
24 Correct 6 ms 9768 KB Output is correct
25 Correct 6 ms 9676 KB Output is correct
26 Correct 8 ms 9740 KB Output is correct
27 Correct 6 ms 9740 KB Output is correct
28 Correct 5 ms 9676 KB Output is correct
29 Correct 5 ms 9804 KB Output is correct
30 Correct 6 ms 9804 KB Output is correct
31 Correct 5 ms 9752 KB Output is correct
32 Correct 5 ms 9732 KB Output is correct
33 Correct 5 ms 9796 KB Output is correct
34 Correct 5 ms 9728 KB Output is correct
35 Correct 6 ms 9676 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2808 ms 11224 KB Output is correct
2 Correct 2677 ms 11212 KB Output is correct
3 Correct 2592 ms 11080 KB Output is correct
4 Correct 2466 ms 10844 KB Output is correct
5 Correct 2511 ms 10776 KB Output is correct
6 Correct 1738 ms 10612 KB Output is correct
7 Correct 2875 ms 11192 KB Output is correct
8 Correct 2888 ms 10992 KB Output is correct
9 Correct 2773 ms 11128 KB Output is correct
10 Correct 2627 ms 10856 KB Output is correct
11 Correct 2450 ms 10964 KB Output is correct
12 Correct 2530 ms 10848 KB Output is correct
13 Correct 2517 ms 10960 KB Output is correct
14 Correct 2503 ms 10968 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 5 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9800 KB Output is correct
5 Correct 5 ms 9800 KB Output is correct
6 Correct 6 ms 9804 KB Output is correct
7 Correct 6 ms 9676 KB Output is correct
8 Correct 6 ms 9796 KB Output is correct
9 Correct 6 ms 9676 KB Output is correct
10 Correct 6 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 6 ms 9676 KB Output is correct
13 Correct 8 ms 9732 KB Output is correct
14 Correct 6 ms 9676 KB Output is correct
15 Correct 5 ms 9692 KB Output is correct
16 Correct 6 ms 9804 KB Output is correct
17 Correct 6 ms 9788 KB Output is correct
18 Correct 5 ms 9676 KB Output is correct
19 Correct 5 ms 9676 KB Output is correct
20 Correct 5 ms 9776 KB Output is correct
21 Correct 5 ms 9676 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 7 ms 9712 KB Output is correct
24 Correct 6 ms 9768 KB Output is correct
25 Correct 6 ms 9676 KB Output is correct
26 Correct 8 ms 9740 KB Output is correct
27 Correct 6 ms 9740 KB Output is correct
28 Correct 5 ms 9676 KB Output is correct
29 Correct 5 ms 9804 KB Output is correct
30 Correct 6 ms 9804 KB Output is correct
31 Correct 5 ms 9752 KB Output is correct
32 Correct 5 ms 9732 KB Output is correct
33 Correct 5 ms 9796 KB Output is correct
34 Correct 5 ms 9728 KB Output is correct
35 Correct 6 ms 9676 KB Output is correct
36 Correct 6 ms 9804 KB Output is correct
37 Correct 6 ms 9804 KB Output is correct
38 Correct 8 ms 9804 KB Output is correct
39 Correct 7 ms 9772 KB Output is correct
40 Correct 6 ms 9736 KB Output is correct
41 Correct 6 ms 9804 KB Output is correct
42 Correct 7 ms 9804 KB Output is correct
43 Correct 9 ms 9804 KB Output is correct
44 Correct 6 ms 9804 KB Output is correct
45 Correct 8 ms 9804 KB Output is correct
46 Correct 8 ms 9804 KB Output is correct
47 Correct 6 ms 9804 KB Output is correct
48 Correct 6 ms 9804 KB Output is correct
49 Correct 6 ms 9804 KB Output is correct

Subtask #5
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 5 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9800 KB Output is correct
5 Correct 5 ms 9800 KB Output is correct
6 Correct 6 ms 9804 KB Output is correct
7 Correct 6 ms 9676 KB Output is correct
8 Correct 6 ms 9796 KB Output is correct
9 Correct 6 ms 9676 KB Output is correct
10 Correct 6 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 6 ms 9676 KB Output is correct
13 Correct 8 ms 9732 KB Output is correct
14 Correct 6 ms 9676 KB Output is correct
15 Correct 5 ms 9692 KB Output is correct
16 Correct 6 ms 9804 KB Output is correct
17 Correct 6 ms 9788 KB Output is correct
18 Correct 5 ms 9676 KB Output is correct
19 Correct 5 ms 9676 KB Output is correct
20 Correct 5 ms 9776 KB Output is correct
21 Correct 5 ms 9676 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 7 ms 9712 KB Output is correct
24 Correct 6 ms 9768 KB Output is correct
25 Correct 6 ms 9676 KB Output is correct
26 Correct 8 ms 9740 KB Output is correct
27 Correct 6 ms 9740 KB Output is correct
28 Correct 5 ms 9676 KB Output is correct
29 Correct 5 ms 9804 KB Output is correct
30 Correct 6 ms 9804 KB Output is correct
31 Correct 5 ms 9752 KB Output is correct
32 Correct 5 ms 9732 KB Output is correct
33 Correct 5 ms 9796 KB Output is correct
34 Correct 5 ms 9728 KB Output is correct
35 Correct 6 ms 9676 KB Output is correct
36 Correct 6 ms 9804 KB Output is correct
37 Correct 6 ms 9804 KB Output is correct
38 Correct 8 ms 9804 KB Output is correct
39 Correct 7 ms 9772 KB Output is correct
40 Correct 6 ms 9736 KB Output is correct
41 Correct 6 ms 9804 KB Output is correct
42 Correct 7 ms 9804 KB Output is correct
43 Correct 9 ms 9804 KB Output is correct
44 Correct 6 ms 9804 KB Output is correct
45 Correct 8 ms 9804 KB Output is correct
46 Correct 8 ms 9804 KB Output is correct
47 Correct 6 ms 9804 KB Output is correct
48 Correct 6 ms 9804 KB Output is correct
49 Correct 6 ms 9804 KB Output is correct
50 Correct 25 ms 9932 KB Output is correct
51 Correct 25 ms 9892 KB Output is correct
52 Correct 24 ms 9804 KB Output is correct
53 Correct 24 ms 9888 KB Output is correct
54 Correct 24 ms 9884 KB Output is correct
55 Correct 23 ms 9804 KB Output is correct
56 Correct 27 ms 9912 KB Output is correct
57 Correct 36 ms 9888 KB Output is correct
58 Correct 27 ms 9804 KB Output is correct
59 Correct 24 ms 9892 KB Output is correct
60 Correct 30 ms 9880 KB Output is correct
61 Correct 24 ms 9804 KB Output is correct
62 Correct 24 ms 9872 KB Output is correct
63 Correct 23 ms 9880 KB Output is correct

Subtask #6
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 5 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9800 KB Output is correct
5 Correct 5 ms 9800 KB Output is correct
6 Correct 6 ms 9804 KB Output is correct
7 Correct 6 ms 9676 KB Output is correct
8 Correct 6 ms 9796 KB Output is correct
9 Correct 6 ms 9676 KB Output is correct
10 Correct 6 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 6 ms 9676 KB Output is correct
13 Correct 8 ms 9732 KB Output is correct
14 Correct 6 ms 9676 KB Output is correct
15 Correct 5 ms 9692 KB Output is correct
16 Correct 6 ms 9804 KB Output is correct
17 Correct 6 ms 9788 KB Output is correct
18 Correct 5 ms 9676 KB Output is correct
19 Correct 5 ms 9676 KB Output is correct
20 Correct 5 ms 9776 KB Output is correct
21 Correct 5 ms 9676 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 7 ms 9712 KB Output is correct
24 Correct 6 ms 9768 KB Output is correct
25 Correct 6 ms 9676 KB Output is correct
26 Correct 8 ms 9740 KB Output is correct
27 Correct 6 ms 9740 KB Output is correct
28 Correct 5 ms 9676 KB Output is correct
29 Correct 5 ms 9804 KB Output is correct
30 Correct 6 ms 9804 KB Output is correct
31 Correct 5 ms 9752 KB Output is correct
32 Correct 5 ms 9732 KB Output is correct
33 Correct 5 ms 9796 KB Output is correct
34 Correct 5 ms 9728 KB Output is correct
35 Correct 6 ms 9676 KB Output is correct
36 Correct 2808 ms 11224 KB Output is correct
37 Correct 2677 ms 11212 KB Output is correct
38 Correct 2592 ms 11080 KB Output is correct
39 Correct 2466 ms 10844 KB Output is correct
40 Correct 2511 ms 10776 KB Output is correct
41 Correct 1738 ms 10612 KB Output is correct
42 Correct 2875 ms 11192 KB Output is correct
43 Correct 2888 ms 10992 KB Output is correct
44 Correct 2773 ms 11128 KB Output is correct
45 Correct 2627 ms 10856 KB Output is correct
46 Correct 2450 ms 10964 KB Output is correct
47 Correct 2530 ms 10848 KB Output is correct
48 Correct 2517 ms 10960 KB Output is correct
49 Correct 2503 ms 10968 KB Output is correct
50 Correct 6 ms 9804 KB Output is correct
51 Correct 6 ms 9804 KB Output is correct
52 Correct 8 ms 9804 KB Output is correct
53 Correct 7 ms 9772 KB Output is correct
54 Correct 6 ms 9736 KB Output is correct
55 Correct 6 ms 9804 KB Output is correct
56 Correct 7 ms 9804 KB Output is correct
57 Correct 9 ms 9804 KB Output is correct
58 Correct 6 ms 9804 KB Output is correct
59 Correct 8 ms 9804 KB Output is correct
60 Correct 8 ms 9804 KB Output is correct
61 Correct 6 ms 9804 KB Output is correct
62 Correct 6 ms 9804 KB Output is correct
63 Correct 6 ms 9804 KB Output is correct
64 Correct 25 ms 9932 KB Output is correct
65 Correct 25 ms 9892 KB Output is correct
66 Correct 24 ms 9804 KB Output is correct
67 Correct 24 ms 9888 KB Output is correct
68 Correct 24 ms 9884 KB Output is correct
69 Correct 23 ms 9804 KB Output is correct
70 Correct 27 ms 9912 KB Output is correct
71 Correct 36 ms 9888 KB Output is correct
72 Correct 27 ms 9804 KB Output is correct
73 Correct 24 ms 9892 KB Output is correct
74 Correct 30 ms 9880 KB Output is correct
75 Correct 24 ms 9804 KB Output is correct
76 Correct 24 ms 9872 KB Output is correct
77 Correct 23 ms 9880 KB Output is correct
78 Correct 2623 ms 11228 KB Output is correct
79 Correct 2668 ms 11212 KB Output is correct
80 Correct 2467 ms 10968 KB Output is correct
81 Correct 2444 ms 10948 KB Output is correct
82 Correct 2358 ms 10772 KB Output is correct
83 Correct 1660 ms 10608 KB Output is correct
84 Correct 2563 ms 11196 KB Output is correct
85 Correct 2782 ms 11008 KB Output is correct
86 Correct 2668 ms 11224 KB Output is correct
87 Correct 2414 ms 10852 KB Output is correct
88 Correct 2453 ms 10960 KB Output is correct
89 Correct 2391 ms 10844 KB Output is correct
90 Correct 2245 ms 10744 KB Output is correct
91 Correct 2209 ms 10740 KB Output is correct

Subtask #7
0.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 5 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9800 KB Output is correct
5 Correct 5 ms 9800 KB Output is correct
6 Correct 6 ms 9804 KB Output is correct
7 Correct 6 ms 9676 KB Output is correct
8 Correct 6 ms 9796 KB Output is correct
9 Correct 6 ms 9676 KB Output is correct
10 Correct 6 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 6 ms 9676 KB Output is correct
13 Correct 8 ms 9732 KB Output is correct
14 Correct 6 ms 9676 KB Output is correct
15 Correct 5 ms 9692 KB Output is correct
16 Correct 6 ms 9804 KB Output is correct
17 Correct 6 ms 9788 KB Output is correct
18 Correct 5 ms 9676 KB Output is correct
19 Correct 5 ms 9676 KB Output is correct
20 Correct 5 ms 9776 KB Output is correct
21 Correct 5 ms 9676 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 7 ms 9712 KB Output is correct
24 Correct 6 ms 9768 KB Output is correct
25 Correct 6 ms 9676 KB Output is correct
26 Correct 8 ms 9740 KB Output is correct
27 Correct 6 ms 9740 KB Output is correct
28 Correct 5 ms 9676 KB Output is correct
29 Correct 5 ms 9804 KB Output is correct
30 Correct 6 ms 9804 KB Output is correct
31 Correct 5 ms 9752 KB Output is correct
32 Correct 5 ms 9732 KB Output is correct
33 Correct 5 ms 9796 KB Output is correct
34 Correct 5 ms 9728 KB Output is correct
35 Correct 6 ms 9676 KB Output is correct
36 Correct 2808 ms 11224 KB Output is correct
37 Correct 2677 ms 11212 KB Output is correct
38 Correct 2592 ms 11080 KB Output is correct
39 Correct 2466 ms 10844 KB Output is correct
40 Correct 2511 ms 10776 KB Output is correct
41 Correct 1738 ms 10612 KB Output is correct
42 Correct 2875 ms 11192 KB Output is correct
43 Correct 2888 ms 10992 KB Output is correct
44 Correct 2773 ms 11128 KB Output is correct
45 Correct 2627 ms 10856 KB Output is correct
46 Correct 2450 ms 10964 KB Output is correct
47 Correct 2530 ms 10848 KB Output is correct
48 Correct 2517 ms 10960 KB Output is correct
49 Correct 2503 ms 10968 KB Output is correct
50 Correct 6 ms 9804 KB Output is correct
51 Correct 6 ms 9804 KB Output is correct
52 Correct 8 ms 9804 KB Output is correct
53 Correct 7 ms 9772 KB Output is correct
54 Correct 6 ms 9736 KB Output is correct
55 Correct 6 ms 9804 KB Output is correct
56 Correct 7 ms 9804 KB Output is correct
57 Correct 9 ms 9804 KB Output is correct
58 Correct 6 ms 9804 KB Output is correct
59 Correct 8 ms 9804 KB Output is correct
60 Correct 8 ms 9804 KB Output is correct
61 Correct 6 ms 9804 KB Output is correct
62 Correct 6 ms 9804 KB Output is correct
63 Correct 6 ms 9804 KB Output is correct
64 Correct 25 ms 9932 KB Output is correct
65 Correct 25 ms 9892 KB Output is correct
66 Correct 24 ms 9804 KB Output is correct
67 Correct 24 ms 9888 KB Output is correct
68 Correct 24 ms 9884 KB Output is correct
69 Correct 23 ms 9804 KB Output is correct
70 Correct 27 ms 9912 KB Output is correct
71 Correct 36 ms 9888 KB Output is correct
72 Correct 27 ms 9804 KB Output is correct
73 Correct 24 ms 9892 KB Output is correct
74 Correct 30 ms 9880 KB Output is correct
75 Correct 24 ms 9804 KB Output is correct
76 Correct 24 ms 9872 KB Output is correct
77 Correct 23 ms 9880 KB Output is correct
78 Correct 2623 ms 11228 KB Output is correct
79 Correct 2668 ms 11212 KB Output is correct
80 Correct 2467 ms 10968 KB Output is correct
81 Correct 2444 ms 10948 KB Output is correct
82 Correct 2358 ms 10772 KB Output is correct
83 Correct 1660 ms 10608 KB Output is correct
84 Correct 2563 ms 11196 KB Output is correct
85 Correct 2782 ms 11008 KB Output is correct
86 Correct 2668 ms 11224 KB Output is correct
87 Correct 2414 ms 10852 KB Output is correct
88 Correct 2453 ms 10960 KB Output is correct
89 Correct 2391 ms 10844 KB Output is correct
90 Correct 2245 ms 10744 KB Output is correct
91 Correct 2209 ms 10740 KB Output is correct
92 Execution timed out 7055 ms 26888 KB Time limit exceeded
93 Halted 0 ms 0 KB -

Subtask #8
0.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 5 ms 9676 KB Output is correct
3 Correct 5 ms 9676 KB Output is correct
4 Correct 5 ms 9800 KB Output is correct
5 Correct 5 ms 9800 KB Output is correct
6 Correct 6 ms 9804 KB Output is correct
7 Correct 6 ms 9676 KB Output is correct
8 Correct 6 ms 9796 KB Output is correct
9 Correct 6 ms 9676 KB Output is correct
10 Correct 6 ms 9676 KB Output is correct
11 Correct 6 ms 9676 KB Output is correct
12 Correct 6 ms 9676 KB Output is correct
13 Correct 8 ms 9732 KB Output is correct
14 Correct 6 ms 9676 KB Output is correct
15 Correct 5 ms 9692 KB Output is correct
16 Correct 6 ms 9804 KB Output is correct
17 Correct 6 ms 9788 KB Output is correct
18 Correct 5 ms 9676 KB Output is correct
19 Correct 5 ms 9676 KB Output is correct
20 Correct 5 ms 9776 KB Output is correct
21 Correct 5 ms 9676 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 7 ms 9712 KB Output is correct
24 Correct 6 ms 9768 KB Output is correct
25 Correct 6 ms 9676 KB Output is correct
26 Correct 8 ms 9740 KB Output is correct
27 Correct 6 ms 9740 KB Output is correct
28 Correct 5 ms 9676 KB Output is correct
29 Correct 5 ms 9804 KB Output is correct
30 Correct 6 ms 9804 KB Output is correct
31 Correct 5 ms 9752 KB Output is correct
32 Correct 5 ms 9732 KB Output is correct
33 Correct 5 ms 9796 KB Output is correct
34 Correct 5 ms 9728 KB Output is correct
35 Correct 6 ms 9676 KB Output is correct
36 Correct 2808 ms 11224 KB Output is correct
37 Correct 2677 ms 11212 KB Output is correct
38 Correct 2592 ms 11080 KB Output is correct
39 Correct 2466 ms 10844 KB Output is correct
40 Correct 2511 ms 10776 KB Output is correct
41 Correct 1738 ms 10612 KB Output is correct
42 Correct 2875 ms 11192 KB Output is correct
43 Correct 2888 ms 10992 KB Output is correct
44 Correct 2773 ms 11128 KB Output is correct
45 Correct 2627 ms 10856 KB Output is correct
46 Correct 2450 ms 10964 KB Output is correct
47 Correct 2530 ms 10848 KB Output is correct
48 Correct 2517 ms 10960 KB Output is correct
49 Correct 2503 ms 10968 KB Output is correct
50 Correct 6 ms 9804 KB Output is correct
51 Correct 6 ms 9804 KB Output is correct
52 Correct 8 ms 9804 KB Output is correct
53 Correct 7 ms 9772 KB Output is correct
54 Correct 6 ms 9736 KB Output is correct
55 Correct 6 ms 9804 KB Output is correct
56 Correct 7 ms 9804 KB Output is correct
57 Correct 9 ms 9804 KB Output is correct
58 Correct 6 ms 9804 KB Output is correct
59 Correct 8 ms 9804 KB Output is correct
60 Correct 8 ms 9804 KB Output is correct
61 Correct 6 ms 9804 KB Output is correct
62 Correct 6 ms 9804 KB Output is correct
63 Correct 6 ms 9804 KB Output is correct
64 Correct 25 ms 9932 KB Output is correct
65 Correct 25 ms 9892 KB Output is correct
66 Correct 24 ms 9804 KB Output is correct
67 Correct 24 ms 9888 KB Output is correct
68 Correct 24 ms 9884 KB Output is correct
69 Correct 23 ms 9804 KB Output is correct
70 Correct 27 ms 9912 KB Output is correct
71 Correct 36 ms 9888 KB Output is correct
72 Correct 27 ms 9804 KB Output is correct
73 Correct 24 ms 9892 KB Output is correct
74 Correct 30 ms 9880 KB Output is correct
75 Correct 24 ms 9804 KB Output is correct
76 Correct 24 ms 9872 KB Output is correct
77 Correct 23 ms 9880 KB Output is correct
78 Correct 2623 ms 11228 KB Output is correct
79 Correct 2668 ms 11212 KB Output is correct
80 Correct 2467 ms 10968 KB Output is correct
81 Correct 2444 ms 10948 KB Output is correct
82 Correct 2358 ms 10772 KB Output is correct
83 Correct 1660 ms 10608 KB Output is correct
84 Correct 2563 ms 11196 KB Output is correct
85 Correct 2782 ms 11008 KB Output is correct
86 Correct 2668 ms 11224 KB Output is correct
87 Correct 2414 ms 10852 KB Output is correct
88 Correct 2453 ms 10960 KB Output is correct
89 Correct 2391 ms 10844 KB Output is correct
90 Correct 2245 ms 10744 KB Output is correct
91 Correct 2209 ms 10740 KB Output is correct
92 Execution timed out 7055 ms 26888 KB Time limit exceeded
93 Halted 0 ms 0 KB -