oj.uz

Submission #157263

# Submission time Handle Problem Language Result Execution time Memory
157263 2019-10-10T09:11:55 Z atoiz Two Dishes (JOI19_dishes) C++14
65 / 100
 1281 ms 222584 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cassert>
#include <numeric>
#include <tuple>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
#include <queue>
#include <ios>
#include <iomanip>
#include <random>
#include <chrono>

using namespace std;
using ll = long long;

#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORA(i, a) for (auto &i : a)
#define FORB(i, a, b) for (int i = a; i >= b; --i)
#define SZ(a) ((int) a.size());
#define ALL(a) begin(a), end(a)

const int MAXN = 1000007;
const ll INF = 1e16;
int N, M;
ll A[MAXN], B[MAXN], S[MAXN], T[MAXN], P[MAXN], Q[MAXN];
vector<int> ids[MAXN];
//
// ll lazy[MAXN << 2], tree[MAXN << 2];
//
// void push(int root, int lo, int hi)
// {
//     if (lo < hi) {
//         tree[root << 1] = max(tree[root], tree[root << 1] + lazy[root]);
//         tree[root << 1 | 1] = max(tree[root], tree[root << 1 | 1] + lazy[root]);
//         lazy[root << 1] += lazy[root];
//         lazy[root << 1 | 1] += lazy[root];
//     } else tree[root] = -INF;
//     lazy[root] = 0;
// }
//
// void add(int l, int r, ll x, int root = 1, int lo = 0, int hi = M)
// {
//     // FOR(i, l, r) tree[i] += x;
//     // return;
//     if (r < lo || hi < l) return;
//     push(root, lo, hi);
//     if (l <= lo && hi <= r) {
//         lazy[root] += x;
//         tree[root] += x;
//         return;
//     }
//
//     int mid = (lo + hi) >> 1;
//     add(l, r, x, root << 1, lo, mid);
//     add(l, r, x, root << 1 | 1, mid + 1, hi);
// }
//
// void upd(int l, int r, ll x, int root = 1, int lo = 0, int hi = M)
// {
//     // FOR(i, l, r) tree[i] = max(tree[i], x);
//     // return;
//     if (r < lo || hi < l) return;
//     push(root, lo, hi);
//     if (l <= lo && hi <= r) {
//         tree[root] = max(tree[root], x);
//         return;
//     }
//
//     int mid = (lo + hi) >> 1;
//     upd(l, r, x, root << 1, lo, mid);
//     upd(l, r, x, root << 1 | 1, mid + 1, hi);
// }
//
// ll get(int id, int root = 1, int lo = 0, int hi = M)
// {
//     // return tree[id];
//     push(root, lo, hi);
//     if (lo == hi) return tree[root];
//
//     int mid = (lo + hi) >> 1;
//     if (id <= mid) return max(tree[root], get(id, root << 1, lo, mid));
//     return max(tree[root], get(id, root << 1 | 1, mid + 1, hi));
// }

ll cur_max[MAXN], lazy[MAXN], tree[MAXN];
void push(int root, int lo, int hi)
{
    if (lo < hi) {
        tree[root << 1] = max(tree[root << 1] + lazy[root], tree[root]);
        tree[root << 1 | 1] = max(tree[root << 1 | 1] + lazy[root], tree[root]);
        cur_max[root << 1] = max(cur_max[root << 1] + lazy[root], tree[root << 1]);
        cur_max[root << 1 | 1] = max(cur_max[root << 1 | 1] + lazy[root], tree[root << 1 | 1]);
        lazy[root << 1] += lazy[root];
        lazy[root << 1 | 1] += lazy[root];
    }
    tree[root] = 0;
    lazy[root] = 0;
}

void add(int l, int r, ll x, int root = 1, int lo = 0, int hi = M)
{
    if (r < lo || hi < l) return;
    push(root, lo, hi);
    if (l <= lo && hi <= r) {
        cur_max[root] += x;
        lazy[root] += x;
        tree[root] += x;
        return;
    }

    int mid = (lo + hi) >> 1;
    add(l, r, x, root << 1, lo, mid);
    add(l, r, x, root << 1 | 1, mid + 1, hi);
    cur_max[root] = max(tree[root], max(cur_max[root << 1], cur_max[root << 1 | 1]));
}

