oj.uz

답안 #801295

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
801295 2023-08-02T05:26:09 Z 이동현(#10092) IOI 바이러스 (JOI21_fever) C++17
57 / 100
 1237 ms 246160 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define int long long
using namespace std;

int wx[4] = {0, 1, 0, -1};
int wy[4] = {1, 0, -1, 0};

void rot(array<int, 3>&x){
    (x[2] += 1) %= 4;
    swap(x[0], x[1]);
    x[1] *= -1;
}

void rot(array<int, 4>&x){
    (x[2] += 1) %= 4;
    swap(x[0], x[1]);
    x[1] *= -1;
}

struct Node{
    int nxt, nxtdist, ton;
    Node(){
        nxt = -1;
        nxtdist = 0;
        ton = -1;
    }
};
const int NS = (int)1e5 + 4, SZ = (int)6e6 + 4;
vector<vector<int>> linecoord, lineid;
vector<array<int, 2>> toline[NS];
Node gr[SZ];
int tn;

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;
    vector<array<int, 4>> a(n);
    for(int i = 0; i < n; ++i){
        cin >> a[i][0] >> a[i][1];
        a[i][0] *= 2;
        a[i][1] *= 2;
        a[i][3] = i;
    }

    tn = 0;

    auto makeway = [&](){
        for(int i = 0; i < NS; ++i) toline[i].clear();
        linecoord.clear(), lineid.clear();
        tn = 0;
        for(int i = 0; i < SZ; ++i) gr[i] = Node();
        
        for(int rep1 = 0; rep1 < 4; ++rep1){
            for(int rep2 = 0; rep2 < 2; ++rep2){
                sort(a.begin(), a.end(), [&](array<int, 4>&x, array<int, 4>&y){
                    return x[0] + x[1] < y[0] + y[1] || (x[0] + x[1] == y[0] + y[1] && x[0] < y[0]);
                });

                // cout << a[0][0] << ' ' << a[0][1] << ' ' << a[0][2] << ' ' << a[0][3] << endl;
                // cout << a[1][0] << ' ' << a[1][1] << ' ' << a[1][2] << ' ' << a[1][3] << endl;
                for(int i = 0; i < n;){
                    vector<int> ncoord, nid;
                    int lst = -1;
                    int j = i;
                    for(; j < n && a[i][0] + a[i][1] == a[j][0] + a[j][1]; ++j){
                        if(a[j][2] == 1){
                            ++tn;
                            gr[tn].ton = a[j][3];
                            if(lst != -1){
                                gr[tn].nxt = lst, gr[tn].nxtdist = a[j][0] - ncoord.back();
                            }

                            ncoord.push_back(a[j][0]);
                            nid.push_back(tn);

                            lst = tn;
                        }
                        else if(a[j][2] == 0){
                            // cout << a[j][3] << ' ' << (int)linecoord.size() << ' ' << (int)ncoord.size() << endl;
                            toline[a[j][3]].push_back({(int)linecoord.size(), a[j][0]});
                        }
                    }

                    linecoord.push_back(ncoord);
                    lineid.push_back(nid);

                    i = j;
                }

                for(int i = 0; i < n; ++i){
                    a[i][0] *= -1;
                    if(a[i][2] % 2) a[i][2] = 4 - a[i][2];
                }
            }

            sort(a.begin(), a.end(), [&](array<int, 4>&x, array<int, 4>&y){
                return x[0] < y[0] || (x[0] == y[0] && x[1] < y[1]);
            });

            for(int i = 0; i < n;){
                vector<int> ncoord, nid;
                int lst = -1;
                int j = i;
                for(; j < n && a[i][0] == a[j][0]; ++j){
                    if(a[j][2] == 0){
                        ++tn;
                        gr[tn].ton = a[j][3];
                        if(lst != -1){
                            gr[tn].nxt = lst, gr[tn].nxtdist = (a[j][1] - ncoord.back()) / 2;
                        }

                        ncoord.push_back(a[j][1] / 2);
                        nid.push_back(tn);

                        lst = tn;
                    }
                    else if(a[j][2] == 2){
                        toline[a[j][3]].push_back({(int)linecoord.size(), a[j][1] / 2});
                    }
                }

                linecoord.push_back(ncoord);
                lineid.push_back(nid);

                i = j;
            }

            for(int i = 0; i < n; ++i){
                rot(a[i]);
            }
        }

        sort(a.begin(), a.end(), [&](array<int, 4>&x, array<int, 4>&y){return x[3] < y[3];});
    };
    
    int ans = 0;

    auto sol = [&](){
        vector<int> chk(n, -1);
        vector<int> chk2(tn + 1, -1);
        priority_queue<array<int, 3>> pq;

        // cout << "SOL" << endl;

        pq.push({0, 0, 0});
        while(!pq.empty()){
            int nt = -pq.top()[0], id = pq.top()[1], type = pq.top()[2];
            pq.pop();

            if(!type){
                if(chk[id] != -1) continue;
                chk[id] = nt;

                for(auto&[lid, mec]:toline[id]){
                    int p = lower_bound(linecoord[lid].begin(), linecoord[lid].end(), mec - nt + 1) - linecoord[lid].begin() - 1;
                    if(p >= 0){
                        pq.push({-(mec - linecoord[lid][p]), lineid[lid][p], 1});
                    }
                }
            }
            else{
                if(chk2[id] != -1) continue;
                chk2[id] = nt;

                // cout << id << ' ' << gr[id].ton << endl;

                pq.push({-nt, gr[id].ton, 0});
                if(gr[id].nxt != -1){
                    // cout << id << ' ' << gr[id].nxt << endl;

                    pq.push({-(nt + gr[id].nxtdist), gr[id].nxt, 1});
                }
            }
        }

        int nans = 0;
        for(int i = 0; i < n; ++i){
            if(chk[i] != -1){
                ++nans;
            }
        }

        ans = max(ans, nans);
    };

    for(int rep = 0; rep < 4; ++rep){
        a[0][2] = 0;

        for(int i = 1; i < n; ++i){
            int pi = a[i][0] + a[i][1], mi = a[i][0] - a[i][1];
            int pz = a[0][0] + a[0][1], mz = a[0][0] - a[0][1];
            if(pi == pz){
                a[i][2] = a[i][0] > a[0][0] ? 0 : 1;
            }
            else if(mi == mz){
                a[i][2] = a[i][0] > a[0][0] ? 3 : 0;
            }
            else if(pi > pz && mi < mz){
                a[i][2] = 2;
            }
            else if(pi < pz && mi > mz){
                a[i][2] = 0;
            }
            else{
                a[i][2] = pi > pz ? 3 : 1;
            }
        }

        makeway();

        sol();

        for(int i = 0; i < n; ++i){
            rot(a[i]);
        }
    }

    cout << ans << '\n';
    
    return 0;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 143540 KB Output is correct
2 Correct 97 ms 143504 KB Output is correct
3 Correct 96 ms 143496 KB Output is correct
4 Correct 104 ms 143540 KB Output is correct
5 Correct 103 ms 143548 KB Output is correct
6 Correct 96 ms 143472 KB Output is correct
7 Correct 94 ms 143532 KB Output is correct
8 Correct 96 ms 143672 KB Output is correct
9 Correct 97 ms 143540 KB Output is correct
10 Correct 97 ms 143552 KB Output is correct
11 Correct 93 ms 143548 KB Output is correct
12 Correct 94 ms 143552 KB Output is correct
13 Correct 97 ms 143552 KB Output is correct
14 Correct 101 ms 143672 KB Output is correct
15 Correct 96 ms 143560 KB Output is correct
16 Correct 96 ms 143548 KB Output is correct
17 Correct 98 ms 143428 KB Output is correct
18 Correct 97 ms 143500 KB Output is correct
19 Correct 100 ms 143496 KB Output is correct
20 Correct 100 ms 143544 KB Output is correct
21 Correct 96 ms 143440 KB Output is correct
22 Correct 99 ms 143436 KB Output is correct
23 Correct 97 ms 143448 KB Output is correct
24 Correct 97 ms 143448 KB Output is correct
25 Correct 97 ms 143544 KB Output is correct
26 Correct 100 ms 143432 KB Output is correct
27 Correct 96 ms 143548 KB Output is correct
28 Correct 98 ms 143436 KB Output is correct
29 Correct 95 ms 143512 KB Output is correct
30 Correct 97 ms 143452 KB Output is correct
31 Correct 95 ms 143516 KB Output is correct
32 Correct 95 ms 143508 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 143540 KB Output is correct
2 Correct 97 ms 143504 KB Output is correct
3 Correct 96 ms 143496 KB Output is correct
4 Correct 104 ms 143540 KB Output is correct
5 Correct 103 ms 143548 KB Output is correct
6 Correct 96 ms 143472 KB Output is correct
7 Correct 94 ms 143532 KB Output is correct
8 Correct 96 ms 143672 KB Output is correct
9 Correct 97 ms 143540 KB Output is correct
10 Correct 97 ms 143552 KB Output is correct
11 Correct 93 ms 143548 KB Output is correct
12 Correct 94 ms 143552 KB Output is correct
13 Correct 97 ms 143552 KB Output is correct
14 Correct 101 ms 143672 KB Output is correct
15 Correct 96 ms 143560 KB Output is correct
16 Correct 96 ms 143548 KB Output is correct
17 Correct 98 ms 143428 KB Output is correct
18 Correct 97 ms 143500 KB Output is correct
19 Correct 100 ms 143496 KB Output is correct
20 Correct 100 ms 143544 KB Output is correct
21 Correct 96 ms 143440 KB Output is correct
22 Correct 99 ms 143436 KB Output is correct
23 Correct 97 ms 143448 KB Output is correct
24 Correct 97 ms 143448 KB Output is correct
25 Correct 97 ms 143544 KB Output is correct
26 Correct 100 ms 143432 KB Output is correct
27 Correct 96 ms 143548 KB Output is correct
28 Correct 98 ms 143436 KB Output is correct
29 Correct 95 ms 143512 KB Output is correct
30 Correct 97 ms 143452 KB Output is correct
31 Correct 95 ms 143516 KB Output is correct
32 Correct 95 ms 143508 KB Output is correct
33 Correct 98 ms 143556 KB Output is correct
34 Correct 100 ms 143568 KB Output is correct
35 Correct 99 ms 143532 KB Output is correct
36 Correct 96 ms 143552 KB Output is correct
37 Correct 97 ms 143544 KB Output is correct
38 Correct 97 ms 143552 KB Output is correct
39 Correct 112 ms 143448 KB Output is correct
40 Correct 101 ms 143472 KB Output is correct
41 Correct 99 ms 143536 KB Output is correct
42 Correct 97 ms 143512 KB Output is correct
43 Correct 98 ms 143468 KB Output is correct
44 Correct 99 ms 143464 KB Output is correct
45 Correct 101 ms 143560 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 98 ms 143644 KB Output is correct
2 Correct 99 ms 143644 KB Output is correct
3 Correct 98 ms 143548 KB Output is correct
4 Correct 99 ms 143644 KB Output is correct
5 Correct 97 ms 143680 KB Output is correct
6 Correct 97 ms 143548 KB Output is correct
7 Correct 96 ms 143576 KB Output is correct
8 Correct 99 ms 143640 KB Output is correct

Subtask #4
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 143540 KB Output is correct
2 Correct 97 ms 143504 KB Output is correct
3 Correct 96 ms 143496 KB Output is correct
4 Correct 104 ms 143540 KB Output is correct
5 Correct 103 ms 143548 KB Output is correct
6 Correct 96 ms 143472 KB Output is correct
7 Correct 94 ms 143532 KB Output is correct
8 Correct 96 ms 143672 KB Output is correct
9 Correct 97 ms 143540 KB Output is correct
10 Correct 97 ms 143552 KB Output is correct
11 Correct 93 ms 143548 KB Output is correct
12 Correct 94 ms 143552 KB Output is correct
13 Correct 97 ms 143552 KB Output is correct
14 Correct 101 ms 143672 KB Output is correct
15 Correct 96 ms 143560 KB Output is correct
16 Correct 96 ms 143548 KB Output is correct
17 Correct 98 ms 143428 KB Output is correct
18 Correct 97 ms 143500 KB Output is correct
19 Correct 100 ms 143496 KB Output is correct
20 Correct 100 ms 143544 KB Output is correct
21 Correct 96 ms 143440 KB Output is correct
22 Correct 99 ms 143436 KB Output is correct
23 Correct 97 ms 143448 KB Output is correct
24 Correct 97 ms 143448 KB Output is correct
25 Correct 97 ms 143544 KB Output is correct
26 Correct 100 ms 143432 KB Output is correct
27 Correct 96 ms 143548 KB Output is correct
28 Correct 98 ms 143436 KB Output is correct
29 Correct 95 ms 143512 KB Output is correct
30 Correct 97 ms 143452 KB Output is correct
31 Correct 95 ms 143516 KB Output is correct
32 Correct 95 ms 143508 KB Output is correct
33 Correct 98 ms 143556 KB Output is correct
34 Correct 100 ms 143568 KB Output is correct
35 Correct 99 ms 143532 KB Output is correct
36 Correct 96 ms 143552 KB Output is correct
37 Correct 97 ms 143544 KB Output is correct
38 Correct 97 ms 143552 KB Output is correct
39 Correct 112 ms 143448 KB Output is correct
40 Correct 101 ms 143472 KB Output is correct
41 Correct 99 ms 143536 KB Output is correct
42 Correct 97 ms 143512 KB Output is correct
43 Correct 98 ms 143468 KB Output is correct
44 Correct 99 ms 143464 KB Output is correct
45 Correct 101 ms 143560 KB Output is correct
46 Correct 98 ms 143644 KB Output is correct
47 Correct 99 ms 143644 KB Output is correct
48 Correct 98 ms 143548 KB Output is correct
49 Correct 99 ms 143644 KB Output is correct
50 Correct 97 ms 143680 KB Output is correct
51 Correct 97 ms 143548 KB Output is correct
52 Correct 96 ms 143576 KB Output is correct
53 Correct 99 ms 143640 KB Output is correct
54 Correct 99 ms 143584 KB Output is correct
55 Correct 98 ms 143548 KB Output is correct
56 Correct 99 ms 143668 KB Output is correct
57 Correct 100 ms 143676 KB Output is correct
58 Correct 106 ms 143648 KB Output is correct
59 Correct 99 ms 143608 KB Output is correct
60 Correct 98 ms 143636 KB Output is correct
61 Correct 98 ms 143524 KB Output is correct
62 Correct 100 ms 143640 KB Output is correct
63 Correct 99 ms 143600 KB Output is correct
64 Correct 98 ms 143564 KB Output is correct
65 Correct 100 ms 143640 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 143540 KB Output is correct
2 Correct 97 ms 143504 KB Output is correct
3 Correct 96 ms 143496 KB Output is correct
4 Correct 104 ms 143540 KB Output is correct
5 Correct 103 ms 143548 KB Output is correct
6 Correct 96 ms 143472 KB Output is correct
7 Correct 94 ms 143532 KB Output is correct
8 Correct 96 ms 143672 KB Output is correct
9 Correct 97 ms 143540 KB Output is correct
10 Correct 97 ms 143552 KB Output is correct
11 Correct 93 ms 143548 KB Output is correct
12 Correct 94 ms 143552 KB Output is correct
13 Correct 97 ms 143552 KB Output is correct
14 Correct 101 ms 143672 KB Output is correct
15 Correct 96 ms 143560 KB Output is correct
16 Correct 96 ms 143548 KB Output is correct
17 Correct 98 ms 143428 KB Output is correct
18 Correct 97 ms 143500 KB Output is correct
19 Correct 100 ms 143496 KB Output is correct
20 Correct 100 ms 143544 KB Output is correct
21 Correct 96 ms 143440 KB Output is correct
22 Correct 99 ms 143436 KB Output is correct
23 Correct 97 ms 143448 KB Output is correct
24 Correct 97 ms 143448 KB Output is correct
25 Correct 97 ms 143544 KB Output is correct
26 Correct 100 ms 143432 KB Output is correct
27 Correct 96 ms 143548 KB Output is correct
28 Correct 98 ms 143436 KB Output is correct
29 Correct 95 ms 143512 KB Output is correct
30 Correct 97 ms 143452 KB Output is correct
31 Correct 95 ms 143516 KB Output is correct
32 Correct 95 ms 143508 KB Output is correct
33 Correct 98 ms 143556 KB Output is correct
34 Correct 100 ms 143568 KB Output is correct
35 Correct 99 ms 143532 KB Output is correct
36 Correct 96 ms 143552 KB Output is correct
37 Correct 97 ms 143544 KB Output is correct
38 Correct 97 ms 143552 KB Output is correct
39 Correct 112 ms 143448 KB Output is correct
40 Correct 101 ms 143472 KB Output is correct
41 Correct 99 ms 143536 KB Output is correct
42 Correct 97 ms 143512 KB Output is correct
43 Correct 98 ms 143468 KB Output is correct
44 Correct 99 ms 143464 KB Output is correct
45 Correct 101 ms 143560 KB Output is correct
46 Correct 98 ms 143644 KB Output is correct
47 Correct 99 ms 143644 KB Output is correct
48 Correct 98 ms 143548 KB Output is correct
49 Correct 99 ms 143644 KB Output is correct
50 Correct 97 ms 143680 KB Output is correct
51 Correct 97 ms 143548 KB Output is correct
52 Correct 96 ms 143576 KB Output is correct
53 Correct 99 ms 143640 KB Output is correct
54 Correct 99 ms 143584 KB Output is correct
55 Correct 98 ms 143548 KB Output is correct
56 Correct 99 ms 143668 KB Output is correct
57 Correct 100 ms 143676 KB Output is correct
58 Correct 106 ms 143648 KB Output is correct
59 Correct 99 ms 143608 KB Output is correct
60 Correct 98 ms 143636 KB Output is correct
61 Correct 98 ms 143524 KB Output is correct
62 Correct 100 ms 143640 KB Output is correct
63 Correct 99 ms 143600 KB Output is correct
64 Correct 98 ms 143564 KB Output is correct
65 Correct 100 ms 143640 KB Output is correct
66 Correct 118 ms 145824 KB Output is correct
67 Correct 115 ms 145864 KB Output is correct
68 Correct 122 ms 146740 KB Output is correct
69 Correct 127 ms 144408 KB Output is correct
70 Incorrect 118 ms 144556 KB Output isn't correct
71 Halted 0 ms 0 KB -

Subtask #6
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 143540 KB Output is correct
2 Correct 97 ms 143504 KB Output is correct
3 Correct 96 ms 143496 KB Output is correct
4 Correct 104 ms 143540 KB Output is correct
5 Correct 103 ms 143548 KB Output is correct
6 Correct 96 ms 143472 KB Output is correct
7 Correct 94 ms 143532 KB Output is correct
8 Correct 96 ms 143672 KB Output is correct
9 Correct 97 ms 143540 KB Output is correct
10 Correct 97 ms 143552 KB Output is correct
11 Correct 93 ms 143548 KB Output is correct
12 Correct 94 ms 143552 KB Output is correct
13 Correct 97 ms 143552 KB Output is correct
14 Correct 101 ms 143672 KB Output is correct
15 Correct 96 ms 143560 KB Output is correct
16 Correct 96 ms 143548 KB Output is correct
17 Correct 98 ms 143428 KB Output is correct
18 Correct 97 ms 143500 KB Output is correct
19 Correct 100 ms 143496 KB Output is correct
20 Correct 100 ms 143544 KB Output is correct
21 Correct 96 ms 143440 KB Output is correct
22 Correct 99 ms 143436 KB Output is correct
23 Correct 97 ms 143448 KB Output is correct
24 Correct 97 ms 143448 KB Output is correct
25 Correct 97 ms 143544 KB Output is correct
26 Correct 100 ms 143432 KB Output is correct
27 Correct 96 ms 143548 KB Output is correct
28 Correct 98 ms 143436 KB Output is correct
29 Correct 95 ms 143512 KB Output is correct
30 Correct 97 ms 143452 KB Output is correct
31 Correct 95 ms 143516 KB Output is correct
32 Correct 95 ms 143508 KB Output is correct
33 Correct 98 ms 143556 KB Output is correct
34 Correct 100 ms 143568 KB Output is correct
35 Correct 99 ms 143532 KB Output is correct
36 Correct 96 ms 143552 KB Output is correct
37 Correct 97 ms 143544 KB Output is correct
38 Correct 97 ms 143552 KB Output is correct
39 Correct 112 ms 143448 KB Output is correct
40 Correct 101 ms 143472 KB Output is correct
41 Correct 99 ms 143536 KB Output is correct
42 Correct 97 ms 143512 KB Output is correct
43 Correct 98 ms 143468 KB Output is correct
44 Correct 99 ms 143464 KB Output is correct
45 Correct 101 ms 143560 KB Output is correct
46 Correct 98 ms 143644 KB Output is correct
47 Correct 99 ms 143644 KB Output is correct
48 Correct 98 ms 143548 KB Output is correct
49 Correct 99 ms 143644 KB Output is correct
50 Correct 97 ms 143680 KB Output is correct
51 Correct 97 ms 143548 KB Output is correct
52 Correct 96 ms 143576 KB Output is correct
53 Correct 99 ms 143640 KB Output is correct
54 Correct 99 ms 143584 KB Output is correct
55 Correct 98 ms 143548 KB Output is correct
56 Correct 99 ms 143668 KB Output is correct
57 Correct 100 ms 143676 KB Output is correct
58 Correct 106 ms 143648 KB Output is correct
59 Correct 99 ms 143608 KB Output is correct
60 Correct 98 ms 143636 KB Output is correct
61 Correct 98 ms 143524 KB Output is correct
62 Correct 100 ms 143640 KB Output is correct
63 Correct 99 ms 143600 KB Output is correct
64 Correct 98 ms 143564 KB Output is correct
65 Correct 100 ms 143640 KB Output is correct
66 Correct 927 ms 208224 KB Output is correct
67 Correct 1121 ms 222144 KB Output is correct
68 Correct 1181 ms 243580 KB Output is correct
69 Correct 596 ms 211336 KB Output is correct
70 Correct 638 ms 209356 KB Output is correct
71 Correct 1221 ms 246160 KB Output is correct
72 Correct 1138 ms 245144 KB Output is correct
73 Correct 920 ms 210024 KB Output is correct
74 Correct 1143 ms 245632 KB Output is correct
75 Correct 1141 ms 245364 KB Output is correct
76 Correct 846 ms 209464 KB Output is correct
77 Correct 1237 ms 245904 KB Output is correct
78 Correct 1045 ms 218704 KB Output is correct
79 Correct 990 ms 218676 KB Output is correct

Subtask #7
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 143540 KB Output is correct
2 Correct 97 ms 143504 KB Output is correct
3 Correct 96 ms 143496 KB Output is correct
4 Correct 104 ms 143540 KB Output is correct
5 Correct 103 ms 143548 KB Output is correct
6 Correct 96 ms 143472 KB Output is correct
7 Correct 94 ms 143532 KB Output is correct
8 Correct 96 ms 143672 KB Output is correct
9 Correct 97 ms 143540 KB Output is correct
10 Correct 97 ms 143552 KB Output is correct
11 Correct 93 ms 143548 KB Output is correct
12 Correct 94 ms 143552 KB Output is correct
13 Correct 97 ms 143552 KB Output is correct
14 Correct 101 ms 143672 KB Output is correct
15 Correct 96 ms 143560 KB Output is correct
16 Correct 96 ms 143548 KB Output is correct
17 Correct 98 ms 143428 KB Output is correct
18 Correct 97 ms 143500 KB Output is correct
19 Correct 100 ms 143496 KB Output is correct
20 Correct 100 ms 143544 KB Output is correct
21 Correct 96 ms 143440 KB Output is correct
22 Correct 99 ms 143436 KB Output is correct
23 Correct 97 ms 143448 KB Output is correct
24 Correct 97 ms 143448 KB Output is correct
25 Correct 97 ms 143544 KB Output is correct
26 Correct 100 ms 143432 KB Output is correct
27 Correct 96 ms 143548 KB Output is correct
28 Correct 98 ms 143436 KB Output is correct
29 Correct 95 ms 143512 KB Output is correct
30 Correct 97 ms 143452 KB Output is correct
31 Correct 95 ms 143516 KB Output is correct
32 Correct 95 ms 143508 KB Output is correct
33 Correct 98 ms 143556 KB Output is correct
34 Correct 100 ms 143568 KB Output is correct
35 Correct 99 ms 143532 KB Output is correct
36 Correct 96 ms 143552 KB Output is correct
37 Correct 97 ms 143544 KB Output is correct
38 Correct 97 ms 143552 KB Output is correct
39 Correct 112 ms 143448 KB Output is correct
40 Correct 101 ms 143472 KB Output is correct
41 Correct 99 ms 143536 KB Output is correct
42 Correct 97 ms 143512 KB Output is correct
43 Correct 98 ms 143468 KB Output is correct
44 Correct 99 ms 143464 KB Output is correct
45 Correct 101 ms 143560 KB Output is correct
46 Correct 98 ms 143644 KB Output is correct
47 Correct 99 ms 143644 KB Output is correct
48 Correct 98 ms 143548 KB Output is correct
49 Correct 99 ms 143644 KB Output is correct
50 Correct 97 ms 143680 KB Output is correct
51 Correct 97 ms 143548 KB Output is correct
52 Correct 96 ms 143576 KB Output is correct
53 Correct 99 ms 143640 KB Output is correct
54 Correct 99 ms 143584 KB Output is correct
55 Correct 98 ms 143548 KB Output is correct
56 Correct 99 ms 143668 KB Output is correct
57 Correct 100 ms 143676 KB Output is correct
58 Correct 106 ms 143648 KB Output is correct
59 Correct 99 ms 143608 KB Output is correct
60 Correct 98 ms 143636 KB Output is correct
61 Correct 98 ms 143524 KB Output is correct
62 Correct 100 ms 143640 KB Output is correct
63 Correct 99 ms 143600 KB Output is correct
64 Correct 98 ms 143564 KB Output is correct
65 Correct 100 ms 143640 KB Output is correct
66 Correct 118 ms 145824 KB Output is correct
67 Correct 115 ms 145864 KB Output is correct
68 Correct 122 ms 146740 KB Output is correct
69 Correct 127 ms 144408 KB Output is correct
70 Incorrect 118 ms 144556 KB Output isn't correct
71 Halted 0 ms 0 KB -