oj.uz

Submission #161337

# Submission time Handle Problem Language Result Execution time Memory
161337 2019-11-01T21:12:10 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 5000 ms 12996 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 = 220;
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 2040 KB Output is correct
4 Correct 10 ms 2040 KB Output is correct
5 Correct 16 ms 2296 KB Output is correct
6 Correct 20 ms 2228 KB Output is correct
7 Correct 37 ms 2168 KB Output is correct
8 Correct 51 ms 2236 KB Output is correct
9 Correct 54 ms 2168 KB Output is correct
10 Correct 23 ms 2296 KB Output is correct
11 Correct 30 ms 2172 KB Output is correct
12 Correct 29 ms 2168 KB Output is correct
13 Correct 24 ms 2300 KB Output is correct
14 Correct 56 ms 2168 KB Output is correct
15 Correct 9 ms 2040 KB Output is correct
16 Correct 11 ms 2040 KB Output is correct
17 Correct 55 ms 2168 KB Output is correct
18 Correct 35 ms 2296 KB Output is correct
19 Correct 65 ms 2204 KB Output is correct
20 Correct 60 ms 2168 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1496 ms 4812 KB Output is correct
2 Correct 1460 ms 4732 KB Output is correct
3 Correct 1458 ms 4796 KB Output is correct
4 Correct 1382 ms 4880 KB Output is correct
5 Correct 329 ms 6404 KB Output is correct
6 Correct 221 ms 6652 KB Output is correct
7 Correct 1479 ms 4708 KB Output is correct
8 Correct 1491 ms 4584 KB Output is correct
9 Correct 1487 ms 4704 KB Output is correct
10 Correct 1474 ms 3504 KB Output is correct
11 Correct 1524 ms 3836 KB Output is correct
12 Correct 1082 ms 5760 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 201 ms 3748 KB Output is correct
2 Correct 175 ms 3964 KB Output is correct
3 Correct 292 ms 3852 KB Output is correct
4 Correct 173 ms 3836 KB Output is correct
5 Correct 652 ms 5744 KB Output is correct
6 Correct 806 ms 5004 KB Output is correct
7 Correct 752 ms 5536 KB Output is correct
8 Correct 223 ms 6456 KB Output is correct
9 Correct 541 ms 7900 KB Output is correct
10 Correct 1448 ms 6432 KB Output is correct
11 Correct 1176 ms 3808 KB Output is correct
12 Correct 1386 ms 6612 KB Output is correct
13 Correct 1626 ms 6184 KB Output is correct
14 Correct 2080 ms 4992 KB Output is correct
15 Correct 2041 ms 4716 KB Output is correct
16 Correct 1901 ms 4276 KB Output is correct
17 Correct 903 ms 4564 KB Output is correct
18 Correct 925 ms 4484 KB Output is correct
19 Correct 920 ms 4484 KB Output is correct
20 Correct 908 ms 4432 KB Output is correct
21 Correct 1348 ms 3948 KB Output is correct
22 Correct 2060 ms 5192 KB Output is correct
23 Correct 1933 ms 5548 KB Output is correct
24 Correct 2048 ms 5184 KB Output is correct
25 Correct 214 ms 3656 KB Output is correct
26 Correct 179 ms 3676 KB Output is correct
27 Correct 210 ms 3696 KB Output is correct
28 Correct 190 ms 3560 KB Output is correct
29 Correct 1756 ms 6144 KB Output is correct
30 Correct 1788 ms 6060 KB Output is correct
31 Correct 490 ms 7564 KB Output is correct
32 Correct 1440 ms 6296 KB Output is correct
33 Correct 1616 ms 6244 KB Output is correct
34 Correct 2032 ms 4832 KB Output is correct
35 Correct 1901 ms 5672 KB Output is correct
36 Correct 1480 ms 6368 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 187 ms 3660 KB Output is correct
2 Correct 174 ms 3628 KB Output is correct
3 Correct 175 ms 3548 KB Output is correct
4 Correct 192 ms 3616 KB Output is correct
5 Correct 914 ms 5716 KB Output is correct
6 Correct 1347 ms 3096 KB Output is correct
7 Correct 726 ms 5968 KB Output is correct
8 Correct 1466 ms 3352 KB Output is correct
9 Correct 2369 ms 5112 KB Output is correct
10 Correct 1424 ms 6836 KB Output is correct
11 Correct 1982 ms 4208 KB Output is correct
12 Correct 333 ms 6684 KB Output is correct
13 Correct 1965 ms 6096 KB Output is correct
14 Correct 2225 ms 5068 KB Output is correct
15 Correct 629 ms 7420 KB Output is correct
16 Correct 1683 ms 6244 KB Output is correct
17 Correct 1487 ms 4584 KB Output is correct
18 Correct 1484 ms 4584 KB Output is correct
19 Correct 1470 ms 4536 KB Output is correct
20 Correct 1480 ms 4648 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 2040 KB Output is correct
4 Correct 10 ms 2040 KB Output is correct
5 Correct 16 ms 2296 KB Output is correct
6 Correct 20 ms 2228 KB Output is correct
7 Correct 37 ms 2168 KB Output is correct
8 Correct 51 ms 2236 KB Output is correct
9 Correct 54 ms 2168 KB Output is correct
10 Correct 23 ms 2296 KB Output is correct
11 Correct 30 ms 2172 KB Output is correct
12 Correct 29 ms 2168 KB Output is correct
13 Correct 24 ms 2300 KB Output is correct
14 Correct 56 ms 2168 KB Output is correct
15 Correct 9 ms 2040 KB Output is correct
16 Correct 11 ms 2040 KB Output is correct
17 Correct 55 ms 2168 KB Output is correct
18 Correct 35 ms 2296 KB Output is correct
19 Correct 65 ms 2204 KB Output is correct
20 Correct 60 ms 2168 KB Output is correct
21 Correct 1496 ms 4812 KB Output is correct
22 Correct 1460 ms 4732 KB Output is correct
23 Correct 1458 ms 4796 KB Output is correct
24 Correct 1382 ms 4880 KB Output is correct
25 Correct 329 ms 6404 KB Output is correct
26 Correct 221 ms 6652 KB Output is correct
27 Correct 1479 ms 4708 KB Output is correct
28 Correct 1491 ms 4584 KB Output is correct
29 Correct 1487 ms 4704 KB Output is correct
30 Correct 1474 ms 3504 KB Output is correct
31 Correct 1524 ms 3836 KB Output is correct
32 Correct 1082 ms 5760 KB Output is correct
33 Correct 187 ms 3660 KB Output is correct
34 Correct 174 ms 3628 KB Output is correct
35 Correct 175 ms 3548 KB Output is correct
36 Correct 192 ms 3616 KB Output is correct
37 Correct 914 ms 5716 KB Output is correct
38 Correct 1347 ms 3096 KB Output is correct
39 Correct 726 ms 5968 KB Output is correct
40 Correct 1466 ms 3352 KB Output is correct
41 Correct 2369 ms 5112 KB Output is correct
42 Correct 1424 ms 6836 KB Output is correct
43 Correct 1982 ms 4208 KB Output is correct
44 Correct 333 ms 6684 KB Output is correct
45 Correct 1965 ms 6096 KB Output is correct
46 Correct 2225 ms 5068 KB Output is correct
47 Correct 629 ms 7420 KB Output is correct
48 Correct 1683 ms 6244 KB Output is correct
49 Correct 1487 ms 4584 KB Output is correct
50 Correct 1484 ms 4584 KB Output is correct
51 Correct 1470 ms 4536 KB Output is correct
52 Correct 1480 ms 4648 KB Output is correct
53 Correct 201 ms 3624 KB Output is correct
54 Correct 203 ms 3700 KB Output is correct
55 Correct 170 ms 3576 KB Output is correct
56 Correct 186 ms 3660 KB Output is correct
57 Correct 1650 ms 3824 KB Output is correct
58 Correct 1194 ms 2848 KB Output is correct
59 Correct 1286 ms 4856 KB Output is correct
60 Correct 1213 ms 2768 KB Output is correct
61 Correct 1854 ms 6080 KB Output is correct
62 Correct 791 ms 7420 KB Output is correct
63 Correct 461 ms 7400 KB Output is correct
64 Correct 727 ms 7336 KB Output is correct
65 Correct 2273 ms 4600 KB Output is correct
66 Correct 2003 ms 4376 KB Output is correct
67 Correct 1655 ms 6244 KB Output is correct
68 Correct 2017 ms 5580 KB Output is correct
69 Correct 1456 ms 4444 KB Output is correct
70 Correct 1517 ms 4452 KB Output is correct
71 Correct 1482 ms 4508 KB Output is correct
72 Correct 1497 ms 4540 KB Output is correct
73 Correct 2304 ms 4776 KB Output is correct
74 Correct 2142 ms 5520 KB Output is correct
75 Correct 202 ms 6484 KB Output is correct
76 Correct 429 ms 7552 KB Output is correct
77 Correct 202 ms 3612 KB Output is correct
78 Correct 179 ms 3652 KB Output is correct
79 Correct 199 ms 3652 KB Output is correct
80 Correct 205 ms 3660 KB Output is correct
81 Correct 2138 ms 5576 KB Output is correct
82 Correct 2336 ms 4608 KB Output is correct
83 Correct 1895 ms 4060 KB Output is correct
84 Correct 2154 ms 5400 KB Output is correct
85 Correct 1594 ms 6436 KB Output is correct
86 Correct 1540 ms 6908 KB Output is correct
87 Correct 2227 ms 5032 KB Output is correct
88 Correct 1902 ms 4036 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 2040 KB Output is correct
4 Correct 10 ms 2040 KB Output is correct
5 Correct 16 ms 2296 KB Output is correct
6 Correct 20 ms 2228 KB Output is correct
7 Correct 37 ms 2168 KB Output is correct
8 Correct 51 ms 2236 KB Output is correct
9 Correct 54 ms 2168 KB Output is correct
10 Correct 23 ms 2296 KB Output is correct
11 Correct 30 ms 2172 KB Output is correct
12 Correct 29 ms 2168 KB Output is correct
13 Correct 24 ms 2300 KB Output is correct
14 Correct 56 ms 2168 KB Output is correct
15 Correct 9 ms 2040 KB Output is correct
16 Correct 11 ms 2040 KB Output is correct
17 Correct 55 ms 2168 KB Output is correct
18 Correct 35 ms 2296 KB Output is correct
19 Correct 65 ms 2204 KB Output is correct
20 Correct 60 ms 2168 KB Output is correct
21 Correct 1496 ms 4812 KB Output is correct
22 Correct 1460 ms 4732 KB Output is correct
23 Correct 1458 ms 4796 KB Output is correct
24 Correct 1382 ms 4880 KB Output is correct
25 Correct 329 ms 6404 KB Output is correct
26 Correct 221 ms 6652 KB Output is correct
27 Correct 1479 ms 4708 KB Output is correct
28 Correct 1491 ms 4584 KB Output is correct
29 Correct 1487 ms 4704 KB Output is correct
30 Correct 1474 ms 3504 KB Output is correct
31 Correct 1524 ms 3836 KB Output is correct
32 Correct 1082 ms 5760 KB Output is correct
33 Correct 201 ms 3748 KB Output is correct
34 Correct 175 ms 3964 KB Output is correct
35 Correct 292 ms 3852 KB Output is correct
36 Correct 173 ms 3836 KB Output is correct
37 Correct 652 ms 5744 KB Output is correct
38 Correct 806 ms 5004 KB Output is correct
39 Correct 752 ms 5536 KB Output is correct
40 Correct 223 ms 6456 KB Output is correct
41 Correct 541 ms 7900 KB Output is correct
42 Correct 1448 ms 6432 KB Output is correct
43 Correct 1176 ms 3808 KB Output is correct
44 Correct 1386 ms 6612 KB Output is correct
45 Correct 1626 ms 6184 KB Output is correct
46 Correct 2080 ms 4992 KB Output is correct
47 Correct 2041 ms 4716 KB Output is correct
48 Correct 1901 ms 4276 KB Output is correct
49 Correct 903 ms 4564 KB Output is correct
50 Correct 925 ms 4484 KB Output is correct
51 Correct 920 ms 4484 KB Output is correct
52 Correct 908 ms 4432 KB Output is correct
53 Correct 1348 ms 3948 KB Output is correct
54 Correct 2060 ms 5192 KB Output is correct
55 Correct 1933 ms 5548 KB Output is correct
56 Correct 2048 ms 5184 KB Output is correct
57 Correct 214 ms 3656 KB Output is correct
58 Correct 179 ms 3676 KB Output is correct
59 Correct 210 ms 3696 KB Output is correct
60 Correct 190 ms 3560 KB Output is correct
61 Correct 1756 ms 6144 KB Output is correct
62 Correct 1788 ms 6060 KB Output is correct
63 Correct 490 ms 7564 KB Output is correct
64 Correct 1440 ms 6296 KB Output is correct
65 Correct 1616 ms 6244 KB Output is correct
66 Correct 2032 ms 4832 KB Output is correct
67 Correct 1901 ms 5672 KB Output is correct
68 Correct 1480 ms 6368 KB Output is correct
69 Correct 187 ms 3660 KB Output is correct
70 Correct 174 ms 3628 KB Output is correct
71 Correct 175 ms 3548 KB Output is correct
72 Correct 192 ms 3616 KB Output is correct
73 Correct 914 ms 5716 KB Output is correct
74 Correct 1347 ms 3096 KB Output is correct
75 Correct 726 ms 5968 KB Output is correct
76 Correct 1466 ms 3352 KB Output is correct
77 Correct 2369 ms 5112 KB Output is correct
78 Correct 1424 ms 6836 KB Output is correct
79 Correct 1982 ms 4208 KB Output is correct
80 Correct 333 ms 6684 KB Output is correct
81 Correct 1965 ms 6096 KB Output is correct
82 Correct 2225 ms 5068 KB Output is correct
83 Correct 629 ms 7420 KB Output is correct
84 Correct 1683 ms 6244 KB Output is correct
85 Correct 1487 ms 4584 KB Output is correct
86 Correct 1484 ms 4584 KB Output is correct
87 Correct 1470 ms 4536 KB Output is correct
88 Correct 1480 ms 4648 KB Output is correct
89 Correct 201 ms 3624 KB Output is correct
90 Correct 203 ms 3700 KB Output is correct
91 Correct 170 ms 3576 KB Output is correct
92 Correct 186 ms 3660 KB Output is correct
93 Correct 1650 ms 3824 KB Output is correct
94 Correct 1194 ms 2848 KB Output is correct
95 Correct 1286 ms 4856 KB Output is correct
96 Correct 1213 ms 2768 KB Output is correct
97 Correct 1854 ms 6080 KB Output is correct
98 Correct 791 ms 7420 KB Output is correct
99 Correct 461 ms 7400 KB Output is correct
100 Correct 727 ms 7336 KB Output is correct
101 Correct 2273 ms 4600 KB Output is correct
102 Correct 2003 ms 4376 KB Output is correct
103 Correct 1655 ms 6244 KB Output is correct
104 Correct 2017 ms 5580 KB Output is correct
105 Correct 1456 ms 4444 KB Output is correct
106 Correct 1517 ms 4452 KB Output is correct
107 Correct 1482 ms 4508 KB Output is correct
108 Correct 1497 ms 4540 KB Output is correct
109 Correct 2304 ms 4776 KB Output is correct
110 Correct 2142 ms 5520 KB Output is correct
111 Correct 202 ms 6484 KB Output is correct
112 Correct 429 ms 7552 KB Output is correct
113 Correct 202 ms 3612 KB Output is correct
114 Correct 179 ms 3652 KB Output is correct
115 Correct 199 ms 3652 KB Output is correct
116 Correct 205 ms 3660 KB Output is correct
117 Correct 2138 ms 5576 KB Output is correct
118 Correct 2336 ms 4608 KB Output is correct
119 Correct 1895 ms 4060 KB Output is correct
120 Correct 2154 ms 5400 KB Output is correct
121 Correct 1594 ms 6436 KB Output is correct
122 Correct 1540 ms 6908 KB Output is correct
123 Correct 2227 ms 5032 KB Output is correct
124 Correct 1902 ms 4036 KB Output is correct
125 Correct 465 ms 5304 KB Output is correct
126 Correct 475 ms 4896 KB Output is correct
127 Correct 608 ms 5304 KB Output is correct
128 Correct 498 ms 5368 KB Output is correct
129 Correct 434 ms 5296 KB Output is correct
130 Correct 530 ms 5272 KB Output is correct
131 Correct 3313 ms 3836 KB Output is correct
132 Correct 4538 ms 6712 KB Output is correct
133 Correct 3906 ms 8620 KB Output is correct
134 Correct 3844 ms 4492 KB Output is correct
135 Correct 3388 ms 8900 KB Output is correct
136 Correct 2055 ms 3044 KB Output is correct
137 Correct 1805 ms 12996 KB Output is correct
138 Execution timed out 5023 ms 10316 KB Time limit exceeded
139 Halted 0 ms 0 KB -