oj.uz

Submission #161334

# Submission time Handle Problem Language Result Execution time Memory
161334 2019-11-01T20:36:15 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 5000 ms 13076 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 = 155;
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 1528 KB Output is correct
2 Correct 3 ms 1584 KB Output is correct
3 Correct 16 ms 1784 KB Output is correct
4 Correct 10 ms 1912 KB Output is correct
5 Correct 18 ms 1912 KB Output is correct
6 Correct 22 ms 1912 KB Output is correct
7 Correct 35 ms 1868 KB Output is correct
8 Correct 67 ms 1912 KB Output is correct
9 Correct 106 ms 1912 KB Output is correct
10 Correct 52 ms 1916 KB Output is correct
11 Correct 36 ms 1856 KB Output is correct
12 Correct 36 ms 1912 KB Output is correct
13 Correct 32 ms 1980 KB Output is correct
14 Correct 79 ms 1892 KB Output is correct
15 Correct 9 ms 1784 KB Output is correct
16 Correct 12 ms 1784 KB Output is correct
17 Correct 84 ms 1856 KB Output is correct
18 Correct 56 ms 1964 KB Output is correct
19 Correct 145 ms 1972 KB Output is correct
20 Correct 74 ms 1860 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1582 ms 5440 KB Output is correct
2 Correct 1587 ms 5384 KB Output is correct
3 Correct 1580 ms 5456 KB Output is correct
4 Correct 1481 ms 5472 KB Output is correct
5 Correct 337 ms 6912 KB Output is correct
6 Correct 216 ms 7032 KB Output is correct
7 Correct 1585 ms 5528 KB Output is correct
8 Correct 1574 ms 5288 KB Output is correct
9 Correct 1631 ms 5288 KB Output is correct
10 Correct 1628 ms 4348 KB Output is correct
11 Correct 1737 ms 4492 KB Output is correct
12 Correct 1124 ms 6300 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 214 ms 3924 KB Output is correct
2 Correct 193 ms 3972 KB Output is correct
3 Correct 301 ms 4052 KB Output is correct
4 Correct 186 ms 4044 KB Output is correct
5 Correct 767 ms 6544 KB Output is correct
6 Correct 956 ms 5848 KB Output is correct
7 Correct 888 ms 6140 KB Output is correct
8 Correct 242 ms 7220 KB Output is correct
9 Correct 780 ms 8464 KB Output is correct
10 Correct 1972 ms 7376 KB Output is correct
11 Correct 1543 ms 4472 KB Output is correct
12 Correct 1911 ms 7544 KB Output is correct
13 Correct 2277 ms 6956 KB Output is correct
14 Correct 3001 ms 5572 KB Output is correct
15 Correct 3159 ms 5372 KB Output is correct
16 Correct 2748 ms 4828 KB Output is correct
17 Correct 1143 ms 5452 KB Output is correct
18 Correct 1141 ms 5596 KB Output is correct
19 Correct 1108 ms 5556 KB Output is correct
20 Correct 1132 ms 5408 KB Output is correct
21 Correct 1885 ms 4392 KB Output is correct
22 Correct 3011 ms 5752 KB Output is correct
23 Correct 2690 ms 6416 KB Output is correct
24 Correct 2933 ms 6016 KB Output is correct
25 Correct 291 ms 4048 KB Output is correct
26 Correct 218 ms 4056 KB Output is correct
27 Correct 219 ms 4188 KB Output is correct
28 Correct 200 ms 4276 KB Output is correct
29 Correct 2488 ms 6864 KB Output is correct
30 Correct 2456 ms 6584 KB Output is correct
31 Correct 653 ms 8224 KB Output is correct
32 Correct 1986 ms 7236 KB Output is correct
33 Correct 2174 ms 7088 KB Output is correct
34 Correct 2930 ms 5352 KB Output is correct
35 Correct 2585 ms 6196 KB Output is correct
36 Correct 2017 ms 7020 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 185 ms 4308 KB Output is correct
2 Correct 180 ms 4052 KB Output is correct
3 Correct 188 ms 3928 KB Output is correct
4 Correct 201 ms 4048 KB Output is correct
5 Correct 929 ms 6700 KB Output is correct
6 Correct 1558 ms 3644 KB Output is correct
7 Correct 772 ms 6560 KB Output is correct
8 Correct 1664 ms 3984 KB Output is correct
9 Correct 3109 ms 5708 KB Output is correct
10 Correct 1896 ms 7044 KB Output is correct
11 Correct 2751 ms 3948 KB Output is correct
12 Correct 410 ms 6496 KB Output is correct
13 Correct 2407 ms 6012 KB Output is correct
14 Correct 3095 ms 4628 KB Output is correct
15 Correct 775 ms 7032 KB Output is correct
16 Correct 2180 ms 6068 KB Output is correct
17 Correct 1594 ms 4360 KB Output is correct
18 Correct 1547 ms 4256 KB Output is correct
19 Correct 1547 ms 4176 KB Output is correct
20 Correct 1615 ms 4248 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1584 KB Output is correct
3 Correct 16 ms 1784 KB Output is correct
4 Correct 10 ms 1912 KB Output is correct
5 Correct 18 ms 1912 KB Output is correct
6 Correct 22 ms 1912 KB Output is correct
7 Correct 35 ms 1868 KB Output is correct
8 Correct 67 ms 1912 KB Output is correct
9 Correct 106 ms 1912 KB Output is correct
10 Correct 52 ms 1916 KB Output is correct
11 Correct 36 ms 1856 KB Output is correct
12 Correct 36 ms 1912 KB Output is correct
13 Correct 32 ms 1980 KB Output is correct
14 Correct 79 ms 1892 KB Output is correct
15 Correct 9 ms 1784 KB Output is correct
16 Correct 12 ms 1784 KB Output is correct
17 Correct 84 ms 1856 KB Output is correct
18 Correct 56 ms 1964 KB Output is correct
19 Correct 145 ms 1972 KB Output is correct
20 Correct 74 ms 1860 KB Output is correct
21 Correct 1582 ms 5440 KB Output is correct
22 Correct 1587 ms 5384 KB Output is correct
23 Correct 1580 ms 5456 KB Output is correct
24 Correct 1481 ms 5472 KB Output is correct
25 Correct 337 ms 6912 KB Output is correct
26 Correct 216 ms 7032 KB Output is correct
27 Correct 1585 ms 5528 KB Output is correct
28 Correct 1574 ms 5288 KB Output is correct
29 Correct 1631 ms 5288 KB Output is correct
30 Correct 1628 ms 4348 KB Output is correct
31 Correct 1737 ms 4492 KB Output is correct
32 Correct 1124 ms 6300 KB Output is correct
33 Correct 185 ms 4308 KB Output is correct
34 Correct 180 ms 4052 KB Output is correct
35 Correct 188 ms 3928 KB Output is correct
36 Correct 201 ms 4048 KB Output is correct
37 Correct 929 ms 6700 KB Output is correct
38 Correct 1558 ms 3644 KB Output is correct
39 Correct 772 ms 6560 KB Output is correct
40 Correct 1664 ms 3984 KB Output is correct
41 Correct 3109 ms 5708 KB Output is correct
42 Correct 1896 ms 7044 KB Output is correct
43 Correct 2751 ms 3948 KB Output is correct
44 Correct 410 ms 6496 KB Output is correct
45 Correct 2407 ms 6012 KB Output is correct
46 Correct 3095 ms 4628 KB Output is correct
47 Correct 775 ms 7032 KB Output is correct
48 Correct 2180 ms 6068 KB Output is correct
49 Correct 1594 ms 4360 KB Output is correct
50 Correct 1547 ms 4256 KB Output is correct
51 Correct 1547 ms 4176 KB Output is correct
52 Correct 1615 ms 4248 KB Output is correct
53 Correct 211 ms 3168 KB Output is correct
54 Correct 214 ms 3196 KB Output is correct
55 Correct 180 ms 3156 KB Output is correct
56 Correct 186 ms 3192 KB Output is correct
57 Correct 1743 ms 3688 KB Output is correct
58 Correct 1470 ms 2508 KB Output is correct
59 Correct 1366 ms 4704 KB Output is correct
60 Correct 1417 ms 2492 KB Output is correct
61 Correct 2451 ms 5980 KB Output is correct
62 Correct 969 ms 7252 KB Output is correct
63 Correct 558 ms 6684 KB Output is correct
64 Correct 925 ms 7304 KB Output is correct
65 Correct 2937 ms 4388 KB Output is correct
66 Correct 2830 ms 3996 KB Output is correct
67 Correct 2174 ms 6228 KB Output is correct
68 Correct 2827 ms 5588 KB Output is correct
69 Correct 1546 ms 4232 KB Output is correct
70 Correct 1569 ms 4428 KB Output is correct
71 Correct 1648 ms 4324 KB Output is correct
72 Correct 1608 ms 4432 KB Output is correct
73 Correct 3143 ms 4424 KB Output is correct
74 Correct 2926 ms 5444 KB Output is correct
75 Correct 225 ms 6128 KB Output is correct
76 Correct 543 ms 6532 KB Output is correct
77 Correct 204 ms 3276 KB Output is correct
78 Correct 185 ms 3156 KB Output is correct
79 Correct 208 ms 3208 KB Output is correct
80 Correct 190 ms 3156 KB Output is correct
81 Correct 2935 ms 5428 KB Output is correct
82 Correct 3177 ms 4508 KB Output is correct
83 Correct 2730 ms 4152 KB Output is correct
84 Correct 2942 ms 5296 KB Output is correct
85 Correct 2134 ms 6180 KB Output is correct
86 Correct 1999 ms 6428 KB Output is correct
87 Correct 3101 ms 4884 KB Output is correct
88 Correct 2677 ms 4008 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1584 KB Output is correct
3 Correct 16 ms 1784 KB Output is correct
4 Correct 10 ms 1912 KB Output is correct
5 Correct 18 ms 1912 KB Output is correct
6 Correct 22 ms 1912 KB Output is correct
7 Correct 35 ms 1868 KB Output is correct
8 Correct 67 ms 1912 KB Output is correct
9 Correct 106 ms 1912 KB Output is correct
10 Correct 52 ms 1916 KB Output is correct
11 Correct 36 ms 1856 KB Output is correct
12 Correct 36 ms 1912 KB Output is correct
13 Correct 32 ms 1980 KB Output is correct
14 Correct 79 ms 1892 KB Output is correct
15 Correct 9 ms 1784 KB Output is correct
16 Correct 12 ms 1784 KB Output is correct
17 Correct 84 ms 1856 KB Output is correct
18 Correct 56 ms 1964 KB Output is correct
19 Correct 145 ms 1972 KB Output is correct
20 Correct 74 ms 1860 KB Output is correct
21 Correct 1582 ms 5440 KB Output is correct
22 Correct 1587 ms 5384 KB Output is correct
23 Correct 1580 ms 5456 KB Output is correct
24 Correct 1481 ms 5472 KB Output is correct
25 Correct 337 ms 6912 KB Output is correct
26 Correct 216 ms 7032 KB Output is correct
27 Correct 1585 ms 5528 KB Output is correct
28 Correct 1574 ms 5288 KB Output is correct
29 Correct 1631 ms 5288 KB Output is correct
30 Correct 1628 ms 4348 KB Output is correct
31 Correct 1737 ms 4492 KB Output is correct
32 Correct 1124 ms 6300 KB Output is correct
33 Correct 214 ms 3924 KB Output is correct
34 Correct 193 ms 3972 KB Output is correct
35 Correct 301 ms 4052 KB Output is correct
36 Correct 186 ms 4044 KB Output is correct
37 Correct 767 ms 6544 KB Output is correct
38 Correct 956 ms 5848 KB Output is correct
39 Correct 888 ms 6140 KB Output is correct
40 Correct 242 ms 7220 KB Output is correct
41 Correct 780 ms 8464 KB Output is correct
42 Correct 1972 ms 7376 KB Output is correct
43 Correct 1543 ms 4472 KB Output is correct
44 Correct 1911 ms 7544 KB Output is correct
45 Correct 2277 ms 6956 KB Output is correct
46 Correct 3001 ms 5572 KB Output is correct
47 Correct 3159 ms 5372 KB Output is correct
48 Correct 2748 ms 4828 KB Output is correct
49 Correct 1143 ms 5452 KB Output is correct
50 Correct 1141 ms 5596 KB Output is correct
51 Correct 1108 ms 5556 KB Output is correct
52 Correct 1132 ms 5408 KB Output is correct
53 Correct 1885 ms 4392 KB Output is correct
54 Correct 3011 ms 5752 KB Output is correct
55 Correct 2690 ms 6416 KB Output is correct
56 Correct 2933 ms 6016 KB Output is correct
57 Correct 291 ms 4048 KB Output is correct
58 Correct 218 ms 4056 KB Output is correct
59 Correct 219 ms 4188 KB Output is correct
60 Correct 200 ms 4276 KB Output is correct
61 Correct 2488 ms 6864 KB Output is correct
62 Correct 2456 ms 6584 KB Output is correct
63 Correct 653 ms 8224 KB Output is correct
64 Correct 1986 ms 7236 KB Output is correct
65 Correct 2174 ms 7088 KB Output is correct
66 Correct 2930 ms 5352 KB Output is correct
67 Correct 2585 ms 6196 KB Output is correct
68 Correct 2017 ms 7020 KB Output is correct
69 Correct 185 ms 4308 KB Output is correct
70 Correct 180 ms 4052 KB Output is correct
71 Correct 188 ms 3928 KB Output is correct
72 Correct 201 ms 4048 KB Output is correct
73 Correct 929 ms 6700 KB Output is correct
74 Correct 1558 ms 3644 KB Output is correct
75 Correct 772 ms 6560 KB Output is correct
76 Correct 1664 ms 3984 KB Output is correct
77 Correct 3109 ms 5708 KB Output is correct
78 Correct 1896 ms 7044 KB Output is correct
79 Correct 2751 ms 3948 KB Output is correct
80 Correct 410 ms 6496 KB Output is correct
81 Correct 2407 ms 6012 KB Output is correct
82 Correct 3095 ms 4628 KB Output is correct
83 Correct 775 ms 7032 KB Output is correct
84 Correct 2180 ms 6068 KB Output is correct
85 Correct 1594 ms 4360 KB Output is correct
86 Correct 1547 ms 4256 KB Output is correct
87 Correct 1547 ms 4176 KB Output is correct
88 Correct 1615 ms 4248 KB Output is correct
89 Correct 211 ms 3168 KB Output is correct
90 Correct 214 ms 3196 KB Output is correct
91 Correct 180 ms 3156 KB Output is correct
92 Correct 186 ms 3192 KB Output is correct
93 Correct 1743 ms 3688 KB Output is correct
94 Correct 1470 ms 2508 KB Output is correct
95 Correct 1366 ms 4704 KB Output is correct
96 Correct 1417 ms 2492 KB Output is correct
97 Correct 2451 ms 5980 KB Output is correct
98 Correct 969 ms 7252 KB Output is correct
99 Correct 558 ms 6684 KB Output is correct
100 Correct 925 ms 7304 KB Output is correct
101 Correct 2937 ms 4388 KB Output is correct
102 Correct 2830 ms 3996 KB Output is correct
103 Correct 2174 ms 6228 KB Output is correct
104 Correct 2827 ms 5588 KB Output is correct
105 Correct 1546 ms 4232 KB Output is correct
106 Correct 1569 ms 4428 KB Output is correct
107 Correct 1648 ms 4324 KB Output is correct
108 Correct 1608 ms 4432 KB Output is correct
109 Correct 3143 ms 4424 KB Output is correct
110 Correct 2926 ms 5444 KB Output is correct
111 Correct 225 ms 6128 KB Output is correct
112 Correct 543 ms 6532 KB Output is correct
113 Correct 204 ms 3276 KB Output is correct
114 Correct 185 ms 3156 KB Output is correct
115 Correct 208 ms 3208 KB Output is correct
116 Correct 190 ms 3156 KB Output is correct
117 Correct 2935 ms 5428 KB Output is correct
118 Correct 3177 ms 4508 KB Output is correct
119 Correct 2730 ms 4152 KB Output is correct
120 Correct 2942 ms 5296 KB Output is correct
121 Correct 2134 ms 6180 KB Output is correct
122 Correct 1999 ms 6428 KB Output is correct
123 Correct 3101 ms 4884 KB Output is correct
124 Correct 2677 ms 4008 KB Output is correct
125 Correct 449 ms 4860 KB Output is correct
126 Correct 498 ms 4912 KB Output is correct
127 Correct 647 ms 4796 KB Output is correct
128 Correct 496 ms 4872 KB Output is correct
129 Correct 438 ms 4728 KB Output is correct
130 Correct 539 ms 4772 KB Output is correct
131 Correct 3715 ms 3736 KB Output is correct
132 Correct 4785 ms 6556 KB Output is correct
133 Correct 3527 ms 8564 KB Output is correct
134 Correct 4288 ms 4376 KB Output is correct
135 Correct 3249 ms 8816 KB Output is correct
136 Correct 2579 ms 2872 KB Output is correct
137 Correct 2081 ms 13076 KB Output is correct
138 Execution timed out 5051 ms 9368 KB Time limit exceeded
139 Halted 0 ms 0 KB -