oj.uz

Submission #161340

# Submission time Handle Problem Language Result Execution time Memory
161340 2019-11-01T21:18:47 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 5000 ms 14252 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 = 280;
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 4 ms 1912 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 9 ms 2168 KB Output is correct
4 Correct 9 ms 2168 KB Output is correct
5 Correct 15 ms 2300 KB Output is correct
6 Correct 18 ms 2296 KB Output is correct
7 Correct 41 ms 2168 KB Output is correct
8 Correct 45 ms 2296 KB Output is correct
9 Correct 47 ms 2296 KB Output is correct
10 Correct 19 ms 2296 KB Output is correct
11 Correct 28 ms 2168 KB Output is correct
12 Correct 27 ms 2168 KB Output is correct
13 Correct 21 ms 2296 KB Output is correct
14 Correct 48 ms 2168 KB Output is correct
15 Correct 9 ms 2168 KB Output is correct
16 Correct 11 ms 2168 KB Output is correct
17 Correct 49 ms 2168 KB Output is correct
18 Correct 30 ms 2296 KB Output is correct
19 Correct 56 ms 2168 KB Output is correct
20 Correct 52 ms 2168 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1480 ms 5276 KB Output is correct
2 Correct 1423 ms 5296 KB Output is correct
3 Correct 1441 ms 5296 KB Output is correct
4 Correct 1428 ms 5432 KB Output is correct
5 Correct 347 ms 6884 KB Output is correct
6 Correct 226 ms 6776 KB Output is correct
7 Correct 1470 ms 5168 KB Output is correct
8 Correct 1637 ms 5192 KB Output is correct
9 Correct 1496 ms 5200 KB Output is correct
10 Correct 1389 ms 4036 KB Output is correct
11 Correct 1654 ms 4320 KB Output is correct
12 Correct 1131 ms 6236 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 205 ms 4324 KB Output is correct
2 Correct 168 ms 4272 KB Output is correct
3 Correct 295 ms 4320 KB Output is correct
4 Correct 178 ms 4292 KB Output is correct
5 Correct 589 ms 6336 KB Output is correct
6 Correct 711 ms 5784 KB Output is correct
7 Correct 690 ms 6128 KB Output is correct
8 Correct 217 ms 7032 KB Output is correct
9 Correct 498 ms 8292 KB Output is correct
10 Correct 1306 ms 7028 KB Output is correct
11 Correct 976 ms 4440 KB Output is correct
12 Correct 1289 ms 7256 KB Output is correct
13 Correct 1448 ms 6784 KB Output is correct
14 Correct 1783 ms 5464 KB Output is correct
15 Correct 1975 ms 5820 KB Output is correct
16 Correct 1647 ms 5568 KB Output is correct
17 Correct 813 ms 5964 KB Output is correct
18 Correct 864 ms 5900 KB Output is correct
19 Correct 854 ms 5888 KB Output is correct
20 Correct 965 ms 5960 KB Output is correct
21 Correct 1275 ms 5100 KB Output is correct
22 Correct 1792 ms 6508 KB Output is correct
23 Correct 1693 ms 6964 KB Output is correct
24 Correct 1903 ms 6516 KB Output is correct
25 Correct 212 ms 4948 KB Output is correct
26 Correct 211 ms 4928 KB Output is correct
27 Correct 217 ms 4956 KB Output is correct
28 Correct 186 ms 4880 KB Output is correct
29 Correct 1598 ms 7416 KB Output is correct
30 Correct 1619 ms 7392 KB Output is correct
31 Correct 514 ms 9024 KB Output is correct
32 Correct 1328 ms 7864 KB Output is correct
33 Correct 1553 ms 7596 KB Output is correct
34 Correct 1742 ms 5976 KB Output is correct
35 Correct 1622 ms 6880 KB Output is correct
36 Correct 1375 ms 7688 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 181 ms 4832 KB Output is correct
2 Correct 175 ms 4864 KB Output is correct
3 Correct 173 ms 4872 KB Output is correct
4 Correct 198 ms 4844 KB Output is correct
5 Correct 933 ms 7132 KB Output is correct
6 Correct 1205 ms 4900 KB Output is correct
7 Correct 761 ms 7212 KB Output is correct
8 Correct 1439 ms 5252 KB Output is correct
9 Correct 2039 ms 6468 KB Output is correct
10 Correct 1325 ms 8228 KB Output is correct
11 Correct 1692 ms 5072 KB Output is correct
12 Correct 343 ms 8608 KB Output is correct
13 Correct 1684 ms 7388 KB Output is correct
14 Correct 1949 ms 6124 KB Output is correct
15 Correct 590 ms 8700 KB Output is correct
16 Correct 1521 ms 7484 KB Output is correct
17 Correct 1488 ms 5396 KB Output is correct
18 Correct 1480 ms 5508 KB Output is correct
19 Correct 1493 ms 5548 KB Output is correct
20 Correct 1751 ms 5424 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1912 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 9 ms 2168 KB Output is correct
4 Correct 9 ms 2168 KB Output is correct
5 Correct 15 ms 2300 KB Output is correct
6 Correct 18 ms 2296 KB Output is correct
7 Correct 41 ms 2168 KB Output is correct
8 Correct 45 ms 2296 KB Output is correct
9 Correct 47 ms 2296 KB Output is correct
10 Correct 19 ms 2296 KB Output is correct
11 Correct 28 ms 2168 KB Output is correct
12 Correct 27 ms 2168 KB Output is correct
13 Correct 21 ms 2296 KB Output is correct
14 Correct 48 ms 2168 KB Output is correct
15 Correct 9 ms 2168 KB Output is correct
16 Correct 11 ms 2168 KB Output is correct
17 Correct 49 ms 2168 KB Output is correct
18 Correct 30 ms 2296 KB Output is correct
19 Correct 56 ms 2168 KB Output is correct
20 Correct 52 ms 2168 KB Output is correct
21 Correct 1480 ms 5276 KB Output is correct
22 Correct 1423 ms 5296 KB Output is correct
23 Correct 1441 ms 5296 KB Output is correct
24 Correct 1428 ms 5432 KB Output is correct
25 Correct 347 ms 6884 KB Output is correct
26 Correct 226 ms 6776 KB Output is correct
27 Correct 1470 ms 5168 KB Output is correct
28 Correct 1637 ms 5192 KB Output is correct
29 Correct 1496 ms 5200 KB Output is correct
30 Correct 1389 ms 4036 KB Output is correct
31 Correct 1654 ms 4320 KB Output is correct
32 Correct 1131 ms 6236 KB Output is correct
33 Correct 181 ms 4832 KB Output is correct
34 Correct 175 ms 4864 KB Output is correct
35 Correct 173 ms 4872 KB Output is correct
36 Correct 198 ms 4844 KB Output is correct
37 Correct 933 ms 7132 KB Output is correct
38 Correct 1205 ms 4900 KB Output is correct
39 Correct 761 ms 7212 KB Output is correct
40 Correct 1439 ms 5252 KB Output is correct
41 Correct 2039 ms 6468 KB Output is correct
42 Correct 1325 ms 8228 KB Output is correct
43 Correct 1692 ms 5072 KB Output is correct
44 Correct 343 ms 8608 KB Output is correct
45 Correct 1684 ms 7388 KB Output is correct
46 Correct 1949 ms 6124 KB Output is correct
47 Correct 590 ms 8700 KB Output is correct
48 Correct 1521 ms 7484 KB Output is correct
49 Correct 1488 ms 5396 KB Output is correct
50 Correct 1480 ms 5508 KB Output is correct
51 Correct 1493 ms 5548 KB Output is correct
52 Correct 1751 ms 5424 KB Output is correct
53 Correct 220 ms 4432 KB Output is correct
54 Correct 323 ms 4392 KB Output is correct
55 Correct 178 ms 4584 KB Output is correct
56 Correct 180 ms 4564 KB Output is correct
57 Correct 1582 ms 5372 KB Output is correct
58 Correct 1139 ms 4136 KB Output is correct
59 Correct 1479 ms 5984 KB Output is correct
60 Correct 1276 ms 3856 KB Output is correct
61 Correct 1713 ms 7000 KB Output is correct
62 Correct 729 ms 8308 KB Output is correct
63 Correct 453 ms 9048 KB Output is correct
64 Correct 706 ms 8752 KB Output is correct
65 Correct 1847 ms 6000 KB Output is correct
66 Correct 1705 ms 5596 KB Output is correct
67 Correct 1480 ms 7676 KB Output is correct
68 Correct 1832 ms 6912 KB Output is correct
69 Correct 1480 ms 6188 KB Output is correct
70 Correct 1448 ms 6244 KB Output is correct
71 Correct 1449 ms 6212 KB Output is correct
72 Correct 1486 ms 6196 KB Output is correct
73 Correct 1986 ms 6136 KB Output is correct
74 Correct 2045 ms 6908 KB Output is correct
75 Correct 180 ms 7796 KB Output is correct
76 Correct 416 ms 9176 KB Output is correct
77 Correct 182 ms 5040 KB Output is correct
78 Correct 175 ms 4952 KB Output is correct
79 Correct 195 ms 4936 KB Output is correct
80 Correct 179 ms 4884 KB Output is correct
81 Correct 1928 ms 6792 KB Output is correct
82 Correct 1953 ms 6176 KB Output is correct
83 Correct 1639 ms 5516 KB Output is correct
84 Correct 1909 ms 6896 KB Output is correct
85 Correct 1464 ms 7784 KB Output is correct
86 Correct 1422 ms 8120 KB Output is correct
87 Correct 1980 ms 6416 KB Output is correct
88 Correct 1634 ms 5532 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1912 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 9 ms 2168 KB Output is correct
4 Correct 9 ms 2168 KB Output is correct
5 Correct 15 ms 2300 KB Output is correct
6 Correct 18 ms 2296 KB Output is correct
7 Correct 41 ms 2168 KB Output is correct
8 Correct 45 ms 2296 KB Output is correct
9 Correct 47 ms 2296 KB Output is correct
10 Correct 19 ms 2296 KB Output is correct
11 Correct 28 ms 2168 KB Output is correct
12 Correct 27 ms 2168 KB Output is correct
13 Correct 21 ms 2296 KB Output is correct
14 Correct 48 ms 2168 KB Output is correct
15 Correct 9 ms 2168 KB Output is correct
16 Correct 11 ms 2168 KB Output is correct
17 Correct 49 ms 2168 KB Output is correct
18 Correct 30 ms 2296 KB Output is correct
19 Correct 56 ms 2168 KB Output is correct
20 Correct 52 ms 2168 KB Output is correct
21 Correct 1480 ms 5276 KB Output is correct
22 Correct 1423 ms 5296 KB Output is correct
23 Correct 1441 ms 5296 KB Output is correct
24 Correct 1428 ms 5432 KB Output is correct
25 Correct 347 ms 6884 KB Output is correct
26 Correct 226 ms 6776 KB Output is correct
27 Correct 1470 ms 5168 KB Output is correct
28 Correct 1637 ms 5192 KB Output is correct
29 Correct 1496 ms 5200 KB Output is correct
30 Correct 1389 ms 4036 KB Output is correct
31 Correct 1654 ms 4320 KB Output is correct
32 Correct 1131 ms 6236 KB Output is correct
33 Correct 205 ms 4324 KB Output is correct
34 Correct 168 ms 4272 KB Output is correct
35 Correct 295 ms 4320 KB Output is correct
36 Correct 178 ms 4292 KB Output is correct
37 Correct 589 ms 6336 KB Output is correct
38 Correct 711 ms 5784 KB Output is correct
39 Correct 690 ms 6128 KB Output is correct
40 Correct 217 ms 7032 KB Output is correct
41 Correct 498 ms 8292 KB Output is correct
42 Correct 1306 ms 7028 KB Output is correct
43 Correct 976 ms 4440 KB Output is correct
44 Correct 1289 ms 7256 KB Output is correct
45 Correct 1448 ms 6784 KB Output is correct
46 Correct 1783 ms 5464 KB Output is correct
47 Correct 1975 ms 5820 KB Output is correct
48 Correct 1647 ms 5568 KB Output is correct
49 Correct 813 ms 5964 KB Output is correct
50 Correct 864 ms 5900 KB Output is correct
51 Correct 854 ms 5888 KB Output is correct
52 Correct 965 ms 5960 KB Output is correct
53 Correct 1275 ms 5100 KB Output is correct
54 Correct 1792 ms 6508 KB Output is correct
55 Correct 1693 ms 6964 KB Output is correct
56 Correct 1903 ms 6516 KB Output is correct
57 Correct 212 ms 4948 KB Output is correct
58 Correct 211 ms 4928 KB Output is correct
59 Correct 217 ms 4956 KB Output is correct
60 Correct 186 ms 4880 KB Output is correct
61 Correct 1598 ms 7416 KB Output is correct
62 Correct 1619 ms 7392 KB Output is correct
63 Correct 514 ms 9024 KB Output is correct
64 Correct 1328 ms 7864 KB Output is correct
65 Correct 1553 ms 7596 KB Output is correct
66 Correct 1742 ms 5976 KB Output is correct
67 Correct 1622 ms 6880 KB Output is correct
68 Correct 1375 ms 7688 KB Output is correct
69 Correct 181 ms 4832 KB Output is correct
70 Correct 175 ms 4864 KB Output is correct
71 Correct 173 ms 4872 KB Output is correct
72 Correct 198 ms 4844 KB Output is correct
73 Correct 933 ms 7132 KB Output is correct
74 Correct 1205 ms 4900 KB Output is correct
75 Correct 761 ms 7212 KB Output is correct
76 Correct 1439 ms 5252 KB Output is correct
77 Correct 2039 ms 6468 KB Output is correct
78 Correct 1325 ms 8228 KB Output is correct
79 Correct 1692 ms 5072 KB Output is correct
80 Correct 343 ms 8608 KB Output is correct
81 Correct 1684 ms 7388 KB Output is correct
82 Correct 1949 ms 6124 KB Output is correct
83 Correct 590 ms 8700 KB Output is correct
84 Correct 1521 ms 7484 KB Output is correct
85 Correct 1488 ms 5396 KB Output is correct
86 Correct 1480 ms 5508 KB Output is correct
87 Correct 1493 ms 5548 KB Output is correct
88 Correct 1751 ms 5424 KB Output is correct
89 Correct 220 ms 4432 KB Output is correct
90 Correct 323 ms 4392 KB Output is correct
91 Correct 178 ms 4584 KB Output is correct
92 Correct 180 ms 4564 KB Output is correct
93 Correct 1582 ms 5372 KB Output is correct
94 Correct 1139 ms 4136 KB Output is correct
95 Correct 1479 ms 5984 KB Output is correct
96 Correct 1276 ms 3856 KB Output is correct
97 Correct 1713 ms 7000 KB Output is correct
98 Correct 729 ms 8308 KB Output is correct
99 Correct 453 ms 9048 KB Output is correct
100 Correct 706 ms 8752 KB Output is correct
101 Correct 1847 ms 6000 KB Output is correct
102 Correct 1705 ms 5596 KB Output is correct
103 Correct 1480 ms 7676 KB Output is correct
104 Correct 1832 ms 6912 KB Output is correct
105 Correct 1480 ms 6188 KB Output is correct
106 Correct 1448 ms 6244 KB Output is correct
107 Correct 1449 ms 6212 KB Output is correct
108 Correct 1486 ms 6196 KB Output is correct
109 Correct 1986 ms 6136 KB Output is correct
110 Correct 2045 ms 6908 KB Output is correct
111 Correct 180 ms 7796 KB Output is correct
112 Correct 416 ms 9176 KB Output is correct
113 Correct 182 ms 5040 KB Output is correct
114 Correct 175 ms 4952 KB Output is correct
115 Correct 195 ms 4936 KB Output is correct
116 Correct 179 ms 4884 KB Output is correct
117 Correct 1928 ms 6792 KB Output is correct
118 Correct 1953 ms 6176 KB Output is correct
119 Correct 1639 ms 5516 KB Output is correct
120 Correct 1909 ms 6896 KB Output is correct
121 Correct 1464 ms 7784 KB Output is correct
122 Correct 1422 ms 8120 KB Output is correct
123 Correct 1980 ms 6416 KB Output is correct
124 Correct 1634 ms 5532 KB Output is correct
125 Correct 468 ms 7396 KB Output is correct
126 Correct 487 ms 7528 KB Output is correct
127 Correct 649 ms 7388 KB Output is correct
128 Correct 522 ms 7492 KB Output is correct
129 Correct 444 ms 7388 KB Output is correct
130 Correct 546 ms 7488 KB Output is correct
131 Correct 3134 ms 6176 KB Output is correct
132 Correct 4688 ms 8948 KB Output is correct
133 Correct 3889 ms 9880 KB Output is correct
134 Correct 3777 ms 5696 KB Output is correct
135 Correct 3799 ms 10236 KB Output is correct
136 Correct 1789 ms 4272 KB Output is correct
137 Correct 1911 ms 14252 KB Output is correct
138 Execution timed out 5076 ms 11280 KB Time limit exceeded
139 Halted 0 ms 0 KB -