oj.uz

답안 #438097

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
438097 2021-06-27T14:29:19 Z cheeheng 밀림 점프 (APIO21_jumps) C++14
37 / 100
 4000 ms 83616 KB 
#include "jumps.h"
#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> ii;

int nextGreater[200005][20];
int prevGreater[200005][20];
int indx[200005];
int log2_[200005];
ii val[200005][20];
int best[200005][20];
int A1[200005];

int M;

void init2(){
    for(int i = 0; i < M; i ++){
        val[i][0] = ii(A1[i], i);
    }

    for(int k = 1; k < 20; k ++){
        for(int i = 0; i <= M-(1<<k); i ++){
            val[i][k] = max(val[i][k-1], val[i+(1<<(k-1))][k-1]);
        }
    }

    log2_[1] = 0;
    for(int i = 2; i <= M; i ++){
        log2_[i] = log2_[i>>1] + 1;
    }
}

ii findMax(int l, int r){
    int k = log2_[r-l+1];
    return max(val[l][k], val[r-(1<<k)+1][k]);
}

void init(int N, std::vector<int> H){
    M = N;

    for(int i = 0; i < N; i ++){
        A1[i] = H[i];
    }

    init2();

    for(int i = 0; i < N; i ++){
        nextGreater[i][0] = N;
        prevGreater[i][0] = -1;
    }

    vector<ii> stack1 = vector<ii>();
    for(int i = 0; i < N; i ++){
        while(!stack1.empty()){
            ii temp = stack1.back();

            if(temp.first < H[i]){
                nextGreater[temp.second][0] = i;
                stack1.pop_back();
            }else{
                break;
            }
        }
        stack1.emplace_back(H[i], i);
    }

    stack1 = vector<ii>();
    for(int i = N-1; i >= 0; i --){
        while(!stack1.empty()){
            ii temp = stack1.back();

            if(temp.first < H[i]){
                prevGreater[temp.second][0] = i;
                stack1.pop_back();
            }else{
                break;
            }
        }
        stack1.emplace_back(H[i], i);
    }

    /*for(int i = 0; i < N; i ++){
        printf("nextGreater[%d]=%d\n", i, nextGreater[i][0]);
    }

    for(int i = 0; i < N; i ++){
        printf("prevGreater[%d]=%d\n", i, prevGreater[i][0]);
    }*/

    for(int k = 1; k < 20; k ++){
        for(int i = 0; i < N; i ++){
            if(nextGreater[i][k-1] == N){
                nextGreater[i][k] = N;
            }else{
                nextGreater[i][k] = nextGreater[nextGreater[i][k-1]][k-1];
            }

            if(prevGreater[i][k-1] == -1){
                prevGreater[i][k] = -1;
            }else{
                prevGreater[i][k] = prevGreater[prevGreater[i][k-1]][k-1];
            }
        }
    }

    for(int i = 0; i < N; i ++){
        int X2 = i;
        int X3, X4;
        if(prevGreater[X2][0] == -1){
            X3 = nextGreater[X2][0];
            X4 = prevGreater[X2][0];
        }else if(nextGreater[X2][0] == N){
            X3 = prevGreater[X2][0];
            X4 = nextGreater[X2][0];
        }else if(A1[prevGreater[X2][0]] > A1[nextGreater[X2][0]]){
            X3 = prevGreater[X2][0];
            X4 = nextGreater[X2][0];
        }else{
            X3 = nextGreater[X2][0];
            X4 = prevGreater[X2][0];
        }
        best[i][0] = X3;
        if(best[i][0] == N){best[i][0] = -1;}
    }

    for(int k = 1; k < 20; k ++){
        for(int i = 0; i < N; i ++){
            if(best[i][k-1] == -1){
                best[i][k] = -1;
            }else{
                best[i][k] = best[best[i][k-1]][k-1];
            }
        }
    }
}

