oj.uz

답안 #397650

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
397650 2021-05-02T18:30:21 Z phathnv IOI 바이러스 (JOI21_fever) C++11
25 / 100
 5000 ms 69052 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 1e5 + 7;
const int INF = 1e9 + 7;

struct Edge{
    int v, w;
    Edge(int _v, int _w){
        v = _v;
        w = _w;
    }
};

int n, x[N], y[N], curInd, ind[N][4], f[N][2][4], nxt[N][2][4], ord[N], dist[N * 12];
vector<Edge> adj[N * 12];
bool imp[N];

int Dist(int a, int b){
    int dx = abs(x[a] - x[b]);
    int dy = abs(y[a] - y[b]);
    assert(dx == dy);
    return dx;
}

int Calc(int s){
    for(int i = 1; i <= curInd; i++)
        dist[i] = INF;
    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    dist[s] = 0;
    pq.push({0, s});
    while (!pq.empty()){
        int u = pq.top().second;
        int d = pq.top().first;
        pq.pop();
        if (d != dist[u])
            continue;
        for(Edge e : adj[u])
            if (dist[e.v] > dist[u] + e.w){
                dist[e.v] = dist[u] + e.w;
                pq.push({dist[e.v], e.v});
            }
        if (u <= 4 * n){
            int dir = (u - 1) % 4;
            u = (u + 3) / 4;
            for(int type = 0; type < 2; type++){
                int v = u;
                while (nxt[v][type][dir] != v && Dist(u, v) < d)
                    v = nxt[v][type][dir];
                if (u == v)
                    v = nxt[v][type][dir];
                if (u != v && Dist(u, v) >= d && dist[f[v][type][dir]] > Dist(u, v)){
                    dist[f[v][type][dir]] = Dist(u, v);
                    pq.push({Dist(u, v), f[v][type][dir]});
                }
            }
        }
    }
    int res = 0;
    for(int i = 1; i <= n; i++)
        for(int dir = 0; dir < 4; dir++)
            res += (dist[ind[i][dir]] != INF);
    return res;
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> x[i] >> y[i];
        x[i] *= 2;
        y[i] *= 2;
        ord[i] = i;
    }
    for(int i = 1; i <= n; i++)
        for(int dir = 0; dir < 4; dir++)
            ind[i][dir] = ++curInd;
    for(int i = 1; i <= n; i++)
        for(int type = 0; type < 2; type++)
            for(int dir = 0; dir < 4; dir++)
                f[i][type][dir] = ++curInd;
    for(int i = 1; i <= n; i++){
        adj[f[i][0][0]].push_back(Edge(ind[i][3], 0));
        adj[f[i][0][1]].push_back(Edge(ind[i][2], 0));
        adj[f[i][0][2]].push_back(Edge(ind[i][1], 0));
        adj[f[i][0][3]].push_back(Edge(ind[i][0], 0));
        adj[f[i][1][0]].push_back(Edge(ind[i][1], 0));
        adj[f[i][1][1]].push_back(Edge(ind[i][0], 0));
        adj[f[i][1][2]].push_back(Edge(ind[i][3], 0));
        adj[f[i][1][3]].push_back(Edge(ind[i][2], 0));
    }
    sort(ord + 1, ord + 1 + n, [&](const int &a, const int &b){
            return pair<int, int>(x[a] - y[a], x[a]) < pair<int, int>(x[b] - y[b], x[b]);
         });
    for(int l = 1; l <= n; l++){
        int r = l;
        while (r <= n && x[ord[l]] - y[ord[l]] == x[ord[r]] - y[ord[r]])
            r++;
        r--;
        for(int i = l; i <= r; i++){
            int u = ord[i];
            nxt[u][0][0] = (i == r? u : ord[i + 1]);
            nxt[u][0][1] = (i == r? u : ord[i + 1]);
            nxt[u][0][2] = (i == l? u : ord[i - 1]);
            nxt[u][0][3] = (i == l? u : ord[i - 1]);
        }
        for(int i = l; i < r; i++){
            int u = ord[i];
            int v = ord[i + 1];
            int d = Dist(u, v);
            adj[f[u][0][0]].push_back(Edge(f[v][0][0], d));
            adj[f[u][0][1]].push_back(Edge(f[v][0][1], d));
            adj[f[v][0][2]].push_back(Edge(f[u][0][2], d));
            adj[f[v][0][3]].push_back(Edge(f[u][0][3], d));
        }
        l = r;
    }
    sort(ord + 1, ord + 1 + n, [&](const int &a, const int &b){
            return pair<int, int>(x[a] + y[a], x[a]) < pair<int, int>(x[b] + y[b], x[b]);
         });
    for(int l = 1; l <= n; l++){
        int r = l;
        while (r <= n && x[ord[l]] + y[ord[l]] == x[ord[r]] + y[ord[r]])
            r++;
        r--;
        for(int i = l; i <= r; i++){
            int u = ord[i];
            nxt[u][1][0] = (i == l? u : ord[i - 1]);
            nxt[u][1][1] = (i == r? u : ord[i + 1]);
            nxt[u][1][2] = (i == r? u : ord[i + 1]);
            nxt[u][1][3] = (i == l? u : ord[i - 1]);
        }
        for(int i = l; i < r; i++){
            int u = ord[i];
            int v = ord[i + 1];
            int d = Dist(u, v);
            adj[f[v][1][0]].push_back(Edge(f[u][1][0], d));
            adj[f[u][1][1]].push_back(Edge(f[v][1][1], d));
            adj[f[u][1][2]].push_back(Edge(f[v][1][2], d));
            adj[f[v][1][3]].push_back(Edge(f[u][1][3], d));
        }
        l = r;
    }

    int res = 0;
    for(int dir = 0; dir < 4; dir++)
        res = max(res, Calc(ind[1][dir]));
    cout << res;

    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 28492 KB Output is correct
