oj.uz

Submission #758655

# Submission time Handle Problem Language Result Execution time Memory
758655 2023-06-15T05:07:29 Z scanhex Segments (IZhO18_segments) C++17
75 / 100
 2642 ms 41980 KB 
#include <bits/stdc++.h>

using namespace std;
using nagai = long long;

struct dss {
	vector<pair<int,int>> segs;
	void insert(int l, int r) {
		segs.push_back({l, r});
	}
	int get(int l, int r, int k) {
		if (k == 0) return segs.size();
		int res = 0;
		for (auto& x : segs) {
			int ll = max(x.first, l), rr = min(x.second, r); 
			if (rr - ll + 1 >= k)
				++res;
		}
		return res;
	}
};

const int oo = 0x3f3f3f3f;
 
struct static1d {
	int* coords = nullptr;
	int cnt = 0;
	void clear() {
		if (coords)
			delete[] coords;
		cnt = 0;
	}

	void preadd(int c) {
		++cnt;
	}

	void preaddfinish() {
		coords = new int[cnt];
		cnt = 0;
	}

	void add(int c) {
		coords[cnt++] = c;
	}

	void finalize() {
	}

	int get(int l, int r) {
		if (l > r) return 0;
		auto itr = upper_bound(coords, coords + cnt, r);
		auto itl = lower_bound(coords, coords + cnt, l);
		//cerr << "coords\n";
		//for(auto& x : coords) 
			//cerr << x << ' ';
		//cerr << '\n';
		//cerr << l << ' ' << r << ' ' << itr - itl << '\n';
		return itr - itl;
	}
};

bool ycmp(pair<int, int> a, pair<int, int> b) {
	if (a.second != b.second)
		return a.second < b.second;
	return a.first < b.first;
}

const int N=200200;

struct static2d {
	static1d v[N];
	//static1d all;
	vector<int> xs;

	void preadd(int x, int y) {
		for (++x; x <= xs.size(); x = (x | x - 1) + 1)
			v[x].preadd(y);
	}

	void add(int x, int y) {
		for (++x; x <= xs.size(); x = (x | x - 1) + 1)
			v[x].add(y);
	}

	void build(vector<pair<int,int>> pts) {
		xs.clear();
		xs.reserve(pts.size());
		for (auto& p : pts) 
			xs.push_back(p.first);
		sort(xs.begin(), xs.end());
		xs.erase(unique(xs.begin(), xs.end()), xs.end());
		for (int i = 0; i < xs.size() + 1; ++i) 
			v[i].clear();
		for (auto& p: pts) 
			p.first = lower_bound(xs.begin(), xs.end(), p.first) - xs.begin();
		for (const auto& p : pts) {
			preadd(p.first, p.second);
			//all.add(p.second);
		}
		for (int i = 0; i <= xs.size(); ++i) 
			v[i].preaddfinish();
		for (const auto& p : pts) {
			add(p.first, p.second);
			//all.add(p.second);
		}
		for (int i = 0; i <= xs.size(); ++i) 
			v[i].finalize();
		//all.finalize();
	}

	int get(int xr, int y1, int y2) {
		//if (xr == oo) 
			//return all.get(y1, y2);
		if (xr < 0) return 0;
		++xr;
		int xrr = xr;
		xr = lower_bound(xs.begin(), xs.end(), xr) - xs.begin();
		int res = 0;
		for (; xr; xr &= xr - 1) 
			res += v[xr].get(y1, y2);
		//cerr << xrr << ' ' << y1 << ' ' << y2 << ' ' << res << '\n';
		return res;
	}

	// all inclusive
	int get(int x1, int x2, int y1, int y2) {
		if (x1 > x2) return 0;
		return get(x2, y1, y2) - get(x1 - 1, y1, y2);
	}
};

const int BL = 4000;

struct rofl2d {
	vector<pair<int,int>> all;
	vector<pair<int,int>> block;
	vector<pair<int,int>> erblock;
	vector<pair<int, int>> newall;
	static2d st;