int minimum_jumps(int A, int B, int C, int D){
    assert(0 <= A && A <= B && B < C && C <= D && D <= M-1);

    ii maxValCD = findMax(C, D);
    int maxIndxCD = prevGreater[maxValCD.second][0];
    //printf("maxValCD=%d\n", maxValCD);
    A = max(maxIndxCD+1, A);

    if(A > B){return -1;}

    ii maxValAB = findMax(A, B);
    int X = maxValAB.second;

    int cutOffIndx = X;
    for(int k = 19; k >= 0; k --){
        if(nextGreater[cutOffIndx][k] != M && nextGreater[cutOffIndx][k] < C){
            cutOffIndx = nextGreater[cutOffIndx][k];
        }
    }
    cutOffIndx = nextGreater[cutOffIndx][0];
    assert(cutOffIndx >= C && cutOffIndx <= D);

    int ans = 0;

    int X5 = X;
    int totalDist = 0;
    for(int k = 19; k >= 0; k --){
        int temp = best[X5][k];
        if(temp != -1 && A1[temp] < A1[cutOffIndx]){
            totalDist += (1<<k);
            X5 = temp;
        }
        assert(X5 != -1);
    }

    int X2 = X;
    totalDist = max(totalDist-2, 0);
    ans += totalDist;
    for(int k = 19; k >= 0; k --){
        int temp = best[X2][k];
        if(totalDist >= (1<<k)){
            totalDist -= (1<<k);
            X2 = temp;
        }
    }

    while(X2 < C){
        int X3, X4;
        if(prevGreater[X2][0] == -1){
            X3 = nextGreater[X2][0];
            X4 = prevGreater[X2][0];
        }else if(nextGreater[X2][0] == M){
            X3 = prevGreater[X2][0];
            X4 = nextGreater[X2][0];
        }else if(A1[prevGreater[X2][0]] > A1[nextGreater[X2][0]]){
            X3 = prevGreater[X2][0];
            X4 = nextGreater[X2][0];
        }else{
            X3 = nextGreater[X2][0];
            X4 = prevGreater[X2][0];
        }

        assert(X3 >= 0 && X3 < M);

        //printf("X2=%d; X3=%d; X4=%d\n", X2, X3, X4);
        if(X4 >= C && X4 <= D){
            X2 = X4;
        }else if(A1[X3] > maxValCD.first){
            X2 = X4;
        }else{
            X2 = X3;
        }
        //printf("X2=%d\n", X2);
        ans ++;
        assert(X2 >= 0 && X2 < M);
    }

    return ans;
}

Compilation message

jumps.cpp: In function 'void init(int, std::vector<int>)':
jumps.cpp:109:17: warning: variable 'X4' set but not used [-Wunused-but-set-variable]
  109 |         int X3, X4;
      |                 ^~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 317 ms 66492 KB Output is correct
