oj.uz

Submission #572599

# Submission time Handle Problem Language Result Execution time Memory
572599 2022-06-04T18:43:21 Z vovamr Segments (IZhO18_segments) C++17
100 / 100
 1857 ms 17756 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define fi first
#define se second
#define ll long long
#define ld long double
#define sz(x) ((int)(x).size())
#define all(x) 	(x).begin(), (x).end()
#define pb push_back
#define mpp make_pair
#define ve vector
using namespace std;
using namespace __gnu_pbds;
template<class T> using oset = tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;
const ll inf = 1e18; const int iinf = 1e9;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
template <typename T> inline bool chmin(T& a, T b) { return (a > b ? a = b, 1 : 0); }
template <typename T> inline bool chmax(T& a, T b) { return (a < b ? a = b, 1 : 0); }

constexpr int N = 2e5 + 100;
constexpr int b = 2500;

int n;
pii segs[N];
ve<int> s[N / b], st[N / b];
inline void reset(ve<pii> &bodek) { sort(all(bodek));
	for (int i = 0; i <= (n - 1) / b; ++i) s[i].clear(), st[i].clear();
	n = sz(bodek); int ptr = 0;
	for (auto &[r, l] : bodek) segs[ptr++] = {r, l};
	for (int i = 0; i < n; ++i) { auto &[r, l] = segs[i]; s[i / b].pb(l), st[i / b].pb(-(r - l + 1)); }
	for (int i = 0; i <= (n - 1) / b; ++i) sort(all(s[i])), sort(all(st[i]));
}
inline int cnts(int id, int x) { return upper_bound(all(s[id]), x) - s[id].begin(); }
inline int cnts1(int id, int x) { return upper_bound(all(st[id]), x) - st[id].begin(); }
inline int get1(int pos, int x) {
	int ans = 0;
	pos = lower_bound(segs, segs + n, mpp(pos, -1)) - segs;
	if (pos == n) return 0;
	int bl = pos / b;
	for (int i = bl + 1; i <= (n - 1) / b; ++i) ans += cnts(i, x);
	for (int i = pos; i < min(n, (bl + 1) * b); ++i) ans += segs[i].se <= x;
	return ans;
}
inline int get2(int l, int r, int x) {
	l = lower_bound(segs, segs + n, mpp(l, -1)) - segs;
	r = upper_bound(segs, segs + n, mpp(r, INT_MAX)) - segs - 1;
	if (l > r) return 0;
	int lb = l / b, rb = r / b;
	if (lb == rb) {
		int ans = 0;
		for (int i = l; i <= r; ++i) {
			ans += (segs[i].fi - segs[i].se + 1 >= x);
		} return ans;
	}
	int ans = 0;
	for (int i = lb + 1; i <= rb - 1; ++i) ans += cnts1(i, -x);
	for (int i = l; i < (lb + 1) * b; ++i) ans += (segs[i].fi - segs[i].se + 1 >= x);
	for (int i = r; i >= rb * b; --i) ans += (segs[i].fi - segs[i].se + 1 >= x);
	return ans;
}
inline int answer(int l, int r, int k) {
	if (r - l + 1 < k) return 0;
	int ans = 0;
	ans += get1(r + 1, r - k + 1);
	ans += get2(l + k - 1, r, k);
	return ans;
}

inline int isec(int l, int r, int l1, int r1) {
	return max(0, min(r, r1) - max(l, l1) + 1);
}

