oj.uz

Submission #161278

# Submission time Handle Problem Language Result Execution time Memory
161278 2019-11-01T16:47:20 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 3931 ms 24188 KB 
#include <bits/stdc++.h>
#define pb push_back
#define pll pair <ll, ll>
#define MOMI using namespace std;
#define mp make_pair
#define pyshnapyshnakaa ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#pragma optimize("TKACHENKO-GORYACHENKO")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
 
typedef int ll;
 
typedef long double ld;
 
using namespace std;
 
const ll inf = 2e9 + 500;
const ll maxn = 3e5 + 100;
const ll block = 150;
const ll block_sz = (maxn + block - 1) / block + 10;
 
ll n, m, k, t;
 
struct seg{
	ll l;
	ll r;
	inline ll sz() const {
		return r - l + 1;
	}
	ll i;
};
 
inline bool operator==(seg a, seg b) {
	return a.i == b.i;
}
 
vector <seg> S;
 
struct R {
	bool operator()(seg a, seg b) const {
		if (a.r == b.r) {
			return a.i < b.i;
		}
		return a.r < b.r; 
	}
};
 
struct L {
	bool operator()(seg a, seg b) const {
		if (a.l == b.l) {
			return a.i < b.i;
		}
		return a.l < b.l;
	}
};
 
vector <seg> lasts;
 
inline bool cmp(seg a, seg b) {
	return (a.r - a.l) < (b.r - b.l);
}
 
inline bool cmpl(const seg& a, const seg& b) {
	return a.l < b.l;
}
 
inline bool cmpr(const seg& a, const seg& b) {
	return a.r < b.r;
}
 
inline bool cmpsz(const seg& a, const seg& b) {
	return a.sz() < b.sz();
}
 
vector <seg> segs;
 
vector <seg> R[block];
 
vector <seg> L[block];
 
ll MNL[block];
ll MXL[block];
ll MNR[block];
ll MXR[block];
 
ll IL[maxn];
ll IR[maxn];
 
bool used[maxn];
 
inline void buildL(ll q) {
	ll w;
	if (q > block) {
		exit(-1);
	}
	sort(L[q].begin(), L[q].end(), cmpsz);
	MNL[q] = inf;
	MXL[q] = -inf;
	for (w = 0; w < L[q].size(); w++) {
		MNL[q] = min(MNL[q], L[q][w].l);
		MXL[q] = max(MXL[q], L[q][w].l);
	}
}
 
inline void buildR(ll q) {
	ll w;
	if (q > block) {
		exit(-1);
	}
 	MNR[q] = inf;
	MXR[q] = -inf;
	sort(R[q].begin(), R[q].end(), cmpsz);
	for (w = 0; w < R[q].size(); w++) {
		MNR[q] = min(MNR[q], R[q][w].r);
		MXR[q] = max(MXR[q], R[q][w].r);
	}
}
 
inline void rebuild() { 
	ll q, w;
	lasts.clear();
	ll blocki = 0;
	for (q = 0; q < block; q++) {
		R[q].clear();
		L[q].clear();
	}
	sort(segs.begin(), segs.end(), cmpl);
	for (auto p : segs) {
		if (used[p.i]) {
			continue;
		}
		if (L[blocki].size() > block_sz) {
			blocki++;
		}
		IL[p.i] = blocki;
		L[blocki].pb(p);
	}
	sort(segs.begin(), segs.end(), cmpr);
	for (auto p: segs) {
		if (used[p.i]) {
			continue;
		}
		if (R[blocki].size() > block_sz) {
			blocki++;
		}
		IR[p.i] = blocki;
		R[blocki].pb(p);
	}
	for (q = 0; q < block; q++) {
		buildL(q);
	}
	for (q = 0; q < block; q++) {
		buildR(q);
	}
}
 
inline void add(seg a) {
	lasts.pb(a);
	S.pb(a);
	segs.push_back(a);
	IL[a.i] = IR[a.i] = -1;
}
 