4 Correct 1696 ms 83376 KB Output is correct
5 Correct 1368 ms 42164 KB Output is correct
6 Correct 1745 ms 83352 KB Output is correct
7 Correct 1369 ms 57012 KB Output is correct
8 Correct 1635 ms 83352 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 5 ms 328 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 4 ms 328 KB Output is correct
9 Correct 2 ms 328 KB Output is correct
10 Correct 3 ms 328 KB Output is correct
11 Correct 4 ms 328 KB Output is correct
12 Correct 2 ms 328 KB Output is correct
13 Correct 4 ms 328 KB Output is correct
14 Correct 3 ms 328 KB Output is correct
15 Correct 2 ms 328 KB Output is correct
16 Correct 2 ms 328 KB Output is correct
17 Correct 2 ms 328 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 2 ms 328 KB Output is correct
22 Correct 3 ms 328 KB Output is correct
23 Correct 4 ms 328 KB Output is correct
24 Correct 2 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
27 Correct 3 ms 328 KB Output is correct
28 Correct 2 ms 344 KB Output is correct
29 Correct 4 ms 328 KB Output is correct
30 Correct 4 ms 328 KB Output is correct
31 Correct 3 ms 328 KB Output is correct
32 Correct 2 ms 328 KB Output is correct
33 Correct 1 ms 328 KB Output is correct
34 Correct 1 ms 328 KB Output is correct
35 Correct 1 ms 328 KB Output is correct
36 Correct 1 ms 328 KB Output is correct
37 Correct 1 ms 328 KB Output is correct
38 Correct 1 ms 328 KB Output is correct
39 Correct 1 ms 328 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 5 ms 328 KB Output is correct
7 Correct 2 ms 328 KB Output is correct
8 Correct 4 ms 328 KB Output is correct
9 Correct 2 ms 328 KB Output is correct
10 Correct 3 ms 328 KB Output is correct
11 Correct 4 ms 328 KB Output is correct
12 Correct 2 ms 328 KB Output is correct
13 Correct 4 ms 328 KB Output is correct
14 Correct 3 ms 328 KB Output is correct
15 Correct 2 ms 328 KB Output is correct
16 Correct 2 ms 328 KB Output is correct
17 Correct 2 ms 328 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 3 ms 328 KB Output is correct
21 Correct 2 ms 328 KB Output is correct
22 Correct 3 ms 328 KB Output is correct
23 Correct 4 ms 328 KB Output is correct
24 Correct 2 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
27 Correct 3 ms 328 KB Output is correct
28 Correct 2 ms 344 KB Output is correct
29 Correct 4 ms 328 KB Output is correct
30 Correct 4 ms 328 KB Output is correct
31 Correct 3 ms 328 KB Output is correct
32 Correct 2 ms 328 KB Output is correct
33 Correct 1 ms 328 KB Output is correct
34 Correct 1 ms 328 KB Output is correct
35 Correct 1 ms 328 KB Output is correct
36 Correct 1 ms 328 KB Output is correct
37 Correct 1 ms 328 KB Output is correct
38 Correct 1 ms 328 KB Output is correct
39 Correct 1 ms 328 KB Output is correct
40 Correct 1 ms 328 KB Output is correct
41 Correct 1 ms 328 KB Output is correct
42 Correct 1 ms 328 KB Output is correct
43 Correct 1 ms 328 KB Output is correct
44 Correct 3 ms 328 KB Output is correct
45 Correct 3 ms 328 KB Output is correct
46 Correct 3 ms 328 KB Output is correct
47 Correct 3 ms 328 KB Output is correct
48 Correct 2 ms 328 KB Output is correct
49 Correct 3 ms 328 KB Output is correct
50 Correct 5 ms 328 KB Output is correct
51 Correct 3 ms 328 KB Output is correct
52 Correct 2 ms 328 KB Output is correct
53 Correct 3 ms 328 KB Output is correct
54 Correct 4 ms 328 KB Output is correct
55 Correct 4 ms 328 KB Output is correct
56 Correct 2 ms 328 KB Output is correct
57 Correct 1 ms 328 KB Output is correct
58 Correct 21 ms 968 KB Output is correct
59 Correct 32 ms 1096 KB Output is correct
60 Correct 9 ms 592 KB Output is correct
61 Correct 17 ms 1104 KB Output is correct
62 Correct 20 ms 336 KB Output is correct
63 Correct 20 ms 1100 KB Output is correct
64 Correct 31 ms 1104 KB Output is correct
65 Correct 33 ms 1096 KB Output is correct
66 Correct 35 ms 1096 KB Output is correct
67 Correct 29 ms 1096 KB Output is correct
68 Correct 32 ms 1096 KB Output is correct
69 Correct 30 ms 1096 KB Output is correct
70 Correct 31 ms 1096 KB Output is correct
71 Correct 1 ms 328 KB Output is correct
72 Correct 1 ms 328 KB Output is correct
73 Correct 4 ms 328 KB Output is correct
74 Correct 3 ms 328 KB Output is correct
75 Correct 3 ms 328 KB Output is correct
76 Correct 4 ms 328 KB Output is correct
77 Correct 3 ms 328 KB Output is correct
78 Correct 1 ms 328 KB Output is correct
79 Correct 1 ms 200 KB Output is correct
80 Correct 2 ms 328 KB Output is correct
81 Correct 3 ms 328 KB Output is correct
82 Correct 3 ms 328 KB Output is correct
83 Correct 4 ms 328 KB Output is correct
84 Correct 4 ms 328 KB Output is correct
85 Correct 3 ms 328 KB Output is correct
86 Correct 1 ms 328 KB Output is correct
87 Correct 1 ms 328 KB Output is correct
88 Correct 1 ms 328 KB Output is correct
89 Correct 1 ms 328 KB Output is correct
90 Correct 1 ms 328 KB Output is correct
91 Correct 1 ms 328 KB Output is correct
92 Correct 1 ms 328 KB Output is correct
93 Correct 1 ms 328 KB Output is correct
94 Correct 5 ms 328 KB Output is correct
95 Correct 28 ms 1096 KB Output is correct
96 Correct 31 ms 1096 KB Output is correct
97 Correct 20 ms 1096 KB Output is correct
98 Correct 28 ms 1096 KB Output is correct
99 Correct 21 ms 1096 KB Output is correct
100 Correct 1 ms 328 KB Output is correct
101 Correct 2 ms 584 KB Output is correct
102 Correct 33 ms 1096 KB Output is correct
103 Correct 19 ms 1096 KB Output is correct
104 Correct 29 ms 1096 KB Output is correct
105 Correct 20 ms 1096 KB Output is correct
106 Correct 18 ms 1096 KB Output is correct
107 Correct 1 ms 328 KB Output is correct
108 Correct 1 ms 584 KB Output is correct
109 Correct 2 ms 1096 KB Output is correct
110 Correct 1 ms 1096 KB Output is correct
111 Correct 2 ms 1096 KB Output is correct
112 Correct 2 ms 1096 KB Output is correct
113 Correct 1 ms 1096 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 187 ms 65756 KB Output is correct
6 Correct 246 ms 81600 KB Output is correct
7 Correct 106 ms 41920 KB Output is correct
8 Correct 219 ms 81688 KB Output is correct
9 Correct 18 ms 12488 KB Output is correct
10 Correct 242 ms 81600 KB Output is correct
11 Correct 229 ms 83492 KB Output is correct
12 Correct 211 ms 82864 KB Output is correct
13 Correct 243 ms 82864 KB Output is correct
14 Correct 230 ms 81824 KB Output is correct
15 Correct 224 ms 83500 KB Output is correct
16 Correct 214 ms 81884 KB Output is correct
17 Correct 243 ms 82200 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 1 ms 328 KB Output is correct
22 Correct 1 ms 328 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 584 KB Output is correct
27 Correct 2 ms 1096 KB Output is correct
28 Correct 2 ms 1096 KB Output is correct
29 Correct 2 ms 1096 KB Output is correct
30 Correct 2 ms 1096 KB Output is correct
31 Correct 2 ms 1096 KB Output is correct
32 Correct 1 ms 328 KB Output is correct
33 Correct 238 ms 81560 KB Output is correct
34 Correct 224 ms 81676 KB Output is correct
35 Correct 231 ms 82992 KB Output is correct
36 Correct 236 ms 81692 KB Output is correct
37 Correct 234 ms 83616 KB Output is correct
38 Correct 226 ms 81804 KB Output is correct
39 Correct 1 ms 328 KB Output is correct
40 Correct 136 ms 47392 KB Output is correct
41 Correct 235 ms 81724 KB Output is correct
42 Correct 214 ms 83080 KB Output is correct
43 Correct 225 ms 81600 KB Output is correct
44 Correct 222 ms 83480 KB Output is correct
45 Correct 224 ms 81804 KB Output is correct