inline void solve() {
	int q, t;
	cin >> q >> t;

	int ID = 0;
	ve<int> tr(q);
	ve<array<int,4>> que(q);
	for (int i = 0; i < q; ++i) {
		int e;
		cin >> e;
		que[i][0] = e;
		if (e == 1) cin >> que[i][1] >> que[i][2], tr[ID++] = i;
		else if (e == 2) cin >> que[i][1], --que[i][1];
		else cin >> que[i][1] >> que[i][2] >> que[i][3];
	}

	int last = 0;
	ve<int> del(q), gdel(q);
	for (int l = 0; l < q; l += b) {
		ve<pii> sgs;
		int r = min(q - 1, l + b - 1);

		for (int i = 0; i <= r; ++i) if (que[i][0] == 2) del[tr[que[i][1]]] = 1;
		for (int i = 0; i < l; ++i) if (que[i][0] == 1) {
			if (!del[i]) {
				auto &[_, l, r, __] = que[i];
				sgs.pb({r, l});
			}
		}

		reset(sgs);
		for (int i = l; i <= r; ++i) {
			auto &[e, le, re, k] = que[i];
			if (e == 1 || e == 3) {
				le ^= (t * last), re ^= (t * last);
				if (le > re) swap(le, re);
			}

			if (e == 3) {
				int ans = answer(le, re, k);
				for (int j = l; j <= r; ++j) {
					auto &[E, L, R, K] = que[j];
					if (E == 1 && !del[j] && j < i) ans += isec(le, re, L, R) >= k;
					else if (E == 2) { int J = tr[L];
						if (J < i && !gdel[J]) ans += isec(le, re, que[J][1], que[J][2]) >= k;
					}
				}
				cout << (last = ans) << '\n';
//				debug();
			}
			else if (e == 2) gdel[tr[le]] = 1;
		}
	}
}

signed main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	int q = 1; // cin >> q;
	while (q--) solve();
	cerr << fixed << setprecision(3) << "Time execution: " << (double)clock() / CLOCKS_PER_SEC << endl;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 12 ms 568 KB Output is correct
