oj.uz

답안 #287798

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
287798 2020-09-01T01:12:26 Z Haunted_Cpp Fuel Station (NOI20_fuelstation) C++17
100 / 100
 926 ms 89548 KB 
    /**
     *  author: Haunted_Cpp
    **/
     
    #include <bits/stdc++.h>
    using namespace std;
     
    #pragma GCC optimize("Ofast")
    #pragma GCC target("fma,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
    #pragma GCC optimize("unroll-loops")
     
    template<typename T> ostream &operator << (ostream &os, const vector<T> &v) { os << '{'; string sep; for (const auto &x : v) os << sep << x, sep = ", "; return os << '}'; }
    template<typename T, size_t size> ostream &operator << (ostream &os, const array<T, size> &arr) { os << '{'; string sep; for (const auto &x : arr) os << sep << x, sep = ", "; return os << '}'; }
    template<typename A, typename B> ostream &operator << (ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
     
    void debug_out() { cerr << endl; }
    template<typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << ' ' << H; debug_out(T...); }
     
    #ifdef LOCAL
    #define debug(...) cerr << "(" << #__VA_ARGS__ << "):", debug_out(__VA_ARGS__)
    #else
    #define debug(...) 47
    #endif
     
    class SegmentTree {
    private:
      struct Node {
        long long prefix, sum, best;
        Node () {
          prefix = sum = best = 1e9;
        }
        void merge(Node l, Node r) {
          prefix = min(l.prefix, l.sum + r.prefix);
          sum = l.sum + r.sum;
          best = min({l.best, prefix});
        }
      };
      vector<Node> seg;
      const int LO, HI;
      void build(int l, int r, int node, const vector<int> &arr) {
        if (l == r) {
          seg[node].prefix = seg[node].sum = seg[node].best = arr[l];
          return;
        }
        const int mid = l + (r - l) / 2;
        build(l, mid, 2 * node + 1, arr);
        build(mid + 1, r, 2 * node + 2, arr);
        seg[node].merge(seg[2 * node + 1], seg[2 * node + 2]);
      }
      void modify(int where, int delta, int l, int r, int node) {
        if (l > where || r < where) return;
        if (l >= where && r <= where) {
          seg[node].prefix = seg[node].sum = seg[node].best = delta;
          return;
        }
        const int mid = l + (r - l) / 2;
        modify(where, delta, l, mid, 2 * node + 1);
        modify(where, delta, mid + 1, r, 2 * node + 2);
        seg[node].merge(seg[2 * node + 1], seg[2 * node + 2]);
      }
    public:
      SegmentTree(const vector<int> &arr) : LO(0), HI((int)arr.size() - 1) {
        seg.clear();
        seg.resize(4 * (int) arr.size());
        build(LO, HI, 0, arr);
      }
      void modify(int where, int delta) {
        modify(where, delta, LO, HI, 0);
      }
      long long worst_prefix() {
        return seg[0].best;
      } 
    };
     
    int main () {
      ios::sync_with_stdio(0);
      cin.tie(0);
      int n, d;
      cin >> n >> d;
      vector<tuple<int, int, int>> arr(n);
      vector<pair<int, int>> top_up;
      vector<int> distancias;
      for (int i = 0; i < n; i++) {
        int x, a, b;
        cin >> x >> a >> b;
        arr[i] = make_tuple(x, a, b);
        distancias.emplace_back(x);
        distancias.emplace_back(a);
        distancias.emplace_back(b);
        distancias.emplace_back(d - a);
        distancias.emplace_back(d - b);
      }
      sort(arr.begin(), arr.end());
      for (int i = 0; i < n; i++) top_up.emplace_back(get<2>(arr[i]), i);
      sort(top_up.begin(), top_up.end());
      vector<int> pre = {0};
      vector<int> where_is_it(n);
      long long s = 0;
      for (int i = 0; i < n; i++) {
        int dist = get<0>(arr[i]) - (i - 1 < 0 ? 0 : get<0>(arr[i - 1]));
        s += dist;
        distancias.emplace_back(max(0, dist - get<1>(arr[i - 1])));
        distancias.emplace_back(s);
        distancias.emplace_back(dist);
        pre.emplace_back(-dist);
        where_is_it[i] = pre.size();
        pre.emplace_back(get<1>(arr[i]));
      }
      distancias.emplace_back(d - get<0>(arr.back()));
      pre.emplace_back(-d + get<0>(arr.back()));
      distancias.emplace_back(d);
      sort(distancias.begin(), distancias.end());
      distancias.erase(unique(distancias.begin(), distancias.end()), distancias.end());
      SegmentTree seg(pre);
      int rem = 0;
      for (auto cur : distancias) {
        debug("TEST: ", cur);
        while(rem < n && get<0>(top_up[rem]) < cur) {
          const int where = where_is_it[get<1>(top_up[rem])];
          seg.modify(where, 0);
          ++rem;
        }
        seg.modify(0, cur);
        if (seg.worst_prefix() >= 0) {
          cout << cur << '\n';
          return 0;
        }
      }
      cout << "NO SOLUTION" << '\n';
      return 0;
    }

