oj.uz

Submission #161338

# Submission time Handle Problem Language Result Execution time Memory
161338 2019-11-01T21:12:23 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 5000 ms 13092 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 = 240;
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> segsl;
vector <ll> segsr;
 
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 mrgl() {
	ll i, j;
	vector <ll> ANS;
	while (i != segsl.size() && j != lasts.size()) {
		if (cmpl(segsl[i], lasts[j])) {
			ANS.pb(segsl[i]);
			i++;
		}
		else {
			ANS.pb(lasts[j]);
			j++;
		}
	}
	for (; i < segsl.size(); i++) {
		ANS.pb(segsl[i]);
	}
	for (; j < lasts.size(); j++) {
		ANS.pb(lasts[j]);
	}
	segsl = ANS;
}

inline void mrgr() {
	ll i, j;
	vector <ll> ANS;
	while (i != segsr.size() && j != lasts.size()) {
		if (cmpr(segsr[i], lasts[j])) {
			ANS.pb(segsr[i]);
			i++;
		}
		else {
			ANS.pb(lasts[j]);
			j++;
		}
	}
	for (; i < segsr.size(); i++) {
		ANS.pb(segsr[i]);
	}
	for (; j < lasts.size(); j++) {
		ANS.pb(lasts[j]);
	}
	segsr = ANS;
}
 
