oj.uz

Submission #758651

# Submission time Handle Problem Language Result Execution time Memory
758651 2023-06-15T04:34:32 Z scanhex Segments (IZhO18_segments) C++17
75 / 100
 3455 ms 49576 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 {
	vector<int> coords;
	void clear() {
		vector<int>{}.swap(coords);
	}

	void add(int c) {
		coords.push_back(c);
	}

	void finalize() {
	}

	int get(int l, int r) {
		if (l > r) return 0;
		auto itr = upper_bound(coords.begin(), coords.end(), r);
		auto itl = lower_bound(coords.begin(), coords.end(), 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;
}

struct static2d {
	vector<static1d> v;
	static1d all;
	vector<int> xs;

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

	void build(vector<pair<int,int>> pts) {
		xs.clear();
		for (auto& x : v) 
			x.clear();
		for (auto& p : pts) 
			xs.push_back(p.first);
		sort(xs.begin(), xs.end());
		xs.erase(unique(xs.begin(), xs.end()), xs.end());
		v.resize(xs.size() + 1);
		all.clear();
		for (auto p : pts) {
			add(lower_bound(xs.begin(), xs.end(), p.first) - xs.begin(), p.second);
			all.add(p.second);
		}
		for (int i = 0; i < v.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;
	rofl2d rofl_len;
	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;
	}
};

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;
	ds add;
	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::add(int, int)':
segments.cpp:63:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<static1d>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |   for (++x; x < v.size(); x = (x | x - 1) + 1)
      |             ~~^~~~~~~~~~
segments.cpp:63:38: warning: suggest parentheses around arithmetic in operand of '|' [-Wparentheses]
   63 |   for (++x; x < v.size(); x = (x | x - 1) + 1)
      |                                    ~~^~~
segments.cpp: In member function 'void static2d::build(std::vector<std::pair<int, int> >)':
segments.cpp:81:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<static1d>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |   for (int i = 0; i < v.size(); ++i)
      |                   ~~^~~~~~~~~~
segments.cpp: In member function 'int static2d::get(int, int, int)':
segments.cpp:91:7: warning: unused variable 'xrr' [-Wunused-variable]
   91 |   int xrr = xr;
      |       ^~~
segments.cpp: In member function 'void rofl2d::check_rebuild()':
segments.cpp:125: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]
  125 |      while (ptr < newall.size() && ycmp(newall[ptr], x))
      |             ~~~~^~~~~~~~~~~~~~~
segments.cpp:130: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]
  130 |    while (ptr < newall.size())
      |           ~~~~^~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 7 ms 532 KB Output is correct
4 Correct 6 ms 488 KB Output is correct
5 Correct 6 ms 1364 KB Output is correct
6 Correct 9 ms 460 KB Output is correct
7 Correct 6 ms 468 KB Output is correct
8 Correct 7 ms 1060 KB Output is correct
9 Correct 8 ms 972 KB Output is correct
10 Correct 5 ms 1236 KB Output is correct
11 Correct 11 ms 584 KB Output is correct
12 Correct 11 ms 572 KB Output is correct
13 Correct 5 ms 1352 KB Output is correct
14 Correct 7 ms 940 KB Output is correct
15 Correct 6 ms 540 KB Output is correct
16 Correct 6 ms 460 KB Output is correct
17 Correct 6 ms 468 KB Output is correct
18 Correct 5 ms 1236 KB Output is correct
19 Correct 6 ms 572 KB Output is correct
20 Correct 6 ms 468 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 467 ms 12940 KB Output is correct
2 Correct 478 ms 12212 KB Output is correct
3 Correct 455 ms 12224 KB Output is correct
4 Correct 530 ms 13180 KB Output is correct
5 Correct 747 ms 23788 KB Output is correct
6 Correct 779 ms 24304 KB Output is correct
7 Correct 523 ms 11952 KB Output is correct
8 Correct 456 ms 12128 KB Output is correct
9 Correct 443 ms 12368 KB Output is correct
10 Correct 582 ms 4612 KB Output is correct
11 Correct 508 ms 6460 KB Output is correct
12 Correct 552 ms 19384 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 1800 KB Output is correct
2 Correct 147 ms 1548 KB Output is correct
3 Correct 133 ms 1640 KB Output is correct
4 Correct 129 ms 1664 KB Output is correct
5 Correct 565 ms 19380 KB Output is correct
6 Correct 390 ms 14632 KB Output is correct
7 Correct 461 ms 15880 KB Output is correct
8 Correct 752 ms 23800 KB Output is correct
9 Correct 795 ms 23172 KB Output is correct
10 Correct 649 ms 17460 KB Output is correct
11 Correct 183 ms 2368 KB Output is correct
12 Correct 691 ms 19076 KB Output is correct
13 Correct 558 ms 14332 KB Output is correct
14 Correct 370 ms 7568 KB Output is correct
15 Correct 323 ms 6676 KB Output is correct
16 Correct 263 ms 5160 KB Output is correct
17 Correct 398 ms 11892 KB Output is correct
18 Correct 422 ms 12044 KB Output is correct
19 Correct 409 ms 12108 KB Output is correct
20 Correct 398 ms 12444 KB Output is correct
21 Correct 179 ms 2888 KB Output is correct
22 Correct 431 ms 10012 KB Output is correct
23 Correct 493 ms 13180 KB Output is correct
24 Correct 436 ms 10816 KB Output is correct
25 Correct 158 ms 1588 KB Output is correct
26 Correct 130 ms 1648 KB Output is correct
27 Correct 136 ms 1688 KB Output is correct
28 Correct 136 ms 1520 KB Output is correct
29 Correct 553 ms 14464 KB Output is correct
30 Correct 570 ms 14412 KB Output is correct
31 Correct 853 ms 23632 KB Output is correct
32 Correct 638 ms 17480 KB Output is correct
33 Correct 583 ms 14900 KB Output is correct
34 Correct 311 ms 6492 KB Output is correct
35 Correct 493 ms 12360 KB Output is correct
36 Correct 587 ms 15876 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 146 ms 2040 KB Output is correct
2 Correct 133 ms 1528 KB Output is correct
3 Correct 137 ms 1512 KB Output is correct
4 Correct 137 ms 1620 KB Output is correct
5 Correct 560 ms 20268 KB Output is correct
6 Correct 387 ms 3824 KB Output is correct
7 Correct 657 ms 20696 KB Output is correct
8 Correct 260 ms 5592 KB Output is correct
9 Correct 447 ms 9944 KB Output is correct
10 Correct 680 ms 19624 KB Output is correct
11 Correct 263 ms 4208 KB Output is correct
12 Correct 803 ms 23908 KB Output is correct
13 Correct 574 ms 14392 KB Output is correct
14 Correct 405 ms 8216 KB Output is correct
15 Correct 793 ms 22136 KB Output is correct
16 Correct 598 ms 15220 KB Output is correct
17 Correct 481 ms 12256 KB Output is correct
18 Correct 471 ms 12220 KB Output is correct
19 Correct 440 ms 11780 KB Output is correct
20 Correct 450 ms 12452 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 7 ms 532 KB Output is correct
4 Correct 6 ms 488 KB Output is correct
5 Correct 6 ms 1364 KB Output is correct
6 Correct 9 ms 460 KB Output is correct
7 Correct 6 ms 468 KB Output is correct
8 Correct 7 ms 1060 KB Output is correct
9 Correct 8 ms 972 KB Output is correct
10 Correct 5 ms 1236 KB Output is correct
11 Correct 11 ms 584 KB Output is correct
12 Correct 11 ms 572 KB Output is correct
13 Correct 5 ms 1352 KB Output is correct
14 Correct 7 ms 940 KB Output is correct
15 Correct 6 ms 540 KB Output is correct
16 Correct 6 ms 460 KB Output is correct
17 Correct 6 ms 468 KB Output is correct
18 Correct 5 ms 1236 KB Output is correct
19 Correct 6 ms 572 KB Output is correct
20 Correct 6 ms 468 KB Output is correct
21 Correct 467 ms 12940 KB Output is correct
22 Correct 478 ms 12212 KB Output is correct
23 Correct 455 ms 12224 KB Output is correct
24 Correct 530 ms 13180 KB Output is correct
25 Correct 747 ms 23788 KB Output is correct
26 Correct 779 ms 24304 KB Output is correct
27 Correct 523 ms 11952 KB Output is correct
28 Correct 456 ms 12128 KB Output is correct
29 Correct 443 ms 12368 KB Output is correct
30 Correct 582 ms 4612 KB Output is correct
31 Correct 508 ms 6460 KB Output is correct
32 Correct 552 ms 19384 KB Output is correct
33 Correct 146 ms 2040 KB Output is correct
34 Correct 133 ms 1528 KB Output is correct
35 Correct 137 ms 1512 KB Output is correct
36 Correct 137 ms 1620 KB Output is correct
37 Correct 560 ms 20268 KB Output is correct
38 Correct 387 ms 3824 KB Output is correct
39 Correct 657 ms 20696 KB Output is correct
40 Correct 260 ms 5592 KB Output is correct
41 Correct 447 ms 9944 KB Output is correct
42 Correct 680 ms 19624 KB Output is correct
43 Correct 263 ms 4208 KB Output is correct
44 Correct 803 ms 23908 KB Output is correct
45 Correct 574 ms 14392 KB Output is correct
46 Correct 405 ms 8216 KB Output is correct
47 Correct 793 ms 22136 KB Output is correct
48 Correct 598 ms 15220 KB Output is correct
49 Correct 481 ms 12256 KB Output is correct
50 Correct 471 ms 12220 KB Output is correct
51 Correct 440 ms 11780 KB Output is correct
52 Correct 450 ms 12452 KB Output is correct
53 Correct 152 ms 1592 KB Output is correct
54 Correct 144 ms 1632 KB Output is correct
55 Correct 138 ms 1536 KB Output is correct
56 Correct 137 ms 1604 KB Output is correct
57 Correct 595 ms 7648 KB Output is correct
58 Correct 283 ms 2888 KB Output is correct
59 Correct 469 ms 15112 KB Output is correct
60 Correct 592 ms 2064 KB Output is correct
61 Correct 590 ms 14820 KB Output is correct
62 Correct 766 ms 22612 KB Output is correct
63 Correct 800 ms 23484 KB Output is correct
64 Correct 764 ms 23164 KB Output is correct
65 Correct 296 ms 5616 KB Output is correct
66 Correct 262 ms 4696 KB Output is correct
67 Correct 602 ms 15880 KB Output is correct
68 Correct 509 ms 12120 KB Output is correct
69 Correct 472 ms 11808 KB Output is correct
70 Correct 448 ms 11676 KB Output is correct
71 Correct 450 ms 12104 KB Output is correct
72 Correct 447 ms 11924 KB Output is correct
73 Correct 352 ms 6640 KB Output is correct
74 Correct 537 ms 12384 KB Output is correct
75 Correct 782 ms 23980 KB Output is correct
76 Correct 813 ms 24052 KB Output is correct
77 Correct 135 ms 1616 KB Output is correct
78 Correct 135 ms 1524 KB Output is correct
79 Correct 139 ms 1532 KB Output is correct
80 Correct 134 ms 1520 KB Output is correct
81 Correct 540 ms 11832 KB Output is correct
82 Correct 339 ms 6524 KB Output is correct
83 Correct 248 ms 4028 KB Output is correct
84 Correct 510 ms 12392 KB Output is correct
85 Correct 623 ms 15540 KB Output is correct
86 Correct 647 ms 18248 KB Output is correct
87 Correct 438 ms 9696 KB Output is correct
88 Correct 250 ms 4076 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 7 ms 532 KB Output is correct
4 Correct 6 ms 488 KB Output is correct
5 Correct 6 ms 1364 KB Output is correct
6 Correct 9 ms 460 KB Output is correct
7 Correct 6 ms 468 KB Output is correct
8 Correct 7 ms 1060 KB Output is correct
9 Correct 8 ms 972 KB Output is correct
10 Correct 5 ms 1236 KB Output is correct
11 Correct 11 ms 584 KB Output is correct
12 Correct 11 ms 572 KB Output is correct
13 Correct 5 ms 1352 KB Output is correct
14 Correct 7 ms 940 KB Output is correct
15 Correct 6 ms 540 KB Output is correct
16 Correct 6 ms 460 KB Output is correct
17 Correct 6 ms 468 KB Output is correct
18 Correct 5 ms 1236 KB Output is correct
19 Correct 6 ms 572 KB Output is correct
20 Correct 6 ms 468 KB Output is correct
21 Correct 467 ms 12940 KB Output is correct
22 Correct 478 ms 12212 KB Output is correct
23 Correct 455 ms 12224 KB Output is correct
24 Correct 530 ms 13180 KB Output is correct
25 Correct 747 ms 23788 KB Output is correct
26 Correct 779 ms 24304 KB Output is correct
27 Correct 523 ms 11952 KB Output is correct
28 Correct 456 ms 12128 KB Output is correct
29 Correct 443 ms 12368 KB Output is correct
30 Correct 582 ms 4612 KB Output is correct
31 Correct 508 ms 6460 KB Output is correct
32 Correct 552 ms 19384 KB Output is correct
33 Correct 134 ms 1800 KB Output is correct
34 Correct 147 ms 1548 KB Output is correct
35 Correct 133 ms 1640 KB Output is correct
36 Correct 129 ms 1664 KB Output is correct
37 Correct 565 ms 19380 KB Output is correct
38 Correct 390 ms 14632 KB Output is correct
39 Correct 461 ms 15880 KB Output is correct
40 Correct 752 ms 23800 KB Output is correct
41 Correct 795 ms 23172 KB Output is correct
42 Correct 649 ms 17460 KB Output is correct
43 Correct 183 ms 2368 KB Output is correct
44 Correct 691 ms 19076 KB Output is correct
45 Correct 558 ms 14332 KB Output is correct
46 Correct 370 ms 7568 KB Output is correct
47 Correct 323 ms 6676 KB Output is correct
48 Correct 263 ms 5160 KB Output is correct
49 Correct 398 ms 11892 KB Output is correct
50 Correct 422 ms 12044 KB Output is correct
51 Correct 409 ms 12108 KB Output is correct
52 Correct 398 ms 12444 KB Output is correct
53 Correct 179 ms 2888 KB Output is correct
54 Correct 431 ms 10012 KB Output is correct
55 Correct 493 ms 13180 KB Output is correct
56 Correct 436 ms 10816 KB Output is correct
57 Correct 158 ms 1588 KB Output is correct
58 Correct 130 ms 1648 KB Output is correct
59 Correct 136 ms 1688 KB Output is correct
60 Correct 136 ms 1520 KB Output is correct
61 Correct 553 ms 14464 KB Output is correct
62 Correct 570 ms 14412 KB Output is correct
63 Correct 853 ms 23632 KB Output is correct
64 Correct 638 ms 17480 KB Output is correct
65 Correct 583 ms 14900 KB Output is correct
66 Correct 311 ms 6492 KB Output is correct
67 Correct 493 ms 12360 KB Output is correct
68 Correct 587 ms 15876 KB Output is correct
69 Correct 146 ms 2040 KB Output is correct
70 Correct 133 ms 1528 KB Output is correct
71 Correct 137 ms 1512 KB Output is correct
72 Correct 137 ms 1620 KB Output is correct
73 Correct 560 ms 20268 KB Output is correct
74 Correct 387 ms 3824 KB Output is correct
75 Correct 657 ms 20696 KB Output is correct
76 Correct 260 ms 5592 KB Output is correct
77 Correct 447 ms 9944 KB Output is correct
78 Correct 680 ms 19624 KB Output is correct
79 Correct 263 ms 4208 KB Output is correct
80 Correct 803 ms 23908 KB Output is correct
81 Correct 574 ms 14392 KB Output is correct
82 Correct 405 ms 8216 KB Output is correct
83 Correct 793 ms 22136 KB Output is correct
84 Correct 598 ms 15220 KB Output is correct
85 Correct 481 ms 12256 KB Output is correct
86 Correct 471 ms 12220 KB Output is correct
87 Correct 440 ms 11780 KB Output is correct
88 Correct 450 ms 12452 KB Output is correct
89 Correct 152 ms 1592 KB Output is correct
90 Correct 144 ms 1632 KB Output is correct
91 Correct 138 ms 1536 KB Output is correct
92 Correct 137 ms 1604 KB Output is correct
93 Correct 595 ms 7648 KB Output is correct
94 Correct 283 ms 2888 KB Output is correct
95 Correct 469 ms 15112 KB Output is correct
96 Correct 592 ms 2064 KB Output is correct
97 Correct 590 ms 14820 KB Output is correct
98 Correct 766 ms 22612 KB Output is correct
99 Correct 800 ms 23484 KB Output is correct
100 Correct 764 ms 23164 KB Output is correct
101 Correct 296 ms 5616 KB Output is correct
102 Correct 262 ms 4696 KB Output is correct
103 Correct 602 ms 15880 KB Output is correct
104 Correct 509 ms 12120 KB Output is correct
105 Correct 472 ms 11808 KB Output is correct
106 Correct 448 ms 11676 KB Output is correct
107 Correct 450 ms 12104 KB Output is correct
108 Correct 447 ms 11924 KB Output is correct
109 Correct 352 ms 6640 KB Output is correct
110 Correct 537 ms 12384 KB Output is correct
111 Correct 782 ms 23980 KB Output is correct
112 Correct 813 ms 24052 KB Output is correct
113 Correct 135 ms 1616 KB Output is correct
114 Correct 135 ms 1524 KB Output is correct
115 Correct 139 ms 1532 KB Output is correct
116 Correct 134 ms 1520 KB Output is correct
117 Correct 540 ms 11832 KB Output is correct
118 Correct 339 ms 6524 KB Output is correct
119 Correct 248 ms 4028 KB Output is correct
120 Correct 510 ms 12392 KB Output is correct
121 Correct 623 ms 15540 KB Output is correct
122 Correct 647 ms 18248 KB Output is correct
123 Correct 438 ms 9696 KB Output is correct
124 Correct 250 ms 4076 KB Output is correct
125 Correct 277 ms 2244 KB Output is correct
126 Correct 304 ms 2152 KB Output is correct
127 Correct 291 ms 2220 KB Output is correct
128 Correct 280 ms 2204 KB Output is correct
129 Correct 270 ms 2160 KB Output is correct
130 Correct 306 ms 2228 KB Output is correct
131 Correct 1348 ms 5032 KB Output is correct
132 Correct 1484 ms 21732 KB Output is correct
133 Correct 1904 ms 32212 KB Output is correct
134 Correct 559 ms 8548 KB Output is correct
135 Correct 2160 ms 38232 KB Output is correct
136 Correct 1082 ms 1544 KB Output is correct
137 Runtime error 3455 ms 49576 KB Memory limit exceeded
138 Halted 0 ms 0 KB -