oj.uz

Submission #440405

# Submission time Handle Problem Language Result Execution time Memory
440405 2021-07-02T08:35:22 Z 8e7 Segments (IZhO18_segments) C++14
100 / 100
 4849 ms 26652 KB 
//Challenge: Accepted
#include <iostream>
#include <vector>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <cmath>
#include <set>
#include <utility>
#include <assert.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
void debug() {cout << endl;}
template <class T, class ...U> void debug(T a, U ... b) { cout << a << " "; debug(b...);}
template <class T> void pary(T l, T r) {
	while (l != r) {cout << *l << " ";l++;}
	cout << endl;
}
#define ll long long
#define ld long double
#define maxn 200005
#define mod 1000000007
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
const int bs = 1500;
const int maxb = maxn / bs + 5;
template<class T> using Tree = tree<T, null_type,less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
Tree<int> lef[maxb], rig[maxb];
pii seg[maxn];
vector<pii> ind[maxb]; // 
pii arr[maxb]; //current block array
int ma[maxb]; // maxsize for each block
int pos[maxn]; // index for segment with id=i
int main() {
	io
	int n, onl;
	cin >> n >> onl;
	int lastans = 0, bind = 1, bcnt = 1, siz = 0, cur = 1;
	while (n--) {
		int type;
		cin >> type;
		if (type == 1) {
			siz++;
			int l, r;
			cin >> l >> r;
			l ^= onl ? lastans : 0, r ^= onl ? lastans : 0;
			if (l > r) swap(l, r);
			int id = cur;
			cur++;
			seg[id] = {l, r};
			int len = r - l + 1;
			for (int i = 0;i < bcnt;i++) {
				if (arr[i].ff <= len || (i == 0 && len > ma[i]) || (i == bcnt - 1)) {
					if (arr[i].ss == 0) arr[i].ss = bind++;
					vector<pii> * tmp = &ind[arr[i].ss];
					tmp->insert(lower_bound(tmp->begin(), tmp->end(), make_pair(len, id), [&](pii x, pii y){return x > y;}), make_pair(len, id)); 
					pos[id] = arr[i].ss;
					lef[arr[i].ss].insert(l);
					rig[arr[i].ss].insert(r);
					arr[i].ff = tmp->back().ff;
					ma[i] = (tmp->begin())->ff;
					if (tmp->size() >= (5 * bs / 2)) { // split a block into two
						for (int j = bcnt;j > i + 1;j--) arr[j] = arr[j - 1], ma[j] = ma[j - 1]; 
						bcnt++;	
						arr[i + 1].ss = bind;
						while (tmp->size() > bs) {
							pii p = tmp->back();
							pos[p.ss] = bind;
							int prv = arr[i].ss;
							lef[prv].erase(lef[prv].upper_bound(seg[p.ss].ff));
							rig[prv].erase(rig[prv].upper_bound(seg[p.ss].ss));
							ind[bind].push_back(p);	
							lef[bind].insert(seg[p.ss].ff);
							rig[bind].insert(seg[p.ss].ss);
							tmp->pop_back();
						}
						reverse(ind[bind].begin(), ind[bind].end());
						arr[i + 1].ff = ind[bind].back().ff;
						ma[i + 1] = ind[bind][0].ff;
						arr[i].ff = ind[arr[i].ss].back().ff;
						bind++;
					}
					break;
				}
			}	
		} else if (type == 2) {
			siz--;
			int id;
			cin >> id;
			int p = pos[id];
			lef[p].erase(lef[p].upper_bound(seg[id].ff));	
			rig[p].erase(rig[p].upper_bound(seg[id].ss));
			for (int i = 0;i < ind[p].size();i++) {
				if (ind[p][i].ss == id) {
					ind[p].erase(ind[p].begin() + i);
					break;
				}
			}
			for (int i = 0;i < bcnt;i++) {
				if (ind[arr[i].ss].size() == 0) {
					for (int j = i + 1;j < bcnt;j++) {
						arr[j - 1] = arr[j];
						ma[j - 1] = ma[j];
					}
					bcnt = max(bcnt - 1, 1);
					break;
				}
			}
			for (int i = 0;i < bcnt;i++) {
				if (arr[i].ss)arr[i].ff = ind[arr[i].ss].back().ff, ma[i] = ind[arr[i].ss][0].ff;
			}
		} else {
			int l, r, k;
			cin >> l >> r >> k;
			l ^= onl ? lastans : 0, r ^= onl ? lastans :0;
			if (l > r) swap(l, r);
			if (r - l + 1 < k) {
				cout << 0 << "\n";
				lastans = 0;
				continue;
			}
			l += k - 1, r -= k - 1; // <l, >r
			int ans = 0;
			for (int i = 0;i < bcnt;i++) {
				if (arr[i].ff < k) {
					for (auto j:ind[arr[i].ss]) {
						if (j.ff < k) continue;
						if (seg[j.ss].ss >= l && seg[j.ss].ff <= r) ans++;
					}	
					break;
				} else {
					ans += ind[arr[i].ss].size();
					ans -= lef[arr[i].ss].size() - lef[arr[i].ss].order_of_key(r + 1);
					ans -= rig[arr[i].ss].order_of_key(l);
				}
			}
			cout << ans << "\n";
			lastans = ans;
		}
		/*
		for (int i = 0;i < bcnt;i++) {
			debug(ma[i]);
			for (auto j:ind[arr[i].ss]) debug(seg[j.ss].ff, seg[j.ss].ss);
			pary(lef[arr[i].ss].begin(), lef[arr[i].ss].end());
			pary(rig[arr[i].ss].begin(), rig[arr[i].ss].end());
		}
		*/
	}
}
/*
6 0
1 3 10
1 3 5
3 6 10 6
2 1
1 3 10
3 6 4 2

6 1
1 1 2
3 2 4 2
1 3 5
3 2 3 1
2 1
3 0 3 1
   */

