oj.uz

Submission #976444

# Submission time Handle Problem Language Result Execution time Memory
976444 2024-05-06T14:58:01 Z underwaterkillerwhale Food Court (JOI21_foodcourt) C++17
68 / 100
 135 ms 150428 KB 
#include <bits/stdc++.h>
#define se              second
#define fs              first
#define pb              push_back
#define ll              long long
#define ii              pair<ll,ll>
#define ld              long double
#define SZ(v)           (int)v.size()
#define ALL(v)          v.begin(), v.end()
#define bit(msk, i)     ((msk >> i) & 1)
#define iter(id, v)     for(auto id : v)
#define rep(i,m,n)      for(int i=(m); i<=(n); i++)
#define reb(i,m,n)      for(int i=(m); i>=(n); i--)

using namespace std;

mt19937_64 rd(chrono :: steady_clock :: now().time_since_epoch().count());
ll Rand(ll l, ll r) { return uniform_int_distribution<ll> (l, r)(rd); }

const int N = 2e5 + 7;
const ll Mod = 1e9 + 7;
const int szBL = 916;
const ll INF = 1e18 + 7;
const int BASE = 137;

struct Data3 {
    ll idx, pos, id;
};

int n, m, Q;
int color[N];
vector<pair<ll,int>> q1[N];
vector<Data3> q3[N];

struct Segment_Tree_Beats {
    int Range;
    struct Node {
        ll lz, mn1, mn2, mnc, sum;
        Node (ll lz = 0, ll mn1 = 0, ll mn2 = INF, ll mnc = 0, ll sum = 0) : lz(lz), mn1(mn1), mn2(mn2), mnc(mnc), sum(sum) {};
    };
    Node st[N << 2];

    void init (int n) {
        Range = n;
    }

    void Merge (Node &cur, Node &left, Node &right){
        cur.sum = left.sum + right.sum;
        if (left.mn1 <= right.mn1) {
            cur.mn1 = left.mn1, cur.mnc = left.mnc;
            if (left.mn1 == right.mn1) cur.mnc += right.mnc, cur.mn2 = min(left.mn2, right.mn2);
            else cur.mn2 = min(left.mn2, right.mn1);
        }
        else {
            cur.mn1 = right.mn1, cur.mnc = right.mnc;
            cur.mn2 = min(left.mn1, right.mn2);
        }
    }

    void build (int id, int l, int r) {
        if (l == r) {
            st[id].mn1 = 0;
            st[id].mn2 = INF;
            st[id].mnc = 1;
            st[id].sum = 0;
            return;
        }
        int mid = l + r >> 1;
        build (id << 1, l, mid);
        build (id << 1 | 1, mid + 1, r);
        Merge (st[id], st[id << 1], st[id << 1 | 1]);
    }
    void down (int id, int l, int r) {
        int mid = l + r >> 1;
        int left = (id << 1), right = (id << 1 | 1);
        st[left].sum += st[id].lz * (mid - l + 1);
        st[right].sum += st[id].lz * (r - mid);
        rep (i, left, right) {
            st[i].mn1 += st[id].lz;
            st[i].lz += st[id].lz;
            if (st[i].mn1 < st[id].mn1) {
                st[i].sum += 1LL * (st[id].mn1 - st[i].mn1) * st[i].mnc;
                st[i].mn1 = st[id].mn1;
            }
            if (st[i].mn2 != INF) st[i].mn2 += st[id].lz;
        }
        st[id].lz = 0;
    }

    void update1 (int id, int l, int r, int u, int v, ll val) {
        if (l > v  || r < u) return;
        if (l >= u && r <= v) {
            st[id].sum += 1LL * (r - l + 1) * val;
            st[id].lz += val;
            st[id].mn1 += val;
            if(st[id].mn2 != INF) st[id].mn2 += val;
            return;
        }
        int mid = l + r >> 1;
        down (id, l, r);
        update1 (id << 1, l, mid, u, v, val);
        update1 (id << 1 | 1, mid + 1, r, u, v, val);
        Merge (st[id], st[id << 1], st[id << 1 | 1]);
    }

