oj.uz

Submission #758593

# Submission time Handle Problem Language Result Execution time Memory
758593 2023-06-14T23:49:48 Z scanhex Segments (IZhO18_segments) C++17
75 / 100
 4187 ms 45224 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 = 3000;

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 27 ms 432 KB Output is correct
4 Correct 29 ms 416 KB Output is correct
5 Correct 18 ms 980 KB Output is correct
6 Correct 19 ms 968 KB Output is correct
7 Correct 23 ms 468 KB Output is correct
8 Correct 11 ms 852 KB Output is correct
9 Correct 12 ms 852 KB Output is correct
10 Correct 7 ms 1008 KB Output is correct
11 Correct 68 ms 420 KB Output is correct
12 Correct 60 ms 440 KB Output is correct
13 Correct 10 ms 980 KB Output is correct
14 Correct 19 ms 816 KB Output is correct
15 Correct 20 ms 380 KB Output is correct
16 Correct 20 ms 340 KB Output is correct
17 Correct 18 ms 648 KB Output is correct
18 Correct 8 ms 980 KB Output is correct
19 Correct 16 ms 596 KB Output is correct
20 Correct 21 ms 640 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1287 ms 10928 KB Output is correct
2 Correct 1194 ms 11132 KB Output is correct
3 Correct 1176 ms 11100 KB Output is correct
4 Correct 789 ms 12380 KB Output is correct
5 Correct 1018 ms 21684 KB Output is correct
6 Correct 1034 ms 22532 KB Output is correct
7 Correct 1276 ms 11016 KB Output is correct
8 Correct 1295 ms 10780 KB Output is correct
9 Correct 1263 ms 10996 KB Output is correct
10 Correct 1241 ms 4556 KB Output is correct
11 Correct 402 ms 6424 KB Output is correct
12 Correct 968 ms 17996 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 454 ms 1072 KB Output is correct
2 Correct 495 ms 1100 KB Output is correct
3 Correct 468 ms 1096 KB Output is correct
4 Correct 422 ms 1072 KB Output is correct
5 Correct 1108 ms 17736 KB Output is correct
6 Correct 613 ms 13428 KB Output is correct
7 Correct 1191 ms 14304 KB Output is correct
8 Correct 956 ms 21868 KB Output is correct
9 Correct 1029 ms 21872 KB Output is correct
10 Correct 889 ms 15028 KB Output is correct
11 Correct 478 ms 1916 KB Output is correct
12 Correct 974 ms 18184 KB Output is correct
13 Correct 764 ms 12828 KB Output is correct
14 Correct 574 ms 6760 KB Output is correct
15 Correct 550 ms 6196 KB Output is correct
16 Correct 536 ms 4448 KB Output is correct
17 Correct 1224 ms 11728 KB Output is correct
18 Correct 1165 ms 10948 KB Output is correct
19 Correct 1171 ms 11412 KB Output is correct
20 Correct 1222 ms 11500 KB Output is correct
21 Correct 481 ms 2184 KB Output is correct
22 Correct 752 ms 8976 KB Output is correct
23 Correct 762 ms 12316 KB Output is correct
24 Correct 712 ms 9460 KB Output is correct
25 Correct 444 ms 1136 KB Output is correct
26 Correct 429 ms 1040 KB Output is correct
27 Correct 430 ms 1056 KB Output is correct
28 Correct 456 ms 1068 KB Output is correct
29 Correct 818 ms 13076 KB Output is correct
30 Correct 812 ms 13176 KB Output is correct
31 Correct 1008 ms 21544 KB Output is correct
32 Correct 908 ms 14928 KB Output is correct
33 Correct 812 ms 13712 KB Output is correct
34 Correct 563 ms 6192 KB Output is correct
35 Correct 734 ms 10984 KB Output is correct
36 Correct 799 ms 14204 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 417 ms 1108 KB Output is correct
2 Correct 463 ms 1096 KB Output is correct
3 Correct 448 ms 1096 KB Output is correct
4 Correct 454 ms 1104 KB Output is correct
5 Correct 1098 ms 18200 KB Output is correct
6 Correct 1551 ms 3120 KB Output is correct
7 Correct 1043 ms 18964 KB Output is correct
8 Correct 1871 ms 4436 KB Output is correct
9 Correct 679 ms 8704 KB Output is correct
10 Correct 940 ms 18116 KB Output is correct
11 Correct 596 ms 3676 KB Output is correct
12 Correct 1010 ms 21876 KB Output is correct
13 Correct 859 ms 13112 KB Output is correct
14 Correct 688 ms 7484 KB Output is correct
15 Correct 1014 ms 19684 KB Output is correct
16 Correct 888 ms 13600 KB Output is correct
17 Correct 1248 ms 12116 KB Output is correct
18 Correct 1251 ms 10840 KB Output is correct
19 Correct 1175 ms 11620 KB Output is correct
20 Correct 1189 ms 11740 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 27 ms 432 KB Output is correct
4 Correct 29 ms 416 KB Output is correct
5 Correct 18 ms 980 KB Output is correct
6 Correct 19 ms 968 KB Output is correct
7 Correct 23 ms 468 KB Output is correct
8 Correct 11 ms 852 KB Output is correct
9 Correct 12 ms 852 KB Output is correct
10 Correct 7 ms 1008 KB Output is correct
11 Correct 68 ms 420 KB Output is correct
12 Correct 60 ms 440 KB Output is correct
13 Correct 10 ms 980 KB Output is correct
14 Correct 19 ms 816 KB Output is correct
15 Correct 20 ms 380 KB Output is correct
16 Correct 20 ms 340 KB Output is correct
17 Correct 18 ms 648 KB Output is correct
18 Correct 8 ms 980 KB Output is correct
19 Correct 16 ms 596 KB Output is correct
20 Correct 21 ms 640 KB Output is correct
21 Correct 1287 ms 10928 KB Output is correct
22 Correct 1194 ms 11132 KB Output is correct
23 Correct 1176 ms 11100 KB Output is correct
24 Correct 789 ms 12380 KB Output is correct
25 Correct 1018 ms 21684 KB Output is correct
26 Correct 1034 ms 22532 KB Output is correct
27 Correct 1276 ms 11016 KB Output is correct
28 Correct 1295 ms 10780 KB Output is correct
29 Correct 1263 ms 10996 KB Output is correct
30 Correct 1241 ms 4556 KB Output is correct
31 Correct 402 ms 6424 KB Output is correct
32 Correct 968 ms 17996 KB Output is correct
33 Correct 417 ms 1108 KB Output is correct
34 Correct 463 ms 1096 KB Output is correct
35 Correct 448 ms 1096 KB Output is correct
36 Correct 454 ms 1104 KB Output is correct
37 Correct 1098 ms 18200 KB Output is correct
38 Correct 1551 ms 3120 KB Output is correct
39 Correct 1043 ms 18964 KB Output is correct
40 Correct 1871 ms 4436 KB Output is correct
41 Correct 679 ms 8704 KB Output is correct
42 Correct 940 ms 18116 KB Output is correct
43 Correct 596 ms 3676 KB Output is correct
44 Correct 1010 ms 21876 KB Output is correct
45 Correct 859 ms 13112 KB Output is correct
46 Correct 688 ms 7484 KB Output is correct
47 Correct 1014 ms 19684 KB Output is correct
48 Correct 888 ms 13600 KB Output is correct
49 Correct 1248 ms 12116 KB Output is correct
50 Correct 1251 ms 10840 KB Output is correct
51 Correct 1175 ms 11620 KB Output is correct
52 Correct 1189 ms 11740 KB Output is correct
53 Correct 453 ms 1064 KB Output is correct
54 Correct 435 ms 1200 KB Output is correct
55 Correct 538 ms 1088 KB Output is correct
56 Correct 440 ms 1096 KB Output is correct
57 Correct 1372 ms 6936 KB Output is correct
58 Correct 272 ms 2604 KB Output is correct
59 Correct 954 ms 13572 KB Output is correct
60 Correct 1288 ms 1900 KB Output is correct
61 Correct 828 ms 13292 KB Output is correct
62 Correct 935 ms 20420 KB Output is correct
63 Correct 1048 ms 22004 KB Output is correct
64 Correct 966 ms 21412 KB Output is correct
65 Correct 561 ms 5044 KB Output is correct
66 Correct 489 ms 3912 KB Output is correct
67 Correct 784 ms 13644 KB Output is correct
68 Correct 693 ms 10672 KB Output is correct
69 Correct 1119 ms 11108 KB Output is correct
70 Correct 1093 ms 10628 KB Output is correct
71 Correct 1144 ms 11076 KB Output is correct
72 Correct 1132 ms 11296 KB Output is correct
73 Correct 614 ms 5796 KB Output is correct
74 Correct 715 ms 10600 KB Output is correct
75 Correct 925 ms 24816 KB Output is correct
76 Correct 991 ms 22340 KB Output is correct
77 Correct 419 ms 1120 KB Output is correct
78 Correct 396 ms 1044 KB Output is correct
79 Correct 403 ms 1336 KB Output is correct
80 Correct 413 ms 1116 KB Output is correct
81 Correct 740 ms 10524 KB Output is correct
82 Correct 584 ms 5772 KB Output is correct
83 Correct 520 ms 3296 KB Output is correct
84 Correct 789 ms 10732 KB Output is correct
85 Correct 804 ms 14544 KB Output is correct
86 Correct 821 ms 15892 KB Output is correct
87 Correct 640 ms 8420 KB Output is correct
88 Correct 493 ms 3716 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 27 ms 432 KB Output is correct
4 Correct 29 ms 416 KB Output is correct
5 Correct 18 ms 980 KB Output is correct
6 Correct 19 ms 968 KB Output is correct
7 Correct 23 ms 468 KB Output is correct
8 Correct 11 ms 852 KB Output is correct
9 Correct 12 ms 852 KB Output is correct
10 Correct 7 ms 1008 KB Output is correct
11 Correct 68 ms 420 KB Output is correct
12 Correct 60 ms 440 KB Output is correct
13 Correct 10 ms 980 KB Output is correct
14 Correct 19 ms 816 KB Output is correct
15 Correct 20 ms 380 KB Output is correct
16 Correct 20 ms 340 KB Output is correct
17 Correct 18 ms 648 KB Output is correct
18 Correct 8 ms 980 KB Output is correct
19 Correct 16 ms 596 KB Output is correct
20 Correct 21 ms 640 KB Output is correct
21 Correct 1287 ms 10928 KB Output is correct
22 Correct 1194 ms 11132 KB Output is correct
23 Correct 1176 ms 11100 KB Output is correct
24 Correct 789 ms 12380 KB Output is correct
25 Correct 1018 ms 21684 KB Output is correct
26 Correct 1034 ms 22532 KB Output is correct
27 Correct 1276 ms 11016 KB Output is correct
28 Correct 1295 ms 10780 KB Output is correct
29 Correct 1263 ms 10996 KB Output is correct
30 Correct 1241 ms 4556 KB Output is correct
31 Correct 402 ms 6424 KB Output is correct
32 Correct 968 ms 17996 KB Output is correct
33 Correct 454 ms 1072 KB Output is correct
34 Correct 495 ms 1100 KB Output is correct
35 Correct 468 ms 1096 KB Output is correct
36 Correct 422 ms 1072 KB Output is correct
37 Correct 1108 ms 17736 KB Output is correct
38 Correct 613 ms 13428 KB Output is correct
39 Correct 1191 ms 14304 KB Output is correct
40 Correct 956 ms 21868 KB Output is correct
41 Correct 1029 ms 21872 KB Output is correct
42 Correct 889 ms 15028 KB Output is correct
43 Correct 478 ms 1916 KB Output is correct
44 Correct 974 ms 18184 KB Output is correct
45 Correct 764 ms 12828 KB Output is correct
46 Correct 574 ms 6760 KB Output is correct
47 Correct 550 ms 6196 KB Output is correct
48 Correct 536 ms 4448 KB Output is correct
49 Correct 1224 ms 11728 KB Output is correct
50 Correct 1165 ms 10948 KB Output is correct
51 Correct 1171 ms 11412 KB Output is correct
52 Correct 1222 ms 11500 KB Output is correct
53 Correct 481 ms 2184 KB Output is correct
54 Correct 752 ms 8976 KB Output is correct
55 Correct 762 ms 12316 KB Output is correct
56 Correct 712 ms 9460 KB Output is correct
57 Correct 444 ms 1136 KB Output is correct
58 Correct 429 ms 1040 KB Output is correct
59 Correct 430 ms 1056 KB Output is correct
60 Correct 456 ms 1068 KB Output is correct
61 Correct 818 ms 13076 KB Output is correct
62 Correct 812 ms 13176 KB Output is correct
63 Correct 1008 ms 21544 KB Output is correct
64 Correct 908 ms 14928 KB Output is correct
65 Correct 812 ms 13712 KB Output is correct
66 Correct 563 ms 6192 KB Output is correct
67 Correct 734 ms 10984 KB Output is correct
68 Correct 799 ms 14204 KB Output is correct
69 Correct 417 ms 1108 KB Output is correct
70 Correct 463 ms 1096 KB Output is correct
71 Correct 448 ms 1096 KB Output is correct
72 Correct 454 ms 1104 KB Output is correct
73 Correct 1098 ms 18200 KB Output is correct
74 Correct 1551 ms 3120 KB Output is correct
75 Correct 1043 ms 18964 KB Output is correct
76 Correct 1871 ms 4436 KB Output is correct
77 Correct 679 ms 8704 KB Output is correct
78 Correct 940 ms 18116 KB Output is correct
79 Correct 596 ms 3676 KB Output is correct
80 Correct 1010 ms 21876 KB Output is correct
81 Correct 859 ms 13112 KB Output is correct
82 Correct 688 ms 7484 KB Output is correct
83 Correct 1014 ms 19684 KB Output is correct
84 Correct 888 ms 13600 KB Output is correct
85 Correct 1248 ms 12116 KB Output is correct
86 Correct 1251 ms 10840 KB Output is correct
87 Correct 1175 ms 11620 KB Output is correct
88 Correct 1189 ms 11740 KB Output is correct
89 Correct 453 ms 1064 KB Output is correct
90 Correct 435 ms 1200 KB Output is correct
91 Correct 538 ms 1088 KB Output is correct
92 Correct 440 ms 1096 KB Output is correct
93 Correct 1372 ms 6936 KB Output is correct
94 Correct 272 ms 2604 KB Output is correct
95 Correct 954 ms 13572 KB Output is correct
96 Correct 1288 ms 1900 KB Output is correct
97 Correct 828 ms 13292 KB Output is correct
98 Correct 935 ms 20420 KB Output is correct
99 Correct 1048 ms 22004 KB Output is correct
100 Correct 966 ms 21412 KB Output is correct
101 Correct 561 ms 5044 KB Output is correct
102 Correct 489 ms 3912 KB Output is correct
103 Correct 784 ms 13644 KB Output is correct
104 Correct 693 ms 10672 KB Output is correct
105 Correct 1119 ms 11108 KB Output is correct
106 Correct 1093 ms 10628 KB Output is correct
107 Correct 1144 ms 11076 KB Output is correct
108 Correct 1132 ms 11296 KB Output is correct
109 Correct 614 ms 5796 KB Output is correct
110 Correct 715 ms 10600 KB Output is correct
111 Correct 925 ms 24816 KB Output is correct
112 Correct 991 ms 22340 KB Output is correct
113 Correct 419 ms 1120 KB Output is correct
114 Correct 396 ms 1044 KB Output is correct
115 Correct 403 ms 1336 KB Output is correct
116 Correct 413 ms 1116 KB Output is correct
117 Correct 740 ms 10524 KB Output is correct
118 Correct 584 ms 5772 KB Output is correct
119 Correct 520 ms 3296 KB Output is correct
120 Correct 789 ms 10732 KB Output is correct
121 Correct 804 ms 14544 KB Output is correct
122 Correct 821 ms 15892 KB Output is correct
123 Correct 640 ms 8420 KB Output is correct
124 Correct 493 ms 3716 KB Output is correct
125 Correct 922 ms 1628 KB Output is correct
126 Correct 815 ms 1708 KB Output is correct
127 Correct 828 ms 1784 KB Output is correct
128 Correct 818 ms 1724 KB Output is correct
129 Correct 805 ms 1640 KB Output is correct
130 Correct 841 ms 1792 KB Output is correct
131 Correct 2926 ms 4988 KB Output is correct
132 Correct 1727 ms 21244 KB Output is correct
133 Correct 2578 ms 31076 KB Output is correct
134 Correct 3664 ms 7512 KB Output is correct
135 Correct 3148 ms 38116 KB Output is correct
136 Correct 980 ms 1772 KB Output is correct
137 Runtime error 4187 ms 45224 KB Memory limit exceeded
138 Halted 0 ms 0 KB -