2 Correct 19 ms 28492 KB Output is correct
3 Correct 19 ms 28512 KB Output is correct
4 Correct 18 ms 28492 KB Output is correct
5 Correct 19 ms 28492 KB Output is correct
6 Correct 18 ms 28492 KB Output is correct
7 Correct 20 ms 28448 KB Output is correct
8 Correct 19 ms 28612 KB Output is correct
9 Correct 18 ms 28508 KB Output is correct
10 Correct 18 ms 28492 KB Output is correct
11 Correct 19 ms 28492 KB Output is correct
12 Correct 19 ms 28456 KB Output is correct
13 Correct 18 ms 28516 KB Output is correct
14 Correct 18 ms 28520 KB Output is correct
15 Correct 17 ms 28492 KB Output is correct
16 Correct 19 ms 28452 KB Output is correct
17 Correct 18 ms 28556 KB Output is correct
18 Correct 18 ms 28492 KB Output is correct
19 Correct 18 ms 28520 KB Output is correct
20 Correct 20 ms 28644 KB Output is correct
21 Correct 18 ms 28492 KB Output is correct
22 Correct 18 ms 28492 KB Output is correct
23 Correct 19 ms 28492 KB Output is correct
24 Correct 18 ms 28492 KB Output is correct
25 Correct 19 ms 28512 KB Output is correct
26 Correct 18 ms 28516 KB Output is correct
27 Correct 18 ms 28516 KB Output is correct
28 Correct 18 ms 28508 KB Output is correct
29 Correct 18 ms 28540 KB Output is correct
30 Correct 18 ms 28492 KB Output is correct
31 Correct 18 ms 28492 KB Output is correct
32 Correct 18 ms 28492 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 28492 KB Output is correct
2 Correct 19 ms 28492 KB Output is correct
3 Correct 19 ms 28512 KB Output is correct
4 Correct 18 ms 28492 KB Output is correct
5 Correct 19 ms 28492 KB Output is correct
6 Correct 18 ms 28492 KB Output is correct
7 Correct 20 ms 28448 KB Output is correct
8 Correct 19 ms 28612 KB Output is correct
9 Correct 18 ms 28508 KB Output is correct
10 Correct 18 ms 28492 KB Output is correct
11 Correct 19 ms 28492 KB Output is correct
12 Correct 19 ms 28456 KB Output is correct
13 Correct 18 ms 28516 KB Output is correct
14 Correct 18 ms 28520 KB Output is correct
15 Correct 17 ms 28492 KB Output is correct
16 Correct 19 ms 28452 KB Output is correct
17 Correct 18 ms 28556 KB Output is correct
18 Correct 18 ms 28492 KB Output is correct
19 Correct 18 ms 28520 KB Output is correct
20 Correct 20 ms 28644 KB Output is correct
21 Correct 18 ms 28492 KB Output is correct
22 Correct 18 ms 28492 KB Output is correct
23 Correct 19 ms 28492 KB Output is correct
24 Correct 18 ms 28492 KB Output is correct
25 Correct 19 ms 28512 KB Output is correct
26 Correct 18 ms 28516 KB Output is correct
27 Correct 18 ms 28516 KB Output is correct
28 Correct 18 ms 28508 KB Output is correct
29 Correct 18 ms 28540 KB Output is correct
30 Correct 18 ms 28492 KB Output is correct
31 Correct 18 ms 28492 KB Output is correct
32 Correct 18 ms 28492 KB Output is correct
33 Correct 19 ms 28552 KB Output is correct
34 Correct 18 ms 28496 KB Output is correct
35 Correct 19 ms 28512 KB Output is correct
36 Correct 19 ms 28600 KB Output is correct
37 Correct 19 ms 28512 KB Output is correct
38 Correct 19 ms 28492 KB Output is correct
39 Correct 18 ms 28540 KB Output is correct
40 Correct 19 ms 28552 KB Output is correct
41 Correct 20 ms 28516 KB Output is correct
42 Correct 19 ms 28560 KB Output is correct
43 Correct 19 ms 28492 KB Output is correct
44 Correct 18 ms 28512 KB Output is correct
45 Correct 19 ms 28492 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 28512 KB Output is correct
2 Correct 19 ms 28492 KB Output is correct
3 Correct 19 ms 28576 KB Output is correct
4 Correct 20 ms 28504 KB Output is correct
5 Correct 18 ms 28492 KB Output is correct
6 Correct 19 ms 28492 KB Output is correct
7 Correct 19 ms 28516 KB Output is correct
8 Correct 18 ms 28484 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 28492 KB Output is correct
2 Correct 19 ms 28492 KB Output is correct
3 Correct 19 ms 28512 KB Output is correct
4 Correct 18 ms 28492 KB Output is correct
5 Correct 19 ms 28492 KB Output is correct
6 Correct 18 ms 28492 KB Output is correct
7 Correct 20 ms 28448 KB Output is correct
8 Correct 19 ms 28612 KB Output is correct
9 Correct 18 ms 28508 KB Output is correct
10 Correct 18 ms 28492 KB Output is correct
11 Correct 19 ms 28492 KB Output is correct
12 Correct 19 ms 28456 KB Output is correct
13 Correct 18 ms 28516 KB Output is correct
14 Correct 18 ms 28520 KB Output is correct
15 Correct 17 ms 28492 KB Output is correct
16 Correct 19 ms 28452 KB Output is correct
17 Correct 18 ms 28556 KB Output is correct
18 Correct 18 ms 28492 KB Output is correct
19 Correct 18 ms 28520 KB Output is correct
20 Correct 20 ms 28644 KB Output is correct
21 Correct 18 ms 28492 KB Output is correct
22 Correct 18 ms 28492 KB Output is correct
23 Correct 19 ms 28492 KB Output is correct
24 Correct 18 ms 28492 KB Output is correct
25 Correct 19 ms 28512 KB Output is correct
26 Correct 18 ms 28516 KB Output is correct
27 Correct 18 ms 28516 KB Output is correct
28 Correct 18 ms 28508 KB Output is correct
29 Correct 18 ms 28540 KB Output is correct
30 Correct 18 ms 28492 KB Output is correct
31 Correct 18 ms 28492 KB Output is correct
32 Correct 18 ms 28492 KB Output is correct
33 Correct 19 ms 28552 KB Output is correct
34 Correct 18 ms 28496 KB Output is correct
35 Correct 19 ms 28512 KB Output is correct
36 Correct 19 ms 28600 KB Output is correct
37 Correct 19 ms 28512 KB Output is correct
38 Correct 19 ms 28492 KB Output is correct
39 Correct 18 ms 28540 KB Output is correct
40 Correct 19 ms 28552 KB Output is correct
41 Correct 20 ms 28516 KB Output is correct
42 Correct 19 ms 28560 KB Output is correct
43 Correct 19 ms 28492 KB Output is correct
44 Correct 18 ms 28512 KB Output is correct
45 Correct 19 ms 28492 KB Output is correct
46 Correct 19 ms 28512 KB Output is correct
47 Correct 19 ms 28492 KB Output is correct
48 Correct 19 ms 28576 KB Output is correct
49 Correct 20 ms 28504 KB Output is correct
50 Correct 18 ms 28492 KB Output is correct
51 Correct 19 ms 28492 KB Output is correct
52 Correct 19 ms 28516 KB Output is correct
53 Correct 18 ms 28484 KB Output is correct
54 Correct 18 ms 28492 KB Output is correct
55 Correct 18 ms 28516 KB Output is correct
56 Correct 18 ms 28516 KB Output is correct
57 Correct 18 ms 28492 KB Output is correct
58 Correct 18 ms 28512 KB Output is correct
59 Correct 18 ms 28520 KB Output is correct
60 Correct 18 ms 28512 KB Output is correct
61 Correct 18 ms 28564 KB Output is correct
62 Correct 18 ms 28496 KB Output is correct
63 Correct 18 ms 28492 KB Output is correct
64 Correct 18 ms 28544 KB Output is correct
65 Correct 18 ms 28588 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 28492 KB Output is correct
2 Correct 19 ms 28492 KB Output is correct
3 Correct 19 ms 28512 KB Output is correct
4 Correct 18 ms 28492 KB Output is correct
5 Correct 19 ms 28492 KB Output is correct
6 Correct 18 ms 28492 KB Output is correct
7 Correct 20 ms 28448 KB Output is correct
8 Correct 19 ms 28612 KB Output is correct
9 Correct 18 ms 28508 KB Output is correct
10 Correct 18 ms 28492 KB Output is correct
11 Correct 19 ms 28492 KB Output is correct
12 Correct 19 ms 28456 KB Output is correct
13 Correct 18 ms 28516 KB Output is correct
14 Correct 18 ms 28520 KB Output is correct
15 Correct 17 ms 28492 KB Output is correct
16 Correct 19 ms 28452 KB Output is correct
17 Correct 18 ms 28556 KB Output is correct
18 Correct 18 ms 28492 KB Output is correct
19 Correct 18 ms 28520 KB Output is correct
20 Correct 20 ms 28644 KB Output is correct
21 Correct 18 ms 28492 KB Output is correct
22 Correct 18 ms 28492 KB Output is correct
23 Correct 19 ms 28492 KB Output is correct
24 Correct 18 ms 28492 KB Output is correct
25 Correct 19 ms 28512 KB Output is correct
26 Correct 18 ms 28516 KB Output is correct
27 Correct 18 ms 28516 KB Output is correct
28 Correct 18 ms 28508 KB Output is correct
29 Correct 18 ms 28540 KB Output is correct
30 Correct 18 ms 28492 KB Output is correct
31 Correct 18 ms 28492 KB Output is correct
32 Correct 18 ms 28492 KB Output is correct
33 Correct 19 ms 28552 KB Output is correct
34 Correct 18 ms 28496 KB Output is correct
35 Correct 19 ms 28512 KB Output is correct
36 Correct 19 ms 28600 KB Output is correct
37 Correct 19 ms 28512 KB Output is correct
38 Correct 19 ms 28492 KB Output is correct
39 Correct 18 ms 28540 KB Output is correct
40 Correct 19 ms 28552 KB Output is correct
41 Correct 20 ms 28516 KB Output is correct
42 Correct 19 ms 28560 KB Output is correct
43 Correct 19 ms 28492 KB Output is correct
44 Correct 18 ms 28512 KB Output is correct
45 Correct 19 ms 28492 KB Output is correct
46 Correct 19 ms 28512 KB Output is correct
47 Correct 19 ms 28492 KB Output is correct
48 Correct 19 ms 28576 KB Output is correct
49 Correct 20 ms 28504 KB Output is correct
50 Correct 18 ms 28492 KB Output is correct
51 Correct 19 ms 28492 KB Output is correct
52 Correct 19 ms 28516 KB Output is correct
53 Correct 18 ms 28484 KB Output is correct
54 Correct 18 ms 28492 KB Output is correct
55 Correct 18 ms 28516 KB Output is correct
56 Correct 18 ms 28516 KB Output is correct
57 Correct 18 ms 28492 KB Output is correct
58 Correct 18 ms 28512 KB Output is correct
59 Correct 18 ms 28520 KB Output is correct
60 Correct 18 ms 28512 KB Output is correct
61 Correct 18 ms 28564 KB Output is correct
62 Correct 18 ms 28496 KB Output is correct
63 Correct 18 ms 28492 KB Output is correct
64 Correct 18 ms 28544 KB Output is correct
65 Correct 18 ms 28588 KB Output is correct
66 Correct 23 ms 29644 KB Output is correct
67 Correct 22 ms 29644 KB Output is correct
68 Correct 24 ms 29756 KB Output is correct
69 Incorrect 26 ms 29628 KB Output isn't correct
70 Halted 0 ms 0 KB -

