oj.uz

Submission #161317

# Submission time Handle Problem Language Result Execution time Memory
161317 2019-11-01T19:38:29 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 5000 ms 6512 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 = 120;
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;
};
 
vector <seg> S;

vector <seg> lasts;
 
inline bool cmpl(const ll& a, const ll& b) {
	return S[a].l < S[b].l;
}
 
inline bool cmpr(const ll& a, const ll& b) {
	return S[a].r < S[b].r;
}
 
inline bool cmpsz(const ll& a, const ll& b) {
	return S[a].sz() < S[b].sz();
}
 
vector <ll> segs;
 
vector <ll> R[block];
 
vector <ll> 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], S[L[q][w]].l);
		MXL[q] = max(MXL[q], S[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], S[R[q][w]].r);
		MXR[q] = max(MXR[q], S[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] = -1;
		if (used[p]) {
			continue;
		}
		if (L[blocki].size() > block_sz) {
			blocki++;
		}
		IL[p] = blocki;
		L[blocki].pb(p);
	}
	blocki = 0;
	sort(segs.begin(), segs.end(), cmpr);
	for (auto p: segs) {
		IR[p] = -1;
		if (used[p]) {
			continue;
		}
		if (R[blocki].size() > block_sz) {
			blocki++;
		}
		IR[p] = 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.i);
	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.i));
	R[ir].erase(find(R[ir].begin(), R[ir].end(), b.i));
	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 (S[L[i][q]].l >= l && S[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 (S[R[i][q]].r <= r && S[R[i][q]].sz() >= x) {
			ans++;
		}
	}
	return ans;
}

inline ll bpl(ll i, ll x) {
	ll l = -1, r = L[i].size(), M;
	while (r - l > 1) {
		M = (l + r) / 2;
		if (S[L[i][M]].sz() >= x) {
			r = M;
		}
		else {
			l = M;
		}
	}
	return r;
}

inline ll bpr(ll i, ll x) {
	ll l = -1, r = R[i].size(), M;
	while (r - l > 1) {
		M = (l + r) / 2;
		if (S[R[i][M]].sz() >= x) {
			r = M;
		}
		else {
			l = M;
		}
	}
	return r;
}
 
inline ll fastL(ll i, ll x) {
	if (L[i].empty()) {
		return 0;
	}
	// seg good;
	// good.l = 0; good.r = x - 1; 
	// S.pb(good);
	ll j = bpl(i, x);
	// S.pop_back();
	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;
	// S.pb(good);
	ll j = bpr(i, x);
	// S.pop_back();
	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;
		}
		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;
	segs.reserve(n);
	S.reserve(n);
	for (q = 0; q < block; q++) {
		L[q].reserve(block_sz);
		R[q].reserve(block_sz);
	}
	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:71: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:82: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:89:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'll slowL(ll, ll, ll)':
segments.cpp:151: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:162: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:239: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:279: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:294:5: warning: unused variable 'q' [-Wunused-variable]
  ll q, w;
     ^
segments.cpp:294:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'int main()':
segments.cpp:305:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w, e, a, b, c;
        ^
segments.cpp:305:11: warning: unused variable 'e' [-Wunused-variable]
  ll q, w, e, a, b, c;
           ^
segments.cpp:305:17: warning: unused variable 'b' [-Wunused-variable]
  ll q, w, e, a, b, c;
                 ^
segments.cpp:309:5: warning: unused variable 'nxt' [-Wunused-variable]
  ll nxt = 0;
     ^~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 11 ms 1528 KB Output is correct
