oj.uz

답안 #488964

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
488964 2021-11-20T21:16:06 Z keta_tsimakuridze Segments (IZhO18_segments) C++14
100 / 100
 2259 ms 20816 KB 
#include<bits/stdc++.h>
#define f first
#define s second
#define pii pair<int,int>
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7; // !
int t, block[N], le[N], ri[N], mink[N], Bl = 1500,removed[N];
vector<pii> all, cur, L[205], R[205];
vector<pii> _(vector<pii> x) {
	vector<pii> new_;
	for(int i = 0; i < x.size(); i++) {
		if(!removed[x[i].s]) new_.push_back(x[i]);
	}
	return new_;
}
void insert(int l,int r,int id) {
	cur.push_back({r - l + 1, id});
	block[id] = -1;
	if(cur.size() == Bl) {
		for(int j = 0; j < cur.size(); j++) all.push_back(cur[j]);
		all = _(all);
		cur.clear();
		sort(all.rbegin(), all.rend());
		for(int j = 0; j <= (all.size())/Bl; j++) L[j].clear(), R[j].clear();
		for(int j = 0; j < all.size(); j++) {
			int bl = j / Bl;
			L[bl].push_back({le[all[j].s], all[j].s});
			R[bl].push_back({ri[all[j].s], all[j].s});
			block[all[j].s] = bl;
		}
		for(int i = 0; i <= (all.size())/Bl; i++) {
			sort(L[i].begin(), L[i].end());
			mink[i] = 2e9 + 33;
			for(int k = 0; k < L[i].size(); k++) mink[i] = min(mink[i], ri[L[i][k].s] - le[L[i][k].s] + 1);
			sort(R[i].begin(), R[i].end());
		}
	}
}
vector<pii> erase(vector<pii> cur, int id) {
		vector<pii> new_;
		for(int i = 0; i < cur.size(); i++) {
			if(cur[i].s != id) new_.push_back(cur[i]);
		}
		return new_;
}
void remove(int id) {
	removed[id] = 1;
	if(block[id] == -1) {
		cur = erase(cur, id);
		return;
	}
	L[block[id]] = erase(L[block[id]], id);
	R[block[id]] = erase(R[block[id]], id);
	return;
}      
int get(int l,int r,int k) {
	if(r - l + 1 < k) return 0;
	int cnt = 0;
	for(int i = 0; i < cur.size(); i++) {
		int id = cur[i].s;
		if(min(ri[id], r)  - max(le[id],l) + 1 >= k) cnt++;
	}
	for(int j = 0; j <= (all.size()) / Bl; j++) {
		if(!L[j].size()) continue;
		if(mink[j] >= k) {
			pii p;
			cnt += L[j].size();
			p = {r - k + 1, 1e7};
			cnt -= L[j].size() - (upper_bound(L[j].begin(), L[j].end(), p) - L[j].begin());
			p = {l + k - 1, -1};
			cnt -= (upper_bound(R[j].begin(), R[j].end(), p) - R[j].begin()) ;
		}
		else {
			for(int i = 0; i < L[j].size(); i++) {
				int id = L[j][i].s;
				if(min(ri[id], r)  - max(le[id],l) + 1 >= k) cnt++;
			}
			break;
		}
	}
	//if((r - l + 1) == k) return cnt/2;
	return cnt;
}
int get(int x,int xo) {
	x = x ^ (t * xo);
	return x; 
}
main() {
	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	#define endl " "
	int n;
	cin >> n >> t;
	int xo = 0, idx = -1;
	for(int i = 1; i <= n; i++) {
		int type; cin >> type;
		if(type == 1) {
			int l,r;
			cin >> l >> r;
			
			l = get(l, xo), r = get(r, xo);
			if(l >= r) swap(l, r);
			le[++idx] = l; ri[idx] = r;
			insert(l,r,idx);
		}
		else if(type == 2) {
			int id;
			cin >> id; 
			remove(id - 1);
		}
		else {
			int l,r,k;
			cin >> l >> r >> k;
			l = get(l, xo), r = get(r, xo);
			if(l > r) swap(l, r);
			xo =  get(l,r,k);
			cout << xo << endl;
		}
	}
}

Compilation message