Compilation message

FuelStation.cpp: In function 'int main()':
FuelStation.cpp:22:24: warning: statement has no effect [-Wunused-value]
   22 |     #define debug(...) 47
      |                        ^~
FuelStation.cpp:117:9: note: in expansion of macro 'debug'
  117 |         debug("TEST: ", cur);
      |         ^~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 376 ms 89064 KB Output is correct
2 Correct 370 ms 88900 KB Output is correct
3 Correct 447 ms 88900 KB Output is correct
4 Correct 363 ms 88932 KB Output is correct
5 Correct 416 ms 89548 KB Output is correct
6 Correct 398 ms 88352 KB Output is correct
7 Correct 396 ms 88396 KB Output is correct
8 Correct 425 ms 88900 KB Output is correct
9 Correct 404 ms 89544 KB Output is correct
10 Correct 394 ms 88408 KB Output is correct
11 Correct 399 ms 88344 KB Output is correct
12 Correct 362 ms 88940 KB Output is correct
13 Correct 387 ms 88260 KB Output is correct
14 Correct 374 ms 89028 KB Output is correct
15 Correct 378 ms 88900 KB Output is correct
16 Correct 385 ms 89544 KB Output is correct
17 Correct 366 ms 89548 KB Output is correct
18 Correct 381 ms 88900 KB Output is correct
19 Correct 374 ms 89016 KB Output is correct
20 Correct 374 ms 88900 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 13 ms 3192 KB Output is correct
3 Correct 12 ms 3192 KB Output is correct
4 Correct 11 ms 3192 KB Output is correct
5 Correct 12 ms 3192 KB Output is correct
6 Correct 12 ms 3192 KB Output is correct
7 Correct 12 ms 3192 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 16 ms 3192 KB Output is correct
15 Correct 17 ms 3192 KB Output is correct
16 Correct 18 ms 3192 KB Output is correct
17 Correct 16 ms 3192 KB Output is correct
18 Correct 16 ms 3192 KB Output is correct
19 Correct 12 ms 3192 KB Output is correct
20 Correct 11 ms 3192 KB Output is correct
21 Correct 11 ms 3192 KB Output is correct
22 Correct 12 ms 3320 KB Output is correct
23 Correct 11 ms 3192 KB Output is correct
24 Correct 13 ms 3192 KB Output is correct
25 Correct 12 ms 3320 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 13 ms 3192 KB Output is correct
3 Correct 12 ms 3192 KB Output is correct
4 Correct 11 ms 3192 KB Output is correct
5 Correct 12 ms 3192 KB Output is correct
6 Correct 12 ms 3192 KB Output is correct
7 Correct 12 ms 3192 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 16 ms 3192 KB Output is correct
15 Correct 17 ms 3192 KB Output is correct
16 Correct 18 ms 3192 KB Output is correct
17 Correct 16 ms 3192 KB Output is correct
18 Correct 16 ms 3192 KB Output is correct
19 Correct 12 ms 3192 KB Output is correct
20 Correct 11 ms 3192 KB Output is correct
21 Correct 11 ms 3192 KB Output is correct
22 Correct 12 ms 3320 KB Output is correct
23 Correct 11 ms 3192 KB Output is correct
24 Correct 13 ms 3192 KB Output is correct
25 Correct 12 ms 3320 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 369 ms 84804 KB Output is correct
28 Correct 366 ms 84676 KB Output is correct
29 Correct 369 ms 84424 KB Output is correct
30 Correct 365 ms 84548 KB Output is correct
31 Correct 387 ms 84804 KB Output is correct
32 Correct 368 ms 84644 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 552 ms 84828 KB Output is correct
40 Correct 562 ms 84804 KB Output is correct
41 Correct 565 ms 84936 KB Output is correct
42 Correct 581 ms 84888 KB Output is correct
43 Correct 564 ms 84804 KB Output is correct
44 Correct 424 ms 84544 KB Output is correct
45 Correct 416 ms 83908 KB Output is correct
46 Correct 377 ms 84932 KB Output is correct
47 Correct 332 ms 86340 KB Output is correct
48 Correct 337 ms 86340 KB Output is correct
49 Correct 357 ms 84164 KB Output is correct
50 Correct 380 ms 84548 KB Output is correct
51 Correct 374 ms 84676 KB Output is correct
52 Correct 354 ms 84288 KB Output is correct

