oj.uz

답안 #839717

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
839717 2023-08-30T15:46:46 Z model_code 봉쇄 시간 (IOI23_closing) C++17
75 / 100
 1000 ms 37376 KB 
// correct/solution-ayaze-linear-leftover.cpp

// O(N^2 log N)
#include "closing.h"
#include <bits/stdc++.h>
using namespace std;

vector<vector<pair<int, int>>> adj_list;
vector<long long> p_val, q_val;
vector<bool> in_path_xy;

int N;
long long K;

void DfsDistance(int now, int prv, long long current_dist, vector<long long> &dist_vec, vector<int> &parent)
{
    dist_vec[now] = current_dist;
    parent[now] = prv;

    for (pair<int, int> edge : adj_list[now])
    {
        int nxt = edge.first;
        if (nxt == prv)
            continue;
        long long new_dist = edge.second + current_dist;
        DfsDistance(nxt, now, new_dist, dist_vec, parent);
    }
}

int CalculateWithCommon()
{
    vector<tuple<long long, long long, int>> sorted_diffs;
    for (int i = 0; i < N; i++)
    {
        sorted_diffs.push_back(make_tuple(q_val[i] - p_val[i], p_val[i], i));
    }
    sort(sorted_diffs.begin(), sorted_diffs.end());

    auto GetOptimumLeftover = [&](vector<long long> p_left, vector<long long> q_left, long long left) -> int
    {
        p_left.insert(p_left.begin(), 0);
        q_left.insert(q_left.begin(), 0);
        sort(p_left.begin(), p_left.end());
        sort(q_left.begin(), q_left.end());

        for (int i = 1; i < static_cast<int>(p_left.size()); i++)
            p_left[i] += p_left[i - 1];
        for (int i = 1; i < static_cast<int>(q_left.size()); i++)
            q_left[i] += q_left[i - 1];

        int ret = 0;
        int j = (int)q_left.size() - 1;
        for (int i = 0; i < static_cast<int>(p_left.size()); i++)
        {
            if (p_left[i] > left)
                break;

            while (p_left[i] + q_left[j] > left)
                j--;
            ret = max(ret, i + 2 * j);
        }

        return ret;
    };

    int ret = 0;

    for (int border = 0; border < N; border++)
    {
        long long total_in_path = 0;
        int score_in_path = 0;
        vector<long long> p_left, q_left;

        for (int i = 0; i < N; i++)
        {
            int node = get<2>(sorted_diffs[i]);
            if (in_path_xy[node])
            {
                if (i <= border)
                {
                    total_in_path += q_val[node];
                    score_in_path += 2;
                }
                else
                {
                    total_in_path += p_val[node];
                    score_in_path += 1;
                }
            }
            else
            {
                if (i <= border)
                {
                    q_left.push_back(q_val[node]);
                }
                else
                {
                    p_left.push_back(p_val[node]);
                }
            }
        }

        if (total_in_path <= K)
        {
            int opt_leftover = GetOptimumLeftover(p_left, q_left, K - total_in_path);
            ret = max(ret, score_in_path + opt_leftover);
        }
    }

    return ret;
}

int CalculateWithoutCommon()
{
    vector<long long> sorted_dist;
    for (int i = 0; i < N; i++)
    {
        sorted_dist.push_back(p_val[i]);
        sorted_dist.push_back(q_val[i]);
    }
    sort(sorted_dist.begin(), sorted_dist.end());

    int score = 0;
    long long total = 0;
    for (long long d : sorted_dist)
    {
        if (total + d <= K)
        {
            score++;
            total += d;
        }
    }

    return score;
}

