oj.uz

Submission #975149

# Submission time Handle Problem Language Result Execution time Memory
975149 2024-05-04T13:43:47 Z yoav_s Rainforest Jumps (APIO21_jumps) C++17
77 / 100
 4000 ms 61488 KB 
#include <bits/stdc++.h>

using namespace std;

typedef int ll;
typedef vector<ll> v;
typedef vector<v> vv;
typedef vector<vv> vvv;
typedef pair<ll, ll> p;
typedef vector<p> vp;
typedef vector<vp> vvp;
typedef vector<vvp> vvvp;
typedef pair<ll, p> tri;
typedef vector<tri> vtri;
typedef vector<vtri> vvtri;
typedef vector<vvtri> vvvtri;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;

#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()

const ll INF = 1e18;
const ll mod = 1e9 + 7;

#include "jumps.h"

v H;
ll N;
v nextHigher;
v prevHigher;
v st;
ll n;
vv largestLifting;
v rightHeight;
ll logN;
v nextLargest;
vv nextLifting;

ll query(ll l, ll r, v &st, bool maxi = true)
{
    ll n = st.size() / 2;
    l += n;
    r += n;
    ll res = maxi? -INF : INF;
    while (l <= r)
    {
        if (l % 2 == 1)
        {
            if (maxi)
                res = max(res, st[l]);
            else
                res = min(res, st[l]);
            l++;
        }
        if (r % 2 == 0)
        {
            if (maxi)
                res = max(res,st[r]);
            else
                res = min(res, st[l]);
            r--;
        }
        l /= 2;
        r /= 2;
    }
    return res;
}

ll largestSmaller(ll l, ll r, ll threshold, v &st)
{
    ll n = st.size() / 2;
    l += n;
    r += n;
    v segs, segsRev;
    while (l <= r)
    {
        if (l % 2 == 1)
        {
            segs.pb(l); l++;
        }
        if (r % 2 == 0)
        {
            segsRev.pb(r); r--;
        }
        l /= 2; r /= 2;
    }
    reverse(all(segs));
    for (ll x : segs) segsRev.pb(x);
    v relevantSegs;
    ll lastSeg = -1;
    for (ll x : segsRev)
    {
        if (st[x] >= threshold)
        {
            lastSeg = x;
            break;
        }
        relevantSegs.pb(x);
    }
    ll lastSegMaxi = -INF;
    if (lastSeg != -1)
    {
        ll cur = lastSeg;
        while (cur < n)
        {
            if (st[2 * cur + 1] < threshold)
            {
                lastSegMaxi = max(lastSegMaxi, st[2 * cur + 1]);
                cur *= 2;
            }
            else cur = 2 * cur + 1;
        }
    }
    ll best = -INF;
    for (ll x : relevantSegs) best = max(best, st[x]);
    if (best > lastSegMaxi)
    {
        for (ll x : relevantSegs)
        {
            if (st[x] == best)
            {
                ll cur = x;
                while (cur < n)
                {
                    if (st[2 * cur] == best) cur *= 2;
                    else cur = 2 * cur + 1;
                }
                return cur - n;
            }
        }
    }
    if (lastSegMaxi == -INF) return -1;
    ll cur = lastSeg;
    while (cur < n)
    {
        if (st[2 * cur + 1] >= lastSegMaxi) cur = 2 * cur + 1;
        else cur *= 2;
    }
    return cur - n;
}

