oj.uz

Submission #1039989

# Submission time Handle Problem Language Result Execution time Memory
1039989 2024-07-31T13:28:49 Z underwaterkillerwhale Fuel Station (NOI20_fuelstation) C++17
100 / 100
 433 ms 50352 KB 
#include <bits/stdc++.h>
#define se              second
#define fs              first
#define mp              make_pair
#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 =3e5 + 7;
const int Mod = 1e9 + 7;
const int szBL = 240;
const int INF = 2e9;
const int BASE = 137;

struct Segment_Tree {
    struct Node {
        ll sum, pre;
    };
    int m;
    Node st[N << 2];

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

    Node mer (Node lf, Node rt) {
        Node cur;
        cur.pre = min(lf.pre, lf.sum + rt.pre);
        cur.sum = lf.sum + rt.sum;
        return cur;
    }

    void update (int id, int l, int r, int pos, ll val) {
        if (l > pos || r < pos) return;
        if (l == r) {
            st[id].sum += val;
            st[id].pre = min (0LL, st[id].sum);
            return;
        }
        int mid = l + r >> 1;
        update (id << 1, l, mid, pos, val);
        update (id << 1 | 1, mid + 1, r, pos, val);
        st[id] = mer(st[id << 1], st[id << 1 | 1]);
//        cout << l <<" "<<r<<" "<<st[id].mn <<" "<<pos<<" "<<val<<"\n";
    }
    void update (int pos, ll val) {
        update (1, 1, m, pos, val);
    }
    Node get (int id, int l, int r, int u, int v) {
        if (l > v || r < u) return {0, 0};
        if (l >= u && r <= v) {
            return st[id];
        }
        int mid = l + r >> 1;
//        cout << l <<" "<<r<<" "<<mer(get (id << 1, l, mid, u, v), get (id << 1 | 1, mid + 1, r, u, v)).pre <<"\n";
        return mer(get (id << 1, l, mid, u, v), get (id << 1 | 1, mid + 1, r, u, v));
//        st[id] = mer(st[id << 1], st[id << 1 | 1]);
//        cout << l <<" "<<r<<" "<<st[id].mn <<" "<<pos<<" "<<val<<"\n";
    }

}ST;

struct Data {
    int X, a, b, id;
};

struct Data2 {
    int X, a, id;
};

int n, m, K, D;
Data a[N];
vector<Data2> events[N];
int cnt[N];

void solution () {
    cin >> n >> D;
    rep (i, 1, n) {
        cin >> a[i].X >> a[i].a >> a[i].b;
    }
    sort (a + 1, a + 1 + n, [] (Data A, Data B) { return A.X < B.X; });
    vector<int> valx;
    rep (i, 1, n) valx.push_back(a[i].X);
    sort (ALL(valx));
    valx.resize(K = unique(ALL(valx)) - valx.begin());
    rep (i, 1, n) a[i].id = lower_bound(ALL(valx), a[i].X) - valx.begin() + 1;
    vector<int> vals = {0, D};
    rep (i, 1, n) {
        vals.push_back(a[i].b);
    }
    sort (ALL(vals));
    vals.resize(m = unique(ALL(vals)) - vals.begin());
    ST.init(K + 1);
    ST.update(K + 1, -D);
    rep (i, 1, n) {
        a[i].b = lower_bound(ALL(vals), a[i].b) - vals.begin();
        events[a[i].b].push_back({a[i].X, a[i].a, a[i].id});
        if (cnt[a[i].id] == 0) {
            ST.update (a[i].id, -a[i].X);
            ST.update (a[i].id + 1, a[i].X);
        }
        cnt[a[i].id]++;
        ST.update (a[i].id + 1, a[i].a);
//        cout << a[i].id<<" "<<-a[i].X<<"\n";
//        cout << a[i].id + 1<<" "<<a[i].X<<"\n";
//        cout << a[i].id + 1<<" "<<a[i].a<<"\n";
    }
//    cout << K<<"\n";
    ll res = INF;
    rep (i, 1, m - 1) {
        if (-ST.st[1].pre <= vals[i])
            res = min(res, -ST.st[1].pre);
//        cout << vals[i]<<":"<<ST.st[1].pre <<" aaa\n";
        iter (&id, events[i]) {
            ST.update(id.id + 1, -id.a);
            --cnt[id.id];
            if (cnt[id.id] == 0) {
                ST.update (id.id, id.X);
                ST.update (id.id + 1, -id.X);
            }
        }
    }
    cout << res <<"\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();
}
/*
no bug challenge +2
more insight about dp0/1
*/

