oj.uz

Submission #161294

# Submission time Handle Problem Language Result Execution time Memory
161294 2019-11-01T18:22:45 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 3752 ms 24832 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 = 2e5 + 100;
const ll block = 150;
const ll block_sz = (3e5 + 100 + 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 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 624 KB Output is correct
8 Correct 75 ms 760 KB Output is correct
9 Correct 84 ms 632 KB Output is correct
10 Correct 35 ms 888 KB Output is correct
11 Correct 35 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 93 ms 632 KB Output is correct
15 Correct 10 ms 504 KB Output is correct
16 Correct 14 ms 504 KB Output is correct
17 Correct 51 ms 760 KB Output is correct
18 Correct 61 ms 888 KB Output is correct
19 Correct 57 ms 760 KB Output is correct
20 Correct 58 ms 800 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1133 ms 5100 KB Output is correct
2 Correct 1142 ms 5020 KB Output is correct
3 Correct 1144 ms 4896 KB Output is correct
4 Correct 1071 ms 5304 KB Output is correct
5 Correct 239 ms 7700 KB Output is correct
6 Correct 184 ms 7704 KB Output is correct
7 Correct 1146 ms 4872 KB Output is correct
8 Correct 1161 ms 5136 KB Output is correct
9 Correct 1203 ms 4896 KB Output is correct
10 Correct 1472 ms 2988 KB Output is correct
11 Correct 1452 ms 3448 KB Output is correct
12 Correct 782 ms 5972 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 283 ms 3124 KB Output is correct
2 Correct 256 ms 3360 KB Output is correct
3 Correct 365 ms 3512 KB Output is correct
4 Correct 263 ms 3380 KB Output is correct
5 Correct 582 ms 6580 KB Output is correct
6 Correct 735 ms 6028 KB Output is correct
7 Correct 658 ms 6292 KB Output is correct
8 Correct 191 ms 7952 KB Output is correct
9 Correct 734 ms 7972 KB Output is correct
10 Correct 2255 ms 6680 KB Output is correct
11 Correct 1983 ms 3636 KB Output is correct
12 Correct 2148 ms 6796 KB Output is correct
13 Correct 2601 ms 6736 KB Output is correct
14 Correct 3497 ms 4644 KB Output is correct
15 Correct 3557 ms 4324 KB Output is correct
16 Correct 3485 ms 4036 KB Output is correct
17 Correct 889 ms 5328 KB Output is correct
18 Correct 890 ms 5524 KB Output is correct
19 Correct 915 ms 5420 KB Output is correct
20 Correct 889 ms 5280 KB Output is correct
21 Correct 2247 ms 3328 KB Output is correct
22 Correct 3594 ms 4516 KB Output is correct
23 Correct 3074 ms 6064 KB Output is correct
24 Correct 3390 ms 4780 KB Output is correct
25 Correct 299 ms 2996 KB Output is correct
26 Correct 271 ms 3124 KB Output is correct
27 Correct 294 ms 3136 KB Output is correct
28 Correct 289 ms 2996 KB Output is correct
29 Correct 2826 ms 6072 KB Output is correct
30 Correct 2794 ms 6228 KB Output is correct
31 Correct 673 ms 7444 KB Output is correct
32 Correct 2313 ms 6220 KB Output is correct
33 Correct 2434 ms 6332 KB Output is correct
34 Correct 3446 ms 3868 KB Output is correct
35 Correct 2973 ms 5108 KB Output is correct
36 Correct 2412 ms 6180 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 258 ms 2704 KB Output is correct
2 Correct 273 ms 3128 KB Output is correct
3 Correct 272 ms 3132 KB Output is correct
4 Correct 292 ms 3000 KB Output is correct
5 Correct 649 ms 6420 KB Output is correct
6 Correct 1502 ms 2680 KB Output is correct
7 Correct 509 ms 6940 KB Output is correct
8 Correct 1488 ms 3244 KB Output is correct
9 Correct 3639 ms 4548 KB Output is correct
10 Correct 2015 ms 6388 KB Output is correct
11 Correct 3321 ms 3128 KB Output is correct
12 Correct 398 ms 7704 KB Output is correct
13 Correct 2682 ms 6132 KB Output is correct
14 Correct 3681 ms 4712 KB Output is correct
15 Correct 847 ms 7868 KB Output is correct
16 Correct 2492 ms 6548 KB Output is correct
17 Correct 1148 ms 5292 KB Output is correct
18 Correct 1177 ms 5632 KB Output is correct
19 Correct 1165 ms 5652 KB Output is correct
20 Correct 1136 ms 5644 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 624 KB Output is correct
8 Correct 75 ms 760 KB Output is correct
9 Correct 84 ms 632 KB Output is correct
10 Correct 35 ms 888 KB Output is correct
11 Correct 35 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 93 ms 632 KB Output is correct
15 Correct 10 ms 504 KB Output is correct
16 Correct 14 ms 504 KB Output is correct
17 Correct 51 ms 760 KB Output is correct
18 Correct 61 ms 888 KB Output is correct
19 Correct 57 ms 760 KB Output is correct
20 Correct 58 ms 800 KB Output is correct
21 Correct 1133 ms 5100 KB Output is correct
22 Correct 1142 ms 5020 KB Output is correct
23 Correct 1144 ms 4896 KB Output is correct
24 Correct 1071 ms 5304 KB Output is correct
25 Correct 239 ms 7700 KB Output is correct
26 Correct 184 ms 7704 KB Output is correct
27 Correct 1146 ms 4872 KB Output is correct
28 Correct 1161 ms 5136 KB Output is correct
29 Correct 1203 ms 4896 KB Output is correct
30 Correct 1472 ms 2988 KB Output is correct
31 Correct 1452 ms 3448 KB Output is correct
32 Correct 782 ms 5972 KB Output is correct
33 Correct 258 ms 2704 KB Output is correct
34 Correct 273 ms 3128 KB Output is correct
35 Correct 272 ms 3132 KB Output is correct
36 Correct 292 ms 3000 KB Output is correct
37 Correct 649 ms 6420 KB Output is correct
38 Correct 1502 ms 2680 KB Output is correct
39 Correct 509 ms 6940 KB Output is correct
40 Correct 1488 ms 3244 KB Output is correct
41 Correct 3639 ms 4548 KB Output is correct
42 Correct 2015 ms 6388 KB Output is correct
43 Correct 3321 ms 3128 KB Output is correct
44 Correct 398 ms 7704 KB Output is correct
45 Correct 2682 ms 6132 KB Output is correct
46 Correct 3681 ms 4712 KB Output is correct
47 Correct 847 ms 7868 KB Output is correct
48 Correct 2492 ms 6548 KB Output is correct
49 Correct 1148 ms 5292 KB Output is correct
50 Correct 1177 ms 5632 KB Output is correct
51 Correct 1165 ms 5652 KB Output is correct
52 Correct 1136 ms 5644 KB Output is correct
53 Correct 281 ms 3896 KB Output is correct
54 Correct 318 ms 3892 KB Output is correct
55 Correct 257 ms 3892 KB Output is correct
56 Correct 266 ms 3884 KB Output is correct
57 Correct 1386 ms 4664 KB Output is correct
58 Correct 1623 ms 3252 KB Output is correct
59 Correct 967 ms 6432 KB Output is correct
60 Correct 1448 ms 3576 KB Output is correct
61 Correct 2735 ms 6572 KB Output is correct
62 Correct 1042 ms 7400 KB Output is correct
63 Correct 608 ms 7968 KB Output is correct
64 Correct 993 ms 7572 KB Output is correct
65 Correct 3522 ms 3624 KB Output is correct
66 Correct 3577 ms 3568 KB Output is correct
67 Correct 2521 ms 6216 KB Output is correct
68 Correct 3277 ms 5164 KB Output is correct
69 Correct 1148 ms 5440 KB Output is correct
70 Correct 1149 ms 5660 KB Output is correct
71 Correct 1198 ms 5592 KB Output is correct
72 Correct 1167 ms 5532 KB Output is correct
73 Correct 3737 ms 3956 KB Output is correct
74 Correct 3296 ms 5352 KB Output is correct
75 Correct 225 ms 8336 KB Output is correct
76 Correct 556 ms 7956 KB Output is correct
77 Correct 286 ms 3252 KB Output is correct
78 Correct 268 ms 3228 KB Output is correct
79 Correct 288 ms 3252 KB Output is correct
80 Correct 279 ms 3384 KB Output is correct
81 Correct 3714 ms 5220 KB Output is correct
82 Correct 3752 ms 3976 KB Output is correct
83 Correct 3255 ms 3408 KB Output is correct
84 Correct 3301 ms 5352 KB Output is correct
85 Correct 2394 ms 6548 KB Output is correct
86 Correct 2474 ms 6676 KB Output is correct
87 Correct 3694 ms 4824 KB Output is correct
88 Correct 3261 ms 3576 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 624 KB Output is correct
8 Correct 75 ms 760 KB Output is correct
9 Correct 84 ms 632 KB Output is correct
10 Correct 35 ms 888 KB Output is correct
11 Correct 35 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 93 ms 632 KB Output is correct
15 Correct 10 ms 504 KB Output is correct
16 Correct 14 ms 504 KB Output is correct
17 Correct 51 ms 760 KB Output is correct
18 Correct 61 ms 888 KB Output is correct
19 Correct 57 ms 760 KB Output is correct
20 Correct 58 ms 800 KB Output is correct
21 Correct 1133 ms 5100 KB Output is correct
22 Correct 1142 ms 5020 KB Output is correct
23 Correct 1144 ms 4896 KB Output is correct
24 Correct 1071 ms 5304 KB Output is correct
25 Correct 239 ms 7700 KB Output is correct
26 Correct 184 ms 7704 KB Output is correct
27 Correct 1146 ms 4872 KB Output is correct
28 Correct 1161 ms 5136 KB Output is correct
29 Correct 1203 ms 4896 KB Output is correct
30 Correct 1472 ms 2988 KB Output is correct
31 Correct 1452 ms 3448 KB Output is correct
32 Correct 782 ms 5972 KB Output is correct
33 Correct 283 ms 3124 KB Output is correct
34 Correct 256 ms 3360 KB Output is correct
35 Correct 365 ms 3512 KB Output is correct
36 Correct 263 ms 3380 KB Output is correct
37 Correct 582 ms 6580 KB Output is correct
38 Correct 735 ms 6028 KB Output is correct
39 Correct 658 ms 6292 KB Output is correct
40 Correct 191 ms 7952 KB Output is correct
41 Correct 734 ms 7972 KB Output is correct
42 Correct 2255 ms 6680 KB Output is correct
43 Correct 1983 ms 3636 KB Output is correct
44 Correct 2148 ms 6796 KB Output is correct
45 Correct 2601 ms 6736 KB Output is correct
46 Correct 3497 ms 4644 KB Output is correct
47 Correct 3557 ms 4324 KB Output is correct
48 Correct 3485 ms 4036 KB Output is correct
49 Correct 889 ms 5328 KB Output is correct
50 Correct 890 ms 5524 KB Output is correct
51 Correct 915 ms 5420 KB Output is correct
52 Correct 889 ms 5280 KB Output is correct
53 Correct 2247 ms 3328 KB Output is correct
54 Correct 3594 ms 4516 KB Output is correct
55 Correct 3074 ms 6064 KB Output is correct
56 Correct 3390 ms 4780 KB Output is correct
57 Correct 299 ms 2996 KB Output is correct
58 Correct 271 ms 3124 KB Output is correct
59 Correct 294 ms 3136 KB Output is correct
60 Correct 289 ms 2996 KB Output is correct
61 Correct 2826 ms 6072 KB Output is correct
62 Correct 2794 ms 6228 KB Output is correct
63 Correct 673 ms 7444 KB Output is correct
64 Correct 2313 ms 6220 KB Output is correct
65 Correct 2434 ms 6332 KB Output is correct
66 Correct 3446 ms 3868 KB Output is correct
67 Correct 2973 ms 5108 KB Output is correct
68 Correct 2412 ms 6180 KB Output is correct
69 Correct 258 ms 2704 KB Output is correct
70 Correct 273 ms 3128 KB Output is correct
71 Correct 272 ms 3132 KB Output is correct
72 Correct 292 ms 3000 KB Output is correct
73 Correct 649 ms 6420 KB Output is correct
74 Correct 1502 ms 2680 KB Output is correct
75 Correct 509 ms 6940 KB Output is correct
76 Correct 1488 ms 3244 KB Output is correct
77 Correct 3639 ms 4548 KB Output is correct
78 Correct 2015 ms 6388 KB Output is correct
79 Correct 3321 ms 3128 KB Output is correct
80 Correct 398 ms 7704 KB Output is correct
81 Correct 2682 ms 6132 KB Output is correct
82 Correct 3681 ms 4712 KB Output is correct
83 Correct 847 ms 7868 KB Output is correct
84 Correct 2492 ms 6548 KB Output is correct
85 Correct 1148 ms 5292 KB Output is correct
86 Correct 1177 ms 5632 KB Output is correct
87 Correct 1165 ms 5652 KB Output is correct
88 Correct 1136 ms 5644 KB Output is correct
89 Correct 281 ms 3896 KB Output is correct
90 Correct 318 ms 3892 KB Output is correct
91 Correct 257 ms 3892 KB Output is correct
92 Correct 266 ms 3884 KB Output is correct
93 Correct 1386 ms 4664 KB Output is correct
94 Correct 1623 ms 3252 KB Output is correct
95 Correct 967 ms 6432 KB Output is correct
96 Correct 1448 ms 3576 KB Output is correct
97 Correct 2735 ms 6572 KB Output is correct
98 Correct 1042 ms 7400 KB Output is correct
99 Correct 608 ms 7968 KB Output is correct
100 Correct 993 ms 7572 KB Output is correct
101 Correct 3522 ms 3624 KB Output is correct
102 Correct 3577 ms 3568 KB Output is correct
103 Correct 2521 ms 6216 KB Output is correct
104 Correct 3277 ms 5164 KB Output is correct
105 Correct 1148 ms 5440 KB Output is correct
106 Correct 1149 ms 5660 KB Output is correct
107 Correct 1198 ms 5592 KB Output is correct
108 Correct 1167 ms 5532 KB Output is correct
109 Correct 3737 ms 3956 KB Output is correct
110 Correct 3296 ms 5352 KB Output is correct
111 Correct 225 ms 8336 KB Output is correct
112 Correct 556 ms 7956 KB Output is correct
113 Correct 286 ms 3252 KB Output is correct
114 Correct 268 ms 3228 KB Output is correct
115 Correct 288 ms 3252 KB Output is correct
116 Correct 279 ms 3384 KB Output is correct
117 Correct 3714 ms 5220 KB Output is correct
118 Correct 3752 ms 3976 KB Output is correct
119 Correct 3255 ms 3408 KB Output is correct
120 Correct 3301 ms 5352 KB Output is correct
121 Correct 2394 ms 6548 KB Output is correct
122 Correct 2474 ms 6676 KB Output is correct
123 Correct 3694 ms 4824 KB Output is correct
124 Correct 3261 ms 3576 KB Output is correct
125 Correct 715 ms 6200 KB Output is correct
126 Correct 737 ms 6064 KB Output is correct
127 Correct 825 ms 6068 KB Output is correct
128 Correct 751 ms 6252 KB Output is correct
129 Correct 685 ms 6060 KB Output is correct
130 Correct 768 ms 6200 KB Output is correct
131 Correct 3329 ms 5536 KB Output is correct
132 Correct 3036 ms 8988 KB Output is correct
133 Correct 2251 ms 11480 KB Output is correct
134 Correct 3427 ms 5036 KB Output is correct
135 Correct 2064 ms 11668 KB Output is correct
136 Correct 2649 ms 3072 KB Output is correct
137 Runtime error 153 ms 24832 KB Execution killed with signal 11 (could be triggered by violating memory limits)
138 Halted 0 ms 0 KB -