inline void del(seg b) { 
	ll il = IL[b.i], ir = IR[b.i];
	used[b.i] = 1;
	if (il == -1) {
		return;
	}
	L[il].erase(find(L[il].begin(), L[il].end(), b));
	R[ir].erase(find(R[ir].begin(), R[ir].end(), b));
	buildL(il);
	buildR(ir);
}
 
inline ll slowL(ll i, ll x, ll l) {
	ll q;
	ll ans = 0;
	for (q = 0; q < L[i].size(); q++) {
		if (L[i][q].l >= l && L[i][q].sz() >= x) {
			ans++;
		}
	}
	return ans;
}
 
inline ll slowR(ll i, ll x, ll r) {
	ll q;
	ll ans = 0;
	for (q = 0; q < R[i].size(); q++) {
		if (R[i][q].r <= r && R[i][q].sz() >= x) {
			ans++;
		}
	}
	return ans;
}
 
inline ll fastL(ll i, ll x) {
	if (L[i].empty()) {
		return 0;
	}
	seg good;
	good.l = 0; good.r = x - 1; 
	ll j = (lower_bound(L[i].begin(), L[i].end(), good, cmpsz) - L[i].begin());
	return L[i].size() - j;
}
 
inline ll fastR(ll i, ll x) {
	if (R[i].empty()) {
		return 0;
	}
	seg good;
	good.l = 0; good.r = x - 1;
	ll j = (lower_bound(R[i].begin(), R[i].end(), good, cmpsz) - R[i].begin());
	return R[i].size() - j;
}
 
inline ll getansL(ll x, ll l) {
	ll q;
	ll ans = 0;
	for (q = 0; q < block; q++) {
		if (MNL[q] == inf) {
			continue;
		}
		if (MNL[q] >= l) {
			ans += fastL(q, x);
			continue;
		}
		if (MXL[q] < l) {
			continue;
		}
		if (MNL[q] < l) {
			ans += slowL(q, x, l);
		}
	}
 
	for (q = 0; q < lasts.size(); q++) {
		if (used[lasts[q].i]) {
			continue;
		}
		if (lasts[q].l >= l && lasts[q].sz() >= x) {
			ans++;
		}
	}
	return ans;
}
 
inline ll getansR(ll x, ll r) {
	ll q;
	ll ans = 0;
	ll cnt = 0;
	for (q = 0; q < block; q++) {
		if (MNR[q] == inf) {
			continue;
		}
		// if (q > 1) {
		// 	if (MXR[q - 1] > MNR[q]) {
		// 		exit(-1);
		// 	}
		// }
		if (MXR[q] <= r) {
			ll dans = fastR(q, x);
			ans += dans;
			continue;
		}
		if (MNR[q] > r) {
			continue;
		}
		/// MXR[q] > r && MNR[q] <= r, 
		ll dans = slowR(q, x, r);
		ans += dans;
		cnt++;
	}
	// if (cnt > 5) {
	// 	exit(-1);
	// }
	for (q = 0; q < lasts.size(); q++) {
		if (used[lasts[q].i]) {
			continue;
		}
		if (lasts[q].r <= r && lasts[q].sz() >= x) {
			ans++;
		}
	}
	return ans;
}
 
inline ll answer(seg c, ll k) {
	if (c.sz() < k) {
		return 0;
	}
	ll q, w;
	ll ans = 0;
	ll lk = c.r - k + 2, rk = c.l + k - 2;
	ll allans = getansR(k, inf);
	ll dansl = getansL(k, lk);
	ll dansr = getansR(k, rk);
	ans = allans - dansr - dansl;
	return ans;
}
 