Subtask #5
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 288 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 512 KB Output is correct
30 Correct 1 ms 384 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 288 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 13 ms 3192 KB Output is correct
18 Correct 12 ms 3192 KB Output is correct
19 Correct 11 ms 3192 KB Output is correct
20 Correct 12 ms 3192 KB Output is correct
21 Correct 12 ms 3192 KB Output is correct
22 Correct 12 ms 3192 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 16 ms 3192 KB Output is correct
30 Correct 17 ms 3192 KB Output is correct
31 Correct 18 ms 3192 KB Output is correct
32 Correct 16 ms 3192 KB Output is correct
33 Correct 16 ms 3192 KB Output is correct
34 Correct 12 ms 3192 KB Output is correct
35 Correct 11 ms 3192 KB Output is correct
36 Correct 11 ms 3192 KB Output is correct
37 Correct 12 ms 3320 KB Output is correct
38 Correct 11 ms 3192 KB Output is correct
39 Correct 13 ms 3192 KB Output is correct
40 Correct 12 ms 3320 KB Output is correct
41 Correct 1 ms 384 KB Output is correct
42 Correct 13 ms 3192 KB Output is correct
43 Correct 14 ms 3236 KB Output is correct
44 Correct 15 ms 3320 KB Output is correct
45 Correct 15 ms 3320 KB Output is correct
46 Correct 15 ms 3320 KB Output is correct
47 Correct 15 ms 3320 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 1 ms 384 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 1 ms 384 KB Output is correct
52 Correct 1 ms 384 KB Output is correct
53 Correct 1 ms 384 KB Output is correct
54 Correct 23 ms 3320 KB Output is correct
55 Correct 21 ms 3448 KB Output is correct
56 Correct 24 ms 3320 KB Output is correct
57 Correct 22 ms 3320 KB Output is correct
58 Correct 21 ms 3320 KB Output is correct
59 Correct 18 ms 3320 KB Output is correct
60 Correct 12 ms 3320 KB Output is correct
61 Correct 12 ms 3320 KB Output is correct
62 Correct 15 ms 3320 KB Output is correct
63 Correct 15 ms 3320 KB Output is correct
64 Correct 16 ms 3320 KB Output is correct
65 Correct 14 ms 3192 KB Output is correct

