oj.uz

Submission #161273

# Submission time Handle Problem Language Result Execution time Memory
161273 2019-11-01T16:34:53 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 4179 ms 49028 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 long long 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 704 KB Output is correct
5 Correct 17 ms 1208 KB Output is correct
6 Correct 21 ms 1016 KB Output is correct
7 Correct 43 ms 760 KB Output is correct
8 Correct 87 ms 988 KB Output is correct
9 Correct 104 ms 1016 KB Output is correct
10 Correct 40 ms 1208 KB Output is correct
11 Correct 33 ms 1016 KB Output is correct
12 Correct 31 ms 888 KB Output is correct
13 Correct 42 ms 1144 KB Output is correct
14 Correct 107 ms 888 KB Output is correct
15 Correct 10 ms 632 KB Output is correct
16 Correct 14 ms 624 KB Output is correct
17 Correct 57 ms 892 KB Output is correct
18 Correct 71 ms 1272 KB Output is correct
19 Correct 64 ms 888 KB Output is correct
20 Correct 65 ms 888 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1166 ms 7808 KB Output is correct
2 Correct 1166 ms 8920 KB Output is correct
3 Correct 1151 ms 8960 KB Output is correct
4 Correct 1061 ms 9616 KB Output is correct
5 Correct 254 ms 14208 KB Output is correct
6 Correct 182 ms 14592 KB Output is correct
7 Correct 1156 ms 8880 KB Output is correct
8 Correct 1140 ms 9024 KB Output is correct
9 Correct 1136 ms 8828 KB Output is correct
10 Correct 1430 ms 5128 KB Output is correct
11 Correct 1491 ms 6040 KB Output is correct
12 Correct 812 ms 11484 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 304 ms 3668 KB Output is correct
2 Correct 248 ms 4512 KB Output is correct
3 Correct 351 ms 4736 KB Output is correct
4 Correct 248 ms 4728 KB Output is correct
5 Correct 545 ms 11324 KB Output is correct
6 Correct 705 ms 10100 KB Output is correct
7 Correct 645 ms 10596 KB Output is correct
8 Correct 201 ms 14436 KB Output is correct
9 Correct 837 ms 14116 KB Output is correct
10 Correct 2529 ms 11680 KB Output is correct
11 Correct 2013 ms 5136 KB Output is correct
12 Correct 2472 ms 11356 KB Output is correct
13 Correct 3118 ms 11368 KB Output is correct
14 Correct 4050 ms 7112 KB Output is correct
15 Correct 4067 ms 6588 KB Output is correct
16 Correct 3794 ms 5656 KB Output is correct
17 Correct 868 ms 8724 KB Output is correct
18 Correct 854 ms 8772 KB Output is correct
19 Correct 858 ms 8696 KB Output is correct
20 Correct 850 ms 8720 KB Output is correct
21 Correct 2499 ms 4700 KB Output is correct
22 Correct 3933 ms 7916 KB Output is correct
23 Correct 3542 ms 10972 KB Output is correct
24 Correct 3843 ms 8044 KB Output is correct
25 Correct 296 ms 4724 KB Output is correct
26 Correct 261 ms 4464 KB Output is correct
27 Correct 292 ms 4472 KB Output is correct
28 Correct 270 ms 4540 KB Output is correct
29 Correct 3335 ms 10768 KB Output is correct
30 Correct 3310 ms 11020 KB Output is correct
31 Correct 813 ms 14076 KB Output is correct
32 Correct 2566 ms 11408 KB Output is correct
33 Correct 2851 ms 11424 KB Output is correct
34 Correct 3983 ms 6300 KB Output is correct
35 Correct 3420 ms 8932 KB Output is correct
36 Correct 2654 ms 11280 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 265 ms 4464 KB Output is correct
2 Correct 257 ms 4484 KB Output is correct
3 Correct 274 ms 4556 KB Output is correct
4 Correct 282 ms 4436 KB Output is correct
5 Correct 750 ms 12176 KB Output is correct
6 Correct 1399 ms 4028 KB Output is correct
7 Correct 523 ms 12896 KB Output is correct
8 Correct 1492 ms 4836 KB Output is correct
9 Correct 4178 ms 7736 KB Output is correct
10 Correct 2252 ms 11720 KB Output is correct
11 Correct 3686 ms 5864 KB Output is correct
12 Correct 460 ms 15124 KB Output is correct
13 Correct 3061 ms 11812 KB Output is correct
14 Correct 4045 ms 7832 KB Output is correct
15 Correct 936 ms 14464 KB Output is correct
16 Correct 2821 ms 11944 KB Output is correct
17 Correct 1125 ms 9368 KB Output is correct
18 Correct 1186 ms 8860 KB Output is correct
19 Correct 1136 ms 8540 KB Output is correct
20 Correct 1144 ms 8480 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 704 KB Output is correct
5 Correct 17 ms 1208 KB Output is correct
6 Correct 21 ms 1016 KB Output is correct
7 Correct 43 ms 760 KB Output is correct
8 Correct 87 ms 988 KB Output is correct
9 Correct 104 ms 1016 KB Output is correct
10 Correct 40 ms 1208 KB Output is correct
11 Correct 33 ms 1016 KB Output is correct
12 Correct 31 ms 888 KB Output is correct
13 Correct 42 ms 1144 KB Output is correct
14 Correct 107 ms 888 KB Output is correct
15 Correct 10 ms 632 KB Output is correct
16 Correct 14 ms 624 KB Output is correct
17 Correct 57 ms 892 KB Output is correct
18 Correct 71 ms 1272 KB Output is correct
19 Correct 64 ms 888 KB Output is correct
20 Correct 65 ms 888 KB Output is correct
21 Correct 1166 ms 7808 KB Output is correct
22 Correct 1166 ms 8920 KB Output is correct
23 Correct 1151 ms 8960 KB Output is correct
24 Correct 1061 ms 9616 KB Output is correct
25 Correct 254 ms 14208 KB Output is correct
26 Correct 182 ms 14592 KB Output is correct
27 Correct 1156 ms 8880 KB Output is correct
28 Correct 1140 ms 9024 KB Output is correct
29 Correct 1136 ms 8828 KB Output is correct
30 Correct 1430 ms 5128 KB Output is correct
31 Correct 1491 ms 6040 KB Output is correct
32 Correct 812 ms 11484 KB Output is correct
33 Correct 265 ms 4464 KB Output is correct
34 Correct 257 ms 4484 KB Output is correct
35 Correct 274 ms 4556 KB Output is correct
36 Correct 282 ms 4436 KB Output is correct
37 Correct 750 ms 12176 KB Output is correct
38 Correct 1399 ms 4028 KB Output is correct
39 Correct 523 ms 12896 KB Output is correct
40 Correct 1492 ms 4836 KB Output is correct
41 Correct 4178 ms 7736 KB Output is correct
42 Correct 2252 ms 11720 KB Output is correct
43 Correct 3686 ms 5864 KB Output is correct
44 Correct 460 ms 15124 KB Output is correct
45 Correct 3061 ms 11812 KB Output is correct
46 Correct 4045 ms 7832 KB Output is correct
47 Correct 936 ms 14464 KB Output is correct
48 Correct 2821 ms 11944 KB Output is correct
49 Correct 1125 ms 9368 KB Output is correct
50 Correct 1186 ms 8860 KB Output is correct
51 Correct 1136 ms 8540 KB Output is correct
52 Correct 1144 ms 8480 KB Output is correct
53 Correct 281 ms 4724 KB Output is correct
54 Correct 276 ms 4468 KB Output is correct
55 Correct 251 ms 4572 KB Output is correct
56 Correct 259 ms 4580 KB Output is correct
57 Correct 1348 ms 6592 KB Output is correct
58 Correct 1420 ms 3508 KB Output is correct
59 Correct 957 ms 10016 KB Output is correct
60 Correct 1329 ms 2864 KB Output is correct
61 Correct 3251 ms 11188 KB Output is correct
62 Correct 1353 ms 13320 KB Output is correct
63 Correct 705 ms 14088 KB Output is correct
64 Correct 1138 ms 13412 KB Output is correct
65 Correct 3943 ms 5884 KB Output is correct
66 Correct 3869 ms 5420 KB Output is correct
67 Correct 2766 ms 11560 KB Output is correct
68 Correct 3594 ms 8932 KB Output is correct
69 Correct 1145 ms 8312 KB Output is correct
70 Correct 1279 ms 8280 KB Output is correct
71 Correct 1135 ms 8356 KB Output is correct
72 Correct 1196 ms 8364 KB Output is correct
73 Correct 4179 ms 6140 KB Output is correct
74 Correct 3969 ms 8800 KB Output is correct
75 Correct 271 ms 14460 KB Output is correct
76 Correct 650 ms 13952 KB Output is correct
77 Correct 269 ms 4484 KB Output is correct
78 Correct 257 ms 4512 KB Output is correct
79 Correct 276 ms 4460 KB Output is correct
80 Correct 369 ms 4320 KB Output is correct
81 Correct 3746 ms 8556 KB Output is correct
82 Correct 4078 ms 6160 KB Output is correct
83 Correct 3556 ms 5068 KB Output is correct
84 Correct 3657 ms 8700 KB Output is correct
85 Correct 2716 ms 11564 KB Output is correct
86 Correct 2543 ms 11136 KB Output is correct
87 Correct 4037 ms 7496 KB Output is correct
88 Correct 3774 ms 5064 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 704 KB Output is correct
5 Correct 17 ms 1208 KB Output is correct
6 Correct 21 ms 1016 KB Output is correct
7 Correct 43 ms 760 KB Output is correct
8 Correct 87 ms 988 KB Output is correct
9 Correct 104 ms 1016 KB Output is correct
10 Correct 40 ms 1208 KB Output is correct
11 Correct 33 ms 1016 KB Output is correct
12 Correct 31 ms 888 KB Output is correct
13 Correct 42 ms 1144 KB Output is correct
14 Correct 107 ms 888 KB Output is correct
15 Correct 10 ms 632 KB Output is correct
16 Correct 14 ms 624 KB Output is correct
17 Correct 57 ms 892 KB Output is correct
18 Correct 71 ms 1272 KB Output is correct
19 Correct 64 ms 888 KB Output is correct
20 Correct 65 ms 888 KB Output is correct
21 Correct 1166 ms 7808 KB Output is correct
22 Correct 1166 ms 8920 KB Output is correct
23 Correct 1151 ms 8960 KB Output is correct
24 Correct 1061 ms 9616 KB Output is correct
25 Correct 254 ms 14208 KB Output is correct
26 Correct 182 ms 14592 KB Output is correct
27 Correct 1156 ms 8880 KB Output is correct
28 Correct 1140 ms 9024 KB Output is correct
29 Correct 1136 ms 8828 KB Output is correct
30 Correct 1430 ms 5128 KB Output is correct
31 Correct 1491 ms 6040 KB Output is correct
32 Correct 812 ms 11484 KB Output is correct
33 Correct 304 ms 3668 KB Output is correct
34 Correct 248 ms 4512 KB Output is correct
35 Correct 351 ms 4736 KB Output is correct
36 Correct 248 ms 4728 KB Output is correct
37 Correct 545 ms 11324 KB Output is correct
38 Correct 705 ms 10100 KB Output is correct
39 Correct 645 ms 10596 KB Output is correct
40 Correct 201 ms 14436 KB Output is correct
41 Correct 837 ms 14116 KB Output is correct
42 Correct 2529 ms 11680 KB Output is correct
43 Correct 2013 ms 5136 KB Output is correct
44 Correct 2472 ms 11356 KB Output is correct
45 Correct 3118 ms 11368 KB Output is correct
46 Correct 4050 ms 7112 KB Output is correct
47 Correct 4067 ms 6588 KB Output is correct
48 Correct 3794 ms 5656 KB Output is correct
49 Correct 868 ms 8724 KB Output is correct
50 Correct 854 ms 8772 KB Output is correct
51 Correct 858 ms 8696 KB Output is correct
52 Correct 850 ms 8720 KB Output is correct
53 Correct 2499 ms 4700 KB Output is correct
54 Correct 3933 ms 7916 KB Output is correct
55 Correct 3542 ms 10972 KB Output is correct
56 Correct 3843 ms 8044 KB Output is correct
57 Correct 296 ms 4724 KB Output is correct
58 Correct 261 ms 4464 KB Output is correct
59 Correct 292 ms 4472 KB Output is correct
60 Correct 270 ms 4540 KB Output is correct
61 Correct 3335 ms 10768 KB Output is correct
62 Correct 3310 ms 11020 KB Output is correct
63 Correct 813 ms 14076 KB Output is correct
64 Correct 2566 ms 11408 KB Output is correct
65 Correct 2851 ms 11424 KB Output is correct
66 Correct 3983 ms 6300 KB Output is correct
67 Correct 3420 ms 8932 KB Output is correct
68 Correct 2654 ms 11280 KB Output is correct
69 Correct 265 ms 4464 KB Output is correct
70 Correct 257 ms 4484 KB Output is correct
71 Correct 274 ms 4556 KB Output is correct
72 Correct 282 ms 4436 KB Output is correct
73 Correct 750 ms 12176 KB Output is correct
74 Correct 1399 ms 4028 KB Output is correct
75 Correct 523 ms 12896 KB Output is correct
76 Correct 1492 ms 4836 KB Output is correct
77 Correct 4178 ms 7736 KB Output is correct
78 Correct 2252 ms 11720 KB Output is correct
79 Correct 3686 ms 5864 KB Output is correct
80 Correct 460 ms 15124 KB Output is correct
81 Correct 3061 ms 11812 KB Output is correct
82 Correct 4045 ms 7832 KB Output is correct
83 Correct 936 ms 14464 KB Output is correct
84 Correct 2821 ms 11944 KB Output is correct
85 Correct 1125 ms 9368 KB Output is correct
86 Correct 1186 ms 8860 KB Output is correct
87 Correct 1136 ms 8540 KB Output is correct
88 Correct 1144 ms 8480 KB Output is correct
89 Correct 281 ms 4724 KB Output is correct
90 Correct 276 ms 4468 KB Output is correct
91 Correct 251 ms 4572 KB Output is correct
92 Correct 259 ms 4580 KB Output is correct
93 Correct 1348 ms 6592 KB Output is correct
94 Correct 1420 ms 3508 KB Output is correct
95 Correct 957 ms 10016 KB Output is correct
96 Correct 1329 ms 2864 KB Output is correct
97 Correct 3251 ms 11188 KB Output is correct
98 Correct 1353 ms 13320 KB Output is correct
99 Correct 705 ms 14088 KB Output is correct
100 Correct 1138 ms 13412 KB Output is correct
101 Correct 3943 ms 5884 KB Output is correct
102 Correct 3869 ms 5420 KB Output is correct
103 Correct 2766 ms 11560 KB Output is correct
104 Correct 3594 ms 8932 KB Output is correct
105 Correct 1145 ms 8312 KB Output is correct
106 Correct 1279 ms 8280 KB Output is correct
107 Correct 1135 ms 8356 KB Output is correct
108 Correct 1196 ms 8364 KB Output is correct
109 Correct 4179 ms 6140 KB Output is correct
110 Correct 3969 ms 8800 KB Output is correct
111 Correct 271 ms 14460 KB Output is correct
112 Correct 650 ms 13952 KB Output is correct
113 Correct 269 ms 4484 KB Output is correct
114 Correct 257 ms 4512 KB Output is correct
115 Correct 276 ms 4460 KB Output is correct
116 Correct 369 ms 4320 KB Output is correct
117 Correct 3746 ms 8556 KB Output is correct
118 Correct 4078 ms 6160 KB Output is correct
119 Correct 3556 ms 5068 KB Output is correct
120 Correct 3657 ms 8700 KB Output is correct
121 Correct 2716 ms 11564 KB Output is correct
122 Correct 2543 ms 11136 KB Output is correct
123 Correct 4037 ms 7496 KB Output is correct
124 Correct 3774 ms 5064 KB Output is correct
125 Correct 707 ms 7632 KB Output is correct
126 Correct 732 ms 7548 KB Output is correct
127 Correct 807 ms 7584 KB Output is correct
128 Correct 717 ms 7512 KB Output is correct
129 Correct 663 ms 7364 KB Output is correct
130 Correct 757 ms 7560 KB Output is correct
131 Correct 3168 ms 5124 KB Output is correct
132 Correct 3048 ms 13940 KB Output is correct
133 Correct 2325 ms 19932 KB Output is correct
134 Correct 3298 ms 8736 KB Output is correct
135 Correct 2358 ms 22548 KB Output is correct
136 Correct 2320 ms 4652 KB Output is correct
137 Runtime error 200 ms 49028 KB Execution killed with signal 11 (could be triggered by violating memory limits)
138 Halted 0 ms 0 KB -