oj.uz

Submission #413344

# Submission time Handle Problem Language Result Execution time Memory
413344 2021-05-28T14:14:45 Z mat_v Rainforest Jumps (APIO21_jumps) C++14
77 / 100
 4000 ms 51216 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;
    return ans;

    int mks = 0;
    if(r1+1 <= l2-1){
        int idx = r1+1;
        fb(j,18,0){
            if(desno[idx][j] && desno[idx][j] <= l2-1)idx = desno[idx][j];
        }
        mks = niz[idx];
    }

    mks = max(mks, niz[lv]);
    if(mks > val)return -1;

    int poc = l2;
    fb(j,18,0){
        if(desno[poc][j] && desno[poc][j] <= r2 && niz[desno[poc][j]] < mks)poc = desno[poc][j];
    }
    if(niz[poc] < mks)poc = desno[poc][0];





   // int ans = 1e9;

    return dist(lv, poc);
}
/*
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){
      |         ^~
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:110:5: note: in expansion of macro 'fb'
  110 |     fb(j,18,0){
      |     ^~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Execution timed out 4005 ms 40740 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 200 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 3 ms 328 KB Output is correct
6 Correct 6 ms 328 KB Output is correct
7 Correct 3 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 4 ms 328 KB Output is correct
11 Correct 3 ms 328 KB Output is correct
12 Correct 6 ms 328 KB Output is correct
13 Correct 5 ms 328 KB Output is correct
14 Correct 3 ms 268 KB Output is correct
15 Correct 4 ms 328 KB Output is correct
16 Correct 5 ms 328 KB Output is correct
17 Correct 4 ms 328 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 2 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 3 ms 328 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 1 ms 244 KB Output is correct
26 Correct 1 ms 200 KB Output is correct
27 Correct 3 ms 200 KB Output is correct
28 Correct 5 ms 328 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 4 ms 328 KB Output is correct
33 Correct 1 ms 200 KB Output is correct
34 Correct 1 ms 328 KB Output is correct
35 Correct 1 ms 384 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 328 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 3 ms 328 KB Output is correct
6 Correct 6 ms 328 KB Output is correct
7 Correct 3 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 4 ms 328 KB Output is correct
11 Correct 3 ms 328 KB Output is correct
12 Correct 6 ms 328 KB Output is correct
13 Correct 5 ms 328 KB Output is correct
14 Correct 3 ms 268 KB Output is correct
15 Correct 4 ms 328 KB Output is correct
16 Correct 5 ms 328 KB Output is correct
17 Correct 4 ms 328 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 2 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 3 ms 328 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 1 ms 244 KB Output is correct
26 Correct 1 ms 200 KB Output is correct
27 Correct 3 ms 200 KB Output is correct
28 Correct 5 ms 328 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 4 ms 328 KB Output is correct
33 Correct 1 ms 200 KB Output is correct
34 Correct 1 ms 328 KB Output is correct
35 Correct 1 ms 384 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 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 200 KB Output is correct
44 Correct 4 ms 328 KB Output is correct
45 Correct 4 ms 328 KB Output is correct
46 Correct 2 ms 384 KB Output is correct
47 Correct 3 ms 340 KB Output is correct
48 Correct 1 ms 328 KB Output is correct
49 Correct 3 ms 328 KB Output is correct
50 Correct 3 ms 384 KB Output is correct
51 Correct 5 ms 328 KB Output is correct
52 Correct 5 ms 384 KB Output is correct
53 Correct 2 ms 376 KB Output is correct
54 Correct 3 ms 328 KB Output is correct
55 Correct 5 ms 328 KB Output is correct
56 Correct 3 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 25 ms 712 KB Output is correct
60 Correct 10 ms 512 KB Output is correct
61 Correct 39 ms 712 KB Output is correct
62 Correct 10 ms 328 KB Output is correct
63 Correct 34 ms 712 KB Output is correct
64 Correct 86 ms 712 KB Output is correct
65 Correct 90 ms 712 KB Output is correct
66 Correct 73 ms 712 KB Output is correct
67 Correct 37 ms 748 KB Output is correct
68 Correct 53 ms 712 KB Output is correct
69 Correct 32 ms 712 KB Output is correct
70 Correct 63 ms 712 KB Output is correct
71 Correct 1 ms 384 KB Output is correct
72 Correct 1 ms 328 KB Output is correct
73 Correct 3 ms 456 KB Output is correct
74 Correct 5 ms 328 KB Output is correct
75 Correct 4 ms 328 KB Output is correct
76 Correct 3 ms 328 KB Output is correct
77 Correct 5 ms 384 KB Output is correct
78 Correct 1 ms 200 KB Output is correct
79 Correct 1 ms 384 KB Output is correct
80 Correct 3 ms 372 KB Output is correct
81 Correct 4 ms 328 KB Output is correct
82 Correct 3 ms 368 KB Output is correct
83 Correct 4 ms 328 KB Output is correct
84 Correct 5 ms 328 KB Output is correct
85 Correct 5 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 4 ms 328 KB Output is correct
95 Correct 30 ms 816 KB Output is correct
96 Correct 22 ms 712 KB Output is correct
97 Correct 25 ms 712 KB Output is correct
98 Correct 28 ms 712 KB Output is correct
99 Correct 19 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 35 ms 712 KB Output is correct
103 Correct 36 ms 712 KB Output is correct
104 Correct 32 ms 712 KB Output is correct
105 Correct 41 ms 712 KB Output is correct
106 Correct 34 ms 712 KB Output is correct
107 Correct 1 ms 328 KB Output is correct
108 Correct 1 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 3 ms 712 KB Output is correct
112 Correct 2 ms 712 KB Output is correct
113 Correct 2 ms 744 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 328 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 200 KB Output is correct
5 Correct 115 ms 40596 KB Output is correct
6 Correct 146 ms 50320 KB Output is correct
7 Correct 66 ms 25840 KB Output is correct
8 Correct 169 ms 50484 KB Output is correct
9 Correct 20 ms 7864 KB Output is correct
10 Correct 154 ms 50512 KB Output is correct
11 Correct 125 ms 51116 KB Output is correct
12 Correct 107 ms 51048 KB Output is correct
13 Correct 117 ms 50968 KB Output is correct
14 Correct 172 ms 50368 KB Output is correct
15 Correct 117 ms 50692 KB Output is correct
16 Correct 112 ms 51064 KB Output is correct
17 Correct 116 ms 50912 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 328 KB Output is correct
20 Correct 1 ms 384 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 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 200 KB Output is correct
33 Correct 144 ms 50204 KB Output is correct
34 Correct 147 ms 50480 KB Output is correct
35 Correct 137 ms 51096 KB Output is correct
36 Correct 143 ms 50384 KB Output is correct
37 Correct 116 ms 50664 KB Output is correct
38 Correct 98 ms 51188 KB Output is correct
39 Correct 1 ms 200 KB Output is correct
40 Correct 77 ms 29212 KB Output is correct
41 Correct 143 ms 50260 KB Output is correct
42 Correct 111 ms 51000 KB Output is correct
43 Correct 138 ms 50388 KB Output is correct
44 Correct 142 ms 50648 KB Output is correct
45 Correct 100 ms 51116 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 362 ms 23168 KB Output is correct
5 Correct 1314 ms 50352 KB Output is correct
6 Correct 828 ms 8584 KB Output is correct
7 Correct 1380 ms 50380 KB Output is correct
8 Correct 522 ms 17460 KB Output is correct
9 Correct 1239 ms 50368 KB Output is correct
10 Correct 1071 ms 51208 KB Output is correct
11 Correct 1406 ms 51104 KB Output is correct
12 Correct 1381 ms 51000 KB Output is correct
13 Correct 997 ms 50320 KB Output is correct
14 Correct 1100 ms 50700 KB Output is correct
15 Correct 1233 ms 51104 KB Output is correct
16 Correct 1075 ms 51216 KB Output is correct
17 Correct 1 ms 200 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 3 ms 200 KB Output is correct
20 Correct 4 ms 328 KB Output is correct
21 Correct 5 ms 328 KB Output is correct
22 Correct 3 ms 328 KB Output is correct
23 Correct 3 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 25 ms 712 KB Output is correct
28 Correct 26 ms 712 KB Output is correct
29 Correct 29 ms 712 KB Output is correct
30 Correct 27 ms 712 KB Output is correct
31 Correct 30 ms 712 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 80 ms 29404 KB Output is correct
34 Correct 144 ms 50316 KB Output is correct
35 Correct 111 ms 51008 KB Output is correct
36 Correct 130 ms 50328 KB Output is correct
37 Correct 125 ms 50700 KB Output is correct
38 Correct 102 ms 51184 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 362 ms 23168 KB Output is correct
5 Correct 1314 ms 50352 KB Output is correct
6 Correct 828 ms 8584 KB Output is correct
7 Correct 1380 ms 50380 KB Output is correct
8 Correct 522 ms 17460 KB Output is correct
9 Correct 1239 ms 50368 KB Output is correct
10 Correct 1071 ms 51208 KB Output is correct
11 Correct 1406 ms 51104 KB Output is correct
12 Correct 1381 ms 51000 KB Output is correct
13 Correct 997 ms 50320 KB Output is correct
14 Correct 1100 ms 50700 KB Output is correct
15 Correct 1233 ms 51104 KB Output is correct
16 Correct 1075 ms 51216 KB Output is correct
17 Correct 1 ms 200 KB Output is correct
18 Correct 1 ms 200 KB Output is correct
19 Correct 3 ms 200 KB Output is correct
20 Correct 4 ms 328 KB Output is correct
21 Correct 5 ms 328 KB Output is correct
22 Correct 3 ms 328 KB Output is correct
23 Correct 3 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 25 ms 712 KB Output is correct
28 Correct 26 ms 712 KB Output is correct
29 Correct 29 ms 712 KB Output is correct
30 Correct 27 ms 712 KB Output is correct
31 Correct 30 ms 712 KB Output is correct
32 Correct 1 ms 200 KB Output is correct
33 Correct 80 ms 29404 KB Output is correct
34 Correct 144 ms 50316 KB Output is correct
35 Correct 111 ms 51008 KB Output is correct
36 Correct 130 ms 50328 KB Output is correct
37 Correct 125 ms 50700 KB Output is correct
38 Correct 102 ms 51184 KB Output is correct
39 Correct 1 ms 200 KB Output is correct
40 Correct 1 ms 328 KB Output is correct
41 Correct 1 ms 200 KB Output is correct
42 Correct 310 ms 23184 KB Output is correct
43 Correct 1192 ms 50368 KB Output is correct
44 Correct 537 ms 8520 KB Output is correct
45 Correct 1446 ms 50336 KB Output is correct
46 Correct 799 ms 17556 KB Output is correct
47 Correct 1048 ms 50368 KB Output is correct
48 Correct 1272 ms 51080 KB Output is correct
49 Correct 956 ms 51096 KB Output is correct
50 Correct 1271 ms 51092 KB Output is correct
51 Correct 1423 ms 50336 KB Output is correct
52 Correct 1252 ms 50700 KB Output is correct
53 Correct 1271 ms 51152 KB Output is correct
54 Correct 1090 ms 51100 KB Output is correct
55 Correct 1 ms 200 KB Output is correct
56 Correct 221 ms 50120 KB Output is correct
57 Correct 1182 ms 50360 KB Output is correct
58 Correct 571 ms 9160 KB Output is correct
59 Correct 1067 ms 50348 KB Output is correct
60 Correct 432 ms 17984 KB Output is correct
61 Correct 1117 ms 50496 KB Output is correct
62 Correct 1378 ms 51136 KB Output is correct
63 Correct 1357 ms 50880 KB Output is correct
64 Correct 1379 ms 50880 KB Output is correct
65 Correct 1331 ms 50352 KB Output is correct
66 Correct 1275 ms 50700 KB Output is correct
67 Correct 1167 ms 51136 KB Output is correct
68 Correct 1191 ms 51116 KB Output is correct
69 Correct 1 ms 200 KB Output is correct
70 Correct 1 ms 328 KB Output is correct
71 Correct 4 ms 328 KB Output is correct
72 Correct 2 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 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 3 ms 328 KB Output is correct
79 Correct 4 ms 328 KB Output is correct
80 Correct 4 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 1 ms 328 KB Output is correct
85 Correct 6 ms 328 KB Output is correct
86 Correct 27 ms 712 KB Output is correct
87 Correct 27 ms 712 KB Output is correct
88 Correct 28 ms 712 KB Output is correct
89 Correct 27 ms 712 KB Output is correct
90 Correct 11 ms 840 KB Output is correct
91 Correct 1 ms 328 KB Output is correct
92 Correct 2 ms 456 KB Output is correct
93 Correct 20 ms 712 KB Output is correct
94 Correct 19 ms 712 KB Output is correct
95 Correct 28 ms 712 KB Output is correct
96 Correct 28 ms 712 KB Output is correct
97 Correct 28 ms 712 KB Output is correct
98 Correct 1 ms 200 KB Output is correct
99 Correct 145 ms 50224 KB Output is correct
100 Correct 148 ms 50352 KB Output is correct
101 Correct 98 ms 50956 KB Output is correct
102 Correct 127 ms 50348 KB Output is correct
103 Correct 132 ms 50664 KB Output is correct
104 Correct 101 ms 51164 KB Output is correct
105 Correct 1 ms 200 KB Output is correct
106 Correct 87 ms 29216 KB Output is correct
107 Correct 146 ms 50352 KB Output is correct
108 Correct 98 ms 51000 KB Output is correct
109 Correct 133 ms 50448 KB Output is correct
110 Correct 116 ms 50696 KB Output is correct
111 Correct 114 ms 51160 KB Output is correct

Subtask #7
0 / 19.0

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