oj.uz

Submission #161258

# Submission time Handle Problem Language Result Execution time Memory
161258 2019-11-01T16:09:42 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 3810 ms 30796 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;
 
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();
}
 
ll LASTL[block];
 
ll LASTR[block];
 
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;
	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;
	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;
	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:101: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:112: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:119:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'll slowL(ll, ll, ll)':
segments.cpp:178: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:189: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:230: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:270: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:285:5: warning: unused variable 'q' [-Wunused-variable]
  ll q, w;
     ^
segments.cpp:285:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'int main()':
segments.cpp:296:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w, e, a, b, c;
        ^
segments.cpp:296:11: warning: unused variable 'e' [-Wunused-variable]
  ll q, w, e, a, b, c;
           ^
segments.cpp:296:17: warning: unused variable 'b' [-Wunused-variable]
  ll q, w, e, a, b, c;
                 ^
segments.cpp:299: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 5 ms 376 KB Output is correct
3 Correct 10 ms 632 KB Output is correct
4 Correct 10 ms 632 KB Output is correct
5 Correct 16 ms 888 KB Output is correct
6 Correct 21 ms 760 KB Output is correct
7 Correct 40 ms 632 KB Output is correct
8 Correct 79 ms 760 KB Output is correct
9 Correct 89 ms 776 KB Output is correct
10 Correct 37 ms 888 KB Output is correct
11 Correct 32 ms 760 KB Output is correct
12 Correct 29 ms 760 KB Output is correct
13 Correct 38 ms 888 KB Output is correct
14 Correct 146 ms 860 KB Output is correct
15 Correct 9 ms 632 KB Output is correct
16 Correct 13 ms 632 KB Output is correct
17 Correct 53 ms 760 KB Output is correct
18 Correct 65 ms 892 KB Output is correct
19 Correct 59 ms 672 KB Output is correct
20 Correct 63 ms 760 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1059 ms 6604 KB Output is correct
2 Correct 1085 ms 4796 KB Output is correct
3 Correct 1080 ms 4916 KB Output is correct
4 Correct 1000 ms 5044 KB Output is correct
5 Correct 233 ms 7684 KB Output is correct
6 Correct 163 ms 7700 KB Output is correct
7 Correct 1083 ms 4936 KB Output is correct
8 Correct 1187 ms 4892 KB Output is correct
9 Correct 1063 ms 5024 KB Output is correct
10 Correct 1337 ms 3104 KB Output is correct
11 Correct 1281 ms 3536 KB Output is correct
12 Correct 743 ms 6256 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 4148 KB Output is correct
2 Correct 230 ms 3768 KB Output is correct
3 Correct 326 ms 3636 KB Output is correct
4 Correct 232 ms 3888 KB Output is correct
5 Correct 515 ms 7208 KB Output is correct
6 Correct 660 ms 5436 KB Output is correct
7 Correct 600 ms 5852 KB Output is correct
8 Correct 180 ms 7560 KB Output is correct
9 Correct 743 ms 7500 KB Output is correct
10 Correct 2258 ms 6560 KB Output is correct
11 Correct 1853 ms 3380 KB Output is correct
12 Correct 2231 ms 6196 KB Output is correct
13 Correct 2838 ms 6376 KB Output is correct
14 Correct 3519 ms 4264 KB Output is correct
15 Correct 3643 ms 3956 KB Output is correct
16 Correct 3382 ms 3500 KB Output is correct
17 Correct 799 ms 4976 KB Output is correct
18 Correct 808 ms 5004 KB Output is correct
19 Correct 796 ms 5020 KB Output is correct
20 Correct 793 ms 5080 KB Output is correct
21 Correct 2272 ms 3364 KB Output is correct
22 Correct 3810 ms 4600 KB Output is correct
23 Correct 3177 ms 6044 KB Output is correct
24 Correct 3481 ms 4764 KB Output is correct
25 Correct 269 ms 3252 KB Output is correct
26 Correct 249 ms 3212 KB Output is correct
27 Correct 271 ms 3124 KB Output is correct
28 Correct 256 ms 3252 KB Output is correct
29 Correct 2825 ms 6328 KB Output is correct
30 Correct 2910 ms 6196 KB Output is correct
31 Correct 707 ms 7828 KB Output is correct
32 Correct 2518 ms 6636 KB Output is correct
33 Correct 2704 ms 6508 KB Output is correct
34 Correct 3537 ms 4052 KB Output is correct
35 Correct 3102 ms 5288 KB Output is correct
36 Correct 2740 ms 6440 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 291 ms 4276 KB Output is correct
2 Correct 234 ms 3632 KB Output is correct
3 Correct 245 ms 3720 KB Output is correct
4 Correct 258 ms 3660 KB Output is correct
5 Correct 612 ms 7724 KB Output is correct
6 Correct 1347 ms 2508 KB Output is correct
7 Correct 483 ms 6876 KB Output is correct
8 Correct 1423 ms 3148 KB Output is correct
9 Correct 3748 ms 4768 KB Output is correct
10 Correct 3212 ms 6820 KB Output is correct
11 Correct 3417 ms 3524 KB Output is correct
12 Correct 417 ms 8332 KB Output is correct
13 Correct 2845 ms 6660 KB Output is correct
14 Correct 3693 ms 4744 KB Output is correct
15 Correct 850 ms 7864 KB Output is correct
16 Correct 2584 ms 6884 KB Output is correct
17 Correct 1067 ms 5372 KB Output is correct
18 Correct 1058 ms 5236 KB Output is correct
19 Correct 1073 ms 5336 KB Output is correct
20 Correct 1102 ms 5356 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 5 ms 376 KB Output is correct
3 Correct 10 ms 632 KB Output is correct
4 Correct 10 ms 632 KB Output is correct
5 Correct 16 ms 888 KB Output is correct
6 Correct 21 ms 760 KB Output is correct
7 Correct 40 ms 632 KB Output is correct
8 Correct 79 ms 760 KB Output is correct
9 Correct 89 ms 776 KB Output is correct
10 Correct 37 ms 888 KB Output is correct
11 Correct 32 ms 760 KB Output is correct
12 Correct 29 ms 760 KB Output is correct
13 Correct 38 ms 888 KB Output is correct
14 Correct 146 ms 860 KB Output is correct
15 Correct 9 ms 632 KB Output is correct
16 Correct 13 ms 632 KB Output is correct
17 Correct 53 ms 760 KB Output is correct
18 Correct 65 ms 892 KB Output is correct
19 Correct 59 ms 672 KB Output is correct
20 Correct 63 ms 760 KB Output is correct
21 Correct 1059 ms 6604 KB Output is correct
22 Correct 1085 ms 4796 KB Output is correct
23 Correct 1080 ms 4916 KB Output is correct
24 Correct 1000 ms 5044 KB Output is correct
25 Correct 233 ms 7684 KB Output is correct
26 Correct 163 ms 7700 KB Output is correct
27 Correct 1083 ms 4936 KB Output is correct
28 Correct 1187 ms 4892 KB Output is correct
29 Correct 1063 ms 5024 KB Output is correct
30 Correct 1337 ms 3104 KB Output is correct
31 Correct 1281 ms 3536 KB Output is correct
32 Correct 743 ms 6256 KB Output is correct
33 Correct 291 ms 4276 KB Output is correct
34 Correct 234 ms 3632 KB Output is correct
35 Correct 245 ms 3720 KB Output is correct
36 Correct 258 ms 3660 KB Output is correct
37 Correct 612 ms 7724 KB Output is correct
38 Correct 1347 ms 2508 KB Output is correct
39 Correct 483 ms 6876 KB Output is correct
40 Correct 1423 ms 3148 KB Output is correct
41 Correct 3748 ms 4768 KB Output is correct
42 Correct 3212 ms 6820 KB Output is correct
43 Correct 3417 ms 3524 KB Output is correct
44 Correct 417 ms 8332 KB Output is correct
45 Correct 2845 ms 6660 KB Output is correct
46 Correct 3693 ms 4744 KB Output is correct
47 Correct 850 ms 7864 KB Output is correct
48 Correct 2584 ms 6884 KB Output is correct
49 Correct 1067 ms 5372 KB Output is correct
50 Correct 1058 ms 5236 KB Output is correct
51 Correct 1073 ms 5336 KB Output is correct
52 Correct 1102 ms 5356 KB Output is correct
53 Correct 263 ms 3480 KB Output is correct
54 Correct 256 ms 3508 KB Output is correct
55 Correct 235 ms 3548 KB Output is correct
56 Correct 240 ms 3508 KB Output is correct
57 Correct 1269 ms 4232 KB Output is correct
58 Correct 1431 ms 2900 KB Output is correct
59 Correct 1101 ms 5968 KB Output is correct
60 Correct 1266 ms 2756 KB Output is correct
61 Correct 3051 ms 6456 KB Output is correct
62 Correct 1123 ms 7608 KB Output is correct
63 Correct 627 ms 7820 KB Output is correct
64 Correct 1027 ms 7908 KB Output is correct
65 Correct 3635 ms 3788 KB Output is correct
66 Correct 3468 ms 3708 KB Output is correct
67 Correct 2471 ms 6736 KB Output is correct
68 Correct 3243 ms 5448 KB Output is correct
69 Correct 1075 ms 5668 KB Output is correct
70 Correct 1061 ms 5216 KB Output is correct
71 Correct 1356 ms 5252 KB Output is correct
72 Correct 1070 ms 5092 KB Output is correct
73 Correct 3754 ms 4008 KB Output is correct
74 Correct 3318 ms 5432 KB Output is correct
75 Correct 230 ms 8324 KB Output is correct
76 Correct 575 ms 8064 KB Output is correct
77 Correct 255 ms 3316 KB Output is correct
78 Correct 231 ms 3392 KB Output is correct
79 Correct 262 ms 3432 KB Output is correct
80 Correct 246 ms 3316 KB Output is correct
81 Correct 3484 ms 5372 KB Output is correct
82 Correct 3809 ms 4036 KB Output is correct
83 Correct 3291 ms 3432 KB Output is correct
84 Correct 3391 ms 5380 KB Output is correct
85 Correct 2488 ms 6664 KB Output is correct
86 Correct 2473 ms 6492 KB Output is correct
87 Correct 3623 ms 4748 KB Output is correct
88 Correct 3345 ms 3492 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 5 ms 376 KB Output is correct
3 Correct 10 ms 632 KB Output is correct
4 Correct 10 ms 632 KB Output is correct
5 Correct 16 ms 888 KB Output is correct
6 Correct 21 ms 760 KB Output is correct
7 Correct 40 ms 632 KB Output is correct
8 Correct 79 ms 760 KB Output is correct
9 Correct 89 ms 776 KB Output is correct
10 Correct 37 ms 888 KB Output is correct
11 Correct 32 ms 760 KB Output is correct
12 Correct 29 ms 760 KB Output is correct
13 Correct 38 ms 888 KB Output is correct
14 Correct 146 ms 860 KB Output is correct
15 Correct 9 ms 632 KB Output is correct
16 Correct 13 ms 632 KB Output is correct
17 Correct 53 ms 760 KB Output is correct
18 Correct 65 ms 892 KB Output is correct
19 Correct 59 ms 672 KB Output is correct
20 Correct 63 ms 760 KB Output is correct
21 Correct 1059 ms 6604 KB Output is correct
22 Correct 1085 ms 4796 KB Output is correct
23 Correct 1080 ms 4916 KB Output is correct
24 Correct 1000 ms 5044 KB Output is correct
25 Correct 233 ms 7684 KB Output is correct
26 Correct 163 ms 7700 KB Output is correct
27 Correct 1083 ms 4936 KB Output is correct
28 Correct 1187 ms 4892 KB Output is correct
29 Correct 1063 ms 5024 KB Output is correct
30 Correct 1337 ms 3104 KB Output is correct
31 Correct 1281 ms 3536 KB Output is correct
32 Correct 743 ms 6256 KB Output is correct
33 Correct 256 ms 4148 KB Output is correct
34 Correct 230 ms 3768 KB Output is correct
35 Correct 326 ms 3636 KB Output is correct
36 Correct 232 ms 3888 KB Output is correct
37 Correct 515 ms 7208 KB Output is correct
38 Correct 660 ms 5436 KB Output is correct
39 Correct 600 ms 5852 KB Output is correct
40 Correct 180 ms 7560 KB Output is correct
41 Correct 743 ms 7500 KB Output is correct
42 Correct 2258 ms 6560 KB Output is correct
43 Correct 1853 ms 3380 KB Output is correct
44 Correct 2231 ms 6196 KB Output is correct
45 Correct 2838 ms 6376 KB Output is correct
46 Correct 3519 ms 4264 KB Output is correct
47 Correct 3643 ms 3956 KB Output is correct
48 Correct 3382 ms 3500 KB Output is correct
49 Correct 799 ms 4976 KB Output is correct
50 Correct 808 ms 5004 KB Output is correct
51 Correct 796 ms 5020 KB Output is correct
52 Correct 793 ms 5080 KB Output is correct
53 Correct 2272 ms 3364 KB Output is correct
54 Correct 3810 ms 4600 KB Output is correct
55 Correct 3177 ms 6044 KB Output is correct
56 Correct 3481 ms 4764 KB Output is correct
57 Correct 269 ms 3252 KB Output is correct
58 Correct 249 ms 3212 KB Output is correct
59 Correct 271 ms 3124 KB Output is correct
60 Correct 256 ms 3252 KB Output is correct
61 Correct 2825 ms 6328 KB Output is correct
62 Correct 2910 ms 6196 KB Output is correct
63 Correct 707 ms 7828 KB Output is correct
64 Correct 2518 ms 6636 KB Output is correct
65 Correct 2704 ms 6508 KB Output is correct
66 Correct 3537 ms 4052 KB Output is correct
67 Correct 3102 ms 5288 KB Output is correct
68 Correct 2740 ms 6440 KB Output is correct
69 Correct 291 ms 4276 KB Output is correct
70 Correct 234 ms 3632 KB Output is correct
71 Correct 245 ms 3720 KB Output is correct
72 Correct 258 ms 3660 KB Output is correct
73 Correct 612 ms 7724 KB Output is correct
74 Correct 1347 ms 2508 KB Output is correct
75 Correct 483 ms 6876 KB Output is correct
76 Correct 1423 ms 3148 KB Output is correct
77 Correct 3748 ms 4768 KB Output is correct
78 Correct 3212 ms 6820 KB Output is correct
79 Correct 3417 ms 3524 KB Output is correct
80 Correct 417 ms 8332 KB Output is correct
81 Correct 2845 ms 6660 KB Output is correct
82 Correct 3693 ms 4744 KB Output is correct
83 Correct 850 ms 7864 KB Output is correct
84 Correct 2584 ms 6884 KB Output is correct
85 Correct 1067 ms 5372 KB Output is correct
86 Correct 1058 ms 5236 KB Output is correct
87 Correct 1073 ms 5336 KB Output is correct
88 Correct 1102 ms 5356 KB Output is correct
89 Correct 263 ms 3480 KB Output is correct
90 Correct 256 ms 3508 KB Output is correct
91 Correct 235 ms 3548 KB Output is correct
92 Correct 240 ms 3508 KB Output is correct
93 Correct 1269 ms 4232 KB Output is correct
94 Correct 1431 ms 2900 KB Output is correct
95 Correct 1101 ms 5968 KB Output is correct
96 Correct 1266 ms 2756 KB Output is correct
97 Correct 3051 ms 6456 KB Output is correct
98 Correct 1123 ms 7608 KB Output is correct
99 Correct 627 ms 7820 KB Output is correct
100 Correct 1027 ms 7908 KB Output is correct
101 Correct 3635 ms 3788 KB Output is correct
102 Correct 3468 ms 3708 KB Output is correct
103 Correct 2471 ms 6736 KB Output is correct
104 Correct 3243 ms 5448 KB Output is correct
105 Correct 1075 ms 5668 KB Output is correct
106 Correct 1061 ms 5216 KB Output is correct
107 Correct 1356 ms 5252 KB Output is correct
108 Correct 1070 ms 5092 KB Output is correct
109 Correct 3754 ms 4008 KB Output is correct
110 Correct 3318 ms 5432 KB Output is correct
111 Correct 230 ms 8324 KB Output is correct
112 Correct 575 ms 8064 KB Output is correct
113 Correct 255 ms 3316 KB Output is correct
114 Correct 231 ms 3392 KB Output is correct
115 Correct 262 ms 3432 KB Output is correct
116 Correct 246 ms 3316 KB Output is correct
117 Correct 3484 ms 5372 KB Output is correct
118 Correct 3809 ms 4036 KB Output is correct
119 Correct 3291 ms 3432 KB Output is correct
120 Correct 3391 ms 5380 KB Output is correct
121 Correct 2488 ms 6664 KB Output is correct
122 Correct 2473 ms 6492 KB Output is correct
123 Correct 3623 ms 4748 KB Output is correct
124 Correct 3345 ms 3492 KB Output is correct
125 Correct 727 ms 5664 KB Output is correct
126 Correct 675 ms 5540 KB Output is correct
127 Correct 790 ms 5544 KB Output is correct
128 Correct 693 ms 5548 KB Output is correct
129 Correct 743 ms 5580 KB Output is correct
130 Correct 708 ms 5600 KB Output is correct
131 Correct 3010 ms 4440 KB Output is correct
132 Correct 2823 ms 8116 KB Output is correct
133 Correct 2150 ms 10760 KB Output is correct
134 Correct 3062 ms 9568 KB Output is correct
135 Correct 1950 ms 15448 KB Output is correct
136 Correct 2176 ms 7848 KB Output is correct
137 Runtime error 1231 ms 30796 KB Execution killed with signal 11 (could be triggered by violating memory limits)
138 Halted 0 ms 0 KB -