oj.uz

Submission #580285

# Submission time Handle Problem Language Result Execution time Memory
580285 2022-06-21T03:13:01 Z Cross_Ratio Mars (APIO22_mars) C++17
44 / 100
 457 ms 3432 KB 
#include "mars.h"
#include <bits/stdc++.h>
using namespace std;
string sor(string s1, string s2) {
    string s3;
    s3.resize(100);
    for(int i = 0; i < 100; i ++) {
        if(s1[i]=='1'||s2[i]=='1') s3[i] = '1';
        else s3[i] = '0';
    }
    return s3;
}
string shift(string s, int k) {
    string s2;
    s2.resize(100);
    for(int i = 0; i+k<100;i++) {
        s2[i+k] = s[i];
    }
    for(int i = 0; i < k; i++) s2[i] = '0';
    return s2;
}
int A[50][50][50];
string process(vector<vector<string>> A, int a, int b, int k, int N) {
    int i, j;
    if(N<=4) {
        if(k==0) {
            for(i=0;i<3;i++) {
                for(j=0;j<3;j++) {
                    A[i][j] = shift(A[i][j],(2*N+1)*(i+a)+(j+b));
                    //for(int m = 0; m < 9; m++) cout << A[i][j][m];
                    //cout << '\n';
                }
            }
        }

        string s3;
        s3.resize(100);
        for(int i = 0; i < 100; i++) s3[i] = '0';
        for(i=0;i<3;i++) {
            for(j=0;j<3;j++) s3 = sor(s3,A[i][j]);
        }
        /*cout <<a << ' ' << b << '\n';
        for(i=0;i<2*N+1;i++) {
            for(j=0;j<2*N+1;j++) cout << s3[(2*N+1)*i+j] << ' ';
            cout << '\n';
        }*/
        if(k!=N-1) return s3;
        int dx[4] = {0,0,1,-1};
        int dy[4] = {1,-1,0,0};
        vector<vector<bool>> vis;
        vis.resize(2*N+1);
        for(i=0;i<2*N+1;i++) vis[i].resize(2*N+1);
        for(i=0;i<2*N+1;i++) {
            for(j=0;j<2*N+1;j++) vis[i][j] = false;
        }
        int ans = 0;
        for(i=0;i<2*N+1;i++) {
            for(j=0;j<2*N+1;j++) {
                if(vis[i][j]) continue;
                if(s3[(2*N+1)*i+j]=='1') {
                    ans++;
                    queue<int> Q;
                    Q.push((2*N+1)*i+j);
                    while(!Q.empty()) {
                        int c = Q.front();
                        Q.pop();
                        if(vis[c/(2*N+1)][c%(2*N+1)]) continue;
                        vis[c/(2*N+1)][c%(2*N+1)] = true;
                        for(int m = 0; m < 4; m++) {
                            int x = c/(2*N+1)+dx[m];
                            int y = c%(2*N+1)+dy[m];
                            if(0<=x&&x<2*N+1&&0<=y&&y<2*N+1) {
                                if(!vis[x][y]&&s3[(2*N+1)*x+y]=='1') {
                                    Q.push((2*N+1)*x+y);
                                }
                            }
                        }
                    }
                }
            }
        }
        string ans_string;
        ans_string.resize(100);
        for(i=0;i<100;i++) ans_string[i] = '0';
        int id = 0;
        while(ans) {
            ans_string[id] = (char)('0'+ans%2);
            ans /= 2;
            id++;
        }
        return ans_string;
    }
    else {
        if(k==N-1) {
            int dx[4] = {0,0,1,-1};
            int dy[4] = {1,-1,0,0};
            string s3;
            s3.resize((2*N+1)*(2*N+1));
            for(i=0;i<3;i++) {
                for(j=0;j<3;j++) {
                    for(int m = 0; m < 81; m++) {
                        s3[(2*N+1)*((N-4)*i+m/9)+((N-4)*j+m%9)] = A[i][j][m];
                    }
                }
            }
            /*for(i=0;i<3;i++) {
                for(j=0;j<3;j++) {
                    for(int m = 0; m < 9; m++) {
                        for(int m2 = 0; m2 < 9; m2++) cout << A[i][j][9*m+m2] << ' ';
                        cout << '\n';
                    }
                    cout << "\n\n\n";
                }
            }*/
            /*cout << N << '\n';
            for(i=0;i<2*N+1;i++) {
                for(j=0;j<2*N+1;j++) cout << s3[(2*N+1)*i+j] << ' ';
                cout << '\n';
            }*/
            vector<vector<bool>> vis;
            vis.resize(2*N+1);
            for(i=0;i<2*N+1;i++) vis[i].resize(2*N+1);
            for(i=0;i<2*N+1;i++) {
                for(j=0;j<2*N+1;j++) vis[i][j] = false;
            }
            int ans = 0;
            for(i=0;i<2*N+1;i++) {
                for(j=0;j<2*N+1;j++) {
                    if(vis[i][j]) continue;
                    if(s3[(2*N+1)*i+j]=='1') {
                        ans++;
                        queue<int> Q;
                        Q.push((2*N+1)*i+j);
                        while(!Q.empty()) {
                            int c = Q.front();
                            Q.pop();
                            if(vis[c/(2*N+1)][c%(2*N+1)]) continue;
                            vis[c/(2*N+1)][c%(2*N+1)] = true;
                            for(int m = 0; m < 4; m++) {
                                int x = c/(2*N+1)+dx[m];
                                int y = c%(2*N+1)+dy[m];
                                if(0<=x&&x<2*N+1&&0<=y&&y<2*N+1) {
                                    if(!vis[x][y]&&s3[(2*N+1)*x+y]=='1') {
                                        Q.push((2*N+1)*x+y);
                                    }
                                }
                            }
                        }
                    }
                }
            }
            string ans_string;
            ans_string.resize(100);
            for(i=0;i<100;i++) ans_string[i] = '0';
            int id = 0;
            while(ans) {
                ans_string[id] = (char)('0'+ans%2);
                ans /= 2;
                id++;
            }
            return ans_string;
        }
        if(k < 4) {
            string s3;
            s3.resize(100);
            for(int i = 0; i < 100; i++) s3[i] = '0';
            for(i=0;i<3;i++) {
                for(j=0;j<3;j++) {
                    for(int m = 0; m < (2*k+1)*(2*k+1);m++) {
                        s3[(2*k+3)*(i+m/(2*k+1))+j+m%(2*k+1)] = A[i][j][m];
                    }
                }
            }
            /*cout << a << ' ' << b << ' ' << k << '\n';
            for(i=0;i<(2*k+3)*(2*k+3);i++) {
                cout << s3[i] << ' ';
                if(i%(2*k+3)==2*k+2) cout << '\n';
            }
            cout << '\n';*/
            return s3;
        }
        else {
            return A[a/(N-k-1)][b/(N-k-1)];
        }
        /*cout <<a << ' ' << b << '\n';
        for(i=0;i<2*N+1;i++) {
            for(j=0;j<2*N+1;j++) cout << s3[(2*N+1)*i+j] << ' ';
            cout << '\n';
        }*/

    }
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1896 KB Output is correct
2 Correct 8 ms 2140 KB Output is correct
3 Correct 8 ms 2160 KB Output is correct
4 Correct 8 ms 2128 KB Output is correct
5 Correct 8 ms 2212 KB Output is correct
6 Correct 8 ms 1900 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1896 KB Output is correct
2 Correct 8 ms 2140 KB Output is correct
3 Correct 8 ms 2160 KB Output is correct
4 Correct 8 ms 2128 KB Output is correct
5 Correct 8 ms 2212 KB Output is correct
6 Correct 8 ms 1900 KB Output is correct
7 Correct 16 ms 2084 KB Output is correct
8 Correct 23 ms 2304 KB Output is correct
9 Correct 23 ms 2352 KB Output is correct
10 Correct 22 ms 2308 KB Output is correct
11 Correct 24 ms 2156 KB Output is correct
12 Correct 22 ms 2164 KB Output is correct
13 Correct 22 ms 2288 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1896 KB Output is correct
2 Correct 8 ms 2140 KB Output is correct
3 Correct 8 ms 2160 KB Output is correct
4 Correct 8 ms 2128 KB Output is correct
5 Correct 8 ms 2212 KB Output is correct
6 Correct 8 ms 1900 KB Output is correct
7 Correct 16 ms 2084 KB Output is correct
8 Correct 23 ms 2304 KB Output is correct
9 Correct 23 ms 2352 KB Output is correct
10 Correct 22 ms 2308 KB Output is correct
11 Correct 24 ms 2156 KB Output is correct
12 Correct 22 ms 2164 KB Output is correct
13 Correct 22 ms 2288 KB Output is correct
14 Correct 35 ms 2612 KB Output is correct
15 Correct 46 ms 2600 KB Output is correct
16 Correct 46 ms 2544 KB Output is correct
17 Correct 48 ms 2600 KB Output is correct
18 Correct 51 ms 2604 KB Output is correct
19 Correct 46 ms 2624 KB Output is correct
20 Correct 47 ms 2572 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1896 KB Output is correct
2 Correct 8 ms 2140 KB Output is correct
3 Correct 8 ms 2160 KB Output is correct
4 Correct 8 ms 2128 KB Output is correct
5 Correct 8 ms 2212 KB Output is correct
6 Correct 8 ms 1900 KB Output is correct
7 Correct 16 ms 2084 KB Output is correct
8 Correct 23 ms 2304 KB Output is correct
9 Correct 23 ms 2352 KB Output is correct
10 Correct 22 ms 2308 KB Output is correct
11 Correct 24 ms 2156 KB Output is correct
12 Correct 22 ms 2164 KB Output is correct
13 Correct 22 ms 2288 KB Output is correct
14 Correct 35 ms 2612 KB Output is correct
15 Correct 46 ms 2600 KB Output is correct
16 Correct 46 ms 2544 KB Output is correct
17 Correct 48 ms 2600 KB Output is correct
18 Correct 51 ms 2604 KB Output is correct
19 Correct 46 ms 2624 KB Output is correct
20 Correct 47 ms 2572 KB Output is correct
21 Correct 79 ms 2632 KB Output is correct
22 Correct 104 ms 2716 KB Output is correct
23 Correct 111 ms 2884 KB Output is correct
24 Correct 104 ms 2724 KB Output is correct
25 Correct 113 ms 2740 KB Output is correct
26 Correct 106 ms 2836 KB Output is correct
27 Correct 103 ms 2720 KB Output is correct
28 Correct 107 ms 2816 KB Output is correct

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1896 KB Output is correct
2 Correct 8 ms 2140 KB Output is correct
3 Correct 8 ms 2160 KB Output is correct
4 Correct 8 ms 2128 KB Output is correct
5 Correct 8 ms 2212 KB Output is correct
6 Correct 8 ms 1900 KB Output is correct
7 Correct 16 ms 2084 KB Output is correct
8 Correct 23 ms 2304 KB Output is correct
9 Correct 23 ms 2352 KB Output is correct
10 Correct 22 ms 2308 KB Output is correct
11 Correct 24 ms 2156 KB Output is correct
12 Correct 22 ms 2164 KB Output is correct
13 Correct 22 ms 2288 KB Output is correct
14 Correct 35 ms 2612 KB Output is correct
15 Correct 46 ms 2600 KB Output is correct
16 Correct 46 ms 2544 KB Output is correct
17 Correct 48 ms 2600 KB Output is correct
18 Correct 51 ms 2604 KB Output is correct
19 Correct 46 ms 2624 KB Output is correct
20 Correct 47 ms 2572 KB Output is correct
21 Correct 79 ms 2632 KB Output is correct
22 Correct 104 ms 2716 KB Output is correct
23 Correct 111 ms 2884 KB Output is correct
24 Correct 104 ms 2724 KB Output is correct
25 Correct 113 ms 2740 KB Output is correct
26 Correct 106 ms 2836 KB Output is correct
27 Correct 103 ms 2720 KB Output is correct
28 Correct 107 ms 2816 KB Output is correct
29 Correct 156 ms 2764 KB Output is correct
30 Correct 212 ms 2884 KB Output is correct
31 Correct 190 ms 2844 KB Output is correct
32 Correct 214 ms 2996 KB Output is correct
33 Correct 209 ms 2852 KB Output is correct
34 Correct 210 ms 2892 KB Output is correct
35 Correct 206 ms 2880 KB Output is correct
36 Correct 203 ms 3044 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1896 KB Output is correct
2 Correct 8 ms 2140 KB Output is correct
3 Correct 8 ms 2160 KB Output is correct
4 Correct 8 ms 2128 KB Output is correct
5 Correct 8 ms 2212 KB Output is correct
6 Correct 8 ms 1900 KB Output is correct
7 Correct 16 ms 2084 KB Output is correct
8 Correct 23 ms 2304 KB Output is correct
9 Correct 23 ms 2352 KB Output is correct
10 Correct 22 ms 2308 KB Output is correct
11 Correct 24 ms 2156 KB Output is correct
12 Correct 22 ms 2164 KB Output is correct
13 Correct 22 ms 2288 KB Output is correct
14 Correct 35 ms 2612 KB Output is correct
15 Correct 46 ms 2600 KB Output is correct
16 Correct 46 ms 2544 KB Output is correct
17 Correct 48 ms 2600 KB Output is correct
18 Correct 51 ms 2604 KB Output is correct
19 Correct 46 ms 2624 KB Output is correct
20 Correct 47 ms 2572 KB Output is correct
21 Correct 79 ms 2632 KB Output is correct
22 Correct 104 ms 2716 KB Output is correct
23 Correct 111 ms 2884 KB Output is correct
24 Correct 104 ms 2724 KB Output is correct
25 Correct 113 ms 2740 KB Output is correct
26 Correct 106 ms 2836 KB Output is correct
27 Correct 103 ms 2720 KB Output is correct
28 Correct 107 ms 2816 KB Output is correct
29 Correct 156 ms 2764 KB Output is correct
30 Correct 212 ms 2884 KB Output is correct
31 Correct 190 ms 2844 KB Output is correct
32 Correct 214 ms 2996 KB Output is correct
33 Correct 209 ms 2852 KB Output is correct
34 Correct 210 ms 2892 KB Output is correct
35 Correct 206 ms 2880 KB Output is correct
36 Correct 203 ms 3044 KB Output is correct
37 Correct 284 ms 3120 KB Output is correct
38 Correct 336 ms 3332 KB Output is correct
39 Correct 346 ms 3228 KB Output is correct
40 Correct 355 ms 3408 KB Output is correct
41 Correct 346 ms 3308 KB Output is correct
42 Correct 367 ms 3200 KB Output is correct
43 Correct 348 ms 3228 KB Output is correct
44 Correct 344 ms 3168 KB Output is correct

Subtask #7
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1896 KB Output is correct
2 Correct 8 ms 2140 KB Output is correct
3 Correct 8 ms 2160 KB Output is correct
4 Correct 8 ms 2128 KB Output is correct
5 Correct 8 ms 2212 KB Output is correct
6 Correct 8 ms 1900 KB Output is correct
7 Correct 16 ms 2084 KB Output is correct
8 Correct 23 ms 2304 KB Output is correct
9 Correct 23 ms 2352 KB Output is correct
10 Correct 22 ms 2308 KB Output is correct
11 Correct 24 ms 2156 KB Output is correct
12 Correct 22 ms 2164 KB Output is correct
13 Correct 22 ms 2288 KB Output is correct
14 Correct 35 ms 2612 KB Output is correct
15 Correct 46 ms 2600 KB Output is correct
16 Correct 46 ms 2544 KB Output is correct
17 Correct 48 ms 2600 KB Output is correct
18 Correct 51 ms 2604 KB Output is correct
19 Correct 46 ms 2624 KB Output is correct
20 Correct 47 ms 2572 KB Output is correct
21 Correct 79 ms 2632 KB Output is correct
22 Correct 104 ms 2716 KB Output is correct
23 Correct 111 ms 2884 KB Output is correct
24 Correct 104 ms 2724 KB Output is correct
25 Correct 113 ms 2740 KB Output is correct
26 Correct 106 ms 2836 KB Output is correct
27 Correct 103 ms 2720 KB Output is correct
28 Correct 107 ms 2816 KB Output is correct
29 Correct 156 ms 2764 KB Output is correct
30 Correct 212 ms 2884 KB Output is correct
31 Correct 190 ms 2844 KB Output is correct
32 Correct 214 ms 2996 KB Output is correct
33 Correct 209 ms 2852 KB Output is correct
34 Correct 210 ms 2892 KB Output is correct
35 Correct 206 ms 2880 KB Output is correct
36 Correct 203 ms 3044 KB Output is correct
37 Correct 284 ms 3120 KB Output is correct
38 Correct 336 ms 3332 KB Output is correct
39 Correct 346 ms 3228 KB Output is correct
40 Correct 355 ms 3408 KB Output is correct
41 Correct 346 ms 3308 KB Output is correct
42 Correct 367 ms 3200 KB Output is correct
43 Correct 348 ms 3228 KB Output is correct
44 Correct 344 ms 3168 KB Output is correct
45 Correct 457 ms 3432 KB Output is correct
46 Incorrect 69 ms 436 KB Incorrect
47 Halted 0 ms 0 KB -

Subtask #8
0.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1896 KB Output is correct
2 Correct 8 ms 2140 KB Output is correct
3 Correct 8 ms 2160 KB Output is correct
4 Correct 8 ms 2128 KB Output is correct
5 Correct 8 ms 2212 KB Output is correct
6 Correct 8 ms 1900 KB Output is correct
7 Correct 16 ms 2084 KB Output is correct
8 Correct 23 ms 2304 KB Output is correct
9 Correct 23 ms 2352 KB Output is correct
10 Correct 22 ms 2308 KB Output is correct
11 Correct 24 ms 2156 KB Output is correct
12 Correct 22 ms 2164 KB Output is correct
13 Correct 22 ms 2288 KB Output is correct
14 Correct 35 ms 2612 KB Output is correct
15 Correct 46 ms 2600 KB Output is correct
16 Correct 46 ms 2544 KB Output is correct
17 Correct 48 ms 2600 KB Output is correct
18 Correct 51 ms 2604 KB Output is correct
19 Correct 46 ms 2624 KB Output is correct
20 Correct 47 ms 2572 KB Output is correct
21 Correct 79 ms 2632 KB Output is correct
22 Correct 104 ms 2716 KB Output is correct
23 Correct 111 ms 2884 KB Output is correct
24 Correct 104 ms 2724 KB Output is correct
25 Correct 113 ms 2740 KB Output is correct
26 Correct 106 ms 2836 KB Output is correct
27 Correct 103 ms 2720 KB Output is correct
28 Correct 107 ms 2816 KB Output is correct
29 Correct 156 ms 2764 KB Output is correct
30 Correct 212 ms 2884 KB Output is correct
31 Correct 190 ms 2844 KB Output is correct
32 Correct 214 ms 2996 KB Output is correct
33 Correct 209 ms 2852 KB Output is correct
34 Correct 210 ms 2892 KB Output is correct
35 Correct 206 ms 2880 KB Output is correct
36 Correct 203 ms 3044 KB Output is correct
37 Correct 284 ms 3120 KB Output is correct
38 Correct 336 ms 3332 KB Output is correct
39 Correct 346 ms 3228 KB Output is correct
40 Correct 355 ms 3408 KB Output is correct
41 Correct 346 ms 3308 KB Output is correct
42 Correct 367 ms 3200 KB Output is correct
43 Correct 348 ms 3228 KB Output is correct
44 Correct 344 ms 3168 KB Output is correct
45 Correct 457 ms 3432 KB Output is correct
46 Incorrect 69 ms 436 KB Incorrect
47 Halted 0 ms 0 KB -

Subtask #9
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1896 KB Output is correct
2 Correct 8 ms 2140 KB Output is correct
3 Correct 8 ms 2160 KB Output is correct
4 Correct 8 ms 2128 KB Output is correct
5 Correct 8 ms 2212 KB Output is correct
6 Correct 8 ms 1900 KB Output is correct
7 Correct 16 ms 2084 KB Output is correct
8 Correct 23 ms 2304 KB Output is correct
9 Correct 23 ms 2352 KB Output is correct
10 Correct 22 ms 2308 KB Output is correct
11 Correct 24 ms 2156 KB Output is correct
12 Correct 22 ms 2164 KB Output is correct
13 Correct 22 ms 2288 KB Output is correct
14 Correct 35 ms 2612 KB Output is correct
15 Correct 46 ms 2600 KB Output is correct
16 Correct 46 ms 2544 KB Output is correct
17 Correct 48 ms 2600 KB Output is correct
18 Correct 51 ms 2604 KB Output is correct
19 Correct 46 ms 2624 KB Output is correct
20 Correct 47 ms 2572 KB Output is correct
21 Correct 79 ms 2632 KB Output is correct
22 Correct 104 ms 2716 KB Output is correct
23 Correct 111 ms 2884 KB Output is correct
24 Correct 104 ms 2724 KB Output is correct
25 Correct 113 ms 2740 KB Output is correct
26 Correct 106 ms 2836 KB Output is correct
27 Correct 103 ms 2720 KB Output is correct
28 Correct 107 ms 2816 KB Output is correct
29 Correct 156 ms 2764 KB Output is correct
30 Correct 212 ms 2884 KB Output is correct
31 Correct 190 ms 2844 KB Output is correct
32 Correct 214 ms 2996 KB Output is correct
33 Correct 209 ms 2852 KB Output is correct
34 Correct 210 ms 2892 KB Output is correct
35 Correct 206 ms 2880 KB Output is correct
36 Correct 203 ms 3044 KB Output is correct
37 Correct 284 ms 3120 KB Output is correct
38 Correct 336 ms 3332 KB Output is correct
39 Correct 346 ms 3228 KB Output is correct
40 Correct 355 ms 3408 KB Output is correct
41 Correct 346 ms 3308 KB Output is correct
42 Correct 367 ms 3200 KB Output is correct
43 Correct 348 ms 3228 KB Output is correct
44 Correct 344 ms 3168 KB Output is correct
45 Correct 457 ms 3432 KB Output is correct
46 Incorrect 69 ms 436 KB Incorrect
47 Halted 0 ms 0 KB -

Subtask #10
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 1896 KB Output is correct
2 Correct 8 ms 2140 KB Output is correct
3 Correct 8 ms 2160 KB Output is correct
4 Correct 8 ms 2128 KB Output is correct
5 Correct 8 ms 2212 KB Output is correct
6 Correct 8 ms 1900 KB Output is correct
7 Correct 16 ms 2084 KB Output is correct
8 Correct 23 ms 2304 KB Output is correct
9 Correct 23 ms 2352 KB Output is correct
10 Correct 22 ms 2308 KB Output is correct
11 Correct 24 ms 2156 KB Output is correct
12 Correct 22 ms 2164 KB Output is correct
13 Correct 22 ms 2288 KB Output is correct
14 Correct 35 ms 2612 KB Output is correct
15 Correct 46 ms 2600 KB Output is correct
16 Correct 46 ms 2544 KB Output is correct
17 Correct 48 ms 2600 KB Output is correct
18 Correct 51 ms 2604 KB Output is correct
19 Correct 46 ms 2624 KB Output is correct
20 Correct 47 ms 2572 KB Output is correct
21 Correct 79 ms 2632 KB Output is correct
22 Correct 104 ms 2716 KB Output is correct
23 Correct 111 ms 2884 KB Output is correct
24 Correct 104 ms 2724 KB Output is correct
25 Correct 113 ms 2740 KB Output is correct
26 Correct 106 ms 2836 KB Output is correct
27 Correct 103 ms 2720 KB Output is correct
28 Correct 107 ms 2816 KB Output is correct
29 Correct 156 ms 2764 KB Output is correct
30 Correct 212 ms 2884 KB Output is correct
31 Correct 190 ms 2844 KB Output is correct
32 Correct 214 ms 2996 KB Output is correct
33 Correct 209 ms 2852 KB Output is correct
34 Correct 210 ms 2892 KB Output is correct
35 Correct 206 ms 2880 KB Output is correct
36 Correct 203 ms 3044 KB Output is correct
37 Correct 284 ms 3120 KB Output is correct
38 Correct 336 ms 3332 KB Output is correct
39 Correct 346 ms 3228 KB Output is correct
40 Correct 355 ms 3408 KB Output is correct
41 Correct 346 ms 3308 KB Output is correct
42 Correct 367 ms 3200 KB Output is correct
43 Correct 348 ms 3228 KB Output is correct
44 Correct 344 ms 3168 KB Output is correct
45 Correct 457 ms 3432 KB Output is correct
46 Incorrect 69 ms 436 KB Incorrect
47 Halted 0 ms 0 KB -