Subtask #6
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 28492 KB Output is correct
2 Correct 19 ms 28492 KB Output is correct
3 Correct 19 ms 28512 KB Output is correct
4 Correct 18 ms 28492 KB Output is correct
5 Correct 19 ms 28492 KB Output is correct
6 Correct 18 ms 28492 KB Output is correct
7 Correct 20 ms 28448 KB Output is correct
8 Correct 19 ms 28612 KB Output is correct
9 Correct 18 ms 28508 KB Output is correct
10 Correct 18 ms 28492 KB Output is correct
11 Correct 19 ms 28492 KB Output is correct
12 Correct 19 ms 28456 KB Output is correct
13 Correct 18 ms 28516 KB Output is correct
14 Correct 18 ms 28520 KB Output is correct
15 Correct 17 ms 28492 KB Output is correct
16 Correct 19 ms 28452 KB Output is correct
17 Correct 18 ms 28556 KB Output is correct
18 Correct 18 ms 28492 KB Output is correct
19 Correct 18 ms 28520 KB Output is correct
20 Correct 20 ms 28644 KB Output is correct
21 Correct 18 ms 28492 KB Output is correct
22 Correct 18 ms 28492 KB Output is correct
23 Correct 19 ms 28492 KB Output is correct
24 Correct 18 ms 28492 KB Output is correct
25 Correct 19 ms 28512 KB Output is correct
26 Correct 18 ms 28516 KB Output is correct
27 Correct 18 ms 28516 KB Output is correct
28 Correct 18 ms 28508 KB Output is correct
29 Correct 18 ms 28540 KB Output is correct
30 Correct 18 ms 28492 KB Output is correct
31 Correct 18 ms 28492 KB Output is correct
32 Correct 18 ms 28492 KB Output is correct
33 Correct 19 ms 28552 KB Output is correct
34 Correct 18 ms 28496 KB Output is correct
35 Correct 19 ms 28512 KB Output is correct
36 Correct 19 ms 28600 KB Output is correct
37 Correct 19 ms 28512 KB Output is correct
38 Correct 19 ms 28492 KB Output is correct
39 Correct 18 ms 28540 KB Output is correct
40 Correct 19 ms 28552 KB Output is correct
41 Correct 20 ms 28516 KB Output is correct
42 Correct 19 ms 28560 KB Output is correct
43 Correct 19 ms 28492 KB Output is correct
44 Correct 18 ms 28512 KB Output is correct
45 Correct 19 ms 28492 KB Output is correct
46 Correct 19 ms 28512 KB Output is correct
47 Correct 19 ms 28492 KB Output is correct
48 Correct 19 ms 28576 KB Output is correct
49 Correct 20 ms 28504 KB Output is correct
50 Correct 18 ms 28492 KB Output is correct
51 Correct 19 ms 28492 KB Output is correct
52 Correct 19 ms 28516 KB Output is correct
53 Correct 18 ms 28484 KB Output is correct
54 Correct 18 ms 28492 KB Output is correct
55 Correct 18 ms 28516 KB Output is correct
56 Correct 18 ms 28516 KB Output is correct
57 Correct 18 ms 28492 KB Output is correct
58 Correct 18 ms 28512 KB Output is correct
59 Correct 18 ms 28520 KB Output is correct
60 Correct 18 ms 28512 KB Output is correct
61 Correct 18 ms 28564 KB Output is correct
62 Correct 18 ms 28496 KB Output is correct
63 Correct 18 ms 28492 KB Output is correct
64 Correct 18 ms 28544 KB Output is correct
65 Correct 18 ms 28588 KB Output is correct
66 Correct 143 ms 60396 KB Output is correct
67 Correct 179 ms 68492 KB Output is correct
68 Correct 131 ms 69052 KB Output is correct
69 Execution timed out 5061 ms 68344 KB Time limit exceeded
70 Halted 0 ms 0 KB -