    void update2 (int id, int l, int r, int u, int v, ll val) {
        if (l > v || r < u || st[id].mn1 >= val) return;
        if (l >= u && r <= v && st[id].mn2 > val) {
            st[id].sum += 1LL * (val - st[id].mn1) * st[id].mnc;
            st[id].mn1 = val;
//            cout << id <<" "<<l<<" "<<r<<" "<<st[id].sum<<" "<<st[id].mn1<<" "<<st[id].mnc<<"hihih\n";
            return;
        }
        int mid = l + r >> 1;
        down (id, l, r);
        update2 (id << 1, l, mid, u, v, val);
        update2 (id << 1 | 1, mid + 1, r, u, v, val);
        Merge (st[id], st[id << 1], st[id << 1 | 1]);
    }

    ll get (int id, int l, int r, int u, int v) {
        if (l > v || r < u) return 0;
        if (l >= u && r <= v)
            return st[id].sum;
        int mid = l + r >> 1;
        down(id, l, r);
        return get (id << 1, l, mid, u, v) + get (id << 1 | 1, mid + 1, r, u, v);
    }

    void update1 (int u, int v, ll val) {
        update1 (1, 1, Range, u, v, val);
    }
    void update2 (int u, int v, ll val) {
        update2 (1, 1, Range, u, v, val);
    }
    ll get (int u, int v) {
        return get (1, 1, Range, u, v);
    }
}ST, Tot;

struct Fenwick_Tree {
    int Range;
    ll fen[N];
    void init (int n) { Range = n; }
    void update (int pos, ll val) {
        for (; pos <= Range; pos += pos & -pos) fen[pos] += val;
    }
    ll get (int pos) {
        ll res = 0;
        for (; pos > 0; pos -= pos & -pos) res += fen[pos];
        return res;
    }
}BIT;

void solution() {
    cin >> n >> m >> Q;
    ST.init(n);
    ST.build(1, 1, n);
    Tot.init(n);
    int numq3 = 0;
    rep (i, 1, Q) {
        int typ;
        cin >> typ;
        if (typ == 1) {
            ll L, R, C, K;
            cin >> L >> R >> C >> K;
            color[i] = C;
            q1[L].push_back({K, i});
            q1[R + 1].push_back({-K, i});
            ST.update1 (L, R, K);
            Tot.update1 (L, R, K);
        }
        else if (typ == 2) {
            ll L, R, K;
            cin >> L >> R >> K;
            ST.update1 (L, R, -K);
            ST.update2 (L, R, 0);
//            cout <<i<<" typ2 :"<<ST.get(3, 3)<<"\n";
        }
        else {
            ll pos, X;
            cin >> pos >> X;
            ll idx = Tot.get (pos, pos) - ST.get (pos, pos) + X;
//            cout << i<<": "<<idx<<" "<<Tot.get (pos, pos)<<" "<<ST.get (pos, pos) <<"\n";
            q3[pos].push_back({idx, numq3++, i});
        }
    }
    vector<int> Ans(numq3);
    BIT.init(Q + 1);
    rep (i, 1, n) {
        iter (&id, q1[i]) {
            BIT.update (id.se, id.fs);
        }
        iter (&id, q3[i]) {
            int pos; {
                int lf = 1, rt = id.id;
                while (lf < rt) {
                    int mid = lf + rt >> 1;
                    if (BIT.get(mid) >= id.idx) rt = mid;
                    else lf = mid + 1;
                }
                pos = lf;
            }
//            cout << id.id<<":"<<pos<<" "<<BIT.get(pos) <<"\n";
            if (BIT.get (pos) >= id.idx) Ans[id.pos] = color[pos];
            else Ans[id.pos] = 0;
        }
    }
    iter (&id, Ans) cout << id <<"\n";
}



#define file(name) freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout);

int main () {
//    file("c");
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ll num_Test = 1;
//    cin >> num_Test;
    while(num_Test--)
        solution();
}
/*
18 3
2 5
6 21
13 19
9 17
14 17
19 20
2 16
2 10
9 14
19 20
14 16
1 3
17 19
14 21
18 19
4 7
5 12
1 13

*/

Compilation message

foodcourt.cpp: In member function 'void Segment_Tree_Beats::build(int, int, int)':
foodcourt.cpp:68:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   68 |         int mid = l + r >> 1;
      |                   ~~^~~
foodcourt.cpp: In member function 'void Segment_Tree_Beats::down(int, int, int)':
foodcourt.cpp:74:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   74 |         int mid = l + r >> 1;
      |                   ~~^~~
