oj.uz

답안 #161270

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
161270 2019-11-01T16:30:59 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 3671 ms 37504 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 = 2e5 + 5e4;
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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 11 ms 632 KB Output is correct
4 Correct 11 ms 636 KB Output is correct
5 Correct 16 ms 1208 KB Output is correct
6 Correct 19 ms 1016 KB Output is correct
7 Correct 39 ms 760 KB Output is correct
8 Correct 77 ms 1044 KB Output is correct
9 Correct 82 ms 888 KB Output is correct
10 Correct 35 ms 1208 KB Output is correct
11 Correct 27 ms 892 KB Output is correct
12 Correct 28 ms 1016 KB Output is correct
13 Correct 35 ms 1208 KB Output is correct
14 Correct 89 ms 1016 KB Output is correct
15 Correct 10 ms 732 KB Output is correct
16 Correct 23 ms 760 KB Output is correct
17 Correct 63 ms 928 KB Output is correct
18 Correct 56 ms 1272 KB Output is correct
19 Correct 75 ms 888 KB Output is correct
20 Correct 91 ms 1012 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1030 ms 8724 KB Output is correct
2 Correct 1041 ms 9208 KB Output is correct
3 Correct 1035 ms 9076 KB Output is correct
4 Correct 966 ms 9828 KB Output is correct
5 Correct 258 ms 14972 KB Output is correct
6 Correct 183 ms 15356 KB Output is correct
7 Correct 1038 ms 9220 KB Output is correct
8 Correct 1082 ms 9120 KB Output is correct
9 Correct 1060 ms 9076 KB Output is correct
10 Correct 1286 ms 5072 KB Output is correct
11 Correct 1252 ms 6064 KB Output is correct
12 Correct 776 ms 11904 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 275 ms 4568 KB Output is correct
2 Correct 241 ms 4596 KB Output is correct
3 Correct 350 ms 4564 KB Output is correct
4 Correct 281 ms 4600 KB Output is correct
5 Correct 498 ms 11872 KB Output is correct
6 Correct 642 ms 10500 KB Output is correct
7 Correct 598 ms 11168 KB Output is correct
8 Correct 276 ms 14924 KB Output is correct
9 Correct 752 ms 14508 KB Output is correct
10 Correct 2280 ms 12176 KB Output is correct
11 Correct 1787 ms 5108 KB Output is correct
12 Correct 2179 ms 11876 KB Output is correct
13 Correct 2686 ms 11836 KB Output is correct
14 Correct 3515 ms 7456 KB Output is correct
15 Correct 3465 ms 6840 KB Output is correct
16 Correct 3206 ms 5820 KB Output is correct
17 Correct 759 ms 8940 KB Output is correct
18 Correct 741 ms 8976 KB Output is correct
19 Correct 744 ms 8900 KB Output is correct
20 Correct 748 ms 8848 KB Output is correct
21 Correct 2260 ms 5168 KB Output is correct
22 Correct 3392 ms 8096 KB Output is correct
23 Correct 3189 ms 11328 KB Output is correct
24 Correct 3379 ms 8524 KB Output is correct
25 Correct 346 ms 4976 KB Output is correct
26 Correct 253 ms 4856 KB Output is correct
27 Correct 299 ms 4824 KB Output is correct
28 Correct 271 ms 4788 KB Output is correct
29 Correct 2822 ms 11448 KB Output is correct
30 Correct 2853 ms 11444 KB Output is correct
31 Correct 698 ms 14464 KB Output is correct
32 Correct 2259 ms 12312 KB Output is correct
33 Correct 2543 ms 11916 KB Output is correct
34 Correct 3420 ms 6708 KB Output is correct
35 Correct 3206 ms 9544 KB Output is correct
36 Correct 2390 ms 12420 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 249 ms 4812 KB Output is correct
2 Correct 253 ms 4576 KB Output is correct
3 Correct 258 ms 4604 KB Output is correct
4 Correct 266 ms 4468 KB Output is correct
5 Correct 631 ms 12676 KB Output is correct
6 Correct 1256 ms 4280 KB Output is correct
7 Correct 526 ms 13440 KB Output is correct
8 Correct 1266 ms 5088 KB Output is correct
9 Correct 3489 ms 7920 KB Output is correct
10 Correct 2011 ms 12280 KB Output is correct
11 Correct 3559 ms 5264 KB Output is correct
12 Correct 411 ms 14784 KB Output is correct
13 Correct 2719 ms 11616 KB Output is correct
14 Correct 3515 ms 7512 KB Output is correct
15 Correct 874 ms 14088 KB Output is correct
16 Correct 2484 ms 11924 KB Output is correct
17 Correct 1033 ms 8608 KB Output is correct
18 Correct 1048 ms 8012 KB Output is correct
19 Correct 1049 ms 7876 KB Output is correct
20 Correct 1209 ms 7764 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 11 ms 632 KB Output is correct
4 Correct 11 ms 636 KB Output is correct
5 Correct 16 ms 1208 KB Output is correct
6 Correct 19 ms 1016 KB Output is correct
7 Correct 39 ms 760 KB Output is correct
8 Correct 77 ms 1044 KB Output is correct
9 Correct 82 ms 888 KB Output is correct
10 Correct 35 ms 1208 KB Output is correct
11 Correct 27 ms 892 KB Output is correct
12 Correct 28 ms 1016 KB Output is correct
13 Correct 35 ms 1208 KB Output is correct
14 Correct 89 ms 1016 KB Output is correct
15 Correct 10 ms 732 KB Output is correct
16 Correct 23 ms 760 KB Output is correct
17 Correct 63 ms 928 KB Output is correct
18 Correct 56 ms 1272 KB Output is correct
19 Correct 75 ms 888 KB Output is correct
20 Correct 91 ms 1012 KB Output is correct
21 Correct 1030 ms 8724 KB Output is correct
22 Correct 1041 ms 9208 KB Output is correct
23 Correct 1035 ms 9076 KB Output is correct
24 Correct 966 ms 9828 KB Output is correct
25 Correct 258 ms 14972 KB Output is correct
26 Correct 183 ms 15356 KB Output is correct
27 Correct 1038 ms 9220 KB Output is correct
28 Correct 1082 ms 9120 KB Output is correct
29 Correct 1060 ms 9076 KB Output is correct
30 Correct 1286 ms 5072 KB Output is correct
31 Correct 1252 ms 6064 KB Output is correct
32 Correct 776 ms 11904 KB Output is correct
33 Correct 249 ms 4812 KB Output is correct
34 Correct 253 ms 4576 KB Output is correct
35 Correct 258 ms 4604 KB Output is correct
36 Correct 266 ms 4468 KB Output is correct
37 Correct 631 ms 12676 KB Output is correct
38 Correct 1256 ms 4280 KB Output is correct
39 Correct 526 ms 13440 KB Output is correct
40 Correct 1266 ms 5088 KB Output is correct
41 Correct 3489 ms 7920 KB Output is correct
42 Correct 2011 ms 12280 KB Output is correct
43 Correct 3559 ms 5264 KB Output is correct
44 Correct 411 ms 14784 KB Output is correct
45 Correct 2719 ms 11616 KB Output is correct
46 Correct 3515 ms 7512 KB Output is correct
47 Correct 874 ms 14088 KB Output is correct
48 Correct 2484 ms 11924 KB Output is correct
49 Correct 1033 ms 8608 KB Output is correct
50 Correct 1048 ms 8012 KB Output is correct
51 Correct 1049 ms 7876 KB Output is correct
52 Correct 1209 ms 7764 KB Output is correct
53 Correct 274 ms 3596 KB Output is correct
54 Correct 271 ms 3684 KB Output is correct
55 Correct 247 ms 3740 KB Output is correct
56 Correct 260 ms 3616 KB Output is correct
57 Correct 1279 ms 5272 KB Output is correct
58 Correct 1219 ms 2548 KB Output is correct
59 Correct 906 ms 9820 KB Output is correct
60 Correct 1223 ms 3088 KB Output is correct
61 Correct 2819 ms 11484 KB Output is correct
62 Correct 1268 ms 13768 KB Output is correct
63 Correct 628 ms 14468 KB Output is correct
64 Correct 1039 ms 13788 KB Output is correct
65 Correct 3671 ms 5952 KB Output is correct
66 Correct 3211 ms 5376 KB Output is correct
67 Correct 2405 ms 11668 KB Output is correct
68 Correct 3332 ms 9440 KB Output is correct
69 Correct 1069 ms 8848 KB Output is correct
70 Correct 1058 ms 8748 KB Output is correct
71 Correct 1069 ms 8836 KB Output is correct
72 Correct 1050 ms 8728 KB Output is correct
73 Correct 3612 ms 6460 KB Output is correct
74 Correct 3217 ms 9092 KB Output is correct
75 Correct 244 ms 14980 KB Output is correct
76 Correct 579 ms 14464 KB Output is correct
77 Correct 261 ms 4460 KB Output is correct
78 Correct 253 ms 4480 KB Output is correct
79 Correct 284 ms 4572 KB Output is correct
80 Correct 253 ms 4348 KB Output is correct
81 Correct 3524 ms 8796 KB Output is correct
82 Correct 3590 ms 6248 KB Output is correct
83 Correct 3350 ms 5172 KB Output is correct
84 Correct 3285 ms 8852 KB Output is correct
85 Correct 2421 ms 11536 KB Output is correct
86 Correct 2298 ms 11268 KB Output is correct
87 Correct 3474 ms 7772 KB Output is correct
88 Correct 3099 ms 5584 KB Output is correct

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 11 ms 632 KB Output is correct
4 Correct 11 ms 636 KB Output is correct
5 Correct 16 ms 1208 KB Output is correct
6 Correct 19 ms 1016 KB Output is correct
7 Correct 39 ms 760 KB Output is correct
8 Correct 77 ms 1044 KB Output is correct
9 Correct 82 ms 888 KB Output is correct
10 Correct 35 ms 1208 KB Output is correct
11 Correct 27 ms 892 KB Output is correct
12 Correct 28 ms 1016 KB Output is correct
13 Correct 35 ms 1208 KB Output is correct
14 Correct 89 ms 1016 KB Output is correct
15 Correct 10 ms 732 KB Output is correct
16 Correct 23 ms 760 KB Output is correct
17 Correct 63 ms 928 KB Output is correct
18 Correct 56 ms 1272 KB Output is correct
19 Correct 75 ms 888 KB Output is correct
20 Correct 91 ms 1012 KB Output is correct
21 Correct 1030 ms 8724 KB Output is correct
22 Correct 1041 ms 9208 KB Output is correct
23 Correct 1035 ms 9076 KB Output is correct
24 Correct 966 ms 9828 KB Output is correct
25 Correct 258 ms 14972 KB Output is correct
26 Correct 183 ms 15356 KB Output is correct
27 Correct 1038 ms 9220 KB Output is correct
28 Correct 1082 ms 9120 KB Output is correct
29 Correct 1060 ms 9076 KB Output is correct
30 Correct 1286 ms 5072 KB Output is correct
31 Correct 1252 ms 6064 KB Output is correct
32 Correct 776 ms 11904 KB Output is correct
33 Correct 275 ms 4568 KB Output is correct
34 Correct 241 ms 4596 KB Output is correct
35 Correct 350 ms 4564 KB Output is correct
36 Correct 281 ms 4600 KB Output is correct
37 Correct 498 ms 11872 KB Output is correct
38 Correct 642 ms 10500 KB Output is correct
39 Correct 598 ms 11168 KB Output is correct
40 Correct 276 ms 14924 KB Output is correct
41 Correct 752 ms 14508 KB Output is correct
42 Correct 2280 ms 12176 KB Output is correct
43 Correct 1787 ms 5108 KB Output is correct
44 Correct 2179 ms 11876 KB Output is correct
45 Correct 2686 ms 11836 KB Output is correct
46 Correct 3515 ms 7456 KB Output is correct
47 Correct 3465 ms 6840 KB Output is correct
48 Correct 3206 ms 5820 KB Output is correct
49 Correct 759 ms 8940 KB Output is correct
50 Correct 741 ms 8976 KB Output is correct
51 Correct 744 ms 8900 KB Output is correct
52 Correct 748 ms 8848 KB Output is correct
53 Correct 2260 ms 5168 KB Output is correct
54 Correct 3392 ms 8096 KB Output is correct
55 Correct 3189 ms 11328 KB Output is correct
56 Correct 3379 ms 8524 KB Output is correct
57 Correct 346 ms 4976 KB Output is correct
58 Correct 253 ms 4856 KB Output is correct
59 Correct 299 ms 4824 KB Output is correct
60 Correct 271 ms 4788 KB Output is correct
61 Correct 2822 ms 11448 KB Output is correct
62 Correct 2853 ms 11444 KB Output is correct
63 Correct 698 ms 14464 KB Output is correct
64 Correct 2259 ms 12312 KB Output is correct
65 Correct 2543 ms 11916 KB Output is correct
66 Correct 3420 ms 6708 KB Output is correct
67 Correct 3206 ms 9544 KB Output is correct
68 Correct 2390 ms 12420 KB Output is correct
69 Correct 249 ms 4812 KB Output is correct
70 Correct 253 ms 4576 KB Output is correct
71 Correct 258 ms 4604 KB Output is correct
72 Correct 266 ms 4468 KB Output is correct
73 Correct 631 ms 12676 KB Output is correct
74 Correct 1256 ms 4280 KB Output is correct
75 Correct 526 ms 13440 KB Output is correct
76 Correct 1266 ms 5088 KB Output is correct
77 Correct 3489 ms 7920 KB Output is correct
78 Correct 2011 ms 12280 KB Output is correct
79 Correct 3559 ms 5264 KB Output is correct
80 Correct 411 ms 14784 KB Output is correct
81 Correct 2719 ms 11616 KB Output is correct
82 Correct 3515 ms 7512 KB Output is correct
83 Correct 874 ms 14088 KB Output is correct
84 Correct 2484 ms 11924 KB Output is correct
85 Correct 1033 ms 8608 KB Output is correct
86 Correct 1048 ms 8012 KB Output is correct
87 Correct 1049 ms 7876 KB Output is correct
88 Correct 1209 ms 7764 KB Output is correct
89 Correct 274 ms 3596 KB Output is correct
90 Correct 271 ms 3684 KB Output is correct
91 Correct 247 ms 3740 KB Output is correct
92 Correct 260 ms 3616 KB Output is correct
93 Correct 1279 ms 5272 KB Output is correct
94 Correct 1219 ms 2548 KB Output is correct
95 Correct 906 ms 9820 KB Output is correct
96 Correct 1223 ms 3088 KB Output is correct
97 Correct 2819 ms 11484 KB Output is correct
98 Correct 1268 ms 13768 KB Output is correct
99 Correct 628 ms 14468 KB Output is correct
100 Correct 1039 ms 13788 KB Output is correct
101 Correct 3671 ms 5952 KB Output is correct
102 Correct 3211 ms 5376 KB Output is correct
103 Correct 2405 ms 11668 KB Output is correct
104 Correct 3332 ms 9440 KB Output is correct
105 Correct 1069 ms 8848 KB Output is correct
106 Correct 1058 ms 8748 KB Output is correct
107 Correct 1069 ms 8836 KB Output is correct
108 Correct 1050 ms 8728 KB Output is correct
109 Correct 3612 ms 6460 KB Output is correct
110 Correct 3217 ms 9092 KB Output is correct
111 Correct 244 ms 14980 KB Output is correct
112 Correct 579 ms 14464 KB Output is correct
113 Correct 261 ms 4460 KB Output is correct
114 Correct 253 ms 4480 KB Output is correct
115 Correct 284 ms 4572 KB Output is correct
116 Correct 253 ms 4348 KB Output is correct
117 Correct 3524 ms 8796 KB Output is correct
118 Correct 3590 ms 6248 KB Output is correct
119 Correct 3350 ms 5172 KB Output is correct
120 Correct 3285 ms 8852 KB Output is correct
121 Correct 2421 ms 11536 KB Output is correct
122 Correct 2298 ms 11268 KB Output is correct
123 Correct 3474 ms 7772 KB Output is correct
124 Correct 3099 ms 5584 KB Output is correct
125 Correct 712 ms 7864 KB Output is correct
126 Correct 726 ms 7892 KB Output is correct
127 Correct 836 ms 7788 KB Output is correct
128 Correct 737 ms 7892 KB Output is correct
129 Correct 677 ms 7952 KB Output is correct
130 Correct 769 ms 7924 KB Output is correct
131 Correct 3013 ms 5656 KB Output is correct
132 Correct 2938 ms 14460 KB Output is correct
133 Runtime error 148 ms 37504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
134 Halted 0 ms 0 KB -