	void check_rebuild() {
		if (block.size() + erblock.size() >= BL) {
			sort(block.begin(), block.end(), ycmp);
			newall.resize(all.size() + block.size());
			merge(all.begin(), all.end(), block.begin(), block.end(), newall.begin(), ycmp);
			sort(erblock.begin(), erblock.end(), ycmp);
			all.clear();
			int ptr = 0; 
			for (auto x : erblock) {
				 while (ptr < newall.size() && ycmp(newall[ptr], x))
					 all.push_back(newall[ptr++]);
				 // always true? 
				 ++ptr;
			}
			while (ptr < newall.size())
				all.push_back(newall[ptr++]);
			block.clear();
			erblock.clear();
			st.build(all);
		}
	}
	
	void insert(int x, int y) {
		block.push_back({x, y});
		check_rebuild();
	}

	void erase(int x, int y) {
		erblock.push_back({x, y});
		check_rebuild();
	}

	int get(int x1, int x2, int y1, int y2) {
		int res = st.get(x1, x2, y1, y2);
		/*
		for (auto p : block) 
			if (x1 <= p.first && p.first <= x2 && y1 <= p.second && p.second <= y2) 
				++res;
		for (auto p : erblock) 
			if (x1 <= p.first && p.first <= x2 && y1 <= p.second && p.second <= y2) 
				--res;
				*/
		return res;
	}
};


struct ds {
	int tot = 0;
	rofl2d rofl_l, rofl_r;
	void insert(int l, int r) {
		++tot;
		rofl_l.insert(l, r - l);
		rofl_r.insert(r, r - l);
		//rofl_len.insert(0, r - l);
	}
	void erase(int l, int r) {
		--tot;
		rofl_l.erase(l, r - l);
		rofl_r.erase(r, r - l);
		//rofl_len.erase(0, r - l);
	}
	int get(int l, int r, int k) {
		if (r - l + 1 < k) return 0;
		if (k == 0) return tot;
		int res = tot - rofl_l.block.size() + rofl_l.erblock.size();
		for (auto p : rofl_l.block) {
			int ll = max(p.first, l); 
			int rr = min(p.first + p.second, r);
			if (rr - ll + 1 >= k) 
				++res;
		}
		for (auto p : rofl_l.erblock) {
			int ll = max(p.first, l); 
			int rr = min(p.first + p.second, r);
			if (rr - ll + 1 >= k) 
				--res;
		}
		//cerr << "rofl_l" << '\n';
		res -= rofl_l.get(r - k + 2, oo, k - 1, oo);
		//cerr << "rofl_r" << '\n';
		res -= rofl_r.get(0, l + k - 2, k - 1, oo);
		//cerr << "rofl_len" << '\n';
		res -= rofl_l.get(0, oo, 0, k - 2);
		return res;
	}
} add;

void stress() {
	int C = 5;
	for (int i = 0; i < 10000; ++i) {
		ds smart;
		dss stupid;
		stringstream ss;
		for (int i = 0; i < 10; ++i) {
			int x = rand() % C, y = rand() % C;
			if (x > y) swap(x, y);
			ss << "1 " << x << ' ' << y << '\n';
			smart.insert(x, y);
			stupid.insert(x, y);

			int a = rand() % C, b = rand() % C, k = rand() % C;
			if (a > b) swap(a, b);
			if (smart.get(a, b, k) != stupid.get(a, b, k)) {
				ss << smart.get(a, b, k) << ' ' << stupid.get(a, b, k) << '\n';
				ss << "3 " << a << ' ' << b << ' ' << k << '\n';
				cerr << ss.str();
				exit(1);
			}
		}
	}
	exit(0);
}


