oj.uz

Submission #161352

# Submission time Handle Problem Language Result Execution time Memory
161352 2019-11-01T21:34:03 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 5000 ms 14640 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;
const ll block = 285;
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 1912 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 9 ms 2040 KB Output is correct
4 Correct 9 ms 2168 KB Output is correct
5 Correct 15 ms 2296 KB Output is correct
6 Correct 18 ms 2168 KB Output is correct
7 Correct 40 ms 2168 KB Output is correct
8 Correct 44 ms 2168 KB Output is correct
9 Correct 45 ms 2232 KB Output is correct
10 Correct 19 ms 2296 KB Output is correct
11 Correct 26 ms 2168 KB Output is correct
12 Correct 26 ms 2172 KB Output is correct
13 Correct 20 ms 2300 KB Output is correct
14 Correct 48 ms 2168 KB Output is correct
15 Correct 10 ms 2168 KB Output is correct
16 Correct 13 ms 2168 KB Output is correct
17 Correct 48 ms 2168 KB Output is correct
18 Correct 29 ms 2168 KB Output is correct
19 Correct 53 ms 2168 KB Output is correct
20 Correct 49 ms 2168 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1455 ms 5320 KB Output is correct
2 Correct 1478 ms 5476 KB Output is correct
3 Correct 1475 ms 5448 KB Output is correct
4 Correct 1395 ms 5560 KB Output is correct
5 Correct 336 ms 7160 KB Output is correct
6 Correct 283 ms 7160 KB Output is correct
7 Correct 1522 ms 5260 KB Output is correct
8 Correct 1516 ms 5372 KB Output is correct
9 Correct 1489 ms 5376 KB Output is correct
10 Correct 1336 ms 4320 KB Output is correct
11 Correct 1456 ms 4536 KB Output is correct
12 Correct 1114 ms 6320 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 205 ms 4352 KB Output is correct
2 Correct 166 ms 4332 KB Output is correct
3 Correct 299 ms 4376 KB Output is correct
4 Correct 172 ms 4324 KB Output is correct
5 Correct 587 ms 6324 KB Output is correct
6 Correct 745 ms 5564 KB Output is correct
7 Correct 940 ms 6152 KB Output is correct
8 Correct 211 ms 7260 KB Output is correct
9 Correct 509 ms 8464 KB Output is correct
10 Correct 1326 ms 7316 KB Output is correct
11 Correct 951 ms 4812 KB Output is correct
12 Correct 1238 ms 7592 KB Output is correct
13 Correct 1439 ms 7196 KB Output is correct
14 Correct 1748 ms 5868 KB Output is correct
15 Correct 1760 ms 5744 KB Output is correct
16 Correct 1616 ms 5144 KB Output is correct
17 Correct 822 ms 5708 KB Output is correct
18 Correct 961 ms 5800 KB Output is correct
19 Correct 817 ms 5780 KB Output is correct
20 Correct 871 ms 5772 KB Output is correct
21 Correct 1113 ms 4864 KB Output is correct
22 Correct 1804 ms 6016 KB Output is correct
23 Correct 1650 ms 6764 KB Output is correct
24 Correct 1761 ms 6192 KB Output is correct
25 Correct 213 ms 4288 KB Output is correct
26 Correct 178 ms 4340 KB Output is correct
27 Correct 211 ms 4252 KB Output is correct
28 Correct 187 ms 4208 KB Output is correct
29 Correct 1592 ms 7192 KB Output is correct
30 Correct 1623 ms 6968 KB Output is correct
31 Correct 460 ms 8800 KB Output is correct
32 Correct 1297 ms 7396 KB Output is correct
33 Correct 1418 ms 7212 KB Output is correct
34 Correct 1719 ms 5616 KB Output is correct
35 Correct 1658 ms 6628 KB Output is correct
36 Correct 1325 ms 7268 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 170 ms 4588 KB Output is correct
2 Correct 174 ms 4588 KB Output is correct
3 Correct 177 ms 4520 KB Output is correct
4 Correct 203 ms 4504 KB Output is correct
5 Correct 932 ms 7168 KB Output is correct
6 Correct 1194 ms 5556 KB Output is correct
7 Correct 735 ms 7980 KB Output is correct
8 Correct 1367 ms 5832 KB Output is correct
9 Correct 2009 ms 6948 KB Output is correct
10 Correct 1287 ms 8860 KB Output is correct
11 Correct 1733 ms 6016 KB Output is correct
12 Correct 330 ms 9708 KB Output is correct
13 Correct 1619 ms 8248 KB Output is correct
14 Correct 1928 ms 7076 KB Output is correct
15 Correct 587 ms 9592 KB Output is correct
16 Correct 1647 ms 8328 KB Output is correct
17 Correct 1533 ms 7184 KB Output is correct
18 Correct 1526 ms 7076 KB Output is correct
19 Correct 1536 ms 7100 KB Output is correct
20 Correct 1715 ms 7264 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1912 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 9 ms 2040 KB Output is correct
4 Correct 9 ms 2168 KB Output is correct
5 Correct 15 ms 2296 KB Output is correct
6 Correct 18 ms 2168 KB Output is correct
7 Correct 40 ms 2168 KB Output is correct
8 Correct 44 ms 2168 KB Output is correct
9 Correct 45 ms 2232 KB Output is correct
10 Correct 19 ms 2296 KB Output is correct
11 Correct 26 ms 2168 KB Output is correct
12 Correct 26 ms 2172 KB Output is correct
13 Correct 20 ms 2300 KB Output is correct
14 Correct 48 ms 2168 KB Output is correct
15 Correct 10 ms 2168 KB Output is correct
16 Correct 13 ms 2168 KB Output is correct
17 Correct 48 ms 2168 KB Output is correct
18 Correct 29 ms 2168 KB Output is correct
19 Correct 53 ms 2168 KB Output is correct
20 Correct 49 ms 2168 KB Output is correct
21 Correct 1455 ms 5320 KB Output is correct
22 Correct 1478 ms 5476 KB Output is correct
23 Correct 1475 ms 5448 KB Output is correct
24 Correct 1395 ms 5560 KB Output is correct
25 Correct 336 ms 7160 KB Output is correct
26 Correct 283 ms 7160 KB Output is correct
27 Correct 1522 ms 5260 KB Output is correct
28 Correct 1516 ms 5372 KB Output is correct
29 Correct 1489 ms 5376 KB Output is correct
30 Correct 1336 ms 4320 KB Output is correct
31 Correct 1456 ms 4536 KB Output is correct
32 Correct 1114 ms 6320 KB Output is correct
33 Correct 170 ms 4588 KB Output is correct
34 Correct 174 ms 4588 KB Output is correct
35 Correct 177 ms 4520 KB Output is correct
36 Correct 203 ms 4504 KB Output is correct
37 Correct 932 ms 7168 KB Output is correct
38 Correct 1194 ms 5556 KB Output is correct
39 Correct 735 ms 7980 KB Output is correct
40 Correct 1367 ms 5832 KB Output is correct
41 Correct 2009 ms 6948 KB Output is correct
42 Correct 1287 ms 8860 KB Output is correct
43 Correct 1733 ms 6016 KB Output is correct
44 Correct 330 ms 9708 KB Output is correct
45 Correct 1619 ms 8248 KB Output is correct
46 Correct 1928 ms 7076 KB Output is correct
47 Correct 587 ms 9592 KB Output is correct
48 Correct 1647 ms 8328 KB Output is correct
49 Correct 1533 ms 7184 KB Output is correct
50 Correct 1526 ms 7076 KB Output is correct
51 Correct 1536 ms 7100 KB Output is correct
52 Correct 1715 ms 7264 KB Output is correct
53 Correct 196 ms 5432 KB Output is correct
54 Correct 212 ms 5436 KB Output is correct
55 Correct 171 ms 5380 KB Output is correct
56 Correct 185 ms 5284 KB Output is correct
57 Correct 1548 ms 6508 KB Output is correct
58 Correct 1055 ms 5480 KB Output is correct
59 Correct 1299 ms 7248 KB Output is correct
60 Correct 1006 ms 5440 KB Output is correct
61 Correct 1678 ms 8068 KB Output is correct
62 Correct 740 ms 9472 KB Output is correct
63 Correct 436 ms 9568 KB Output is correct
64 Correct 709 ms 9532 KB Output is correct
65 Correct 1778 ms 6720 KB Output is correct
66 Correct 1700 ms 5988 KB Output is correct
67 Correct 1483 ms 7740 KB Output is correct
68 Correct 1770 ms 6588 KB Output is correct
69 Correct 1464 ms 5568 KB Output is correct
70 Correct 1475 ms 5592 KB Output is correct
71 Correct 1543 ms 5560 KB Output is correct
72 Correct 1551 ms 5616 KB Output is correct
73 Correct 1955 ms 5832 KB Output is correct
74 Correct 1926 ms 6608 KB Output is correct
75 Correct 179 ms 7384 KB Output is correct
76 Correct 419 ms 8772 KB Output is correct
77 Correct 183 ms 4768 KB Output is correct
78 Correct 188 ms 4820 KB Output is correct
79 Correct 197 ms 4716 KB Output is correct
80 Correct 180 ms 4756 KB Output is correct
81 Correct 1923 ms 6752 KB Output is correct
82 Correct 1986 ms 6028 KB Output is correct
83 Correct 1632 ms 5364 KB Output is correct
84 Correct 1894 ms 6688 KB Output is correct
85 Correct 1471 ms 7712 KB Output is correct
86 Correct 1435 ms 7928 KB Output is correct
87 Correct 1924 ms 6376 KB Output is correct
88 Correct 1604 ms 5380 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1912 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 9 ms 2040 KB Output is correct
4 Correct 9 ms 2168 KB Output is correct
5 Correct 15 ms 2296 KB Output is correct
6 Correct 18 ms 2168 KB Output is correct
7 Correct 40 ms 2168 KB Output is correct
8 Correct 44 ms 2168 KB Output is correct
9 Correct 45 ms 2232 KB Output is correct
10 Correct 19 ms 2296 KB Output is correct
11 Correct 26 ms 2168 KB Output is correct
12 Correct 26 ms 2172 KB Output is correct
13 Correct 20 ms 2300 KB Output is correct
14 Correct 48 ms 2168 KB Output is correct
15 Correct 10 ms 2168 KB Output is correct
16 Correct 13 ms 2168 KB Output is correct
17 Correct 48 ms 2168 KB Output is correct
18 Correct 29 ms 2168 KB Output is correct
19 Correct 53 ms 2168 KB Output is correct
20 Correct 49 ms 2168 KB Output is correct
21 Correct 1455 ms 5320 KB Output is correct
22 Correct 1478 ms 5476 KB Output is correct
23 Correct 1475 ms 5448 KB Output is correct
24 Correct 1395 ms 5560 KB Output is correct
25 Correct 336 ms 7160 KB Output is correct
26 Correct 283 ms 7160 KB Output is correct
27 Correct 1522 ms 5260 KB Output is correct
28 Correct 1516 ms 5372 KB Output is correct
29 Correct 1489 ms 5376 KB Output is correct
30 Correct 1336 ms 4320 KB Output is correct
31 Correct 1456 ms 4536 KB Output is correct
32 Correct 1114 ms 6320 KB Output is correct
33 Correct 205 ms 4352 KB Output is correct
34 Correct 166 ms 4332 KB Output is correct
35 Correct 299 ms 4376 KB Output is correct
36 Correct 172 ms 4324 KB Output is correct
37 Correct 587 ms 6324 KB Output is correct
38 Correct 745 ms 5564 KB Output is correct
39 Correct 940 ms 6152 KB Output is correct
40 Correct 211 ms 7260 KB Output is correct
41 Correct 509 ms 8464 KB Output is correct
42 Correct 1326 ms 7316 KB Output is correct
43 Correct 951 ms 4812 KB Output is correct
44 Correct 1238 ms 7592 KB Output is correct
45 Correct 1439 ms 7196 KB Output is correct
46 Correct 1748 ms 5868 KB Output is correct
47 Correct 1760 ms 5744 KB Output is correct
48 Correct 1616 ms 5144 KB Output is correct
49 Correct 822 ms 5708 KB Output is correct
50 Correct 961 ms 5800 KB Output is correct
51 Correct 817 ms 5780 KB Output is correct
52 Correct 871 ms 5772 KB Output is correct
53 Correct 1113 ms 4864 KB Output is correct
54 Correct 1804 ms 6016 KB Output is correct
55 Correct 1650 ms 6764 KB Output is correct
56 Correct 1761 ms 6192 KB Output is correct
57 Correct 213 ms 4288 KB Output is correct
58 Correct 178 ms 4340 KB Output is correct
59 Correct 211 ms 4252 KB Output is correct
60 Correct 187 ms 4208 KB Output is correct
61 Correct 1592 ms 7192 KB Output is correct
62 Correct 1623 ms 6968 KB Output is correct
63 Correct 460 ms 8800 KB Output is correct
64 Correct 1297 ms 7396 KB Output is correct
65 Correct 1418 ms 7212 KB Output is correct
66 Correct 1719 ms 5616 KB Output is correct
67 Correct 1658 ms 6628 KB Output is correct
68 Correct 1325 ms 7268 KB Output is correct
69 Correct 170 ms 4588 KB Output is correct
70 Correct 174 ms 4588 KB Output is correct
71 Correct 177 ms 4520 KB Output is correct
72 Correct 203 ms 4504 KB Output is correct
73 Correct 932 ms 7168 KB Output is correct
74 Correct 1194 ms 5556 KB Output is correct
75 Correct 735 ms 7980 KB Output is correct
76 Correct 1367 ms 5832 KB Output is correct
77 Correct 2009 ms 6948 KB Output is correct
78 Correct 1287 ms 8860 KB Output is correct
79 Correct 1733 ms 6016 KB Output is correct
80 Correct 330 ms 9708 KB Output is correct
81 Correct 1619 ms 8248 KB Output is correct
82 Correct 1928 ms 7076 KB Output is correct
83 Correct 587 ms 9592 KB Output is correct
84 Correct 1647 ms 8328 KB Output is correct
85 Correct 1533 ms 7184 KB Output is correct
86 Correct 1526 ms 7076 KB Output is correct
87 Correct 1536 ms 7100 KB Output is correct
88 Correct 1715 ms 7264 KB Output is correct
89 Correct 196 ms 5432 KB Output is correct
90 Correct 212 ms 5436 KB Output is correct
91 Correct 171 ms 5380 KB Output is correct
92 Correct 185 ms 5284 KB Output is correct
93 Correct 1548 ms 6508 KB Output is correct
94 Correct 1055 ms 5480 KB Output is correct
95 Correct 1299 ms 7248 KB Output is correct
96 Correct 1006 ms 5440 KB Output is correct
97 Correct 1678 ms 8068 KB Output is correct
98 Correct 740 ms 9472 KB Output is correct
99 Correct 436 ms 9568 KB Output is correct
100 Correct 709 ms 9532 KB Output is correct
101 Correct 1778 ms 6720 KB Output is correct
102 Correct 1700 ms 5988 KB Output is correct
103 Correct 1483 ms 7740 KB Output is correct
104 Correct 1770 ms 6588 KB Output is correct
105 Correct 1464 ms 5568 KB Output is correct
106 Correct 1475 ms 5592 KB Output is correct
107 Correct 1543 ms 5560 KB Output is correct
108 Correct 1551 ms 5616 KB Output is correct
109 Correct 1955 ms 5832 KB Output is correct
110 Correct 1926 ms 6608 KB Output is correct
111 Correct 179 ms 7384 KB Output is correct
112 Correct 419 ms 8772 KB Output is correct
113 Correct 183 ms 4768 KB Output is correct
114 Correct 188 ms 4820 KB Output is correct
115 Correct 197 ms 4716 KB Output is correct
116 Correct 180 ms 4756 KB Output is correct
117 Correct 1923 ms 6752 KB Output is correct
118 Correct 1986 ms 6028 KB Output is correct
119 Correct 1632 ms 5364 KB Output is correct
120 Correct 1894 ms 6688 KB Output is correct
121 Correct 1471 ms 7712 KB Output is correct
122 Correct 1435 ms 7928 KB Output is correct
123 Correct 1924 ms 6376 KB Output is correct
124 Correct 1604 ms 5380 KB Output is correct
125 Correct 462 ms 6572 KB Output is correct
126 Correct 500 ms 6620 KB Output is correct
127 Correct 673 ms 6700 KB Output is correct
128 Correct 518 ms 6632 KB Output is correct
129 Correct 455 ms 6576 KB Output is correct
130 Correct 568 ms 6616 KB Output is correct
131 Correct 2965 ms 6016 KB Output is correct
132 Correct 4881 ms 8816 KB Output is correct
133 Correct 4075 ms 10592 KB Output is correct
134 Correct 3783 ms 6648 KB Output is correct
135 Correct 3571 ms 11020 KB Output is correct
136 Correct 1774 ms 5132 KB Output is correct
137 Correct 1871 ms 14640 KB Output is correct
138 Correct 4924 ms 11476 KB Output is correct
139 Correct 3666 ms 12756 KB Output is correct
140 Correct 2529 ms 13636 KB Output is correct
141 Correct 4664 ms 11824 KB Output is correct
142 Correct 2977 ms 6932 KB Output is correct
143 Correct 4492 ms 7956 KB Output is correct
144 Correct 2063 ms 6796 KB Output is correct
145 Correct 2376 ms 13688 KB Output is correct
146 Correct 4940 ms 9024 KB Output is correct
147 Correct 4637 ms 7648 KB Output is correct
148 Correct 4520 ms 7752 KB Output is correct
149 Correct 4698 ms 7940 KB Output is correct
150 Correct 4598 ms 8032 KB Output is correct
151 Correct 4550 ms 7960 KB Output is correct
152 Correct 4530 ms 7336 KB Output is correct
153 Correct 4560 ms 7544 KB Output is correct
154 Correct 4620 ms 7304 KB Output is correct
155 Correct 3866 ms 6248 KB Output is correct
156 Execution timed out 5001 ms 7152 KB Time limit exceeded
157 Halted 0 ms 0 KB -