oj.uz

Submission #413349

# Submission time Handle Problem Language Result Execution time Memory
413349 2021-05-28T14:30:30 Z mat_v Rainforest Jumps (APIO21_jumps) C++14
77 / 100
 4000 ms 51312 KB 
#include "jumps.h"
#include <bits/stdc++.h>
#define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
#define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))

using namespace std;

int n;
int niz[200005];
int levo[200005][20];
int desno[200005][20];
int pravi[200005][20];
int poz[200005];

void init(int N, std::vector<int> H) {
    n = N;
    ff(i,0,n - 1){
        niz[i + 1] = H[i];
        poz[niz[i + 1]] = i+1;
    }
    stack<int> s;
    ff(i,1,n){
        while(!s.empty() && niz[s.top()] < niz[i])s.pop();
        if(!s.empty())levo[i][0] = s.top();
        s.push(i);
    }
    while(!s.empty())s.pop();
    fb(i,n,1){
        while(!s.empty() && niz[s.top()] < niz[i])s.pop();
        if(!s.empty())desno[i][0] = s.top();
        s.push(i);
    }
    fb(i,n,1){
        ff(j,1,18)desno[i][j] = desno[desno[i][j - 1]][j - 1];
    }
    ff(i,1,n){
        ff(j,1,18)levo[i][j] = levo[levo[i][j - 1]][j - 1];
    }
    fb(i,n - 1,1){
        int sta = poz[i];
        int lv = levo[sta][0], rv = desno[sta][0];
        if(niz[lv] > niz[rv])pravi[sta][0] = lv;
        else pravi[sta][0] = rv;
        ff(j,1,18)pravi[sta][j] = pravi[pravi[sta][j - 1]][j - 1];
    }

}

int dist(int x, int y){
    if(niz[y] < niz[x])return -1;
    int ans = 0;
    int lv = x;
    int poc = y;
    fb(j,18,0){
        if(pravi[lv][j] && niz[pravi[lv][j]] < niz[poc]){
            ans += (1<<j);
            lv = pravi[lv][j];
        }
    }
    fb(j,18,0){
        if(desno[lv][j] && niz[desno[lv][j]] < niz[poc]){
            ans += (1<<j);
            lv = desno[lv][j];
        }
    }
    if(desno[lv][0] == poc)return ans+1;
    return -1;
}

int minimum_jumps(int A, int B, int C, int D) {
    A++;
    B++;
    C++;
    D++;
    int l1,r1,l2,r2;
    l1 = A, r1 = B, l2 = C, r2 = D;
    int tr = l2;
    fb(j,18,0){
        if(desno[tr][j] && desno[tr][j] <= r2)tr = desno[tr][j];
    }
    int val = niz[tr];

    int lv = r1;
    fb(j,18,0){
        if(levo[lv][j] && levo[lv][j] >= l1 && niz[levo[lv][j]] < val)lv = levo[lv][j];
    }
    if(niz[lv] > val)return -1;

    int ans = 1e9;

    ff(j,l2,r2){
        if(dist(lv,j) > 0)ans = min(ans, dist(lv,j));
    }
    if(ans == 1e9)return -1;

    int mks = 0;
    int idx = 0;
    if(r1+1 <= l2-1){
        idx = r1+1;
        fb(j,18,0){
            if(desno[idx][j] && desno[idx][j] <= l2-1)idx = desno[idx][j];
        }
        mks = niz[idx];
    }
    if(mks > val)return -1;
    if(niz[idx] > niz[lv])return ans;
    else return 1;
}
/*
7 3
3 2 1 6 4 5 7
4 4 6 6
1 3 5 6
0 1 2 2

*/

Compilation message