4 Correct 11 ms 476 KB Output is correct
5 Correct 7 ms 604 KB Output is correct
6 Correct 8 ms 680 KB Output is correct
7 Correct 12 ms 596 KB Output is correct
8 Correct 8 ms 596 KB Output is correct
9 Correct 9 ms 596 KB Output is correct
10 Correct 4 ms 596 KB Output is correct
11 Correct 10 ms 704 KB Output is correct
12 Correct 11 ms 596 KB Output is correct
13 Correct 4 ms 596 KB Output is correct
14 Correct 9 ms 596 KB Output is correct
15 Correct 12 ms 572 KB Output is correct
16 Correct 12 ms 544 KB Output is correct
17 Correct 11 ms 588 KB Output is correct
18 Correct 5 ms 596 KB Output is correct
19 Correct 10 ms 596 KB Output is correct
20 Correct 13 ms 596 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 552 ms 6144 KB Output is correct
2 Correct 548 ms 5960 KB Output is correct
3 Correct 545 ms 6112 KB Output is correct
4 Correct 548 ms 6280 KB Output is correct
5 Correct 427 ms 7568 KB Output is correct
6 Correct 391 ms 7556 KB Output is correct
7 Correct 555 ms 6100 KB Output is correct
8 Correct 552 ms 6000 KB Output is correct
9 Correct 548 ms 6080 KB Output is correct
10 Correct 490 ms 5072 KB Output is correct
11 Correct 512 ms 5340 KB Output is correct
12 Correct 520 ms 7080 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 259 ms 3732 KB Output is correct
2 Correct 244 ms 3656 KB Output is correct
3 Correct 257 ms 3664 KB Output is correct
4 Correct 249 ms 3916 KB Output is correct
5 Correct 550 ms 7164 KB Output is correct
6 Correct 547 ms 6324 KB Output is correct
7 Correct 547 ms 7212 KB Output is correct
8 Correct 411 ms 7708 KB Output is correct
9 Correct 418 ms 7432 KB Output is correct
10 Correct 480 ms 6252 KB Output is correct
11 Correct 318 ms 3924 KB Output is correct
12 Correct 477 ms 6896 KB Output is correct
13 Correct 483 ms 6024 KB Output is correct
14 Correct 460 ms 4932 KB Output is correct
15 Correct 454 ms 4928 KB Output is correct
16 Correct 427 ms 4432 KB Output is correct
17 Correct 559 ms 5992 KB Output is correct
18 Correct 569 ms 6320 KB Output is correct
19 Correct 562 ms 5964 KB Output is correct
20 Correct 560 ms 6044 KB Output is correct
21 Correct 358 ms 3916 KB Output is correct
22 Correct 476 ms 5404 KB Output is correct
23 Correct 491 ms 5860 KB Output is correct
24 Correct 490 ms 5636 KB Output is correct
25 Correct 255 ms 3660 KB Output is correct
26 Correct 247 ms 3660 KB Output is correct
27 Correct 257 ms 3780 KB Output is correct
28 Correct 252 ms 3680 KB Output is correct
29 Correct 491 ms 6068 KB Output is correct
30 Correct 490 ms 5940 KB Output is correct
31 Correct 408 ms 7444 KB Output is correct
32 Correct 485 ms 6404 KB Output is correct
33 Correct 487 ms 6104 KB Output is correct
34 Correct 447 ms 4788 KB Output is correct
35 Correct 494 ms 5724 KB Output is correct
36 Correct 471 ms 6208 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 249 ms 3728 KB Output is correct
2 Correct 245 ms 3608 KB Output is correct
3 Correct 251 ms 3612 KB Output is correct
4 Correct 256 ms 3820 KB Output is correct
5 Correct 503 ms 7172 KB Output is correct
6 Correct 448 ms 4800 KB Output is correct
7 Correct 477 ms 7472 KB Output is correct
8 Correct 491 ms 5056 KB Output is correct
9 Correct 472 ms 5528 KB Output is correct
10 Correct 466 ms 6920 KB Output is correct
11 Correct 396 ms 4456 KB Output is correct
12 Correct 395 ms 7548 KB Output is correct
13 Correct 476 ms 6020 KB Output is correct
14 Correct 456 ms 5148 KB Output is correct
15 Correct 418 ms 7388 KB Output is correct
16 Correct 473 ms 6248 KB Output is correct
17 Correct 556 ms 5992 KB Output is correct
18 Correct 544 ms 6080 KB Output is correct
19 Correct 548 ms 5960 KB Output is correct
20 Correct 553 ms 6148 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 12 ms 568 KB Output is correct
4 Correct 11 ms 476 KB Output is correct
5 Correct 7 ms 604 KB Output is correct
6 Correct 8 ms 680 KB Output is correct
7 Correct 12 ms 596 KB Output is correct
8 Correct 8 ms 596 KB Output is correct
9 Correct 9 ms 596 KB Output is correct
10 Correct 4 ms 596 KB Output is correct
11 Correct 10 ms 704 KB Output is correct
12 Correct 11 ms 596 KB Output is correct
13 Correct 4 ms 596 KB Output is correct
14 Correct 9 ms 596 KB Output is correct
15 Correct 12 ms 572 KB Output is correct
16 Correct 12 ms 544 KB Output is correct
17 Correct 11 ms 588 KB Output is correct
18 Correct 5 ms 596 KB Output is correct
19 Correct 10 ms 596 KB Output is correct
20 Correct 13 ms 596 KB Output is correct
21 Correct 552 ms 6144 KB Output is correct
22 Correct 548 ms 5960 KB Output is correct
23 Correct 545 ms 6112 KB Output is correct
24 Correct 548 ms 6280 KB Output is correct
25 Correct 427 ms 7568 KB Output is correct
26 Correct 391 ms 7556 KB Output is correct
27 Correct 555 ms 6100 KB Output is correct
28 Correct 552 ms 6000 KB Output is correct
29 Correct 548 ms 6080 KB Output is correct
30 Correct 490 ms 5072 KB Output is correct
31 Correct 512 ms 5340 KB Output is correct
32 Correct 520 ms 7080 KB Output is correct
33 Correct 249 ms 3728 KB Output is correct
34 Correct 245 ms 3608 KB Output is correct
35 Correct 251 ms 3612 KB Output is correct
36 Correct 256 ms 3820 KB Output is correct
37 Correct 503 ms 7172 KB Output is correct
38 Correct 448 ms 4800 KB Output is correct
39 Correct 477 ms 7472 KB Output is correct
40 Correct 491 ms 5056 KB Output is correct
41 Correct 472 ms 5528 KB Output is correct
42 Correct 466 ms 6920 KB Output is correct
43 Correct 396 ms 4456 KB Output is correct
44 Correct 395 ms 7548 KB Output is correct
45 Correct 476 ms 6020 KB Output is correct
46 Correct 456 ms 5148 KB Output is correct
47 Correct 418 ms 7388 KB Output is correct
48 Correct 473 ms 6248 KB Output is correct
49 Correct 556 ms 5992 KB Output is correct
50 Correct 544 ms 6080 KB Output is correct
51 Correct 548 ms 5960 KB Output is correct
52 Correct 553 ms 6148 KB Output is correct
53 Correct 259 ms 3920 KB Output is correct
54 Correct 256 ms 3916 KB Output is correct
55 Correct 254 ms 3916 KB Output is correct
56 Correct 249 ms 3884 KB Output is correct
57 Correct 527 ms 5360 KB Output is correct
58 Correct 422 ms 4664 KB Output is correct
59 Correct 545 ms 6324 KB Output is correct
60 Correct 405 ms 4500 KB Output is correct
61 Correct 484 ms 6364 KB Output is correct
62 Correct 435 ms 7424 KB Output is correct
63 Correct 409 ms 7504 KB Output is correct
64 Correct 427 ms 7312 KB Output is correct
65 Correct 419 ms 4904 KB Output is correct
66 Correct 420 ms 4504 KB Output is correct
67 Correct 465 ms 6200 KB Output is correct
68 Correct 486 ms 5912 KB Output is correct
69 Correct 547 ms 5960 KB Output is correct
70 Correct 552 ms 6136 KB Output is correct
71 Correct 557 ms 6140 KB Output is correct
72 Correct 553 ms 6056 KB Output is correct
73 Correct 425 ms 4852 KB Output is correct
74 Correct 484 ms 5884 KB Output is correct
75 Correct 383 ms 7596 KB Output is correct
76 Correct 404 ms 7588 KB Output is correct
77 Correct 249 ms 3912 KB Output is correct
78 Correct 250 ms 4028 KB Output is correct
79 Correct 248 ms 3932 KB Output is correct
80 Correct 247 ms 3908 KB Output is correct
81 Correct 484 ms 5788 KB Output is correct
82 Correct 439 ms 4988 KB Output is correct
83 Correct 387 ms 4532 KB Output is correct
84 Correct 486 ms 5788 KB Output is correct
85 Correct 471 ms 6200 KB Output is correct
86 Correct 474 ms 6284 KB Output is correct
87 Correct 464 ms 5676 KB Output is correct
88 Correct 391 ms 4448 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 12 ms 568 KB Output is correct
4 Correct 11 ms 476 KB Output is correct
5 Correct 7 ms 604 KB Output is correct
6 Correct 8 ms 680 KB Output is correct
7 Correct 12 ms 596 KB Output is correct
8 Correct 8 ms 596 KB Output is correct
9 Correct 9 ms 596 KB Output is correct
10 Correct 4 ms 596 KB Output is correct
11 Correct 10 ms 704 KB Output is correct
12 Correct 11 ms 596 KB Output is correct
13 Correct 4 ms 596 KB Output is correct
14 Correct 9 ms 596 KB Output is correct
15 Correct 12 ms 572 KB Output is correct
16 Correct 12 ms 544 KB Output is correct
17 Correct 11 ms 588 KB Output is correct
18 Correct 5 ms 596 KB Output is correct
19 Correct 10 ms 596 KB Output is correct
20 Correct 13 ms 596 KB Output is correct
21 Correct 552 ms 6144 KB Output is correct
22 Correct 548 ms 5960 KB Output is correct
23 Correct 545 ms 6112 KB Output is correct
24 Correct 548 ms 6280 KB Output is correct
25 Correct 427 ms 7568 KB Output is correct
26 Correct 391 ms 7556 KB Output is correct
27 Correct 555 ms 6100 KB Output is correct
28 Correct 552 ms 6000 KB Output is correct
29 Correct 548 ms 6080 KB Output is correct
30 Correct 490 ms 5072 KB Output is correct
31 Correct 512 ms 5340 KB Output is correct
32 Correct 520 ms 7080 KB Output is correct
33 Correct 259 ms 3732 KB Output is correct
34 Correct 244 ms 3656 KB Output is correct
35 Correct 257 ms 3664 KB Output is correct
36 Correct 249 ms 3916 KB Output is correct
37 Correct 550 ms 7164 KB Output is correct
38 Correct 547 ms 6324 KB Output is correct
39 Correct 547 ms 7212 KB Output is correct
40 Correct 411 ms 7708 KB Output is correct
41 Correct 418 ms 7432 KB Output is correct
42 Correct 480 ms 6252 KB Output is correct
43 Correct 318 ms 3924 KB Output is correct
44 Correct 477 ms 6896 KB Output is correct
45 Correct 483 ms 6024 KB Output is correct
46 Correct 460 ms 4932 KB Output is correct
47 Correct 454 ms 4928 KB Output is correct
48 Correct 427 ms 4432 KB Output is correct
49 Correct 559 ms 5992 KB Output is correct
50 Correct 569 ms 6320 KB Output is correct
51 Correct 562 ms 5964 KB Output is correct
52 Correct 560 ms 6044 KB Output is correct
53 Correct 358 ms 3916 KB Output is correct
54 Correct 476 ms 5404 KB Output is correct
55 Correct 491 ms 5860 KB Output is correct
56 Correct 490 ms 5636 KB Output is correct
57 Correct 255 ms 3660 KB Output is correct
58 Correct 247 ms 3660 KB Output is correct
59 Correct 257 ms 3780 KB Output is correct
60 Correct 252 ms 3680 KB Output is correct
61 Correct 491 ms 6068 KB Output is correct
62 Correct 490 ms 5940 KB Output is correct
63 Correct 408 ms 7444 KB Output is correct
64 Correct 485 ms 6404 KB Output is correct
65 Correct 487 ms 6104 KB Output is correct
66 Correct 447 ms 4788 KB Output is correct
67 Correct 494 ms 5724 KB Output is correct
68 Correct 471 ms 6208 KB Output is correct
69 Correct 249 ms 3728 KB Output is correct
70 Correct 245 ms 3608 KB Output is correct
71 Correct 251 ms 3612 KB Output is correct
72 Correct 256 ms 3820 KB Output is correct
73 Correct 503 ms 7172 KB Output is correct
74 Correct 448 ms 4800 KB Output is correct
75 Correct 477 ms 7472 KB Output is correct
76 Correct 491 ms 5056 KB Output is correct
77 Correct 472 ms 5528 KB Output is correct
78 Correct 466 ms 6920 KB Output is correct
79 Correct 396 ms 4456 KB Output is correct
80 Correct 395 ms 7548 KB Output is correct
81 Correct 476 ms 6020 KB Output is correct
82 Correct 456 ms 5148 KB Output is correct
83 Correct 418 ms 7388 KB Output is correct
84 Correct 473 ms 6248 KB Output is correct
85 Correct 556 ms 5992 KB Output is correct
86 Correct 544 ms 6080 KB Output is correct
87 Correct 548 ms 5960 KB Output is correct
88 Correct 553 ms 6148 KB Output is correct
89 Correct 259 ms 3920 KB Output is correct
90 Correct 256 ms 3916 KB Output is correct
91 Correct 254 ms 3916 KB Output is correct
92 Correct 249 ms 3884 KB Output is correct
93 Correct 527 ms 5360 KB Output is correct
94 Correct 422 ms 4664 KB Output is correct
95 Correct 545 ms 6324 KB Output is correct
96 Correct 405 ms 4500 KB Output is correct
97 Correct 484 ms 6364 KB Output is correct
98 Correct 435 ms 7424 KB Output is correct
99 Correct 409 ms 7504 KB Output is correct
100 Correct 427 ms 7312 KB Output is correct
101 Correct 419 ms 4904 KB Output is correct
102 Correct 420 ms 4504 KB Output is correct
103 Correct 465 ms 6200 KB Output is correct
104 Correct 486 ms 5912 KB Output is correct
105 Correct 547 ms 5960 KB Output is correct
106 Correct 552 ms 6136 KB Output is correct
107 Correct 557 ms 6140 KB Output is correct
108 Correct 553 ms 6056 KB Output is correct
109 Correct 425 ms 4852 KB Output is correct
110 Correct 484 ms 5884 KB Output is correct
111 Correct 383 ms 7596 KB Output is correct
112 Correct 404 ms 7588 KB Output is correct
113 Correct 249 ms 3912 KB Output is correct
114 Correct 250 ms 4028 KB Output is correct
115 Correct 248 ms 3932 KB Output is correct
116 Correct 247 ms 3908 KB Output is correct
117 Correct 484 ms 5788 KB Output is correct
118 Correct 439 ms 4988 KB Output is correct
119 Correct 387 ms 4532 KB Output is correct
120 Correct 486 ms 5788 KB Output is correct
121 Correct 471 ms 6200 KB Output is correct
122 Correct 474 ms 6284 KB Output is correct
123 Correct 464 ms 5676 KB Output is correct
124 Correct 391 ms 4448 KB Output is correct
125 Correct 550 ms 6876 KB Output is correct
126 Correct 537 ms 6988 KB Output is correct
127 Correct 542 ms 6888 KB Output is correct
128 Correct 537 ms 6884 KB Output is correct
129 Correct 532 ms 6680 KB Output is correct
130 Correct 541 ms 6916 KB Output is correct
131 Correct 1078 ms 8492 KB Output is correct
132 Correct 1738 ms 10780 KB Output is correct
133 Correct 1822 ms 12036 KB Output is correct
134 Correct 1252 ms 8620 KB Output is correct
135 Correct 1857 ms 13012 KB Output is correct
136 Correct 663 ms 7788 KB Output is correct
137 Correct 1605 ms 13556 KB Output is correct
138 Correct 1604 ms 10780 KB Output is correct
139 Correct 1686 ms 12560 KB Output is correct
140 Correct 1644 ms 13128 KB Output is correct
141 Correct 1653 ms 11084 KB Output is correct
142 Correct 826 ms 7112 KB Output is correct
143 Correct 1172 ms 8464 KB Output is correct
144 Correct 746 ms 6952 KB Output is correct
145 Correct 1638 ms 12860 KB Output is correct
146 Correct 1397 ms 9564 KB Output is correct
147 Correct 1164 ms 8064 KB Output is correct
148 Correct 1126 ms 7868 KB Output is correct
149 Correct 1774 ms 10580 KB Output is correct
150 Correct 1804 ms 10588 KB Output is correct
151 Correct 1806 ms 10720 KB Output is correct
152 Correct 1792 ms 10560 KB Output is correct
153 Correct 1792 ms 10524 KB Output is correct
154 Correct 1802 ms 10572 KB Output is correct
155 Correct 982 ms 7236 KB Output is correct
156 Correct 1214 ms 8072 KB Output is correct
157 Correct 1644 ms 13092 KB Output is correct
158 Correct 1627 ms 13140 KB Output is correct
159 Correct 1658 ms 14656 KB Output is correct
160 Correct 1472 ms 13448 KB Output is correct
161 Correct 539 ms 10308 KB Output is correct
162 Correct 556 ms 10172 KB Output is correct
163 Correct 553 ms 10384 KB Output is correct
164 Correct 577 ms 10256 KB Output is correct
165 Correct 565 ms 10180 KB Output is correct
166 Correct 544 ms 10188 KB Output is correct
167 Correct 1592 ms 17660 KB Output is correct
168 Correct 1569 ms 17756 KB Output is correct
169 Correct 1646 ms 17048 KB Output is correct
170 Correct 1656 ms 16980 KB Output is correct
171 Correct 1657 ms 14860 KB Output is correct
172 Correct 1343 ms 12480 KB Output is correct
173 Correct 1629 ms 17152 KB Output is correct
174 Correct 1361 ms 12652 KB Output is correct
175 Correct 1652 ms 16052 KB Output is correct
176 Correct 1128 ms 12020 KB Output is correct
177 Correct 1607 ms 14472 KB Output is correct
178 Correct 1586 ms 14488 KB Output is correct