oj.uz

답안 #840072

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
840072 2023-08-31T05:29:16 Z socpite 봉쇄 시간 (IOI23_closing) C++17
75 / 100
 126 ms 133036 KB 
#include "closing.h"

#include <bits/stdc++.h>
using namespace std;
const int maxn = 6e3+5;
const long long INF = 1e18;

int onp[maxn];
long long depX[maxn], depY[maxn];

vector<pair<int, int>> g[maxn];



void dfsX(int x, int p = -1)
{
    for (auto v : g[x])
    {
        if (v.first == p)
            continue;
        depX[v.first] = depX[x] + v.second;
        dfsX(v.first, x);
    }
}

void dfsY(int x, int p = -1)
{
    for (auto v : g[x])
    {
        if (v.first == p)
            continue;
        depY[v.first] = depY[x] + v.second;
        dfsY(v.first, x);
    }
}

long long solve1(int n, long long k)
{
    vector<long long> vec;
    vec.insert(vec.end(), depX, depX + n);
    vec.insert(vec.end(), depY, depY + n);
    sort(vec.begin(), vec.end());
    long long crr = 0;
    for (int i = 0; i < vec.size(); i++)
    {
        crr += vec[i];
        if (crr > k)
            return i;
    }
    return vec.size();
}

vector<int> path;

bool dfs_path(int x, int endp, int p = -1)
{
    if (x == endp)
        return (onp[x] = true);
    for (auto v : g[x])
    {
        if (v.first == p)
            continue;
        onp[x] |= dfs_path(v.first, endp, x);
    }
    return onp[x];
}

vector<long long> vec1, vec2;
vector<long long> knapsack[maxn];
long long dp[maxn][maxn];

void dfs_gen(int x, int p, long long cnst){
    long long val;
    if(p == -1)val = 0;
    else val = min(depX[x],depY[x]);
    if(val > cnst)vec2.push_back(val);
    else vec1.push_back(val);
    for(auto v: g[x]){
        if(v.first == p || onp[v.first])continue;
        dfs_gen(v.first, x, cnst);
    }
}
long long solve2(int n, long long k, int x, int y)
{
    dfs_path(x, y);
    int len = 0;
    for (int i = 0; i < n; i++)
    {
        if (onp[i])
        {
            k -= min(depX[i], depY[i]);
            vec1.clear();
            vec2.clear();
            long long inc = abs(depX[i] - depY[i]);
            dfs_gen(i, -1, inc);
            sort(vec1.begin(), vec1.end());
            sort(vec2.begin(), vec2.end());
            knapsack[len] = vec1;
            for(auto v: vec1)knapsack[len].push_back(inc);
            for(auto v: vec2){
                knapsack[len].push_back(v);
                knapsack[len].push_back(inc);
            }
            // cout << i << endl;
            // for(auto v: knapsack[len])cout << v << " ";
            // cout << endl;
            for(int i = 1; i < knapsack[len].size(); i++)knapsack[len][i] += knapsack[len][i-1];
            len++;
        }
    }
    // cout << "left " << k << endl;
    if (k < 0)
        return 0;
    for(int i = 0; i <= len; i++){
        for(int j = 0; j <= 2*n; j++)dp[i][j] = INF;
    }
    dp[0][0] = 0;
    for(int i = 0; i < len; i++){
        for(int j = 0; j <= 2*n; j++){
            //cout << "dp " << i << " " << j << " " << dp[i][j] << endl;
            if(dp[i][j] == INF)continue; 
            dp[i+1][j] = min(dp[i+1][j], dp[i][j]);
            for(int k = 0; k < knapsack[i].size(); k++){
                dp[i+1][j+k+1] = min(dp[i+1][j+k+1], dp[i][j] + knapsack[i][k]);
            }
        }
    }
    for(int i = 2*n; i >= 0; i--){
        if(dp[len][i] <= k)return i;
    }
    return 0;
}

void reset(int n)
{
    for (int i = 0; i < n; i++)
    {
        g[i].clear();
        onp[i] = 0;
    }
    path.clear();
}

int max_score(int N, int X, int Y, long long K,
              std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
    reset(N);
    for (int i = 0; i < N - 1; i++)
    {
        g[U[i]].push_back({V[i], W[i]});
        g[V[i]].push_back({U[i], W[i]});
    }
    depX[X] = 0;
    depY[Y] = 0;
    dfsX(X);
    dfsY(Y);
    long long ans = max(solve1(N, K), solve2(N, K, X, Y));

    return ans;
}

Compilation message

closing.cpp: In function 'long long int solve1(int, long long int)':
closing.cpp:44:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     for (int i = 0; i < vec.size(); i++)
      |                     ~~^~~~~~~~~~~~
closing.cpp: In function 'long long int solve2(int, long long int, int, int)':
closing.cpp:99:22: warning: unused variable 'v' [-Wunused-variable]
   99 |             for(auto v: vec1)knapsack[len].push_back(inc);
      |                      ^