Subtask #5
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 323 ms 37440 KB Output is correct
5 Correct 1201 ms 81664 KB Output is correct
6 Correct 770 ms 13640 KB Output is correct
7 Correct 1277 ms 81600 KB Output is correct
8 Correct 757 ms 28340 KB Output is correct
9 Correct 1252 ms 81676 KB Output is correct
10 Correct 1721 ms 83352 KB Output is correct
11 Execution timed out 4024 ms 83228 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #6
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 323 ms 37440 KB Output is correct
5 Correct 1201 ms 81664 KB Output is correct
6 Correct 770 ms 13640 KB Output is correct
7 Correct 1277 ms 81600 KB Output is correct
8 Correct 757 ms 28340 KB Output is correct
9 Correct 1252 ms 81676 KB Output is correct
10 Correct 1721 ms 83352 KB Output is correct
11 Execution timed out 4024 ms 83228 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 328 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 317 ms 66492 KB Output is correct
4 Correct 1696 ms 83376 KB Output is correct
5 Correct 1368 ms 42164 KB Output is correct
6 Correct 1745 ms 83352 KB Output is correct
7 Correct 1369 ms 57012 KB Output is correct
8 Correct 1635 ms 83352 KB Output is correct
9 Correct 1 ms 328 KB Output is correct
10 Correct 1 ms 328 KB Output is correct
11 Correct 1 ms 328 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 2 ms 328 KB Output is correct
14 Correct 5 ms 328 KB Output is correct
15 Correct 2 ms 328 KB Output is correct
16 Correct 4 ms 328 KB Output is correct
17 Correct 2 ms 328 KB Output is correct
18 Correct 3 ms 328 KB Output is correct
19 Correct 4 ms 328 KB Output is correct
20 Correct 2 ms 328 KB Output is correct
21 Correct 4 ms 328 KB Output is correct
22 Correct 3 ms 328 KB Output is correct
23 Correct 2 ms 328 KB Output is correct
24 Correct 2 ms 328 KB Output is correct
25 Correct 2 ms 328 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
27 Correct 1 ms 328 KB Output is correct
28 Correct 3 ms 328 KB Output is correct
29 Correct 2 ms 328 KB Output is correct
30 Correct 3 ms 328 KB Output is correct
31 Correct 4 ms 328 KB Output is correct
32 Correct 2 ms 328 KB Output is correct
33 Correct 1 ms 328 KB Output is correct
34 Correct 1 ms 328 KB Output is correct
35 Correct 3 ms 328 KB Output is correct
36 Correct 2 ms 344 KB Output is correct
37 Correct 4 ms 328 KB Output is correct
38 Correct 4 ms 328 KB Output is correct
39 Correct 3 ms 328 KB Output is correct
40 Correct 2 ms 328 KB Output is correct
41 Correct 1 ms 328 KB Output is correct
42 Correct 1 ms 328 KB Output is correct
43 Correct 1 ms 328 KB Output is correct
44 Correct 1 ms 328 KB Output is correct
45 Correct 1 ms 328 KB Output is correct
46 Correct 1 ms 328 KB Output is correct
47 Correct 1 ms 328 KB Output is correct
48 Correct 1 ms 328 KB Output is correct
49 Correct 1 ms 328 KB Output is correct
50 Correct 1 ms 328 KB Output is correct
51 Correct 1 ms 328 KB Output is correct
52 Correct 3 ms 328 KB Output is correct
53 Correct 3 ms 328 KB Output is correct
54 Correct 3 ms 328 KB Output is correct
55 Correct 3 ms 328 KB Output is correct
56 Correct 2 ms 328 KB Output is correct
57 Correct 3 ms 328 KB Output is correct
58 Correct 5 ms 328 KB Output is correct
59 Correct 3 ms 328 KB Output is correct
60 Correct 2 ms 328 KB Output is correct
61 Correct 3 ms 328 KB Output is correct
62 Correct 4 ms 328 KB Output is correct
63 Correct 4 ms 328 KB Output is correct
64 Correct 2 ms 328 KB Output is correct
65 Correct 1 ms 328 KB Output is correct
66 Correct 21 ms 968 KB Output is correct
67 Correct 32 ms 1096 KB Output is correct
68 Correct 9 ms 592 KB Output is correct
69 Correct 17 ms 1104 KB Output is correct
70 Correct 20 ms 336 KB Output is correct
71 Correct 20 ms 1100 KB Output is correct
72 Correct 31 ms 1104 KB Output is correct
73 Correct 33 ms 1096 KB Output is correct
74 Correct 35 ms 1096 KB Output is correct
75 Correct 29 ms 1096 KB Output is correct
76 Correct 32 ms 1096 KB Output is correct
77 Correct 30 ms 1096 KB Output is correct
78 Correct 31 ms 1096 KB Output is correct
79 Correct 1 ms 328 KB Output is correct
80 Correct 1 ms 328 KB Output is correct
81 Correct 4 ms 328 KB Output is correct
82 Correct 3 ms 328 KB Output is correct
83 Correct 3 ms 328 KB Output is correct
84 Correct 4 ms 328 KB Output is correct
85 Correct 3 ms 328 KB Output is correct
86 Correct 1 ms 328 KB Output is correct
87 Correct 1 ms 200 KB Output is correct
88 Correct 2 ms 328 KB Output is correct
89 Correct 3 ms 328 KB Output is correct
90 Correct 3 ms 328 KB Output is correct
91 Correct 4 ms 328 KB Output is correct
92 Correct 4 ms 328 KB Output is correct
93 Correct 3 ms 328 KB Output is correct
94 Correct 1 ms 328 KB Output is correct
95 Correct 1 ms 328 KB Output is correct
96 Correct 1 ms 328 KB Output is correct
97 Correct 1 ms 328 KB Output is correct
98 Correct 1 ms 328 KB Output is correct
99 Correct 1 ms 328 KB Output is correct
100 Correct 1 ms 328 KB Output is correct
101 Correct 1 ms 328 KB Output is correct
102 Correct 5 ms 328 KB Output is correct
103 Correct 28 ms 1096 KB Output is correct
104 Correct 31 ms 1096 KB Output is correct
105 Correct 20 ms 1096 KB Output is correct
106 Correct 28 ms 1096 KB Output is correct
107 Correct 21 ms 1096 KB Output is correct
108 Correct 1 ms 328 KB Output is correct
109 Correct 2 ms 584 KB Output is correct
110 Correct 33 ms 1096 KB Output is correct
111 Correct 19 ms 1096 KB Output is correct
112 Correct 29 ms 1096 KB Output is correct
113 Correct 20 ms 1096 KB Output is correct
114 Correct 18 ms 1096 KB Output is correct
115 Correct 1 ms 328 KB Output is correct
116 Correct 1 ms 584 KB Output is correct
117 Correct 2 ms 1096 KB Output is correct
118 Correct 1 ms 1096 KB Output is correct
119 Correct 2 ms 1096 KB Output is correct
120 Correct 2 ms 1096 KB Output is correct
121 Correct 1 ms 1096 KB Output is correct
122 Correct 1 ms 328 KB Output is correct
123 Correct 1 ms 328 KB Output is correct
124 Correct 1 ms 328 KB Output is correct
125 Correct 1 ms 328 KB Output is correct
126 Correct 187 ms 65756 KB Output is correct
127 Correct 246 ms 81600 KB Output is correct
128 Correct 106 ms 41920 KB Output is correct
129 Correct 219 ms 81688 KB Output is correct
130 Correct 18 ms 12488 KB Output is correct
131 Correct 242 ms 81600 KB Output is correct
132 Correct 229 ms 83492 KB Output is correct
133 Correct 211 ms 82864 KB Output is correct
134 Correct 243 ms 82864 KB Output is correct
135 Correct 230 ms 81824 KB Output is correct
136 Correct 224 ms 83500 KB Output is correct
137 Correct 214 ms 81884 KB Output is correct
138 Correct 243 ms 82200 KB Output is correct
139 Correct 1 ms 328 KB Output is correct
140 Correct 1 ms 328 KB Output is correct
141 Correct 1 ms 328 KB Output is correct
142 Correct 1 ms 328 KB Output is correct
143 Correct 1 ms 328 KB Output is correct
144 Correct 1 ms 328 KB Output is correct
145 Correct 1 ms 328 KB Output is correct
146 Correct 1 ms 328 KB Output is correct
147 Correct 1 ms 584 KB Output is correct
148 Correct 2 ms 1096 KB Output is correct
149 Correct 2 ms 1096 KB Output is correct
150 Correct 2 ms 1096 KB Output is correct
151 Correct 2 ms 1096 KB Output is correct
152 Correct 2 ms 1096 KB Output is correct
153 Correct 1 ms 328 KB Output is correct
154 Correct 238 ms 81560 KB Output is correct
155 Correct 224 ms 81676 KB Output is correct
156 Correct 231 ms 82992 KB Output is correct
157 Correct 236 ms 81692 KB Output is correct
158 Correct 234 ms 83616 KB Output is correct
159 Correct 226 ms 81804 KB Output is correct
160 Correct 1 ms 328 KB Output is correct
161 Correct 136 ms 47392 KB Output is correct
162 Correct 235 ms 81724 KB Output is correct
163 Correct 214 ms 83080 KB Output is correct
164 Correct 225 ms 81600 KB Output is correct
165 Correct 222 ms 83480 KB Output is correct
166 Correct 224 ms 81804 KB Output is correct
167 Correct 0 ms 328 KB Output is correct
168 Correct 1 ms 328 KB Output is correct
169 Correct 1 ms 328 KB Output is correct
170 Correct 323 ms 37440 KB Output is correct
171 Correct 1201 ms 81664 KB Output is correct
172 Correct 770 ms 13640 KB Output is correct
173 Correct 1277 ms 81600 KB Output is correct
174 Correct 757 ms 28340 KB Output is correct
175 Correct 1252 ms 81676 KB Output is correct
176 Correct 1721 ms 83352 KB Output is correct
177 Execution timed out 4024 ms 83228 KB Time limit exceeded
178 Halted 0 ms 0 KB -