int main() {
	//stress();
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, t; 
	cin >> n >> t; 
	int lastans = 0;
	vector<pair<int, int>> segs;
	while (n--) {
		int tt;
		cin >> tt; 
		if (tt == 1) {
			int a, b;
			cin >> a >> b; 
			a ^= t * lastans;
			b ^= t * lastans;
			if (a > b) swap(a, b);
			segs.push_back({a, b});
			add.insert(a, b);
		}
		else if (tt == 2) {
			int id; 
			cin >> id; 
			--id;
			add.erase(segs[id].first, segs[id].second);
		}
		else {
			int a, b, k;
			cin >> a >> b >> k;
			a ^= t * lastans;
			b ^= t * lastans;
			if (a > b) swap(a, b);
			lastans = add.get(a, b, k);
			cout << lastans << '\n';
		}
	}
}

Compilation message

segments.cpp: In member function 'void static2d::preadd(int, int)':
segments.cpp:77:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |   for (++x; x <= xs.size(); x = (x | x - 1) + 1)
      |             ~~^~~~~~~~~~~~
segments.cpp:77:40: warning: suggest parentheses around arithmetic in operand of '|' [-Wparentheses]
   77 |   for (++x; x <= xs.size(); x = (x | x - 1) + 1)
      |                                      ~~^~~
segments.cpp: In member function 'void static2d::add(int, int)':
segments.cpp:82:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |   for (++x; x <= xs.size(); x = (x | x - 1) + 1)
      |             ~~^~~~~~~~~~~~
segments.cpp:82:40: warning: suggest parentheses around arithmetic in operand of '|' [-Wparentheses]
   82 |   for (++x; x <= xs.size(); x = (x | x - 1) + 1)
      |                                      ~~^~~
segments.cpp: In member function 'void static2d::build(std::vector<std::pair<int, int> >)':
segments.cpp:93:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |   for (int i = 0; i < xs.size() + 1; ++i)
      |                   ~~^~~~~~~~~~~~~~~
segments.cpp:101:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |   for (int i = 0; i <= xs.size(); ++i)
      |                   ~~^~~~~~~~~~~~
segments.cpp:107:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |   for (int i = 0; i <= xs.size(); ++i)
      |                   ~~^~~~~~~~~~~~
segments.cpp: In member function 'int static2d::get(int, int, int)':
segments.cpp:117:7: warning: unused variable 'xrr' [-Wunused-variable]
  117 |   int xrr = xr;
      |       ^~~
segments.cpp: In member function 'void rofl2d::check_rebuild()':
segments.cpp:151:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  151 |      while (ptr < newall.size() && ycmp(newall[ptr], x))
      |             ~~~~^~~~~~~~~~~~~~~
segments.cpp:156:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  156 |    while (ptr < newall.size())
      |           ~~~~^~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6484 KB Output is correct