foodcourt.cpp: In member function 'void Segment_Tree_Beats::update1(int, int, int, int, int, long long int)':
foodcourt.cpp:99:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   99 |         int mid = l + r >> 1;
      |                   ~~^~~
foodcourt.cpp: In member function 'void Segment_Tree_Beats::update2(int, int, int, int, int, long long int)':
foodcourt.cpp:114:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  114 |         int mid = l + r >> 1;
      |                   ~~^~~
foodcourt.cpp: In member function 'long long int Segment_Tree_Beats::get(int, int, int, int, int)':
foodcourt.cpp:125:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  125 |         int mid = l + r >> 1;
      |                   ~~^~~
foodcourt.cpp: In function 'void solution()':
foodcourt.cpp:198:34: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  198 |                     int mid = lf + rt >> 1;
      |                               ~~~^~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 74328 KB Output is correct
2 Correct 15 ms 74328 KB Output is correct
3 Correct 15 ms 74280 KB Output is correct
4 Correct 14 ms 74404 KB Output is correct
5 Correct 12 ms 74332 KB Output is correct
6 Correct 13 ms 74332 KB Output is correct
7 Correct 14 ms 74400 KB Output is correct
8 Correct 14 ms 74332 KB Output is correct
9 Correct 15 ms 74332 KB Output is correct
10 Correct 14 ms 74264 KB Output is correct
11 Correct 14 ms 74244 KB Output is correct
12 Correct 14 ms 74328 KB Output is correct
13 Correct 13 ms 74332 KB Output is correct
14 Correct 13 ms 74436 KB Output is correct
15 Correct 13 ms 74332 KB Output is correct
16 Correct 14 ms 74328 KB Output is correct
17 Correct 14 ms 74220 KB Output is correct
18 Correct 15 ms 74332 KB Output is correct
19 Correct 14 ms 74332 KB Output is correct
20 Correct 14 ms 74328 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 74328 KB Output is correct
2 Correct 15 ms 74328 KB Output is correct
3 Correct 15 ms 74280 KB Output is correct
4 Correct 14 ms 74404 KB Output is correct
5 Correct 12 ms 74332 KB Output is correct
6 Correct 13 ms 74332 KB Output is correct
7 Correct 14 ms 74400 KB Output is correct
8 Correct 14 ms 74332 KB Output is correct
9 Correct 15 ms 74332 KB Output is correct
10 Correct 14 ms 74264 KB Output is correct
11 Correct 14 ms 74244 KB Output is correct
12 Correct 14 ms 74328 KB Output is correct
13 Correct 13 ms 74332 KB Output is correct
14 Correct 13 ms 74436 KB Output is correct
15 Correct 13 ms 74332 KB Output is correct
16 Correct 14 ms 74328 KB Output is correct
17 Correct 14 ms 74220 KB Output is correct
18 Correct 15 ms 74332 KB Output is correct
19 Correct 14 ms 74332 KB Output is correct
20 Correct 14 ms 74328 KB Output is correct
21 Correct 15 ms 74388 KB Output is correct
22 Correct 14 ms 74332 KB Output is correct
23 Correct 14 ms 74332 KB Output is correct
24 Correct 14 ms 74296 KB Output is correct
25 Correct 13 ms 74260 KB Output is correct
26 Correct 13 ms 74328 KB Output is correct
27 Correct 14 ms 74332 KB Output is correct
28 Correct 14 ms 74332 KB Output is correct
29 Correct 14 ms 74412 KB Output is correct
30 Correct 14 ms 74332 KB Output is correct
31 Correct 14 ms 74532 KB Output is correct
32 Correct 15 ms 74296 KB Output is correct
33 Correct 13 ms 74332 KB Output is correct
34 Correct 13 ms 74332 KB Output is correct
35 Correct 14 ms 74332 KB Output is correct
36 Correct 14 ms 74268 KB Output is correct
37 Correct 14 ms 74376 KB Output is correct
38 Correct 14 ms 74248 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 76432 KB Output is correct
2 Correct 130 ms 76624 KB Output is correct
3 Correct 125 ms 76440 KB Output is correct
4 Correct 124 ms 76332 KB Output is correct
5 Correct 122 ms 76940 KB Output is correct
6 Correct 119 ms 76592 KB Output is correct
7 Correct 29 ms 75640 KB Output is correct
8 Correct 35 ms 75812 KB Output is correct
9 Correct 106 ms 76368 KB Output is correct
10 Correct 111 ms 76372 KB Output is correct
11 Correct 123 ms 76368 KB Output is correct
12 Correct 120 ms 76368 KB Output is correct
13 Correct 114 ms 76612 KB Output is correct
14 Correct 113 ms 76928 KB Output is correct
15 Correct 115 ms 77340 KB Output is correct
16 Correct 119 ms 77396 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 72 ms 150428 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 74328 KB Output is correct
2 Correct 15 ms 74328 KB Output is correct
3 Correct 15 ms 74280 KB Output is correct
4 Correct 14 ms 74404 KB Output is correct
5 Correct 12 ms 74332 KB Output is correct
6 Correct 13 ms 74332 KB Output is correct
7 Correct 14 ms 74400 KB Output is correct
8 Correct 14 ms 74332 KB Output is correct
9 Correct 15 ms 74332 KB Output is correct
10 Correct 14 ms 74264 KB Output is correct
11 Correct 14 ms 74244 KB Output is correct
12 Correct 14 ms 74328 KB Output is correct
13 Correct 13 ms 74332 KB Output is correct
14 Correct 13 ms 74436 KB Output is correct
15 Correct 13 ms 74332 KB Output is correct
16 Correct 14 ms 74328 KB Output is correct
17 Correct 14 ms 74220 KB Output is correct
18 Correct 15 ms 74332 KB Output is correct
19 Correct 14 ms 74332 KB Output is correct
20 Correct 14 ms 74328 KB Output is correct
21 Correct 122 ms 76432 KB Output is correct
22 Correct 130 ms 76624 KB Output is correct
23 Correct 125 ms 76440 KB Output is correct
24 Correct 124 ms 76332 KB Output is correct
25 Correct 122 ms 76940 KB Output is correct
26 Correct 119 ms 76592 KB Output is correct
27 Correct 29 ms 75640 KB Output is correct
28 Correct 35 ms 75812 KB Output is correct
29 Correct 106 ms 76368 KB Output is correct
30 Correct 111 ms 76372 KB Output is correct
31 Correct 123 ms 76368 KB Output is correct
32 Correct 120 ms 76368 KB Output is correct
33 Correct 114 ms 76612 KB Output is correct
34 Correct 113 ms 76928 KB Output is correct
35 Correct 115 ms 77340 KB Output is correct
36 Correct 119 ms 77396 KB Output is correct
37 Correct 103 ms 76116 KB Output is correct
38 Correct 92 ms 76368 KB Output is correct
39 Correct 26 ms 75412 KB Output is correct
40 Correct 29 ms 75844 KB Output is correct
41 Correct 124 ms 76428 KB Output is correct
42 Correct 116 ms 76372 KB Output is correct
43 Correct 121 ms 76436 KB Output is correct
44 Correct 119 ms 76372 KB Output is correct
45 Correct 110 ms 76272 KB Output is correct
46 Correct 118 ms 76372 KB Output is correct
47 Correct 62 ms 75952 KB Output is correct
48 Correct 101 ms 76484 KB Output is correct
49 Correct 98 ms 75808 KB Output is correct
50 Correct 123 ms 76116 KB Output is correct
51 Correct 134 ms 76372 KB Output is correct
52 Correct 135 ms 76380 KB Output is correct
53 Correct 129 ms 76812 KB Output is correct
54 Correct 119 ms 77396 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 78420 KB Output is correct
2 Correct 124 ms 78936 KB Output is correct
3 Correct 121 ms 79016 KB Output is correct
4 Correct 93 ms 77724 KB Output is correct
5 Correct 103 ms 78420 KB Output is correct
6 Correct 134 ms 79112 KB Output is correct
7 Correct 37 ms 77848 KB Output is correct
8 Correct 36 ms 77240 KB Output is correct
9 Correct 64 ms 78276 KB Output is correct
10 Correct 80 ms 77652 KB Output is correct
11 Correct 105 ms 78676 KB Output is correct
12 Correct 102 ms 78744 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 74328 KB Output is correct
2 Correct 15 ms 74328 KB Output is correct
3 Correct 15 ms 74280 KB Output is correct
4 Correct 14 ms 74404 KB Output is correct
5 Correct 12 ms 74332 KB Output is correct
6 Correct 13 ms 74332 KB Output is correct
7 Correct 14 ms 74400 KB Output is correct
8 Correct 14 ms 74332 KB Output is correct
9 Correct 15 ms 74332 KB Output is correct
10 Correct 14 ms 74264 KB Output is correct
11 Correct 14 ms 74244 KB Output is correct
12 Correct 14 ms 74328 KB Output is correct
13 Correct 13 ms 74332 KB Output is correct
14 Correct 13 ms 74436 KB Output is correct
15 Correct 13 ms 74332 KB Output is correct
16 Correct 14 ms 74328 KB Output is correct
17 Correct 14 ms 74220 KB Output is correct
18 Correct 15 ms 74332 KB Output is correct
19 Correct 14 ms 74332 KB Output is correct
20 Correct 14 ms 74328 KB Output is correct
21 Correct 15 ms 74388 KB Output is correct
22 Correct 14 ms 74332 KB Output is correct
23 Correct 14 ms 74332 KB Output is correct
24 Correct 14 ms 74296 KB Output is correct
25 Correct 13 ms 74260 KB Output is correct
26 Correct 13 ms 74328 KB Output is correct
27 Correct 14 ms 74332 KB Output is correct
28 Correct 14 ms 74332 KB Output is correct
29 Correct 14 ms 74412 KB Output is correct
30 Correct 14 ms 74332 KB Output is correct
31 Correct 14 ms 74532 KB Output is correct
32 Correct 15 ms 74296 KB Output is correct
33 Correct 13 ms 74332 KB Output is correct
34 Correct 13 ms 74332 KB Output is correct
35 Correct 14 ms 74332 KB Output is correct
36 Correct 14 ms 74268 KB Output is correct
37 Correct 14 ms 74376 KB Output is correct
38 Correct 14 ms 74248 KB Output is correct
39 Correct 122 ms 76432 KB Output is correct
40 Correct 130 ms 76624 KB Output is correct
41 Correct 125 ms 76440 KB Output is correct
42 Correct 124 ms 76332 KB Output is correct
43 Correct 122 ms 76940 KB Output is correct
44 Correct 119 ms 76592 KB Output is correct
45 Correct 29 ms 75640 KB Output is correct
46 Correct 35 ms 75812 KB Output is correct
47 Correct 106 ms 76368 KB Output is correct
48 Correct 111 ms 76372 KB Output is correct
49 Correct 123 ms 76368 KB Output is correct
50 Correct 120 ms 76368 KB Output is correct
51 Correct 114 ms 76612 KB Output is correct
52 Correct 113 ms 76928 KB Output is correct
53 Correct 115 ms 77340 KB Output is correct
54 Correct 119 ms 77396 KB Output is correct
55 Correct 103 ms 76116 KB Output is correct
56 Correct 92 ms 76368 KB Output is correct
57 Correct 26 ms 75412 KB Output is correct
58 Correct 29 ms 75844 KB Output is correct
59 Correct 124 ms 76428 KB Output is correct
60 Correct 116 ms 76372 KB Output is correct
61 Correct 121 ms 76436 KB Output is correct
62 Correct 119 ms 76372 KB Output is correct
63 Correct 110 ms 76272 KB Output is correct
64 Correct 118 ms 76372 KB Output is correct
65 Correct 62 ms 75952 KB Output is correct
66 Correct 101 ms 76484 KB Output is correct
67 Correct 98 ms 75808 KB Output is correct
68 Correct 123 ms 76116 KB Output is correct
69 Correct 134 ms 76372 KB Output is correct
70 Correct 135 ms 76380 KB Output is correct
71 Correct 129 ms 76812 KB Output is correct
72 Correct 119 ms 77396 KB Output is correct
73 Correct 109 ms 78420 KB Output is correct
74 Correct 124 ms 78936 KB Output is correct
75 Correct 121 ms 79016 KB Output is correct
76 Correct 93 ms 77724 KB Output is correct
77 Correct 103 ms 78420 KB Output is correct
78 Correct 134 ms 79112 KB Output is correct
79 Correct 37 ms 77848 KB Output is correct
80 Correct 36 ms 77240 KB Output is correct
81 Correct 64 ms 78276 KB Output is correct
82 Correct 80 ms 77652 KB Output is correct
83 Correct 105 ms 78676 KB Output is correct
84 Correct 102 ms 78744 KB Output is correct
85 Correct 112 ms 77648 KB Output is correct
86 Correct 111 ms 78096 KB Output is correct
87 Correct 117 ms 78032 KB Output is correct
88 Correct 125 ms 78376 KB Output is correct
89 Correct 82 ms 76852 KB Output is correct
90 Correct 105 ms 77908 KB Output is correct
91 Correct 106 ms 77440 KB Output is correct
92 Correct 93 ms 77136 KB Output is correct
93 Correct 120 ms 77892 KB Output is correct
94 Correct 120 ms 77904 KB Output is correct
95 Correct 125 ms 77880 KB Output is correct
96 Correct 117 ms 78016 KB Output is correct
97 Correct 133 ms 77908 KB Output is correct
98 Correct 111 ms 77372 KB Output is correct
99 Correct 67 ms 77352 KB Output is correct
100 Correct 82 ms 77200 KB Output is correct
101 Correct 95 ms 77776 KB Output is correct
102 Correct 104 ms 78676 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 74328 KB Output is correct
2 Correct 15 ms 74328 KB Output is correct
3 Correct 15 ms 74280 KB Output is correct
4 Correct 14 ms 74404 KB Output is correct
5 Correct 12 ms 74332 KB Output is correct
6 Correct 13 ms 74332 KB Output is correct
7 Correct 14 ms 74400 KB Output is correct
8 Correct 14 ms 74332 KB Output is correct
9 Correct 15 ms 74332 KB Output is correct
10 Correct 14 ms 74264 KB Output is correct
11 Correct 14 ms 74244 KB Output is correct
12 Correct 14 ms 74328 KB Output is correct
13 Correct 13 ms 74332 KB Output is correct
14 Correct 13 ms 74436 KB Output is correct
15 Correct 13 ms 74332 KB Output is correct
16 Correct 14 ms 74328 KB Output is correct
17 Correct 14 ms 74220 KB Output is correct
18 Correct 15 ms 74332 KB Output is correct
19 Correct 14 ms 74332 KB Output is correct
20 Correct 14 ms 74328 KB Output is correct
21 Correct 15 ms 74388 KB Output is correct
22 Correct 14 ms 74332 KB Output is correct
23 Correct 14 ms 74332 KB Output is correct
24 Correct 14 ms 74296 KB Output is correct
25 Correct 13 ms 74260 KB Output is correct
26 Correct 13 ms 74328 KB Output is correct
27 Correct 14 ms 74332 KB Output is correct
28 Correct 14 ms 74332 KB Output is correct
29 Correct 14 ms 74412 KB Output is correct
30 Correct 14 ms 74332 KB Output is correct
31 Correct 14 ms 74532 KB Output is correct
32 Correct 15 ms 74296 KB Output is correct
33 Correct 13 ms 74332 KB Output is correct
34 Correct 13 ms 74332 KB Output is correct
35 Correct 14 ms 74332 KB Output is correct
36 Correct 14 ms 74268 KB Output is correct
37 Correct 14 ms 74376 KB Output is correct
38 Correct 14 ms 74248 KB Output is correct
39 Correct 122 ms 76432 KB Output is correct
40 Correct 130 ms 76624 KB Output is correct
41 Correct 125 ms 76440 KB Output is correct
42 Correct 124 ms 76332 KB Output is correct
43 Correct 122 ms 76940 KB Output is correct
44 Correct 119 ms 76592 KB Output is correct
45 Correct 29 ms 75640 KB Output is correct
46 Correct 35 ms 75812 KB Output is correct
47 Correct 106 ms 76368 KB Output is correct
48 Correct 111 ms 76372 KB Output is correct
49 Correct 123 ms 76368 KB Output is correct
50 Correct 120 ms 76368 KB Output is correct
51 Correct 114 ms 76612 KB Output is correct
52 Correct 113 ms 76928 KB Output is correct
53 Correct 115 ms 77340 KB Output is correct
54 Correct 119 ms 77396 KB Output is correct
55 Runtime error 72 ms 150428 KB Execution killed with signal 11
56 Halted 0 ms 0 KB -