oj.uz

Submission #161275

# Submission time Handle Problem Language Result Execution time Memory
161275 2019-11-01T16:41:17 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 4881 ms 23804 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) {
	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) {
	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:232: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:272: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:287:5: warning: unused variable 'q' [-Wunused-variable]
  ll q, w;
     ^
segments.cpp:287:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'int main()':
segments.cpp:298:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w, e, a, b, c;
        ^
segments.cpp:298:11: warning: unused variable 'e' [-Wunused-variable]
  ll q, w, e, a, b, c;
           ^
segments.cpp:298:17: warning: unused variable 'b' [-Wunused-variable]
  ll q, w, e, a, b, c;
                 ^
segments.cpp:302: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 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 10 ms 504 KB Output is correct
4 Correct 10 ms 504 KB Output is correct
5 Correct 18 ms 888 KB Output is correct
6 Correct 22 ms 760 KB Output is correct
7 Correct 39 ms 620 KB Output is correct
8 Correct 76 ms 760 KB Output is correct
9 Correct 85 ms 764 KB Output is correct
10 Correct 35 ms 888 KB Output is correct
11 Correct 36 ms 760 KB Output is correct
12 Correct 36 ms 888 KB Output is correct
13 Correct 36 ms 908 KB Output is correct
14 Correct 93 ms 760 KB Output is correct
15 Correct 10 ms 632 KB Output is correct
16 Correct 13 ms 632 KB Output is correct
17 Correct 52 ms 760 KB Output is correct
18 Correct 62 ms 888 KB Output is correct
19 Correct 57 ms 860 KB Output is correct
20 Correct 59 ms 632 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1180 ms 5044 KB Output is correct
2 Correct 1159 ms 5012 KB Output is correct
3 Correct 1199 ms 5292 KB Output is correct
4 Correct 1105 ms 5212 KB Output is correct
5 Correct 247 ms 7728 KB Output is correct
6 Correct 169 ms 7756 KB Output is correct
7 Correct 1183 ms 5172 KB Output is correct
8 Correct 1167 ms 5196 KB Output is correct
9 Correct 1218 ms 5112 KB Output is correct
10 Correct 1576 ms 3288 KB Output is correct
11 Correct 1580 ms 3780 KB Output is correct
12 Correct 807 ms 6128 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 302 ms 2972 KB Output is correct
2 Correct 255 ms 3136 KB Output is correct
3 Correct 358 ms 3124 KB Output is correct
4 Correct 258 ms 3124 KB Output is correct
5 Correct 573 ms 6324 KB Output is correct
6 Correct 759 ms 5640 KB Output is correct
7 Correct 672 ms 6160 KB Output is correct
8 Correct 191 ms 7696 KB Output is correct
9 Correct 750 ms 7672 KB Output is correct
10 Correct 2244 ms 6304 KB Output is correct
11 Correct 2627 ms 3196 KB Output is correct
12 Correct 2230 ms 6300 KB Output is correct
13 Correct 2607 ms 6220 KB Output is correct
14 Correct 3588 ms 4148 KB Output is correct
15 Correct 3589 ms 3800 KB Output is correct
16 Correct 3398 ms 3552 KB Output is correct
17 Correct 916 ms 5156 KB Output is correct
18 Correct 914 ms 5116 KB Output is correct
19 Correct 973 ms 4968 KB Output is correct
20 Correct 1070 ms 5016 KB Output is correct
21 Correct 2264 ms 3292 KB Output is correct
22 Correct 3480 ms 4700 KB Output is correct
23 Correct 3088 ms 6084 KB Output is correct
24 Correct 3723 ms 4832 KB Output is correct
25 Correct 301 ms 3004 KB Output is correct
26 Correct 271 ms 3268 KB Output is correct
27 Correct 297 ms 3264 KB Output is correct
28 Correct 287 ms 3172 KB Output is correct
29 Correct 2850 ms 6172 KB Output is correct
30 Correct 2880 ms 6172 KB Output is correct
31 Correct 682 ms 7620 KB Output is correct
32 Correct 2323 ms 6248 KB Output is correct
33 Correct 2506 ms 6400 KB Output is correct
34 Correct 3518 ms 3956 KB Output is correct
35 Correct 4881 ms 5280 KB Output is correct
36 Correct 2352 ms 6328 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 290 ms 3256 KB Output is correct
2 Correct 265 ms 3252 KB Output is correct
3 Correct 261 ms 3124 KB Output is correct
4 Correct 280 ms 3124 KB Output is correct
5 Correct 659 ms 6668 KB Output is correct
6 Correct 1537 ms 2936 KB Output is correct
7 Correct 517 ms 7004 KB Output is correct
8 Correct 1528 ms 3252 KB Output is correct
9 Correct 3648 ms 4636 KB Output is correct
10 Correct 2023 ms 6408 KB Output is correct
11 Correct 3354 ms 2768 KB Output is correct
12 Correct 466 ms 7180 KB Output is correct
13 Correct 2737 ms 5672 KB Output is correct
14 Correct 3612 ms 3628 KB Output is correct
15 Correct 815 ms 6928 KB Output is correct
16 Correct 2489 ms 5696 KB Output is correct
17 Correct 1179 ms 4512 KB Output is correct
18 Correct 1167 ms 4620 KB Output is correct
19 Correct 1162 ms 4512 KB Output is correct
20 Correct 1155 ms 4384 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 10 ms 504 KB Output is correct
4 Correct 10 ms 504 KB Output is correct
5 Correct 18 ms 888 KB Output is correct
6 Correct 22 ms 760 KB Output is correct
7 Correct 39 ms 620 KB Output is correct
8 Correct 76 ms 760 KB Output is correct
9 Correct 85 ms 764 KB Output is correct
10 Correct 35 ms 888 KB Output is correct
11 Correct 36 ms 760 KB Output is correct
12 Correct 36 ms 888 KB Output is correct
13 Correct 36 ms 908 KB Output is correct
14 Correct 93 ms 760 KB Output is correct
15 Correct 10 ms 632 KB Output is correct
16 Correct 13 ms 632 KB Output is correct
17 Correct 52 ms 760 KB Output is correct
18 Correct 62 ms 888 KB Output is correct
19 Correct 57 ms 860 KB Output is correct
20 Correct 59 ms 632 KB Output is correct
21 Correct 1180 ms 5044 KB Output is correct
22 Correct 1159 ms 5012 KB Output is correct
23 Correct 1199 ms 5292 KB Output is correct
24 Correct 1105 ms 5212 KB Output is correct
25 Correct 247 ms 7728 KB Output is correct
26 Correct 169 ms 7756 KB Output is correct
27 Correct 1183 ms 5172 KB Output is correct
28 Correct 1167 ms 5196 KB Output is correct
29 Correct 1218 ms 5112 KB Output is correct
30 Correct 1576 ms 3288 KB Output is correct
31 Correct 1580 ms 3780 KB Output is correct
32 Correct 807 ms 6128 KB Output is correct
33 Correct 290 ms 3256 KB Output is correct
34 Correct 265 ms 3252 KB Output is correct
35 Correct 261 ms 3124 KB Output is correct
36 Correct 280 ms 3124 KB Output is correct
37 Correct 659 ms 6668 KB Output is correct
38 Correct 1537 ms 2936 KB Output is correct
39 Correct 517 ms 7004 KB Output is correct
40 Correct 1528 ms 3252 KB Output is correct
41 Correct 3648 ms 4636 KB Output is correct
42 Correct 2023 ms 6408 KB Output is correct
43 Correct 3354 ms 2768 KB Output is correct
44 Correct 466 ms 7180 KB Output is correct
45 Correct 2737 ms 5672 KB Output is correct
46 Correct 3612 ms 3628 KB Output is correct
47 Correct 815 ms 6928 KB Output is correct
48 Correct 2489 ms 5696 KB Output is correct
49 Correct 1179 ms 4512 KB Output is correct
50 Correct 1167 ms 4620 KB Output is correct
51 Correct 1162 ms 4512 KB Output is correct
52 Correct 1155 ms 4384 KB Output is correct
53 Correct 285 ms 2628 KB Output is correct
54 Correct 281 ms 2640 KB Output is correct
55 Correct 254 ms 2612 KB Output is correct
56 Correct 262 ms 2632 KB Output is correct
57 Correct 1402 ms 3284 KB Output is correct
58 Correct 1505 ms 1896 KB Output is correct
59 Correct 963 ms 4996 KB Output is correct
60 Correct 1463 ms 1772 KB Output is correct
61 Correct 2744 ms 5752 KB Output is correct
62 Correct 1080 ms 6788 KB Output is correct
63 Correct 616 ms 7192 KB Output is correct
64 Correct 1010 ms 6976 KB Output is correct
65 Correct 3688 ms 3224 KB Output is correct
66 Correct 3810 ms 3056 KB Output is correct
67 Correct 2475 ms 5936 KB Output is correct
68 Correct 3139 ms 4640 KB Output is correct
69 Correct 1135 ms 4512 KB Output is correct
70 Correct 1232 ms 4652 KB Output is correct
71 Correct 1159 ms 4512 KB Output is correct
72 Correct 1363 ms 4476 KB Output is correct
73 Correct 3835 ms 3340 KB Output is correct
74 Correct 3253 ms 4852 KB Output is correct
75 Correct 226 ms 7568 KB Output is correct
76 Correct 563 ms 7056 KB Output is correct
77 Correct 279 ms 2612 KB Output is correct
78 Correct 268 ms 2740 KB Output is correct
79 Correct 283 ms 2740 KB Output is correct
80 Correct 271 ms 2772 KB Output is correct
81 Correct 3433 ms 4528 KB Output is correct
82 Correct 3753 ms 3340 KB Output is correct
83 Correct 3173 ms 2832 KB Output is correct
84 Correct 3282 ms 4644 KB Output is correct
85 Correct 2332 ms 5920 KB Output is correct
86 Correct 2282 ms 5748 KB Output is correct
87 Correct 3551 ms 4000 KB Output is correct
88 Correct 3369 ms 2832 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 10 ms 504 KB Output is correct
4 Correct 10 ms 504 KB Output is correct
5 Correct 18 ms 888 KB Output is correct
6 Correct 22 ms 760 KB Output is correct
7 Correct 39 ms 620 KB Output is correct
8 Correct 76 ms 760 KB Output is correct
9 Correct 85 ms 764 KB Output is correct
10 Correct 35 ms 888 KB Output is correct
11 Correct 36 ms 760 KB Output is correct
12 Correct 36 ms 888 KB Output is correct
13 Correct 36 ms 908 KB Output is correct
14 Correct 93 ms 760 KB Output is correct
15 Correct 10 ms 632 KB Output is correct
16 Correct 13 ms 632 KB Output is correct
17 Correct 52 ms 760 KB Output is correct
18 Correct 62 ms 888 KB Output is correct
19 Correct 57 ms 860 KB Output is correct
20 Correct 59 ms 632 KB Output is correct
21 Correct 1180 ms 5044 KB Output is correct
22 Correct 1159 ms 5012 KB Output is correct
23 Correct 1199 ms 5292 KB Output is correct
24 Correct 1105 ms 5212 KB Output is correct
25 Correct 247 ms 7728 KB Output is correct
26 Correct 169 ms 7756 KB Output is correct
27 Correct 1183 ms 5172 KB Output is correct
28 Correct 1167 ms 5196 KB Output is correct
29 Correct 1218 ms 5112 KB Output is correct
30 Correct 1576 ms 3288 KB Output is correct
31 Correct 1580 ms 3780 KB Output is correct
32 Correct 807 ms 6128 KB Output is correct
33 Correct 302 ms 2972 KB Output is correct
34 Correct 255 ms 3136 KB Output is correct
35 Correct 358 ms 3124 KB Output is correct
36 Correct 258 ms 3124 KB Output is correct
37 Correct 573 ms 6324 KB Output is correct
38 Correct 759 ms 5640 KB Output is correct
39 Correct 672 ms 6160 KB Output is correct
40 Correct 191 ms 7696 KB Output is correct
41 Correct 750 ms 7672 KB Output is correct
42 Correct 2244 ms 6304 KB Output is correct
43 Correct 2627 ms 3196 KB Output is correct
44 Correct 2230 ms 6300 KB Output is correct
45 Correct 2607 ms 6220 KB Output is correct
46 Correct 3588 ms 4148 KB Output is correct
47 Correct 3589 ms 3800 KB Output is correct
48 Correct 3398 ms 3552 KB Output is correct
49 Correct 916 ms 5156 KB Output is correct
50 Correct 914 ms 5116 KB Output is correct
51 Correct 973 ms 4968 KB Output is correct
52 Correct 1070 ms 5016 KB Output is correct
53 Correct 2264 ms 3292 KB Output is correct
54 Correct 3480 ms 4700 KB Output is correct
55 Correct 3088 ms 6084 KB Output is correct
56 Correct 3723 ms 4832 KB Output is correct
57 Correct 301 ms 3004 KB Output is correct
58 Correct 271 ms 3268 KB Output is correct
59 Correct 297 ms 3264 KB Output is correct
60 Correct 287 ms 3172 KB Output is correct
61 Correct 2850 ms 6172 KB Output is correct
62 Correct 2880 ms 6172 KB Output is correct
63 Correct 682 ms 7620 KB Output is correct
64 Correct 2323 ms 6248 KB Output is correct
65 Correct 2506 ms 6400 KB Output is correct
66 Correct 3518 ms 3956 KB Output is correct
67 Correct 4881 ms 5280 KB Output is correct
68 Correct 2352 ms 6328 KB Output is correct
69 Correct 290 ms 3256 KB Output is correct
70 Correct 265 ms 3252 KB Output is correct
71 Correct 261 ms 3124 KB Output is correct
72 Correct 280 ms 3124 KB Output is correct
73 Correct 659 ms 6668 KB Output is correct
74 Correct 1537 ms 2936 KB Output is correct
75 Correct 517 ms 7004 KB Output is correct
76 Correct 1528 ms 3252 KB Output is correct
77 Correct 3648 ms 4636 KB Output is correct
78 Correct 2023 ms 6408 KB Output is correct
79 Correct 3354 ms 2768 KB Output is correct
80 Correct 466 ms 7180 KB Output is correct
81 Correct 2737 ms 5672 KB Output is correct
82 Correct 3612 ms 3628 KB Output is correct
83 Correct 815 ms 6928 KB Output is correct
84 Correct 2489 ms 5696 KB Output is correct
85 Correct 1179 ms 4512 KB Output is correct
86 Correct 1167 ms 4620 KB Output is correct
87 Correct 1162 ms 4512 KB Output is correct
88 Correct 1155 ms 4384 KB Output is correct
89 Correct 285 ms 2628 KB Output is correct
90 Correct 281 ms 2640 KB Output is correct
91 Correct 254 ms 2612 KB Output is correct
92 Correct 262 ms 2632 KB Output is correct
93 Correct 1402 ms 3284 KB Output is correct
94 Correct 1505 ms 1896 KB Output is correct
95 Correct 963 ms 4996 KB Output is correct
96 Correct 1463 ms 1772 KB Output is correct
97 Correct 2744 ms 5752 KB Output is correct
98 Correct 1080 ms 6788 KB Output is correct
99 Correct 616 ms 7192 KB Output is correct
100 Correct 1010 ms 6976 KB Output is correct
101 Correct 3688 ms 3224 KB Output is correct
102 Correct 3810 ms 3056 KB Output is correct
103 Correct 2475 ms 5936 KB Output is correct
104 Correct 3139 ms 4640 KB Output is correct
105 Correct 1135 ms 4512 KB Output is correct
106 Correct 1232 ms 4652 KB Output is correct
107 Correct 1159 ms 4512 KB Output is correct
108 Correct 1363 ms 4476 KB Output is correct
109 Correct 3835 ms 3340 KB Output is correct
110 Correct 3253 ms 4852 KB Output is correct
111 Correct 226 ms 7568 KB Output is correct
112 Correct 563 ms 7056 KB Output is correct
113 Correct 279 ms 2612 KB Output is correct
114 Correct 268 ms 2740 KB Output is correct
115 Correct 283 ms 2740 KB Output is correct
116 Correct 271 ms 2772 KB Output is correct
117 Correct 3433 ms 4528 KB Output is correct
118 Correct 3753 ms 3340 KB Output is correct
119 Correct 3173 ms 2832 KB Output is correct
120 Correct 3282 ms 4644 KB Output is correct
121 Correct 2332 ms 5920 KB Output is correct
122 Correct 2282 ms 5748 KB Output is correct
123 Correct 3551 ms 4000 KB Output is correct
124 Correct 3369 ms 2832 KB Output is correct
125 Correct 691 ms 4204 KB Output is correct
126 Correct 809 ms 4128 KB Output is correct
127 Correct 830 ms 4116 KB Output is correct
128 Correct 802 ms 4164 KB Output is correct
129 Correct 703 ms 4248 KB Output is correct
130 Correct 785 ms 4160 KB Output is correct
131 Correct 3366 ms 3084 KB Output is correct
132 Correct 3076 ms 7452 KB Output is correct
133 Correct 2251 ms 10064 KB Output is correct
134 Correct 3408 ms 3780 KB Output is correct
135 Correct 2076 ms 10488 KB Output is correct
136 Correct 2673 ms 1836 KB Output is correct
137 Runtime error 158 ms 23804 KB Execution killed with signal 11 (could be triggered by violating memory limits)
138 Halted 0 ms 0 KB -