Compilation message

FuelStation.cpp: In member function 'void Segment_Tree::update(int, int, int, int, long long int)':
FuelStation.cpp:51:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   51 |         int mid = l + r >> 1;
      |                   ~~^~~
FuelStation.cpp: In member function 'Segment_Tree::Node Segment_Tree::get(int, int, int, int, int)':
FuelStation.cpp:65:21: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   65 |         int mid = l + r >> 1;
      |                   ~~^~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 119 ms 31188 KB Output is correct
2 Correct 117 ms 31044 KB Output is correct
3 Correct 125 ms 31096 KB Output is correct
4 Correct 96 ms 30608 KB Output is correct
5 Correct 96 ms 31108 KB Output is correct
6 Correct 128 ms 30528 KB Output is correct
7 Correct 116 ms 30392 KB Output is correct
8 Correct 95 ms 30588 KB Output is correct
9 Correct 118 ms 31556 KB Output is correct
10 Correct 95 ms 29968 KB Output is correct
11 Correct 114 ms 30540 KB Output is correct
12 Correct 104 ms 30544 KB Output is correct
13 Correct 114 ms 30536 KB Output is correct
14 Correct 118 ms 31048 KB Output is correct
15 Correct 100 ms 30540 KB Output is correct
16 Correct 117 ms 31812 KB Output is correct
17 Correct 107 ms 31276 KB Output is correct
18 Correct 120 ms 30944 KB Output is correct
19 Correct 98 ms 30676 KB Output is correct
20 Correct 118 ms 31048 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7512 KB Output is correct
2 Correct 6 ms 8028 KB Output is correct
3 Correct 11 ms 8540 KB Output is correct
4 Correct 12 ms 8716 KB Output is correct
5 Correct 12 ms 8540 KB Output is correct
6 Correct 13 ms 8552 KB Output is correct
7 Correct 12 ms 8756 KB Output is correct
8 Correct 3 ms 7516 KB Output is correct
9 Correct 3 ms 7512 KB Output is correct
10 Correct 3 ms 7516 KB Output is correct
11 Correct 3 ms 7520 KB Output is correct
12 Correct 3 ms 7516 KB Output is correct
13 Correct 2 ms 7516 KB Output is correct
14 Correct 7 ms 7988 KB Output is correct
15 Correct 8 ms 8028 KB Output is correct
16 Correct 8 ms 8268 KB Output is correct
17 Correct 9 ms 8284 KB Output is correct
18 Correct 10 ms 8196 KB Output is correct
19 Correct 7 ms 8028 KB Output is correct
20 Correct 5 ms 8300 KB Output is correct
21 Correct 6 ms 8280 KB Output is correct
22 Correct 5 ms 8028 KB Output is correct
23 Correct 6 ms 8028 KB Output is correct
24 Correct 6 ms 8028 KB Output is correct
25 Correct 6 ms 8028 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7512 KB Output is correct
2 Correct 6 ms 8028 KB Output is correct
3 Correct 11 ms 8540 KB Output is correct
4 Correct 12 ms 8716 KB Output is correct
5 Correct 12 ms 8540 KB Output is correct
6 Correct 13 ms 8552 KB Output is correct
7 Correct 12 ms 8756 KB Output is correct
8 Correct 3 ms 7516 KB Output is correct
9 Correct 3 ms 7512 KB Output is correct
10 Correct 3 ms 7516 KB Output is correct
11 Correct 3 ms 7520 KB Output is correct
12 Correct 3 ms 7516 KB Output is correct
13 Correct 2 ms 7516 KB Output is correct
14 Correct 7 ms 7988 KB Output is correct
15 Correct 8 ms 8028 KB Output is correct
16 Correct 8 ms 8268 KB Output is correct
17 Correct 9 ms 8284 KB Output is correct
18 Correct 10 ms 8196 KB Output is correct
19 Correct 7 ms 8028 KB Output is correct
20 Correct 5 ms 8300 KB Output is correct
21 Correct 6 ms 8280 KB Output is correct
22 Correct 5 ms 8028 KB Output is correct
23 Correct 6 ms 8028 KB Output is correct
24 Correct 6 ms 8028 KB Output is correct
25 Correct 6 ms 8028 KB Output is correct
26 Correct 3 ms 7516 KB Output is correct
27 Correct 110 ms 25392 KB Output is correct
28 Correct 129 ms 25180 KB Output is correct
29 Correct 128 ms 24676 KB Output is correct
30 Correct 125 ms 24880 KB Output is correct
31 Correct 161 ms 27096 KB Output is correct
32 Correct 142 ms 26692 KB Output is correct
33 Correct 3 ms 7516 KB Output is correct
34 Correct 2 ms 7340 KB Output is correct
35 Correct 2 ms 7516 KB Output is correct
36 Correct 3 ms 7516 KB Output is correct
37 Correct 3 ms 7516 KB Output is correct
38 Correct 2 ms 7516 KB Output is correct
39 Correct 122 ms 25020 KB Output is correct
40 Correct 122 ms 25160 KB Output is correct
41 Correct 124 ms 25156 KB Output is correct
42 Correct 119 ms 24916 KB Output is correct
43 Correct 140 ms 24896 KB Output is correct
44 Correct 122 ms 23360 KB Output is correct
45 Correct 93 ms 26024 KB Output is correct
46 Correct 120 ms 24044 KB Output is correct
47 Correct 84 ms 27980 KB Output is correct
48 Correct 89 ms 27980 KB Output is correct
49 Correct 109 ms 24824 KB Output is correct
50 Correct 98 ms 25164 KB Output is correct
51 Correct 99 ms 25412 KB Output is correct
52 Correct 97 ms 24856 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7512 KB Output is correct
2 Correct 3 ms 7516 KB Output is correct
3 Correct 3 ms 7516 KB Output is correct
4 Correct 2 ms 7516 KB Output is correct
5 Correct 3 ms 7512 KB Output is correct
6 Correct 3 ms 7516 KB Output is correct
7 Correct 2 ms 7516 KB Output is correct
8 Correct 3 ms 7516 KB Output is correct
9 Correct 5 ms 7516 KB Output is correct
10 Correct 3 ms 7516 KB Output is correct
11 Correct 3 ms 7516 KB Output is correct
12 Correct 2 ms 7516 KB Output is correct
13 Correct 3 ms 7516 KB Output is correct
14 Correct 2 ms 7516 KB Output is correct
15 Correct 2 ms 7516 KB Output is correct
16 Correct 3 ms 7516 KB Output is correct
17 Correct 2 ms 7512 KB Output is correct
18 Correct 3 ms 7516 KB Output is correct
19 Correct 3 ms 7516 KB Output is correct
20 Correct 3 ms 7516 KB Output is correct
21 Correct 4 ms 7488 KB Output is correct
22 Correct 2 ms 7516 KB Output is correct
23 Correct 2 ms 7516 KB Output is correct
24 Correct 3 ms 7516 KB Output is correct
25 Correct 3 ms 7516 KB Output is correct
26 Correct 2 ms 7516 KB Output is correct
27 Correct 3 ms 7516 KB Output is correct
28 Correct 3 ms 7516 KB Output is correct
29 Correct 2 ms 7516 KB Output is correct
30 Correct 3 ms 7516 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7512 KB Output is correct
2 Correct 3 ms 7516 KB Output is correct
3 Correct 3 ms 7516 KB Output is correct
4 Correct 2 ms 7516 KB Output is correct
5 Correct 3 ms 7512 KB Output is correct
6 Correct 3 ms 7516 KB Output is correct
7 Correct 2 ms 7516 KB Output is correct
8 Correct 3 ms 7516 KB Output is correct
9 Correct 5 ms 7516 KB Output is correct
10 Correct 3 ms 7516 KB Output is correct
11 Correct 3 ms 7516 KB Output is correct
12 Correct 2 ms 7516 KB Output is correct
13 Correct 3 ms 7516 KB Output is correct
14 Correct 2 ms 7516 KB Output is correct
15 Correct 2 ms 7516 KB Output is correct
16 Correct 3 ms 7512 KB Output is correct
17 Correct 6 ms 8028 KB Output is correct
18 Correct 11 ms 8540 KB Output is correct
19 Correct 12 ms 8716 KB Output is correct
20 Correct 12 ms 8540 KB Output is correct
21 Correct 13 ms 8552 KB Output is correct
22 Correct 12 ms 8756 KB Output is correct
23 Correct 3 ms 7516 KB Output is correct
24 Correct 3 ms 7512 KB Output is correct
25 Correct 3 ms 7516 KB Output is correct
26 Correct 3 ms 7520 KB Output is correct
27 Correct 3 ms 7516 KB Output is correct
28 Correct 2 ms 7516 KB Output is correct
29 Correct 7 ms 7988 KB Output is correct
30 Correct 8 ms 8028 KB Output is correct
31 Correct 8 ms 8268 KB Output is correct
32 Correct 9 ms 8284 KB Output is correct
33 Correct 10 ms 8196 KB Output is correct
34 Correct 7 ms 8028 KB Output is correct
35 Correct 5 ms 8300 KB Output is correct
36 Correct 6 ms 8280 KB Output is correct
37 Correct 5 ms 8028 KB Output is correct
38 Correct 6 ms 8028 KB Output is correct
39 Correct 6 ms 8028 KB Output is correct
40 Correct 6 ms 8028 KB Output is correct
41 Correct 2 ms 7512 KB Output is correct
42 Correct 5 ms 8028 KB Output is correct
43 Correct 12 ms 8796 KB Output is correct
44 Correct 11 ms 8796 KB Output is correct
45 Correct 12 ms 8928 KB Output is correct
46 Correct 13 ms 8796 KB Output is correct
47 Correct 13 ms 8932 KB Output is correct
48 Correct 3 ms 7516 KB Output is correct
49 Correct 3 ms 7516 KB Output is correct
50 Correct 3 ms 7516 KB Output is correct
51 Correct 3 ms 7516 KB Output is correct
52 Correct 3 ms 7516 KB Output is correct
53 Correct 3 ms 7516 KB Output is correct
54 Correct 12 ms 8796 KB Output is correct
55 Correct 11 ms 8936 KB Output is correct
56 Correct 12 ms 8740 KB Output is correct
57 Correct 13 ms 8792 KB Output is correct
58 Correct 13 ms 8796 KB Output is correct
59 Correct 8 ms 8556 KB Output is correct
60 Correct 7 ms 8280 KB Output is correct
61 Correct 7 ms 8284 KB Output is correct
62 Correct 6 ms 8204 KB Output is correct
63 Correct 7 ms 8024 KB Output is correct
64 Correct 7 ms 8228 KB Output is correct
65 Correct 7 ms 8040 KB Output is correct

