oj.uz

Submission #758652

# Submission time Handle Problem Language Result Execution time Memory
758652 2023-06-15T04:38:33 Z scanhex Segments (IZhO18_segments) C++17
75 / 100
 3380 ms 45428 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) {
		vector<int>{}.swap(xs);
		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;
	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 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 6 ms 340 KB Output is correct
4 Correct 6 ms 424 KB Output is correct
5 Correct 6 ms 1096 KB Output is correct
6 Correct 8 ms 340 KB Output is correct
7 Correct 6 ms 468 KB Output is correct
8 Correct 9 ms 980 KB Output is correct
9 Correct 7 ms 852 KB Output is correct
10 Correct 5 ms 1108 KB Output is correct
11 Correct 11 ms 444 KB Output is correct
12 Correct 14 ms 340 KB Output is correct
13 Correct 5 ms 1108 KB Output is correct
14 Correct 7 ms 852 KB Output is correct
15 Correct 7 ms 436 KB Output is correct
16 Correct 5 ms 340 KB Output is correct
17 Correct 6 ms 452 KB Output is correct
18 Correct 5 ms 1108 KB Output is correct
19 Correct 6 ms 468 KB Output is correct
20 Correct 6 ms 452 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 496 ms 11604 KB Output is correct
2 Correct 524 ms 11344 KB Output is correct
3 Correct 489 ms 11556 KB Output is correct
4 Correct 601 ms 12216 KB Output is correct
5 Correct 741 ms 22252 KB Output is correct
6 Correct 829 ms 22936 KB Output is correct
7 Correct 503 ms 11180 KB Output is correct
8 Correct 493 ms 11312 KB Output is correct
9 Correct 475 ms 11412 KB Output is correct
10 Correct 651 ms 3988 KB Output is correct
11 Correct 589 ms 5808 KB Output is correct
12 Correct 587 ms 18456 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 1244 KB Output is correct
2 Correct 133 ms 1236 KB Output is correct
3 Correct 136 ms 1132 KB Output is correct
4 Correct 129 ms 1184 KB Output is correct
5 Correct 577 ms 18008 KB Output is correct
6 Correct 394 ms 13772 KB Output is correct
7 Correct 465 ms 15096 KB Output is correct
8 Correct 780 ms 22324 KB Output is correct
9 Correct 786 ms 22080 KB Output is correct
10 Correct 648 ms 16588 KB Output is correct
11 Correct 164 ms 1864 KB Output is correct
12 Correct 691 ms 17788 KB Output is correct
13 Correct 578 ms 13604 KB Output is correct
14 Correct 351 ms 7004 KB Output is correct
15 Correct 336 ms 6064 KB Output is correct
16 Correct 263 ms 4640 KB Output is correct
17 Correct 418 ms 11228 KB Output is correct
18 Correct 400 ms 11312 KB Output is correct
19 Correct 419 ms 11332 KB Output is correct
20 Correct 403 ms 11508 KB Output is correct
21 Correct 188 ms 2500 KB Output is correct
22 Correct 411 ms 9488 KB Output is correct
23 Correct 508 ms 11988 KB Output is correct
24 Correct 432 ms 9848 KB Output is correct
25 Correct 136 ms 1200 KB Output is correct
26 Correct 129 ms 1184 KB Output is correct
27 Correct 131 ms 1204 KB Output is correct
28 Correct 129 ms 1164 KB Output is correct
29 Correct 558 ms 13772 KB Output is correct
30 Correct 560 ms 13720 KB Output is correct
31 Correct 771 ms 21800 KB Output is correct
32 Correct 649 ms 16520 KB Output is correct
33 Correct 575 ms 13912 KB Output is correct
34 Correct 317 ms 5872 KB Output is correct
35 Correct 498 ms 11192 KB Output is correct
36 Correct 585 ms 15144 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 1336 KB Output is correct
2 Correct 132 ms 1232 KB Output is correct
3 Correct 135 ms 1160 KB Output is correct
4 Correct 151 ms 1132 KB Output is correct
5 Correct 564 ms 18580 KB Output is correct
6 Correct 418 ms 3328 KB Output is correct
7 Correct 673 ms 20144 KB Output is correct
8 Correct 272 ms 5020 KB Output is correct
9 Correct 433 ms 9216 KB Output is correct
10 Correct 673 ms 18276 KB Output is correct
11 Correct 287 ms 3656 KB Output is correct
12 Correct 784 ms 22760 KB Output is correct
13 Correct 580 ms 13556 KB Output is correct
14 Correct 442 ms 7552 KB Output is correct
15 Correct 788 ms 20596 KB Output is correct
16 Correct 625 ms 14372 KB Output is correct
17 Correct 480 ms 11392 KB Output is correct
18 Correct 482 ms 11216 KB Output is correct
19 Correct 477 ms 11000 KB Output is correct
20 Correct 488 ms 11380 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 6 ms 340 KB Output is correct
4 Correct 6 ms 424 KB Output is correct
5 Correct 6 ms 1096 KB Output is correct
6 Correct 8 ms 340 KB Output is correct
7 Correct 6 ms 468 KB Output is correct
8 Correct 9 ms 980 KB Output is correct
9 Correct 7 ms 852 KB Output is correct
10 Correct 5 ms 1108 KB Output is correct
11 Correct 11 ms 444 KB Output is correct
12 Correct 14 ms 340 KB Output is correct
13 Correct 5 ms 1108 KB Output is correct
14 Correct 7 ms 852 KB Output is correct
15 Correct 7 ms 436 KB Output is correct
16 Correct 5 ms 340 KB Output is correct
17 Correct 6 ms 452 KB Output is correct
18 Correct 5 ms 1108 KB Output is correct
19 Correct 6 ms 468 KB Output is correct
20 Correct 6 ms 452 KB Output is correct
21 Correct 496 ms 11604 KB Output is correct
22 Correct 524 ms 11344 KB Output is correct
23 Correct 489 ms 11556 KB Output is correct
24 Correct 601 ms 12216 KB Output is correct
25 Correct 741 ms 22252 KB Output is correct
26 Correct 829 ms 22936 KB Output is correct
27 Correct 503 ms 11180 KB Output is correct
28 Correct 493 ms 11312 KB Output is correct
29 Correct 475 ms 11412 KB Output is correct
30 Correct 651 ms 3988 KB Output is correct
31 Correct 589 ms 5808 KB Output is correct
32 Correct 587 ms 18456 KB Output is correct
33 Correct 133 ms 1336 KB Output is correct
34 Correct 132 ms 1232 KB Output is correct
35 Correct 135 ms 1160 KB Output is correct
36 Correct 151 ms 1132 KB Output is correct
37 Correct 564 ms 18580 KB Output is correct
38 Correct 418 ms 3328 KB Output is correct
39 Correct 673 ms 20144 KB Output is correct
40 Correct 272 ms 5020 KB Output is correct
41 Correct 433 ms 9216 KB Output is correct
42 Correct 673 ms 18276 KB Output is correct
43 Correct 287 ms 3656 KB Output is correct
44 Correct 784 ms 22760 KB Output is correct
45 Correct 580 ms 13556 KB Output is correct
46 Correct 442 ms 7552 KB Output is correct
47 Correct 788 ms 20596 KB Output is correct
48 Correct 625 ms 14372 KB Output is correct
49 Correct 480 ms 11392 KB Output is correct
50 Correct 482 ms 11216 KB Output is correct
51 Correct 477 ms 11000 KB Output is correct
52 Correct 488 ms 11380 KB Output is correct
53 Correct 138 ms 1164 KB Output is correct
54 Correct 139 ms 1152 KB Output is correct
55 Correct 160 ms 1224 KB Output is correct
56 Correct 135 ms 1244 KB Output is correct
57 Correct 629 ms 6788 KB Output is correct
58 Correct 324 ms 2460 KB Output is correct
59 Correct 492 ms 14000 KB Output is correct
60 Correct 623 ms 1608 KB Output is correct
61 Correct 623 ms 13560 KB Output is correct
62 Correct 750 ms 21412 KB Output is correct
63 Correct 807 ms 22216 KB Output is correct
64 Correct 743 ms 21872 KB Output is correct
65 Correct 309 ms 4916 KB Output is correct
66 Correct 279 ms 4380 KB Output is correct
67 Correct 602 ms 14900 KB Output is correct
68 Correct 560 ms 11256 KB Output is correct
69 Correct 482 ms 11152 KB Output is correct
70 Correct 474 ms 11008 KB Output is correct
71 Correct 516 ms 11296 KB Output is correct
72 Correct 469 ms 11396 KB Output is correct
73 Correct 357 ms 5856 KB Output is correct
74 Correct 527 ms 11564 KB Output is correct
75 Correct 787 ms 22664 KB Output is correct
76 Correct 797 ms 22372 KB Output is correct
77 Correct 142 ms 1164 KB Output is correct
78 Correct 148 ms 1148 KB Output is correct
79 Correct 138 ms 1096 KB Output is correct
80 Correct 136 ms 1164 KB Output is correct
81 Correct 554 ms 10992 KB Output is correct
82 Correct 372 ms 5784 KB Output is correct
83 Correct 252 ms 3448 KB Output is correct
84 Correct 515 ms 11220 KB Output is correct
85 Correct 606 ms 14616 KB Output is correct
86 Correct 676 ms 17032 KB Output is correct
87 Correct 429 ms 8896 KB Output is correct
88 Correct 274 ms 3588 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 6 ms 340 KB Output is correct
4 Correct 6 ms 424 KB Output is correct
5 Correct 6 ms 1096 KB Output is correct
6 Correct 8 ms 340 KB Output is correct
7 Correct 6 ms 468 KB Output is correct
8 Correct 9 ms 980 KB Output is correct
9 Correct 7 ms 852 KB Output is correct
10 Correct 5 ms 1108 KB Output is correct
11 Correct 11 ms 444 KB Output is correct
12 Correct 14 ms 340 KB Output is correct
13 Correct 5 ms 1108 KB Output is correct
14 Correct 7 ms 852 KB Output is correct
15 Correct 7 ms 436 KB Output is correct
16 Correct 5 ms 340 KB Output is correct
17 Correct 6 ms 452 KB Output is correct
18 Correct 5 ms 1108 KB Output is correct
19 Correct 6 ms 468 KB Output is correct
20 Correct 6 ms 452 KB Output is correct
21 Correct 496 ms 11604 KB Output is correct
22 Correct 524 ms 11344 KB Output is correct
23 Correct 489 ms 11556 KB Output is correct
24 Correct 601 ms 12216 KB Output is correct
25 Correct 741 ms 22252 KB Output is correct
26 Correct 829 ms 22936 KB Output is correct
27 Correct 503 ms 11180 KB Output is correct
28 Correct 493 ms 11312 KB Output is correct
29 Correct 475 ms 11412 KB Output is correct
30 Correct 651 ms 3988 KB Output is correct
31 Correct 589 ms 5808 KB Output is correct
32 Correct 587 ms 18456 KB Output is correct
33 Correct 134 ms 1244 KB Output is correct
34 Correct 133 ms 1236 KB Output is correct
35 Correct 136 ms 1132 KB Output is correct
36 Correct 129 ms 1184 KB Output is correct
37 Correct 577 ms 18008 KB Output is correct
38 Correct 394 ms 13772 KB Output is correct
39 Correct 465 ms 15096 KB Output is correct
40 Correct 780 ms 22324 KB Output is correct
41 Correct 786 ms 22080 KB Output is correct
42 Correct 648 ms 16588 KB Output is correct
43 Correct 164 ms 1864 KB Output is correct
44 Correct 691 ms 17788 KB Output is correct
45 Correct 578 ms 13604 KB Output is correct
46 Correct 351 ms 7004 KB Output is correct
47 Correct 336 ms 6064 KB Output is correct
48 Correct 263 ms 4640 KB Output is correct
49 Correct 418 ms 11228 KB Output is correct
50 Correct 400 ms 11312 KB Output is correct
51 Correct 419 ms 11332 KB Output is correct
52 Correct 403 ms 11508 KB Output is correct
53 Correct 188 ms 2500 KB Output is correct
54 Correct 411 ms 9488 KB Output is correct
55 Correct 508 ms 11988 KB Output is correct
56 Correct 432 ms 9848 KB Output is correct
57 Correct 136 ms 1200 KB Output is correct
58 Correct 129 ms 1184 KB Output is correct
59 Correct 131 ms 1204 KB Output is correct
60 Correct 129 ms 1164 KB Output is correct
61 Correct 558 ms 13772 KB Output is correct
62 Correct 560 ms 13720 KB Output is correct
63 Correct 771 ms 21800 KB Output is correct
64 Correct 649 ms 16520 KB Output is correct
65 Correct 575 ms 13912 KB Output is correct
66 Correct 317 ms 5872 KB Output is correct
67 Correct 498 ms 11192 KB Output is correct
68 Correct 585 ms 15144 KB Output is correct
69 Correct 133 ms 1336 KB Output is correct
70 Correct 132 ms 1232 KB Output is correct
71 Correct 135 ms 1160 KB Output is correct
72 Correct 151 ms 1132 KB Output is correct
73 Correct 564 ms 18580 KB Output is correct
74 Correct 418 ms 3328 KB Output is correct
75 Correct 673 ms 20144 KB Output is correct
76 Correct 272 ms 5020 KB Output is correct
77 Correct 433 ms 9216 KB Output is correct
78 Correct 673 ms 18276 KB Output is correct
79 Correct 287 ms 3656 KB Output is correct
80 Correct 784 ms 22760 KB Output is correct
81 Correct 580 ms 13556 KB Output is correct
82 Correct 442 ms 7552 KB Output is correct
83 Correct 788 ms 20596 KB Output is correct
84 Correct 625 ms 14372 KB Output is correct
85 Correct 480 ms 11392 KB Output is correct
86 Correct 482 ms 11216 KB Output is correct
87 Correct 477 ms 11000 KB Output is correct
88 Correct 488 ms 11380 KB Output is correct
89 Correct 138 ms 1164 KB Output is correct
90 Correct 139 ms 1152 KB Output is correct
91 Correct 160 ms 1224 KB Output is correct
92 Correct 135 ms 1244 KB Output is correct
93 Correct 629 ms 6788 KB Output is correct
94 Correct 324 ms 2460 KB Output is correct
95 Correct 492 ms 14000 KB Output is correct
96 Correct 623 ms 1608 KB Output is correct
97 Correct 623 ms 13560 KB Output is correct
98 Correct 750 ms 21412 KB Output is correct
99 Correct 807 ms 22216 KB Output is correct
100 Correct 743 ms 21872 KB Output is correct
101 Correct 309 ms 4916 KB Output is correct
102 Correct 279 ms 4380 KB Output is correct
103 Correct 602 ms 14900 KB Output is correct
104 Correct 560 ms 11256 KB Output is correct
105 Correct 482 ms 11152 KB Output is correct
106 Correct 474 ms 11008 KB Output is correct
107 Correct 516 ms 11296 KB Output is correct
108 Correct 469 ms 11396 KB Output is correct
109 Correct 357 ms 5856 KB Output is correct
110 Correct 527 ms 11564 KB Output is correct
111 Correct 787 ms 22664 KB Output is correct
112 Correct 797 ms 22372 KB Output is correct
113 Correct 142 ms 1164 KB Output is correct
114 Correct 148 ms 1148 KB Output is correct
115 Correct 138 ms 1096 KB Output is correct
116 Correct 136 ms 1164 KB Output is correct
117 Correct 554 ms 10992 KB Output is correct
118 Correct 372 ms 5784 KB Output is correct
119 Correct 252 ms 3448 KB Output is correct
120 Correct 515 ms 11220 KB Output is correct
121 Correct 606 ms 14616 KB Output is correct
122 Correct 676 ms 17032 KB Output is correct
123 Correct 429 ms 8896 KB Output is correct
124 Correct 274 ms 3588 KB Output is correct
125 Correct 277 ms 1864 KB Output is correct
126 Correct 303 ms 1920 KB Output is correct
127 Correct 288 ms 1760 KB Output is correct
128 Correct 282 ms 1708 KB Output is correct
129 Correct 273 ms 1768 KB Output is correct
130 Correct 300 ms 1844 KB Output is correct
131 Correct 1443 ms 4532 KB Output is correct
132 Correct 1611 ms 20668 KB Output is correct
133 Correct 1959 ms 30952 KB Output is correct
134 Correct 664 ms 7992 KB Output is correct
135 Correct 2241 ms 37196 KB Output is correct
136 Correct 1081 ms 1236 KB Output is correct
137 Runtime error 3380 ms 45428 KB Memory limit exceeded
138 Halted 0 ms 0 KB -