closing.cpp:107:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |             for(int i = 1; i < knapsack[len].size(); i++)knapsack[len][i] += knapsack[len][i-1];
      |                            ~~^~~~~~~~~~~~~~~~~~~~~~
closing.cpp:123:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |             for(int k = 0; k < knapsack[i].size(); k++){
      |                            ~~^~~~~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 60 ms 10488 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
9.0 / 9.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 0 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 0 ms 596 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 0 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 0 ms 596 KB Output is correct
14 Correct 1 ms 852 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 3 ms 4308 KB Output is correct
22 Correct 1 ms 596 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 2 ms 852 KB Output is correct
26 Correct 7 ms 1236 KB Output is correct
27 Correct 8 ms 1120 KB Output is correct
28 Correct 77 ms 133036 KB Output is correct
29 Correct 60 ms 88780 KB Output is correct
30 Correct 2 ms 980 KB Output is correct
31 Correct 3 ms 1108 KB Output is correct
32 Correct 2 ms 1108 KB Output is correct

Subtask #5
9.0 / 9.0

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

Subtask #6
11.0 / 11.0

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

Subtask #7
10.0 / 10.0

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

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 0 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 0 ms 596 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 0 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 0 ms 596 KB Output is correct
15 Correct 1 ms 852 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 724 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 3 ms 4308 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 2 ms 852 KB Output is correct
27 Correct 7 ms 1236 KB Output is correct
28 Correct 8 ms 1120 KB Output is correct
29 Correct 77 ms 133036 KB Output is correct
30 Correct 60 ms 88780 KB Output is correct
31 Correct 2 ms 980 KB Output is correct
32 Correct 3 ms 1108 KB Output is correct
33 Correct 2 ms 1108 KB Output is correct
34 Correct 0 ms 596 KB Output is correct
35 Correct 1 ms 596 KB Output is correct
36 Correct 1 ms 596 KB Output is correct
37 Correct 1 ms 596 KB Output is correct
38 Correct 1 ms 596 KB Output is correct
39 Correct 0 ms 596 KB Output is correct
40 Correct 1 ms 596 KB Output is correct
41 Correct 1 ms 644 KB Output is correct
42 Correct 1 ms 596 KB Output is correct
43 Correct 1 ms 592 KB Output is correct
44 Correct 1 ms 596 KB Output is correct
45 Correct 1 ms 596 KB Output is correct
46 Correct 1 ms 596 KB Output is correct
47 Correct 1 ms 596 KB Output is correct
48 Correct 1 ms 596 KB Output is correct
49 Correct 1 ms 596 KB Output is correct
50 Correct 1 ms 596 KB Output is correct
51 Correct 1 ms 596 KB Output is correct
52 Correct 1 ms 596 KB Output is correct
53 Correct 1 ms 596 KB Output is correct
54 Correct 1 ms 596 KB Output is correct
55 Correct 1 ms 596 KB Output is correct
56 Correct 1 ms 596 KB Output is correct
57 Correct 1 ms 596 KB Output is correct
58 Correct 1 ms 980 KB Output is correct
59 Correct 1 ms 596 KB Output is correct
60 Correct 1 ms 596 KB Output is correct
61 Correct 1 ms 596 KB Output is correct
62 Correct 1 ms 592 KB Output is correct
63 Correct 1 ms 596 KB Output is correct
64 Correct 1 ms 596 KB Output is correct
65 Correct 1 ms 596 KB Output is correct
66 Correct 1 ms 596 KB Output is correct
67 Correct 1 ms 596 KB Output is correct
68 Correct 1 ms 980 KB Output is correct
69 Correct 1 ms 724 KB Output is correct
70 Correct 1 ms 724 KB Output is correct
71 Correct 1 ms 596 KB Output is correct
72 Correct 1 ms 724 KB Output is correct
73 Correct 1 ms 1108 KB Output is correct
74 Correct 1 ms 596 KB Output is correct
75 Correct 1 ms 596 KB Output is correct
76 Correct 3 ms 5332 KB Output is correct
77 Correct 3 ms 5204 KB Output is correct
78 Correct 1 ms 596 KB Output is correct
79 Correct 1 ms 596 KB Output is correct
80 Correct 1 ms 724 KB Output is correct
81 Correct 1 ms 596 KB Output is correct
82 Correct 1 ms 596 KB Output is correct
83 Correct 1 ms 596 KB Output is correct
84 Correct 2 ms 724 KB Output is correct
85 Correct 2 ms 724 KB Output is correct
86 Correct 2 ms 1108 KB Output is correct
87 Correct 3 ms 852 KB Output is correct
88 Correct 3 ms 852 KB Output is correct
89 Correct 3 ms 1236 KB Output is correct
90 Correct 5 ms 1620 KB Output is correct
91 Correct 17 ms 9000 KB Output is correct
92 Correct 2 ms 1236 KB Output is correct
93 Correct 2 ms 980 KB Output is correct
94 Correct 68 ms 103496 KB Output is correct
95 Correct 75 ms 112316 KB Output is correct
96 Correct 2 ms 980 KB Output is correct
97 Correct 39 ms 46808 KB Output is correct
98 Correct 11 ms 1876 KB Output is correct
99 Correct 3 ms 1236 KB Output is correct
100 Correct 3 ms 980 KB Output is correct
101 Correct 2 ms 724 KB Output is correct

Subtask #9
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 0 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 0 ms 596 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 0 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 0 ms 596 KB Output is correct
15 Correct 1 ms 852 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 724 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 3 ms 4308 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 1 ms 596 KB Output is correct
25 Correct 1 ms 596 KB Output is correct
26 Correct 2 ms 852 KB Output is correct
27 Correct 7 ms 1236 KB Output is correct
28 Correct 8 ms 1120 KB Output is correct
29 Correct 77 ms 133036 KB Output is correct
30 Correct 60 ms 88780 KB Output is correct
31 Correct 2 ms 980 KB Output is correct
32 Correct 3 ms 1108 KB Output is correct
33 Correct 2 ms 1108 KB Output is correct
34 Correct 0 ms 596 KB Output is correct
35 Correct 1 ms 596 KB Output is correct
36 Correct 1 ms 596 KB Output is correct
37 Correct 1 ms 596 KB Output is correct
38 Correct 1 ms 596 KB Output is correct
39 Correct 0 ms 596 KB Output is correct
40 Correct 1 ms 596 KB Output is correct
41 Correct 1 ms 644 KB Output is correct
42 Correct 1 ms 596 KB Output is correct
43 Correct 1 ms 592 KB Output is correct
44 Correct 1 ms 596 KB Output is correct
45 Correct 1 ms 596 KB Output is correct
46 Correct 1 ms 596 KB Output is correct
47 Correct 1 ms 596 KB Output is correct
48 Correct 1 ms 596 KB Output is correct
49 Correct 1 ms 596 KB Output is correct
50 Correct 1 ms 596 KB Output is correct
51 Correct 1 ms 596 KB Output is correct
52 Correct 1 ms 596 KB Output is correct
53 Correct 1 ms 596 KB Output is correct
54 Correct 1 ms 596 KB Output is correct
55 Correct 1 ms 596 KB Output is correct
56 Correct 1 ms 596 KB Output is correct
57 Correct 1 ms 596 KB Output is correct
58 Correct 1 ms 980 KB Output is correct
59 Correct 1 ms 596 KB Output is correct
60 Correct 1 ms 596 KB Output is correct
61 Correct 1 ms 596 KB Output is correct
62 Correct 1 ms 592 KB Output is correct
63 Correct 1 ms 596 KB Output is correct
64 Correct 1 ms 596 KB Output is correct
65 Correct 1 ms 596 KB Output is correct
66 Correct 1 ms 596 KB Output is correct
67 Correct 1 ms 596 KB Output is correct
68 Correct 1 ms 980 KB Output is correct
69 Correct 1 ms 724 KB Output is correct
70 Correct 1 ms 724 KB Output is correct
71 Correct 1 ms 596 KB Output is correct
72 Correct 1 ms 724 KB Output is correct
73 Correct 1 ms 1108 KB Output is correct
74 Correct 1 ms 596 KB Output is correct
75 Correct 1 ms 596 KB Output is correct
76 Correct 3 ms 5332 KB Output is correct
77 Correct 3 ms 5204 KB Output is correct
78 Correct 1 ms 596 KB Output is correct
79 Correct 1 ms 596 KB Output is correct
80 Correct 1 ms 724 KB Output is correct
81 Correct 1 ms 596 KB Output is correct
82 Correct 1 ms 596 KB Output is correct
83 Correct 1 ms 596 KB Output is correct
84 Correct 2 ms 724 KB Output is correct
85 Correct 2 ms 724 KB Output is correct
86 Correct 2 ms 1108 KB Output is correct
87 Correct 3 ms 852 KB Output is correct
88 Correct 3 ms 852 KB Output is correct
89 Correct 3 ms 1236 KB Output is correct
90 Correct 5 ms 1620 KB Output is correct
91 Correct 17 ms 9000 KB Output is correct
92 Correct 2 ms 1236 KB Output is correct
93 Correct 2 ms 980 KB Output is correct
94 Correct 68 ms 103496 KB Output is correct
95 Correct 75 ms 112316 KB Output is correct
96 Correct 2 ms 980 KB Output is correct
97 Correct 39 ms 46808 KB Output is correct
98 Correct 11 ms 1876 KB Output is correct
99 Correct 3 ms 1236 KB Output is correct
100 Correct 3 ms 980 KB Output is correct
101 Correct 2 ms 724 KB Output is correct
102 Correct 90 ms 3516 KB Output is correct
103 Correct 126 ms 3404 KB Output is correct
104 Runtime error 53 ms 10784 KB Execution killed with signal 11
105 Halted 0 ms 0 KB -