Subtask #7
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 18 ms 28492 KB Output is correct
2 Correct 19 ms 28492 KB Output is correct
3 Correct 19 ms 28512 KB Output is correct
4 Correct 18 ms 28492 KB Output is correct
5 Correct 19 ms 28492 KB Output is correct
6 Correct 18 ms 28492 KB Output is correct
7 Correct 20 ms 28448 KB Output is correct
8 Correct 19 ms 28612 KB Output is correct
9 Correct 18 ms 28508 KB Output is correct
10 Correct 18 ms 28492 KB Output is correct
11 Correct 19 ms 28492 KB Output is correct
12 Correct 19 ms 28456 KB Output is correct
13 Correct 18 ms 28516 KB Output is correct
14 Correct 18 ms 28520 KB Output is correct
15 Correct 17 ms 28492 KB Output is correct
16 Correct 19 ms 28452 KB Output is correct
17 Correct 18 ms 28556 KB Output is correct
18 Correct 18 ms 28492 KB Output is correct
19 Correct 18 ms 28520 KB Output is correct
20 Correct 20 ms 28644 KB Output is correct
21 Correct 18 ms 28492 KB Output is correct
22 Correct 18 ms 28492 KB Output is correct
23 Correct 19 ms 28492 KB Output is correct
24 Correct 18 ms 28492 KB Output is correct
25 Correct 19 ms 28512 KB Output is correct
26 Correct 18 ms 28516 KB Output is correct
27 Correct 18 ms 28516 KB Output is correct
28 Correct 18 ms 28508 KB Output is correct
29 Correct 18 ms 28540 KB Output is correct
30 Correct 18 ms 28492 KB Output is correct
31 Correct 18 ms 28492 KB Output is correct
32 Correct 18 ms 28492 KB Output is correct
33 Correct 19 ms 28552 KB Output is correct
34 Correct 18 ms 28496 KB Output is correct
35 Correct 19 ms 28512 KB Output is correct
36 Correct 19 ms 28600 KB Output is correct
37 Correct 19 ms 28512 KB Output is correct
38 Correct 19 ms 28492 KB Output is correct
39 Correct 18 ms 28540 KB Output is correct
40 Correct 19 ms 28552 KB Output is correct
41 Correct 20 ms 28516 KB Output is correct
42 Correct 19 ms 28560 KB Output is correct
43 Correct 19 ms 28492 KB Output is correct
44 Correct 18 ms 28512 KB Output is correct
45 Correct 19 ms 28492 KB Output is correct
46 Correct 19 ms 28512 KB Output is correct
47 Correct 19 ms 28492 KB Output is correct
48 Correct 19 ms 28576 KB Output is correct
49 Correct 20 ms 28504 KB Output is correct
50 Correct 18 ms 28492 KB Output is correct
51 Correct 19 ms 28492 KB Output is correct
52 Correct 19 ms 28516 KB Output is correct
53 Correct 18 ms 28484 KB Output is correct
54 Correct 18 ms 28492 KB Output is correct
55 Correct 18 ms 28516 KB Output is correct
56 Correct 18 ms 28516 KB Output is correct
57 Correct 18 ms 28492 KB Output is correct
58 Correct 18 ms 28512 KB Output is correct
59 Correct 18 ms 28520 KB Output is correct
60 Correct 18 ms 28512 KB Output is correct
61 Correct 18 ms 28564 KB Output is correct
62 Correct 18 ms 28496 KB Output is correct
63 Correct 18 ms 28492 KB Output is correct
64 Correct 18 ms 28544 KB Output is correct
65 Correct 18 ms 28588 KB Output is correct
66 Correct 23 ms 29644 KB Output is correct
67 Correct 22 ms 29644 KB Output is correct
68 Correct 24 ms 29756 KB Output is correct
69 Incorrect 26 ms 29628 KB Output isn't correct
70 Halted 0 ms 0 KB -