Subtask #7
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7512 KB Output is correct
2 Correct 3 ms 7516 KB Output is correct
3 Correct 3 ms 7516 KB Output is correct
4 Correct 2 ms 7516 KB Output is correct
5 Correct 3 ms 7512 KB Output is correct
6 Correct 3 ms 7516 KB Output is correct
7 Correct 2 ms 7516 KB Output is correct
8 Correct 3 ms 7516 KB Output is correct
9 Correct 5 ms 7516 KB Output is correct
10 Correct 3 ms 7516 KB Output is correct
11 Correct 3 ms 7516 KB Output is correct
12 Correct 2 ms 7516 KB Output is correct
13 Correct 3 ms 7516 KB Output is correct
14 Correct 2 ms 7516 KB Output is correct
15 Correct 2 ms 7516 KB Output is correct
16 Correct 119 ms 31188 KB Output is correct
17 Correct 117 ms 31044 KB Output is correct
18 Correct 125 ms 31096 KB Output is correct
19 Correct 96 ms 30608 KB Output is correct
20 Correct 96 ms 31108 KB Output is correct
21 Correct 128 ms 30528 KB Output is correct
22 Correct 116 ms 30392 KB Output is correct
23 Correct 95 ms 30588 KB Output is correct
24 Correct 118 ms 31556 KB Output is correct
25 Correct 95 ms 29968 KB Output is correct
26 Correct 114 ms 30540 KB Output is correct
27 Correct 104 ms 30544 KB Output is correct
28 Correct 114 ms 30536 KB Output is correct
29 Correct 118 ms 31048 KB Output is correct
30 Correct 100 ms 30540 KB Output is correct
31 Correct 117 ms 31812 KB Output is correct
32 Correct 107 ms 31276 KB Output is correct
33 Correct 120 ms 30944 KB Output is correct
34 Correct 98 ms 30676 KB Output is correct
35 Correct 118 ms 31048 KB Output is correct
36 Correct 3 ms 7512 KB Output is correct
37 Correct 6 ms 8028 KB Output is correct
38 Correct 11 ms 8540 KB Output is correct
39 Correct 12 ms 8716 KB Output is correct
40 Correct 12 ms 8540 KB Output is correct
41 Correct 13 ms 8552 KB Output is correct
42 Correct 12 ms 8756 KB Output is correct
43 Correct 3 ms 7516 KB Output is correct
44 Correct 3 ms 7512 KB Output is correct
45 Correct 3 ms 7516 KB Output is correct
46 Correct 3 ms 7520 KB Output is correct
47 Correct 3 ms 7516 KB Output is correct
48 Correct 2 ms 7516 KB Output is correct
49 Correct 7 ms 7988 KB Output is correct
50 Correct 8 ms 8028 KB Output is correct
51 Correct 8 ms 8268 KB Output is correct
52 Correct 9 ms 8284 KB Output is correct
53 Correct 10 ms 8196 KB Output is correct
54 Correct 7 ms 8028 KB Output is correct
55 Correct 5 ms 8300 KB Output is correct
56 Correct 6 ms 8280 KB Output is correct
57 Correct 5 ms 8028 KB Output is correct
58 Correct 6 ms 8028 KB Output is correct
59 Correct 6 ms 8028 KB Output is correct
60 Correct 6 ms 8028 KB Output is correct
61 Correct 3 ms 7516 KB Output is correct
62 Correct 110 ms 25392 KB Output is correct
63 Correct 129 ms 25180 KB Output is correct
64 Correct 128 ms 24676 KB Output is correct
65 Correct 125 ms 24880 KB Output is correct
66 Correct 161 ms 27096 KB Output is correct
67 Correct 142 ms 26692 KB Output is correct
68 Correct 3 ms 7516 KB Output is correct
69 Correct 2 ms 7340 KB Output is correct
70 Correct 2 ms 7516 KB Output is correct
71 Correct 3 ms 7516 KB Output is correct
72 Correct 3 ms 7516 KB Output is correct
73 Correct 2 ms 7516 KB Output is correct
74 Correct 122 ms 25020 KB Output is correct
75 Correct 122 ms 25160 KB Output is correct
76 Correct 124 ms 25156 KB Output is correct
77 Correct 119 ms 24916 KB Output is correct
78 Correct 140 ms 24896 KB Output is correct
79 Correct 122 ms 23360 KB Output is correct
80 Correct 93 ms 26024 KB Output is correct
81 Correct 120 ms 24044 KB Output is correct
82 Correct 84 ms 27980 KB Output is correct
83 Correct 89 ms 27980 KB Output is correct
84 Correct 109 ms 24824 KB Output is correct
85 Correct 98 ms 25164 KB Output is correct
86 Correct 99 ms 25412 KB Output is correct
87 Correct 97 ms 24856 KB Output is correct
88 Correct 3 ms 7516 KB Output is correct
89 Correct 2 ms 7512 KB Output is correct
90 Correct 3 ms 7516 KB Output is correct
91 Correct 3 ms 7516 KB Output is correct
92 Correct 3 ms 7516 KB Output is correct
93 Correct 4 ms 7488 KB Output is correct
94 Correct 2 ms 7516 KB Output is correct
95 Correct 2 ms 7516 KB Output is correct
96 Correct 3 ms 7516 KB Output is correct
97 Correct 3 ms 7516 KB Output is correct
98 Correct 2 ms 7516 KB Output is correct
99 Correct 3 ms 7516 KB Output is correct
100 Correct 3 ms 7516 KB Output is correct
101 Correct 2 ms 7516 KB Output is correct
102 Correct 3 ms 7516 KB Output is correct
103 Correct 2 ms 7512 KB Output is correct
104 Correct 5 ms 8028 KB Output is correct
105 Correct 12 ms 8796 KB Output is correct
106 Correct 11 ms 8796 KB Output is correct
107 Correct 12 ms 8928 KB Output is correct
108 Correct 13 ms 8796 KB Output is correct
109 Correct 13 ms 8932 KB Output is correct
110 Correct 3 ms 7516 KB Output is correct
111 Correct 3 ms 7516 KB Output is correct
112 Correct 3 ms 7516 KB Output is correct
113 Correct 3 ms 7516 KB Output is correct
114 Correct 3 ms 7516 KB Output is correct
115 Correct 3 ms 7516 KB Output is correct
116 Correct 12 ms 8796 KB Output is correct
117 Correct 11 ms 8936 KB Output is correct
118 Correct 12 ms 8740 KB Output is correct
119 Correct 13 ms 8792 KB Output is correct
120 Correct 13 ms 8796 KB Output is correct
121 Correct 8 ms 8556 KB Output is correct
122 Correct 7 ms 8280 KB Output is correct
123 Correct 7 ms 8284 KB Output is correct
124 Correct 6 ms 8204 KB Output is correct
125 Correct 7 ms 8024 KB Output is correct
126 Correct 7 ms 8228 KB Output is correct
127 Correct 7 ms 8040 KB Output is correct
128 Correct 3 ms 7512 KB Output is correct
129 Correct 168 ms 27944 KB Output is correct
130 Correct 404 ms 49676 KB Output is correct
131 Correct 398 ms 50244 KB Output is correct
132 Correct 402 ms 49644 KB Output is correct
133 Correct 411 ms 49480 KB Output is correct
134 Correct 405 ms 50044 KB Output is correct
135 Correct 3 ms 7512 KB Output is correct
136 Correct 3 ms 7528 KB Output is correct
137 Correct 2 ms 7516 KB Output is correct
138 Correct 2 ms 7516 KB Output is correct
139 Correct 2 ms 7516 KB Output is correct
140 Correct 3 ms 7516 KB Output is correct
141 Correct 433 ms 50352 KB Output is correct
142 Correct 410 ms 49908 KB Output is correct
143 Correct 412 ms 50196 KB Output is correct
144 Correct 405 ms 50232 KB Output is correct
145 Correct 399 ms 50248 KB Output is correct
146 Correct 374 ms 48200 KB Output is correct
147 Correct 369 ms 48968 KB Output is correct
148 Correct 394 ms 48612 KB Output is correct
149 Correct 168 ms 28748 KB Output is correct
150 Correct 93 ms 30528 KB Output is correct
151 Correct 94 ms 30536 KB Output is correct
152 Correct 146 ms 29932 KB Output is correct
153 Correct 142 ms 27976 KB Output is correct
154 Correct 113 ms 29272 KB Output is correct
155 Correct 165 ms 28740 KB Output is correct