oj.uz

Submission #758595

# Submission time Handle Problem Language Result Execution time Memory
758595 2023-06-14T23:54:44 Z scanhex Segments (IZhO18_segments) C++17
75 / 100
 5000 ms 45476 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;
	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 = 3000;

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);
	}
	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:118: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]
  118 |      while (ptr < newall.size() && ycmp(newall[ptr], x))
      |             ~~~~^~~~~~~~~~~~~~~
segments.cpp:123: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]
  123 |    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 19 ms 432 KB Output is correct
4 Correct 18 ms 436 KB Output is correct
5 Correct 14 ms 980 KB Output is correct
6 Correct 13 ms 1004 KB Output is correct
7 Correct 18 ms 532 KB Output is correct
8 Correct 10 ms 852 KB Output is correct
9 Correct 14 ms 948 KB Output is correct
10 Correct 6 ms 980 KB Output is correct
11 Correct 44 ms 440 KB Output is correct
12 Correct 44 ms 432 KB Output is correct
13 Correct 7 ms 1028 KB Output is correct
14 Correct 15 ms 820 KB Output is correct
15 Correct 23 ms 436 KB Output is correct
16 Correct 17 ms 340 KB Output is correct
17 Correct 18 ms 596 KB Output is correct
18 Correct 8 ms 980 KB Output is correct
19 Correct 15 ms 644 KB Output is correct
20 Correct 15 ms 644 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1217 ms 11484 KB Output is correct
2 Correct 1223 ms 11200 KB Output is correct
3 Correct 1197 ms 11496 KB Output is correct
4 Correct 909 ms 13260 KB Output is correct
5 Correct 1266 ms 22720 KB Output is correct
6 Correct 1347 ms 23556 KB Output is correct
7 Correct 1255 ms 11232 KB Output is correct
8 Correct 1208 ms 11260 KB Output is correct
9 Correct 1222 ms 11444 KB Output is correct
10 Correct 998 ms 4708 KB Output is correct
11 Correct 358 ms 6548 KB Output is correct
12 Correct 1108 ms 17420 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 392 ms 1320 KB Output is correct
2 Correct 391 ms 1348 KB Output is correct
3 Correct 418 ms 1224 KB Output is correct
4 Correct 396 ms 1196 KB Output is correct
5 Correct 1219 ms 17888 KB Output is correct
6 Correct 678 ms 13960 KB Output is correct
7 Correct 1252 ms 14896 KB Output is correct
8 Correct 1376 ms 22212 KB Output is correct
9 Correct 1289 ms 22156 KB Output is correct
10 Correct 1095 ms 15364 KB Output is correct
11 Correct 460 ms 1912 KB Output is correct
12 Correct 1155 ms 17788 KB Output is correct
13 Correct 988 ms 13812 KB Output is correct
14 Correct 677 ms 7208 KB Output is correct
15 Correct 624 ms 6300 KB Output is correct
16 Correct 643 ms 4352 KB Output is correct
17 Correct 1122 ms 11684 KB Output is correct
18 Correct 1062 ms 11588 KB Output is correct
19 Correct 1071 ms 11224 KB Output is correct
20 Correct 1074 ms 11580 KB Output is correct
21 Correct 481 ms 2552 KB Output is correct
22 Correct 771 ms 9068 KB Output is correct
23 Correct 900 ms 12640 KB Output is correct
24 Correct 803 ms 9956 KB Output is correct
25 Correct 379 ms 1196 KB Output is correct
26 Correct 393 ms 1196 KB Output is correct
27 Correct 381 ms 1272 KB Output is correct
28 Correct 390 ms 1284 KB Output is correct
29 Correct 947 ms 13532 KB Output is correct
30 Correct 1018 ms 13884 KB Output is correct
31 Correct 1266 ms 22404 KB Output is correct
32 Correct 1058 ms 15404 KB Output is correct
33 Correct 945 ms 14156 KB Output is correct
34 Correct 671 ms 6260 KB Output is correct
35 Correct 841 ms 11464 KB Output is correct
36 Correct 999 ms 15328 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 377 ms 1112 KB Output is correct
2 Correct 373 ms 1216 KB Output is correct
3 Correct 379 ms 1096 KB Output is correct
4 Correct 382 ms 1236 KB Output is correct
5 Correct 1112 ms 18724 KB Output is correct
6 Correct 1223 ms 3452 KB Output is correct
7 Correct 1190 ms 20220 KB Output is correct
8 Correct 1628 ms 4644 KB Output is correct
9 Correct 797 ms 9116 KB Output is correct
10 Correct 1152 ms 18304 KB Output is correct
11 Correct 551 ms 3992 KB Output is correct
12 Correct 1261 ms 23084 KB Output is correct
13 Correct 983 ms 13784 KB Output is correct
14 Correct 722 ms 7464 KB Output is correct
15 Correct 1262 ms 20808 KB Output is correct
16 Correct 1039 ms 14900 KB Output is correct
17 Correct 1166 ms 12028 KB Output is correct
18 Correct 1145 ms 11304 KB Output is correct
19 Correct 1115 ms 11620 KB Output is correct
20 Correct 1180 ms 11912 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 19 ms 432 KB Output is correct
4 Correct 18 ms 436 KB Output is correct
5 Correct 14 ms 980 KB Output is correct
6 Correct 13 ms 1004 KB Output is correct
7 Correct 18 ms 532 KB Output is correct
8 Correct 10 ms 852 KB Output is correct
9 Correct 14 ms 948 KB Output is correct
10 Correct 6 ms 980 KB Output is correct
11 Correct 44 ms 440 KB Output is correct
12 Correct 44 ms 432 KB Output is correct
13 Correct 7 ms 1028 KB Output is correct
14 Correct 15 ms 820 KB Output is correct
15 Correct 23 ms 436 KB Output is correct
16 Correct 17 ms 340 KB Output is correct
17 Correct 18 ms 596 KB Output is correct
18 Correct 8 ms 980 KB Output is correct
19 Correct 15 ms 644 KB Output is correct
20 Correct 15 ms 644 KB Output is correct
21 Correct 1217 ms 11484 KB Output is correct
22 Correct 1223 ms 11200 KB Output is correct
23 Correct 1197 ms 11496 KB Output is correct
24 Correct 909 ms 13260 KB Output is correct
25 Correct 1266 ms 22720 KB Output is correct
26 Correct 1347 ms 23556 KB Output is correct
27 Correct 1255 ms 11232 KB Output is correct
28 Correct 1208 ms 11260 KB Output is correct
29 Correct 1222 ms 11444 KB Output is correct
30 Correct 998 ms 4708 KB Output is correct
31 Correct 358 ms 6548 KB Output is correct
32 Correct 1108 ms 17420 KB Output is correct
33 Correct 377 ms 1112 KB Output is correct
34 Correct 373 ms 1216 KB Output is correct
35 Correct 379 ms 1096 KB Output is correct
36 Correct 382 ms 1236 KB Output is correct
37 Correct 1112 ms 18724 KB Output is correct
38 Correct 1223 ms 3452 KB Output is correct
39 Correct 1190 ms 20220 KB Output is correct
40 Correct 1628 ms 4644 KB Output is correct
41 Correct 797 ms 9116 KB Output is correct
42 Correct 1152 ms 18304 KB Output is correct
43 Correct 551 ms 3992 KB Output is correct
44 Correct 1261 ms 23084 KB Output is correct
45 Correct 983 ms 13784 KB Output is correct
46 Correct 722 ms 7464 KB Output is correct
47 Correct 1262 ms 20808 KB Output is correct
48 Correct 1039 ms 14900 KB Output is correct
49 Correct 1166 ms 12028 KB Output is correct
50 Correct 1145 ms 11304 KB Output is correct
51 Correct 1115 ms 11620 KB Output is correct
52 Correct 1180 ms 11912 KB Output is correct
53 Correct 382 ms 1204 KB Output is correct
54 Correct 387 ms 1328 KB Output is correct
55 Correct 375 ms 1136 KB Output is correct
56 Correct 371 ms 1160 KB Output is correct
57 Correct 1164 ms 7228 KB Output is correct
58 Correct 211 ms 2820 KB Output is correct
59 Correct 910 ms 14076 KB Output is correct
60 Correct 1120 ms 2072 KB Output is correct
61 Correct 1031 ms 13896 KB Output is correct
62 Correct 1223 ms 21552 KB Output is correct
63 Correct 1245 ms 22464 KB Output is correct
64 Correct 1230 ms 22116 KB Output is correct
65 Correct 574 ms 5228 KB Output is correct
66 Correct 539 ms 4100 KB Output is correct
67 Correct 1045 ms 15052 KB Output is correct
68 Correct 862 ms 11720 KB Output is correct
69 Correct 1126 ms 11272 KB Output is correct
70 Correct 1127 ms 10952 KB Output is correct
71 Correct 1175 ms 11440 KB Output is correct
72 Correct 1112 ms 11284 KB Output is correct
73 Correct 672 ms 6212 KB Output is correct
74 Correct 957 ms 11504 KB Output is correct
75 Correct 1378 ms 26252 KB Output is correct
76 Correct 1366 ms 23472 KB Output is correct
77 Correct 373 ms 1216 KB Output is correct
78 Correct 382 ms 1140 KB Output is correct
79 Correct 386 ms 1228 KB Output is correct
80 Correct 390 ms 1204 KB Output is correct
81 Correct 913 ms 11084 KB Output is correct
82 Correct 656 ms 6264 KB Output is correct
83 Correct 529 ms 3688 KB Output is correct
84 Correct 947 ms 11176 KB Output is correct
85 Correct 1075 ms 15216 KB Output is correct
86 Correct 1044 ms 16080 KB Output is correct
87 Correct 757 ms 8976 KB Output is correct
88 Correct 524 ms 3832 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 19 ms 432 KB Output is correct
4 Correct 18 ms 436 KB Output is correct
5 Correct 14 ms 980 KB Output is correct
6 Correct 13 ms 1004 KB Output is correct
7 Correct 18 ms 532 KB Output is correct
8 Correct 10 ms 852 KB Output is correct
9 Correct 14 ms 948 KB Output is correct
10 Correct 6 ms 980 KB Output is correct
11 Correct 44 ms 440 KB Output is correct
12 Correct 44 ms 432 KB Output is correct
13 Correct 7 ms 1028 KB Output is correct
14 Correct 15 ms 820 KB Output is correct
15 Correct 23 ms 436 KB Output is correct
16 Correct 17 ms 340 KB Output is correct
17 Correct 18 ms 596 KB Output is correct
18 Correct 8 ms 980 KB Output is correct
19 Correct 15 ms 644 KB Output is correct
20 Correct 15 ms 644 KB Output is correct
21 Correct 1217 ms 11484 KB Output is correct
22 Correct 1223 ms 11200 KB Output is correct
23 Correct 1197 ms 11496 KB Output is correct
24 Correct 909 ms 13260 KB Output is correct
25 Correct 1266 ms 22720 KB Output is correct
26 Correct 1347 ms 23556 KB Output is correct
27 Correct 1255 ms 11232 KB Output is correct
28 Correct 1208 ms 11260 KB Output is correct
29 Correct 1222 ms 11444 KB Output is correct
30 Correct 998 ms 4708 KB Output is correct
31 Correct 358 ms 6548 KB Output is correct
32 Correct 1108 ms 17420 KB Output is correct
33 Correct 392 ms 1320 KB Output is correct
34 Correct 391 ms 1348 KB Output is correct
35 Correct 418 ms 1224 KB Output is correct
36 Correct 396 ms 1196 KB Output is correct
37 Correct 1219 ms 17888 KB Output is correct
38 Correct 678 ms 13960 KB Output is correct
39 Correct 1252 ms 14896 KB Output is correct
40 Correct 1376 ms 22212 KB Output is correct
41 Correct 1289 ms 22156 KB Output is correct
42 Correct 1095 ms 15364 KB Output is correct
43 Correct 460 ms 1912 KB Output is correct
44 Correct 1155 ms 17788 KB Output is correct
45 Correct 988 ms 13812 KB Output is correct
46 Correct 677 ms 7208 KB Output is correct
47 Correct 624 ms 6300 KB Output is correct
48 Correct 643 ms 4352 KB Output is correct
49 Correct 1122 ms 11684 KB Output is correct
50 Correct 1062 ms 11588 KB Output is correct
51 Correct 1071 ms 11224 KB Output is correct
52 Correct 1074 ms 11580 KB Output is correct
53 Correct 481 ms 2552 KB Output is correct
54 Correct 771 ms 9068 KB Output is correct
55 Correct 900 ms 12640 KB Output is correct
56 Correct 803 ms 9956 KB Output is correct
57 Correct 379 ms 1196 KB Output is correct
58 Correct 393 ms 1196 KB Output is correct
59 Correct 381 ms 1272 KB Output is correct
60 Correct 390 ms 1284 KB Output is correct
61 Correct 947 ms 13532 KB Output is correct
62 Correct 1018 ms 13884 KB Output is correct
63 Correct 1266 ms 22404 KB Output is correct
64 Correct 1058 ms 15404 KB Output is correct
65 Correct 945 ms 14156 KB Output is correct
66 Correct 671 ms 6260 KB Output is correct
67 Correct 841 ms 11464 KB Output is correct
68 Correct 999 ms 15328 KB Output is correct
69 Correct 377 ms 1112 KB Output is correct
70 Correct 373 ms 1216 KB Output is correct
71 Correct 379 ms 1096 KB Output is correct
72 Correct 382 ms 1236 KB Output is correct
73 Correct 1112 ms 18724 KB Output is correct
74 Correct 1223 ms 3452 KB Output is correct
75 Correct 1190 ms 20220 KB Output is correct
76 Correct 1628 ms 4644 KB Output is correct
77 Correct 797 ms 9116 KB Output is correct
78 Correct 1152 ms 18304 KB Output is correct
79 Correct 551 ms 3992 KB Output is correct
80 Correct 1261 ms 23084 KB Output is correct
81 Correct 983 ms 13784 KB Output is correct
82 Correct 722 ms 7464 KB Output is correct
83 Correct 1262 ms 20808 KB Output is correct
84 Correct 1039 ms 14900 KB Output is correct
85 Correct 1166 ms 12028 KB Output is correct
86 Correct 1145 ms 11304 KB Output is correct
87 Correct 1115 ms 11620 KB Output is correct
88 Correct 1180 ms 11912 KB Output is correct
89 Correct 382 ms 1204 KB Output is correct
90 Correct 387 ms 1328 KB Output is correct
91 Correct 375 ms 1136 KB Output is correct
92 Correct 371 ms 1160 KB Output is correct
93 Correct 1164 ms 7228 KB Output is correct
94 Correct 211 ms 2820 KB Output is correct
95 Correct 910 ms 14076 KB Output is correct
96 Correct 1120 ms 2072 KB Output is correct
97 Correct 1031 ms 13896 KB Output is correct
98 Correct 1223 ms 21552 KB Output is correct
99 Correct 1245 ms 22464 KB Output is correct
100 Correct 1230 ms 22116 KB Output is correct
101 Correct 574 ms 5228 KB Output is correct
102 Correct 539 ms 4100 KB Output is correct
103 Correct 1045 ms 15052 KB Output is correct
104 Correct 862 ms 11720 KB Output is correct
105 Correct 1126 ms 11272 KB Output is correct
106 Correct 1127 ms 10952 KB Output is correct
107 Correct 1175 ms 11440 KB Output is correct
108 Correct 1112 ms 11284 KB Output is correct
109 Correct 672 ms 6212 KB Output is correct
110 Correct 957 ms 11504 KB Output is correct
111 Correct 1378 ms 26252 KB Output is correct
112 Correct 1366 ms 23472 KB Output is correct
113 Correct 373 ms 1216 KB Output is correct
114 Correct 382 ms 1140 KB Output is correct
115 Correct 386 ms 1228 KB Output is correct
116 Correct 390 ms 1204 KB Output is correct
117 Correct 913 ms 11084 KB Output is correct
118 Correct 656 ms 6264 KB Output is correct
119 Correct 529 ms 3688 KB Output is correct
120 Correct 947 ms 11176 KB Output is correct
121 Correct 1075 ms 15216 KB Output is correct
122 Correct 1044 ms 16080 KB Output is correct
123 Correct 757 ms 8976 KB Output is correct
124 Correct 524 ms 3832 KB Output is correct
125 Correct 773 ms 1772 KB Output is correct
126 Correct 771 ms 1780 KB Output is correct
127 Correct 791 ms 1868 KB Output is correct
128 Correct 827 ms 1860 KB Output is correct
129 Correct 768 ms 1792 KB Output is correct
130 Correct 804 ms 1796 KB Output is correct
131 Correct 2760 ms 5396 KB Output is correct
132 Correct 1956 ms 21700 KB Output is correct
133 Correct 3156 ms 31496 KB Output is correct
134 Correct 3448 ms 7532 KB Output is correct
135 Correct 3758 ms 37448 KB Output is correct
136 Correct 955 ms 1876 KB Output is correct
137 Execution timed out 5079 ms 45476 KB Time limit exceeded
138 Halted 0 ms 0 KB -