oj.uz

Submission #161339

# Submission time Handle Problem Language Result Execution time Memory
161339 2019-11-01T21:15:19 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 5000 ms 13404 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 = 260;
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 2 ms 1980 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 10 ms 2184 KB Output is correct
4 Correct 9 ms 2040 KB Output is correct
5 Correct 15 ms 2296 KB Output is correct
6 Correct 19 ms 2424 KB Output is correct
7 Correct 40 ms 2168 KB Output is correct
8 Correct 46 ms 2168 KB Output is correct
9 Correct 48 ms 2300 KB Output is correct
10 Correct 21 ms 2296 KB Output is correct
11 Correct 32 ms 2168 KB Output is correct
12 Correct 27 ms 2296 KB Output is correct
13 Correct 23 ms 2300 KB Output is correct
14 Correct 55 ms 2296 KB Output is correct
15 Correct 11 ms 2168 KB Output is correct
16 Correct 11 ms 2040 KB Output is correct
17 Correct 51 ms 2212 KB Output is correct
18 Correct 32 ms 2332 KB Output is correct
19 Correct 57 ms 2168 KB Output is correct
20 Correct 57 ms 2168 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1473 ms 5380 KB Output is correct
2 Correct 1428 ms 5296 KB Output is correct
3 Correct 1470 ms 5324 KB Output is correct
4 Correct 1381 ms 5404 KB Output is correct
5 Correct 332 ms 7020 KB Output is correct
6 Correct 218 ms 7032 KB Output is correct
7 Correct 1612 ms 5476 KB Output is correct
8 Correct 1471 ms 5168 KB Output is correct
9 Correct 1449 ms 5208 KB Output is correct
10 Correct 1339 ms 4000 KB Output is correct
11 Correct 1573 ms 4136 KB Output is correct
12 Correct 1100 ms 5984 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 202 ms 4008 KB Output is correct
2 Correct 167 ms 4048 KB Output is correct
3 Correct 294 ms 4072 KB Output is correct
4 Correct 176 ms 4204 KB Output is correct
5 Correct 585 ms 5972 KB Output is correct
6 Correct 756 ms 5500 KB Output is correct
7 Correct 685 ms 5756 KB Output is correct
8 Correct 217 ms 6680 KB Output is correct
9 Correct 506 ms 8080 KB Output is correct
10 Correct 1364 ms 6840 KB Output is correct
11 Correct 994 ms 4364 KB Output is correct
12 Correct 1283 ms 7164 KB Output is correct
13 Correct 1495 ms 6644 KB Output is correct
14 Correct 1831 ms 5480 KB Output is correct
15 Correct 1819 ms 5316 KB Output is correct
16 Correct 1683 ms 4552 KB Output is correct
17 Correct 854 ms 5048 KB Output is correct
18 Correct 842 ms 4920 KB Output is correct
19 Correct 869 ms 4896 KB Output is correct
20 Correct 861 ms 4944 KB Output is correct
21 Correct 1196 ms 4336 KB Output is correct
22 Correct 1929 ms 5596 KB Output is correct
23 Correct 1746 ms 6216 KB Output is correct
24 Correct 1869 ms 5648 KB Output is correct
25 Correct 212 ms 3944 KB Output is correct
26 Correct 181 ms 3944 KB Output is correct
27 Correct 239 ms 3948 KB Output is correct
28 Correct 192 ms 4040 KB Output is correct
29 Correct 1632 ms 6576 KB Output is correct
30 Correct 1611 ms 6780 KB Output is correct
31 Correct 453 ms 8092 KB Output is correct
32 Correct 1327 ms 6984 KB Output is correct
33 Correct 1443 ms 6604 KB Output is correct
34 Correct 1859 ms 5204 KB Output is correct
35 Correct 1687 ms 6132 KB Output is correct
36 Correct 1390 ms 6972 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 169 ms 3820 KB Output is correct
2 Correct 173 ms 4040 KB Output is correct
3 Correct 176 ms 3892 KB Output is correct
4 Correct 208 ms 3892 KB Output is correct
5 Correct 1000 ms 6084 KB Output is correct
6 Correct 1348 ms 3708 KB Output is correct
7 Correct 739 ms 6492 KB Output is correct
8 Correct 1345 ms 3912 KB Output is correct
9 Correct 2076 ms 5532 KB Output is correct
10 Correct 1314 ms 7476 KB Output is correct
11 Correct 1813 ms 4604 KB Output is correct
12 Correct 346 ms 7772 KB Output is correct
13 Correct 1683 ms 6784 KB Output is correct
14 Correct 1989 ms 5472 KB Output is correct
15 Correct 581 ms 7992 KB Output is correct
16 Correct 1585 ms 6680 KB Output is correct
17 Correct 1434 ms 4872 KB Output is correct
18 Correct 1433 ms 4784 KB Output is correct
19 Correct 1443 ms 5060 KB Output is correct
20 Correct 1442 ms 4912 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1980 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 10 ms 2184 KB Output is correct
4 Correct 9 ms 2040 KB Output is correct
5 Correct 15 ms 2296 KB Output is correct
6 Correct 19 ms 2424 KB Output is correct
7 Correct 40 ms 2168 KB Output is correct
8 Correct 46 ms 2168 KB Output is correct
9 Correct 48 ms 2300 KB Output is correct
10 Correct 21 ms 2296 KB Output is correct
11 Correct 32 ms 2168 KB Output is correct
12 Correct 27 ms 2296 KB Output is correct
13 Correct 23 ms 2300 KB Output is correct
14 Correct 55 ms 2296 KB Output is correct
15 Correct 11 ms 2168 KB Output is correct
16 Correct 11 ms 2040 KB Output is correct
17 Correct 51 ms 2212 KB Output is correct
18 Correct 32 ms 2332 KB Output is correct
19 Correct 57 ms 2168 KB Output is correct
20 Correct 57 ms 2168 KB Output is correct
21 Correct 1473 ms 5380 KB Output is correct
22 Correct 1428 ms 5296 KB Output is correct
23 Correct 1470 ms 5324 KB Output is correct
24 Correct 1381 ms 5404 KB Output is correct
25 Correct 332 ms 7020 KB Output is correct
26 Correct 218 ms 7032 KB Output is correct
27 Correct 1612 ms 5476 KB Output is correct
28 Correct 1471 ms 5168 KB Output is correct
29 Correct 1449 ms 5208 KB Output is correct
30 Correct 1339 ms 4000 KB Output is correct
31 Correct 1573 ms 4136 KB Output is correct
32 Correct 1100 ms 5984 KB Output is correct
33 Correct 169 ms 3820 KB Output is correct
34 Correct 173 ms 4040 KB Output is correct
35 Correct 176 ms 3892 KB Output is correct
36 Correct 208 ms 3892 KB Output is correct
37 Correct 1000 ms 6084 KB Output is correct
38 Correct 1348 ms 3708 KB Output is correct
39 Correct 739 ms 6492 KB Output is correct
40 Correct 1345 ms 3912 KB Output is correct
41 Correct 2076 ms 5532 KB Output is correct
42 Correct 1314 ms 7476 KB Output is correct
43 Correct 1813 ms 4604 KB Output is correct
44 Correct 346 ms 7772 KB Output is correct
45 Correct 1683 ms 6784 KB Output is correct
46 Correct 1989 ms 5472 KB Output is correct
47 Correct 581 ms 7992 KB Output is correct
48 Correct 1585 ms 6680 KB Output is correct
49 Correct 1434 ms 4872 KB Output is correct
50 Correct 1433 ms 4784 KB Output is correct
51 Correct 1443 ms 5060 KB Output is correct
52 Correct 1442 ms 4912 KB Output is correct
53 Correct 201 ms 3892 KB Output is correct
54 Correct 200 ms 3760 KB Output is correct
55 Correct 168 ms 3744 KB Output is correct
56 Correct 176 ms 3748 KB Output is correct
57 Correct 1586 ms 4292 KB Output is correct
58 Correct 1074 ms 3336 KB Output is correct
59 Correct 1431 ms 5276 KB Output is correct
60 Correct 1136 ms 3320 KB Output is correct
61 Correct 1717 ms 6616 KB Output is correct
62 Correct 760 ms 7880 KB Output is correct
63 Correct 463 ms 8004 KB Output is correct
64 Correct 711 ms 7908 KB Output is correct
65 Correct 1857 ms 4952 KB Output is correct
66 Correct 1777 ms 4744 KB Output is correct
67 Correct 1498 ms 6992 KB Output is correct
68 Correct 1879 ms 5992 KB Output is correct
69 Correct 1434 ms 5060 KB Output is correct
70 Correct 1428 ms 5076 KB Output is correct
71 Correct 1455 ms 5060 KB Output is correct
72 Correct 1587 ms 5124 KB Output is correct
73 Correct 2033 ms 5164 KB Output is correct
74 Correct 2147 ms 6076 KB Output is correct
75 Correct 191 ms 6772 KB Output is correct
76 Correct 405 ms 7864 KB Output is correct
77 Correct 187 ms 3788 KB Output is correct
78 Correct 175 ms 3924 KB Output is correct
79 Correct 197 ms 3876 KB Output is correct
80 Correct 178 ms 3948 KB Output is correct
81 Correct 2000 ms 5880 KB Output is correct
82 Correct 2017 ms 5092 KB Output is correct
83 Correct 1737 ms 4584 KB Output is correct
84 Correct 2021 ms 6128 KB Output is correct
85 Correct 1512 ms 6716 KB Output is correct
86 Correct 1392 ms 7056 KB Output is correct
87 Correct 2053 ms 5460 KB Output is correct
88 Correct 1675 ms 4692 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1980 KB Output is correct
2 Correct 3 ms 1912 KB Output is correct
3 Correct 10 ms 2184 KB Output is correct
4 Correct 9 ms 2040 KB Output is correct
5 Correct 15 ms 2296 KB Output is correct
6 Correct 19 ms 2424 KB Output is correct
7 Correct 40 ms 2168 KB Output is correct
8 Correct 46 ms 2168 KB Output is correct
9 Correct 48 ms 2300 KB Output is correct
10 Correct 21 ms 2296 KB Output is correct
11 Correct 32 ms 2168 KB Output is correct
12 Correct 27 ms 2296 KB Output is correct
13 Correct 23 ms 2300 KB Output is correct
14 Correct 55 ms 2296 KB Output is correct
15 Correct 11 ms 2168 KB Output is correct
16 Correct 11 ms 2040 KB Output is correct
17 Correct 51 ms 2212 KB Output is correct
18 Correct 32 ms 2332 KB Output is correct
19 Correct 57 ms 2168 KB Output is correct
20 Correct 57 ms 2168 KB Output is correct
21 Correct 1473 ms 5380 KB Output is correct
22 Correct 1428 ms 5296 KB Output is correct
23 Correct 1470 ms 5324 KB Output is correct
24 Correct 1381 ms 5404 KB Output is correct
25 Correct 332 ms 7020 KB Output is correct
26 Correct 218 ms 7032 KB Output is correct
27 Correct 1612 ms 5476 KB Output is correct
28 Correct 1471 ms 5168 KB Output is correct
29 Correct 1449 ms 5208 KB Output is correct
30 Correct 1339 ms 4000 KB Output is correct
31 Correct 1573 ms 4136 KB Output is correct
32 Correct 1100 ms 5984 KB Output is correct
33 Correct 202 ms 4008 KB Output is correct
34 Correct 167 ms 4048 KB Output is correct
35 Correct 294 ms 4072 KB Output is correct
36 Correct 176 ms 4204 KB Output is correct
37 Correct 585 ms 5972 KB Output is correct
38 Correct 756 ms 5500 KB Output is correct
39 Correct 685 ms 5756 KB Output is correct
40 Correct 217 ms 6680 KB Output is correct
41 Correct 506 ms 8080 KB Output is correct
42 Correct 1364 ms 6840 KB Output is correct
43 Correct 994 ms 4364 KB Output is correct
44 Correct 1283 ms 7164 KB Output is correct
45 Correct 1495 ms 6644 KB Output is correct
46 Correct 1831 ms 5480 KB Output is correct
47 Correct 1819 ms 5316 KB Output is correct
48 Correct 1683 ms 4552 KB Output is correct
49 Correct 854 ms 5048 KB Output is correct
50 Correct 842 ms 4920 KB Output is correct
51 Correct 869 ms 4896 KB Output is correct
52 Correct 861 ms 4944 KB Output is correct
53 Correct 1196 ms 4336 KB Output is correct
54 Correct 1929 ms 5596 KB Output is correct
55 Correct 1746 ms 6216 KB Output is correct
56 Correct 1869 ms 5648 KB Output is correct
57 Correct 212 ms 3944 KB Output is correct
58 Correct 181 ms 3944 KB Output is correct
59 Correct 239 ms 3948 KB Output is correct
60 Correct 192 ms 4040 KB Output is correct
61 Correct 1632 ms 6576 KB Output is correct
62 Correct 1611 ms 6780 KB Output is correct
63 Correct 453 ms 8092 KB Output is correct
64 Correct 1327 ms 6984 KB Output is correct
65 Correct 1443 ms 6604 KB Output is correct
66 Correct 1859 ms 5204 KB Output is correct
67 Correct 1687 ms 6132 KB Output is correct
68 Correct 1390 ms 6972 KB Output is correct
69 Correct 169 ms 3820 KB Output is correct
70 Correct 173 ms 4040 KB Output is correct
71 Correct 176 ms 3892 KB Output is correct
72 Correct 208 ms 3892 KB Output is correct
73 Correct 1000 ms 6084 KB Output is correct
74 Correct 1348 ms 3708 KB Output is correct
75 Correct 739 ms 6492 KB Output is correct
76 Correct 1345 ms 3912 KB Output is correct
77 Correct 2076 ms 5532 KB Output is correct
78 Correct 1314 ms 7476 KB Output is correct
79 Correct 1813 ms 4604 KB Output is correct
80 Correct 346 ms 7772 KB Output is correct
81 Correct 1683 ms 6784 KB Output is correct
82 Correct 1989 ms 5472 KB Output is correct
83 Correct 581 ms 7992 KB Output is correct
84 Correct 1585 ms 6680 KB Output is correct
85 Correct 1434 ms 4872 KB Output is correct
86 Correct 1433 ms 4784 KB Output is correct
87 Correct 1443 ms 5060 KB Output is correct
88 Correct 1442 ms 4912 KB Output is correct
89 Correct 201 ms 3892 KB Output is correct
90 Correct 200 ms 3760 KB Output is correct
91 Correct 168 ms 3744 KB Output is correct
92 Correct 176 ms 3748 KB Output is correct
93 Correct 1586 ms 4292 KB Output is correct
94 Correct 1074 ms 3336 KB Output is correct
95 Correct 1431 ms 5276 KB Output is correct
96 Correct 1136 ms 3320 KB Output is correct
97 Correct 1717 ms 6616 KB Output is correct
98 Correct 760 ms 7880 KB Output is correct
99 Correct 463 ms 8004 KB Output is correct
100 Correct 711 ms 7908 KB Output is correct
101 Correct 1857 ms 4952 KB Output is correct
102 Correct 1777 ms 4744 KB Output is correct
103 Correct 1498 ms 6992 KB Output is correct
104 Correct 1879 ms 5992 KB Output is correct
105 Correct 1434 ms 5060 KB Output is correct
106 Correct 1428 ms 5076 KB Output is correct
107 Correct 1455 ms 5060 KB Output is correct
108 Correct 1587 ms 5124 KB Output is correct
109 Correct 2033 ms 5164 KB Output is correct
110 Correct 2147 ms 6076 KB Output is correct
111 Correct 191 ms 6772 KB Output is correct
112 Correct 405 ms 7864 KB Output is correct
113 Correct 187 ms 3788 KB Output is correct
114 Correct 175 ms 3924 KB Output is correct
115 Correct 197 ms 3876 KB Output is correct
116 Correct 178 ms 3948 KB Output is correct
117 Correct 2000 ms 5880 KB Output is correct
118 Correct 2017 ms 5092 KB Output is correct
119 Correct 1737 ms 4584 KB Output is correct
120 Correct 2021 ms 6128 KB Output is correct
121 Correct 1512 ms 6716 KB Output is correct
122 Correct 1392 ms 7056 KB Output is correct
123 Correct 2053 ms 5460 KB Output is correct
124 Correct 1675 ms 4692 KB Output is correct
125 Correct 510 ms 5960 KB Output is correct
126 Correct 478 ms 5912 KB Output is correct
127 Correct 617 ms 6116 KB Output is correct
128 Correct 506 ms 5952 KB Output is correct
129 Correct 442 ms 5956 KB Output is correct
130 Correct 539 ms 6144 KB Output is correct
131 Correct 2959 ms 4380 KB Output is correct
132 Correct 4610 ms 7408 KB Output is correct
133 Correct 3832 ms 8860 KB Output is correct
134 Correct 3733 ms 4960 KB Output is correct
135 Correct 3490 ms 9332 KB Output is correct
136 Correct 1833 ms 3468 KB Output is correct
137 Correct 1819 ms 13404 KB Output is correct
138 Execution timed out 5011 ms 10760 KB Time limit exceeded
139 Halted 0 ms 0 KB -