void upd(int l, int r, ll x, int root = 1, int lo = 0, int hi = M)
{
    if (r < lo || hi < l) return;
    push(root, lo, hi);
    if (l <= lo && hi <= r) {
        tree[root] = max(tree[root], x);
        cur_max[root] = max(cur_max[root], x);
        return;
    }

    int mid = (lo + hi) >> 1;
    upd(l, r, x, root << 1, lo, mid);
    upd(l, r, x, root << 1 | 1, mid + 1, hi);
    cur_max[root] = max(tree[root], max(cur_max[root << 1], cur_max[root << 1 | 1]));
}

ll get(int l, int r, int root = 1, int lo = 0, int hi = M)
{
    ll ans = 0;
    if (r < lo || hi < l) return ans;
    push(root, lo, hi);
    if (l <= lo && hi <= r) return cur_max[root];

    int mid = (lo + hi) >> 1;
    ans = max(ans, get(l, r, root << 1, lo, mid));
    ans = max(ans, get(l, r, root << 1 | 1, mid + 1, hi));
    return ans;
}

ll read()
{
    ll ans = 0; bool pos = 1; register char ch = getchar();
    for (; ch == ' ' || ch == '\n'; ch = getchar());
    if (ch == '-') pos = 0, ch = getchar();
    for (; 47 < ch && ch < 58; ch = getchar()) ans = ans * 10 + ch - 48;
    return (pos ? ans : -ans);
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    N = read(), M = read();
    FOR(i, 1, N) A[i] = A[i - 1] + read(), S[i] = read(), P[i] = read(); A[N + 1] = INF;
    FOR(i, 1, M) B[i] = B[i - 1] + read(), T[i] = read(), Q[i] = read(); B[M + 1] = INF;

    FOR(j, 1, M) ids[upper_bound(A, A + N + 1, T[j] - B[j]) - A].push_back(j);

    FOR(i, 1, N + 1) {
        int j = upper_bound(B, B + M + 1, S[i] - A[i]) - B - 1;
        if (j >= 0) add(0, j, P[i]);

        vector<int> &vec = ids[i];
        FORA(id, vec) add(id, M, Q[id]);

        if (0 <= j && j < M) vec.insert(lower_bound(vec.begin(), vec.end(), j + 1), j + 1);
        FORA(id, vec) upd(id, M, get(0, id - 1));
        // FOR(id, 1, M) tree[id] = max(tree[id], tree[id - 1]);
        // FOR(j, 0, M) {
        //     cerr << i << ' ' << j << ": " << get(j) << endl;
        // }
    }

    cout << get(M, M) << endl;
}

Compilation message

dishes.cpp: In function 'int main()':
dishes.cpp:28:22: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
 #define FOR(i, a, b) for (int i = a; i <= b; ++i)
                      ^
dishes.cpp:171:5: note: in expansion of macro 'FOR'
     FOR(i, 1, N) A[i] = A[i - 1] + read(), S[i] = read(), P[i] = read(); A[N + 1] = INF;
     ^~~
dishes.cpp:171:74: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
     FOR(i, 1, N) A[i] = A[i - 1] + read(), S[i] = read(), P[i] = read(); A[N + 1] = INF;
                                                                          ^
dishes.cpp:28:22: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
 #define FOR(i, a, b) for (int i = a; i <= b; ++i)
                      ^
dishes.cpp:172:5: note: in expansion of macro 'FOR'
     FOR(i, 1, M) B[i] = B[i - 1] + read(), T[i] = read(), Q[i] = read(); B[M + 1] = INF;
     ^~~
dishes.cpp:172:74: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
     FOR(i, 1, M) B[i] = B[i - 1] + read(), T[i] = read(), Q[i] = read(); B[M + 1] = INF;
                                                                          ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 704 ms 50296 KB Output is correct
2 Correct 727 ms 64988 KB Output is correct
3 Correct 500 ms 59824 KB Output is correct
4 Correct 561 ms 58616 KB Output is correct
5 Correct 27 ms 23928 KB Output is correct
6 Correct 669 ms 63324 KB Output is correct
7 Correct 362 ms 47600 KB Output is correct
8 Correct 137 ms 35700 KB Output is correct
9 Correct 520 ms 60844 KB Output is correct
10 Correct 670 ms 59456 KB Output is correct
11 Correct 415 ms 54512 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23928 KB Output is correct
2 Correct 23 ms 23928 KB Output is correct
3 Correct 24 ms 23928 KB Output is correct
4 Correct 24 ms 23928 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 26 ms 23928 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 23 ms 23928 KB Output is correct
9 Correct 24 ms 23928 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 24 ms 23928 KB Output is correct
12 Correct 24 ms 23928 KB Output is correct
13 Correct 23 ms 23928 KB Output is correct
14 Correct 23 ms 23928 KB Output is correct
15 Correct 24 ms 23928 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23928 KB Output is correct
2 Correct 23 ms 23928 KB Output is correct
3 Correct 24 ms 23928 KB Output is correct
4 Correct 24 ms 23928 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 26 ms 23928 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 23 ms 23928 KB Output is correct
9 Correct 24 ms 23928 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 24 ms 23928 KB Output is correct
12 Correct 24 ms 23928 KB Output is correct
13 Correct 23 ms 23928 KB Output is correct
14 Correct 23 ms 23928 KB Output is correct
15 Correct 24 ms 23928 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct
17 Correct 32 ms 24184 KB Output is correct
18 Correct 26 ms 24028 KB Output is correct
19 Correct 28 ms 24056 KB Output is correct
20 Correct 27 ms 24184 KB Output is correct
21 Correct 28 ms 24056 KB Output is correct
22 Correct 29 ms 24188 KB Output is correct
23 Correct 28 ms 24056 KB Output is correct