2 Correct 3 ms 6484 KB Output is correct
3 Correct 8 ms 6656 KB Output is correct
4 Correct 8 ms 6612 KB Output is correct
5 Correct 7 ms 7252 KB Output is correct
6 Correct 11 ms 6728 KB Output is correct
7 Correct 8 ms 6740 KB Output is correct
8 Correct 8 ms 7124 KB Output is correct
9 Correct 9 ms 7108 KB Output is correct
10 Correct 7 ms 7252 KB Output is correct
11 Correct 13 ms 6612 KB Output is correct
12 Correct 13 ms 6612 KB Output is correct
13 Correct 6 ms 7252 KB Output is correct
14 Correct 9 ms 6996 KB Output is correct
15 Correct 12 ms 6612 KB Output is correct
16 Correct 9 ms 6660 KB Output is correct
17 Correct 9 ms 6684 KB Output is correct
18 Correct 8 ms 7252 KB Output is correct
19 Correct 11 ms 6692 KB Output is correct
20 Correct 9 ms 6612 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 437 ms 14976 KB Output is correct
2 Correct 435 ms 14940 KB Output is correct
3 Correct 441 ms 14920 KB Output is correct
4 Correct 499 ms 15488 KB Output is correct
5 Correct 607 ms 22424 KB Output is correct
6 Correct 629 ms 23196 KB Output is correct
7 Correct 442 ms 15080 KB Output is correct
8 Correct 439 ms 14860 KB Output is correct
9 Correct 439 ms 14956 KB Output is correct
10 Correct 609 ms 9644 KB Output is correct
11 Correct 531 ms 10916 KB Output is correct
12 Correct 490 ms 18612 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 7436 KB Output is correct
2 Correct 133 ms 7436 KB Output is correct
3 Correct 141 ms 7516 KB Output is correct
4 Correct 135 ms 7468 KB Output is correct
5 Correct 487 ms 18560 KB Output is correct
6 Correct 329 ms 16892 KB Output is correct
7 Correct 392 ms 17884 KB Output is correct
8 Correct 582 ms 22456 KB Output is correct
9 Correct 629 ms 22276 KB Output is correct
10 Correct 510 ms 18404 KB Output is correct
11 Correct 165 ms 8152 KB Output is correct
12 Correct 549 ms 19024 KB Output is correct
13 Correct 461 ms 17276 KB Output is correct
14 Correct 312 ms 11664 KB Output is correct
15 Correct 275 ms 11140 KB Output is correct
16 Correct 239 ms 9792 KB Output is correct
17 Correct 371 ms 15020 KB Output is correct
18 Correct 363 ms 14980 KB Output is correct
19 Correct 379 ms 14984 KB Output is correct
20 Correct 363 ms 14972 KB Output is correct
21 Correct 174 ms 8236 KB Output is correct
22 Correct 355 ms 13264 KB Output is correct
23 Correct 407 ms 16040 KB Output is correct
24 Correct 367 ms 13960 KB Output is correct
25 Correct 145 ms 7456 KB Output is correct
26 Correct 132 ms 7584 KB Output is correct
27 Correct 138 ms 7656 KB Output is correct
28 Correct 158 ms 7500 KB Output is correct
29 Correct 451 ms 16632 KB Output is correct
30 Correct 464 ms 16588 KB Output is correct
31 Correct 633 ms 22456 KB Output is correct
32 Correct 513 ms 18576 KB Output is correct
33 Correct 462 ms 17628 KB Output is correct
34 Correct 321 ms 11016 KB Output is correct
35 Correct 405 ms 15512 KB Output is correct
36 Correct 467 ms 18036 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 7436 KB Output is correct
2 Correct 133 ms 7404 KB Output is correct
3 Correct 140 ms 7432 KB Output is correct
4 Correct 139 ms 7452 KB Output is correct
5 Correct 526 ms 19992 KB Output is correct
6 Correct 404 ms 9060 KB Output is correct
7 Correct 544 ms 20604 KB Output is correct
8 Correct 278 ms 10196 KB Output is correct
9 Correct 366 ms 13284 KB Output is correct
10 Correct 572 ms 20036 KB Output is correct
11 Correct 240 ms 9412 KB Output is correct
12 Correct 613 ms 23208 KB Output is correct
13 Correct 502 ms 17184 KB Output is correct
14 Correct 349 ms 12356 KB Output is correct
15 Correct 613 ms 23036 KB Output is correct
16 Correct 524 ms 17912 KB Output is correct
17 Correct 472 ms 14948 KB Output is correct
18 Correct 437 ms 14936 KB Output is correct
19 Correct 425 ms 14936 KB Output is correct
20 Correct 474 ms 14860 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6484 KB Output is correct
2 Correct 3 ms 6484 KB Output is correct
3 Correct 8 ms 6656 KB Output is correct
4 Correct 8 ms 6612 KB Output is correct
5 Correct 7 ms 7252 KB Output is correct
6 Correct 11 ms 6728 KB Output is correct
7 Correct 8 ms 6740 KB Output is correct
8 Correct 8 ms 7124 KB Output is correct
9 Correct 9 ms 7108 KB Output is correct
10 Correct 7 ms 7252 KB Output is correct
11 Correct 13 ms 6612 KB Output is correct
12 Correct 13 ms 6612 KB Output is correct
13 Correct 6 ms 7252 KB Output is correct
14 Correct 9 ms 6996 KB Output is correct
15 Correct 12 ms 6612 KB Output is correct
16 Correct 9 ms 6660 KB Output is correct
17 Correct 9 ms 6684 KB Output is correct
18 Correct 8 ms 7252 KB Output is correct
19 Correct 11 ms 6692 KB Output is correct
20 Correct 9 ms 6612 KB Output is correct
21 Correct 437 ms 14976 KB Output is correct
22 Correct 435 ms 14940 KB Output is correct
23 Correct 441 ms 14920 KB Output is correct
24 Correct 499 ms 15488 KB Output is correct
25 Correct 607 ms 22424 KB Output is correct
26 Correct 629 ms 23196 KB Output is correct
27 Correct 442 ms 15080 KB Output is correct
28 Correct 439 ms 14860 KB Output is correct
29 Correct 439 ms 14956 KB Output is correct
30 Correct 609 ms 9644 KB Output is correct
31 Correct 531 ms 10916 KB Output is correct
32 Correct 490 ms 18612 KB Output is correct
33 Correct 134 ms 7436 KB Output is correct
34 Correct 133 ms 7404 KB Output is correct
35 Correct 140 ms 7432 KB Output is correct
36 Correct 139 ms 7452 KB Output is correct
37 Correct 526 ms 19992 KB Output is correct
38 Correct 404 ms 9060 KB Output is correct
39 Correct 544 ms 20604 KB Output is correct
40 Correct 278 ms 10196 KB Output is correct
41 Correct 366 ms 13284 KB Output is correct
42 Correct 572 ms 20036 KB Output is correct
43 Correct 240 ms 9412 KB Output is correct
44 Correct 613 ms 23208 KB Output is correct
45 Correct 502 ms 17184 KB Output is correct
46 Correct 349 ms 12356 KB Output is correct
47 Correct 613 ms 23036 KB Output is correct
48 Correct 524 ms 17912 KB Output is correct
49 Correct 472 ms 14948 KB Output is correct
50 Correct 437 ms 14936 KB Output is correct
51 Correct 425 ms 14936 KB Output is correct
52 Correct 474 ms 14860 KB Output is correct
53 Correct 140 ms 7480 KB Output is correct
54 Correct 140 ms 7456 KB Output is correct
55 Correct 144 ms 7740 KB Output is correct
56 Correct 136 ms 7420 KB Output is correct
57 Correct 600 ms 11656 KB Output is correct
58 Correct 317 ms 8280 KB Output is correct
59 Correct 416 ms 16996 KB Output is correct
60 Correct 620 ms 7736 KB Output is correct
61 Correct 523 ms 17236 KB Output is correct
62 Correct 622 ms 21796 KB Output is correct
63 Correct 641 ms 23096 KB Output is correct
64 Correct 597 ms 21804 KB Output is correct
65 Correct 296 ms 10500 KB Output is correct
66 Correct 251 ms 9752 KB Output is correct
67 Correct 512 ms 18040 KB Output is correct
68 Correct 430 ms 15552 KB Output is correct
69 Correct 441 ms 15060 KB Output is correct
70 Correct 453 ms 14896 KB Output is correct
71 Correct 439 ms 15060 KB Output is correct
72 Correct 430 ms 14940 KB Output is correct
73 Correct 306 ms 10944 KB Output is correct
74 Correct 463 ms 15208 KB Output is correct
75 Correct 611 ms 23184 KB Output is correct
76 Correct 615 ms 23200 KB Output is correct
77 Correct 136 ms 7436 KB Output is correct
78 Correct 136 ms 7492 KB Output is correct
79 Correct 145 ms 7484 KB Output is correct
80 Correct 146 ms 7520 KB Output is correct
81 Correct 426 ms 14484 KB Output is correct
82 Correct 304 ms 10904 KB Output is correct
83 Correct 235 ms 9200 KB Output is correct
84 Correct 438 ms 15128 KB Output is correct
85 Correct 488 ms 18400 KB Output is correct
86 Correct 526 ms 19296 KB Output is correct
87 Correct 374 ms 13064 KB Output is correct
88 Correct 238 ms 9416 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 6484 KB Output is correct
2 Correct 3 ms 6484 KB Output is correct
3 Correct 8 ms 6656 KB Output is correct
4 Correct 8 ms 6612 KB Output is correct
5 Correct 7 ms 7252 KB Output is correct
6 Correct 11 ms 6728 KB Output is correct
7 Correct 8 ms 6740 KB Output is correct
8 Correct 8 ms 7124 KB Output is correct
9 Correct 9 ms 7108 KB Output is correct
10 Correct 7 ms 7252 KB Output is correct
11 Correct 13 ms 6612 KB Output is correct
12 Correct 13 ms 6612 KB Output is correct
13 Correct 6 ms 7252 KB Output is correct
14 Correct 9 ms 6996 KB Output is correct
15 Correct 12 ms 6612 KB Output is correct
16 Correct 9 ms 6660 KB Output is correct
17 Correct 9 ms 6684 KB Output is correct
18 Correct 8 ms 7252 KB Output is correct
19 Correct 11 ms 6692 KB Output is correct
20 Correct 9 ms 6612 KB Output is correct
21 Correct 437 ms 14976 KB Output is correct
22 Correct 435 ms 14940 KB Output is correct
23 Correct 441 ms 14920 KB Output is correct
24 Correct 499 ms 15488 KB Output is correct
25 Correct 607 ms 22424 KB Output is correct
26 Correct 629 ms 23196 KB Output is correct
27 Correct 442 ms 15080 KB Output is correct
28 Correct 439 ms 14860 KB Output is correct
29 Correct 439 ms 14956 KB Output is correct
30 Correct 609 ms 9644 KB Output is correct
31 Correct 531 ms 10916 KB Output is correct
32 Correct 490 ms 18612 KB Output is correct
33 Correct 136 ms 7436 KB Output is correct
34 Correct 133 ms 7436 KB Output is correct
35 Correct 141 ms 7516 KB Output is correct
36 Correct 135 ms 7468 KB Output is correct
37 Correct 487 ms 18560 KB Output is correct
38 Correct 329 ms 16892 KB Output is correct
39 Correct 392 ms 17884 KB Output is correct
40 Correct 582 ms 22456 KB Output is correct
41 Correct 629 ms 22276 KB Output is correct
42 Correct 510 ms 18404 KB Output is correct
43 Correct 165 ms 8152 KB Output is correct
44 Correct 549 ms 19024 KB Output is correct
45 Correct 461 ms 17276 KB Output is correct
46 Correct 312 ms 11664 KB Output is correct
47 Correct 275 ms 11140 KB Output is correct
48 Correct 239 ms 9792 KB Output is correct
49 Correct 371 ms 15020 KB Output is correct
50 Correct 363 ms 14980 KB Output is correct
51 Correct 379 ms 14984 KB Output is correct
52 Correct 363 ms 14972 KB Output is correct
53 Correct 174 ms 8236 KB Output is correct
54 Correct 355 ms 13264 KB Output is correct
55 Correct 407 ms 16040 KB Output is correct
56 Correct 367 ms 13960 KB Output is correct
57 Correct 145 ms 7456 KB Output is correct
58 Correct 132 ms 7584 KB Output is correct
59 Correct 138 ms 7656 KB Output is correct
60 Correct 158 ms 7500 KB Output is correct
61 Correct 451 ms 16632 KB Output is correct
62 Correct 464 ms 16588 KB Output is correct
63 Correct 633 ms 22456 KB Output is correct
64 Correct 513 ms 18576 KB Output is correct
65 Correct 462 ms 17628 KB Output is correct
66 Correct 321 ms 11016 KB Output is correct
67 Correct 405 ms 15512 KB Output is correct
68 Correct 467 ms 18036 KB Output is correct
69 Correct 134 ms 7436 KB Output is correct
70 Correct 133 ms 7404 KB Output is correct
71 Correct 140 ms 7432 KB Output is correct
72 Correct 139 ms 7452 KB Output is correct
73 Correct 526 ms 19992 KB Output is correct
74 Correct 404 ms 9060 KB Output is correct
75 Correct 544 ms 20604 KB Output is correct
76 Correct 278 ms 10196 KB Output is correct
77 Correct 366 ms 13284 KB Output is correct
78 Correct 572 ms 20036 KB Output is correct
79 Correct 240 ms 9412 KB Output is correct
80 Correct 613 ms 23208 KB Output is correct
81 Correct 502 ms 17184 KB Output is correct
82 Correct 349 ms 12356 KB Output is correct
83 Correct 613 ms 23036 KB Output is correct
84 Correct 524 ms 17912 KB Output is correct
85 Correct 472 ms 14948 KB Output is correct
86 Correct 437 ms 14936 KB Output is correct
87 Correct 425 ms 14936 KB Output is correct
88 Correct 474 ms 14860 KB Output is correct
89 Correct 140 ms 7480 KB Output is correct
90 Correct 140 ms 7456 KB Output is correct
91 Correct 144 ms 7740 KB Output is correct
92 Correct 136 ms 7420 KB Output is correct
93 Correct 600 ms 11656 KB Output is correct
94 Correct 317 ms 8280 KB Output is correct
95 Correct 416 ms 16996 KB Output is correct
96 Correct 620 ms 7736 KB Output is correct
97 Correct 523 ms 17236 KB Output is correct
98 Correct 622 ms 21796 KB Output is correct
99 Correct 641 ms 23096 KB Output is correct
100 Correct 597 ms 21804 KB Output is correct
101 Correct 296 ms 10500 KB Output is correct
102 Correct 251 ms 9752 KB Output is correct
103 Correct 512 ms 18040 KB Output is correct
104 Correct 430 ms 15552 KB Output is correct
105 Correct 441 ms 15060 KB Output is correct
106 Correct 453 ms 14896 KB Output is correct
107 Correct 439 ms 15060 KB Output is correct
108 Correct 430 ms 14940 KB Output is correct
109 Correct 306 ms 10944 KB Output is correct
110 Correct 463 ms 15208 KB Output is correct
111 Correct 611 ms 23184 KB Output is correct
112 Correct 615 ms 23200 KB Output is correct
113 Correct 136 ms 7436 KB Output is correct
114 Correct 136 ms 7492 KB Output is correct
115 Correct 145 ms 7484 KB Output is correct
116 Correct 146 ms 7520 KB Output is correct
117 Correct 426 ms 14484 KB Output is correct
118 Correct 304 ms 10904 KB Output is correct
119 Correct 235 ms 9200 KB Output is correct
120 Correct 438 ms 15128 KB Output is correct
121 Correct 488 ms 18400 KB Output is correct
122 Correct 526 ms 19296 KB Output is correct
123 Correct 374 ms 13064 KB Output is correct
124 Correct 238 ms 9416 KB Output is correct
125 Correct 276 ms 8120 KB Output is correct
126 Correct 293 ms 8244 KB Output is correct
127 Correct 287 ms 8008 KB Output is correct
128 Correct 285 ms 8140 KB Output is correct
129 Correct 274 ms 8028 KB Output is correct
130 Correct 282 ms 8072 KB Output is correct
131 Correct 1425 ms 10328 KB Output is correct
132 Correct 1432 ms 21728 KB Output is correct
133 Correct 1577 ms 29692 KB Output is correct
134 Correct 653 ms 12692 KB Output is correct
135 Correct 1783 ms 31524 KB Output is correct
136 Correct 1084 ms 7476 KB Output is correct
137 Correct 2642 ms 39972 KB Output is correct
138 Correct 1815 ms 27244 KB Output is correct
139 Correct 2284 ms 33228 KB Output is correct
140 Correct 2478 ms 38308 KB Output is correct
141 Correct 1995 ms 33944 KB Output is correct
142 Correct 495 ms 13544 KB Output is correct
143 Correct 901 ms 18132 KB Output is correct
144 Correct 396 ms 12948 KB Output is correct
145 Runtime error 2469 ms 41980 KB Memory limit exceeded
146 Halted 0 ms 0 KB -