4 Correct 11 ms 1528 KB Output is correct
5 Correct 41 ms 1684 KB Output is correct
6 Correct 35 ms 1696 KB Output is correct
7 Correct 36 ms 1556 KB Output is correct
8 Correct 81 ms 1648 KB Output is correct
9 Correct 82 ms 1756 KB Output is correct
10 Correct 35 ms 1784 KB Output is correct
11 Correct 41 ms 1656 KB Output is correct
12 Correct 43 ms 1656 KB Output is correct
13 Correct 37 ms 1656 KB Output is correct
14 Correct 89 ms 1656 KB Output is correct
15 Correct 10 ms 1660 KB Output is correct
16 Correct 14 ms 1528 KB Output is correct
17 Correct 63 ms 1656 KB Output is correct
18 Correct 55 ms 1656 KB Output is correct
19 Correct 74 ms 1720 KB Output is correct
20 Correct 89 ms 1528 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2103 ms 4712 KB Output is correct
2 Correct 2107 ms 4788 KB Output is correct
3 Correct 2306 ms 4768 KB Output is correct
4 Correct 1998 ms 4704 KB Output is correct
5 Correct 477 ms 6264 KB Output is correct
6 Correct 284 ms 6464 KB Output is correct
7 Correct 2100 ms 4776 KB Output is correct
8 Correct 2110 ms 4800 KB Output is correct
9 Correct 2105 ms 4724 KB Output is correct
10 Correct 2047 ms 3448 KB Output is correct
11 Correct 2286 ms 3928 KB Output is correct
12 Correct 1557 ms 5280 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 319 ms 2900 KB Output is correct
2 Correct 267 ms 2936 KB Output is correct
3 Correct 418 ms 3036 KB Output is correct
4 Correct 282 ms 2936 KB Output is correct
5 Correct 1409 ms 5416 KB Output is correct
6 Correct 1592 ms 5012 KB Output is correct
7 Correct 1434 ms 5232 KB Output is correct
8 Correct 371 ms 6252 KB Output is correct
9 Correct 869 ms 6296 KB Output is correct
10 Correct 2655 ms 5476 KB Output is correct
11 Correct 1981 ms 3252 KB Output is correct
12 Correct 2626 ms 5528 KB Output is correct
13 Correct 3032 ms 5128 KB Output is correct
14 Correct 4013 ms 4084 KB Output is correct
15 Correct 3814 ms 3776 KB Output is correct
16 Correct 3522 ms 3692 KB Output is correct
17 Correct 1762 ms 4760 KB Output is correct
18 Correct 1821 ms 4676 KB Output is correct
19 Correct 1775 ms 4596 KB Output is correct
20 Correct 1779 ms 4652 KB Output is correct
21 Correct 2613 ms 3300 KB Output is correct
22 Correct 3848 ms 4428 KB Output is correct
23 Correct 3536 ms 4788 KB Output is correct
24 Correct 3960 ms 4628 KB Output is correct
25 Correct 334 ms 3016 KB Output is correct
26 Correct 294 ms 2868 KB Output is correct
27 Correct 356 ms 2980 KB Output is correct
28 Correct 305 ms 2908 KB Output is correct
29 Correct 3317 ms 5004 KB Output is correct
30 Correct 3314 ms 4896 KB Output is correct
31 Correct 801 ms 6512 KB Output is correct
32 Correct 2712 ms 5552 KB Output is correct
33 Correct 2891 ms 5240 KB Output is correct
34 Correct 4013 ms 3920 KB Output is correct
35 Correct 3476 ms 4872 KB Output is correct
36 Correct 2727 ms 5384 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 284 ms 2936 KB Output is correct
2 Correct 281 ms 2960 KB Output is correct
3 Correct 279 ms 3064 KB Output is correct
4 Correct 293 ms 2936 KB Output is correct
5 Correct 1277 ms 5656 KB Output is correct
6 Correct 1946 ms 3200 KB Output is correct
7 Correct 1037 ms 5868 KB Output is correct
8 Correct 2070 ms 3632 KB Output is correct
9 Correct 4059 ms 4316 KB Output is correct
10 Correct 2484 ms 5576 KB Output is correct
11 Correct 3521 ms 3516 KB Output is correct
12 Correct 509 ms 6508 KB Output is correct
13 Correct 3110 ms 5232 KB Output is correct
14 Correct 3946 ms 4256 KB Output is correct
15 Correct 1065 ms 6396 KB Output is correct
16 Correct 2885 ms 5360 KB Output is correct
17 Correct 2102 ms 4716 KB Output is correct
18 Correct 2118 ms 4840 KB Output is correct
19 Correct 2110 ms 4848 KB Output is correct
20 Correct 2268 ms 4912 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 11 ms 1528 KB Output is correct
4 Correct 11 ms 1528 KB Output is correct
5 Correct 41 ms 1684 KB Output is correct
6 Correct 35 ms 1696 KB Output is correct
7 Correct 36 ms 1556 KB Output is correct
8 Correct 81 ms 1648 KB Output is correct
9 Correct 82 ms 1756 KB Output is correct
10 Correct 35 ms 1784 KB Output is correct
11 Correct 41 ms 1656 KB Output is correct
12 Correct 43 ms 1656 KB Output is correct
13 Correct 37 ms 1656 KB Output is correct
14 Correct 89 ms 1656 KB Output is correct
15 Correct 10 ms 1660 KB Output is correct
16 Correct 14 ms 1528 KB Output is correct
17 Correct 63 ms 1656 KB Output is correct
18 Correct 55 ms 1656 KB Output is correct
19 Correct 74 ms 1720 KB Output is correct
20 Correct 89 ms 1528 KB Output is correct
21 Correct 2103 ms 4712 KB Output is correct
22 Correct 2107 ms 4788 KB Output is correct
23 Correct 2306 ms 4768 KB Output is correct
24 Correct 1998 ms 4704 KB Output is correct
25 Correct 477 ms 6264 KB Output is correct
26 Correct 284 ms 6464 KB Output is correct
27 Correct 2100 ms 4776 KB Output is correct
28 Correct 2110 ms 4800 KB Output is correct
29 Correct 2105 ms 4724 KB Output is correct
30 Correct 2047 ms 3448 KB Output is correct
31 Correct 2286 ms 3928 KB Output is correct
32 Correct 1557 ms 5280 KB Output is correct
33 Correct 284 ms 2936 KB Output is correct
34 Correct 281 ms 2960 KB Output is correct
35 Correct 279 ms 3064 KB Output is correct
36 Correct 293 ms 2936 KB Output is correct
37 Correct 1277 ms 5656 KB Output is correct
38 Correct 1946 ms 3200 KB Output is correct
39 Correct 1037 ms 5868 KB Output is correct
40 Correct 2070 ms 3632 KB Output is correct
41 Correct 4059 ms 4316 KB Output is correct
42 Correct 2484 ms 5576 KB Output is correct
43 Correct 3521 ms 3516 KB Output is correct
44 Correct 509 ms 6508 KB Output is correct
45 Correct 3110 ms 5232 KB Output is correct
46 Correct 3946 ms 4256 KB Output is correct
47 Correct 1065 ms 6396 KB Output is correct
48 Correct 2885 ms 5360 KB Output is correct
49 Correct 2102 ms 4716 KB Output is correct
50 Correct 2118 ms 4840 KB Output is correct
51 Correct 2110 ms 4848 KB Output is correct
52 Correct 2268 ms 4912 KB Output is correct
53 Correct 311 ms 2868 KB Output is correct
54 Correct 325 ms 2888 KB Output is correct
55 Correct 278 ms 3064 KB Output is correct
56 Correct 296 ms 2836 KB Output is correct
57 Correct 2398 ms 3516 KB Output is correct
58 Correct 1812 ms 2380 KB Output is correct
59 Correct 1868 ms 4464 KB Output is correct
60 Correct 1869 ms 2276 KB Output is correct
61 Correct 3183 ms 4720 KB Output is correct
62 Correct 1265 ms 5488 KB Output is correct
63 Correct 756 ms 5740 KB Output is correct
64 Correct 1181 ms 5484 KB Output is correct
65 Correct 3855 ms 3028 KB Output is correct
66 Correct 3546 ms 3000 KB Output is correct
67 Correct 2788 ms 4848 KB Output is correct
68 Correct 3525 ms 4148 KB Output is correct
69 Correct 2138 ms 4136 KB Output is correct
70 Correct 2097 ms 4080 KB Output is correct
71 Correct 2169 ms 4080 KB Output is correct
72 Correct 2107 ms 3952 KB Output is correct
73 Correct 3988 ms 3452 KB Output is correct
74 Correct 3819 ms 4220 KB Output is correct
75 Correct 264 ms 5996 KB Output is correct
76 Correct 679 ms 5872 KB Output is correct
77 Correct 294 ms 2424 KB Output is correct
78 Correct 288 ms 2432 KB Output is correct
79 Correct 310 ms 2300 KB Output is correct
80 Correct 324 ms 2452 KB Output is correct
81 Correct 3897 ms 4204 KB Output is correct
82 Correct 4038 ms 3396 KB Output is correct
83 Correct 3500 ms 3012 KB Output is correct
84 Correct 3754 ms 4208 KB Output is correct
85 Correct 2807 ms 4848 KB Output is correct
86 Correct 2631 ms 4844 KB Output is correct
87 Correct 4051 ms 3824 KB Output is correct
88 Correct 3420 ms 3000 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 11 ms 1528 KB Output is correct
4 Correct 11 ms 1528 KB Output is correct
5 Correct 41 ms 1684 KB Output is correct
6 Correct 35 ms 1696 KB Output is correct
7 Correct 36 ms 1556 KB Output is correct
8 Correct 81 ms 1648 KB Output is correct
9 Correct 82 ms 1756 KB Output is correct
10 Correct 35 ms 1784 KB Output is correct
11 Correct 41 ms 1656 KB Output is correct
12 Correct 43 ms 1656 KB Output is correct
13 Correct 37 ms 1656 KB Output is correct
14 Correct 89 ms 1656 KB Output is correct
15 Correct 10 ms 1660 KB Output is correct
16 Correct 14 ms 1528 KB Output is correct
17 Correct 63 ms 1656 KB Output is correct
18 Correct 55 ms 1656 KB Output is correct
19 Correct 74 ms 1720 KB Output is correct
20 Correct 89 ms 1528 KB Output is correct
21 Correct 2103 ms 4712 KB Output is correct
22 Correct 2107 ms 4788 KB Output is correct
23 Correct 2306 ms 4768 KB Output is correct
24 Correct 1998 ms 4704 KB Output is correct
25 Correct 477 ms 6264 KB Output is correct
26 Correct 284 ms 6464 KB Output is correct
27 Correct 2100 ms 4776 KB Output is correct
28 Correct 2110 ms 4800 KB Output is correct
29 Correct 2105 ms 4724 KB Output is correct
30 Correct 2047 ms 3448 KB Output is correct
31 Correct 2286 ms 3928 KB Output is correct
32 Correct 1557 ms 5280 KB Output is correct
33 Correct 319 ms 2900 KB Output is correct
34 Correct 267 ms 2936 KB Output is correct
35 Correct 418 ms 3036 KB Output is correct
36 Correct 282 ms 2936 KB Output is correct
37 Correct 1409 ms 5416 KB Output is correct
38 Correct 1592 ms 5012 KB Output is correct
39 Correct 1434 ms 5232 KB Output is correct
40 Correct 371 ms 6252 KB Output is correct
41 Correct 869 ms 6296 KB Output is correct
42 Correct 2655 ms 5476 KB Output is correct
43 Correct 1981 ms 3252 KB Output is correct
44 Correct 2626 ms 5528 KB Output is correct
45 Correct 3032 ms 5128 KB Output is correct
46 Correct 4013 ms 4084 KB Output is correct
47 Correct 3814 ms 3776 KB Output is correct
48 Correct 3522 ms 3692 KB Output is correct
49 Correct 1762 ms 4760 KB Output is correct
50 Correct 1821 ms 4676 KB Output is correct
51 Correct 1775 ms 4596 KB Output is correct
52 Correct 1779 ms 4652 KB Output is correct
53 Correct 2613 ms 3300 KB Output is correct
54 Correct 3848 ms 4428 KB Output is correct
55 Correct 3536 ms 4788 KB Output is correct
56 Correct 3960 ms 4628 KB Output is correct
57 Correct 334 ms 3016 KB Output is correct
58 Correct 294 ms 2868 KB Output is correct
59 Correct 356 ms 2980 KB Output is correct
60 Correct 305 ms 2908 KB Output is correct
61 Correct 3317 ms 5004 KB Output is correct
62 Correct 3314 ms 4896 KB Output is correct
63 Correct 801 ms 6512 KB Output is correct
64 Correct 2712 ms 5552 KB Output is correct
65 Correct 2891 ms 5240 KB Output is correct
66 Correct 4013 ms 3920 KB Output is correct
67 Correct 3476 ms 4872 KB Output is correct
68 Correct 2727 ms 5384 KB Output is correct
69 Correct 284 ms 2936 KB Output is correct
70 Correct 281 ms 2960 KB Output is correct
71 Correct 279 ms 3064 KB Output is correct
72 Correct 293 ms 2936 KB Output is correct
73 Correct 1277 ms 5656 KB Output is correct
74 Correct 1946 ms 3200 KB Output is correct
75 Correct 1037 ms 5868 KB Output is correct
76 Correct 2070 ms 3632 KB Output is correct
77 Correct 4059 ms 4316 KB Output is correct
78 Correct 2484 ms 5576 KB Output is correct
79 Correct 3521 ms 3516 KB Output is correct
80 Correct 509 ms 6508 KB Output is correct
81 Correct 3110 ms 5232 KB Output is correct
82 Correct 3946 ms 4256 KB Output is correct
83 Correct 1065 ms 6396 KB Output is correct
84 Correct 2885 ms 5360 KB Output is correct
85 Correct 2102 ms 4716 KB Output is correct
86 Correct 2118 ms 4840 KB Output is correct
87 Correct 2110 ms 4848 KB Output is correct
88 Correct 2268 ms 4912 KB Output is correct
89 Correct 311 ms 2868 KB Output is correct
90 Correct 325 ms 2888 KB Output is correct
91 Correct 278 ms 3064 KB Output is correct
92 Correct 296 ms 2836 KB Output is correct
93 Correct 2398 ms 3516 KB Output is correct
94 Correct 1812 ms 2380 KB Output is correct
95 Correct 1868 ms 4464 KB Output is correct
96 Correct 1869 ms 2276 KB Output is correct
97 Correct 3183 ms 4720 KB Output is correct
98 Correct 1265 ms 5488 KB Output is correct
99 Correct 756 ms 5740 KB Output is correct
100 Correct 1181 ms 5484 KB Output is correct
101 Correct 3855 ms 3028 KB Output is correct
102 Correct 3546 ms 3000 KB Output is correct
103 Correct 2788 ms 4848 KB Output is correct
104 Correct 3525 ms 4148 KB Output is correct
105 Correct 2138 ms 4136 KB Output is correct
106 Correct 2097 ms 4080 KB Output is correct
107 Correct 2169 ms 4080 KB Output is correct
108 Correct 2107 ms 3952 KB Output is correct
109 Correct 3988 ms 3452 KB Output is correct
110 Correct 3819 ms 4220 KB Output is correct
111 Correct 264 ms 5996 KB Output is correct
112 Correct 679 ms 5872 KB Output is correct
113 Correct 294 ms 2424 KB Output is correct
114 Correct 288 ms 2432 KB Output is correct
115 Correct 310 ms 2300 KB Output is correct
116 Correct 324 ms 2452 KB Output is correct
117 Correct 3897 ms 4204 KB Output is correct
118 Correct 4038 ms 3396 KB Output is correct
119 Correct 3500 ms 3012 KB Output is correct
120 Correct 3754 ms 4208 KB Output is correct
121 Correct 2807 ms 4848 KB Output is correct
122 Correct 2631 ms 4844 KB Output is correct
123 Correct 4051 ms 3824 KB Output is correct
124 Correct 3420 ms 3000 KB Output is correct
125 Correct 907 ms 3284 KB Output is correct
126 Correct 894 ms 3252 KB Output is correct
127 Correct 1228 ms 3448 KB Output is correct
128 Correct 925 ms 3448 KB Output is correct
129 Correct 856 ms 3344 KB Output is correct
130 Correct 999 ms 3448 KB Output is correct
131 Correct 4666 ms 3496 KB Output is correct
132 Execution timed out 5082 ms 5996 KB Time limit exceeded
133 Halted 0 ms 0 KB -