Subtask #4
39.0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23928 KB Output is correct
2 Correct 23 ms 23928 KB Output is correct
3 Correct 24 ms 23928 KB Output is correct
4 Correct 24 ms 23928 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 26 ms 23928 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 23 ms 23928 KB Output is correct
9 Correct 24 ms 23928 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 24 ms 23928 KB Output is correct
12 Correct 24 ms 23928 KB Output is correct
13 Correct 23 ms 23928 KB Output is correct
14 Correct 23 ms 23928 KB Output is correct
15 Correct 24 ms 23928 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct
17 Correct 32 ms 24184 KB Output is correct
18 Correct 26 ms 24028 KB Output is correct
19 Correct 28 ms 24056 KB Output is correct
20 Correct 27 ms 24184 KB Output is correct
21 Correct 28 ms 24056 KB Output is correct
22 Correct 29 ms 24188 KB Output is correct
23 Correct 28 ms 24056 KB Output is correct
24 Correct 610 ms 52728 KB Output is correct
25 Correct 451 ms 57200 KB Output is correct
26 Correct 587 ms 63432 KB Output is correct
27 Correct 491 ms 62572 KB Output is correct
28 Correct 603 ms 59604 KB Output is correct
29 Correct 467 ms 57840 KB Output is correct
30 Correct 999 ms 62584 KB Output is correct
31 Correct 360 ms 47136 KB Output is correct
32 Correct 125 ms 36864 KB Output is correct
33 Correct 613 ms 60540 KB Output is correct
34 Correct 837 ms 61764 KB Output is correct
35 Correct 913 ms 56220 KB Output is correct
36 Correct 882 ms 56184 KB Output is correct