void init(int Nn, std::vector<int> Hh) {
    vp hSorted;
    for (ll i =0 ; i < Nn; i++) hSorted.eb(Hh[i], i);
    sort(all(hSorted));
    H = v(Nn, -1);
    for (ll i = 0; i < hSorted.size(); i++) H[hSorted[i].s] = i;
    N = Nn;
    nextHigher = v(N, N);
    stack<p> mon;
    for (ll i = N - 1; i >= 0; i--)
    {
        while (!mon.empty() && mon.top().s <= H[i]) mon.pop();
        if (!mon.empty()) nextHigher[i] = mon.top().f;
        mon.emplace(i, H[i]);
    }
    mon = stack<p>();
    prevHigher = v(N, -1);
    for (ll i = 0; i < N; i++)
    {
        while (!mon.empty() && mon.top().s <= H[i]) mon.pop();
        if (!mon.empty()) prevHigher[i] = mon.top().f;
        mon.emplace(i, H[i]);
    }
    n = pow(2, ceil(log2(N)));
    st = v(2 * n, -INF);
    for (ll i = 0; i < N; i++) st[n + i] = H[i];
    for (ll i = n - 1;  i> 0; i--) st[i] = max(st[2 * i], st[2 * i + 1]);
    nextLargest = v(N, -1);
    for (ll i = 0; i < N; i++)
    {
        if (nextHigher[i] != N) nextLargest[i] = nextHigher[i];
        if (prevHigher[i] != -1 && (nextLargest[i] == -1 || H[nextLargest[i]] < H[prevHigher[i]])) nextLargest[i] = prevHigher[i];
    }
    logN = log2(N);
    largestLifting = vv(N, v(logN + 1, -1));
    for (ll i = 0; i < N; i++) largestLifting[i][0] = nextLargest[i];
    for (ll iter = 1; iter <= logN; iter++)
    {
        for (ll i= 0; i < N; i++)
        {
            if (largestLifting[i][iter - 1] == -1) largestLifting[i][iter] = -1;
            else largestLifting[i][iter] = largestLifting[largestLifting[i][iter - 1]][iter - 1];
        }
    }
    vv nextHigherRev(N + 1);
    for (ll i =0; i <N; i++) nextHigherRev[nextHigher[i]].pb(i);
    rightHeight = v(N + 1, 0);
    stack<p> dfs;
    dfs.emplace(N, 0);
    while (!dfs.empty())
    {
        auto top = dfs.top();
        dfs.pop();
        rightHeight[top.f] = top.s;
        for (ll x : nextHigherRev[top.f]) dfs.emplace(x, top.s + 1);
    }
    nextLifting = vv(N + 1, v(logN + 1, N));
    for (ll i = 0; i < N; i++) nextLifting[i][0] = nextHigher[i];
    for (ll i = 1; i <= logN; i++)
    {
        for (ll j = 0; j < N; j++)
        {
            nextLifting[j][i] = nextLifting[nextLifting[j][i - 1]][i - 1];
        }
    }
}

int minimum_jumps(int A, int B, int C, int D) {
    ll mini = INF;
    for (ll j = C; j <= D; j++)
    {
        ll i = largestSmaller(A, B, H[j], st);
        if (i == -1 || query(i, j - 1, st, true) > H[j]) continue;
        ll steps = 0;
        ll cur = i;
        for (ll k = logN; k >= 0; k--)
        {
            if (largestLifting[cur][k] != -1 && H[largestLifting[cur][k]] <= H[j])
            {
                cur = largestLifting[cur][k];
                steps += (1 << k);
            }
        }
        steps += abs(rightHeight[cur] - rightHeight[j]);
        mini = min(mini, steps);
    }
    if (mini == INF) mini = -1;
    return mini;
}
/*
int main() {
  int N, Q;
  assert(2 == scanf("%d %d", &N, &Q));
  std::vector<int> H(N);
  for (int i = 0; i < N; ++i) {
    assert(1 == scanf("%d", &H[i]));
  }
  init(N, H);

  for (int i = 0; i < Q; ++i) {
    int A, B, C, D;
    assert(4 == scanf("%d %d %d %d", &A, &B, &C, &D));
    printf("%d\n", minimum_jumps(A, B, C, D));
  }
  return 0;
}
/**/

Compilation message

jumps.cpp:253:1: warning: "/*" within comment [-Wcomment]
  253 | /**/
      |  
jumps.cpp:27:16: warning: overflow in conversion from 'double' to 'll' {aka 'int'} changes value from '1.0e+18' to '2147483647' [-Woverflow]
   27 | const ll INF = 1e18;
      |                ^~~~
