oj.uz

답안 #161302

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
161302 2019-11-01T18:45:17 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 3746 ms 34948 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 = 2000;
 
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;
	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) {
		IL[p.i] = -1;
		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) {
		IR[p.i] = -1;
		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];
	if (used[b.i]) {
		return;
	}
	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 (ll)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 (ll)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 < block; q++) {
		L[q].reserve(block_sz);
		R[q].reserve(block_sz);
	}
	ll cnt1 = 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);
			}
			cnt1++;
			x.l = l; x.r = r;
			x.i = cnt1;
			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:97: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:108: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:115:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'll slowL(ll, ll, ll)':
segments.cpp:179: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:190: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:237: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:277: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:292:5: warning: unused variable 'q' [-Wunused-variable]
  ll q, w;
     ^
segments.cpp:292:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'int main()':
segments.cpp:303:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w, e, a, b, c;
        ^
segments.cpp:303:11: warning: unused variable 'e' [-Wunused-variable]
  ll q, w, e, a, b, c;
           ^
segments.cpp:303:17: warning: unused variable 'b' [-Wunused-variable]
  ll q, w, e, a, b, c;
                 ^
segments.cpp:307:5: warning: unused variable 'nxt' [-Wunused-variable]
  ll nxt = 0;
     ^~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 11 ms 1788 KB Output is correct
