oj.uz

Submission #758591

# Submission time Handle Problem Language Result Execution time Memory
758591 2023-06-14T23:48:38 Z scanhex Segments (IZhO18_segments) C++17
75 / 100
 5000 ms 31116 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() {
		coords.clear();
	}

	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;
	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);
		for (auto p : pts) {
			add(lower_bound(xs.begin(), xs.end(), p.first) - xs.begin(), p.second);
		}
		for (int i = 0; i < v.size(); ++i) 
			v[i].finalize();
	}

	int get(int xr, int y1, int y2) {
		++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 = 1000;

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

	void check_rebuild() {
		if (block.size() + erblock.size() >= BL) {
			sort(block.begin(), block.end(), ycmp);
			vector<pair<int, int>> newall(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);
	}
	void erase(int l, int r) {
		--tot;
		rofl_l.erase(l, r - l);
		rofl_r.erase(r, 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;
		//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_l" << '\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:62:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<static1d>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |   for (++x; x < v.size(); x = (x | x - 1) + 1)
      |             ~~^~~~~~~~~~
segments.cpp:62:38: warning: suggest parentheses around arithmetic in operand of '|' [-Wparentheses]
   62 |   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:78:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<static1d>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |   for (int i = 0; i < v.size(); ++i)
      |                   ~~^~~~~~~~~~
segments.cpp: In member function 'int static2d::get(int, int, int)':
segments.cpp:84:7: warning: unused variable 'xrr' [-Wunused-variable]
   84 |   int xrr = xr;
      |       ^~~
segments.cpp: In member function 'void rofl2d::check_rebuild()':
segments.cpp:117: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]
  117 |      while (ptr < newall.size() && ycmp(newall[ptr], x))
      |             ~~~~^~~~~~~~~~~~~~~
segments.cpp:122: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]
  122 |    while (ptr < newall.size())
      |           ~~~~^~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 11 ms 340 KB Output is correct
4 Correct 8 ms 340 KB Output is correct
5 Correct 10 ms 1108 KB Output is correct
6 Correct 15 ms 852 KB Output is correct
7 Correct 10 ms 536 KB Output is correct
8 Correct 10 ms 912 KB Output is correct
9 Correct 9 ms 852 KB Output is correct
10 Correct 7 ms 1108 KB Output is correct
11 Correct 17 ms 724 KB Output is correct
12 Correct 15 ms 736 KB Output is correct
13 Correct 8 ms 1108 KB Output is correct
14 Correct 10 ms 852 KB Output is correct
15 Correct 7 ms 372 KB Output is correct
16 Correct 8 ms 384 KB Output is correct
17 Correct 13 ms 664 KB Output is correct
18 Correct 8 ms 1108 KB Output is correct
19 Correct 12 ms 596 KB Output is correct
20 Correct 9 ms 596 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1162 ms 11700 KB Output is correct
2 Correct 1095 ms 11772 KB Output is correct
3 Correct 1228 ms 11392 KB Output is correct
4 Correct 1195 ms 13236 KB Output is correct
5 Correct 2340 ms 22156 KB Output is correct
6 Correct 2507 ms 23232 KB Output is correct
7 Correct 1109 ms 11216 KB Output is correct
8 Correct 1191 ms 11612 KB Output is correct
9 Correct 1166 ms 11700 KB Output is correct
10 Correct 516 ms 4844 KB Output is correct
11 Correct 438 ms 6376 KB Output is correct
12 Correct 1500 ms 18680 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 188 ms 1048 KB Output is correct
2 Correct 183 ms 1012 KB Output is correct
3 Correct 194 ms 1120 KB Output is correct
4 Correct 168 ms 1056 KB Output is correct
5 Correct 1550 ms 18632 KB Output is correct
6 Correct 1232 ms 14556 KB Output is correct
7 Correct 1436 ms 16412 KB Output is correct
8 Correct 2548 ms 23056 KB Output is correct
9 Correct 2513 ms 22428 KB Output is correct
10 Correct 1873 ms 15896 KB Output is correct
11 Correct 239 ms 1876 KB Output is correct
12 Correct 1953 ms 18500 KB Output is correct
13 Correct 1610 ms 13516 KB Output is correct
14 Correct 915 ms 6580 KB Output is correct
15 Correct 760 ms 5700 KB Output is correct
16 Correct 538 ms 4348 KB Output is correct
17 Correct 668 ms 12084 KB Output is correct
18 Correct 1031 ms 11468 KB Output is correct
19 Correct 1006 ms 11952 KB Output is correct
20 Correct 667 ms 11980 KB Output is correct
21 Correct 286 ms 2272 KB Output is correct
22 Correct 1092 ms 9032 KB Output is correct
23 Correct 1439 ms 11864 KB Output is correct
24 Correct 1242 ms 9448 KB Output is correct
25 Correct 176 ms 1068 KB Output is correct
26 Correct 177 ms 972 KB Output is correct
27 Correct 165 ms 1104 KB Output is correct
28 Correct 160 ms 992 KB Output is correct
29 Correct 1589 ms 13436 KB Output is correct
30 Correct 1553 ms 13600 KB Output is correct
31 Correct 2437 ms 22848 KB Output is correct
32 Correct 1854 ms 16220 KB Output is correct
33 Correct 1695 ms 14100 KB Output is correct
34 Correct 669 ms 5804 KB Output is correct
35 Correct 1344 ms 11192 KB Output is correct
36 Correct 1748 ms 14396 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 177 ms 960 KB Output is correct
2 Correct 166 ms 1044 KB Output is correct
3 Correct 171 ms 1100 KB Output is correct
4 Correct 175 ms 1084 KB Output is correct
5 Correct 1711 ms 19036 KB Output is correct
6 Correct 716 ms 3456 KB Output is correct
7 Correct 2053 ms 20712 KB Output is correct
8 Correct 748 ms 4888 KB Output is correct
9 Correct 1279 ms 8940 KB Output is correct
10 Correct 2290 ms 18764 KB Output is correct
11 Correct 528 ms 3636 KB Output is correct
12 Correct 2702 ms 23588 KB Output is correct
13 Correct 1798 ms 13432 KB Output is correct
14 Correct 1181 ms 7248 KB Output is correct
15 Correct 2640 ms 19388 KB Output is correct
16 Correct 2028 ms 13900 KB Output is correct
17 Correct 1308 ms 12008 KB Output is correct
18 Correct 1278 ms 11448 KB Output is correct
19 Correct 1205 ms 11416 KB Output is correct
20 Correct 1350 ms 11848 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 11 ms 340 KB Output is correct
4 Correct 8 ms 340 KB Output is correct
5 Correct 10 ms 1108 KB Output is correct
6 Correct 15 ms 852 KB Output is correct
7 Correct 10 ms 536 KB Output is correct
8 Correct 10 ms 912 KB Output is correct
9 Correct 9 ms 852 KB Output is correct
10 Correct 7 ms 1108 KB Output is correct
11 Correct 17 ms 724 KB Output is correct
12 Correct 15 ms 736 KB Output is correct
13 Correct 8 ms 1108 KB Output is correct
14 Correct 10 ms 852 KB Output is correct
15 Correct 7 ms 372 KB Output is correct
16 Correct 8 ms 384 KB Output is correct
17 Correct 13 ms 664 KB Output is correct
18 Correct 8 ms 1108 KB Output is correct
19 Correct 12 ms 596 KB Output is correct
20 Correct 9 ms 596 KB Output is correct
21 Correct 1162 ms 11700 KB Output is correct
22 Correct 1095 ms 11772 KB Output is correct
23 Correct 1228 ms 11392 KB Output is correct
24 Correct 1195 ms 13236 KB Output is correct
25 Correct 2340 ms 22156 KB Output is correct
26 Correct 2507 ms 23232 KB Output is correct
27 Correct 1109 ms 11216 KB Output is correct
28 Correct 1191 ms 11612 KB Output is correct
29 Correct 1166 ms 11700 KB Output is correct
30 Correct 516 ms 4844 KB Output is correct
31 Correct 438 ms 6376 KB Output is correct
32 Correct 1500 ms 18680 KB Output is correct
33 Correct 177 ms 960 KB Output is correct
34 Correct 166 ms 1044 KB Output is correct
35 Correct 171 ms 1100 KB Output is correct
36 Correct 175 ms 1084 KB Output is correct
37 Correct 1711 ms 19036 KB Output is correct
38 Correct 716 ms 3456 KB Output is correct
39 Correct 2053 ms 20712 KB Output is correct
40 Correct 748 ms 4888 KB Output is correct
41 Correct 1279 ms 8940 KB Output is correct
42 Correct 2290 ms 18764 KB Output is correct
43 Correct 528 ms 3636 KB Output is correct
44 Correct 2702 ms 23588 KB Output is correct
45 Correct 1798 ms 13432 KB Output is correct
46 Correct 1181 ms 7248 KB Output is correct
47 Correct 2640 ms 19388 KB Output is correct
48 Correct 2028 ms 13900 KB Output is correct
49 Correct 1308 ms 12008 KB Output is correct
50 Correct 1278 ms 11448 KB Output is correct
51 Correct 1205 ms 11416 KB Output is correct
52 Correct 1350 ms 11848 KB Output is correct
53 Correct 205 ms 1056 KB Output is correct
54 Correct 197 ms 1008 KB Output is correct
55 Correct 188 ms 1084 KB Output is correct
56 Correct 186 ms 1084 KB Output is correct
57 Correct 906 ms 7268 KB Output is correct
58 Correct 240 ms 2604 KB Output is correct
59 Correct 1192 ms 13808 KB Output is correct
60 Correct 572 ms 2084 KB Output is correct
61 Correct 1728 ms 13608 KB Output is correct
62 Correct 2388 ms 21212 KB Output is correct
63 Correct 2773 ms 22968 KB Output is correct
64 Correct 2633 ms 21972 KB Output is correct
65 Correct 697 ms 4756 KB Output is correct
66 Correct 594 ms 3880 KB Output is correct
67 Correct 1963 ms 13916 KB Output is correct
68 Correct 1549 ms 11140 KB Output is correct
69 Correct 1142 ms 11432 KB Output is correct
70 Correct 1185 ms 10968 KB Output is correct
71 Correct 1276 ms 11508 KB Output is correct
72 Correct 1281 ms 11476 KB Output is correct
73 Correct 840 ms 5512 KB Output is correct
74 Correct 1516 ms 10872 KB Output is correct
75 Correct 2875 ms 23856 KB Output is correct
76 Correct 2740 ms 23036 KB Output is correct
77 Correct 180 ms 980 KB Output is correct
78 Correct 177 ms 984 KB Output is correct
79 Correct 183 ms 1096 KB Output is correct
80 Correct 187 ms 1140 KB Output is correct
81 Correct 1469 ms 10280 KB Output is correct
82 Correct 785 ms 5576 KB Output is correct
83 Correct 514 ms 3432 KB Output is correct
84 Correct 1548 ms 10404 KB Output is correct
85 Correct 1908 ms 14444 KB Output is correct
86 Correct 2136 ms 16156 KB Output is correct
87 Correct 1257 ms 8456 KB Output is correct
88 Correct 527 ms 3580 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 11 ms 340 KB Output is correct
4 Correct 8 ms 340 KB Output is correct
5 Correct 10 ms 1108 KB Output is correct
6 Correct 15 ms 852 KB Output is correct
7 Correct 10 ms 536 KB Output is correct
8 Correct 10 ms 912 KB Output is correct
9 Correct 9 ms 852 KB Output is correct
10 Correct 7 ms 1108 KB Output is correct
11 Correct 17 ms 724 KB Output is correct
12 Correct 15 ms 736 KB Output is correct
13 Correct 8 ms 1108 KB Output is correct
14 Correct 10 ms 852 KB Output is correct
15 Correct 7 ms 372 KB Output is correct
16 Correct 8 ms 384 KB Output is correct
17 Correct 13 ms 664 KB Output is correct
18 Correct 8 ms 1108 KB Output is correct
19 Correct 12 ms 596 KB Output is correct
20 Correct 9 ms 596 KB Output is correct
21 Correct 1162 ms 11700 KB Output is correct
22 Correct 1095 ms 11772 KB Output is correct
23 Correct 1228 ms 11392 KB Output is correct
24 Correct 1195 ms 13236 KB Output is correct
25 Correct 2340 ms 22156 KB Output is correct
26 Correct 2507 ms 23232 KB Output is correct
27 Correct 1109 ms 11216 KB Output is correct
28 Correct 1191 ms 11612 KB Output is correct
29 Correct 1166 ms 11700 KB Output is correct
30 Correct 516 ms 4844 KB Output is correct
31 Correct 438 ms 6376 KB Output is correct
32 Correct 1500 ms 18680 KB Output is correct
33 Correct 188 ms 1048 KB Output is correct
34 Correct 183 ms 1012 KB Output is correct
35 Correct 194 ms 1120 KB Output is correct
36 Correct 168 ms 1056 KB Output is correct
37 Correct 1550 ms 18632 KB Output is correct
38 Correct 1232 ms 14556 KB Output is correct
39 Correct 1436 ms 16412 KB Output is correct
40 Correct 2548 ms 23056 KB Output is correct
41 Correct 2513 ms 22428 KB Output is correct
42 Correct 1873 ms 15896 KB Output is correct
43 Correct 239 ms 1876 KB Output is correct
44 Correct 1953 ms 18500 KB Output is correct
45 Correct 1610 ms 13516 KB Output is correct
46 Correct 915 ms 6580 KB Output is correct
47 Correct 760 ms 5700 KB Output is correct
48 Correct 538 ms 4348 KB Output is correct
49 Correct 668 ms 12084 KB Output is correct
50 Correct 1031 ms 11468 KB Output is correct
51 Correct 1006 ms 11952 KB Output is correct
52 Correct 667 ms 11980 KB Output is correct
53 Correct 286 ms 2272 KB Output is correct
54 Correct 1092 ms 9032 KB Output is correct
55 Correct 1439 ms 11864 KB Output is correct
56 Correct 1242 ms 9448 KB Output is correct
57 Correct 176 ms 1068 KB Output is correct
58 Correct 177 ms 972 KB Output is correct
59 Correct 165 ms 1104 KB Output is correct
60 Correct 160 ms 992 KB Output is correct
61 Correct 1589 ms 13436 KB Output is correct
62 Correct 1553 ms 13600 KB Output is correct
63 Correct 2437 ms 22848 KB Output is correct
64 Correct 1854 ms 16220 KB Output is correct
65 Correct 1695 ms 14100 KB Output is correct
66 Correct 669 ms 5804 KB Output is correct
67 Correct 1344 ms 11192 KB Output is correct
68 Correct 1748 ms 14396 KB Output is correct
69 Correct 177 ms 960 KB Output is correct
70 Correct 166 ms 1044 KB Output is correct
71 Correct 171 ms 1100 KB Output is correct
72 Correct 175 ms 1084 KB Output is correct
73 Correct 1711 ms 19036 KB Output is correct
74 Correct 716 ms 3456 KB Output is correct
75 Correct 2053 ms 20712 KB Output is correct
76 Correct 748 ms 4888 KB Output is correct
77 Correct 1279 ms 8940 KB Output is correct
78 Correct 2290 ms 18764 KB Output is correct
79 Correct 528 ms 3636 KB Output is correct
80 Correct 2702 ms 23588 KB Output is correct
81 Correct 1798 ms 13432 KB Output is correct
82 Correct 1181 ms 7248 KB Output is correct
83 Correct 2640 ms 19388 KB Output is correct
84 Correct 2028 ms 13900 KB Output is correct
85 Correct 1308 ms 12008 KB Output is correct
86 Correct 1278 ms 11448 KB Output is correct
87 Correct 1205 ms 11416 KB Output is correct
88 Correct 1350 ms 11848 KB Output is correct
89 Correct 205 ms 1056 KB Output is correct
90 Correct 197 ms 1008 KB Output is correct
91 Correct 188 ms 1084 KB Output is correct
92 Correct 186 ms 1084 KB Output is correct
93 Correct 906 ms 7268 KB Output is correct
94 Correct 240 ms 2604 KB Output is correct
95 Correct 1192 ms 13808 KB Output is correct
96 Correct 572 ms 2084 KB Output is correct
97 Correct 1728 ms 13608 KB Output is correct
98 Correct 2388 ms 21212 KB Output is correct
99 Correct 2773 ms 22968 KB Output is correct
100 Correct 2633 ms 21972 KB Output is correct
101 Correct 697 ms 4756 KB Output is correct
102 Correct 594 ms 3880 KB Output is correct
103 Correct 1963 ms 13916 KB Output is correct
104 Correct 1549 ms 11140 KB Output is correct
105 Correct 1142 ms 11432 KB Output is correct
106 Correct 1185 ms 10968 KB Output is correct
107 Correct 1276 ms 11508 KB Output is correct
108 Correct 1281 ms 11476 KB Output is correct
109 Correct 840 ms 5512 KB Output is correct
110 Correct 1516 ms 10872 KB Output is correct
111 Correct 2875 ms 23856 KB Output is correct
112 Correct 2740 ms 23036 KB Output is correct
113 Correct 180 ms 980 KB Output is correct
114 Correct 177 ms 984 KB Output is correct
115 Correct 183 ms 1096 KB Output is correct
116 Correct 187 ms 1140 KB Output is correct
117 Correct 1469 ms 10280 KB Output is correct
118 Correct 785 ms 5576 KB Output is correct
119 Correct 514 ms 3432 KB Output is correct
120 Correct 1548 ms 10404 KB Output is correct
121 Correct 1908 ms 14444 KB Output is correct
122 Correct 2136 ms 16156 KB Output is correct
123 Correct 1257 ms 8456 KB Output is correct
124 Correct 527 ms 3580 KB Output is correct
125 Correct 380 ms 1768 KB Output is correct
126 Correct 404 ms 1684 KB Output is correct
127 Correct 469 ms 1696 KB Output is correct
128 Correct 389 ms 1692 KB Output is correct
129 Correct 402 ms 1628 KB Output is correct
130 Correct 383 ms 1652 KB Output is correct
131 Correct 1879 ms 5224 KB Output is correct
132 Correct 3306 ms 21632 KB Output is correct
133 Execution timed out 5040 ms 31116 KB Time limit exceeded
134 Halted 0 ms 0 KB -