jumps.cpp: In function 'void init(int, std::vector<int>)':
jumps.cpp:152:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'int'} and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  152 |     for (ll i = 0; i < hSorted.size(); i++) H[hSorted[i].s] = i;
      |                    ~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Execution timed out 4038 ms 49532 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 412 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 3 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 1 ms 540 KB Output is correct
39 Correct 0 ms 344 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 412 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 3 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 3 ms 340 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Correct 2 ms 344 KB Output is correct
16 Correct 2 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 1 ms 540 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 0 ms 344 KB Output is correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 2 ms 344 KB Output is correct
46 Correct 2 ms 344 KB Output is correct
47 Correct 2 ms 344 KB Output is correct
48 Correct 1 ms 344 KB Output is correct
49 Correct 2 ms 344 KB Output is correct
50 Correct 3 ms 344 KB Output is correct
51 Correct 3 ms 344 KB Output is correct
52 Correct 3 ms 344 KB Output is correct
53 Correct 2 ms 344 KB Output is correct
54 Correct 2 ms 344 KB Output is correct
55 Correct 2 ms 344 KB Output is correct
56 Correct 2 ms 344 KB Output is correct
57 Correct 0 ms 344 KB Output is correct
58 Correct 89 ms 856 KB Output is correct
59 Correct 133 ms 920 KB Output is correct
60 Correct 14 ms 600 KB Output is correct
61 Correct 134 ms 920 KB Output is correct
62 Correct 13 ms 344 KB Output is correct
63 Correct 135 ms 924 KB Output is correct
64 Correct 215 ms 952 KB Output is correct
65 Correct 229 ms 960 KB Output is correct
66 Correct 199 ms 964 KB Output is correct
67 Correct 146 ms 932 KB Output is correct
68 Correct 167 ms 1104 KB Output is correct
69 Correct 61 ms 908 KB Output is correct
70 Correct 230 ms 944 KB Output is correct
71 Correct 1 ms 344 KB Output is correct
72 Correct 1 ms 344 KB Output is correct
73 Correct 1 ms 344 KB Output is correct
74 Correct 1 ms 344 KB Output is correct
75 Correct 2 ms 344 KB Output is correct
76 Correct 1 ms 344 KB Output is correct
77 Correct 2 ms 344 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 1 ms 344 KB Output is correct
80 Correct 1 ms 344 KB Output is correct
81 Correct 1 ms 344 KB Output is correct
82 Correct 1 ms 344 KB Output is correct
83 Correct 1 ms 344 KB Output is correct
84 Correct 1 ms 344 KB Output is correct
85 Correct 1 ms 344 KB Output is correct
86 Correct 1 ms 344 KB Output is correct
87 Correct 0 ms 344 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 1 ms 344 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct
92 Correct 0 ms 344 KB Output is correct
93 Correct 0 ms 344 KB Output is correct
94 Correct 2 ms 344 KB Output is correct
95 Correct 10 ms 1112 KB Output is correct
96 Correct 10 ms 976 KB Output is correct
97 Correct 10 ms 952 KB Output is correct
98 Correct 12 ms 1112 KB Output is correct
99 Correct 10 ms 856 KB Output is correct
100 Correct 1 ms 344 KB Output is correct
101 Correct 1 ms 344 KB Output is correct
102 Correct 10 ms 936 KB Output is correct
103 Correct 16 ms 952 KB Output is correct
104 Correct 10 ms 1112 KB Output is correct
105 Correct 10 ms 1112 KB Output is correct
106 Correct 10 ms 1112 KB Output is correct
107 Correct 0 ms 344 KB Output is correct
108 Correct 1 ms 600 KB Output is correct
109 Correct 2 ms 940 KB Output is correct
110 Correct 2 ms 856 KB Output is correct
111 Correct 1 ms 856 KB Output is correct
112 Correct 2 ms 856 KB Output is correct
113 Correct 2 ms 856 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 104 ms 47248 KB Output is correct
6 Correct 169 ms 58152 KB Output is correct
7 Correct 60 ms 29872 KB Output is correct
8 Correct 153 ms 57936 KB Output is correct
9 Correct 16 ms 8916 KB Output is correct
10 Correct 174 ms 58144 KB Output is correct
11 Correct 181 ms 61488 KB Output is correct
12 Correct 229 ms 61088 KB Output is correct
13 Correct 136 ms 60968 KB Output is correct
14 Correct 178 ms 58648 KB Output is correct
15 Correct 169 ms 57956 KB Output is correct
16 Correct 124 ms 56340 KB Output is correct
17 Correct 136 ms 56248 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 596 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 2 ms 856 KB Output is correct
28 Correct 2 ms 856 KB Output is correct
29 Correct 1 ms 856 KB Output is correct
30 Correct 1 ms 856 KB Output is correct
31 Correct 2 ms 856 KB Output is correct
32 Correct 0 ms 544 KB Output is correct
33 Correct 140 ms 58132 KB Output is correct
34 Correct 132 ms 58148 KB Output is correct
35 Correct 115 ms 60976 KB Output is correct
36 Correct 136 ms 58608 KB Output is correct
37 Correct 136 ms 58048 KB Output is correct
38 Correct 113 ms 57120 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 65 ms 33568 KB Output is correct
41 Correct 132 ms 58144 KB Output is correct
42 Correct 118 ms 61104 KB Output is correct
43 Correct 137 ms 58516 KB Output is correct
44 Correct 131 ms 58064 KB Output is correct
45 Correct 114 ms 56860 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 177 ms 26768 KB Output is correct
5 Correct 669 ms 58144 KB Output is correct
6 Correct 373 ms 9936 KB Output is correct
7 Correct 693 ms 58148 KB Output is correct
8 Correct 396 ms 20560 KB Output is correct
9 Correct 718 ms 58048 KB Output is correct
10 Correct 897 ms 60976 KB Output is correct
11 Correct 769 ms 61176 KB Output is correct
12 Correct 771 ms 61132 KB Output is correct
13 Correct 724 ms 58672 KB Output is correct
14 Correct 767 ms 57884 KB Output is correct
15 Correct 696 ms 57184 KB Output is correct
16 Correct 758 ms 57136 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 9 ms 944 KB Output is correct
28 Correct 10 ms 1112 KB Output is correct
29 Correct 10 ms 940 KB Output is correct
30 Correct 9 ms 1112 KB Output is correct
31 Correct 12 ms 1112 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 65 ms 33628 KB Output is correct
34 Correct 132 ms 58144 KB Output is correct
35 Correct 118 ms 60964 KB Output is correct
36 Correct 133 ms 58660 KB Output is correct
37 Correct 129 ms 57884 KB Output is correct
38 Correct 130 ms 56868 KB Output is correct