int max_score(int _N, int X, int Y, long long _K,
              std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
    N = _N;
    K = _K;

    adj_list.assign(N, vector<pair<int, int>>());
    q_val.resize(N);
    p_val.resize(N);
    in_path_xy.assign(N, false);

    for (int i = 0; i < static_cast<int>(U.size()); i++)
    {
        adj_list[U[i]].push_back({V[i], W[i]});
        adj_list[V[i]].push_back({U[i], W[i]});
    }

    vector<int> parent_rooted_x(N);
    vector<long long> dist_from_x(N);
    vector<long long> dist_from_y(N);
    DfsDistance(Y, -1, 0, dist_from_y, parent_rooted_x);
    DfsDistance(X, -1, 0, dist_from_x, parent_rooted_x);

    vector<int> path_xy;
    for (int i = Y; i != -1; i = parent_rooted_x[i])
    {
        in_path_xy[i] = true;
    }
    for (int i = 0; i < N; i++)
    {
        p_val[i] = min(dist_from_x[i], dist_from_y[i]);
        q_val[i] = max(dist_from_x[i], dist_from_y[i]);
    }

    int ret = CalculateWithCommon();
    ret = max(ret, CalculateWithoutCommon());

    return ret;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct

Subtask #1
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1079 ms 37376 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 304 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 304 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 4 ms 340 KB Output is correct
20 Correct 3 ms 448 KB Output is correct
21 Correct 2 ms 436 KB Output is correct
22 Correct 2 ms 304 KB Output is correct
23 Correct 2 ms 304 KB Output is correct
24 Correct 1 ms 340 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 304 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 300 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 4 ms 340 KB Output is correct
20 Correct 3 ms 448 KB Output is correct
21 Correct 2 ms 436 KB Output is correct
22 Correct 2 ms 304 KB Output is correct
23 Correct 2 ms 304 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 4 ms 308 KB Output is correct
26 Correct 124 ms 1052 KB Output is correct
27 Correct 99 ms 1004 KB Output is correct
28 Correct 17 ms 980 KB Output is correct
29 Correct 51 ms 996 KB Output is correct
30 Correct 21 ms 972 KB Output is correct
31 Correct 18 ms 980 KB Output is correct
32 Correct 19 ms 1068 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 276 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 304 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 276 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 300 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 300 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 1 ms 304 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 296 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 300 KB Output is correct
50 Correct 0 ms 212 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 304 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 4 ms 340 KB Output is correct
21 Correct 3 ms 448 KB Output is correct
22 Correct 2 ms 436 KB Output is correct
23 Correct 2 ms 304 KB Output is correct
24 Correct 2 ms 304 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 300 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 276 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 300 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 300 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 1 ms 304 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 1 ms 296 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 1 ms 340 KB Output is correct
54 Correct 1 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 300 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 2 ms 340 KB Output is correct
60 Correct 2 ms 340 KB Output is correct
61 Correct 2 ms 304 KB Output is correct
62 Correct 2 ms 304 KB Output is correct
63 Correct 4 ms 340 KB Output is correct
64 Correct 5 ms 340 KB Output is correct
65 Correct 5 ms 340 KB Output is correct
66 Correct 3 ms 300 KB Output is correct
67 Correct 2 ms 340 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 2 ms 340 KB Output is correct
70 Correct 1 ms 340 KB Output is correct
71 Correct 1 ms 340 KB Output is correct
72 Correct 7 ms 420 KB Output is correct
73 Correct 3 ms 340 KB Output is correct
74 Correct 4 ms 300 KB Output is correct
75 Correct 1 ms 340 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 304 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 4 ms 340 KB Output is correct
21 Correct 3 ms 448 KB Output is correct
22 Correct 2 ms 436 KB Output is correct
23 Correct 2 ms 304 KB Output is correct
24 Correct 2 ms 304 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 4 ms 308 KB Output is correct
27 Correct 124 ms 1052 KB Output is correct
28 Correct 99 ms 1004 KB Output is correct
29 Correct 17 ms 980 KB Output is correct
30 Correct 51 ms 996 KB Output is correct
31 Correct 21 ms 972 KB Output is correct
32 Correct 18 ms 980 KB Output is correct
33 Correct 19 ms 1068 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 300 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 276 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 1 ms 300 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 300 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 304 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 1 ms 296 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 300 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 2 ms 340 KB Output is correct
68 Correct 2 ms 340 KB Output is correct
69 Correct 2 ms 304 KB Output is correct
70 Correct 2 ms 304 KB Output is correct
71 Correct 4 ms 340 KB Output is correct
72 Correct 5 ms 340 KB Output is correct
73 Correct 5 ms 340 KB Output is correct
74 Correct 3 ms 300 KB Output is correct
75 Correct 2 ms 340 KB Output is correct
76 Correct 1 ms 340 KB Output is correct
77 Correct 2 ms 340 KB Output is correct
78 Correct 1 ms 340 KB Output is correct
79 Correct 1 ms 340 KB Output is correct
80 Correct 7 ms 420 KB Output is correct
81 Correct 3 ms 340 KB Output is correct
82 Correct 4 ms 300 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 4 ms 308 KB Output is correct
85 Correct 15 ms 436 KB Output is correct
86 Correct 5 ms 424 KB Output is correct
87 Correct 9 ms 436 KB Output is correct
88 Correct 10 ms 308 KB Output is correct
89 Correct 249 ms 936 KB Output is correct
90 Correct 147 ms 880 KB Output is correct
91 Correct 242 ms 912 KB Output is correct
92 Correct 100 ms 1020 KB Output is correct
93 Correct 25 ms 804 KB Output is correct
94 Correct 21 ms 944 KB Output is correct
95 Correct 46 ms 980 KB Output is correct
96 Correct 20 ms 904 KB Output is correct
97 Correct 160 ms 940 KB Output is correct
98 Correct 223 ms 1020 KB Output is correct
99 Correct 220 ms 916 KB Output is correct
100 Correct 79 ms 760 KB Output is correct
101 Correct 22 ms 476 KB Output is correct

Subtask #9
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 304 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 300 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 4 ms 340 KB Output is correct
21 Correct 3 ms 448 KB Output is correct
22 Correct 2 ms 436 KB Output is correct
23 Correct 2 ms 304 KB Output is correct
24 Correct 2 ms 304 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 4 ms 308 KB Output is correct
27 Correct 124 ms 1052 KB Output is correct
28 Correct 99 ms 1004 KB Output is correct
29 Correct 17 ms 980 KB Output is correct
30 Correct 51 ms 996 KB Output is correct
31 Correct 21 ms 972 KB Output is correct
32 Correct 18 ms 980 KB Output is correct
33 Correct 19 ms 1068 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 1 ms 300 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 276 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 1 ms 300 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 300 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 304 KB Output is correct
57 Correct 0 ms 212 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 1 ms 296 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 300 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 2 ms 340 KB Output is correct
68 Correct 2 ms 340 KB Output is correct
69 Correct 2 ms 304 KB Output is correct
70 Correct 2 ms 304 KB Output is correct
71 Correct 4 ms 340 KB Output is correct
72 Correct 5 ms 340 KB Output is correct
73 Correct 5 ms 340 KB Output is correct
74 Correct 3 ms 300 KB Output is correct
75 Correct 2 ms 340 KB Output is correct
76 Correct 1 ms 340 KB Output is correct
77 Correct 2 ms 340 KB Output is correct
78 Correct 1 ms 340 KB Output is correct
79 Correct 1 ms 340 KB Output is correct
80 Correct 7 ms 420 KB Output is correct
81 Correct 3 ms 340 KB Output is correct
82 Correct 4 ms 300 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 4 ms 308 KB Output is correct
85 Correct 15 ms 436 KB Output is correct
86 Correct 5 ms 424 KB Output is correct
87 Correct 9 ms 436 KB Output is correct
88 Correct 10 ms 308 KB Output is correct
89 Correct 249 ms 936 KB Output is correct
90 Correct 147 ms 880 KB Output is correct
91 Correct 242 ms 912 KB Output is correct
92 Correct 100 ms 1020 KB Output is correct
93 Correct 25 ms 804 KB Output is correct
94 Correct 21 ms 944 KB Output is correct
95 Correct 46 ms 980 KB Output is correct
96 Correct 20 ms 904 KB Output is correct
97 Correct 160 ms 940 KB Output is correct
98 Correct 223 ms 1020 KB Output is correct
99 Correct 220 ms 916 KB Output is correct
100 Correct 79 ms 760 KB Output is correct
101 Correct 22 ms 476 KB Output is correct
102 Correct 431 ms 4648 KB Output is correct
103 Execution timed out 1066 ms 4688 KB Time limit exceeded
104 Halted 0 ms 0 KB -