Compilation message

segments.cpp: In function 'int main()':
segments.cpp:97:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   97 |    for (int i = 0;i < ind[p].size();i++) {
      |                   ~~^~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 5 ms 332 KB Output is correct
4 Correct 4 ms 332 KB Output is correct
5 Correct 25 ms 848 KB Output is correct
6 Correct 23 ms 844 KB Output is correct
7 Correct 9 ms 464 KB Output is correct
8 Correct 21 ms 688 KB Output is correct
9 Correct 18 ms 664 KB Output is correct
10 Correct 16 ms 844 KB Output is correct
11 Correct 30 ms 588 KB Output is correct
12 Correct 29 ms 588 KB Output is correct
13 Correct 18 ms 844 KB Output is correct
14 Correct 22 ms 588 KB Output is correct
15 Correct 4 ms 332 KB Output is correct
16 Correct 4 ms 332 KB Output is correct
17 Correct 16 ms 524 KB Output is correct
18 Correct 22 ms 800 KB Output is correct
19 Correct 15 ms 536 KB Output is correct
20 Correct 14 ms 460 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1570 ms 6448 KB Output is correct
2 Correct 1381 ms 6588 KB Output is correct
3 Correct 1259 ms 6640 KB Output is correct
4 Correct 1466 ms 7032 KB Output is correct
5 Correct 756 ms 11376 KB Output is correct
6 Correct 616 ms 11616 KB Output is correct
7 Correct 1344 ms 6460 KB Output is correct
8 Correct 1438 ms 6496 KB Output is correct
9 Correct 1354 ms 6428 KB Output is correct
10 Correct 1193 ms 3012 KB Output is correct
11 Correct 1164 ms 3912 KB Output is correct
12 Correct 1404 ms 8876 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 836 KB Output is correct
2 Correct 60 ms 844 KB Output is correct
3 Correct 82 ms 920 KB Output is correct
4 Correct 61 ms 752 KB Output is correct
5 Correct 872 ms 9060 KB Output is correct
6 Correct 728 ms 7648 KB Output is correct
7 Correct 907 ms 8336 KB Output is correct
8 Correct 629 ms 11396 KB Output is correct
9 Correct 672 ms 10892 KB Output is correct
10 Correct 666 ms 8260 KB Output is correct
11 Correct 214 ms 1292 KB Output is correct
12 Correct 617 ms 8408 KB Output is correct
13 Correct 567 ms 7348 KB Output is correct
14 Correct 394 ms 4052 KB Output is correct
15 Correct 338 ms 3680 KB Output is correct
16 Correct 312 ms 2672 KB Output is correct
17 Correct 724 ms 6516 KB Output is correct
18 Correct 707 ms 6540 KB Output is correct
19 Correct 686 ms 6652 KB Output is correct
20 Correct 732 ms 6504 KB Output is correct
21 Correct 253 ms 1492 KB Output is correct
22 Correct 513 ms 5036 KB Output is correct
23 Correct 552 ms 6356 KB Output is correct
24 Correct 474 ms 5140 KB Output is correct
25 Correct 70 ms 836 KB Output is correct
26 Correct 61 ms 812 KB Output is correct
27 Correct 86 ms 784 KB Output is correct
28 Correct 67 ms 884 KB Output is correct
29 Correct 635 ms 6864 KB Output is correct
30 Correct 673 ms 6832 KB Output is correct
31 Correct 686 ms 11136 KB Output is correct
32 Correct 593 ms 8152 KB Output is correct
33 Correct 541 ms 7524 KB Output is correct
34 Correct 365 ms 3548 KB Output is correct
35 Correct 546 ms 6212 KB Output is correct
36 Correct 606 ms 7964 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 832 KB Output is correct
2 Correct 69 ms 816 KB Output is correct
3 Correct 70 ms 716 KB Output is correct
4 Correct 76 ms 820 KB Output is correct
5 Correct 1215 ms 9648 KB Output is correct
6 Correct 1195 ms 2440 KB Output is correct
7 Correct 995 ms 10320 KB Output is correct
8 Correct 1162 ms 3200 KB Output is correct
9 Correct 681 ms 4840 KB Output is correct
10 Correct 798 ms 8884 KB Output is correct
11 Correct 617 ms 2312 KB Output is correct
12 Correct 567 ms 11520 KB Output is correct
13 Correct 689 ms 7492 KB Output is correct
14 Correct 670 ms 4548 KB Output is correct
15 Correct 578 ms 10820 KB Output is correct
16 Correct 706 ms 7748 KB Output is correct
17 Correct 1248 ms 6808 KB Output is correct
18 Correct 1247 ms 6636 KB Output is correct
19 Correct 1231 ms 6540 KB Output is correct
20 Correct 1223 ms 6592 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 5 ms 332 KB Output is correct
4 Correct 4 ms 332 KB Output is correct
5 Correct 25 ms 848 KB Output is correct
6 Correct 23 ms 844 KB Output is correct
7 Correct 9 ms 464 KB Output is correct
8 Correct 21 ms 688 KB Output is correct
9 Correct 18 ms 664 KB Output is correct
10 Correct 16 ms 844 KB Output is correct
11 Correct 30 ms 588 KB Output is correct
12 Correct 29 ms 588 KB Output is correct
13 Correct 18 ms 844 KB Output is correct
14 Correct 22 ms 588 KB Output is correct
15 Correct 4 ms 332 KB Output is correct
16 Correct 4 ms 332 KB Output is correct
17 Correct 16 ms 524 KB Output is correct
18 Correct 22 ms 800 KB Output is correct
19 Correct 15 ms 536 KB Output is correct
20 Correct 14 ms 460 KB Output is correct
21 Correct 1570 ms 6448 KB Output is correct
22 Correct 1381 ms 6588 KB Output is correct
23 Correct 1259 ms 6640 KB Output is correct
24 Correct 1466 ms 7032 KB Output is correct
25 Correct 756 ms 11376 KB Output is correct
26 Correct 616 ms 11616 KB Output is correct
27 Correct 1344 ms 6460 KB Output is correct
28 Correct 1438 ms 6496 KB Output is correct
29 Correct 1354 ms 6428 KB Output is correct
30 Correct 1193 ms 3012 KB Output is correct
31 Correct 1164 ms 3912 KB Output is correct
32 Correct 1404 ms 8876 KB Output is correct
33 Correct 67 ms 832 KB Output is correct
34 Correct 69 ms 816 KB Output is correct
35 Correct 70 ms 716 KB Output is correct
36 Correct 76 ms 820 KB Output is correct
37 Correct 1215 ms 9648 KB Output is correct
38 Correct 1195 ms 2440 KB Output is correct
39 Correct 995 ms 10320 KB Output is correct
40 Correct 1162 ms 3200 KB Output is correct
41 Correct 681 ms 4840 KB Output is correct
42 Correct 798 ms 8884 KB Output is correct
43 Correct 617 ms 2312 KB Output is correct
44 Correct 567 ms 11520 KB Output is correct
45 Correct 689 ms 7492 KB Output is correct
46 Correct 670 ms 4548 KB Output is correct
47 Correct 578 ms 10820 KB Output is correct
48 Correct 706 ms 7748 KB Output is correct
49 Correct 1248 ms 6808 KB Output is correct
50 Correct 1247 ms 6636 KB Output is correct
51 Correct 1231 ms 6540 KB Output is correct
52 Correct 1223 ms 6592 KB Output is correct
53 Correct 83 ms 820 KB Output is correct
54 Correct 83 ms 808 KB Output is correct
55 Correct 70 ms 732 KB Output is correct
56 Correct 72 ms 836 KB Output is correct
57 Correct 1088 ms 4572 KB Output is correct
58 Correct 1188 ms 1936 KB Output is correct
59 Correct 1252 ms 7728 KB Output is correct
60 Correct 1020 ms 1740 KB Output is correct
61 Correct 711 ms 7464 KB Output is correct
62 Correct 627 ms 10532 KB Output is correct
63 Correct 571 ms 11204 KB Output is correct
64 Correct 634 ms 10848 KB Output is correct
65 Correct 588 ms 2956 KB Output is correct
66 Correct 711 ms 2500 KB Output is correct
67 Correct 733 ms 8008 KB Output is correct
68 Correct 727 ms 6248 KB Output is correct
69 Correct 1252 ms 6384 KB Output is correct
70 Correct 1277 ms 6512 KB Output is correct
71 Correct 1226 ms 6596 KB Output is correct
72 Correct 1266 ms 6516 KB Output is correct
73 Correct 677 ms 3616 KB Output is correct
74 Correct 731 ms 6240 KB Output is correct
75 Correct 553 ms 11716 KB Output is correct
76 Correct 576 ms 11328 KB Output is correct
77 Correct 76 ms 816 KB Output is correct
78 Correct 67 ms 768 KB Output is correct
79 Correct 82 ms 796 KB Output is correct
80 Correct 72 ms 836 KB Output is correct
81 Correct 758 ms 5992 KB Output is correct
82 Correct 631 ms 3376 KB Output is correct
83 Correct 571 ms 2176 KB Output is correct
84 Correct 719 ms 6148 KB Output is correct
85 Correct 823 ms 8056 KB Output is correct
86 Correct 833 ms 8468 KB Output is correct
87 Correct 695 ms 4868 KB Output is correct
88 Correct 622 ms 2332 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 5 ms 332 KB Output is correct
4 Correct 4 ms 332 KB Output is correct
5 Correct 25 ms 848 KB Output is correct
6 Correct 23 ms 844 KB Output is correct
7 Correct 9 ms 464 KB Output is correct
8 Correct 21 ms 688 KB Output is correct
9 Correct 18 ms 664 KB Output is correct
10 Correct 16 ms 844 KB Output is correct
11 Correct 30 ms 588 KB Output is correct
12 Correct 29 ms 588 KB Output is correct
13 Correct 18 ms 844 KB Output is correct
14 Correct 22 ms 588 KB Output is correct
15 Correct 4 ms 332 KB Output is correct
16 Correct 4 ms 332 KB Output is correct
17 Correct 16 ms 524 KB Output is correct
18 Correct 22 ms 800 KB Output is correct
19 Correct 15 ms 536 KB Output is correct
20 Correct 14 ms 460 KB Output is correct
21 Correct 1570 ms 6448 KB Output is correct
22 Correct 1381 ms 6588 KB Output is correct
23 Correct 1259 ms 6640 KB Output is correct
24 Correct 1466 ms 7032 KB Output is correct
25 Correct 756 ms 11376 KB Output is correct
26 Correct 616 ms 11616 KB Output is correct
27 Correct 1344 ms 6460 KB Output is correct
28 Correct 1438 ms 6496 KB Output is correct
29 Correct 1354 ms 6428 KB Output is correct
30 Correct 1193 ms 3012 KB Output is correct
31 Correct 1164 ms 3912 KB Output is correct
32 Correct 1404 ms 8876 KB Output is correct
33 Correct 67 ms 836 KB Output is correct
34 Correct 60 ms 844 KB Output is correct
35 Correct 82 ms 920 KB Output is correct
36 Correct 61 ms 752 KB Output is correct
37 Correct 872 ms 9060 KB Output is correct
38 Correct 728 ms 7648 KB Output is correct
39 Correct 907 ms 8336 KB Output is correct
40 Correct 629 ms 11396 KB Output is correct
41 Correct 672 ms 10892 KB Output is correct
42 Correct 666 ms 8260 KB Output is correct
43 Correct 214 ms 1292 KB Output is correct
44 Correct 617 ms 8408 KB Output is correct
45 Correct 567 ms 7348 KB Output is correct
46 Correct 394 ms 4052 KB Output is correct
47 Correct 338 ms 3680 KB Output is correct
48 Correct 312 ms 2672 KB Output is correct
49 Correct 724 ms 6516 KB Output is correct
50 Correct 707 ms 6540 KB Output is correct
51 Correct 686 ms 6652 KB Output is correct
52 Correct 732 ms 6504 KB Output is correct
53 Correct 253 ms 1492 KB Output is correct
54 Correct 513 ms 5036 KB Output is correct
55 Correct 552 ms 6356 KB Output is correct
56 Correct 474 ms 5140 KB Output is correct
57 Correct 70 ms 836 KB Output is correct
58 Correct 61 ms 812 KB Output is correct
59 Correct 86 ms 784 KB Output is correct
60 Correct 67 ms 884 KB Output is correct
61 Correct 635 ms 6864 KB Output is correct
62 Correct 673 ms 6832 KB Output is correct
63 Correct 686 ms 11136 KB Output is correct
64 Correct 593 ms 8152 KB Output is correct
65 Correct 541 ms 7524 KB Output is correct
66 Correct 365 ms 3548 KB Output is correct
67 Correct 546 ms 6212 KB Output is correct
68 Correct 606 ms 7964 KB Output is correct
69 Correct 67 ms 832 KB Output is correct
70 Correct 69 ms 816 KB Output is correct
71 Correct 70 ms 716 KB Output is correct
72 Correct 76 ms 820 KB Output is correct
73 Correct 1215 ms 9648 KB Output is correct
74 Correct 1195 ms 2440 KB Output is correct
75 Correct 995 ms 10320 KB Output is correct
76 Correct 1162 ms 3200 KB Output is correct
77 Correct 681 ms 4840 KB Output is correct
78 Correct 798 ms 8884 KB Output is correct
79 Correct 617 ms 2312 KB Output is correct
80 Correct 567 ms 11520 KB Output is correct
81 Correct 689 ms 7492 KB Output is correct
82 Correct 670 ms 4548 KB Output is correct
83 Correct 578 ms 10820 KB Output is correct
84 Correct 706 ms 7748 KB Output is correct
85 Correct 1248 ms 6808 KB Output is correct
86 Correct 1247 ms 6636 KB Output is correct
87 Correct 1231 ms 6540 KB Output is correct
88 Correct 1223 ms 6592 KB Output is correct
89 Correct 83 ms 820 KB Output is correct
90 Correct 83 ms 808 KB Output is correct
91 Correct 70 ms 732 KB Output is correct
92 Correct 72 ms 836 KB Output is correct
93 Correct 1088 ms 4572 KB Output is correct
94 Correct 1188 ms 1936 KB Output is correct
95 Correct 1252 ms 7728 KB Output is correct
96 Correct 1020 ms 1740 KB Output is correct
97 Correct 711 ms 7464 KB Output is correct
98 Correct 627 ms 10532 KB Output is correct
99 Correct 571 ms 11204 KB Output is correct
100 Correct 634 ms 10848 KB Output is correct
101 Correct 588 ms 2956 KB Output is correct
102 Correct 711 ms 2500 KB Output is correct
103 Correct 733 ms 8008 KB Output is correct
104 Correct 727 ms 6248 KB Output is correct
105 Correct 1252 ms 6384 KB Output is correct
106 Correct 1277 ms 6512 KB Output is correct
107 Correct 1226 ms 6596 KB Output is correct
108 Correct 1266 ms 6516 KB Output is correct
109 Correct 677 ms 3616 KB Output is correct
110 Correct 731 ms 6240 KB Output is correct
111 Correct 553 ms 11716 KB Output is correct
112 Correct 576 ms 11328 KB Output is correct
113 Correct 76 ms 816 KB Output is correct
114 Correct 67 ms 768 KB Output is correct
115 Correct 82 ms 796 KB Output is correct
116 Correct 72 ms 836 KB Output is correct
117 Correct 758 ms 5992 KB Output is correct
118 Correct 631 ms 3376 KB Output is correct
119 Correct 571 ms 2176 KB Output is correct
120 Correct 719 ms 6148 KB Output is correct
121 Correct 823 ms 8056 KB Output is correct
122 Correct 833 ms 8468 KB Output is correct
123 Correct 695 ms 4868 KB Output is correct
124 Correct 622 ms 2332 KB Output is correct
125 Correct 159 ms 1368 KB Output is correct
126 Correct 166 ms 1348 KB Output is correct
127 Correct 237 ms 1308 KB Output is correct
128 Correct 180 ms 1384 KB Output is correct
129 Correct 140 ms 1244 KB Output is correct
130 Correct 192 ms 1356 KB Output is correct
131 Correct 2316 ms 3572 KB Output is correct
132 Correct 4335 ms 11384 KB Output is correct
133 Correct 4849 ms 16268 KB Output is correct
134 Correct 2589 ms 5100 KB Output is correct
135 Correct 4168 ms 17108 KB Output is correct
136 Correct 2630 ms 1604 KB Output is correct
137 Correct 1743 ms 21144 KB Output is correct
138 Correct 2372 ms 13372 KB Output is correct
139 Correct 2204 ms 17416 KB Output is correct
140 Correct 1914 ms 19948 KB Output is correct
141 Correct 2552 ms 15544 KB Output is correct
142 Correct 1086 ms 2716 KB Output is correct
143 Correct 1598 ms 5608 KB Output is correct
144 Correct 1419 ms 2212 KB Output is correct
145 Correct 1889 ms 19740 KB Output is correct
146 Correct 2134 ms 9208 KB Output is correct
147 Correct 1552 ms 6048 KB Output is correct
148 Correct 1493 ms 5356 KB Output is correct
149 Correct 4507 ms 12976 KB Output is correct
150 Correct 4462 ms 18140 KB Output is correct
151 Correct 4470 ms 18044 KB Output is correct
152 Correct 4538 ms 18044 KB Output is correct
153 Correct 4519 ms 18032 KB Output is correct
154 Correct 4313 ms 18076 KB Output is correct
155 Correct 1386 ms 7936 KB Output is correct
156 Correct 1616 ms 10372 KB Output is correct
157 Correct 2045 ms 24724 KB Output is correct
158 Correct 1885 ms 25568 KB Output is correct
159 Correct 2683 ms 18524 KB Output is correct
160 Correct 2079 ms 13828 KB Output is correct
161 Correct 219 ms 5580 KB Output is correct
162 Correct 192 ms 5576 KB Output is correct
163 Correct 191 ms 5444 KB Output is correct
164 Correct 407 ms 5676 KB Output is correct
165 Correct 227 ms 5512 KB Output is correct
166 Correct 183 ms 5448 KB Output is correct
167 Correct 1588 ms 26652 KB Output is correct
168 Correct 1680 ms 26620 KB Output is correct
169 Correct 1973 ms 24460 KB Output is correct
170 Correct 1981 ms 23312 KB Output is correct
171 Correct 2373 ms 19768 KB Output is correct
172 Correct 1664 ms 12212 KB Output is correct
173 Correct 1858 ms 24904 KB Output is correct
174 Correct 1760 ms 12940 KB Output is correct
175 Correct 2113 ms 20824 KB Output is correct
176 Correct 1343 ms 9448 KB Output is correct
177 Correct 2308 ms 18440 KB Output is correct
178 Correct 2085 ms 17328 KB Output is correct