Subtask #6
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 177 ms 26768 KB Output is correct
5 Correct 669 ms 58144 KB Output is correct
6 Correct 373 ms 9936 KB Output is correct
7 Correct 693 ms 58148 KB Output is correct
8 Correct 396 ms 20560 KB Output is correct
9 Correct 718 ms 58048 KB Output is correct
10 Correct 897 ms 60976 KB Output is correct
11 Correct 769 ms 61176 KB Output is correct
12 Correct 771 ms 61132 KB Output is correct
13 Correct 724 ms 58672 KB Output is correct
14 Correct 767 ms 57884 KB Output is correct
15 Correct 696 ms 57184 KB Output is correct
16 Correct 758 ms 57136 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 9 ms 944 KB Output is correct
28 Correct 10 ms 1112 KB Output is correct
29 Correct 10 ms 940 KB Output is correct
30 Correct 9 ms 1112 KB Output is correct
31 Correct 12 ms 1112 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 65 ms 33628 KB Output is correct
34 Correct 132 ms 58144 KB Output is correct
35 Correct 118 ms 60964 KB Output is correct
36 Correct 133 ms 58660 KB Output is correct
37 Correct 129 ms 57884 KB Output is correct
38 Correct 130 ms 56868 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 0 ms 344 KB Output is correct
42 Correct 179 ms 26772 KB Output is correct
43 Correct 711 ms 57972 KB Output is correct
44 Correct 406 ms 9936 KB Output is correct
45 Correct 755 ms 58140 KB Output is correct
46 Correct 390 ms 20804 KB Output is correct
47 Correct 719 ms 58144 KB Output is correct
48 Correct 921 ms 61112 KB Output is correct
49 Correct 757 ms 60976 KB Output is correct
50 Correct 825 ms 61204 KB Output is correct
51 Correct 691 ms 58616 KB Output is correct
52 Correct 834 ms 57892 KB Output is correct
53 Correct 655 ms 56988 KB Output is correct
54 Correct 635 ms 57132 KB Output is correct
55 Correct 0 ms 344 KB Output is correct
56 Correct 164 ms 57944 KB Output is correct
57 Correct 762 ms 58136 KB Output is correct
58 Correct 382 ms 10680 KB Output is correct
59 Correct 717 ms 58148 KB Output is correct
60 Correct 319 ms 21560 KB Output is correct
61 Correct 740 ms 58140 KB Output is correct
62 Correct 1014 ms 61044 KB Output is correct
63 Correct 853 ms 60976 KB Output is correct
64 Correct 858 ms 61028 KB Output is correct
65 Correct 749 ms 58908 KB Output is correct
66 Correct 906 ms 58108 KB Output is correct
67 Correct 737 ms 56352 KB Output is correct
68 Correct 721 ms 57132 KB Output is correct
69 Correct 1 ms 344 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 1 ms 596 KB Output is correct
72 Correct 1 ms 344 KB Output is correct
73 Correct 1 ms 344 KB Output is correct
74 Correct 1 ms 344 KB Output is correct
75 Correct 1 ms 344 KB Output is correct
76 Correct 0 ms 344 KB Output is correct
77 Correct 0 ms 344 KB Output is correct
78 Correct 1 ms 344 KB Output is correct
79 Correct 1 ms 344 KB Output is correct
80 Correct 1 ms 344 KB Output is correct
81 Correct 1 ms 344 KB Output is correct
82 Correct 1 ms 344 KB Output is correct
83 Correct 1 ms 344 KB Output is correct
84 Correct 1 ms 344 KB Output is correct
85 Correct 2 ms 344 KB Output is correct
86 Correct 11 ms 944 KB Output is correct
87 Correct 12 ms 856 KB Output is correct
88 Correct 9 ms 1112 KB Output is correct
89 Correct 13 ms 956 KB Output is correct
90 Correct 9 ms 856 KB Output is correct
91 Correct 0 ms 344 KB Output is correct
92 Correct 1 ms 600 KB Output is correct
93 Correct 11 ms 948 KB Output is correct
94 Correct 11 ms 980 KB Output is correct
95 Correct 10 ms 1108 KB Output is correct
96 Correct 9 ms 948 KB Output is correct
97 Correct 13 ms 940 KB Output is correct
98 Correct 0 ms 340 KB Output is correct
99 Correct 144 ms 57908 KB Output is correct
100 Correct 135 ms 58140 KB Output is correct
101 Correct 117 ms 60968 KB Output is correct
102 Correct 128 ms 58720 KB Output is correct
103 Correct 142 ms 58136 KB Output is correct
104 Correct 110 ms 57124 KB Output is correct
105 Correct 0 ms 344 KB Output is correct
106 Correct 62 ms 33504 KB Output is correct
107 Correct 131 ms 57968 KB Output is correct
108 Correct 114 ms 61100 KB Output is correct
109 Correct 129 ms 58472 KB Output is correct
110 Correct 126 ms 57960 KB Output is correct
111 Correct 110 ms 56952 KB Output is correct

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Execution timed out 4038 ms 49532 KB Time limit exceeded
4 Halted 0 ms 0 KB -