Subtask #7
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 288 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 376 ms 89064 KB Output is correct
17 Correct 370 ms 88900 KB Output is correct
18 Correct 447 ms 88900 KB Output is correct
19 Correct 363 ms 88932 KB Output is correct
20 Correct 416 ms 89548 KB Output is correct
21 Correct 398 ms 88352 KB Output is correct
22 Correct 396 ms 88396 KB Output is correct
23 Correct 425 ms 88900 KB Output is correct
24 Correct 404 ms 89544 KB Output is correct
25 Correct 394 ms 88408 KB Output is correct
26 Correct 399 ms 88344 KB Output is correct
27 Correct 362 ms 88940 KB Output is correct
28 Correct 387 ms 88260 KB Output is correct
29 Correct 374 ms 89028 KB Output is correct
30 Correct 378 ms 88900 KB Output is correct
31 Correct 385 ms 89544 KB Output is correct
32 Correct 366 ms 89548 KB Output is correct
33 Correct 381 ms 88900 KB Output is correct
34 Correct 374 ms 89016 KB Output is correct
35 Correct 374 ms 88900 KB Output is correct
36 Correct 0 ms 384 KB Output is correct
37 Correct 13 ms 3192 KB Output is correct
38 Correct 12 ms 3192 KB Output is correct
39 Correct 11 ms 3192 KB Output is correct
40 Correct 12 ms 3192 KB Output is correct
41 Correct 12 ms 3192 KB Output is correct
42 Correct 12 ms 3192 KB Output is correct
43 Correct 1 ms 384 KB Output is correct
44 Correct 1 ms 384 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 384 KB Output is correct
48 Correct 1 ms 384 KB Output is correct
49 Correct 16 ms 3192 KB Output is correct
50 Correct 17 ms 3192 KB Output is correct
51 Correct 18 ms 3192 KB Output is correct
52 Correct 16 ms 3192 KB Output is correct
53 Correct 16 ms 3192 KB Output is correct
54 Correct 12 ms 3192 KB Output is correct
55 Correct 11 ms 3192 KB Output is correct
56 Correct 11 ms 3192 KB Output is correct
57 Correct 12 ms 3320 KB Output is correct
58 Correct 11 ms 3192 KB Output is correct
59 Correct 13 ms 3192 KB Output is correct
60 Correct 12 ms 3320 KB Output is correct
61 Correct 0 ms 384 KB Output is correct
62 Correct 369 ms 84804 KB Output is correct
63 Correct 366 ms 84676 KB Output is correct
64 Correct 369 ms 84424 KB Output is correct
65 Correct 365 ms 84548 KB Output is correct
66 Correct 387 ms 84804 KB Output is correct
67 Correct 368 ms 84644 KB Output is correct
68 Correct 1 ms 384 KB Output is correct
69 Correct 0 ms 384 KB Output is correct
70 Correct 1 ms 384 KB Output is correct
71 Correct 1 ms 384 KB Output is correct
72 Correct 1 ms 384 KB Output is correct
73 Correct 1 ms 384 KB Output is correct
74 Correct 552 ms 84828 KB Output is correct
75 Correct 562 ms 84804 KB Output is correct
76 Correct 565 ms 84936 KB Output is correct
77 Correct 581 ms 84888 KB Output is correct
78 Correct 564 ms 84804 KB Output is correct
79 Correct 424 ms 84544 KB Output is correct
80 Correct 416 ms 83908 KB Output is correct
81 Correct 377 ms 84932 KB Output is correct
82 Correct 332 ms 86340 KB Output is correct
83 Correct 337 ms 86340 KB Output is correct
84 Correct 357 ms 84164 KB Output is correct
85 Correct 380 ms 84548 KB Output is correct
86 Correct 374 ms 84676 KB Output is correct
87 Correct 354 ms 84288 KB Output is correct
88 Correct 0 ms 384 KB Output is correct
89 Correct 0 ms 384 KB Output is correct
90 Correct 0 ms 384 KB Output is correct
91 Correct 1 ms 384 KB Output is correct
92 Correct 0 ms 384 KB Output is correct
93 Correct 1 ms 384 KB Output is correct
94 Correct 1 ms 384 KB Output is correct
95 Correct 0 ms 384 KB Output is correct
96 Correct 1 ms 384 KB Output is correct
97 Correct 0 ms 384 KB Output is correct
98 Correct 1 ms 384 KB Output is correct
99 Correct 1 ms 384 KB Output is correct
100 Correct 1 ms 384 KB Output is correct
101 Correct 1 ms 512 KB Output is correct
102 Correct 1 ms 384 KB Output is correct
103 Correct 1 ms 384 KB Output is correct
104 Correct 13 ms 3192 KB Output is correct
105 Correct 14 ms 3236 KB Output is correct
106 Correct 15 ms 3320 KB Output is correct
107 Correct 15 ms 3320 KB Output is correct
108 Correct 15 ms 3320 KB Output is correct
109 Correct 15 ms 3320 KB Output is correct
110 Correct 1 ms 384 KB Output is correct
111 Correct 1 ms 384 KB Output is correct
112 Correct 1 ms 384 KB Output is correct
113 Correct 1 ms 384 KB Output is correct
114 Correct 1 ms 384 KB Output is correct
115 Correct 1 ms 384 KB Output is correct
116 Correct 23 ms 3320 KB Output is correct
117 Correct 21 ms 3448 KB Output is correct
118 Correct 24 ms 3320 KB Output is correct
119 Correct 22 ms 3320 KB Output is correct
120 Correct 21 ms 3320 KB Output is correct
121 Correct 18 ms 3320 KB Output is correct
122 Correct 12 ms 3320 KB Output is correct
123 Correct 12 ms 3320 KB Output is correct
124 Correct 15 ms 3320 KB Output is correct
125 Correct 15 ms 3320 KB Output is correct
126 Correct 16 ms 3320 KB Output is correct
127 Correct 14 ms 3192 KB Output is correct
128 Correct 1 ms 384 KB Output is correct
129 Correct 443 ms 88004 KB Output is correct
130 Correct 460 ms 88560 KB Output is correct
131 Correct 477 ms 89432 KB Output is correct
132 Correct 452 ms 88640 KB Output is correct
133 Correct 460 ms 88644 KB Output is correct
134 Correct 458 ms 89412 KB Output is correct
135 Correct 1 ms 384 KB Output is correct
136 Correct 1 ms 384 KB Output is correct
137 Correct 0 ms 384 KB Output is correct
138 Correct 1 ms 384 KB Output is correct
139 Correct 0 ms 384 KB Output is correct
140 Correct 1 ms 384 KB Output is correct
141 Correct 906 ms 89268 KB Output is correct
142 Correct 883 ms 88900 KB Output is correct
143 Correct 770 ms 89396 KB Output is correct
144 Correct 885 ms 89156 KB Output is correct
145 Correct 926 ms 89284 KB Output is correct
146 Correct 715 ms 87620 KB Output is correct
147 Correct 662 ms 88260 KB Output is correct
148 Correct 707 ms 87752 KB Output is correct
149 Correct 429 ms 88644 KB Output is correct
150 Correct 421 ms 88772 KB Output is correct
151 Correct 364 ms 88900 KB Output is correct
152 Correct 448 ms 88516 KB Output is correct
153 Correct 447 ms 88644 KB Output is correct
154 Correct 403 ms 88516 KB Output is correct
155 Correct 447 ms 88736 KB Output is correct