#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;
vv st2;
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, vv &st)
{
ll n = st.size() / 2;
ll tl = n, tr = threshold + n - 1;
v segs, segsRev;
while (tl <= tr)
{
if (tl % 2 == 1)
{
segs.pb(tl);
tl++;
}
if (tr % 2 == 0)
{
segsRev.pb(tr);
tr--;
}
tl /= 2; tr /= 2;
}
reverse(all(segs)); for (ll x : segs) segsRev.pb(x);
for (ll x : segsRev)
{
auto ptr = lower_bound(all(st[x]), l);
if (ptr != st[x].end() && (*ptr) <= r)
{
while (x < n)
{
auto ptr = lower_bound(all(st[2 * x + 1]), l);
if (ptr != st[2 * x + 1].end() && (*ptr) <= r) x = 2 * x + 1;
else x *= 2;
}
return st[x][0];
}
}
return -1;
}
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);
}
/*
st2 = vv(2 * n, v());
for (ll i = 0; i < N; i++) st2[H[i] + n] = {i};
for (ll i = n - 1; i> 0; i--)
{
merge(all(st2[2 * i]), all(st2[2 * i + 1]), back_inserter(st2[i]));
}
*/
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], st2);
ll i = -1;
for (ll k = A; k <= B; k++)
{
if (H[k] > H[j]) i = -1;
else if (i == -1 || H[k] > H[i]) i = k;
}
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:232:1: warning: "/*" within comment [-Wcomment]
232 | /**/
|
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:117: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]
117 | for (ll i = 0; i < hSorted.size(); i++) H[hSorted[i].s] = i;
| ~~^~~~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Execution timed out |
4082 ms |
49032 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
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 |
344 KB |
Output is correct |
7 |
Correct |
2 ms |
344 KB |
Output is correct |
8 |
Correct |
1 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 |
2 ms |
344 KB |
Output is correct |
12 |
Correct |
2 ms |
344 KB |
Output is correct |
13 |
Correct |
2 ms |
344 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 |
0 ms |
344 KB |
Output is correct |
26 |
Correct |
0 ms |
344 KB |
Output is correct |
27 |
Correct |
1 ms |
344 KB |
Output is correct |
28 |
Correct |
2 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 |
1 ms |
344 KB |
Output is correct |
35 |
Correct |
0 ms |
344 KB |
Output is correct |
36 |
Correct |
0 ms |
344 KB |
Output is correct |
37 |
Correct |
0 ms |
372 KB |
Output is correct |
38 |
Correct |
0 ms |
596 KB |
Output is correct |
39 |
Correct |
0 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
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 |
344 KB |
Output is correct |
7 |
Correct |
2 ms |
344 KB |
Output is correct |
8 |
Correct |
1 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 |
2 ms |
344 KB |
Output is correct |
12 |
Correct |
2 ms |
344 KB |
Output is correct |
13 |
Correct |
2 ms |
344 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 |
0 ms |
344 KB |
Output is correct |
26 |
Correct |
0 ms |
344 KB |
Output is correct |
27 |
Correct |
1 ms |
344 KB |
Output is correct |
28 |
Correct |
2 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 |
1 ms |
344 KB |
Output is correct |
35 |
Correct |
0 ms |
344 KB |
Output is correct |
36 |
Correct |
0 ms |
344 KB |
Output is correct |
37 |
Correct |
0 ms |
372 KB |
Output is correct |
38 |
Correct |
0 ms |
596 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 |
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 |
1 ms |
344 KB |
Output is correct |
46 |
Correct |
1 ms |
344 KB |
Output is correct |
47 |
Correct |
2 ms |
596 KB |
Output is correct |
48 |
Correct |
1 ms |
344 KB |
Output is correct |
49 |
Correct |
2 ms |
344 KB |
Output is correct |
50 |
Correct |
2 ms |
344 KB |
Output is correct |
51 |
Correct |
2 ms |
344 KB |
Output is correct |
52 |
Correct |
2 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 |
1 ms |
344 KB |
Output is correct |
57 |
Correct |
0 ms |
344 KB |
Output is correct |
58 |
Correct |
163 ms |
856 KB |
Output is correct |
59 |
Correct |
306 ms |
920 KB |
Output is correct |
60 |
Correct |
16 ms |
600 KB |
Output is correct |
61 |
Correct |
300 ms |
936 KB |
Output is correct |
62 |
Correct |
9 ms |
344 KB |
Output is correct |
63 |
Correct |
293 ms |
916 KB |
Output is correct |
64 |
Correct |
507 ms |
956 KB |
Output is correct |
65 |
Correct |
498 ms |
952 KB |
Output is correct |
66 |
Correct |
490 ms |
1108 KB |
Output is correct |
67 |
Correct |
298 ms |
932 KB |
Output is correct |
68 |
Correct |
355 ms |
1104 KB |
Output is correct |
69 |
Correct |
105 ms |
1104 KB |
Output is correct |
70 |
Correct |
126 ms |
952 KB |
Output is correct |
71 |
Correct |
1 ms |
344 KB |
Output is correct |
72 |
Correct |
0 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 |
1 ms |
344 KB |
Output is correct |
77 |
Correct |
1 ms |
344 KB |
Output is correct |
78 |
Correct |
0 ms |
344 KB |
Output is correct |
79 |
Correct |
0 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 |
0 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 |
0 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 |
1 ms |
340 KB |
Output is correct |
93 |
Correct |
1 ms |
344 KB |
Output is correct |
94 |
Correct |
2 ms |
344 KB |
Output is correct |
95 |
Correct |
14 ms |
936 KB |
Output is correct |
96 |
Correct |
11 ms |
856 KB |
Output is correct |
97 |
Correct |
11 ms |
956 KB |
Output is correct |
98 |
Correct |
14 ms |
1112 KB |
Output is correct |
99 |
Correct |
8 ms |
856 KB |
Output is correct |
100 |
Correct |
0 ms |
344 KB |
Output is correct |
101 |
Correct |
1 ms |
600 KB |
Output is correct |
102 |
Correct |
9 ms |
944 KB |
Output is correct |
103 |
Correct |
9 ms |
980 KB |
Output is correct |
104 |
Correct |
10 ms |
1104 KB |
Output is correct |
105 |
Correct |
12 ms |
1116 KB |
Output is correct |
106 |
Correct |
8 ms |
856 KB |
Output is correct |
107 |
Correct |
1 ms |
344 KB |
Output is correct |
108 |
Correct |
1 ms |
600 KB |
Output is correct |
109 |
Correct |
2 ms |
856 KB |
Output is correct |
110 |
Correct |
2 ms |
856 KB |
Output is correct |
111 |
Correct |
2 ms |
856 KB |
Output is correct |
112 |
Correct |
2 ms |
856 KB |
Output is correct |
113 |
Correct |
3 ms |
856 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 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 |
819 ms |
47596 KB |
Output is correct |
6 |
Execution timed out |
4013 ms |
58400 KB |
Time limit exceeded |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
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 |
164 ms |
26812 KB |
Output is correct |
5 |
Correct |
695 ms |
58140 KB |
Output is correct |
6 |
Correct |
398 ms |
10060 KB |
Output is correct |
7 |
Correct |
725 ms |
58148 KB |
Output is correct |
8 |
Correct |
378 ms |
20532 KB |
Output is correct |
9 |
Correct |
776 ms |
58000 KB |
Output is correct |
10 |
Correct |
920 ms |
61104 KB |
Output is correct |
11 |
Correct |
724 ms |
61196 KB |
Output is correct |
12 |
Correct |
858 ms |
61328 KB |
Output is correct |
13 |
Correct |
713 ms |
58488 KB |
Output is correct |
14 |
Correct |
789 ms |
58056 KB |
Output is correct |
15 |
Correct |
597 ms |
57116 KB |
Output is correct |
16 |
Correct |
609 ms |
57220 KB |
Output is correct |
17 |
Correct |
0 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 |
2 ms |
352 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 |
11 ms |
948 KB |
Output is correct |
28 |
Correct |
10 ms |
976 KB |
Output is correct |
29 |
Correct |
8 ms |
1112 KB |
Output is correct |
30 |
Correct |
12 ms |
1112 KB |
Output is correct |
31 |
Correct |
9 ms |
936 KB |
Output is correct |
32 |
Correct |
0 ms |
344 KB |
Output is correct |
33 |
Correct |
65 ms |
33604 KB |
Output is correct |
34 |
Correct |
122 ms |
58148 KB |
Output is correct |
35 |
Correct |
114 ms |
61028 KB |
Output is correct |
36 |
Correct |
124 ms |
58544 KB |
Output is correct |
37 |
Correct |
138 ms |
58052 KB |
Output is correct |
38 |
Correct |
110 ms |
56868 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
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 |
164 ms |
26812 KB |
Output is correct |
5 |
Correct |
695 ms |
58140 KB |
Output is correct |
6 |
Correct |
398 ms |
10060 KB |
Output is correct |
7 |
Correct |
725 ms |
58148 KB |
Output is correct |
8 |
Correct |
378 ms |
20532 KB |
Output is correct |
9 |
Correct |
776 ms |
58000 KB |
Output is correct |
10 |
Correct |
920 ms |
61104 KB |
Output is correct |
11 |
Correct |
724 ms |
61196 KB |
Output is correct |
12 |
Correct |
858 ms |
61328 KB |
Output is correct |
13 |
Correct |
713 ms |
58488 KB |
Output is correct |
14 |
Correct |
789 ms |
58056 KB |
Output is correct |
15 |
Correct |
597 ms |
57116 KB |
Output is correct |
16 |
Correct |
609 ms |
57220 KB |
Output is correct |
17 |
Correct |
0 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 |
2 ms |
352 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 |
11 ms |
948 KB |
Output is correct |
28 |
Correct |
10 ms |
976 KB |
Output is correct |
29 |
Correct |
8 ms |
1112 KB |
Output is correct |
30 |
Correct |
12 ms |
1112 KB |
Output is correct |
31 |
Correct |
9 ms |
936 KB |
Output is correct |
32 |
Correct |
0 ms |
344 KB |
Output is correct |
33 |
Correct |
65 ms |
33604 KB |
Output is correct |
34 |
Correct |
122 ms |
58148 KB |
Output is correct |
35 |
Correct |
114 ms |
61028 KB |
Output is correct |
36 |
Correct |
124 ms |
58544 KB |
Output is correct |
37 |
Correct |
138 ms |
58052 KB |
Output is correct |
38 |
Correct |
110 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 |
1 ms |
344 KB |
Output is correct |
42 |
Correct |
178 ms |
26768 KB |
Output is correct |
43 |
Correct |
697 ms |
58148 KB |
Output is correct |
44 |
Correct |
408 ms |
9936 KB |
Output is correct |
45 |
Correct |
691 ms |
58140 KB |
Output is correct |
46 |
Correct |
354 ms |
20452 KB |
Output is correct |
47 |
Correct |
669 ms |
58192 KB |
Output is correct |
48 |
Correct |
865 ms |
61120 KB |
Output is correct |
49 |
Correct |
746 ms |
61208 KB |
Output is correct |
50 |
Correct |
710 ms |
61248 KB |
Output is correct |
51 |
Correct |
680 ms |
58908 KB |
Output is correct |
52 |
Correct |
801 ms |
57976 KB |
Output is correct |
53 |
Correct |
645 ms |
57392 KB |
Output is correct |
54 |
Correct |
622 ms |
57240 KB |
Output is correct |
55 |
Correct |
0 ms |
344 KB |
Output is correct |
56 |
Correct |
874 ms |
57888 KB |
Output is correct |
57 |
Execution timed out |
4091 ms |
58416 KB |
Time limit exceeded |
58 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Execution timed out |
4082 ms |
49032 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |