oj.uz

Submission #161313

# Submission time Handle Problem Language Result Execution time Memory
161313 2019-11-01T19:28:36 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 5000 ms 7896 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;
};
 
inline bool operator==(seg a, seg b) {
	return a.i == b.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;
}

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 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 = (lower_bound(R[i].begin(), R[i].end(), S.size() - 1, cmpsz) - R[i].begin());
	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;
		}
		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;
	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:75: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:86: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:93: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:231: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:271: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:286:5: warning: unused variable 'q' [-Wunused-variable]
  ll q, w;
     ^
segments.cpp:286:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'int main()':
segments.cpp:297:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w, e, a, b, c;
        ^
segments.cpp:297:11: warning: unused variable 'e' [-Wunused-variable]
  ll q, w, e, a, b, c;
           ^
segments.cpp:297:17: warning: unused variable 'b' [-Wunused-variable]
  ll q, w, e, a, b, c;
                 ^
segments.cpp:301: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 1400 KB Output is correct
3 Correct 10 ms 1656 KB Output is correct
4 Correct 10 ms 1528 KB Output is correct
5 Correct 18 ms 1656 KB Output is correct
6 Correct 23 ms 1656 KB Output is correct
7 Correct 37 ms 1528 KB Output is correct
8 Correct 78 ms 1656 KB Output is correct
9 Correct 84 ms 1656 KB Output is correct
10 Correct 34 ms 1656 KB Output is correct
11 Correct 34 ms 1656 KB Output is correct
12 Correct 34 ms 1656 KB Output is correct
13 Correct 36 ms 1752 KB Output is correct
14 Correct 91 ms 1528 KB Output is correct
15 Correct 9 ms 1528 KB Output is correct
16 Correct 20 ms 1528 KB Output is correct
17 Correct 65 ms 1528 KB Output is correct
18 Correct 57 ms 1660 KB Output is correct
19 Correct 79 ms 1528 KB Output is correct
20 Correct 90 ms 1528 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1765 ms 4780 KB Output is correct
2 Correct 1775 ms 5676 KB Output is correct
3 Correct 1752 ms 5520 KB Output is correct
4 Correct 1814 ms 5776 KB Output is correct
5 Correct 359 ms 7064 KB Output is correct
6 Correct 239 ms 7200 KB Output is correct
7 Correct 1757 ms 5400 KB Output is correct
8 Correct 1774 ms 5588 KB Output is correct
9 Correct 1751 ms 5536 KB Output is correct
10 Correct 1820 ms 4420 KB Output is correct
11 Correct 2281 ms 4468 KB Output is correct
12 Correct 1319 ms 6376 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 306 ms 2720 KB Output is correct
2 Correct 256 ms 2552 KB Output is correct
3 Correct 385 ms 2676 KB Output is correct
4 Correct 278 ms 2780 KB Output is correct
5 Correct 895 ms 5244 KB Output is correct
6 Correct 1127 ms 4704 KB Output is correct
7 Correct 1089 ms 4972 KB Output is correct
8 Correct 270 ms 6128 KB Output is correct
9 Correct 827 ms 6000 KB Output is correct
10 Correct 2681 ms 5196 KB Output is correct
11 Correct 1955 ms 3080 KB Output is correct
12 Correct 2480 ms 5288 KB Output is correct
13 Correct 2950 ms 4972 KB Output is correct
14 Correct 4173 ms 3880 KB Output is correct
15 Correct 3817 ms 3596 KB Output is correct
16 Correct 3465 ms 3400 KB Output is correct
17 Correct 1375 ms 4420 KB Output is correct
18 Correct 1364 ms 4392 KB Output is correct
19 Correct 1390 ms 4472 KB Output is correct
20 Correct 1389 ms 4528 KB Output is correct
21 Correct 2366 ms 3064 KB Output is correct
22 Correct 3852 ms 4048 KB Output is correct
23 Correct 3467 ms 4564 KB Output is correct
24 Correct 3789 ms 4180 KB Output is correct
25 Correct 380 ms 2612 KB Output is correct
26 Correct 343 ms 2680 KB Output is correct
27 Correct 306 ms 2680 KB Output is correct
28 Correct 293 ms 2552 KB Output is correct
29 Correct 3190 ms 4776 KB Output is correct
30 Correct 3213 ms 4700 KB Output is correct
31 Correct 785 ms 5996 KB Output is correct
32 Correct 2587 ms 5236 KB Output is correct
33 Correct 2795 ms 4848 KB Output is correct
34 Correct 3803 ms 3416 KB Output is correct
35 Correct 3363 ms 4308 KB Output is correct
36 Correct 2862 ms 4736 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 272 ms 2328 KB Output is correct
2 Correct 265 ms 3448 KB Output is correct
3 Correct 295 ms 3364 KB Output is correct
4 Correct 291 ms 3484 KB Output is correct
5 Correct 1159 ms 6496 KB Output is correct
6 Correct 1797 ms 4116 KB Output is correct
7 Correct 814 ms 6556 KB Output is correct
8 Correct 1840 ms 4224 KB Output is correct
9 Correct 4006 ms 4792 KB Output is correct
10 Correct 2317 ms 6276 KB Output is correct
11 Correct 3473 ms 3984 KB Output is correct
12 Correct 462 ms 7048 KB Output is correct
13 Correct 3054 ms 5848 KB Output is correct
14 Correct 3930 ms 4964 KB Output is correct
15 Correct 966 ms 7080 KB Output is correct
16 Correct 2764 ms 6092 KB Output is correct
17 Correct 1799 ms 5344 KB Output is correct
18 Correct 1773 ms 5212 KB Output is correct
19 Correct 1723 ms 5492 KB Output is correct
20 Correct 1774 ms 5480 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 1400 KB Output is correct
3 Correct 10 ms 1656 KB Output is correct
4 Correct 10 ms 1528 KB Output is correct
5 Correct 18 ms 1656 KB Output is correct
6 Correct 23 ms 1656 KB Output is correct
7 Correct 37 ms 1528 KB Output is correct
8 Correct 78 ms 1656 KB Output is correct
9 Correct 84 ms 1656 KB Output is correct
10 Correct 34 ms 1656 KB Output is correct
11 Correct 34 ms 1656 KB Output is correct
12 Correct 34 ms 1656 KB Output is correct
13 Correct 36 ms 1752 KB Output is correct
14 Correct 91 ms 1528 KB Output is correct
15 Correct 9 ms 1528 KB Output is correct
16 Correct 20 ms 1528 KB Output is correct
17 Correct 65 ms 1528 KB Output is correct
18 Correct 57 ms 1660 KB Output is correct
19 Correct 79 ms 1528 KB Output is correct
20 Correct 90 ms 1528 KB Output is correct
21 Correct 1765 ms 4780 KB Output is correct
22 Correct 1775 ms 5676 KB Output is correct
23 Correct 1752 ms 5520 KB Output is correct
24 Correct 1814 ms 5776 KB Output is correct
25 Correct 359 ms 7064 KB Output is correct
26 Correct 239 ms 7200 KB Output is correct
27 Correct 1757 ms 5400 KB Output is correct
28 Correct 1774 ms 5588 KB Output is correct
29 Correct 1751 ms 5536 KB Output is correct
30 Correct 1820 ms 4420 KB Output is correct
31 Correct 2281 ms 4468 KB Output is correct
32 Correct 1319 ms 6376 KB Output is correct
33 Correct 272 ms 2328 KB Output is correct
34 Correct 265 ms 3448 KB Output is correct
35 Correct 295 ms 3364 KB Output is correct
36 Correct 291 ms 3484 KB Output is correct
37 Correct 1159 ms 6496 KB Output is correct
38 Correct 1797 ms 4116 KB Output is correct
39 Correct 814 ms 6556 KB Output is correct
40 Correct 1840 ms 4224 KB Output is correct
41 Correct 4006 ms 4792 KB Output is correct
42 Correct 2317 ms 6276 KB Output is correct
43 Correct 3473 ms 3984 KB Output is correct
44 Correct 462 ms 7048 KB Output is correct
45 Correct 3054 ms 5848 KB Output is correct
46 Correct 3930 ms 4964 KB Output is correct
47 Correct 966 ms 7080 KB Output is correct
48 Correct 2764 ms 6092 KB Output is correct
49 Correct 1799 ms 5344 KB Output is correct
50 Correct 1773 ms 5212 KB Output is correct
51 Correct 1723 ms 5492 KB Output is correct
52 Correct 1774 ms 5480 KB Output is correct
53 Correct 293 ms 3556 KB Output is correct
54 Correct 294 ms 3608 KB Output is correct
55 Correct 285 ms 3772 KB Output is correct
56 Correct 275 ms 3576 KB Output is correct
57 Correct 2045 ms 4828 KB Output is correct
58 Correct 1597 ms 3784 KB Output is correct
59 Correct 1591 ms 5840 KB Output is correct
60 Correct 1585 ms 3708 KB Output is correct
61 Correct 3125 ms 5828 KB Output is correct
62 Correct 1221 ms 6912 KB Output is correct
63 Correct 832 ms 7140 KB Output is correct
64 Correct 1158 ms 6980 KB Output is correct
65 Correct 3786 ms 4244 KB Output is correct
66 Correct 3551 ms 4128 KB Output is correct
67 Correct 2851 ms 6016 KB Output is correct
68 Correct 3524 ms 4992 KB Output is correct
69 Correct 1772 ms 4968 KB Output is correct
70 Correct 1745 ms 5044 KB Output is correct
71 Correct 1752 ms 5012 KB Output is correct
72 Correct 1769 ms 4856 KB Output is correct
73 Correct 3972 ms 4060 KB Output is correct
74 Correct 3783 ms 5204 KB Output is correct
75 Correct 257 ms 6940 KB Output is correct
76 Correct 644 ms 7016 KB Output is correct
77 Correct 300 ms 3380 KB Output is correct
78 Correct 269 ms 3320 KB Output is correct
79 Correct 297 ms 3464 KB Output is correct
80 Correct 288 ms 3320 KB Output is correct
81 Correct 3716 ms 5124 KB Output is correct
82 Correct 4019 ms 4424 KB Output is correct
83 Correct 3423 ms 4012 KB Output is correct
84 Correct 3727 ms 5228 KB Output is correct
85 Correct 2777 ms 5832 KB Output is correct
86 Correct 2786 ms 5872 KB Output is correct
87 Correct 3928 ms 4900 KB Output is correct
88 Correct 3456 ms 3960 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 1400 KB Output is correct
3 Correct 10 ms 1656 KB Output is correct
4 Correct 10 ms 1528 KB Output is correct
5 Correct 18 ms 1656 KB Output is correct
6 Correct 23 ms 1656 KB Output is correct
7 Correct 37 ms 1528 KB Output is correct
8 Correct 78 ms 1656 KB Output is correct
9 Correct 84 ms 1656 KB Output is correct
10 Correct 34 ms 1656 KB Output is correct
11 Correct 34 ms 1656 KB Output is correct
12 Correct 34 ms 1656 KB Output is correct
13 Correct 36 ms 1752 KB Output is correct
14 Correct 91 ms 1528 KB Output is correct
15 Correct 9 ms 1528 KB Output is correct
16 Correct 20 ms 1528 KB Output is correct
17 Correct 65 ms 1528 KB Output is correct
18 Correct 57 ms 1660 KB Output is correct
19 Correct 79 ms 1528 KB Output is correct
20 Correct 90 ms 1528 KB Output is correct
21 Correct 1765 ms 4780 KB Output is correct
22 Correct 1775 ms 5676 KB Output is correct
23 Correct 1752 ms 5520 KB Output is correct
24 Correct 1814 ms 5776 KB Output is correct
25 Correct 359 ms 7064 KB Output is correct
26 Correct 239 ms 7200 KB Output is correct
27 Correct 1757 ms 5400 KB Output is correct
28 Correct 1774 ms 5588 KB Output is correct
29 Correct 1751 ms 5536 KB Output is correct
30 Correct 1820 ms 4420 KB Output is correct
31 Correct 2281 ms 4468 KB Output is correct
32 Correct 1319 ms 6376 KB Output is correct
33 Correct 306 ms 2720 KB Output is correct
34 Correct 256 ms 2552 KB Output is correct
35 Correct 385 ms 2676 KB Output is correct
36 Correct 278 ms 2780 KB Output is correct
37 Correct 895 ms 5244 KB Output is correct
38 Correct 1127 ms 4704 KB Output is correct
39 Correct 1089 ms 4972 KB Output is correct
40 Correct 270 ms 6128 KB Output is correct
41 Correct 827 ms 6000 KB Output is correct
42 Correct 2681 ms 5196 KB Output is correct
43 Correct 1955 ms 3080 KB Output is correct
44 Correct 2480 ms 5288 KB Output is correct
45 Correct 2950 ms 4972 KB Output is correct
46 Correct 4173 ms 3880 KB Output is correct
47 Correct 3817 ms 3596 KB Output is correct
48 Correct 3465 ms 3400 KB Output is correct
49 Correct 1375 ms 4420 KB Output is correct
50 Correct 1364 ms 4392 KB Output is correct
51 Correct 1390 ms 4472 KB Output is correct
52 Correct 1389 ms 4528 KB Output is correct
53 Correct 2366 ms 3064 KB Output is correct
54 Correct 3852 ms 4048 KB Output is correct
55 Correct 3467 ms 4564 KB Output is correct
56 Correct 3789 ms 4180 KB Output is correct
57 Correct 380 ms 2612 KB Output is correct
58 Correct 343 ms 2680 KB Output is correct
59 Correct 306 ms 2680 KB Output is correct
60 Correct 293 ms 2552 KB Output is correct
61 Correct 3190 ms 4776 KB Output is correct
62 Correct 3213 ms 4700 KB Output is correct
63 Correct 785 ms 5996 KB Output is correct
64 Correct 2587 ms 5236 KB Output is correct
65 Correct 2795 ms 4848 KB Output is correct
66 Correct 3803 ms 3416 KB Output is correct
67 Correct 3363 ms 4308 KB Output is correct
68 Correct 2862 ms 4736 KB Output is correct
69 Correct 272 ms 2328 KB Output is correct
70 Correct 265 ms 3448 KB Output is correct
71 Correct 295 ms 3364 KB Output is correct
72 Correct 291 ms 3484 KB Output is correct
73 Correct 1159 ms 6496 KB Output is correct
74 Correct 1797 ms 4116 KB Output is correct
75 Correct 814 ms 6556 KB Output is correct
76 Correct 1840 ms 4224 KB Output is correct
77 Correct 4006 ms 4792 KB Output is correct
78 Correct 2317 ms 6276 KB Output is correct
79 Correct 3473 ms 3984 KB Output is correct
80 Correct 462 ms 7048 KB Output is correct
81 Correct 3054 ms 5848 KB Output is correct
82 Correct 3930 ms 4964 KB Output is correct
83 Correct 966 ms 7080 KB Output is correct
84 Correct 2764 ms 6092 KB Output is correct
85 Correct 1799 ms 5344 KB Output is correct
86 Correct 1773 ms 5212 KB Output is correct
87 Correct 1723 ms 5492 KB Output is correct
88 Correct 1774 ms 5480 KB Output is correct
89 Correct 293 ms 3556 KB Output is correct
90 Correct 294 ms 3608 KB Output is correct
91 Correct 285 ms 3772 KB Output is correct
92 Correct 275 ms 3576 KB Output is correct
93 Correct 2045 ms 4828 KB Output is correct
94 Correct 1597 ms 3784 KB Output is correct
95 Correct 1591 ms 5840 KB Output is correct
96 Correct 1585 ms 3708 KB Output is correct
97 Correct 3125 ms 5828 KB Output is correct
98 Correct 1221 ms 6912 KB Output is correct
99 Correct 832 ms 7140 KB Output is correct
100 Correct 1158 ms 6980 KB Output is correct
101 Correct 3786 ms 4244 KB Output is correct
102 Correct 3551 ms 4128 KB Output is correct
103 Correct 2851 ms 6016 KB Output is correct
104 Correct 3524 ms 4992 KB Output is correct
105 Correct 1772 ms 4968 KB Output is correct
106 Correct 1745 ms 5044 KB Output is correct
107 Correct 1752 ms 5012 KB Output is correct
108 Correct 1769 ms 4856 KB Output is correct
109 Correct 3972 ms 4060 KB Output is correct
110 Correct 3783 ms 5204 KB Output is correct
111 Correct 257 ms 6940 KB Output is correct
112 Correct 644 ms 7016 KB Output is correct
113 Correct 300 ms 3380 KB Output is correct
114 Correct 269 ms 3320 KB Output is correct
115 Correct 297 ms 3464 KB Output is correct
116 Correct 288 ms 3320 KB Output is correct
117 Correct 3716 ms 5124 KB Output is correct
118 Correct 4019 ms 4424 KB Output is correct
119 Correct 3423 ms 4012 KB Output is correct
120 Correct 3727 ms 5228 KB Output is correct
121 Correct 2777 ms 5832 KB Output is correct
122 Correct 2786 ms 5872 KB Output is correct
123 Correct 3928 ms 4900 KB Output is correct
124 Correct 3456 ms 3960 KB Output is correct
125 Correct 851 ms 4724 KB Output is correct
126 Correct 960 ms 4804 KB Output is correct
127 Correct 997 ms 4792 KB Output is correct
128 Correct 893 ms 4812 KB Output is correct
129 Correct 824 ms 4772 KB Output is correct
130 Correct 925 ms 4660 KB Output is correct
131 Correct 4335 ms 5212 KB Output is correct
132 Execution timed out 5087 ms 7896 KB Time limit exceeded
133 Halted 0 ms 0 KB -