oj.uz

Submission #161344

# Submission time Handle Problem Language Result Execution time Memory
161344 2019-11-01T21:24:25 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 5000 ms 17412 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 = 310;
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 10 ms 2168 KB Output is correct
4 Correct 12 ms 2168 KB Output is correct
5 Correct 15 ms 2296 KB Output is correct
6 Correct 17 ms 2296 KB Output is correct
7 Correct 42 ms 2168 KB Output is correct
8 Correct 39 ms 2296 KB Output is correct
9 Correct 44 ms 2272 KB Output is correct
10 Correct 18 ms 2296 KB Output is correct
11 Correct 25 ms 2296 KB Output is correct
12 Correct 25 ms 2296 KB Output is correct
13 Correct 19 ms 2296 KB Output is correct
14 Correct 65 ms 2268 KB Output is correct
15 Correct 9 ms 2168 KB Output is correct
16 Correct 11 ms 2168 KB Output is correct
17 Correct 47 ms 2168 KB Output is correct
18 Correct 28 ms 2296 KB Output is correct
19 Correct 50 ms 2212 KB Output is correct
20 Correct 45 ms 2268 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1451 ms 7396 KB Output is correct
2 Correct 1539 ms 7472 KB Output is correct
3 Correct 1486 ms 7344 KB Output is correct
4 Correct 1435 ms 7508 KB Output is correct
5 Correct 360 ms 8588 KB Output is correct
6 Correct 227 ms 8700 KB Output is correct
7 Correct 1505 ms 7328 KB Output is correct
8 Correct 1516 ms 7348 KB Output is correct
9 Correct 1478 ms 7472 KB Output is correct
10 Correct 1288 ms 6444 KB Output is correct
11 Correct 1435 ms 6528 KB Output is correct
12 Correct 1129 ms 7964 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 5496 KB Output is correct
2 Correct 174 ms 5456 KB Output is correct
3 Correct 308 ms 5564 KB Output is correct
4 Correct 174 ms 5508 KB Output is correct
5 Correct 581 ms 7936 KB Output is correct
6 Correct 735 ms 7264 KB Output is correct
7 Correct 677 ms 7616 KB Output is correct
8 Correct 216 ms 8512 KB Output is correct
9 Correct 469 ms 9752 KB Output is correct
10 Correct 1282 ms 8412 KB Output is correct
11 Correct 883 ms 5692 KB Output is correct
12 Correct 1257 ms 8784 KB Output is correct
13 Correct 1397 ms 8148 KB Output is correct
14 Correct 1677 ms 6980 KB Output is correct
15 Correct 1660 ms 6716 KB Output is correct
16 Correct 1519 ms 6084 KB Output is correct
17 Correct 812 ms 6980 KB Output is correct
18 Correct 809 ms 6952 KB Output is correct
19 Correct 789 ms 6872 KB Output is correct
20 Correct 803 ms 6872 KB Output is correct
21 Correct 1056 ms 5772 KB Output is correct
22 Correct 1757 ms 7156 KB Output is correct
23 Correct 1617 ms 7652 KB Output is correct
24 Correct 1833 ms 7128 KB Output is correct
25 Correct 219 ms 5452 KB Output is correct
26 Correct 188 ms 5492 KB Output is correct
27 Correct 223 ms 5512 KB Output is correct
28 Correct 192 ms 5468 KB Output is correct
29 Correct 1506 ms 7936 KB Output is correct
30 Correct 1522 ms 8076 KB Output is correct
31 Correct 443 ms 9768 KB Output is correct
32 Correct 1254 ms 8396 KB Output is correct
33 Correct 1381 ms 8168 KB Output is correct
34 Correct 1835 ms 6672 KB Output is correct
35 Correct 1575 ms 7604 KB Output is correct
36 Correct 1289 ms 8484 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 171 ms 5524 KB Output is correct
2 Correct 177 ms 5716 KB Output is correct
3 Correct 177 ms 5608 KB Output is correct
4 Correct 193 ms 5652 KB Output is correct
5 Correct 958 ms 8184 KB Output is correct
6 Correct 1168 ms 6056 KB Output is correct
7 Correct 792 ms 8292 KB Output is correct
8 Correct 1451 ms 6212 KB Output is correct
9 Correct 1941 ms 7328 KB Output is correct
10 Correct 1317 ms 9012 KB Output is correct
11 Correct 1629 ms 6308 KB Output is correct
12 Correct 319 ms 9760 KB Output is correct
13 Correct 1599 ms 8336 KB Output is correct
14 Correct 1824 ms 7176 KB Output is correct
15 Correct 564 ms 9624 KB Output is correct
16 Correct 1486 ms 8428 KB Output is correct
17 Correct 1485 ms 7304 KB Output is correct
18 Correct 1512 ms 7216 KB Output is correct
19 Correct 1502 ms 7192 KB Output is correct
20 Correct 1472 ms 7332 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 10 ms 2168 KB Output is correct
4 Correct 12 ms 2168 KB Output is correct
5 Correct 15 ms 2296 KB Output is correct
6 Correct 17 ms 2296 KB Output is correct
7 Correct 42 ms 2168 KB Output is correct
8 Correct 39 ms 2296 KB Output is correct
9 Correct 44 ms 2272 KB Output is correct
10 Correct 18 ms 2296 KB Output is correct
11 Correct 25 ms 2296 KB Output is correct
12 Correct 25 ms 2296 KB Output is correct
13 Correct 19 ms 2296 KB Output is correct
14 Correct 65 ms 2268 KB Output is correct
15 Correct 9 ms 2168 KB Output is correct
16 Correct 11 ms 2168 KB Output is correct
17 Correct 47 ms 2168 KB Output is correct
18 Correct 28 ms 2296 KB Output is correct
19 Correct 50 ms 2212 KB Output is correct
20 Correct 45 ms 2268 KB Output is correct
21 Correct 1451 ms 7396 KB Output is correct
22 Correct 1539 ms 7472 KB Output is correct
23 Correct 1486 ms 7344 KB Output is correct
24 Correct 1435 ms 7508 KB Output is correct
25 Correct 360 ms 8588 KB Output is correct
26 Correct 227 ms 8700 KB Output is correct
27 Correct 1505 ms 7328 KB Output is correct
28 Correct 1516 ms 7348 KB Output is correct
29 Correct 1478 ms 7472 KB Output is correct
30 Correct 1288 ms 6444 KB Output is correct
31 Correct 1435 ms 6528 KB Output is correct
32 Correct 1129 ms 7964 KB Output is correct
33 Correct 171 ms 5524 KB Output is correct
34 Correct 177 ms 5716 KB Output is correct
35 Correct 177 ms 5608 KB Output is correct
36 Correct 193 ms 5652 KB Output is correct
37 Correct 958 ms 8184 KB Output is correct
38 Correct 1168 ms 6056 KB Output is correct
39 Correct 792 ms 8292 KB Output is correct
40 Correct 1451 ms 6212 KB Output is correct
41 Correct 1941 ms 7328 KB Output is correct
42 Correct 1317 ms 9012 KB Output is correct
43 Correct 1629 ms 6308 KB Output is correct
44 Correct 319 ms 9760 KB Output is correct
45 Correct 1599 ms 8336 KB Output is correct
46 Correct 1824 ms 7176 KB Output is correct
47 Correct 564 ms 9624 KB Output is correct
48 Correct 1486 ms 8428 KB Output is correct
49 Correct 1485 ms 7304 KB Output is correct
50 Correct 1512 ms 7216 KB Output is correct
51 Correct 1502 ms 7192 KB Output is correct
52 Correct 1472 ms 7332 KB Output is correct
53 Correct 197 ms 5756 KB Output is correct
54 Correct 202 ms 5732 KB Output is correct
55 Correct 173 ms 5648 KB Output is correct
56 Correct 183 ms 5712 KB Output is correct
57 Correct 1510 ms 6728 KB Output is correct
58 Correct 1034 ms 5940 KB Output is correct
59 Correct 1322 ms 7416 KB Output is correct
60 Correct 991 ms 5792 KB Output is correct
61 Correct 1653 ms 8344 KB Output is correct
62 Correct 732 ms 9652 KB Output is correct
63 Correct 433 ms 9880 KB Output is correct
64 Correct 690 ms 9668 KB Output is correct
65 Correct 1688 ms 6592 KB Output is correct
66 Correct 1604 ms 6280 KB Output is correct
67 Correct 1423 ms 8560 KB Output is correct
68 Correct 1756 ms 7712 KB Output is correct
69 Correct 1487 ms 7276 KB Output is correct
70 Correct 1487 ms 7168 KB Output is correct
71 Correct 1468 ms 7156 KB Output is correct
72 Correct 1552 ms 7080 KB Output is correct
73 Correct 1880 ms 6792 KB Output is correct
74 Correct 1922 ms 7696 KB Output is correct
75 Correct 205 ms 8968 KB Output is correct
76 Correct 432 ms 9892 KB Output is correct
77 Correct 186 ms 5844 KB Output is correct
78 Correct 176 ms 5684 KB Output is correct
79 Correct 196 ms 5740 KB Output is correct
80 Correct 188 ms 5640 KB Output is correct
81 Correct 1933 ms 7552 KB Output is correct
82 Correct 1864 ms 6852 KB Output is correct
83 Correct 1578 ms 6120 KB Output is correct
84 Correct 1903 ms 7656 KB Output is correct
85 Correct 1499 ms 8628 KB Output is correct
86 Correct 1365 ms 8816 KB Output is correct
87 Correct 1885 ms 7200 KB Output is correct
88 Correct 1572 ms 6260 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 10 ms 2168 KB Output is correct
4 Correct 12 ms 2168 KB Output is correct
5 Correct 15 ms 2296 KB Output is correct
6 Correct 17 ms 2296 KB Output is correct
7 Correct 42 ms 2168 KB Output is correct
8 Correct 39 ms 2296 KB Output is correct
9 Correct 44 ms 2272 KB Output is correct
10 Correct 18 ms 2296 KB Output is correct
11 Correct 25 ms 2296 KB Output is correct
12 Correct 25 ms 2296 KB Output is correct
13 Correct 19 ms 2296 KB Output is correct
14 Correct 65 ms 2268 KB Output is correct
15 Correct 9 ms 2168 KB Output is correct
16 Correct 11 ms 2168 KB Output is correct
17 Correct 47 ms 2168 KB Output is correct
18 Correct 28 ms 2296 KB Output is correct
19 Correct 50 ms 2212 KB Output is correct
20 Correct 45 ms 2268 KB Output is correct
21 Correct 1451 ms 7396 KB Output is correct
22 Correct 1539 ms 7472 KB Output is correct
23 Correct 1486 ms 7344 KB Output is correct
24 Correct 1435 ms 7508 KB Output is correct
25 Correct 360 ms 8588 KB Output is correct
26 Correct 227 ms 8700 KB Output is correct
27 Correct 1505 ms 7328 KB Output is correct
28 Correct 1516 ms 7348 KB Output is correct
29 Correct 1478 ms 7472 KB Output is correct
30 Correct 1288 ms 6444 KB Output is correct
31 Correct 1435 ms 6528 KB Output is correct
32 Correct 1129 ms 7964 KB Output is correct
33 Correct 207 ms 5496 KB Output is correct
34 Correct 174 ms 5456 KB Output is correct
35 Correct 308 ms 5564 KB Output is correct
36 Correct 174 ms 5508 KB Output is correct
37 Correct 581 ms 7936 KB Output is correct
38 Correct 735 ms 7264 KB Output is correct
39 Correct 677 ms 7616 KB Output is correct
40 Correct 216 ms 8512 KB Output is correct
41 Correct 469 ms 9752 KB Output is correct
42 Correct 1282 ms 8412 KB Output is correct
43 Correct 883 ms 5692 KB Output is correct
44 Correct 1257 ms 8784 KB Output is correct
45 Correct 1397 ms 8148 KB Output is correct
46 Correct 1677 ms 6980 KB Output is correct
47 Correct 1660 ms 6716 KB Output is correct
48 Correct 1519 ms 6084 KB Output is correct
49 Correct 812 ms 6980 KB Output is correct
50 Correct 809 ms 6952 KB Output is correct
51 Correct 789 ms 6872 KB Output is correct
52 Correct 803 ms 6872 KB Output is correct
53 Correct 1056 ms 5772 KB Output is correct
54 Correct 1757 ms 7156 KB Output is correct
55 Correct 1617 ms 7652 KB Output is correct
56 Correct 1833 ms 7128 KB Output is correct
57 Correct 219 ms 5452 KB Output is correct
58 Correct 188 ms 5492 KB Output is correct
59 Correct 223 ms 5512 KB Output is correct
60 Correct 192 ms 5468 KB Output is correct
61 Correct 1506 ms 7936 KB Output is correct
62 Correct 1522 ms 8076 KB Output is correct
63 Correct 443 ms 9768 KB Output is correct
64 Correct 1254 ms 8396 KB Output is correct
65 Correct 1381 ms 8168 KB Output is correct
66 Correct 1835 ms 6672 KB Output is correct
67 Correct 1575 ms 7604 KB Output is correct
68 Correct 1289 ms 8484 KB Output is correct
69 Correct 171 ms 5524 KB Output is correct
70 Correct 177 ms 5716 KB Output is correct
71 Correct 177 ms 5608 KB Output is correct
72 Correct 193 ms 5652 KB Output is correct
73 Correct 958 ms 8184 KB Output is correct
74 Correct 1168 ms 6056 KB Output is correct
75 Correct 792 ms 8292 KB Output is correct
76 Correct 1451 ms 6212 KB Output is correct
77 Correct 1941 ms 7328 KB Output is correct
78 Correct 1317 ms 9012 KB Output is correct
79 Correct 1629 ms 6308 KB Output is correct
80 Correct 319 ms 9760 KB Output is correct
81 Correct 1599 ms 8336 KB Output is correct
82 Correct 1824 ms 7176 KB Output is correct
83 Correct 564 ms 9624 KB Output is correct
84 Correct 1486 ms 8428 KB Output is correct
85 Correct 1485 ms 7304 KB Output is correct
86 Correct 1512 ms 7216 KB Output is correct
87 Correct 1502 ms 7192 KB Output is correct
88 Correct 1472 ms 7332 KB Output is correct
89 Correct 197 ms 5756 KB Output is correct
90 Correct 202 ms 5732 KB Output is correct
91 Correct 173 ms 5648 KB Output is correct
92 Correct 183 ms 5712 KB Output is correct
93 Correct 1510 ms 6728 KB Output is correct
94 Correct 1034 ms 5940 KB Output is correct
95 Correct 1322 ms 7416 KB Output is correct
96 Correct 991 ms 5792 KB Output is correct
97 Correct 1653 ms 8344 KB Output is correct
98 Correct 732 ms 9652 KB Output is correct
99 Correct 433 ms 9880 KB Output is correct
100 Correct 690 ms 9668 KB Output is correct
101 Correct 1688 ms 6592 KB Output is correct
102 Correct 1604 ms 6280 KB Output is correct
103 Correct 1423 ms 8560 KB Output is correct
104 Correct 1756 ms 7712 KB Output is correct
105 Correct 1487 ms 7276 KB Output is correct
106 Correct 1487 ms 7168 KB Output is correct
107 Correct 1468 ms 7156 KB Output is correct
108 Correct 1552 ms 7080 KB Output is correct
109 Correct 1880 ms 6792 KB Output is correct
110 Correct 1922 ms 7696 KB Output is correct
111 Correct 205 ms 8968 KB Output is correct
112 Correct 432 ms 9892 KB Output is correct
113 Correct 186 ms 5844 KB Output is correct
114 Correct 176 ms 5684 KB Output is correct
115 Correct 196 ms 5740 KB Output is correct
116 Correct 188 ms 5640 KB Output is correct
117 Correct 1933 ms 7552 KB Output is correct
118 Correct 1864 ms 6852 KB Output is correct
119 Correct 1578 ms 6120 KB Output is correct
120 Correct 1903 ms 7656 KB Output is correct
121 Correct 1499 ms 8628 KB Output is correct
122 Correct 1365 ms 8816 KB Output is correct
123 Correct 1885 ms 7200 KB Output is correct
124 Correct 1572 ms 6260 KB Output is correct
125 Correct 495 ms 9484 KB Output is correct
126 Correct 492 ms 9476 KB Output is correct
127 Correct 644 ms 9556 KB Output is correct
128 Correct 516 ms 9416 KB Output is correct
129 Correct 467 ms 9480 KB Output is correct
130 Correct 550 ms 9584 KB Output is correct
131 Correct 2913 ms 9904 KB Output is correct
132 Correct 4876 ms 12116 KB Output is correct
133 Correct 4162 ms 13784 KB Output is correct
134 Correct 3682 ms 10428 KB Output is correct
135 Correct 3750 ms 14012 KB Output is correct
136 Correct 1845 ms 9348 KB Output is correct
137 Correct 1867 ms 17412 KB Output is correct
138 Execution timed out 5082 ms 14384 KB Time limit exceeded
139 Halted 0 ms 0 KB -