oj.uz

Submission #161321

# Submission time Handle Problem Language Result Execution time Memory
161321 2019-11-01T20:00:40 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 5000 ms 6656 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;
};
 
seg S[maxn];

ll ssz = 0;

vector <ll> 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.i);
	// S.pb(a);
	S[ssz] = a;
	ssz++;
	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]]) {
			continue;
		}
		if (S[lasts[q]].l >= l && S[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]]) {
			continue;
		}
		if (S[lasts[q]].r <= r && S[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 = ssz;
			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:73: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:84: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:91:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'll slowL(ll, ll, ll)':
segments.cpp:155: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:166: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:243: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:283: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:298:5: warning: unused variable 'q' [-Wunused-variable]
  ll q, w;
     ^
segments.cpp:298:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'int main()':
segments.cpp:309:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w, e, a, b, c;
        ^
segments.cpp:309:11: warning: unused variable 'e' [-Wunused-variable]
  ll q, w, e, a, b, c;
           ^
segments.cpp:309:17: warning: unused variable 'b' [-Wunused-variable]
  ll q, w, e, a, b, c;
                 ^
segments.cpp:313: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 1300 KB Output is correct
3 Correct 11 ms 1528 KB Output is correct
4 Correct 11 ms 1528 KB Output is correct
5 Correct 20 ms 1660 KB Output is correct
6 Correct 26 ms 1656 KB Output is correct
7 Correct 37 ms 1528 KB Output is correct
8 Correct 77 ms 1528 KB Output is correct
9 Correct 81 ms 1628 KB Output is correct
10 Correct 35 ms 1656 KB Output is correct
11 Correct 40 ms 1776 KB Output is correct
12 Correct 39 ms 1528 KB Output is correct
13 Correct 35 ms 1668 KB Output is correct
14 Correct 91 ms 1656 KB Output is correct
15 Correct 10 ms 1528 KB Output is correct
16 Correct 14 ms 1528 KB Output is correct
17 Correct 64 ms 1568 KB Output is correct
18 Correct 56 ms 1784 KB Output is correct
19 Correct 74 ms 1532 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 2080 ms 4980 KB Output is correct
2 Correct 2052 ms 4900 KB Output is correct
3 Correct 2085 ms 4984 KB Output is correct
4 Correct 2000 ms 4980 KB Output is correct
5 Correct 431 ms 6276 KB Output is correct
6 Correct 287 ms 6256 KB Output is correct
7 Correct 2092 ms 4944 KB Output is correct
8 Correct 2086 ms 4980 KB Output is correct
9 Correct 2067 ms 4852 KB Output is correct
10 Correct 2012 ms 3872 KB Output is correct
11 Correct 2206 ms 4088 KB Output is correct
12 Correct 1540 ms 5492 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 314 ms 3420 KB Output is correct
2 Correct 268 ms 3556 KB Output is correct
3 Correct 426 ms 3488 KB Output is correct
4 Correct 279 ms 3448 KB Output is correct
5 Correct 1244 ms 5680 KB Output is correct
6 Correct 1584 ms 5364 KB Output is correct
7 Correct 1400 ms 5616 KB Output is correct
8 Correct 362 ms 6384 KB Output is correct
9 Correct 862 ms 6392 KB Output is correct
10 Correct 2621 ms 5748 KB Output is correct
11 Correct 1946 ms 3704 KB Output is correct
12 Correct 2673 ms 5948 KB Output is correct
13 Correct 3025 ms 5528 KB Output is correct
14 Correct 3893 ms 4596 KB Output is correct
15 Correct 3831 ms 4460 KB Output is correct
16 Correct 3524 ms 4232 KB Output is correct
17 Correct 1778 ms 4984 KB Output is correct
18 Correct 1774 ms 5184 KB Output is correct
19 Correct 1780 ms 5108 KB Output is correct
20 Correct 1798 ms 5052 KB Output is correct
21 Correct 2703 ms 3968 KB Output is correct
22 Correct 3848 ms 4736 KB Output is correct
23 Correct 3513 ms 5220 KB Output is correct
24 Correct 3840 ms 4852 KB Output is correct
25 Correct 332 ms 3576 KB Output is correct
26 Correct 295 ms 3448 KB Output is correct
27 Correct 312 ms 3576 KB Output is correct
28 Correct 311 ms 3380 KB Output is correct
29 Correct 3265 ms 5276 KB Output is correct
30 Correct 3440 ms 5368 KB Output is correct
31 Correct 830 ms 6288 KB Output is correct
32 Correct 2642 ms 5492 KB Output is correct
33 Correct 2906 ms 5620 KB Output is correct
34 Correct 3873 ms 4344 KB Output is correct
35 Correct 3694 ms 5108 KB Output is correct
36 Correct 2725 ms 5252 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 281 ms 3468 KB Output is correct
2 Correct 309 ms 3576 KB Output is correct
3 Correct 283 ms 3448 KB Output is correct
4 Correct 292 ms 3684 KB Output is correct
5 Correct 1276 ms 5896 KB Output is correct
6 Correct 1944 ms 4132 KB Output is correct
7 Correct 991 ms 5972 KB Output is correct
8 Correct 2075 ms 4220 KB Output is correct
9 Correct 4001 ms 4736 KB Output is correct
10 Correct 2359 ms 5744 KB Output is correct
11 Correct 3446 ms 4224 KB Output is correct
12 Correct 473 ms 6656 KB Output is correct
13 Correct 3136 ms 5240 KB Output is correct
14 Correct 3890 ms 4720 KB Output is correct
15 Correct 1016 ms 6256 KB Output is correct
16 Correct 2830 ms 5368 KB Output is correct
17 Correct 2060 ms 5148 KB Output is correct
18 Correct 2073 ms 4944 KB Output is correct
19 Correct 2045 ms 5000 KB Output is correct
20 Correct 2044 ms 4980 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 1300 KB Output is correct
3 Correct 11 ms 1528 KB Output is correct
4 Correct 11 ms 1528 KB Output is correct
5 Correct 20 ms 1660 KB Output is correct
6 Correct 26 ms 1656 KB Output is correct
7 Correct 37 ms 1528 KB Output is correct
8 Correct 77 ms 1528 KB Output is correct
9 Correct 81 ms 1628 KB Output is correct
10 Correct 35 ms 1656 KB Output is correct
11 Correct 40 ms 1776 KB Output is correct
12 Correct 39 ms 1528 KB Output is correct
13 Correct 35 ms 1668 KB Output is correct
14 Correct 91 ms 1656 KB Output is correct
15 Correct 10 ms 1528 KB Output is correct
16 Correct 14 ms 1528 KB Output is correct
17 Correct 64 ms 1568 KB Output is correct
18 Correct 56 ms 1784 KB Output is correct
19 Correct 74 ms 1532 KB Output is correct
20 Correct 89 ms 1528 KB Output is correct
21 Correct 2080 ms 4980 KB Output is correct
22 Correct 2052 ms 4900 KB Output is correct
23 Correct 2085 ms 4984 KB Output is correct
24 Correct 2000 ms 4980 KB Output is correct
25 Correct 431 ms 6276 KB Output is correct
26 Correct 287 ms 6256 KB Output is correct
27 Correct 2092 ms 4944 KB Output is correct
28 Correct 2086 ms 4980 KB Output is correct
29 Correct 2067 ms 4852 KB Output is correct
30 Correct 2012 ms 3872 KB Output is correct
31 Correct 2206 ms 4088 KB Output is correct
32 Correct 1540 ms 5492 KB Output is correct
33 Correct 281 ms 3468 KB Output is correct
34 Correct 309 ms 3576 KB Output is correct
35 Correct 283 ms 3448 KB Output is correct
36 Correct 292 ms 3684 KB Output is correct
37 Correct 1276 ms 5896 KB Output is correct
38 Correct 1944 ms 4132 KB Output is correct
39 Correct 991 ms 5972 KB Output is correct
40 Correct 2075 ms 4220 KB Output is correct
41 Correct 4001 ms 4736 KB Output is correct
42 Correct 2359 ms 5744 KB Output is correct
43 Correct 3446 ms 4224 KB Output is correct
44 Correct 473 ms 6656 KB Output is correct
45 Correct 3136 ms 5240 KB Output is correct
46 Correct 3890 ms 4720 KB Output is correct
47 Correct 1016 ms 6256 KB Output is correct
48 Correct 2830 ms 5368 KB Output is correct
49 Correct 2060 ms 5148 KB Output is correct
50 Correct 2073 ms 4944 KB Output is correct
51 Correct 2045 ms 5000 KB Output is correct
52 Correct 2044 ms 4980 KB Output is correct
53 Correct 301 ms 3448 KB Output is correct
54 Correct 316 ms 3448 KB Output is correct
55 Correct 277 ms 3576 KB Output is correct
56 Correct 292 ms 3444 KB Output is correct
57 Correct 2220 ms 4164 KB Output is correct
58 Correct 1770 ms 3228 KB Output is correct
59 Correct 1813 ms 4804 KB Output is correct
60 Correct 1699 ms 2972 KB Output is correct
61 Correct 3329 ms 4952 KB Output is correct
62 Correct 1267 ms 5744 KB Output is correct
63 Correct 715 ms 5916 KB Output is correct
64 Correct 1213 ms 5712 KB Output is correct
65 Correct 3770 ms 3832 KB Output is correct
66 Correct 3534 ms 3708 KB Output is correct
67 Correct 2813 ms 4956 KB Output is correct
68 Correct 3533 ms 4724 KB Output is correct
69 Correct 2072 ms 4696 KB Output is correct
70 Correct 2065 ms 4580 KB Output is correct
71 Correct 2079 ms 4744 KB Output is correct
72 Correct 2049 ms 4740 KB Output is correct
73 Correct 4070 ms 3960 KB Output is correct
74 Correct 3679 ms 4596 KB Output is correct
75 Correct 259 ms 6000 KB Output is correct
76 Correct 659 ms 5876 KB Output is correct
77 Correct 285 ms 3064 KB Output is correct
78 Correct 283 ms 3068 KB Output is correct
79 Correct 320 ms 3156 KB Output is correct
80 Correct 292 ms 3064 KB Output is correct
81 Correct 3788 ms 4684 KB Output is correct
82 Correct 4018 ms 3960 KB Output is correct
83 Correct 3590 ms 3996 KB Output is correct
84 Correct 3950 ms 4860 KB Output is correct
85 Correct 2819 ms 5364 KB Output is correct
86 Correct 2552 ms 5488 KB Output is correct
87 Correct 4011 ms 4788 KB Output is correct
88 Correct 3373 ms 4052 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 1300 KB Output is correct
3 Correct 11 ms 1528 KB Output is correct
4 Correct 11 ms 1528 KB Output is correct
5 Correct 20 ms 1660 KB Output is correct
6 Correct 26 ms 1656 KB Output is correct
7 Correct 37 ms 1528 KB Output is correct
8 Correct 77 ms 1528 KB Output is correct
9 Correct 81 ms 1628 KB Output is correct
10 Correct 35 ms 1656 KB Output is correct
11 Correct 40 ms 1776 KB Output is correct
12 Correct 39 ms 1528 KB Output is correct
13 Correct 35 ms 1668 KB Output is correct
14 Correct 91 ms 1656 KB Output is correct
15 Correct 10 ms 1528 KB Output is correct
16 Correct 14 ms 1528 KB Output is correct
17 Correct 64 ms 1568 KB Output is correct
18 Correct 56 ms 1784 KB Output is correct
19 Correct 74 ms 1532 KB Output is correct
20 Correct 89 ms 1528 KB Output is correct
21 Correct 2080 ms 4980 KB Output is correct
22 Correct 2052 ms 4900 KB Output is correct
23 Correct 2085 ms 4984 KB Output is correct
24 Correct 2000 ms 4980 KB Output is correct
25 Correct 431 ms 6276 KB Output is correct
26 Correct 287 ms 6256 KB Output is correct
27 Correct 2092 ms 4944 KB Output is correct
28 Correct 2086 ms 4980 KB Output is correct
29 Correct 2067 ms 4852 KB Output is correct
30 Correct 2012 ms 3872 KB Output is correct
31 Correct 2206 ms 4088 KB Output is correct
32 Correct 1540 ms 5492 KB Output is correct
33 Correct 314 ms 3420 KB Output is correct
34 Correct 268 ms 3556 KB Output is correct
35 Correct 426 ms 3488 KB Output is correct
36 Correct 279 ms 3448 KB Output is correct
37 Correct 1244 ms 5680 KB Output is correct
38 Correct 1584 ms 5364 KB Output is correct
39 Correct 1400 ms 5616 KB Output is correct
40 Correct 362 ms 6384 KB Output is correct
41 Correct 862 ms 6392 KB Output is correct
42 Correct 2621 ms 5748 KB Output is correct
43 Correct 1946 ms 3704 KB Output is correct
44 Correct 2673 ms 5948 KB Output is correct
45 Correct 3025 ms 5528 KB Output is correct
46 Correct 3893 ms 4596 KB Output is correct
47 Correct 3831 ms 4460 KB Output is correct
48 Correct 3524 ms 4232 KB Output is correct
49 Correct 1778 ms 4984 KB Output is correct
50 Correct 1774 ms 5184 KB Output is correct
51 Correct 1780 ms 5108 KB Output is correct
52 Correct 1798 ms 5052 KB Output is correct
53 Correct 2703 ms 3968 KB Output is correct
54 Correct 3848 ms 4736 KB Output is correct
55 Correct 3513 ms 5220 KB Output is correct
56 Correct 3840 ms 4852 KB Output is correct
57 Correct 332 ms 3576 KB Output is correct
58 Correct 295 ms 3448 KB Output is correct
59 Correct 312 ms 3576 KB Output is correct
60 Correct 311 ms 3380 KB Output is correct
61 Correct 3265 ms 5276 KB Output is correct
62 Correct 3440 ms 5368 KB Output is correct
63 Correct 830 ms 6288 KB Output is correct
64 Correct 2642 ms 5492 KB Output is correct
65 Correct 2906 ms 5620 KB Output is correct
66 Correct 3873 ms 4344 KB Output is correct
67 Correct 3694 ms 5108 KB Output is correct
68 Correct 2725 ms 5252 KB Output is correct
69 Correct 281 ms 3468 KB Output is correct
70 Correct 309 ms 3576 KB Output is correct
71 Correct 283 ms 3448 KB Output is correct
72 Correct 292 ms 3684 KB Output is correct
73 Correct 1276 ms 5896 KB Output is correct
74 Correct 1944 ms 4132 KB Output is correct
75 Correct 991 ms 5972 KB Output is correct
76 Correct 2075 ms 4220 KB Output is correct
77 Correct 4001 ms 4736 KB Output is correct
78 Correct 2359 ms 5744 KB Output is correct
79 Correct 3446 ms 4224 KB Output is correct
80 Correct 473 ms 6656 KB Output is correct
81 Correct 3136 ms 5240 KB Output is correct
82 Correct 3890 ms 4720 KB Output is correct
83 Correct 1016 ms 6256 KB Output is correct
84 Correct 2830 ms 5368 KB Output is correct
85 Correct 2060 ms 5148 KB Output is correct
86 Correct 2073 ms 4944 KB Output is correct
87 Correct 2045 ms 5000 KB Output is correct
88 Correct 2044 ms 4980 KB Output is correct
89 Correct 301 ms 3448 KB Output is correct
90 Correct 316 ms 3448 KB Output is correct
91 Correct 277 ms 3576 KB Output is correct
92 Correct 292 ms 3444 KB Output is correct
93 Correct 2220 ms 4164 KB Output is correct
94 Correct 1770 ms 3228 KB Output is correct
95 Correct 1813 ms 4804 KB Output is correct
96 Correct 1699 ms 2972 KB Output is correct
97 Correct 3329 ms 4952 KB Output is correct
98 Correct 1267 ms 5744 KB Output is correct
99 Correct 715 ms 5916 KB Output is correct
100 Correct 1213 ms 5712 KB Output is correct
101 Correct 3770 ms 3832 KB Output is correct
102 Correct 3534 ms 3708 KB Output is correct
103 Correct 2813 ms 4956 KB Output is correct
104 Correct 3533 ms 4724 KB Output is correct
105 Correct 2072 ms 4696 KB Output is correct
106 Correct 2065 ms 4580 KB Output is correct
107 Correct 2079 ms 4744 KB Output is correct
108 Correct 2049 ms 4740 KB Output is correct
109 Correct 4070 ms 3960 KB Output is correct
110 Correct 3679 ms 4596 KB Output is correct
111 Correct 259 ms 6000 KB Output is correct
112 Correct 659 ms 5876 KB Output is correct
113 Correct 285 ms 3064 KB Output is correct
114 Correct 283 ms 3068 KB Output is correct
115 Correct 320 ms 3156 KB Output is correct
116 Correct 292 ms 3064 KB Output is correct
117 Correct 3788 ms 4684 KB Output is correct
118 Correct 4018 ms 3960 KB Output is correct
119 Correct 3590 ms 3996 KB Output is correct
120 Correct 3950 ms 4860 KB Output is correct
121 Correct 2819 ms 5364 KB Output is correct
122 Correct 2552 ms 5488 KB Output is correct
123 Correct 4011 ms 4788 KB Output is correct
124 Correct 3373 ms 4052 KB Output is correct
125 Correct 884 ms 4668 KB Output is correct
126 Correct 873 ms 4628 KB Output is correct
127 Correct 1238 ms 4648 KB Output is correct
128 Correct 916 ms 4728 KB Output is correct
129 Correct 822 ms 4600 KB Output is correct
130 Correct 921 ms 4572 KB Output is correct
131 Correct 4613 ms 5080 KB Output is correct
132 Execution timed out 5035 ms 6596 KB Time limit exceeded
133 Halted 0 ms 0 KB -