segments.cpp: In function 'std::vector<std::pair<int, int> > _(std::vector<std::pair<int, int> >)':
segments.cpp:11:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |  for(int i = 0; i < x.size(); i++) {
      |                 ~~^~~~~~~~~~
segments.cpp: In function 'void insert(int, int, int)':
segments.cpp:19:16: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   19 |  if(cur.size() == Bl) {
      |     ~~~~~~~~~~~^~~~~
segments.cpp:20:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |   for(int j = 0; j < cur.size(); j++) all.push_back(cur[j]);
      |                  ~~^~~~~~~~~~~~
segments.cpp:24:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |   for(int j = 0; j <= (all.size())/Bl; j++) L[j].clear(), R[j].clear();
      |                  ~~^~~~~~~~~~~~~~~~~~
segments.cpp:25:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |   for(int j = 0; j < all.size(); j++) {
      |                  ~~^~~~~~~~~~~~
segments.cpp:31:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |   for(int i = 0; i <= (all.size())/Bl; i++) {
      |                  ~~^~~~~~~~~~~~~~~~~~
segments.cpp:34: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]
   34 |    for(int k = 0; k < L[i].size(); k++) mink[i] = min(mink[i], ri[L[i][k].s] - le[L[i][k].s] + 1);
      |                   ~~^~~~~~~~~~~~~
segments.cpp: In function 'std::vector<std::pair<int, int> > erase(std::vector<std::pair<int, int> >, int)':
segments.cpp:41:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |   for(int i = 0; i < cur.size(); i++) {
      |                  ~~^~~~~~~~~~~~
segments.cpp: In function 'int get(int, int, int)':
segments.cpp:59:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |  for(int i = 0; i < cur.size(); i++) {
      |                 ~~^~~~~~~~~~~~
segments.cpp:63:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |  for(int j = 0; j <= (all.size()) / Bl; j++) {
      |                 ~~^~~~~~~~~~~~~~~~~~~~
segments.cpp:74: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]
   74 |    for(int i = 0; i < L[j].size(); i++) {
      |                   ~~^~~~~~~~~~~~~
segments.cpp: At global scope:
segments.cpp:88:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   88 | main() {
      | ^~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 9 ms 564 KB Output is correct
6 Correct 11 ms 528 KB Output is correct
7 Correct 8 ms 332 KB Output is correct
8 Correct 12 ms 532 KB Output is correct
9 Correct 14 ms 592 KB Output is correct
10 Correct 6 ms 720 KB Output is correct
11 Correct 15 ms 616 KB Output is correct
12 Correct 15 ms 612 KB Output is correct
13 Correct 7 ms 720 KB Output is correct
14 Correct 14 ms 636 KB Output is correct
15 Correct 2 ms 464 KB Output is correct
16 Correct 3 ms 464 KB Output is correct
17 Correct 13 ms 568 KB Output is correct
18 Correct 8 ms 664 KB Output is correct
19 Correct 13 ms 572 KB Output is correct
20 Correct 14 ms 636 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 598 ms 4320 KB Output is correct
2 Correct 609 ms 4192 KB Output is correct
3 Correct 598 ms 4368 KB Output is correct
4 Correct 627 ms 4448 KB Output is correct
5 Correct 582 ms 7596 KB Output is correct
6 Correct 577 ms 7504 KB Output is correct
7 Correct 603 ms 4228 KB Output is correct
8 Correct 587 ms 4148 KB Output is correct
9 Correct 587 ms 4332 KB Output is correct
10 Correct 668 ms 1676 KB Output is correct
11 Correct 479 ms 2592 KB Output is correct
12 Correct 652 ms 5904 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 964 KB Output is correct
2 Correct 43 ms 916 KB Output is correct
3 Correct 131 ms 1204 KB Output is correct
4 Correct 46 ms 968 KB Output is correct
5 Correct 489 ms 6028 KB Output is correct
6 Correct 441 ms 4872 KB Output is correct
7 Correct 471 ms 4788 KB Output is correct
8 Correct 537 ms 7404 KB Output is correct
9 Correct 582 ms 7780 KB Output is correct
10 Correct 537 ms 7708 KB Output is correct
11 Correct 261 ms 3140 KB Output is correct
12 Correct 537 ms 8404 KB Output is correct
13 Correct 508 ms 7308 KB Output is correct
14 Correct 444 ms 4948 KB Output is correct
15 Correct 433 ms 4900 KB Output is correct
16 Correct 383 ms 4092 KB Output is correct
17 Correct 390 ms 6472 KB Output is correct
18 Correct 389 ms 6756 KB Output is correct
19 Correct 383 ms 6556 KB Output is correct
20 Correct 391 ms 6668 KB Output is correct
21 Correct 298 ms 3284 KB Output is correct
22 Correct 488 ms 6468 KB Output is correct
23 Correct 512 ms 6592 KB Output is correct
24 Correct 489 ms 6316 KB Output is correct
25 Correct 79 ms 2828 KB Output is correct
26 Correct 53 ms 2776 KB Output is correct
27 Correct 77 ms 2792 KB Output is correct
28 Correct 59 ms 2820 KB Output is correct
29 Correct 518 ms 6824 KB Output is correct
30 Correct 519 ms 6912 KB Output is correct
31 Correct 556 ms 9920 KB Output is correct
32 Correct 538 ms 7748 KB Output is correct
33 Correct 535 ms 7188 KB Output is correct
34 Correct 417 ms 4648 KB Output is correct
35 Correct 495 ms 6848 KB Output is correct
36 Correct 514 ms 7552 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 964 KB Output is correct
2 Correct 46 ms 964 KB Output is correct
3 Correct 45 ms 936 KB Output is correct
4 Correct 58 ms 904 KB Output is correct
5 Correct 576 ms 6732 KB Output is correct
6 Correct 497 ms 1528 KB Output is correct
7 Correct 594 ms 7068 KB Output is correct
8 Correct 630 ms 2072 KB Output is correct
9 Correct 562 ms 3800 KB Output is correct
10 Correct 605 ms 9444 KB Output is correct
11 Correct 468 ms 4048 KB Output is correct
12 Correct 559 ms 10052 KB Output is correct
13 Correct 589 ms 7240 KB Output is correct
14 Correct 550 ms 5436 KB Output is correct
15 Correct 557 ms 9776 KB Output is correct
16 Correct 582 ms 7372 KB Output is correct
17 Correct 593 ms 7048 KB Output is correct
18 Correct 595 ms 6876 KB Output is correct
19 Correct 603 ms 6920 KB Output is correct
20 Correct 615 ms 7104 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 9 ms 564 KB Output is correct
6 Correct 11 ms 528 KB Output is correct
7 Correct 8 ms 332 KB Output is correct
8 Correct 12 ms 532 KB Output is correct
9 Correct 14 ms 592 KB Output is correct
10 Correct 6 ms 720 KB Output is correct
11 Correct 15 ms 616 KB Output is correct
12 Correct 15 ms 612 KB Output is correct
13 Correct 7 ms 720 KB Output is correct
14 Correct 14 ms 636 KB Output is correct
15 Correct 2 ms 464 KB Output is correct
16 Correct 3 ms 464 KB Output is correct
17 Correct 13 ms 568 KB Output is correct
18 Correct 8 ms 664 KB Output is correct
19 Correct 13 ms 572 KB Output is correct
20 Correct 14 ms 636 KB Output is correct
21 Correct 598 ms 4320 KB Output is correct
22 Correct 609 ms 4192 KB Output is correct
23 Correct 598 ms 4368 KB Output is correct
24 Correct 627 ms 4448 KB Output is correct
25 Correct 582 ms 7596 KB Output is correct
26 Correct 577 ms 7504 KB Output is correct
27 Correct 603 ms 4228 KB Output is correct
28 Correct 587 ms 4148 KB Output is correct
29 Correct 587 ms 4332 KB Output is correct
30 Correct 668 ms 1676 KB Output is correct
31 Correct 479 ms 2592 KB Output is correct
32 Correct 652 ms 5904 KB Output is correct
33 Correct 48 ms 964 KB Output is correct
34 Correct 46 ms 964 KB Output is correct
35 Correct 45 ms 936 KB Output is correct
36 Correct 58 ms 904 KB Output is correct
37 Correct 576 ms 6732 KB Output is correct
38 Correct 497 ms 1528 KB Output is correct
39 Correct 594 ms 7068 KB Output is correct
40 Correct 630 ms 2072 KB Output is correct
41 Correct 562 ms 3800 KB Output is correct
42 Correct 605 ms 9444 KB Output is correct
43 Correct 468 ms 4048 KB Output is correct
44 Correct 559 ms 10052 KB Output is correct
45 Correct 589 ms 7240 KB Output is correct
46 Correct 550 ms 5436 KB Output is correct
47 Correct 557 ms 9776 KB Output is correct
48 Correct 582 ms 7372 KB Output is correct
49 Correct 593 ms 7048 KB Output is correct
50 Correct 595 ms 6876 KB Output is correct
51 Correct 603 ms 6920 KB Output is correct
52 Correct 615 ms 7104 KB Output is correct
53 Correct 60 ms 3040 KB Output is correct
54 Correct 64 ms 3008 KB Output is correct
55 Correct 46 ms 3032 KB Output is correct
56 Correct 62 ms 3040 KB Output is correct
57 Correct 537 ms 5632 KB Output is correct
58 Correct 439 ms 4660 KB Output is correct
59 Correct 648 ms 7272 KB Output is correct
60 Correct 665 ms 4288 KB Output is correct
61 Correct 593 ms 7100 KB Output is correct
62 Correct 574 ms 9644 KB Output is correct
63 Correct 566 ms 9992 KB Output is correct
64 Correct 567 ms 10076 KB Output is correct
65 Correct 485 ms 4672 KB Output is correct
66 Correct 458 ms 4112 KB Output is correct
67 Correct 599 ms 7472 KB Output is correct
68 Correct 596 ms 6904 KB Output is correct
69 Correct 606 ms 6892 KB Output is correct
70 Correct 583 ms 6956 KB Output is correct
71 Correct 608 ms 6972 KB Output is correct
72 Correct 629 ms 6868 KB Output is correct
73 Correct 528 ms 4896 KB Output is correct
74 Correct 587 ms 6676 KB Output is correct
75 Correct 565 ms 10300 KB Output is correct
76 Correct 567 ms 10012 KB Output is correct
77 Correct 54 ms 3012 KB Output is correct
78 Correct 47 ms 3032 KB Output is correct
79 Correct 64 ms 3016 KB Output is correct
80 Correct 50 ms 2972 KB Output is correct
81 Correct 576 ms 6616 KB Output is correct
82 Correct 518 ms 4888 KB Output is correct
83 Correct 459 ms 4244 KB Output is correct
84 Correct 586 ms 6604 KB Output is correct
85 Correct 589 ms 7868 KB Output is correct
86 Correct 610 ms 8420 KB Output is correct
87 Correct 556 ms 5944 KB Output is correct
88 Correct 441 ms 4044 KB Output is correct

Subtask #6
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 2 ms 332 KB Output is correct
4 Correct 3 ms 332 KB Output is correct
5 Correct 9 ms 564 KB Output is correct
6 Correct 11 ms 528 KB Output is correct
7 Correct 8 ms 332 KB Output is correct
8 Correct 12 ms 532 KB Output is correct
9 Correct 14 ms 592 KB Output is correct
10 Correct 6 ms 720 KB Output is correct
11 Correct 15 ms 616 KB Output is correct
12 Correct 15 ms 612 KB Output is correct
13 Correct 7 ms 720 KB Output is correct
14 Correct 14 ms 636 KB Output is correct
15 Correct 2 ms 464 KB Output is correct
16 Correct 3 ms 464 KB Output is correct
17 Correct 13 ms 568 KB Output is correct
18 Correct 8 ms 664 KB Output is correct
19 Correct 13 ms 572 KB Output is correct
20 Correct 14 ms 636 KB Output is correct
21 Correct 598 ms 4320 KB Output is correct
22 Correct 609 ms 4192 KB Output is correct
23 Correct 598 ms 4368 KB Output is correct
24 Correct 627 ms 4448 KB Output is correct
25 Correct 582 ms 7596 KB Output is correct
26 Correct 577 ms 7504 KB Output is correct
27 Correct 603 ms 4228 KB Output is correct
28 Correct 587 ms 4148 KB Output is correct
29 Correct 587 ms 4332 KB Output is correct
30 Correct 668 ms 1676 KB Output is correct
31 Correct 479 ms 2592 KB Output is correct
32 Correct 652 ms 5904 KB Output is correct
33 Correct 70 ms 964 KB Output is correct
34 Correct 43 ms 916 KB Output is correct
35 Correct 131 ms 1204 KB Output is correct
36 Correct 46 ms 968 KB Output is correct
37 Correct 489 ms 6028 KB Output is correct
38 Correct 441 ms 4872 KB Output is correct
39 Correct 471 ms 4788 KB Output is correct
40 Correct 537 ms 7404 KB Output is correct
41 Correct 582 ms 7780 KB Output is correct
42 Correct 537 ms 7708 KB Output is correct
43 Correct 261 ms 3140 KB Output is correct
44 Correct 537 ms 8404 KB Output is correct
45 Correct 508 ms 7308 KB Output is correct
46 Correct 444 ms 4948 KB Output is correct
47 Correct 433 ms 4900 KB Output is correct
48 Correct 383 ms 4092 KB Output is correct
49 Correct 390 ms 6472 KB Output is correct
50 Correct 389 ms 6756 KB Output is correct
51 Correct 383 ms 6556 KB Output is correct
52 Correct 391 ms 6668 KB Output is correct
53 Correct 298 ms 3284 KB Output is correct
54 Correct 488 ms 6468 KB Output is correct
55 Correct 512 ms 6592 KB Output is correct
56 Correct 489 ms 6316 KB Output is correct
57 Correct 79 ms 2828 KB Output is correct
58 Correct 53 ms 2776 KB Output is correct
59 Correct 77 ms 2792 KB Output is correct
60 Correct 59 ms 2820 KB Output is correct
61 Correct 518 ms 6824 KB Output is correct
62 Correct 519 ms 6912 KB Output is correct
63 Correct 556 ms 9920 KB Output is correct
64 Correct 538 ms 7748 KB Output is correct
65 Correct 535 ms 7188 KB Output is correct
66 Correct 417 ms 4648 KB Output is correct
67 Correct 495 ms 6848 KB Output is correct
68 Correct 514 ms 7552 KB Output is correct
69 Correct 48 ms 964 KB Output is correct
70 Correct 46 ms 964 KB Output is correct
71 Correct 45 ms 936 KB Output is correct
72 Correct 58 ms 904 KB Output is correct
73 Correct 576 ms 6732 KB Output is correct
74 Correct 497 ms 1528 KB Output is correct
75 Correct 594 ms 7068 KB Output is correct
76 Correct 630 ms 2072 KB Output is correct
77 Correct 562 ms 3800 KB Output is correct
78 Correct 605 ms 9444 KB Output is correct
79 Correct 468 ms 4048 KB Output is correct
80 Correct 559 ms 10052 KB Output is correct
81 Correct 589 ms 7240 KB Output is correct
82 Correct 550 ms 5436 KB Output is correct
83 Correct 557 ms 9776 KB Output is correct
84 Correct 582 ms 7372 KB Output is correct
85 Correct 593 ms 7048 KB Output is correct
86 Correct 595 ms 6876 KB Output is correct
87 Correct 603 ms 6920 KB Output is correct
88 Correct 615 ms 7104 KB Output is correct
89 Correct 60 ms 3040 KB Output is correct
90 Correct 64 ms 3008 KB Output is correct
91 Correct 46 ms 3032 KB Output is correct
92 Correct 62 ms 3040 KB Output is correct
93 Correct 537 ms 5632 KB Output is correct
94 Correct 439 ms 4660 KB Output is correct
95 Correct 648 ms 7272 KB Output is correct
96 Correct 665 ms 4288 KB Output is correct
97 Correct 593 ms 7100 KB Output is correct
98 Correct 574 ms 9644 KB Output is correct
99 Correct 566 ms 9992 KB Output is correct
100 Correct 567 ms 10076 KB Output is correct
101 Correct 485 ms 4672 KB Output is correct
102 Correct 458 ms 4112 KB Output is correct
103 Correct 599 ms 7472 KB Output is correct
104 Correct 596 ms 6904 KB Output is correct
105 Correct 606 ms 6892 KB Output is correct
106 Correct 583 ms 6956 KB Output is correct
107 Correct 608 ms 6972 KB Output is correct
108 Correct 629 ms 6868 KB Output is correct
109 Correct 528 ms 4896 KB Output is correct
110 Correct 587 ms 6676 KB Output is correct
111 Correct 565 ms 10300 KB Output is correct
112 Correct 567 ms 10012 KB Output is correct
113 Correct 54 ms 3012 KB Output is correct
114 Correct 47 ms 3032 KB Output is correct
115 Correct 64 ms 3016 KB Output is correct
116 Correct 50 ms 2972 KB Output is correct
117 Correct 576 ms 6616 KB Output is correct
118 Correct 518 ms 4888 KB Output is correct
119 Correct 459 ms 4244 KB Output is correct
120 Correct 586 ms 6604 KB Output is correct
121 Correct 589 ms 7868 KB Output is correct
122 Correct 610 ms 8420 KB Output is correct
123 Correct 556 ms 5944 KB Output is correct
124 Correct 441 ms 4044 KB Output is correct
125 Correct 122 ms 5700 KB Output is correct
126 Correct 140 ms 5832 KB Output is correct
127 Correct 210 ms 5700 KB Output is correct
128 Correct 148 ms 5704 KB Output is correct
129 Correct 102 ms 5652 KB Output is correct
130 Correct 168 ms 5768 KB Output is correct
131 Correct 1134 ms 8444 KB Output is correct
132 Correct 1866 ms 13376 KB Output is correct
133 Correct 2094 ms 14648 KB Output is correct
134 Correct 1456 ms 9552 KB Output is correct
135 Correct 2077 ms 16776 KB Output is correct
136 Correct 892 ms 7660 KB Output is correct
137 Correct 2167 ms 19500 KB Output is correct
138 Correct 1789 ms 13576 KB Output is correct
139 Correct 2044 ms 17316 KB Output is correct
140 Correct 2158 ms 19036 KB Output is correct
141 Correct 1889 ms 14388 KB Output is correct
142 Correct 867 ms 6756 KB Output is correct
143 Correct 1201 ms 8720 KB Output is correct
144 Correct 705 ms 6468 KB Output is correct
145 Correct 2145 ms 19936 KB Output is correct
146 Correct 1461 ms 11304 KB Output is correct
147 Correct 1222 ms 9212 KB Output is correct
148 Correct 1178 ms 8800 KB Output is correct
149 Correct 1911 ms 13716 KB Output is correct
150 Correct 1927 ms 13656 KB Output is correct
151 Correct 1893 ms 13552 KB Output is correct
152 Correct 1919 ms 13792 KB Output is correct
153 Correct 1964 ms 13788 KB Output is correct
154 Correct 1927 ms 13684 KB Output is correct
155 Correct 1059 ms 7708 KB Output is correct
156 Correct 1285 ms 9520 KB Output is correct
157 Correct 2128 ms 19060 KB Output is correct
158 Correct 2151 ms 19356 KB Output is correct
159 Correct 1820 ms 13916 KB Output is correct
160 Correct 1538 ms 12204 KB Output is correct
161 Correct 205 ms 6016 KB Output is correct
162 Correct 168 ms 5748 KB Output is correct
163 Correct 166 ms 5704 KB Output is correct
164 Correct 435 ms 5804 KB Output is correct
165 Correct 208 ms 5744 KB Output is correct
166 Correct 152 ms 5760 KB Output is correct
167 Correct 2259 ms 20816 KB Output is correct
168 Correct 2232 ms 19800 KB Output is correct
169 Correct 2146 ms 19156 KB Output is correct
170 Correct 2055 ms 18480 KB Output is correct
171 Correct 1891 ms 14884 KB Output is correct
172 Correct 1452 ms 10088 KB Output is correct
173 Correct 2141 ms 19096 KB Output is correct
174 Correct 1458 ms 10328 KB Output is correct
175 Correct 1947 ms 16264 KB Output is correct
176 Correct 1183 ms 8780 KB Output is correct
177 Correct 1805 ms 14224 KB Output is correct
178 Correct 1739 ms 13836 KB Output is correct