signed main() {
	ll q, w, e, a, b, c;
	pyshnapyshnakaa;
	cin >> n >> t;
	// cout << block_sz * block << endl;
	ll nxt = 0;
	ll lastans = 0;
	ll cnt3 = 0;
	for (q = 0; q < n; q++) {
		ll comm;
		cin >> comm;
		ll l, r;
		seg x;
		if (comm == 1) {
			cin >> l >> r;
			l ^= (lastans * t);
			r ^= (lastans * t);
			if (l > r) {
				swap(l, r);
			}
			x.l = l; x.r = r;
			x.i = S.size();
			add(x);
		}
		if (comm == 2) {
			cin >> a;
			a--;
			del(S[a]);
		}
		// if (cnt3 > 8e4 && n > 1e5) {
		// 	exit(-1);
		// }
		if (comm == 3) {
			cnt3++;
			cin >> l >> r;
			l ^= (lastans * t);
			r ^= (lastans * t);
			if (lasts.size() >= block_sz) {
				rebuild();
			}
			if (l > r) {
				swap(l, r);
			} 
			x.l = l; x.r = r;
			cin >> c;
			lastans = answer(x, c);
			cout << lastans << '\n';
		}
	}
	return 0;
}

Compilation message

segments.cpp:7:0: warning: ignoring #pragma optimize  [-Wunknown-pragmas]
 #pragma optimize("TKACHENKO-GORYACHENKO")
 