Subtask #5
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23928 KB Output is correct
2 Correct 23 ms 23928 KB Output is correct
3 Correct 24 ms 23928 KB Output is correct
4 Correct 24 ms 23928 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 26 ms 23928 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 23 ms 23928 KB Output is correct
9 Correct 24 ms 23928 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 24 ms 23928 KB Output is correct
12 Correct 24 ms 23928 KB Output is correct
13 Correct 23 ms 23928 KB Output is correct
14 Correct 23 ms 23928 KB Output is correct
15 Correct 24 ms 23928 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct
17 Correct 32 ms 24184 KB Output is correct
18 Correct 26 ms 24028 KB Output is correct
19 Correct 28 ms 24056 KB Output is correct
20 Correct 27 ms 24184 KB Output is correct
21 Correct 28 ms 24056 KB Output is correct
22 Correct 29 ms 24188 KB Output is correct
23 Correct 28 ms 24056 KB Output is correct
24 Correct 610 ms 52728 KB Output is correct
25 Correct 451 ms 57200 KB Output is correct
26 Correct 587 ms 63432 KB Output is correct
27 Correct 491 ms 62572 KB Output is correct
28 Correct 603 ms 59604 KB Output is correct
29 Correct 467 ms 57840 KB Output is correct
30 Correct 999 ms 62584 KB Output is correct
31 Correct 360 ms 47136 KB Output is correct
32 Correct 125 ms 36864 KB Output is correct
33 Correct 613 ms 60540 KB Output is correct
34 Correct 837 ms 61764 KB Output is correct
35 Correct 913 ms 56220 KB Output is correct
36 Correct 882 ms 56184 KB Output is correct
37 Correct 628 ms 66276 KB Output is correct
38 Correct 533 ms 65656 KB Output is correct
39 Correct 712 ms 62940 KB Output is correct
40 Correct 714 ms 62824 KB Output is correct
41 Correct 23 ms 23928 KB Output is correct
42 Correct 1047 ms 65544 KB Output is correct
43 Correct 662 ms 63520 KB Output is correct
44 Correct 883 ms 64484 KB Output is correct
45 Correct 968 ms 59180 KB Output is correct

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23928 KB Output is correct
2 Correct 23 ms 23928 KB Output is correct
3 Correct 24 ms 23928 KB Output is correct
4 Correct 24 ms 23928 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 26 ms 23928 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 23 ms 23928 KB Output is correct
9 Correct 24 ms 23928 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 24 ms 23928 KB Output is correct
12 Correct 24 ms 23928 KB Output is correct
13 Correct 23 ms 23928 KB Output is correct
14 Correct 23 ms 23928 KB Output is correct
15 Correct 24 ms 23928 KB Output is correct
16 Correct 24 ms 23928 KB Output is correct
17 Correct 32 ms 24184 KB Output is correct
18 Correct 26 ms 24028 KB Output is correct
19 Correct 28 ms 24056 KB Output is correct
20 Correct 27 ms 24184 KB Output is correct
21 Correct 28 ms 24056 KB Output is correct
22 Correct 29 ms 24188 KB Output is correct
23 Correct 28 ms 24056 KB Output is correct
24 Correct 610 ms 52728 KB Output is correct
25 Correct 451 ms 57200 KB Output is correct
26 Correct 587 ms 63432 KB Output is correct
27 Correct 491 ms 62572 KB Output is correct
28 Correct 603 ms 59604 KB Output is correct
29 Correct 467 ms 57840 KB Output is correct
30 Correct 999 ms 62584 KB Output is correct
31 Correct 360 ms 47136 KB Output is correct
32 Correct 125 ms 36864 KB Output is correct
33 Correct 613 ms 60540 KB Output is correct
34 Correct 837 ms 61764 KB Output is correct
35 Correct 913 ms 56220 KB Output is correct
36 Correct 882 ms 56184 KB Output is correct
37 Correct 628 ms 66276 KB Output is correct
38 Correct 533 ms 65656 KB Output is correct
39 Correct 712 ms 62940 KB Output is correct
40 Correct 714 ms 62824 KB Output is correct
41 Correct 23 ms 23928 KB Output is correct
42 Correct 1047 ms 65544 KB Output is correct
43 Correct 662 ms 63520 KB Output is correct
44 Correct 883 ms 64484 KB Output is correct
45 Correct 968 ms 59180 KB Output is correct
46 Runtime error 1281 ms 222584 KB Execution killed with signal 11 (could be triggered by violating memory limits)
47 Halted 0 ms 0 KB -

