oj.uz

Submission #758592

# Submission time Handle Problem Language Result Execution time Memory
758592 2023-06-14T23:49:00 Z scanhex Segments (IZhO18_segments) C++17
75 / 100
 5000 ms 28472 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 = 666;

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 10 ms 340 KB Output is correct
4 Correct 7 ms 376 KB Output is correct
5 Correct 16 ms 1072 KB Output is correct
6 Correct 13 ms 1012 KB Output is correct
7 Correct 12 ms 468 KB Output is correct
8 Correct 11 ms 980 KB Output is correct
9 Correct 11 ms 848 KB Output is correct
10 Correct 14 ms 1168 KB Output is correct
11 Correct 18 ms 760 KB Output is correct
12 Correct 18 ms 724 KB Output is correct
13 Correct 10 ms 1236 KB Output is correct
14 Correct 14 ms 724 KB Output is correct
15 Correct 7 ms 340 KB Output is correct
16 Correct 7 ms 340 KB Output is correct
17 Correct 13 ms 652 KB Output is correct
18 Correct 10 ms 1108 KB Output is correct
19 Correct 9 ms 732 KB Output is correct
20 Correct 12 ms 724 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1219 ms 11600 KB Output is correct
2 Correct 1126 ms 12004 KB Output is correct
3 Correct 1085 ms 12140 KB Output is correct
4 Correct 1353 ms 13436 KB Output is correct
5 Correct 3461 ms 22556 KB Output is correct
6 Correct 3693 ms 22972 KB Output is correct
7 Correct 1096 ms 11612 KB Output is correct
8 Correct 1025 ms 11620 KB Output is correct
9 Correct 1241 ms 11828 KB Output is correct
10 Correct 398 ms 5040 KB Output is correct
11 Correct 656 ms 6392 KB Output is correct
12 Correct 1967 ms 18104 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 127 ms 1040 KB Output is correct
2 Correct 127 ms 1024 KB Output is correct
3 Correct 176 ms 1180 KB Output is correct
4 Correct 131 ms 1048 KB Output is correct
5 Correct 2001 ms 17604 KB Output is correct
6 Correct 1569 ms 14460 KB Output is correct
7 Correct 1656 ms 15056 KB Output is correct
8 Correct 3400 ms 22948 KB Output is correct
9 Correct 3649 ms 22988 KB Output is correct
10 Correct 2615 ms 15124 KB Output is correct
11 Correct 245 ms 1896 KB Output is correct
12 Correct 2783 ms 18156 KB Output is correct
13 Correct 2400 ms 13408 KB Output is correct
14 Correct 1228 ms 6588 KB Output is correct
15 Correct 1123 ms 5716 KB Output is correct
16 Correct 764 ms 4352 KB Output is correct
17 Correct 1088 ms 12084 KB Output is correct
18 Correct 1020 ms 11856 KB Output is correct
19 Correct 1026 ms 12228 KB Output is correct
20 Correct 1022 ms 12136 KB Output is correct
21 Correct 313 ms 2364 KB Output is correct
22 Correct 1637 ms 9216 KB Output is correct
23 Correct 2413 ms 11988 KB Output is correct
24 Correct 1852 ms 9652 KB Output is correct
25 Correct 136 ms 1088 KB Output is correct
26 Correct 151 ms 1088 KB Output is correct
27 Correct 168 ms 1108 KB Output is correct
28 Correct 151 ms 1044 KB Output is correct
29 Correct 2639 ms 13344 KB Output is correct
30 Correct 2508 ms 13480 KB Output is correct
31 Correct 3929 ms 22668 KB Output is correct
32 Correct 2962 ms 15640 KB Output is correct
33 Correct 2625 ms 14084 KB Output is correct
34 Correct 1037 ms 5516 KB Output is correct
35 Correct 2157 ms 10904 KB Output is correct
36 Correct 2773 ms 14400 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 187 ms 992 KB Output is correct
2 Correct 139 ms 1120 KB Output is correct
3 Correct 142 ms 1092 KB Output is correct
4 Correct 154 ms 1116 KB Output is correct
5 Correct 2542 ms 18720 KB Output is correct
6 Correct 588 ms 3432 KB Output is correct
7 Correct 2996 ms 20592 KB Output is correct
8 Correct 371 ms 4972 KB Output is correct
9 Correct 1744 ms 8992 KB Output is correct
10 Correct 3396 ms 18712 KB Output is correct
11 Correct 656 ms 3668 KB Output is correct
12 Correct 3970 ms 22912 KB Output is correct
13 Correct 2618 ms 13268 KB Output is correct
14 Correct 1366 ms 7212 KB Output is correct
15 Correct 3773 ms 21848 KB Output is correct
16 Correct 2863 ms 13732 KB Output is correct
17 Correct 1241 ms 12076 KB Output is correct
18 Correct 1094 ms 11952 KB Output is correct
19 Correct 1132 ms 11788 KB Output is correct
20 Correct 1154 ms 12016 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 10 ms 340 KB Output is correct
4 Correct 7 ms 376 KB Output is correct
5 Correct 16 ms 1072 KB Output is correct
6 Correct 13 ms 1012 KB Output is correct
7 Correct 12 ms 468 KB Output is correct
8 Correct 11 ms 980 KB Output is correct
9 Correct 11 ms 848 KB Output is correct
10 Correct 14 ms 1168 KB Output is correct
11 Correct 18 ms 760 KB Output is correct
12 Correct 18 ms 724 KB Output is correct
13 Correct 10 ms 1236 KB Output is correct
14 Correct 14 ms 724 KB Output is correct
15 Correct 7 ms 340 KB Output is correct
16 Correct 7 ms 340 KB Output is correct
17 Correct 13 ms 652 KB Output is correct
18 Correct 10 ms 1108 KB Output is correct
19 Correct 9 ms 732 KB Output is correct
20 Correct 12 ms 724 KB Output is correct
21 Correct 1219 ms 11600 KB Output is correct
22 Correct 1126 ms 12004 KB Output is correct
23 Correct 1085 ms 12140 KB Output is correct
24 Correct 1353 ms 13436 KB Output is correct
25 Correct 3461 ms 22556 KB Output is correct
26 Correct 3693 ms 22972 KB Output is correct
27 Correct 1096 ms 11612 KB Output is correct
28 Correct 1025 ms 11620 KB Output is correct
29 Correct 1241 ms 11828 KB Output is correct
30 Correct 398 ms 5040 KB Output is correct
31 Correct 656 ms 6392 KB Output is correct
32 Correct 1967 ms 18104 KB Output is correct
33 Correct 187 ms 992 KB Output is correct
34 Correct 139 ms 1120 KB Output is correct
35 Correct 142 ms 1092 KB Output is correct
36 Correct 154 ms 1116 KB Output is correct
37 Correct 2542 ms 18720 KB Output is correct
38 Correct 588 ms 3432 KB Output is correct
39 Correct 2996 ms 20592 KB Output is correct
40 Correct 371 ms 4972 KB Output is correct
41 Correct 1744 ms 8992 KB Output is correct
42 Correct 3396 ms 18712 KB Output is correct
43 Correct 656 ms 3668 KB Output is correct
44 Correct 3970 ms 22912 KB Output is correct
45 Correct 2618 ms 13268 KB Output is correct
46 Correct 1366 ms 7212 KB Output is correct
47 Correct 3773 ms 21848 KB Output is correct
48 Correct 2863 ms 13732 KB Output is correct
49 Correct 1241 ms 12076 KB Output is correct
50 Correct 1094 ms 11952 KB Output is correct
51 Correct 1132 ms 11788 KB Output is correct
52 Correct 1154 ms 12016 KB Output is correct
53 Correct 158 ms 1056 KB Output is correct
54 Correct 149 ms 1016 KB Output is correct
55 Correct 167 ms 1016 KB Output is correct
56 Correct 143 ms 996 KB Output is correct
57 Correct 908 ms 7204 KB Output is correct
58 Correct 506 ms 2676 KB Output is correct
59 Correct 1845 ms 13668 KB Output is correct
60 Correct 341 ms 2320 KB Output is correct
61 Correct 2771 ms 13960 KB Output is correct
62 Correct 3806 ms 22672 KB Output is correct
63 Correct 3859 ms 22588 KB Output is correct
64 Correct 3510 ms 22120 KB Output is correct
65 Correct 818 ms 4828 KB Output is correct
66 Correct 714 ms 3932 KB Output is correct
67 Correct 2562 ms 14496 KB Output is correct
68 Correct 2050 ms 10860 KB Output is correct
69 Correct 1033 ms 11492 KB Output is correct
70 Correct 1029 ms 11624 KB Output is correct
71 Correct 1097 ms 12236 KB Output is correct
72 Correct 1020 ms 11748 KB Output is correct
73 Correct 1096 ms 5696 KB Output is correct
74 Correct 2053 ms 10912 KB Output is correct
75 Correct 3760 ms 24040 KB Output is correct
76 Correct 3723 ms 23828 KB Output is correct
77 Correct 149 ms 1152 KB Output is correct
78 Correct 140 ms 1152 KB Output is correct
79 Correct 136 ms 1040 KB Output is correct
80 Correct 127 ms 1052 KB Output is correct
81 Correct 1970 ms 11196 KB Output is correct
82 Correct 995 ms 5560 KB Output is correct
83 Correct 541 ms 3380 KB Output is correct
84 Correct 1865 ms 11256 KB Output is correct
85 Correct 2515 ms 15056 KB Output is correct
86 Correct 2712 ms 16420 KB Output is correct
87 Correct 1481 ms 8436 KB Output is correct
88 Correct 598 ms 3528 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 10 ms 340 KB Output is correct
4 Correct 7 ms 376 KB Output is correct
5 Correct 16 ms 1072 KB Output is correct
6 Correct 13 ms 1012 KB Output is correct
7 Correct 12 ms 468 KB Output is correct
8 Correct 11 ms 980 KB Output is correct
9 Correct 11 ms 848 KB Output is correct
10 Correct 14 ms 1168 KB Output is correct
11 Correct 18 ms 760 KB Output is correct
12 Correct 18 ms 724 KB Output is correct
13 Correct 10 ms 1236 KB Output is correct
14 Correct 14 ms 724 KB Output is correct
15 Correct 7 ms 340 KB Output is correct
16 Correct 7 ms 340 KB Output is correct
17 Correct 13 ms 652 KB Output is correct
18 Correct 10 ms 1108 KB Output is correct
19 Correct 9 ms 732 KB Output is correct
20 Correct 12 ms 724 KB Output is correct
21 Correct 1219 ms 11600 KB Output is correct
22 Correct 1126 ms 12004 KB Output is correct
23 Correct 1085 ms 12140 KB Output is correct
24 Correct 1353 ms 13436 KB Output is correct
25 Correct 3461 ms 22556 KB Output is correct
26 Correct 3693 ms 22972 KB Output is correct
27 Correct 1096 ms 11612 KB Output is correct
28 Correct 1025 ms 11620 KB Output is correct
29 Correct 1241 ms 11828 KB Output is correct
30 Correct 398 ms 5040 KB Output is correct
31 Correct 656 ms 6392 KB Output is correct
32 Correct 1967 ms 18104 KB Output is correct
33 Correct 127 ms 1040 KB Output is correct
34 Correct 127 ms 1024 KB Output is correct
35 Correct 176 ms 1180 KB Output is correct
36 Correct 131 ms 1048 KB Output is correct
37 Correct 2001 ms 17604 KB Output is correct
38 Correct 1569 ms 14460 KB Output is correct
39 Correct 1656 ms 15056 KB Output is correct
40 Correct 3400 ms 22948 KB Output is correct
41 Correct 3649 ms 22988 KB Output is correct
42 Correct 2615 ms 15124 KB Output is correct
43 Correct 245 ms 1896 KB Output is correct
44 Correct 2783 ms 18156 KB Output is correct
45 Correct 2400 ms 13408 KB Output is correct
46 Correct 1228 ms 6588 KB Output is correct
47 Correct 1123 ms 5716 KB Output is correct
48 Correct 764 ms 4352 KB Output is correct
49 Correct 1088 ms 12084 KB Output is correct
50 Correct 1020 ms 11856 KB Output is correct
51 Correct 1026 ms 12228 KB Output is correct
52 Correct 1022 ms 12136 KB Output is correct
53 Correct 313 ms 2364 KB Output is correct
54 Correct 1637 ms 9216 KB Output is correct
55 Correct 2413 ms 11988 KB Output is correct
56 Correct 1852 ms 9652 KB Output is correct
57 Correct 136 ms 1088 KB Output is correct
58 Correct 151 ms 1088 KB Output is correct
59 Correct 168 ms 1108 KB Output is correct
60 Correct 151 ms 1044 KB Output is correct
61 Correct 2639 ms 13344 KB Output is correct
62 Correct 2508 ms 13480 KB Output is correct
63 Correct 3929 ms 22668 KB Output is correct
64 Correct 2962 ms 15640 KB Output is correct
65 Correct 2625 ms 14084 KB Output is correct
66 Correct 1037 ms 5516 KB Output is correct
67 Correct 2157 ms 10904 KB Output is correct
68 Correct 2773 ms 14400 KB Output is correct
69 Correct 187 ms 992 KB Output is correct
70 Correct 139 ms 1120 KB Output is correct
71 Correct 142 ms 1092 KB Output is correct
72 Correct 154 ms 1116 KB Output is correct
73 Correct 2542 ms 18720 KB Output is correct
74 Correct 588 ms 3432 KB Output is correct
75 Correct 2996 ms 20592 KB Output is correct
76 Correct 371 ms 4972 KB Output is correct
77 Correct 1744 ms 8992 KB Output is correct
78 Correct 3396 ms 18712 KB Output is correct
79 Correct 656 ms 3668 KB Output is correct
80 Correct 3970 ms 22912 KB Output is correct
81 Correct 2618 ms 13268 KB Output is correct
82 Correct 1366 ms 7212 KB Output is correct
83 Correct 3773 ms 21848 KB Output is correct
84 Correct 2863 ms 13732 KB Output is correct
85 Correct 1241 ms 12076 KB Output is correct
86 Correct 1094 ms 11952 KB Output is correct
87 Correct 1132 ms 11788 KB Output is correct
88 Correct 1154 ms 12016 KB Output is correct
89 Correct 158 ms 1056 KB Output is correct
90 Correct 149 ms 1016 KB Output is correct
91 Correct 167 ms 1016 KB Output is correct
92 Correct 143 ms 996 KB Output is correct
93 Correct 908 ms 7204 KB Output is correct
94 Correct 506 ms 2676 KB Output is correct
95 Correct 1845 ms 13668 KB Output is correct
96 Correct 341 ms 2320 KB Output is correct
97 Correct 2771 ms 13960 KB Output is correct
98 Correct 3806 ms 22672 KB Output is correct
99 Correct 3859 ms 22588 KB Output is correct
100 Correct 3510 ms 22120 KB Output is correct
101 Correct 818 ms 4828 KB Output is correct
102 Correct 714 ms 3932 KB Output is correct
103 Correct 2562 ms 14496 KB Output is correct
104 Correct 2050 ms 10860 KB Output is correct
105 Correct 1033 ms 11492 KB Output is correct
106 Correct 1029 ms 11624 KB Output is correct
107 Correct 1097 ms 12236 KB Output is correct
108 Correct 1020 ms 11748 KB Output is correct
109 Correct 1096 ms 5696 KB Output is correct
110 Correct 2053 ms 10912 KB Output is correct
111 Correct 3760 ms 24040 KB Output is correct
112 Correct 3723 ms 23828 KB Output is correct
113 Correct 149 ms 1152 KB Output is correct
114 Correct 140 ms 1152 KB Output is correct
115 Correct 136 ms 1040 KB Output is correct
116 Correct 127 ms 1052 KB Output is correct
117 Correct 1970 ms 11196 KB Output is correct
118 Correct 995 ms 5560 KB Output is correct
119 Correct 541 ms 3380 KB Output is correct
120 Correct 1865 ms 11256 KB Output is correct
121 Correct 2515 ms 15056 KB Output is correct
122 Correct 2712 ms 16420 KB Output is correct
123 Correct 1481 ms 8436 KB Output is correct
124 Correct 598 ms 3528 KB Output is correct
125 Correct 271 ms 1676 KB Output is correct
126 Correct 275 ms 1764 KB Output is correct
127 Correct 290 ms 1756 KB Output is correct
128 Correct 282 ms 1624 KB Output is correct
129 Correct 261 ms 1672 KB Output is correct
130 Correct 351 ms 1784 KB Output is correct
131 Correct 1481 ms 5256 KB Output is correct
132 Correct 3512 ms 22840 KB Output is correct
133 Execution timed out 5031 ms 28472 KB Time limit exceeded
134 Halted 0 ms 0 KB -