inline void rebuild() { 
	ll q, w;
	ll blocki = 0;
	for (q = 0; q < block; q++) {
		R[q].clear();
		L[q].clear();
	}
	sort(lasts.begin(), lasts.end(), cmpl);
	mrgl();
	// sort(segs.begin(), segs.end(), cmpl);
	for (auto p : segsl) {
		IL[p] = -1;
		if (used[p]) {
			continue;
		}
		if (L[blocki].size() > block_sz) {
			blocki++;
		}
		IL[p] = blocki;
		L[blocki].pb(p);
	}
	sort(lasts.begin(), lasts.end(), cmpr);
	mrgr();
	lasts.clear();
	blocki = 0;
	// sort(segs.begin(), segs.end(), cmpr);
	for (auto p: segsr) {
		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[ssz] = good;
	ll j = (lower_bound(L[i].begin(), L[i].end(), ssz, cmpsz) - L[i].begin());
	// 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[ssz] = good;
	ll j = (lower_bound(R[i].begin(), R[i].end(), ssz, 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;
		}
		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;
	// segsl.reserve(n);
	// segsr.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:74: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:85:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (w = 0; w < R[q].size(); w++) {
              ~~^~~~~~~~~~~~~
segments.cpp: In function 'void mrgl()':
segments.cpp:94:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while (i != segsl.size() && j != lasts.size()) {
         ~~^~~~~~~~~~~~~~~
segments.cpp:94:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while (i != segsl.size() && j != lasts.size()) {
                              ~~^~~~~~~~~~~~~~~
segments.cpp:104:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (; i < segsl.size(); i++) {
         ~~^~~~~~~~~~~~~~
segments.cpp:107:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (; j < lasts.size(); j++) {
         ~~^~~~~~~~~~~~~~
segments.cpp: In function 'void mrgr()':
segments.cpp:116:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while (i != segsr.size() && j != lasts.size()) {
         ~~^~~~~~~~~~~~~~~
segments.cpp:116:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while (i != segsr.size() && j != lasts.size()) {
                              ~~^~~~~~~~~~~~~~~
segments.cpp:126:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (; i < segsr.size(); i++) {
         ~~^~~~~~~~~~~~~~
segments.cpp:129:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (; j < lasts.size(); j++) {
         ~~^~~~~~~~~~~~~~
segments.cpp: In function 'void rebuild()':
segments.cpp:136:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'll slowL(ll, ll, ll)':
segments.cpp:204: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:215: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:292: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:332: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:347:5: warning: unused variable 'q' [-Wunused-variable]
  ll q, w;
     ^
segments.cpp:347:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'int main()':
segments.cpp:358:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w, e, a, b, c;
        ^
segments.cpp:358:11: warning: unused variable 'e' [-Wunused-variable]
  ll q, w, e, a, b, c;
           ^
segments.cpp:358:17: warning: unused variable 'b' [-Wunused-variable]
  ll q, w, e, a, b, c;
                 ^
segments.cpp:362:5: warning: unused variable 'nxt' [-Wunused-variable]
  ll nxt = 0;
     ^~~
segments.cpp: In function 'void rebuild()':
segments.cpp:129:11: warning: 'j' may be used uninitialized in this function [-Wmaybe-uninitialized]
  for (; j < lasts.size(); j++) {
         ~~^~~~~~~~~~~~~~
segments.cpp:114:8: note: 'j' was declared here
  ll i, j;
        ^
segments.cpp:116:11: warning: 'i' may be used uninitialized in this function [-Wmaybe-uninitialized]
  while (i != segsr.size() && j != lasts.size()) {
         ~~^~~~~~~~~~~~~~~
segments.cpp:114:5: note: 'i' was declared here
  ll i, j;
     ^
segments.cpp:107:11: warning: 'j' may be used uninitialized in this function [-Wmaybe-uninitialized]
  for (; j < lasts.size(); j++) {
         ~~^~~~~~~~~~~~~~
segments.cpp:92:8: note: 'j' was declared here
  ll i, j;
        ^
segments.cpp:94:11: warning: 'i' may be used uninitialized in this function [-Wmaybe-uninitialized]
  while (i != segsl.size() && j != lasts.size()) {
         ~~^~~~~~~~~~~~~~~
segments.cpp:92:5: note: 'i' was declared here
  ll i, j;
     ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1940 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 10 ms 2040 KB Output is correct
4 Correct 9 ms 2040 KB Output is correct
5 Correct 16 ms 2240 KB Output is correct
6 Correct 38 ms 2168 KB Output is correct
7 Correct 38 ms 2164 KB Output is correct
8 Correct 96 ms 2164 KB Output is correct
9 Correct 54 ms 2240 KB Output is correct
10 Correct 21 ms 2296 KB Output is correct
11 Correct 28 ms 2168 KB Output is correct
12 Correct 29 ms 2168 KB Output is correct
13 Correct 22 ms 2296 KB Output is correct
14 Correct 57 ms 2296 KB Output is correct
15 Correct 9 ms 2096 KB Output is correct
16 Correct 11 ms 2040 KB Output is correct
17 Correct 91 ms 2164 KB Output is correct
18 Correct 32 ms 2312 KB Output is correct
19 Correct 54 ms 2168 KB Output is correct
20 Correct 61 ms 2232 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1444 ms 4796 KB Output is correct
2 Correct 1458 ms 4660 KB Output is correct
3 Correct 1435 ms 4788 KB Output is correct
4 Correct 1430 ms 5000 KB Output is correct
5 Correct 358 ms 6472 KB Output is correct
6 Correct 223 ms 6568 KB Output is correct
7 Correct 1474 ms 4708 KB Output is correct
8 Correct 1462 ms 4644 KB Output is correct
9 Correct 1441 ms 4500 KB Output is correct
10 Correct 1376 ms 3280 KB Output is correct
11 Correct 1470 ms 3552 KB Output is correct
12 Correct 1096 ms 5344 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 203 ms 3556 KB Output is correct
2 Correct 165 ms 3372 KB Output is correct
3 Correct 295 ms 3504 KB Output is correct
4 Correct 219 ms 3548 KB Output is correct
5 Correct 595 ms 5464 KB Output is correct
6 Correct 749 ms 4848 KB Output is correct
7 Correct 711 ms 5252 KB Output is correct
8 Correct 216 ms 6244 KB Output is correct
9 Correct 509 ms 7592 KB Output is correct
10 Correct 1377 ms 6344 KB Output is correct
11 Correct 1038 ms 3772 KB Output is correct
12 Correct 1325 ms 6752 KB Output is correct
13 Correct 1543 ms 6252 KB Output is correct
14 Correct 1958 ms 4860 KB Output is correct
15 Correct 1950 ms 4984 KB Output is correct
16 Correct 1774 ms 4476 KB Output is correct
17 Correct 856 ms 4532 KB Output is correct
18 Correct 877 ms 4444 KB Output is correct
19 Correct 875 ms 4576 KB Output is correct
20 Correct 885 ms 4516 KB Output is correct
21 Correct 1249 ms 3860 KB Output is correct
22 Correct 2021 ms 5148 KB Output is correct
23 Correct 2003 ms 5572 KB Output is correct
24 Correct 1930 ms 5232 KB Output is correct
25 Correct 212 ms 3524 KB Output is correct
26 Correct 185 ms 3668 KB Output is correct
27 Correct 238 ms 3424 KB Output is correct
28 Correct 193 ms 3572 KB Output is correct
29 Correct 1698 ms 6096 KB Output is correct
30 Correct 1681 ms 6152 KB Output is correct
31 Correct 482 ms 7608 KB Output is correct
32 Correct 1372 ms 6344 KB Output is correct
33 Correct 1568 ms 6220 KB Output is correct
34 Correct 1911 ms 4744 KB Output is correct
35 Correct 1825 ms 5596 KB Output is correct
36 Correct 1450 ms 6360 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 171 ms 3496 KB Output is correct
2 Correct 174 ms 3560 KB Output is correct
3 Correct 177 ms 3392 KB Output is correct
4 Correct 252 ms 3420 KB Output is correct
5 Correct 925 ms 5664 KB Output is correct
6 Correct 1336 ms 3096 KB Output is correct
7 Correct 744 ms 5924 KB Output is correct
8 Correct 1410 ms 3420 KB Output is correct
9 Correct 2185 ms 5036 KB Output is correct
10 Correct 1346 ms 6944 KB Output is correct
11 Correct 2087 ms 4104 KB Output is correct
12 Correct 332 ms 6744 KB Output is correct
13 Correct 1719 ms 6188 KB Output is correct
14 Correct 2091 ms 4976 KB Output is correct
15 Correct 618 ms 7488 KB Output is correct
16 Correct 1603 ms 6340 KB Output is correct
17 Correct 1518 ms 4612 KB Output is correct
18 Correct 1471 ms 4508 KB Output is correct
19 Correct 1485 ms 4628 KB Output is correct
20 Correct 1462 ms 4492 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1940 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 10 ms 2040 KB Output is correct
4 Correct 9 ms 2040 KB Output is correct
5 Correct 16 ms 2240 KB Output is correct
6 Correct 38 ms 2168 KB Output is correct
7 Correct 38 ms 2164 KB Output is correct
8 Correct 96 ms 2164 KB Output is correct
9 Correct 54 ms 2240 KB Output is correct
10 Correct 21 ms 2296 KB Output is correct
11 Correct 28 ms 2168 KB Output is correct
12 Correct 29 ms 2168 KB Output is correct
13 Correct 22 ms 2296 KB Output is correct
14 Correct 57 ms 2296 KB Output is correct
15 Correct 9 ms 2096 KB Output is correct
16 Correct 11 ms 2040 KB Output is correct
17 Correct 91 ms 2164 KB Output is correct
18 Correct 32 ms 2312 KB Output is correct
19 Correct 54 ms 2168 KB Output is correct
20 Correct 61 ms 2232 KB Output is correct
21 Correct 1444 ms 4796 KB Output is correct
22 Correct 1458 ms 4660 KB Output is correct
23 Correct 1435 ms 4788 KB Output is correct
24 Correct 1430 ms 5000 KB Output is correct
25 Correct 358 ms 6472 KB Output is correct
26 Correct 223 ms 6568 KB Output is correct
27 Correct 1474 ms 4708 KB Output is correct
28 Correct 1462 ms 4644 KB Output is correct
29 Correct 1441 ms 4500 KB Output is correct
30 Correct 1376 ms 3280 KB Output is correct
31 Correct 1470 ms 3552 KB Output is correct
32 Correct 1096 ms 5344 KB Output is correct
33 Correct 171 ms 3496 KB Output is correct
34 Correct 174 ms 3560 KB Output is correct
35 Correct 177 ms 3392 KB Output is correct
36 Correct 252 ms 3420 KB Output is correct
37 Correct 925 ms 5664 KB Output is correct
38 Correct 1336 ms 3096 KB Output is correct
39 Correct 744 ms 5924 KB Output is correct
40 Correct 1410 ms 3420 KB Output is correct
41 Correct 2185 ms 5036 KB Output is correct
42 Correct 1346 ms 6944 KB Output is correct
43 Correct 2087 ms 4104 KB Output is correct
44 Correct 332 ms 6744 KB Output is correct
45 Correct 1719 ms 6188 KB Output is correct
46 Correct 2091 ms 4976 KB Output is correct
47 Correct 618 ms 7488 KB Output is correct
48 Correct 1603 ms 6340 KB Output is correct
49 Correct 1518 ms 4612 KB Output is correct
50 Correct 1471 ms 4508 KB Output is correct
51 Correct 1485 ms 4628 KB Output is correct
52 Correct 1462 ms 4492 KB Output is correct
53 Correct 205 ms 3564 KB Output is correct
54 Correct 200 ms 3600 KB Output is correct
55 Correct 169 ms 3384 KB Output is correct
56 Correct 177 ms 3556 KB Output is correct
57 Correct 1530 ms 3928 KB Output is correct
58 Correct 1129 ms 2804 KB Output is correct
59 Correct 1305 ms 4968 KB Output is correct
60 Correct 1099 ms 2772 KB Output is correct
61 Correct 1794 ms 6188 KB Output is correct
62 Correct 757 ms 7392 KB Output is correct
63 Correct 443 ms 7452 KB Output is correct
64 Correct 724 ms 7464 KB Output is correct
65 Correct 1965 ms 4484 KB Output is correct
66 Correct 1917 ms 4336 KB Output is correct
67 Correct 1533 ms 6428 KB Output is correct
68 Correct 1940 ms 5688 KB Output is correct
69 Correct 1462 ms 4444 KB Output is correct
70 Correct 1544 ms 4448 KB Output is correct
71 Correct 1507 ms 4608 KB Output is correct
72 Correct 1469 ms 4492 KB Output is correct
73 Correct 2114 ms 4672 KB Output is correct
74 Correct 2051 ms 5556 KB Output is correct
75 Correct 268 ms 6472 KB Output is correct
76 Correct 412 ms 7500 KB Output is correct
77 Correct 182 ms 3500 KB Output is correct
78 Correct 172 ms 3432 KB Output is correct
79 Correct 196 ms 3500 KB Output is correct
80 Correct 185 ms 3636 KB Output is correct
81 Correct 2052 ms 5492 KB Output is correct
82 Correct 2110 ms 4720 KB Output is correct
83 Correct 1785 ms 4148 KB Output is correct
84 Correct 2024 ms 5456 KB Output is correct
85 Correct 1550 ms 6260 KB Output is correct
86 Correct 1495 ms 6652 KB Output is correct
87 Correct 2067 ms 5092 KB Output is correct
88 Correct 1771 ms 4212 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1940 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 10 ms 2040 KB Output is correct
4 Correct 9 ms 2040 KB Output is correct
5 Correct 16 ms 2240 KB Output is correct
6 Correct 38 ms 2168 KB Output is correct
7 Correct 38 ms 2164 KB Output is correct
8 Correct 96 ms 2164 KB Output is correct
9 Correct 54 ms 2240 KB Output is correct
10 Correct 21 ms 2296 KB Output is correct
11 Correct 28 ms 2168 KB Output is correct
12 Correct 29 ms 2168 KB Output is correct
13 Correct 22 ms 2296 KB Output is correct
14 Correct 57 ms 2296 KB Output is correct
15 Correct 9 ms 2096 KB Output is correct
16 Correct 11 ms 2040 KB Output is correct
17 Correct 91 ms 2164 KB Output is correct
18 Correct 32 ms 2312 KB Output is correct
19 Correct 54 ms 2168 KB Output is correct
20 Correct 61 ms 2232 KB Output is correct
21 Correct 1444 ms 4796 KB Output is correct
22 Correct 1458 ms 4660 KB Output is correct
23 Correct 1435 ms 4788 KB Output is correct
24 Correct 1430 ms 5000 KB Output is correct
25 Correct 358 ms 6472 KB Output is correct
26 Correct 223 ms 6568 KB Output is correct
27 Correct 1474 ms 4708 KB Output is correct
28 Correct 1462 ms 4644 KB Output is correct
29 Correct 1441 ms 4500 KB Output is correct
30 Correct 1376 ms 3280 KB Output is correct
31 Correct 1470 ms 3552 KB Output is correct
32 Correct 1096 ms 5344 KB Output is correct
33 Correct 203 ms 3556 KB Output is correct
34 Correct 165 ms 3372 KB Output is correct
35 Correct 295 ms 3504 KB Output is correct
36 Correct 219 ms 3548 KB Output is correct
37 Correct 595 ms 5464 KB Output is correct
38 Correct 749 ms 4848 KB Output is correct
39 Correct 711 ms 5252 KB Output is correct
40 Correct 216 ms 6244 KB Output is correct
41 Correct 509 ms 7592 KB Output is correct
42 Correct 1377 ms 6344 KB Output is correct
43 Correct 1038 ms 3772 KB Output is correct
44 Correct 1325 ms 6752 KB Output is correct
45 Correct 1543 ms 6252 KB Output is correct
46 Correct 1958 ms 4860 KB Output is correct
47 Correct 1950 ms 4984 KB Output is correct
48 Correct 1774 ms 4476 KB Output is correct
49 Correct 856 ms 4532 KB Output is correct
50 Correct 877 ms 4444 KB Output is correct
51 Correct 875 ms 4576 KB Output is correct
52 Correct 885 ms 4516 KB Output is correct
53 Correct 1249 ms 3860 KB Output is correct
54 Correct 2021 ms 5148 KB Output is correct
55 Correct 2003 ms 5572 KB Output is correct
56 Correct 1930 ms 5232 KB Output is correct
57 Correct 212 ms 3524 KB Output is correct
58 Correct 185 ms 3668 KB Output is correct
59 Correct 238 ms 3424 KB Output is correct
60 Correct 193 ms 3572 KB Output is correct
61 Correct 1698 ms 6096 KB Output is correct
62 Correct 1681 ms 6152 KB Output is correct
63 Correct 482 ms 7608 KB Output is correct
64 Correct 1372 ms 6344 KB Output is correct
65 Correct 1568 ms 6220 KB Output is correct
66 Correct 1911 ms 4744 KB Output is correct
67 Correct 1825 ms 5596 KB Output is correct
68 Correct 1450 ms 6360 KB Output is correct
69 Correct 171 ms 3496 KB Output is correct
70 Correct 174 ms 3560 KB Output is correct
71 Correct 177 ms 3392 KB Output is correct
72 Correct 252 ms 3420 KB Output is correct
73 Correct 925 ms 5664 KB Output is correct
74 Correct 1336 ms 3096 KB Output is correct
75 Correct 744 ms 5924 KB Output is correct
76 Correct 1410 ms 3420 KB Output is correct
77 Correct 2185 ms 5036 KB Output is correct
78 Correct 1346 ms 6944 KB Output is correct
79 Correct 2087 ms 4104 KB Output is correct
80 Correct 332 ms 6744 KB Output is correct
81 Correct 1719 ms 6188 KB Output is correct
82 Correct 2091 ms 4976 KB Output is correct
83 Correct 618 ms 7488 KB Output is correct
84 Correct 1603 ms 6340 KB Output is correct
85 Correct 1518 ms 4612 KB Output is correct
86 Correct 1471 ms 4508 KB Output is correct
87 Correct 1485 ms 4628 KB Output is correct
88 Correct 1462 ms 4492 KB Output is correct
89 Correct 205 ms 3564 KB Output is correct
90 Correct 200 ms 3600 KB Output is correct
91 Correct 169 ms 3384 KB Output is correct
92 Correct 177 ms 3556 KB Output is correct
93 Correct 1530 ms 3928 KB Output is correct
94 Correct 1129 ms 2804 KB Output is correct
95 Correct 1305 ms 4968 KB Output is correct
96 Correct 1099 ms 2772 KB Output is correct
97 Correct 1794 ms 6188 KB Output is correct
98 Correct 757 ms 7392 KB Output is correct
99 Correct 443 ms 7452 KB Output is correct
100 Correct 724 ms 7464 KB Output is correct
101 Correct 1965 ms 4484 KB Output is correct
102 Correct 1917 ms 4336 KB Output is correct
103 Correct 1533 ms 6428 KB Output is correct
104 Correct 1940 ms 5688 KB Output is correct
105 Correct 1462 ms 4444 KB Output is correct
106 Correct 1544 ms 4448 KB Output is correct
107 Correct 1507 ms 4608 KB Output is correct
108 Correct 1469 ms 4492 KB Output is correct
109 Correct 2114 ms 4672 KB Output is correct
110 Correct 2051 ms 5556 KB Output is correct
111 Correct 268 ms 6472 KB Output is correct
112 Correct 412 ms 7500 KB Output is correct
113 Correct 182 ms 3500 KB Output is correct
114 Correct 172 ms 3432 KB Output is correct
115 Correct 196 ms 3500 KB Output is correct
116 Correct 185 ms 3636 KB Output is correct
117 Correct 2052 ms 5492 KB Output is correct
118 Correct 2110 ms 4720 KB Output is correct
119 Correct 1785 ms 4148 KB Output is correct
120 Correct 2024 ms 5456 KB Output is correct
121 Correct 1550 ms 6260 KB Output is correct
122 Correct 1495 ms 6652 KB Output is correct
123 Correct 2067 ms 5092 KB Output is correct
124 Correct 1771 ms 4212 KB Output is correct
125 Correct 571 ms 5340 KB Output is correct
126 Correct 476 ms 5232 KB Output is correct
127 Correct 625 ms 5324 KB Output is correct
128 Correct 497 ms 5328 KB Output is correct
129 Correct 419 ms 5240 KB Output is correct
130 Correct 529 ms 5264 KB Output is correct
131 Correct 3267 ms 3956 KB Output is correct
132 Correct 4674 ms 6668 KB Output is correct
133 Correct 3759 ms 8588 KB Output is correct
134 Correct 3789 ms 4496 KB Output is correct
135 Correct 3393 ms 8988 KB Output is correct
136 Correct 2000 ms 3088 KB Output is correct
137 Correct 2012 ms 13092 KB Output is correct
138 Execution timed out 5012 ms 10068 KB Time limit exceeded
139 Halted 0 ms 0 KB -