Subtask #7
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 704 ms 50296 KB Output is correct
2 Correct 727 ms 64988 KB Output is correct
3 Correct 500 ms 59824 KB Output is correct
4 Correct 561 ms 58616 KB Output is correct
5 Correct 27 ms 23928 KB Output is correct
6 Correct 669 ms 63324 KB Output is correct
7 Correct 362 ms 47600 KB Output is correct
8 Correct 137 ms 35700 KB Output is correct
9 Correct 520 ms 60844 KB Output is correct
10 Correct 670 ms 59456 KB Output is correct
11 Correct 415 ms 54512 KB Output is correct
12 Correct 23 ms 23928 KB Output is correct
13 Correct 23 ms 23928 KB Output is correct
14 Correct 24 ms 23928 KB Output is correct
15 Correct 24 ms 23928 KB Output is correct
16 Correct 23 ms 23928 KB Output is correct
17 Correct 26 ms 23928 KB Output is correct
18 Correct 24 ms 23928 KB Output is correct
19 Correct 23 ms 23928 KB Output is correct
20 Correct 24 ms 23928 KB Output is correct
21 Correct 24 ms 23928 KB Output is correct
22 Correct 24 ms 23928 KB Output is correct
23 Correct 24 ms 23928 KB Output is correct
24 Correct 23 ms 23928 KB Output is correct
25 Correct 23 ms 23928 KB Output is correct
26 Correct 24 ms 23928 KB Output is correct
27 Correct 24 ms 23928 KB Output is correct
28 Correct 32 ms 24184 KB Output is correct
29 Correct 26 ms 24028 KB Output is correct
30 Correct 28 ms 24056 KB Output is correct
31 Correct 27 ms 24184 KB Output is correct
32 Correct 28 ms 24056 KB Output is correct
33 Correct 29 ms 24188 KB Output is correct
34 Correct 28 ms 24056 KB Output is correct
35 Correct 610 ms 52728 KB Output is correct
36 Correct 451 ms 57200 KB Output is correct
37 Correct 587 ms 63432 KB Output is correct
38 Correct 491 ms 62572 KB Output is correct
39 Correct 603 ms 59604 KB Output is correct
40 Correct 467 ms 57840 KB Output is correct
41 Correct 999 ms 62584 KB Output is correct
42 Correct 360 ms 47136 KB Output is correct
43 Correct 125 ms 36864 KB Output is correct
44 Correct 613 ms 60540 KB Output is correct
45 Correct 837 ms 61764 KB Output is correct
46 Correct 913 ms 56220 KB Output is correct
47 Correct 882 ms 56184 KB Output is correct
48 Correct 628 ms 66276 KB Output is correct
49 Correct 533 ms 65656 KB Output is correct
50 Correct 712 ms 62940 KB Output is correct
51 Correct 714 ms 62824 KB Output is correct
52 Correct 23 ms 23928 KB Output is correct
53 Correct 1047 ms 65544 KB Output is correct
54 Correct 662 ms 63520 KB Output is correct
55 Correct 883 ms 64484 KB Output is correct
56 Correct 968 ms 59180 KB Output is correct
57 Incorrect 633 ms 66756 KB Output isn't correct
58 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 704 ms 50296 KB Output is correct
2 Correct 727 ms 64988 KB Output is correct
3 Correct 500 ms 59824 KB Output is correct
4 Correct 561 ms 58616 KB Output is correct
5 Correct 27 ms 23928 KB Output is correct
6 Correct 669 ms 63324 KB Output is correct
7 Correct 362 ms 47600 KB Output is correct
8 Correct 137 ms 35700 KB Output is correct
9 Correct 520 ms 60844 KB Output is correct
10 Correct 670 ms 59456 KB Output is correct
11 Correct 415 ms 54512 KB Output is correct
12 Correct 23 ms 23928 KB Output is correct
13 Correct 23 ms 23928 KB Output is correct
14 Correct 24 ms 23928 KB Output is correct
15 Correct 24 ms 23928 KB Output is correct
16 Correct 23 ms 23928 KB Output is correct
17 Correct 26 ms 23928 KB Output is correct
18 Correct 24 ms 23928 KB Output is correct
19 Correct 23 ms 23928 KB Output is correct
20 Correct 24 ms 23928 KB Output is correct
21 Correct 24 ms 23928 KB Output is correct
22 Correct 24 ms 23928 KB Output is correct
23 Correct 24 ms 23928 KB Output is correct
24 Correct 23 ms 23928 KB Output is correct
25 Correct 23 ms 23928 KB Output is correct
26 Correct 24 ms 23928 KB Output is correct
27 Correct 24 ms 23928 KB Output is correct
28 Correct 32 ms 24184 KB Output is correct
29 Correct 26 ms 24028 KB Output is correct
30 Correct 28 ms 24056 KB Output is correct
31 Correct 27 ms 24184 KB Output is correct
32 Correct 28 ms 24056 KB Output is correct
33 Correct 29 ms 24188 KB Output is correct
34 Correct 28 ms 24056 KB Output is correct
35 Correct 610 ms 52728 KB Output is correct
36 Correct 451 ms 57200 KB Output is correct
37 Correct 587 ms 63432 KB Output is correct
38 Correct 491 ms 62572 KB Output is correct
39 Correct 603 ms 59604 KB Output is correct
40 Correct 467 ms 57840 KB Output is correct
41 Correct 999 ms 62584 KB Output is correct
42 Correct 360 ms 47136 KB Output is correct
43 Correct 125 ms 36864 KB Output is correct
44 Correct 613 ms 60540 KB Output is correct
45 Correct 837 ms 61764 KB Output is correct
46 Correct 913 ms 56220 KB Output is correct
47 Correct 882 ms 56184 KB Output is correct
48 Correct 628 ms 66276 KB Output is correct
49 Correct 533 ms 65656 KB Output is correct
50 Correct 712 ms 62940 KB Output is correct
51 Correct 714 ms 62824 KB Output is correct
52 Correct 23 ms 23928 KB Output is correct
53 Correct 1047 ms 65544 KB Output is correct
54 Correct 662 ms 63520 KB Output is correct
55 Correct 883 ms 64484 KB Output is correct
56 Correct 968 ms 59180 KB Output is correct
57 Runtime error 1281 ms 222584 KB Execution killed with signal 11 (could be triggered by violating memory limits)
58 Halted 0 ms 0 KB -