4 Correct 11 ms 1784 KB Output is correct
5 Correct 20 ms 2168 KB Output is correct
6 Correct 24 ms 2040 KB Output is correct
7 Correct 42 ms 1788 KB Output is correct
8 Correct 79 ms 2008 KB Output is correct
9 Correct 86 ms 1912 KB Output is correct
10 Correct 37 ms 2168 KB Output is correct
11 Correct 38 ms 1912 KB Output is correct
12 Correct 37 ms 2040 KB Output is correct
13 Correct 39 ms 2296 KB Output is correct
14 Correct 96 ms 2040 KB Output is correct
15 Correct 11 ms 1784 KB Output is correct
16 Correct 14 ms 1784 KB Output is correct
17 Correct 51 ms 1912 KB Output is correct
18 Correct 64 ms 2168 KB Output is correct
19 Correct 58 ms 1912 KB Output is correct
20 Correct 64 ms 1912 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1144 ms 6860 KB Output is correct
2 Correct 1147 ms 6952 KB Output is correct
3 Correct 1153 ms 6800 KB Output is correct
4 Correct 1066 ms 7328 KB Output is correct
5 Correct 244 ms 10644 KB Output is correct
6 Correct 170 ms 10764 KB Output is correct
7 Correct 1265 ms 6808 KB Output is correct
8 Correct 1147 ms 6944 KB Output is correct
9 Correct 1188 ms 6784 KB Output is correct
10 Correct 1462 ms 4404 KB Output is correct
11 Correct 1424 ms 5148 KB Output is correct
12 Correct 940 ms 8716 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 291 ms 3768 KB Output is correct
2 Correct 269 ms 3896 KB Output is correct
3 Correct 373 ms 3988 KB Output is correct
4 Correct 269 ms 3764 KB Output is correct
5 Correct 567 ms 8724 KB Output is correct
6 Correct 737 ms 7584 KB Output is correct
7 Correct 659 ms 8120 KB Output is correct
8 Correct 189 ms 10536 KB Output is correct
9 Correct 731 ms 10356 KB Output is correct
10 Correct 2223 ms 8608 KB Output is correct
11 Correct 1842 ms 4032 KB Output is correct
12 Correct 2188 ms 8696 KB Output is correct
13 Correct 2616 ms 8316 KB Output is correct
14 Correct 3623 ms 5516 KB Output is correct
15 Correct 3698 ms 5360 KB Output is correct
16 Correct 3362 ms 4676 KB Output is correct
17 Correct 901 ms 6724 KB Output is correct
18 Correct 907 ms 6944 KB Output is correct
19 Correct 902 ms 6964 KB Output is correct
20 Correct 895 ms 6812 KB Output is correct
21 Correct 2341 ms 4092 KB Output is correct
22 Correct 3525 ms 6052 KB Output is correct
23 Correct 3084 ms 8000 KB Output is correct
24 Correct 3483 ms 6300 KB Output is correct
25 Correct 309 ms 3892 KB Output is correct
26 Correct 287 ms 3848 KB Output is correct
27 Correct 299 ms 3764 KB Output is correct
28 Correct 320 ms 3808 KB Output is correct
29 Correct 2780 ms 8360 KB Output is correct
30 Correct 2929 ms 8412 KB Output is correct
31 Correct 679 ms 10388 KB Output is correct
32 Correct 2240 ms 8608 KB Output is correct
33 Correct 2760 ms 8472 KB Output is correct
34 Correct 3478 ms 5184 KB Output is correct
35 Correct 3132 ms 6944 KB Output is correct
36 Correct 2341 ms 8620 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 261 ms 3952 KB Output is correct
2 Correct 267 ms 3764 KB Output is correct
3 Correct 269 ms 3760 KB Output is correct
4 Correct 284 ms 3764 KB Output is correct
5 Correct 658 ms 9228 KB Output is correct
6 Correct 1499 ms 3704 KB Output is correct
7 Correct 511 ms 9580 KB Output is correct
8 Correct 1475 ms 4288 KB Output is correct
9 Correct 3654 ms 6048 KB Output is correct
10 Correct 2231 ms 8964 KB Output is correct
11 Correct 3331 ms 4340 KB Output is correct
12 Correct 397 ms 10772 KB Output is correct
13 Correct 2732 ms 8464 KB Output is correct
14 Correct 3647 ms 5988 KB Output is correct
15 Correct 831 ms 10276 KB Output is correct
16 Correct 2520 ms 8528 KB Output is correct
17 Correct 1170 ms 6816 KB Output is correct
18 Correct 1172 ms 6816 KB Output is correct
19 Correct 1133 ms 6808 KB Output is correct
20 Correct 1141 ms 6840 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 11 ms 1788 KB Output is correct
4 Correct 11 ms 1784 KB Output is correct
5 Correct 20 ms 2168 KB Output is correct
6 Correct 24 ms 2040 KB Output is correct
7 Correct 42 ms 1788 KB Output is correct
8 Correct 79 ms 2008 KB Output is correct
9 Correct 86 ms 1912 KB Output is correct
10 Correct 37 ms 2168 KB Output is correct
11 Correct 38 ms 1912 KB Output is correct
12 Correct 37 ms 2040 KB Output is correct
13 Correct 39 ms 2296 KB Output is correct
14 Correct 96 ms 2040 KB Output is correct
15 Correct 11 ms 1784 KB Output is correct
16 Correct 14 ms 1784 KB Output is correct
17 Correct 51 ms 1912 KB Output is correct
18 Correct 64 ms 2168 KB Output is correct
19 Correct 58 ms 1912 KB Output is correct
20 Correct 64 ms 1912 KB Output is correct
21 Correct 1144 ms 6860 KB Output is correct
22 Correct 1147 ms 6952 KB Output is correct
23 Correct 1153 ms 6800 KB Output is correct
24 Correct 1066 ms 7328 KB Output is correct
25 Correct 244 ms 10644 KB Output is correct
26 Correct 170 ms 10764 KB Output is correct
27 Correct 1265 ms 6808 KB Output is correct
28 Correct 1147 ms 6944 KB Output is correct
29 Correct 1188 ms 6784 KB Output is correct
30 Correct 1462 ms 4404 KB Output is correct
31 Correct 1424 ms 5148 KB Output is correct
32 Correct 940 ms 8716 KB Output is correct
33 Correct 261 ms 3952 KB Output is correct
34 Correct 267 ms 3764 KB Output is correct
35 Correct 269 ms 3760 KB Output is correct
36 Correct 284 ms 3764 KB Output is correct
37 Correct 658 ms 9228 KB Output is correct
38 Correct 1499 ms 3704 KB Output is correct
39 Correct 511 ms 9580 KB Output is correct
40 Correct 1475 ms 4288 KB Output is correct
41 Correct 3654 ms 6048 KB Output is correct
42 Correct 2231 ms 8964 KB Output is correct
43 Correct 3331 ms 4340 KB Output is correct
44 Correct 397 ms 10772 KB Output is correct
45 Correct 2732 ms 8464 KB Output is correct
46 Correct 3647 ms 5988 KB Output is correct
47 Correct 831 ms 10276 KB Output is correct
48 Correct 2520 ms 8528 KB Output is correct
49 Correct 1170 ms 6816 KB Output is correct
50 Correct 1172 ms 6816 KB Output is correct
51 Correct 1133 ms 6808 KB Output is correct
52 Correct 1141 ms 6840 KB Output is correct
53 Correct 292 ms 3924 KB Output is correct
54 Correct 287 ms 3764 KB Output is correct
55 Correct 258 ms 3764 KB Output is correct
56 Correct 267 ms 3732 KB Output is correct
57 Correct 1395 ms 5156 KB Output is correct
58 Correct 1495 ms 3340 KB Output is correct
59 Correct 959 ms 7704 KB Output is correct
60 Correct 1468 ms 3148 KB Output is correct
61 Correct 2703 ms 8240 KB Output is correct
62 Correct 1051 ms 10000 KB Output is correct
63 Correct 596 ms 10296 KB Output is correct
64 Correct 1010 ms 10004 KB Output is correct
65 Correct 3558 ms 4712 KB Output is correct
66 Correct 3467 ms 4468 KB Output is correct
67 Correct 2472 ms 8340 KB Output is correct
68 Correct 3157 ms 6944 KB Output is correct
69 Correct 1141 ms 6700 KB Output is correct
70 Correct 1151 ms 6560 KB Output is correct
71 Correct 1153 ms 6680 KB Output is correct
72 Correct 1150 ms 6828 KB Output is correct
73 Correct 3746 ms 5196 KB Output is correct
74 Correct 3332 ms 7672 KB Output is correct
75 Correct 233 ms 11680 KB Output is correct
76 Correct 561 ms 11372 KB Output is correct
77 Correct 279 ms 4604 KB Output is correct
78 Correct 272 ms 4688 KB Output is correct
79 Correct 289 ms 4584 KB Output is correct
80 Correct 272 ms 4532 KB Output is correct
81 Correct 3369 ms 7708 KB Output is correct
82 Correct 3742 ms 5800 KB Output is correct
83 Correct 3275 ms 5456 KB Output is correct
84 Correct 3279 ms 8104 KB Output is correct
85 Correct 2424 ms 9612 KB Output is correct
86 Correct 2229 ms 9720 KB Output is correct
87 Correct 3556 ms 7488 KB Output is correct
88 Correct 3282 ms 5692 KB Output is correct

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 11 ms 1788 KB Output is correct
4 Correct 11 ms 1784 KB Output is correct
5 Correct 20 ms 2168 KB Output is correct
6 Correct 24 ms 2040 KB Output is correct
7 Correct 42 ms 1788 KB Output is correct
8 Correct 79 ms 2008 KB Output is correct
9 Correct 86 ms 1912 KB Output is correct
10 Correct 37 ms 2168 KB Output is correct
11 Correct 38 ms 1912 KB Output is correct
12 Correct 37 ms 2040 KB Output is correct
13 Correct 39 ms 2296 KB Output is correct
14 Correct 96 ms 2040 KB Output is correct
15 Correct 11 ms 1784 KB Output is correct
16 Correct 14 ms 1784 KB Output is correct
17 Correct 51 ms 1912 KB Output is correct
18 Correct 64 ms 2168 KB Output is correct
19 Correct 58 ms 1912 KB Output is correct
20 Correct 64 ms 1912 KB Output is correct
21 Correct 1144 ms 6860 KB Output is correct
22 Correct 1147 ms 6952 KB Output is correct
23 Correct 1153 ms 6800 KB Output is correct
24 Correct 1066 ms 7328 KB Output is correct
25 Correct 244 ms 10644 KB Output is correct
26 Correct 170 ms 10764 KB Output is correct
27 Correct 1265 ms 6808 KB Output is correct
28 Correct 1147 ms 6944 KB Output is correct
29 Correct 1188 ms 6784 KB Output is correct
30 Correct 1462 ms 4404 KB Output is correct
31 Correct 1424 ms 5148 KB Output is correct
32 Correct 940 ms 8716 KB Output is correct
33 Correct 291 ms 3768 KB Output is correct
34 Correct 269 ms 3896 KB Output is correct
35 Correct 373 ms 3988 KB Output is correct
36 Correct 269 ms 3764 KB Output is correct
37 Correct 567 ms 8724 KB Output is correct
38 Correct 737 ms 7584 KB Output is correct
39 Correct 659 ms 8120 KB Output is correct
40 Correct 189 ms 10536 KB Output is correct
41 Correct 731 ms 10356 KB Output is correct
42 Correct 2223 ms 8608 KB Output is correct
43 Correct 1842 ms 4032 KB Output is correct
44 Correct 2188 ms 8696 KB Output is correct
45 Correct 2616 ms 8316 KB Output is correct
46 Correct 3623 ms 5516 KB Output is correct
47 Correct 3698 ms 5360 KB Output is correct
48 Correct 3362 ms 4676 KB Output is correct
49 Correct 901 ms 6724 KB Output is correct
50 Correct 907 ms 6944 KB Output is correct
51 Correct 902 ms 6964 KB Output is correct
52 Correct 895 ms 6812 KB Output is correct
53 Correct 2341 ms 4092 KB Output is correct
54 Correct 3525 ms 6052 KB Output is correct
55 Correct 3084 ms 8000 KB Output is correct
56 Correct 3483 ms 6300 KB Output is correct
57 Correct 309 ms 3892 KB Output is correct
58 Correct 287 ms 3848 KB Output is correct
59 Correct 299 ms 3764 KB Output is correct
60 Correct 320 ms 3808 KB Output is correct
61 Correct 2780 ms 8360 KB Output is correct
62 Correct 2929 ms 8412 KB Output is correct
63 Correct 679 ms 10388 KB Output is correct
64 Correct 2240 ms 8608 KB Output is correct
65 Correct 2760 ms 8472 KB Output is correct
66 Correct 3478 ms 5184 KB Output is correct
67 Correct 3132 ms 6944 KB Output is correct
68 Correct 2341 ms 8620 KB Output is correct
69 Correct 261 ms 3952 KB Output is correct
70 Correct 267 ms 3764 KB Output is correct
71 Correct 269 ms 3760 KB Output is correct
72 Correct 284 ms 3764 KB Output is correct
73 Correct 658 ms 9228 KB Output is correct
74 Correct 1499 ms 3704 KB Output is correct
75 Correct 511 ms 9580 KB Output is correct
76 Correct 1475 ms 4288 KB Output is correct
77 Correct 3654 ms 6048 KB Output is correct
78 Correct 2231 ms 8964 KB Output is correct
79 Correct 3331 ms 4340 KB Output is correct
80 Correct 397 ms 10772 KB Output is correct
81 Correct 2732 ms 8464 KB Output is correct
82 Correct 3647 ms 5988 KB Output is correct
83 Correct 831 ms 10276 KB Output is correct
84 Correct 2520 ms 8528 KB Output is correct
85 Correct 1170 ms 6816 KB Output is correct
86 Correct 1172 ms 6816 KB Output is correct
87 Correct 1133 ms 6808 KB Output is correct
88 Correct 1141 ms 6840 KB Output is correct
89 Correct 292 ms 3924 KB Output is correct
90 Correct 287 ms 3764 KB Output is correct
91 Correct 258 ms 3764 KB Output is correct
92 Correct 267 ms 3732 KB Output is correct
93 Correct 1395 ms 5156 KB Output is correct
94 Correct 1495 ms 3340 KB Output is correct
95 Correct 959 ms 7704 KB Output is correct
96 Correct 1468 ms 3148 KB Output is correct
97 Correct 2703 ms 8240 KB Output is correct
98 Correct 1051 ms 10000 KB Output is correct
99 Correct 596 ms 10296 KB Output is correct
100 Correct 1010 ms 10004 KB Output is correct
101 Correct 3558 ms 4712 KB Output is correct
102 Correct 3467 ms 4468 KB Output is correct
103 Correct 2472 ms 8340 KB Output is correct
104 Correct 3157 ms 6944 KB Output is correct
105 Correct 1141 ms 6700 KB Output is correct
106 Correct 1151 ms 6560 KB Output is correct
107 Correct 1153 ms 6680 KB Output is correct
108 Correct 1150 ms 6828 KB Output is correct
109 Correct 3746 ms 5196 KB Output is correct
110 Correct 3332 ms 7672 KB Output is correct
111 Correct 233 ms 11680 KB Output is correct
112 Correct 561 ms 11372 KB Output is correct
113 Correct 279 ms 4604 KB Output is correct
114 Correct 272 ms 4688 KB Output is correct
115 Correct 289 ms 4584 KB Output is correct
116 Correct 272 ms 4532 KB Output is correct
117 Correct 3369 ms 7708 KB Output is correct
118 Correct 3742 ms 5800 KB Output is correct
119 Correct 3275 ms 5456 KB Output is correct
120 Correct 3279 ms 8104 KB Output is correct
121 Correct 2424 ms 9612 KB Output is correct
122 Correct 2229 ms 9720 KB Output is correct
123 Correct 3556 ms 7488 KB Output is correct
124 Correct 3282 ms 5692 KB Output is correct
125 Correct 747 ms 6964 KB Output is correct
126 Correct 774 ms 6864 KB Output is correct
127 Correct 861 ms 6952 KB Output is correct
128 Correct 787 ms 6968 KB Output is correct
129 Correct 738 ms 6992 KB Output is correct
130 Correct 797 ms 7056 KB Output is correct
131 Correct 3557 ms 6540 KB Output is correct
132 Correct 3011 ms 12784 KB Output is correct
133 Correct 2257 ms 16256 KB Output is correct
134 Correct 3402 ms 7676 KB Output is correct
135 Correct 2029 ms 16728 KB Output is correct
136 Correct 2666 ms 5016 KB Output is correct
137 Runtime error 169 ms 34948 KB Execution killed with signal 11 (could be triggered by violating memory limits)
138 Halted 0 ms 0 KB -