jumps.cpp: In function 'void init(int, std::vector<int>)':
jumps.cpp:3:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    3 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
jumps.cpp:17:5: note: in expansion of macro 'ff'
   17 |     ff(i,0,n - 1){
      |     ^~
jumps.cpp:3:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    3 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
jumps.cpp:22:5: note: in expansion of macro 'ff'
   22 |     ff(i,1,n){
      |     ^~
jumps.cpp:4:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    4 | #define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
      |                           ^
jumps.cpp:28:5: note: in expansion of macro 'fb'
   28 |     fb(i,n,1){
      |     ^~
jumps.cpp:4:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    4 | #define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
      |                           ^
jumps.cpp:33:5: note: in expansion of macro 'fb'
   33 |     fb(i,n,1){
      |     ^~
jumps.cpp:3:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    3 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
jumps.cpp:34:9: note: in expansion of macro 'ff'
   34 |         ff(j,1,18)desno[i][j] = desno[desno[i][j - 1]][j - 1];
      |         ^~
jumps.cpp:3:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    3 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
jumps.cpp:36:5: note: in expansion of macro 'ff'
   36 |     ff(i,1,n){
      |     ^~
jumps.cpp:3:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    3 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
jumps.cpp:37:9: note: in expansion of macro 'ff'
   37 |         ff(j,1,18)levo[i][j] = levo[levo[i][j - 1]][j - 1];
      |         ^~
jumps.cpp:4:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    4 | #define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
      |                           ^
jumps.cpp:39:5: note: in expansion of macro 'fb'
   39 |     fb(i,n - 1,1){
      |     ^~
jumps.cpp:3:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    3 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
jumps.cpp:44:9: note: in expansion of macro 'ff'
   44 |         ff(j,1,18)pravi[sta][j] = pravi[pravi[sta][j - 1]][j - 1];
      |         ^~
jumps.cpp: In function 'int dist(int, int)':
jumps.cpp:4:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    4 | #define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
      |                           ^
jumps.cpp:54:5: note: in expansion of macro 'fb'
   54 |     fb(j,18,0){
      |     ^~
jumps.cpp:4:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    4 | #define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
      |                           ^
jumps.cpp:60:5: note: in expansion of macro 'fb'
   60 |     fb(j,18,0){
      |     ^~
jumps.cpp: In function 'int minimum_jumps(int, int, int, int)':
jumps.cpp:4:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    4 | #define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
      |                           ^
jumps.cpp:78:5: note: in expansion of macro 'fb'
   78 |     fb(j,18,0){
      |     ^~
jumps.cpp:4:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    4 | #define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
      |                           ^
jumps.cpp:84:5: note: in expansion of macro 'fb'
   84 |     fb(j,18,0){
      |     ^~
jumps.cpp:3:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    3 | #define ff(i,a,b) for(int (i) = (a); (i) <= (b); ++(i))
      |                           ^
jumps.cpp:91:5: note: in expansion of macro 'ff'
   91 |     ff(j,l2,r2){
      |     ^~
jumps.cpp:4:27: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
    4 | #define fb(i,a,b) for(int (i) = (a); (i) >= (b); --(i))
      |                           ^
jumps.cpp:100:9: note: in expansion of macro 'fb'
  100 |         fb(j,18,0){
      |         ^~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Execution timed out 4078 ms 40852 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 4 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 2 ms 328 KB Output is correct
11 Correct 4 ms 328 KB Output is correct
12 Correct 5 ms 328 KB Output is correct
13 Correct 3 ms 328 KB Output is correct
14 Correct 4 ms 328 KB Output is correct
15 Correct 4 ms 328 KB Output is correct
16 Correct 4 ms 328 KB Output is correct
17 Correct 3 ms 328 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 4 ms 328 KB Output is correct
21 Correct 3 ms 328 KB Output is correct
22 Correct 4 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 200 KB Output is correct
26 Correct 1 ms 200 KB Output is correct
27 Correct 4 ms 200 KB Output is correct
28 Correct 3 ms 328 KB Output is correct
29 Correct 3 ms 328 KB Output is correct
30 Correct 4 ms 328 KB Output is correct
31 Correct 4 ms 328 KB Output is correct
32 Correct 3 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 2 ms 328 KB Output is correct
39 Correct 2 ms 328 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 4 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 2 ms 328 KB Output is correct
11 Correct 4 ms 328 KB Output is correct
12 Correct 5 ms 328 KB Output is correct
13 Correct 3 ms 328 KB Output is correct
14 Correct 4 ms 328 KB Output is correct
15 Correct 4 ms 328 KB Output is correct
16 Correct 4 ms 328 KB Output is correct
17 Correct 3 ms 328 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 4 ms 328 KB Output is correct
21 Correct 3 ms 328 KB Output is correct
22 Correct 4 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 200 KB Output is correct
26 Correct 1 ms 200 KB Output is correct
27 Correct 4 ms 200 KB Output is correct
28 Correct 3 ms 328 KB Output is correct
29 Correct 3 ms 328 KB Output is correct
30 Correct 4 ms 328 KB Output is correct
31 Correct 4 ms 328 KB Output is correct
32 Correct 3 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 2 ms 328 KB Output is correct
39 Correct 2 ms 328 KB Output is correct
40 Correct 1 ms 200 KB Output is correct
41 Correct 1 ms 200 KB Output is correct
42 Correct 1 ms 200 KB Output is correct
43 Correct 1 ms 328 KB Output is correct
44 Correct 2 ms 328 KB Output is correct
45 Correct 7 ms 328 KB Output is correct
46 Correct 2 ms 328 KB Output is correct
47 Correct 5 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 2 ms 328 KB Output is correct
51 Correct 5 ms 328 KB Output is correct
52 Correct 4 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 5 ms 328 KB Output is correct
56 Correct 6 ms 328 KB Output is correct
57 Correct 1 ms 328 KB Output is correct
58 Correct 28 ms 712 KB Output is correct
59 Correct 22 ms 712 KB Output is correct
60 Correct 6 ms 456 KB Output is correct
61 Correct 24 ms 712 KB Output is correct
62 Correct 15 ms 328 KB Output is correct
63 Correct 20 ms 712 KB Output is correct
64 Correct 78 ms 712 KB Output is correct
65 Correct 80 ms 712 KB Output is correct
66 Correct 56 ms 712 KB Output is correct
67 Correct 30 ms 712 KB Output is correct
68 Correct 45 ms 712 KB Output is correct
69 Correct 29 ms 712 KB Output is correct
70 Correct 47 ms 712 KB Output is correct
71 Correct 1 ms 200 KB Output is correct
72 Correct 1 ms 328 KB Output is correct
73 Correct 2 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 4 ms 328 KB Output is correct
78 Correct 1 ms 200 KB Output is correct
79 Correct 1 ms 200 KB Output is correct
80 Correct 2 ms 200 KB Output is correct
81 Correct 3 ms 328 KB Output is correct
82 Correct 5 ms 328 KB Output is correct
83 Correct 7 ms 328 KB Output is correct
84 Correct 3 ms 328 KB Output is correct
85 Correct 4 ms 328 KB Output is correct
86 Correct 1 ms 200 KB Output is correct
87 Correct 1 ms 328 KB Output is correct
88 Correct 2 ms 384 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 29 ms 840 KB Output is correct
96 Correct 31 ms 712 KB Output is correct
97 Correct 24 ms 712 KB Output is correct
98 Correct 31 ms 712 KB Output is correct
99 Correct 24 ms 712 KB Output is correct
100 Correct 1 ms 328 KB Output is correct
101 Correct 2 ms 456 KB Output is correct
102 Correct 24 ms 712 KB Output is correct
103 Correct 18 ms 712 KB Output is correct
104 Correct 27 ms 712 KB Output is correct
105 Correct 29 ms 712 KB Output is correct
106 Correct 12 ms 712 KB Output is correct
107 Correct 1 ms 328 KB Output is correct
108 Correct 2 ms 456 KB Output is correct
109 Correct 2 ms 712 KB Output is correct
110 Correct 2 ms 712 KB Output is correct
111 Correct 2 ms 712 KB Output is correct
112 Correct 2 ms 712 KB Output is correct
113 Correct 2 ms 712 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 114 ms 40612 KB Output is correct
6 Correct 173 ms 50348 KB Output is correct
7 Correct 75 ms 25920 KB Output is correct
8 Correct 170 ms 50380 KB Output is correct
9 Correct 20 ms 7752 KB Output is correct
10 Correct 162 ms 50376 KB Output is correct
11 Correct 112 ms 51176 KB Output is correct
12 Correct 123 ms 50952 KB Output is correct
13 Correct 119 ms 50960 KB Output is correct
14 Correct 131 ms 50336 KB Output is correct
15 Correct 136 ms 50716 KB Output is correct
16 Correct 118 ms 50968 KB Output is correct
17 Correct 121 ms 51004 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 2 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 456 KB Output is correct
27 Correct 2 ms 712 KB Output is correct
28 Correct 2 ms 712 KB Output is correct
29 Correct 2 ms 712 KB Output is correct
30 Correct 2 ms 712 KB Output is correct
31 Correct 2 ms 712 KB Output is correct
32 Correct 1 ms 328 KB Output is correct
33 Correct 169 ms 50224 KB Output is correct
34 Correct 143 ms 50332 KB Output is correct
35 Correct 101 ms 51008 KB Output is correct
36 Correct 149 ms 50368 KB Output is correct
37 Correct 135 ms 50676 KB Output is correct
38 Correct 101 ms 51264 KB Output is correct
39 Correct 1 ms 200 KB Output is correct
40 Correct 81 ms 29292 KB Output is correct
41 Correct 170 ms 50388 KB Output is correct
42 Correct 109 ms 50968 KB Output is correct
43 Correct 134 ms 50328 KB Output is correct
44 Correct 119 ms 50776 KB Output is correct
45 Correct 113 ms 51120 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 275 ms 23104 KB Output is correct
5 Correct 791 ms 50352 KB Output is correct
6 Correct 739 ms 8500 KB Output is correct
7 Correct 1182 ms 50316 KB Output is correct
8 Correct 842 ms 17564 KB Output is correct
9 Correct 1354 ms 50332 KB Output is correct
10 Correct 1410 ms 51136 KB Output is correct
11 Correct 1501 ms 51148 KB Output is correct
12 Correct 1300 ms 51088 KB Output is correct
13 Correct 1284 ms 50332 KB Output is correct
14 Correct 1490 ms 50664 KB Output is correct
15 Correct 1272 ms 51312 KB Output is correct
16 Correct 771 ms 51136 KB Output is correct
17 Correct 1 ms 200 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 2 ms 200 KB Output is correct
20 Correct 4 ms 328 KB Output is correct
21 Correct 4 ms 328 KB Output is correct
22 Correct 4 ms 328 KB Output is correct
23 Correct 2 ms 328 KB Output is correct
24 Correct 4 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 2 ms 456 KB Output is correct
27 Correct 28 ms 712 KB Output is correct
28 Correct 30 ms 712 KB Output is correct
29 Correct 27 ms 712 KB Output is correct
30 Correct 24 ms 712 KB Output is correct
31 Correct 25 ms 712 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 82 ms 29284 KB Output is correct
34 Correct 147 ms 50324 KB Output is correct
35 Correct 101 ms 50968 KB Output is correct
36 Correct 140 ms 50380 KB Output is correct
37 Correct 124 ms 50712 KB Output is correct
38 Correct 100 ms 51136 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 275 ms 23104 KB Output is correct
5 Correct 791 ms 50352 KB Output is correct
6 Correct 739 ms 8500 KB Output is correct
7 Correct 1182 ms 50316 KB Output is correct
8 Correct 842 ms 17564 KB Output is correct
9 Correct 1354 ms 50332 KB Output is correct
10 Correct 1410 ms 51136 KB Output is correct
11 Correct 1501 ms 51148 KB Output is correct
12 Correct 1300 ms 51088 KB Output is correct
13 Correct 1284 ms 50332 KB Output is correct
14 Correct 1490 ms 50664 KB Output is correct
15 Correct 1272 ms 51312 KB Output is correct
16 Correct 771 ms 51136 KB Output is correct
17 Correct 1 ms 200 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 2 ms 200 KB Output is correct
20 Correct 4 ms 328 KB Output is correct
21 Correct 4 ms 328 KB Output is correct
22 Correct 4 ms 328 KB Output is correct
23 Correct 2 ms 328 KB Output is correct
24 Correct 4 ms 328 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 2 ms 456 KB Output is correct
27 Correct 28 ms 712 KB Output is correct
28 Correct 30 ms 712 KB Output is correct
29 Correct 27 ms 712 KB Output is correct
30 Correct 24 ms 712 KB Output is correct
31 Correct 25 ms 712 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 82 ms 29284 KB Output is correct
34 Correct 147 ms 50324 KB Output is correct
35 Correct 101 ms 50968 KB Output is correct
36 Correct 140 ms 50380 KB Output is correct
37 Correct 124 ms 50712 KB Output is correct
38 Correct 100 ms 51136 KB Output is correct
39 Correct 1 ms 200 KB Output is correct
40 Correct 1 ms 200 KB Output is correct
41 Correct 1 ms 200 KB Output is correct
42 Correct 338 ms 23104 KB Output is correct
43 Correct 1397 ms 50364 KB Output is correct
44 Correct 790 ms 8520 KB Output is correct
45 Correct 1361 ms 50384 KB Output is correct
46 Correct 829 ms 17536 KB Output is correct
47 Correct 1236 ms 50384 KB Output is correct
48 Correct 1442 ms 51188 KB Output is correct
49 Correct 1296 ms 51092 KB Output is correct
50 Correct 1335 ms 51048 KB Output is correct
51 Correct 1220 ms 50456 KB Output is correct
52 Correct 1211 ms 50712 KB Output is correct
53 Correct 1299 ms 51208 KB Output is correct
54 Correct 1064 ms 51132 KB Output is correct
55 Correct 1 ms 200 KB Output is correct
56 Correct 251 ms 50072 KB Output is correct
57 Correct 1239 ms 50344 KB Output is correct
58 Correct 577 ms 9128 KB Output is correct
59 Correct 1195 ms 50316 KB Output is correct
60 Correct 620 ms 18064 KB Output is correct
61 Correct 1037 ms 50380 KB Output is correct
62 Correct 1205 ms 51208 KB Output is correct
63 Correct 1397 ms 50948 KB Output is correct
64 Correct 1204 ms 50864 KB Output is correct
65 Correct 1155 ms 50304 KB Output is correct
66 Correct 1599 ms 50700 KB Output is correct
67 Correct 1104 ms 51176 KB Output is correct
68 Correct 1056 ms 51152 KB Output is correct
69 Correct 1 ms 200 KB Output is correct
70 Correct 1 ms 328 KB Output is correct
71 Correct 5 ms 328 KB Output is correct
72 Correct 3 ms 328 KB Output is correct
73 Correct 3 ms 328 KB Output is correct
74 Correct 3 ms 328 KB Output is correct
75 Correct 4 ms 328 KB Output is correct
76 Correct 1 ms 200 KB Output is correct
77 Correct 1 ms 200 KB Output is correct
78 Correct 2 ms 200 KB Output is correct
79 Correct 4 ms 328 KB Output is correct
80 Correct 4 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 2 ms 328 KB Output is correct
84 Correct 1 ms 328 KB Output is correct
85 Correct 3 ms 328 KB Output is correct
86 Correct 31 ms 712 KB Output is correct
87 Correct 27 ms 712 KB Output is correct
88 Correct 39 ms 712 KB Output is correct
89 Correct 32 ms 712 KB Output is correct
90 Correct 18 ms 816 KB Output is correct
91 Correct 1 ms 328 KB Output is correct
92 Correct 2 ms 456 KB Output is correct
93 Correct 38 ms 712 KB Output is correct
94 Correct 38 ms 712 KB Output is correct
95 Correct 20 ms 712 KB Output is correct
96 Correct 28 ms 712 KB Output is correct
97 Correct 19 ms 712 KB Output is correct
98 Correct 1 ms 200 KB Output is correct
99 Correct 162 ms 50304 KB Output is correct
100 Correct 167 ms 50328 KB Output is correct
101 Correct 98 ms 50972 KB Output is correct
102 Correct 163 ms 50328 KB Output is correct
103 Correct 130 ms 50664 KB Output is correct
104 Correct 100 ms 51136 KB Output is correct
105 Correct 1 ms 200 KB Output is correct
106 Correct 77 ms 29296 KB Output is correct
107 Correct 149 ms 50336 KB Output is correct
108 Correct 104 ms 51028 KB Output is correct
109 Correct 133 ms 50352 KB Output is correct
110 Correct 135 ms 50712 KB Output is correct
111 Correct 103 ms 51272 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Execution timed out 4078 ms 40852 KB Time limit exceeded
4 Halted 0 ms 0 KB -