oj.uz

Submission #758590

# Submission time Handle Problem Language Result Execution time Memory
758590 2023-06-14T23:46:56 Z scanhex Segments (IZhO18_segments) C++17
75 / 100
 5000 ms 43672 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 = 2000;

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 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 13 ms 400 KB Output is correct
4 Correct 12 ms 340 KB Output is correct
5 Correct 7 ms 1108 KB Output is correct
6 Correct 19 ms 752 KB Output is correct
7 Correct 13 ms 468 KB Output is correct
8 Correct 11 ms 872 KB Output is correct
9 Correct 14 ms 872 KB Output is correct
10 Correct 7 ms 1108 KB Output is correct
11 Correct 19 ms 744 KB Output is correct
12 Correct 17 ms 748 KB Output is correct
13 Correct 6 ms 1108 KB Output is correct
14 Correct 13 ms 872 KB Output is correct
15 Correct 12 ms 404 KB Output is correct
16 Correct 12 ms 468 KB Output is correct
17 Correct 15 ms 648 KB Output is correct
18 Correct 8 ms 1108 KB Output is correct
19 Correct 14 ms 648 KB Output is correct
20 Correct 13 ms 688 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1136 ms 11136 KB Output is correct
2 Correct 1136 ms 11040 KB Output is correct
3 Correct 1158 ms 11544 KB Output is correct
4 Correct 840 ms 12760 KB Output is correct
5 Correct 1223 ms 21740 KB Output is correct
6 Correct 1244 ms 22936 KB Output is correct
7 Correct 1175 ms 11104 KB Output is correct
8 Correct 1151 ms 10788 KB Output is correct
9 Correct 1142 ms 10916 KB Output is correct
10 Correct 1018 ms 4744 KB Output is correct
11 Correct 828 ms 6128 KB Output is correct
12 Correct 779 ms 17800 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 277 ms 1052 KB Output is correct
2 Correct 323 ms 1012 KB Output is correct
3 Correct 279 ms 1156 KB Output is correct
4 Correct 263 ms 1012 KB Output is correct
5 Correct 1004 ms 17984 KB Output is correct
6 Correct 660 ms 13368 KB Output is correct
7 Correct 982 ms 14672 KB Output is correct
8 Correct 1164 ms 22812 KB Output is correct
9 Correct 1200 ms 21284 KB Output is correct
10 Correct 1002 ms 16532 KB Output is correct
11 Correct 331 ms 1852 KB Output is correct
12 Correct 1077 ms 17936 KB Output is correct
13 Correct 918 ms 13328 KB Output is correct
14 Correct 598 ms 6728 KB Output is correct
15 Correct 500 ms 5856 KB Output is correct
16 Correct 485 ms 4192 KB Output is correct
17 Correct 372 ms 11428 KB Output is correct
18 Correct 1062 ms 11332 KB Output is correct
19 Correct 1173 ms 11260 KB Output is correct
20 Correct 381 ms 11840 KB Output is correct
21 Correct 348 ms 2136 KB Output is correct
22 Correct 764 ms 8944 KB Output is correct
23 Correct 822 ms 12356 KB Output is correct
24 Correct 789 ms 9824 KB Output is correct
25 Correct 289 ms 1048 KB Output is correct
26 Correct 272 ms 1016 KB Output is correct
27 Correct 276 ms 1184 KB Output is correct
28 Correct 312 ms 1136 KB Output is correct
29 Correct 906 ms 13188 KB Output is correct
30 Correct 952 ms 13280 KB Output is correct
31 Correct 1254 ms 21324 KB Output is correct
32 Correct 1049 ms 16388 KB Output is correct
33 Correct 888 ms 13652 KB Output is correct
34 Correct 510 ms 5564 KB Output is correct
35 Correct 842 ms 10548 KB Output is correct
36 Correct 926 ms 14928 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 267 ms 1008 KB Output is correct
2 Correct 271 ms 992 KB Output is correct
3 Correct 295 ms 1092 KB Output is correct
4 Correct 287 ms 1000 KB Output is correct
5 Correct 988 ms 18732 KB Output is correct
6 Correct 1313 ms 3160 KB Output is correct
7 Correct 1089 ms 19964 KB Output is correct
8 Correct 622 ms 4996 KB Output is correct
9 Correct 707 ms 8880 KB Output is correct
10 Correct 1180 ms 17972 KB Output is correct
11 Correct 470 ms 3676 KB Output is correct
12 Correct 1267 ms 22080 KB Output is correct
13 Correct 925 ms 12780 KB Output is correct
14 Correct 661 ms 7188 KB Output is correct
15 Correct 1166 ms 19624 KB Output is correct
16 Correct 1004 ms 14152 KB Output is correct
17 Correct 1161 ms 11092 KB Output is correct
18 Correct 1189 ms 11036 KB Output is correct
19 Correct 1175 ms 11016 KB Output is correct
20 Correct 1146 ms 11148 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 1 ms 212 KB Output is correct
3 Correct 13 ms 400 KB Output is correct
4 Correct 12 ms 340 KB Output is correct
5 Correct 7 ms 1108 KB Output is correct
6 Correct 19 ms 752 KB Output is correct
7 Correct 13 ms 468 KB Output is correct
8 Correct 11 ms 872 KB Output is correct
9 Correct 14 ms 872 KB Output is correct
10 Correct 7 ms 1108 KB Output is correct
11 Correct 19 ms 744 KB Output is correct
12 Correct 17 ms 748 KB Output is correct
13 Correct 6 ms 1108 KB Output is correct
14 Correct 13 ms 872 KB Output is correct
15 Correct 12 ms 404 KB Output is correct
16 Correct 12 ms 468 KB Output is correct
17 Correct 15 ms 648 KB Output is correct
18 Correct 8 ms 1108 KB Output is correct
19 Correct 14 ms 648 KB Output is correct
20 Correct 13 ms 688 KB Output is correct
21 Correct 1136 ms 11136 KB Output is correct
22 Correct 1136 ms 11040 KB Output is correct
23 Correct 1158 ms 11544 KB Output is correct
24 Correct 840 ms 12760 KB Output is correct
25 Correct 1223 ms 21740 KB Output is correct
26 Correct 1244 ms 22936 KB Output is correct
27 Correct 1175 ms 11104 KB Output is correct
28 Correct 1151 ms 10788 KB Output is correct
29 Correct 1142 ms 10916 KB Output is correct
30 Correct 1018 ms 4744 KB Output is correct
31 Correct 828 ms 6128 KB Output is correct
32 Correct 779 ms 17800 KB Output is correct
33 Correct 267 ms 1008 KB Output is correct
34 Correct 271 ms 992 KB Output is correct
35 Correct 295 ms 1092 KB Output is correct
36 Correct 287 ms 1000 KB Output is correct
37 Correct 988 ms 18732 KB Output is correct
38 Correct 1313 ms 3160 KB Output is correct
39 Correct 1089 ms 19964 KB Output is correct
40 Correct 622 ms 4996 KB Output is correct
41 Correct 707 ms 8880 KB Output is correct
42 Correct 1180 ms 17972 KB Output is correct
43 Correct 470 ms 3676 KB Output is correct
44 Correct 1267 ms 22080 KB Output is correct
45 Correct 925 ms 12780 KB Output is correct
46 Correct 661 ms 7188 KB Output is correct
47 Correct 1166 ms 19624 KB Output is correct
48 Correct 1004 ms 14152 KB Output is correct
49 Correct 1161 ms 11092 KB Output is correct
50 Correct 1189 ms 11036 KB Output is correct
51 Correct 1175 ms 11016 KB Output is correct
52 Correct 1146 ms 11148 KB Output is correct
53 Correct 311 ms 1052 KB Output is correct
54 Correct 282 ms 1212 KB Output is correct
55 Correct 286 ms 968 KB Output is correct
56 Correct 273 ms 996 KB Output is correct
57 Correct 1229 ms 7056 KB Output is correct
58 Correct 901 ms 2428 KB Output is correct
59 Correct 978 ms 13764 KB Output is correct
60 Correct 1156 ms 2020 KB Output is correct
61 Correct 932 ms 13428 KB Output is correct
62 Correct 1206 ms 20716 KB Output is correct
63 Correct 1224 ms 22388 KB Output is correct
64 Correct 1166 ms 21232 KB Output is correct
65 Correct 507 ms 5012 KB Output is correct
66 Correct 447 ms 3884 KB Output is correct
67 Correct 946 ms 14456 KB Output is correct
68 Correct 837 ms 10552 KB Output is correct
69 Correct 1146 ms 11432 KB Output is correct
70 Correct 1112 ms 10844 KB Output is correct
71 Correct 1115 ms 11024 KB Output is correct
72 Correct 1119 ms 11176 KB Output is correct
73 Correct 554 ms 5600 KB Output is correct
74 Correct 824 ms 11004 KB Output is correct
75 Correct 1259 ms 22636 KB Output is correct
76 Correct 1179 ms 22468 KB Output is correct
77 Correct 271 ms 980 KB Output is correct
78 Correct 274 ms 1068 KB Output is correct
79 Correct 289 ms 1192 KB Output is correct
80 Correct 273 ms 1012 KB Output is correct
81 Correct 788 ms 10616 KB Output is correct
82 Correct 557 ms 5788 KB Output is correct
83 Correct 440 ms 3436 KB Output is correct
84 Correct 800 ms 10528 KB Output is correct
85 Correct 935 ms 14476 KB Output is correct
86 Correct 1004 ms 16908 KB Output is correct
87 Correct 771 ms 8304 KB Output is correct
88 Correct 463 ms 3404 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 1 ms 212 KB Output is correct
3 Correct 13 ms 400 KB Output is correct
4 Correct 12 ms 340 KB Output is correct
5 Correct 7 ms 1108 KB Output is correct
6 Correct 19 ms 752 KB Output is correct
7 Correct 13 ms 468 KB Output is correct
8 Correct 11 ms 872 KB Output is correct
9 Correct 14 ms 872 KB Output is correct
10 Correct 7 ms 1108 KB Output is correct
11 Correct 19 ms 744 KB Output is correct
12 Correct 17 ms 748 KB Output is correct
13 Correct 6 ms 1108 KB Output is correct
14 Correct 13 ms 872 KB Output is correct
15 Correct 12 ms 404 KB Output is correct
16 Correct 12 ms 468 KB Output is correct
17 Correct 15 ms 648 KB Output is correct
18 Correct 8 ms 1108 KB Output is correct
19 Correct 14 ms 648 KB Output is correct
20 Correct 13 ms 688 KB Output is correct
21 Correct 1136 ms 11136 KB Output is correct
22 Correct 1136 ms 11040 KB Output is correct
23 Correct 1158 ms 11544 KB Output is correct
24 Correct 840 ms 12760 KB Output is correct
25 Correct 1223 ms 21740 KB Output is correct
26 Correct 1244 ms 22936 KB Output is correct
27 Correct 1175 ms 11104 KB Output is correct
28 Correct 1151 ms 10788 KB Output is correct
29 Correct 1142 ms 10916 KB Output is correct
30 Correct 1018 ms 4744 KB Output is correct
31 Correct 828 ms 6128 KB Output is correct
32 Correct 779 ms 17800 KB Output is correct
33 Correct 277 ms 1052 KB Output is correct
34 Correct 323 ms 1012 KB Output is correct
35 Correct 279 ms 1156 KB Output is correct
36 Correct 263 ms 1012 KB Output is correct
37 Correct 1004 ms 17984 KB Output is correct
38 Correct 660 ms 13368 KB Output is correct
39 Correct 982 ms 14672 KB Output is correct
40 Correct 1164 ms 22812 KB Output is correct
41 Correct 1200 ms 21284 KB Output is correct
42 Correct 1002 ms 16532 KB Output is correct
43 Correct 331 ms 1852 KB Output is correct
44 Correct 1077 ms 17936 KB Output is correct
45 Correct 918 ms 13328 KB Output is correct
46 Correct 598 ms 6728 KB Output is correct
47 Correct 500 ms 5856 KB Output is correct
48 Correct 485 ms 4192 KB Output is correct
49 Correct 372 ms 11428 KB Output is correct
50 Correct 1062 ms 11332 KB Output is correct
51 Correct 1173 ms 11260 KB Output is correct
52 Correct 381 ms 11840 KB Output is correct
53 Correct 348 ms 2136 KB Output is correct
54 Correct 764 ms 8944 KB Output is correct
55 Correct 822 ms 12356 KB Output is correct
56 Correct 789 ms 9824 KB Output is correct
57 Correct 289 ms 1048 KB Output is correct
58 Correct 272 ms 1016 KB Output is correct
59 Correct 276 ms 1184 KB Output is correct
60 Correct 312 ms 1136 KB Output is correct
61 Correct 906 ms 13188 KB Output is correct
62 Correct 952 ms 13280 KB Output is correct
63 Correct 1254 ms 21324 KB Output is correct
64 Correct 1049 ms 16388 KB Output is correct
65 Correct 888 ms 13652 KB Output is correct
66 Correct 510 ms 5564 KB Output is correct
67 Correct 842 ms 10548 KB Output is correct
68 Correct 926 ms 14928 KB Output is correct
69 Correct 267 ms 1008 KB Output is correct
70 Correct 271 ms 992 KB Output is correct
71 Correct 295 ms 1092 KB Output is correct
72 Correct 287 ms 1000 KB Output is correct
73 Correct 988 ms 18732 KB Output is correct
74 Correct 1313 ms 3160 KB Output is correct
75 Correct 1089 ms 19964 KB Output is correct
76 Correct 622 ms 4996 KB Output is correct
77 Correct 707 ms 8880 KB Output is correct
78 Correct 1180 ms 17972 KB Output is correct
79 Correct 470 ms 3676 KB Output is correct
80 Correct 1267 ms 22080 KB Output is correct
81 Correct 925 ms 12780 KB Output is correct
82 Correct 661 ms 7188 KB Output is correct
83 Correct 1166 ms 19624 KB Output is correct
84 Correct 1004 ms 14152 KB Output is correct
85 Correct 1161 ms 11092 KB Output is correct
86 Correct 1189 ms 11036 KB Output is correct
87 Correct 1175 ms 11016 KB Output is correct
88 Correct 1146 ms 11148 KB Output is correct
89 Correct 311 ms 1052 KB Output is correct
90 Correct 282 ms 1212 KB Output is correct
91 Correct 286 ms 968 KB Output is correct
92 Correct 273 ms 996 KB Output is correct
93 Correct 1229 ms 7056 KB Output is correct
94 Correct 901 ms 2428 KB Output is correct
95 Correct 978 ms 13764 KB Output is correct
96 Correct 1156 ms 2020 KB Output is correct
97 Correct 932 ms 13428 KB Output is correct
98 Correct 1206 ms 20716 KB Output is correct
99 Correct 1224 ms 22388 KB Output is correct
100 Correct 1166 ms 21232 KB Output is correct
101 Correct 507 ms 5012 KB Output is correct
102 Correct 447 ms 3884 KB Output is correct
103 Correct 946 ms 14456 KB Output is correct
104 Correct 837 ms 10552 KB Output is correct
105 Correct 1146 ms 11432 KB Output is correct
106 Correct 1112 ms 10844 KB Output is correct
107 Correct 1115 ms 11024 KB Output is correct
108 Correct 1119 ms 11176 KB Output is correct
109 Correct 554 ms 5600 KB Output is correct
110 Correct 824 ms 11004 KB Output is correct
111 Correct 1259 ms 22636 KB Output is correct
112 Correct 1179 ms 22468 KB Output is correct
113 Correct 271 ms 980 KB Output is correct
114 Correct 274 ms 1068 KB Output is correct
115 Correct 289 ms 1192 KB Output is correct
116 Correct 273 ms 1012 KB Output is correct
117 Correct 788 ms 10616 KB Output is correct
118 Correct 557 ms 5788 KB Output is correct
119 Correct 440 ms 3436 KB Output is correct
120 Correct 800 ms 10528 KB Output is correct
121 Correct 935 ms 14476 KB Output is correct
122 Correct 1004 ms 16908 KB Output is correct
123 Correct 771 ms 8304 KB Output is correct
124 Correct 463 ms 3404 KB Output is correct
125 Correct 674 ms 1840 KB Output is correct
126 Correct 596 ms 1724 KB Output is correct
127 Correct 641 ms 1692 KB Output is correct
128 Correct 626 ms 1716 KB Output is correct
129 Correct 658 ms 1616 KB Output is correct
130 Correct 612 ms 1820 KB Output is correct
131 Correct 3039 ms 4964 KB Output is correct
132 Correct 3006 ms 21068 KB Output is correct
133 Correct 2860 ms 34624 KB Output is correct
134 Correct 1449 ms 7728 KB Output is correct
135 Correct 3938 ms 37088 KB Output is correct
136 Correct 2560 ms 1552 KB Output is correct
137 Execution timed out 5094 ms 43672 KB Time limit exceeded
138 Halted 0 ms 0 KB -