oj.uz

답안 #998473

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
998473 2024-06-14T03:37:09 Z cpptowin Fuel Station (NOI20_fuelstation) C++17
100 / 100
 328 ms 61676 KB 
#include <bits/stdc++.h>
#define fo(i, d, c) for (int i = d; i <= c; i++)
#define fod(i, c, d) for (int i = c; i >= d; i--)
#define maxn 1000010
#define N 1010
#define fi first
#define se second
#define pb emplace_back
#define en cout << "\n";
#define int long long
#define inf (int)1e18
#define pii pair<int, int>
#define vii vector<pii>
#define lb(x) x & -x
#define bit(i, j) ((i >> j) & 1)
#define offbit(i, j) (i ^ (1LL << j))
#define onbit(i, j) (i | (1LL << j))
#define vi vector<int>
#define all(x) x.begin(), x.end()
template <typename T1, typename T2>
bool minimize(T1 &a, T2 b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2>
bool maximize(T1 &a, T2 b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}
using namespace std;
const int nsqrt = 450;
const int mod = 1e9 + 7;
struct SegmentTree
{
    vector<int> st, lazy;
    int n;
    /// real n
    SegmentTree(int _n = 0) : n(_n)
    {
        st.resize(4 * n + 10);
        lazy.resize(4 * n + 10);
    }
    void resize(int _n)
    {
        n = _n;
        st.resize(4 * n + 10);
        lazy.resize(4 * n + 10);
    }
    void down(int id, int l, int r)
    {
        st[id << 1] += lazy[id];
        lazy[id << 1] += lazy[id];
        st[id << 1 | 1] += lazy[id];
        lazy[id << 1 | 1] += lazy[id];
        lazy[id] = 0;
    }

    void update(int id, int l, int r, int u, int v, int val)
    {
        if (u > r || l > v)
            return;
        if (u <= l && r <= v)
        {
            st[id] += val;
            lazy[id] += val;
            return;
        }
        down(id, l, r);
        int mid = (l + r) >> 1;
        update(id << 1, l, mid, u, v, val);
        update(id << 1 | 1, mid + 1, r, u, v, val);
        st[id] = max(st[id << 1], st[id << 1 | 1]);
    }

    int get(int id, int l, int r, int u, int v)
    {
        if (l > v || u > r)
            return -inf;
        if (u <= l && r <= v)
            return st[id];
        down(id, l, r);
        int mid = (l + r) >> 1;
        return max(get(id << 1, l, mid, u, v), get(id << 1 | 1, mid + 1, r, u, v));
    }
    int walkright(int id, int l, int r, int x, int val)
    {
        if (st[id] <= val)
            return -1;
        if (r < x)
            return -1;
        if (l == r)
            return l;
        int ans = -1;
        int mid = (l + r) >> 1;
        if (st[id << 1] > val)
            ans = walkright(id << 1, l, mid, x, val);
        if (ans == -1)
            ans = walkright(id << 1 | 1, mid + 1, r, x, val);
        return ans;
    }
    int walkleft(int id, int l, int r, int x, int val)
    {
        if (st[id] <= val)
            return -1;
        if (x < l)
            return -1;
        if (l == r)
            return l;
        int ans = -1;
        int mid = (l + r) >> 1;
        if (st[id << 1 | 1] > val)
            ans = walkleft(id << 1 | 1, mid + 1, r, x, val);
        if (ans == -1)
            ans = walkleft(id << 1, l, mid, x, val);
        return ans;
    }
    int get(int l, int r)
    {
        return get(1, 1, n, l, r);
    }
    void update(int l, int r, int val)
    {
        update(1, 1, n, l, r, val);
    }
};
int n;
vii ke[maxn];
vi nen;
array<int,3> a[maxn];
main()
{
#define name "TASK"
    if (fopen(name ".inp", "r"))
    {
        freopen(name ".inp", "r", stdin);
        freopen(name ".out", "w", stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int d;
    cin >> n >> d;
    fo(i, 1, n)
    {
        cin >> a[i][0] >> a[i][1] >> a[i][2];
        nen.pb(a[i][0]);
    }
    nen.pb(d);
    sort(all(nen));
    nen.erase(unique(all(nen)),nen.end());
    int sz = (int)nen.size();
    SegmentTree st(sz);
    fo(i,1,sz) st.update(i,i,nen[i - 1]);
    fo(i,1,n) a[i][0] = lower_bound(all(nen),a[i][0]) - nen.begin() + 1;
    sort(a + 1,a + n + 1,[](array<int,3> a,array<int,3> b)
    {
        return a[2] > b[2] or (a[2] == b[2] and a[0] > b[0]);
    });
    int ans = d;
    fo(i,1,n)
    {
        st.update(a[i][0] + 1,sz,-a[i][1]);
        if(max(st.get(1,sz),0LL) <= a[i][2]) minimize(ans,max(st.get(1,sz),0LL)); 
    }
    cout << ans;
}

Compilation message

FuelStation.cpp:140:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  140 | main()
      | ^~~~
FuelStation.cpp: In function 'int main()':
FuelStation.cpp:145:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  145 |         freopen(name ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
FuelStation.cpp:146:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  146 |         freopen(name ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 24664 KB Output is correct
2 Correct 9 ms 24664 KB Output is correct
3 Correct 8 ms 24668 KB Output is correct
4 Correct 9 ms 24668 KB Output is correct
5 Correct 8 ms 24492 KB Output is correct
6 Correct 9 ms 24664 KB Output is correct
7 Correct 9 ms 24668 KB Output is correct
8 Correct 8 ms 24668 KB Output is correct
9 Correct 8 ms 24664 KB Output is correct
10 Correct 8 ms 24668 KB Output is correct
11 Correct 9 ms 24668 KB Output is correct
12 Correct 9 ms 24668 KB Output is correct
13 Correct 9 ms 24688 KB Output is correct
14 Correct 9 ms 24668 KB Output is correct
15 Correct 9 ms 24668 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 185 ms 43080 KB Output is correct
2 Correct 164 ms 43152 KB Output is correct
3 Correct 162 ms 43204 KB Output is correct
4 Correct 133 ms 42440 KB Output is correct
5 Correct 174 ms 42952 KB Output is correct
6 Correct 157 ms 42596 KB Output is correct
7 Correct 160 ms 42428 KB Output is correct
8 Correct 135 ms 42440 KB Output is correct
9 Correct 177 ms 43852 KB Output is correct
10 Correct 151 ms 41924 KB Output is correct
11 Correct 161 ms 42484 KB Output is correct
12 Correct 131 ms 42372 KB Output is correct
13 Correct 160 ms 42436 KB Output is correct
14 Correct 160 ms 43136 KB Output is correct
15 Correct 153 ms 42436 KB Output is correct
16 Correct 164 ms 43708 KB Output is correct
17 Correct 134 ms 43200 KB Output is correct
18 Correct 177 ms 43140 KB Output is correct
19 Correct 130 ms 42444 KB Output is correct
20 Correct 162 ms 43256 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 24668 KB Output is correct
2 Correct 11 ms 25180 KB Output is correct
3 Correct 15 ms 25688 KB Output is correct
4 Correct 15 ms 25904 KB Output is correct
5 Correct 15 ms 25816 KB Output is correct
6 Correct 16 ms 25692 KB Output is correct
7 Correct 16 ms 25692 KB Output is correct
8 Correct 8 ms 24464 KB Output is correct
9 Correct 11 ms 24536 KB Output is correct
10 Correct 8 ms 24668 KB Output is correct
11 Correct 9 ms 24688 KB Output is correct
12 Correct 9 ms 24668 KB Output is correct
13 Correct 9 ms 24668 KB Output is correct
14 Correct 14 ms 25100 KB Output is correct
15 Correct 13 ms 25180 KB Output is correct
16 Correct 15 ms 25180 KB Output is correct
17 Correct 14 ms 25436 KB Output is correct
18 Correct 14 ms 25436 KB Output is correct
19 Correct 12 ms 25180 KB Output is correct
20 Correct 13 ms 25328 KB Output is correct
21 Correct 13 ms 25248 KB Output is correct
22 Correct 16 ms 25176 KB Output is correct
23 Correct 14 ms 25120 KB Output is correct
24 Correct 17 ms 25176 KB Output is correct
25 Correct 14 ms 25180 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 24668 KB Output is correct
2 Correct 11 ms 25180 KB Output is correct
3 Correct 15 ms 25688 KB Output is correct
4 Correct 15 ms 25904 KB Output is correct
5 Correct 15 ms 25816 KB Output is correct
6 Correct 16 ms 25692 KB Output is correct
7 Correct 16 ms 25692 KB Output is correct
8 Correct 8 ms 24464 KB Output is correct
9 Correct 11 ms 24536 KB Output is correct
10 Correct 8 ms 24668 KB Output is correct
11 Correct 9 ms 24688 KB Output is correct
12 Correct 9 ms 24668 KB Output is correct
13 Correct 9 ms 24668 KB Output is correct
14 Correct 14 ms 25100 KB Output is correct
15 Correct 13 ms 25180 KB Output is correct
16 Correct 15 ms 25180 KB Output is correct
17 Correct 14 ms 25436 KB Output is correct
18 Correct 14 ms 25436 KB Output is correct
19 Correct 12 ms 25180 KB Output is correct
20 Correct 13 ms 25328 KB Output is correct
21 Correct 13 ms 25248 KB Output is correct
22 Correct 16 ms 25176 KB Output is correct
23 Correct 14 ms 25120 KB Output is correct
24 Correct 17 ms 25176 KB Output is correct
25 Correct 14 ms 25180 KB Output is correct
26 Correct 8 ms 24920 KB Output is correct
27 Correct 133 ms 38960 KB Output is correct
28 Correct 156 ms 38600 KB Output is correct
29 Correct 159 ms 38344 KB Output is correct
30 Correct 158 ms 38600 KB Output is correct
31 Correct 153 ms 38860 KB Output is correct
32 Correct 151 ms 38580 KB Output is correct
33 Correct 9 ms 24664 KB Output is correct
34 Correct 10 ms 24940 KB Output is correct
35 Correct 9 ms 24664 KB Output is correct
36 Correct 13 ms 24452 KB Output is correct
37 Correct 13 ms 24668 KB Output is correct
38 Correct 11 ms 24640 KB Output is correct
39 Correct 130 ms 38944 KB Output is correct
40 Correct 139 ms 38856 KB Output is correct
41 Correct 137 ms 38860 KB Output is correct
42 Correct 131 ms 38852 KB Output is correct
43 Correct 154 ms 38856 KB Output is correct
44 Correct 142 ms 38280 KB Output is correct
45 Correct 143 ms 38152 KB Output is correct
46 Correct 134 ms 38852 KB Output is correct
47 Correct 127 ms 40132 KB Output is correct
48 Correct 122 ms 40132 KB Output is correct
49 Correct 141 ms 38348 KB Output is correct
50 Correct 130 ms 38596 KB Output is correct
51 Correct 132 ms 38592 KB Output is correct
52 Correct 137 ms 38412 KB Output is correct

Subtask #5
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 24664 KB Output is correct
2 Correct 9 ms 24664 KB Output is correct
3 Correct 8 ms 24668 KB Output is correct
4 Correct 9 ms 24668 KB Output is correct
5 Correct 8 ms 24492 KB Output is correct
6 Correct 9 ms 24664 KB Output is correct
7 Correct 9 ms 24668 KB Output is correct
8 Correct 8 ms 24668 KB Output is correct
9 Correct 8 ms 24664 KB Output is correct
10 Correct 8 ms 24668 KB Output is correct
11 Correct 9 ms 24668 KB Output is correct
12 Correct 9 ms 24668 KB Output is correct
13 Correct 9 ms 24688 KB Output is correct
14 Correct 9 ms 24668 KB Output is correct
15 Correct 9 ms 24668 KB Output is correct
16 Correct 9 ms 24668 KB Output is correct
17 Correct 9 ms 24668 KB Output is correct
18 Correct 8 ms 24636 KB Output is correct
19 Correct 8 ms 24664 KB Output is correct
20 Correct 8 ms 24600 KB Output is correct
21 Correct 8 ms 24532 KB Output is correct
22 Correct 8 ms 24668 KB Output is correct
23 Correct 8 ms 24668 KB Output is correct
24 Correct 8 ms 24668 KB Output is correct
25 Correct 8 ms 24676 KB Output is correct
26 Correct 8 ms 24552 KB Output is correct
27 Correct 9 ms 24668 KB Output is correct
28 Correct 8 ms 24664 KB Output is correct
29 Correct 7 ms 24668 KB Output is correct
30 Correct 9 ms 24668 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 24664 KB Output is correct
2 Correct 9 ms 24664 KB Output is correct
3 Correct 8 ms 24668 KB Output is correct
4 Correct 9 ms 24668 KB Output is correct
5 Correct 8 ms 24492 KB Output is correct
6 Correct 9 ms 24664 KB Output is correct
7 Correct 9 ms 24668 KB Output is correct
8 Correct 8 ms 24668 KB Output is correct
9 Correct 8 ms 24664 KB Output is correct
10 Correct 8 ms 24668 KB Output is correct
11 Correct 9 ms 24668 KB Output is correct
12 Correct 9 ms 24668 KB Output is correct
13 Correct 9 ms 24688 KB Output is correct
14 Correct 9 ms 24668 KB Output is correct
15 Correct 9 ms 24668 KB Output is correct
16 Correct 10 ms 24668 KB Output is correct
17 Correct 11 ms 25180 KB Output is correct
18 Correct 15 ms 25688 KB Output is correct
19 Correct 15 ms 25904 KB Output is correct
20 Correct 15 ms 25816 KB Output is correct
21 Correct 16 ms 25692 KB Output is correct
22 Correct 16 ms 25692 KB Output is correct
23 Correct 8 ms 24464 KB Output is correct
24 Correct 11 ms 24536 KB Output is correct
25 Correct 8 ms 24668 KB Output is correct
26 Correct 9 ms 24688 KB Output is correct
27 Correct 9 ms 24668 KB Output is correct
28 Correct 9 ms 24668 KB Output is correct
29 Correct 14 ms 25100 KB Output is correct
30 Correct 13 ms 25180 KB Output is correct
31 Correct 15 ms 25180 KB Output is correct
32 Correct 14 ms 25436 KB Output is correct
33 Correct 14 ms 25436 KB Output is correct
34 Correct 12 ms 25180 KB Output is correct
35 Correct 13 ms 25328 KB Output is correct
36 Correct 13 ms 25248 KB Output is correct
37 Correct 16 ms 25176 KB Output is correct
38 Correct 14 ms 25120 KB Output is correct
39 Correct 17 ms 25176 KB Output is correct
40 Correct 14 ms 25180 KB Output is correct
41 Correct 10 ms 24668 KB Output is correct
42 Correct 13 ms 25180 KB Output is correct
43 Correct 14 ms 25976 KB Output is correct
44 Correct 15 ms 25948 KB Output is correct
45 Correct 17 ms 25944 KB Output is correct
46 Correct 16 ms 26052 KB Output is correct
47 Correct 16 ms 25948 KB Output is correct
48 Correct 9 ms 24676 KB Output is correct
49 Correct 10 ms 24668 KB Output is correct
50 Correct 9 ms 24668 KB Output is correct
51 Correct 9 ms 24668 KB Output is correct
52 Correct 8 ms 24668 KB Output is correct
53 Correct 8 ms 24668 KB Output is correct
54 Correct 15 ms 25848 KB Output is correct
55 Correct 16 ms 25944 KB Output is correct
56 Correct 16 ms 25948 KB Output is correct
57 Correct 15 ms 25896 KB Output is correct
58 Correct 15 ms 25948 KB Output is correct
59 Correct 12 ms 25208 KB Output is correct
60 Correct 14 ms 25444 KB Output is correct
61 Correct 16 ms 25348 KB Output is correct
62 Correct 12 ms 25180 KB Output is correct
63 Correct 13 ms 25180 KB Output is correct
64 Correct 14 ms 25180 KB Output is correct
65 Correct 12 ms 25364 KB Output is correct

Subtask #7
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 24664 KB Output is correct
2 Correct 9 ms 24664 KB Output is correct
3 Correct 8 ms 24668 KB Output is correct
4 Correct 9 ms 24668 KB Output is correct
5 Correct 8 ms 24492 KB Output is correct
6 Correct 9 ms 24664 KB Output is correct
7 Correct 9 ms 24668 KB Output is correct
8 Correct 8 ms 24668 KB Output is correct
9 Correct 8 ms 24664 KB Output is correct
10 Correct 8 ms 24668 KB Output is correct
11 Correct 9 ms 24668 KB Output is correct
12 Correct 9 ms 24668 KB Output is correct
13 Correct 9 ms 24688 KB Output is correct
14 Correct 9 ms 24668 KB Output is correct
15 Correct 9 ms 24668 KB Output is correct
16 Correct 185 ms 43080 KB Output is correct
17 Correct 164 ms 43152 KB Output is correct
18 Correct 162 ms 43204 KB Output is correct
19 Correct 133 ms 42440 KB Output is correct
20 Correct 174 ms 42952 KB Output is correct
21 Correct 157 ms 42596 KB Output is correct
22 Correct 160 ms 42428 KB Output is correct
23 Correct 135 ms 42440 KB Output is correct
24 Correct 177 ms 43852 KB Output is correct
25 Correct 151 ms 41924 KB Output is correct
26 Correct 161 ms 42484 KB Output is correct
27 Correct 131 ms 42372 KB Output is correct
28 Correct 160 ms 42436 KB Output is correct
29 Correct 160 ms 43136 KB Output is correct
30 Correct 153 ms 42436 KB Output is correct
31 Correct 164 ms 43708 KB Output is correct
32 Correct 134 ms 43200 KB Output is correct
33 Correct 177 ms 43140 KB Output is correct
34 Correct 130 ms 42444 KB Output is correct
35 Correct 162 ms 43256 KB Output is correct
36 Correct 10 ms 24668 KB Output is correct
37 Correct 11 ms 25180 KB Output is correct
38 Correct 15 ms 25688 KB Output is correct
39 Correct 15 ms 25904 KB Output is correct
40 Correct 15 ms 25816 KB Output is correct
41 Correct 16 ms 25692 KB Output is correct
42 Correct 16 ms 25692 KB Output is correct
43 Correct 8 ms 24464 KB Output is correct
44 Correct 11 ms 24536 KB Output is correct
45 Correct 8 ms 24668 KB Output is correct
46 Correct 9 ms 24688 KB Output is correct
47 Correct 9 ms 24668 KB Output is correct
48 Correct 9 ms 24668 KB Output is correct
49 Correct 14 ms 25100 KB Output is correct
50 Correct 13 ms 25180 KB Output is correct
51 Correct 15 ms 25180 KB Output is correct
52 Correct 14 ms 25436 KB Output is correct
53 Correct 14 ms 25436 KB Output is correct
54 Correct 12 ms 25180 KB Output is correct
55 Correct 13 ms 25328 KB Output is correct
56 Correct 13 ms 25248 KB Output is correct
57 Correct 16 ms 25176 KB Output is correct
58 Correct 14 ms 25120 KB Output is correct
59 Correct 17 ms 25176 KB Output is correct
60 Correct 14 ms 25180 KB Output is correct
61 Correct 8 ms 24920 KB Output is correct
62 Correct 133 ms 38960 KB Output is correct
63 Correct 156 ms 38600 KB Output is correct
64 Correct 159 ms 38344 KB Output is correct
65 Correct 158 ms 38600 KB Output is correct
66 Correct 153 ms 38860 KB Output is correct
67 Correct 151 ms 38580 KB Output is correct
68 Correct 9 ms 24664 KB Output is correct
69 Correct 10 ms 24940 KB Output is correct
70 Correct 9 ms 24664 KB Output is correct
71 Correct 13 ms 24452 KB Output is correct
72 Correct 13 ms 24668 KB Output is correct
73 Correct 11 ms 24640 KB Output is correct
74 Correct 130 ms 38944 KB Output is correct
75 Correct 139 ms 38856 KB Output is correct
76 Correct 137 ms 38860 KB Output is correct
77 Correct 131 ms 38852 KB Output is correct
78 Correct 154 ms 38856 KB Output is correct
79 Correct 142 ms 38280 KB Output is correct
80 Correct 143 ms 38152 KB Output is correct
81 Correct 134 ms 38852 KB Output is correct
82 Correct 127 ms 40132 KB Output is correct
83 Correct 122 ms 40132 KB Output is correct
84 Correct 141 ms 38348 KB Output is correct
85 Correct 130 ms 38596 KB Output is correct
86 Correct 132 ms 38592 KB Output is correct
87 Correct 137 ms 38412 KB Output is correct
88 Correct 9 ms 24668 KB Output is correct
89 Correct 9 ms 24668 KB Output is correct
90 Correct 8 ms 24636 KB Output is correct
91 Correct 8 ms 24664 KB Output is correct
92 Correct 8 ms 24600 KB Output is correct
93 Correct 8 ms 24532 KB Output is correct
94 Correct 8 ms 24668 KB Output is correct
95 Correct 8 ms 24668 KB Output is correct
96 Correct 8 ms 24668 KB Output is correct
97 Correct 8 ms 24676 KB Output is correct
98 Correct 8 ms 24552 KB Output is correct
99 Correct 9 ms 24668 KB Output is correct
100 Correct 8 ms 24664 KB Output is correct
101 Correct 7 ms 24668 KB Output is correct
102 Correct 9 ms 24668 KB Output is correct
103 Correct 10 ms 24668 KB Output is correct
104 Correct 13 ms 25180 KB Output is correct
105 Correct 14 ms 25976 KB Output is correct
106 Correct 15 ms 25948 KB Output is correct
107 Correct 17 ms 25944 KB Output is correct
108 Correct 16 ms 26052 KB Output is correct
109 Correct 16 ms 25948 KB Output is correct
110 Correct 9 ms 24676 KB Output is correct
111 Correct 10 ms 24668 KB Output is correct
112 Correct 9 ms 24668 KB Output is correct
113 Correct 9 ms 24668 KB Output is correct
114 Correct 8 ms 24668 KB Output is correct
115 Correct 8 ms 24668 KB Output is correct
116 Correct 15 ms 25848 KB Output is correct
117 Correct 16 ms 25944 KB Output is correct
118 Correct 16 ms 25948 KB Output is correct
119 Correct 15 ms 25896 KB Output is correct
120 Correct 15 ms 25948 KB Output is correct
121 Correct 12 ms 25208 KB Output is correct
122 Correct 14 ms 25444 KB Output is correct
123 Correct 16 ms 25348 KB Output is correct
124 Correct 12 ms 25180 KB Output is correct
125 Correct 13 ms 25180 KB Output is correct
126 Correct 14 ms 25180 KB Output is correct
127 Correct 12 ms 25364 KB Output is correct
128 Correct 8 ms 24668 KB Output is correct
129 Correct 175 ms 42308 KB Output is correct
130 Correct 296 ms 60864 KB Output is correct
131 Correct 291 ms 61628 KB Output is correct
132 Correct 280 ms 60860 KB Output is correct
133 Correct 281 ms 60912 KB Output is correct
134 Correct 293 ms 61628 KB Output is correct
135 Correct 9 ms 24664 KB Output is correct
136 Correct 8 ms 24664 KB Output is correct
137 Correct 8 ms 24668 KB Output is correct
138 Correct 13 ms 24668 KB Output is correct
139 Correct 11 ms 24668 KB Output is correct
140 Correct 9 ms 24688 KB Output is correct
141 Correct 283 ms 61588 KB Output is correct
142 Correct 284 ms 61376 KB Output is correct
143 Correct 276 ms 61532 KB Output is correct
144 Correct 275 ms 61676 KB Output is correct
145 Correct 328 ms 61632 KB Output is correct
146 Correct 263 ms 59068 KB Output is correct
147 Correct 264 ms 59964 KB Output is correct
148 Correct 287 ms 59408 KB Output is correct
149 Correct 178 ms 42928 KB Output is correct
150 Correct 135 ms 42432 KB Output is correct
151 Correct 138 ms 42444 KB Output is correct
152 Correct 177 ms 42684 KB Output is correct
153 Correct 156 ms 42184 KB Output is correct
154 Correct 147 ms 42224 KB Output is correct
155 Correct 181 ms 42944 KB Output is correct