segments.cpp: In function 'void buildL(ll)':
segments.cpp:100:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (w = 0; w < L[q].size(); w++) {
              ~~^~~~~~~~~~~~~
segments.cpp: In function 'void buildR(ll)':
segments.cpp:114:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (w = 0; w < R[q].size(); w++) {
              ~~^~~~~~~~~~~~~
segments.cpp: In function 'void rebuild()':
segments.cpp:121:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'll slowL(ll, ll, ll)':
segments.cpp:180:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (q = 0; q < L[i].size(); q++) {
              ~~^~~~~~~~~~~~~
segments.cpp: In function 'll slowR(ll, ll, ll)':
segments.cpp:191:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (q = 0; q < R[i].size(); q++) {
              ~~^~~~~~~~~~~~~
segments.cpp: In function 'll getansL(ll, ll)':
segments.cpp:238:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (q = 0; q < lasts.size(); q++) {
              ~~^~~~~~~~~~~~~~
segments.cpp: In function 'll getansR(ll, ll)':
segments.cpp:278:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (q = 0; q < lasts.size(); q++) {
              ~~^~~~~~~~~~~~~~
segments.cpp: In function 'll answer(seg, ll)':
segments.cpp:293:5: warning: unused variable 'q' [-Wunused-variable]
  ll q, w;
     ^
segments.cpp:293:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'int main()':
segments.cpp:304:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w, e, a, b, c;
        ^
segments.cpp:304:11: warning: unused variable 'e' [-Wunused-variable]
  ll q, w, e, a, b, c;
           ^
segments.cpp:304:17: warning: unused variable 'b' [-Wunused-variable]
  ll q, w, e, a, b, c;
                 ^
segments.cpp:308:5: warning: unused variable 'nxt' [-Wunused-variable]
  ll nxt = 0;
     ^~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 352 KB Output is correct
3 Correct 11 ms 504 KB Output is correct
4 Correct 10 ms 632 KB Output is correct
5 Correct 18 ms 936 KB Output is correct
6 Correct 23 ms 760 KB Output is correct
7 Correct 39 ms 632 KB Output is correct
8 Correct 75 ms 760 KB Output is correct
9 Correct 84 ms 632 KB Output is correct
10 Correct 34 ms 888 KB Output is correct
11 Correct 36 ms 760 KB Output is correct
12 Correct 36 ms 760 KB Output is correct
13 Correct 36 ms 888 KB Output is correct
14 Correct 98 ms 888 KB Output is correct
15 Correct 10 ms 632 KB Output is correct
16 Correct 13 ms 632 KB Output is correct
17 Correct 51 ms 760 KB Output is correct
18 Correct 62 ms 888 KB Output is correct
19 Correct 57 ms 760 KB Output is correct
20 Correct 59 ms 760 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1297 ms 5124 KB Output is correct
2 Correct 1157 ms 4604 KB Output is correct
3 Correct 1161 ms 4820 KB Output is correct
4 Correct 1081 ms 5016 KB Output is correct
5 Correct 312 ms 7568 KB Output is correct
6 Correct 207 ms 7672 KB Output is correct
7 Correct 1245 ms 4748 KB Output is correct
8 Correct 1169 ms 4816 KB Output is correct
9 Correct 1150 ms 4768 KB Output is correct
10 Correct 1478 ms 2952 KB Output is correct
11 Correct 1456 ms 3400 KB Output is correct
12 Correct 801 ms 6156 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 340 ms 2996 KB Output is correct
2 Correct 260 ms 2980 KB Output is correct
3 Correct 387 ms 3004 KB Output is correct
4 Correct 268 ms 2980 KB Output is correct
5 Correct 571 ms 6392 KB Output is correct
6 Correct 749 ms 5460 KB Output is correct
7 Correct 684 ms 5772 KB Output is correct
8 Correct 192 ms 7320 KB Output is correct
9 Correct 736 ms 7400 KB Output is correct
10 Correct 2262 ms 6304 KB Output is correct
11 Correct 1893 ms 2984 KB Output is correct
12 Correct 2170 ms 6084 KB Output is correct
13 Correct 2592 ms 6068 KB Output is correct
14 Correct 3535 ms 3916 KB Output is correct
15 Correct 3654 ms 3692 KB Output is correct
16 Correct 3402 ms 3444 KB Output is correct
17 Correct 899 ms 4908 KB Output is correct
18 Correct 902 ms 4772 KB Output is correct
19 Correct 897 ms 4928 KB Output is correct
20 Correct 899 ms 4876 KB Output is correct
21 Correct 2304 ms 3324 KB Output is correct
22 Correct 3468 ms 4720 KB Output is correct
23 Correct 3124 ms 6124 KB Output is correct
24 Correct 3931 ms 4764 KB Output is correct
25 Correct 301 ms 3316 KB Output is correct
26 Correct 275 ms 3384 KB Output is correct
27 Correct 298 ms 3316 KB Output is correct
28 Correct 288 ms 3380 KB Output is correct
29 Correct 2808 ms 6440 KB Output is correct
30 Correct 2904 ms 6472 KB Output is correct
31 Correct 691 ms 8012 KB Output is correct
32 Correct 2256 ms 6760 KB Output is correct
33 Correct 2475 ms 6604 KB Output is correct
34 Correct 3454 ms 4096 KB Output is correct
35 Correct 2948 ms 5420 KB Output is correct
36 Correct 2339 ms 6832 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 262 ms 2352 KB Output is correct
2 Correct 399 ms 3516 KB Output is correct
3 Correct 271 ms 3508 KB Output is correct
4 Correct 283 ms 3508 KB Output is correct
5 Correct 662 ms 7068 KB Output is correct
6 Correct 1783 ms 3072 KB Output is correct
7 Correct 519 ms 7188 KB Output is correct
8 Correct 1469 ms 3756 KB Output is correct
9 Correct 3701 ms 4792 KB Output is correct
10 Correct 2047 ms 6808 KB Output is correct
11 Correct 3351 ms 3304 KB Output is correct
12 Correct 403 ms 7952 KB Output is correct
13 Correct 2744 ms 6176 KB Output is correct
14 Correct 3646 ms 4380 KB Output is correct
15 Correct 1081 ms 7572 KB Output is correct
16 Correct 2509 ms 6424 KB Output is correct
17 Correct 1160 ms 5100 KB Output is correct
18 Correct 1337 ms 5024 KB Output is correct
19 Correct 1165 ms 5084 KB Output is correct
20 Correct 1161 ms 5064 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 352 KB Output is correct
3 Correct 11 ms 504 KB Output is correct
4 Correct 10 ms 632 KB Output is correct
5 Correct 18 ms 936 KB Output is correct
6 Correct 23 ms 760 KB Output is correct
7 Correct 39 ms 632 KB Output is correct
8 Correct 75 ms 760 KB Output is correct
9 Correct 84 ms 632 KB Output is correct
10 Correct 34 ms 888 KB Output is correct
11 Correct 36 ms 760 KB Output is correct
12 Correct 36 ms 760 KB Output is correct
13 Correct 36 ms 888 KB Output is correct
14 Correct 98 ms 888 KB Output is correct
15 Correct 10 ms 632 KB Output is correct
16 Correct 13 ms 632 KB Output is correct
17 Correct 51 ms 760 KB Output is correct
18 Correct 62 ms 888 KB Output is correct
19 Correct 57 ms 760 KB Output is correct
20 Correct 59 ms 760 KB Output is correct
21 Correct 1297 ms 5124 KB Output is correct
22 Correct 1157 ms 4604 KB Output is correct
23 Correct 1161 ms 4820 KB Output is correct
24 Correct 1081 ms 5016 KB Output is correct
25 Correct 312 ms 7568 KB Output is correct
26 Correct 207 ms 7672 KB Output is correct
27 Correct 1245 ms 4748 KB Output is correct
28 Correct 1169 ms 4816 KB Output is correct
29 Correct 1150 ms 4768 KB Output is correct
30 Correct 1478 ms 2952 KB Output is correct
31 Correct 1456 ms 3400 KB Output is correct
32 Correct 801 ms 6156 KB Output is correct
33 Correct 262 ms 2352 KB Output is correct
34 Correct 399 ms 3516 KB Output is correct
35 Correct 271 ms 3508 KB Output is correct
36 Correct 283 ms 3508 KB Output is correct
37 Correct 662 ms 7068 KB Output is correct
38 Correct 1783 ms 3072 KB Output is correct
39 Correct 519 ms 7188 KB Output is correct
40 Correct 1469 ms 3756 KB Output is correct
41 Correct 3701 ms 4792 KB Output is correct
42 Correct 2047 ms 6808 KB Output is correct
43 Correct 3351 ms 3304 KB Output is correct
44 Correct 403 ms 7952 KB Output is correct
45 Correct 2744 ms 6176 KB Output is correct
46 Correct 3646 ms 4380 KB Output is correct
47 Correct 1081 ms 7572 KB Output is correct
48 Correct 2509 ms 6424 KB Output is correct
49 Correct 1160 ms 5100 KB Output is correct
50 Correct 1337 ms 5024 KB Output is correct
51 Correct 1165 ms 5084 KB Output is correct
52 Correct 1161 ms 5064 KB Output is correct
53 Correct 303 ms 3332 KB Output is correct
54 Correct 286 ms 3256 KB Output is correct
55 Correct 257 ms 3304 KB Output is correct
56 Correct 276 ms 3252 KB Output is correct
57 Correct 1410 ms 4032 KB Output is correct
58 Correct 1467 ms 2424 KB Output is correct
59 Correct 953 ms 6304 KB Output is correct
60 Correct 1466 ms 2764 KB Output is correct
61 Correct 2717 ms 6568 KB Output is correct
62 Correct 1088 ms 8204 KB Output is correct
63 Correct 623 ms 8484 KB Output is correct
64 Correct 1022 ms 8340 KB Output is correct
65 Correct 3551 ms 4520 KB Output is correct
66 Correct 3523 ms 4280 KB Output is correct
67 Correct 2394 ms 7144 KB Output is correct
68 Correct 3167 ms 6304 KB Output is correct
69 Correct 1149 ms 5768 KB Output is correct
70 Correct 1163 ms 5888 KB Output is correct
71 Correct 1517 ms 5824 KB Output is correct
72 Correct 1134 ms 5948 KB Output is correct
73 Correct 3692 ms 4816 KB Output is correct
74 Correct 3237 ms 6036 KB Output is correct
75 Correct 222 ms 8728 KB Output is correct
76 Correct 551 ms 8848 KB Output is correct
77 Correct 272 ms 4024 KB Output is correct
78 Correct 265 ms 4248 KB Output is correct
79 Correct 281 ms 4216 KB Output is correct
80 Correct 265 ms 3892 KB Output is correct
81 Correct 3247 ms 5960 KB Output is correct
82 Correct 3652 ms 4648 KB Output is correct
83 Correct 3199 ms 4180 KB Output is correct
84 Correct 3355 ms 5840 KB Output is correct
85 Correct 2346 ms 6944 KB Output is correct
86 Correct 2306 ms 6996 KB Output is correct
87 Correct 3511 ms 5188 KB Output is correct
88 Correct 3349 ms 4056 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 352 KB Output is correct
3 Correct 11 ms 504 KB Output is correct
4 Correct 10 ms 632 KB Output is correct
5 Correct 18 ms 936 KB Output is correct
6 Correct 23 ms 760 KB Output is correct
7 Correct 39 ms 632 KB Output is correct
8 Correct 75 ms 760 KB Output is correct
9 Correct 84 ms 632 KB Output is correct
10 Correct 34 ms 888 KB Output is correct
11 Correct 36 ms 760 KB Output is correct
12 Correct 36 ms 760 KB Output is correct
13 Correct 36 ms 888 KB Output is correct
14 Correct 98 ms 888 KB Output is correct
15 Correct 10 ms 632 KB Output is correct
16 Correct 13 ms 632 KB Output is correct
17 Correct 51 ms 760 KB Output is correct
18 Correct 62 ms 888 KB Output is correct
19 Correct 57 ms 760 KB Output is correct
20 Correct 59 ms 760 KB Output is correct
21 Correct 1297 ms 5124 KB Output is correct
22 Correct 1157 ms 4604 KB Output is correct
23 Correct 1161 ms 4820 KB Output is correct
24 Correct 1081 ms 5016 KB Output is correct
25 Correct 312 ms 7568 KB Output is correct
26 Correct 207 ms 7672 KB Output is correct
27 Correct 1245 ms 4748 KB Output is correct
28 Correct 1169 ms 4816 KB Output is correct
29 Correct 1150 ms 4768 KB Output is correct
30 Correct 1478 ms 2952 KB Output is correct
31 Correct 1456 ms 3400 KB Output is correct
32 Correct 801 ms 6156 KB Output is correct
33 Correct 340 ms 2996 KB Output is correct
34 Correct 260 ms 2980 KB Output is correct
35 Correct 387 ms 3004 KB Output is correct
36 Correct 268 ms 2980 KB Output is correct
37 Correct 571 ms 6392 KB Output is correct
38 Correct 749 ms 5460 KB Output is correct
39 Correct 684 ms 5772 KB Output is correct
40 Correct 192 ms 7320 KB Output is correct
41 Correct 736 ms 7400 KB Output is correct
42 Correct 2262 ms 6304 KB Output is correct
43 Correct 1893 ms 2984 KB Output is correct
44 Correct 2170 ms 6084 KB Output is correct
45 Correct 2592 ms 6068 KB Output is correct
46 Correct 3535 ms 3916 KB Output is correct
47 Correct 3654 ms 3692 KB Output is correct
48 Correct 3402 ms 3444 KB Output is correct
49 Correct 899 ms 4908 KB Output is correct
50 Correct 902 ms 4772 KB Output is correct
51 Correct 897 ms 4928 KB Output is correct
52 Correct 899 ms 4876 KB Output is correct
53 Correct 2304 ms 3324 KB Output is correct
54 Correct 3468 ms 4720 KB Output is correct
55 Correct 3124 ms 6124 KB Output is correct
56 Correct 3931 ms 4764 KB Output is correct
57 Correct 301 ms 3316 KB Output is correct
58 Correct 275 ms 3384 KB Output is correct
59 Correct 298 ms 3316 KB Output is correct
60 Correct 288 ms 3380 KB Output is correct
61 Correct 2808 ms 6440 KB Output is correct
62 Correct 2904 ms 6472 KB Output is correct
63 Correct 691 ms 8012 KB Output is correct
64 Correct 2256 ms 6760 KB Output is correct
65 Correct 2475 ms 6604 KB Output is correct
66 Correct 3454 ms 4096 KB Output is correct
67 Correct 2948 ms 5420 KB Output is correct
68 Correct 2339 ms 6832 KB Output is correct
69 Correct 262 ms 2352 KB Output is correct
70 Correct 399 ms 3516 KB Output is correct
71 Correct 271 ms 3508 KB Output is correct
72 Correct 283 ms 3508 KB Output is correct
73 Correct 662 ms 7068 KB Output is correct
74 Correct 1783 ms 3072 KB Output is correct
75 Correct 519 ms 7188 KB Output is correct
76 Correct 1469 ms 3756 KB Output is correct
77 Correct 3701 ms 4792 KB Output is correct
78 Correct 2047 ms 6808 KB Output is correct
79 Correct 3351 ms 3304 KB Output is correct
80 Correct 403 ms 7952 KB Output is correct
81 Correct 2744 ms 6176 KB Output is correct
82 Correct 3646 ms 4380 KB Output is correct
83 Correct 1081 ms 7572 KB Output is correct
84 Correct 2509 ms 6424 KB Output is correct
85 Correct 1160 ms 5100 KB Output is correct
86 Correct 1337 ms 5024 KB Output is correct
87 Correct 1165 ms 5084 KB Output is correct
88 Correct 1161 ms 5064 KB Output is correct
89 Correct 303 ms 3332 KB Output is correct
90 Correct 286 ms 3256 KB Output is correct
91 Correct 257 ms 3304 KB Output is correct
92 Correct 276 ms 3252 KB Output is correct
93 Correct 1410 ms 4032 KB Output is correct
94 Correct 1467 ms 2424 KB Output is correct
95 Correct 953 ms 6304 KB Output is correct
96 Correct 1466 ms 2764 KB Output is correct
97 Correct 2717 ms 6568 KB Output is correct
98 Correct 1088 ms 8204 KB Output is correct
99 Correct 623 ms 8484 KB Output is correct
100 Correct 1022 ms 8340 KB Output is correct
101 Correct 3551 ms 4520 KB Output is correct
102 Correct 3523 ms 4280 KB Output is correct
103 Correct 2394 ms 7144 KB Output is correct
104 Correct 3167 ms 6304 KB Output is correct
105 Correct 1149 ms 5768 KB Output is correct
106 Correct 1163 ms 5888 KB Output is correct
107 Correct 1517 ms 5824 KB Output is correct
108 Correct 1134 ms 5948 KB Output is correct
109 Correct 3692 ms 4816 KB Output is correct
110 Correct 3237 ms 6036 KB Output is correct
111 Correct 222 ms 8728 KB Output is correct
112 Correct 551 ms 8848 KB Output is correct
113 Correct 272 ms 4024 KB Output is correct
114 Correct 265 ms 4248 KB Output is correct
115 Correct 281 ms 4216 KB Output is correct
116 Correct 265 ms 3892 KB Output is correct
117 Correct 3247 ms 5960 KB Output is correct
118 Correct 3652 ms 4648 KB Output is correct
119 Correct 3199 ms 4180 KB Output is correct
120 Correct 3355 ms 5840 KB Output is correct
121 Correct 2346 ms 6944 KB Output is correct
122 Correct 2306 ms 6996 KB Output is correct
123 Correct 3511 ms 5188 KB Output is correct
124 Correct 3349 ms 4056 KB Output is correct
125 Correct 758 ms 5952 KB Output is correct
126 Correct 742 ms 6080 KB Output is correct
127 Correct 815 ms 6012 KB Output is correct
128 Correct 785 ms 6196 KB Output is correct
129 Correct 688 ms 5936 KB Output is correct
130 Correct 766 ms 6064 KB Output is correct
131 Correct 3516 ms 5196 KB Output is correct
132 Correct 3198 ms 9124 KB Output is correct
133 Correct 2283 ms 11704 KB Output is correct
134 Correct 3708 ms 4504 KB Output is correct
135 Correct 2029 ms 10968 KB Output is correct
136 Correct 2640 ms 2512 KB Output is correct
137 Runtime error 156 ms 24188 KB Execution killed with signal 11 (could be triggered by violating memory limits)
138 Halted 0 ms 0 KB -