oj.uz

Submission #161348

# Submission time Handle Problem Language Result Execution time Memory
161348 2019-11-01T21:26:02 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 5000 ms 16548 KB 
#include <bits/stdc++.h>
#define pb push_back
#define pll pair <ll, ll>
#define MOMI using namespace std;
#define mp make_pair
#define pyshnapyshnakaa ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
#pragma optimize("TKACHENKO-GORYACHENKO")
#pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
 
typedef int ll;
 
typedef long double ld;
 
using namespace std;
 
const ll inf = 2e9 + 500;
const ll maxn = 2e5;
const ll block = 340;
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 1948 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 2116 KB Output is correct
5 Correct 14 ms 2296 KB Output is correct
6 Correct 17 ms 2296 KB Output is correct
7 Correct 38 ms 2140 KB Output is correct
8 Correct 35 ms 2296 KB Output is correct
9 Correct 38 ms 2240 KB Output is correct
10 Correct 16 ms 2296 KB Output is correct
11 Correct 25 ms 2336 KB Output is correct
12 Correct 25 ms 2168 KB Output is correct
13 Correct 17 ms 2296 KB Output is correct
14 Correct 43 ms 2248 KB Output is correct
15 Correct 10 ms 2168 KB Output is correct
16 Correct 11 ms 2168 KB Output is correct
17 Correct 44 ms 2220 KB Output is correct
18 Correct 26 ms 2296 KB Output is correct
19 Correct 42 ms 2216 KB Output is correct
20 Correct 44 ms 2168 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1487 ms 7164 KB Output is correct
2 Correct 1509 ms 7128 KB Output is correct
3 Correct 1571 ms 7216 KB Output is correct
4 Correct 1457 ms 7308 KB Output is correct
5 Correct 359 ms 8632 KB Output is correct
6 Correct 236 ms 8540 KB Output is correct
7 Correct 1492 ms 7252 KB Output is correct
8 Correct 1495 ms 7132 KB Output is correct
9 Correct 1575 ms 7252 KB Output is correct
10 Correct 1282 ms 6300 KB Output is correct
11 Correct 1427 ms 6444 KB Output is correct
12 Correct 1178 ms 7960 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 5520 KB Output is correct
2 Correct 176 ms 5604 KB Output is correct
3 Correct 302 ms 5532 KB Output is correct
4 Correct 178 ms 5476 KB Output is correct
5 Correct 574 ms 7704 KB Output is correct
6 Correct 705 ms 7240 KB Output is correct
7 Correct 657 ms 7692 KB Output is correct
8 Correct 211 ms 8476 KB Output is correct
9 Correct 478 ms 9772 KB Output is correct
10 Correct 1155 ms 8412 KB Output is correct
11 Correct 787 ms 5716 KB Output is correct
12 Correct 1115 ms 8904 KB Output is correct
13 Correct 1297 ms 8212 KB Output is correct
14 Correct 1499 ms 6872 KB Output is correct
15 Correct 1466 ms 6752 KB Output is correct
16 Correct 1590 ms 6188 KB Output is correct
17 Correct 789 ms 6836 KB Output is correct
18 Correct 789 ms 6776 KB Output is correct
19 Correct 793 ms 6768 KB Output is correct
20 Correct 778 ms 6808 KB Output is correct
21 Correct 935 ms 5792 KB Output is correct
22 Correct 1538 ms 7184 KB Output is correct
23 Correct 1462 ms 7620 KB Output is correct
24 Correct 1565 ms 7276 KB Output is correct
25 Correct 223 ms 5660 KB Output is correct
26 Correct 181 ms 5488 KB Output is correct
27 Correct 215 ms 5556 KB Output is correct
28 Correct 193 ms 5540 KB Output is correct
29 Correct 1402 ms 7980 KB Output is correct
30 Correct 1377 ms 8120 KB Output is correct
31 Correct 439 ms 9880 KB Output is correct
32 Correct 1178 ms 8456 KB Output is correct
33 Correct 1268 ms 8260 KB Output is correct
34 Correct 1502 ms 6828 KB Output is correct
35 Correct 1417 ms 7696 KB Output is correct
36 Correct 1218 ms 8412 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 174 ms 5812 KB Output is correct
2 Correct 177 ms 5680 KB Output is correct
3 Correct 178 ms 5688 KB Output is correct
4 Correct 197 ms 5700 KB Output is correct
5 Correct 1012 ms 8136 KB Output is correct
6 Correct 1152 ms 6104 KB Output is correct
7 Correct 815 ms 8364 KB Output is correct
8 Correct 1339 ms 6288 KB Output is correct
9 Correct 1792 ms 7312 KB Output is correct
10 Correct 1336 ms 8952 KB Output is correct
11 Correct 1428 ms 6432 KB Output is correct
12 Correct 311 ms 9864 KB Output is correct
13 Correct 1474 ms 8272 KB Output is correct
14 Correct 1690 ms 7180 KB Output is correct
15 Correct 561 ms 9660 KB Output is correct
16 Correct 1378 ms 8476 KB Output is correct
17 Correct 1540 ms 7168 KB Output is correct
18 Correct 1498 ms 7252 KB Output is correct
19 Correct 1500 ms 7296 KB Output is correct
20 Correct 1511 ms 7148 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1948 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 2116 KB Output is correct
5 Correct 14 ms 2296 KB Output is correct
6 Correct 17 ms 2296 KB Output is correct
7 Correct 38 ms 2140 KB Output is correct
8 Correct 35 ms 2296 KB Output is correct
9 Correct 38 ms 2240 KB Output is correct
10 Correct 16 ms 2296 KB Output is correct
11 Correct 25 ms 2336 KB Output is correct
12 Correct 25 ms 2168 KB Output is correct
13 Correct 17 ms 2296 KB Output is correct
14 Correct 43 ms 2248 KB Output is correct
15 Correct 10 ms 2168 KB Output is correct
16 Correct 11 ms 2168 KB Output is correct
17 Correct 44 ms 2220 KB Output is correct
18 Correct 26 ms 2296 KB Output is correct
19 Correct 42 ms 2216 KB Output is correct
20 Correct 44 ms 2168 KB Output is correct
21 Correct 1487 ms 7164 KB Output is correct
22 Correct 1509 ms 7128 KB Output is correct
23 Correct 1571 ms 7216 KB Output is correct
24 Correct 1457 ms 7308 KB Output is correct
25 Correct 359 ms 8632 KB Output is correct
26 Correct 236 ms 8540 KB Output is correct
27 Correct 1492 ms 7252 KB Output is correct
28 Correct 1495 ms 7132 KB Output is correct
29 Correct 1575 ms 7252 KB Output is correct
30 Correct 1282 ms 6300 KB Output is correct
31 Correct 1427 ms 6444 KB Output is correct
32 Correct 1178 ms 7960 KB Output is correct
33 Correct 174 ms 5812 KB Output is correct
34 Correct 177 ms 5680 KB Output is correct
35 Correct 178 ms 5688 KB Output is correct
36 Correct 197 ms 5700 KB Output is correct
37 Correct 1012 ms 8136 KB Output is correct
38 Correct 1152 ms 6104 KB Output is correct
39 Correct 815 ms 8364 KB Output is correct
40 Correct 1339 ms 6288 KB Output is correct
41 Correct 1792 ms 7312 KB Output is correct
42 Correct 1336 ms 8952 KB Output is correct
43 Correct 1428 ms 6432 KB Output is correct
44 Correct 311 ms 9864 KB Output is correct
45 Correct 1474 ms 8272 KB Output is correct
46 Correct 1690 ms 7180 KB Output is correct
47 Correct 561 ms 9660 KB Output is correct
48 Correct 1378 ms 8476 KB Output is correct
49 Correct 1540 ms 7168 KB Output is correct
50 Correct 1498 ms 7252 KB Output is correct
51 Correct 1500 ms 7296 KB Output is correct
52 Correct 1511 ms 7148 KB Output is correct
53 Correct 225 ms 5752 KB Output is correct
54 Correct 212 ms 5876 KB Output is correct
55 Correct 178 ms 5692 KB Output is correct
56 Correct 180 ms 5728 KB Output is correct
57 Correct 1541 ms 6792 KB Output is correct
58 Correct 1018 ms 6016 KB Output is correct
59 Correct 1413 ms 7568 KB Output is correct
60 Correct 994 ms 5880 KB Output is correct
61 Correct 1565 ms 8496 KB Output is correct
62 Correct 715 ms 9644 KB Output is correct
63 Correct 468 ms 10012 KB Output is correct
64 Correct 669 ms 9800 KB Output is correct
65 Correct 1520 ms 6780 KB Output is correct
66 Correct 1421 ms 6328 KB Output is correct
67 Correct 1349 ms 8524 KB Output is correct
68 Correct 1837 ms 7796 KB Output is correct
69 Correct 1528 ms 7124 KB Output is correct
70 Correct 1627 ms 7236 KB Output is correct
71 Correct 1515 ms 7276 KB Output is correct
72 Correct 1515 ms 7244 KB Output is correct
73 Correct 1816 ms 6964 KB Output is correct
74 Correct 1719 ms 7684 KB Output is correct
75 Correct 236 ms 9088 KB Output is correct
76 Correct 391 ms 10032 KB Output is correct
77 Correct 187 ms 5852 KB Output is correct
78 Correct 177 ms 5648 KB Output is correct
79 Correct 224 ms 5692 KB Output is correct
80 Correct 185 ms 5692 KB Output is correct
81 Correct 1777 ms 7676 KB Output is correct
82 Correct 1687 ms 6804 KB Output is correct
83 Correct 1419 ms 6228 KB Output is correct
84 Correct 1734 ms 7632 KB Output is correct
85 Correct 1366 ms 8572 KB Output is correct
86 Correct 1497 ms 8852 KB Output is correct
87 Correct 1720 ms 7228 KB Output is correct
88 Correct 1333 ms 6284 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1948 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 2116 KB Output is correct
5 Correct 14 ms 2296 KB Output is correct
6 Correct 17 ms 2296 KB Output is correct
7 Correct 38 ms 2140 KB Output is correct
8 Correct 35 ms 2296 KB Output is correct
9 Correct 38 ms 2240 KB Output is correct
10 Correct 16 ms 2296 KB Output is correct
11 Correct 25 ms 2336 KB Output is correct
12 Correct 25 ms 2168 KB Output is correct
13 Correct 17 ms 2296 KB Output is correct
14 Correct 43 ms 2248 KB Output is correct
15 Correct 10 ms 2168 KB Output is correct
16 Correct 11 ms 2168 KB Output is correct
17 Correct 44 ms 2220 KB Output is correct
18 Correct 26 ms 2296 KB Output is correct
19 Correct 42 ms 2216 KB Output is correct
20 Correct 44 ms 2168 KB Output is correct
21 Correct 1487 ms 7164 KB Output is correct
22 Correct 1509 ms 7128 KB Output is correct
23 Correct 1571 ms 7216 KB Output is correct
24 Correct 1457 ms 7308 KB Output is correct
25 Correct 359 ms 8632 KB Output is correct
26 Correct 236 ms 8540 KB Output is correct
27 Correct 1492 ms 7252 KB Output is correct
28 Correct 1495 ms 7132 KB Output is correct
29 Correct 1575 ms 7252 KB Output is correct
30 Correct 1282 ms 6300 KB Output is correct
31 Correct 1427 ms 6444 KB Output is correct
32 Correct 1178 ms 7960 KB Output is correct
33 Correct 224 ms 5520 KB Output is correct
34 Correct 176 ms 5604 KB Output is correct
35 Correct 302 ms 5532 KB Output is correct
36 Correct 178 ms 5476 KB Output is correct
37 Correct 574 ms 7704 KB Output is correct
38 Correct 705 ms 7240 KB Output is correct
39 Correct 657 ms 7692 KB Output is correct
40 Correct 211 ms 8476 KB Output is correct
41 Correct 478 ms 9772 KB Output is correct
42 Correct 1155 ms 8412 KB Output is correct
43 Correct 787 ms 5716 KB Output is correct
44 Correct 1115 ms 8904 KB Output is correct
45 Correct 1297 ms 8212 KB Output is correct
46 Correct 1499 ms 6872 KB Output is correct
47 Correct 1466 ms 6752 KB Output is correct
48 Correct 1590 ms 6188 KB Output is correct
49 Correct 789 ms 6836 KB Output is correct
50 Correct 789 ms 6776 KB Output is correct
51 Correct 793 ms 6768 KB Output is correct
52 Correct 778 ms 6808 KB Output is correct
53 Correct 935 ms 5792 KB Output is correct
54 Correct 1538 ms 7184 KB Output is correct
55 Correct 1462 ms 7620 KB Output is correct
56 Correct 1565 ms 7276 KB Output is correct
57 Correct 223 ms 5660 KB Output is correct
58 Correct 181 ms 5488 KB Output is correct
59 Correct 215 ms 5556 KB Output is correct
60 Correct 193 ms 5540 KB Output is correct
61 Correct 1402 ms 7980 KB Output is correct
62 Correct 1377 ms 8120 KB Output is correct
63 Correct 439 ms 9880 KB Output is correct
64 Correct 1178 ms 8456 KB Output is correct
65 Correct 1268 ms 8260 KB Output is correct
66 Correct 1502 ms 6828 KB Output is correct
67 Correct 1417 ms 7696 KB Output is correct
68 Correct 1218 ms 8412 KB Output is correct
69 Correct 174 ms 5812 KB Output is correct
70 Correct 177 ms 5680 KB Output is correct
71 Correct 178 ms 5688 KB Output is correct
72 Correct 197 ms 5700 KB Output is correct
73 Correct 1012 ms 8136 KB Output is correct
74 Correct 1152 ms 6104 KB Output is correct
75 Correct 815 ms 8364 KB Output is correct
76 Correct 1339 ms 6288 KB Output is correct
77 Correct 1792 ms 7312 KB Output is correct
78 Correct 1336 ms 8952 KB Output is correct
79 Correct 1428 ms 6432 KB Output is correct
80 Correct 311 ms 9864 KB Output is correct
81 Correct 1474 ms 8272 KB Output is correct
82 Correct 1690 ms 7180 KB Output is correct
83 Correct 561 ms 9660 KB Output is correct
84 Correct 1378 ms 8476 KB Output is correct
85 Correct 1540 ms 7168 KB Output is correct
86 Correct 1498 ms 7252 KB Output is correct
87 Correct 1500 ms 7296 KB Output is correct
88 Correct 1511 ms 7148 KB Output is correct
89 Correct 225 ms 5752 KB Output is correct
90 Correct 212 ms 5876 KB Output is correct
91 Correct 178 ms 5692 KB Output is correct
92 Correct 180 ms 5728 KB Output is correct
93 Correct 1541 ms 6792 KB Output is correct
94 Correct 1018 ms 6016 KB Output is correct
95 Correct 1413 ms 7568 KB Output is correct
96 Correct 994 ms 5880 KB Output is correct
97 Correct 1565 ms 8496 KB Output is correct
98 Correct 715 ms 9644 KB Output is correct
99 Correct 468 ms 10012 KB Output is correct
100 Correct 669 ms 9800 KB Output is correct
101 Correct 1520 ms 6780 KB Output is correct
102 Correct 1421 ms 6328 KB Output is correct
103 Correct 1349 ms 8524 KB Output is correct
104 Correct 1837 ms 7796 KB Output is correct
105 Correct 1528 ms 7124 KB Output is correct
106 Correct 1627 ms 7236 KB Output is correct
107 Correct 1515 ms 7276 KB Output is correct
108 Correct 1515 ms 7244 KB Output is correct
109 Correct 1816 ms 6964 KB Output is correct
110 Correct 1719 ms 7684 KB Output is correct
111 Correct 236 ms 9088 KB Output is correct
112 Correct 391 ms 10032 KB Output is correct
113 Correct 187 ms 5852 KB Output is correct
114 Correct 177 ms 5648 KB Output is correct
115 Correct 224 ms 5692 KB Output is correct
116 Correct 185 ms 5692 KB Output is correct
117 Correct 1777 ms 7676 KB Output is correct
118 Correct 1687 ms 6804 KB Output is correct
119 Correct 1419 ms 6228 KB Output is correct
120 Correct 1734 ms 7632 KB Output is correct
121 Correct 1366 ms 8572 KB Output is correct
122 Correct 1497 ms 8852 KB Output is correct
123 Correct 1720 ms 7228 KB Output is correct
124 Correct 1333 ms 6284 KB Output is correct
125 Correct 477 ms 9272 KB Output is correct
126 Correct 512 ms 9048 KB Output is correct
127 Correct 670 ms 9296 KB Output is correct
128 Correct 642 ms 9388 KB Output is correct
129 Correct 537 ms 8936 KB Output is correct
130 Correct 565 ms 9156 KB Output is correct
131 Correct 2889 ms 7420 KB Output is correct
132 Correct 4989 ms 10228 KB Output is correct
133 Correct 4211 ms 12192 KB Output is correct
134 Correct 3768 ms 7776 KB Output is correct
135 Correct 4062 ms 12308 KB Output is correct
136 Correct 1646 ms 6380 KB Output is correct
137 Correct 1840 ms 16548 KB Output is correct
138 Correct 4796 ms 13540 KB Output is correct
139 Correct 3812 ms 13624 KB Output is correct
140 Correct 2557 ms 14712 KB Output is correct
141 Correct 4374 ms 12748 KB Output is correct
142 Correct 2673 ms 8088 KB Output is correct
143 Correct 4145 ms 9032 KB Output is correct
144 Correct 1814 ms 7812 KB Output is correct
145 Correct 2475 ms 14736 KB Output is correct
146 Correct 4698 ms 10308 KB Output is correct
147 Correct 4229 ms 8624 KB Output is correct
148 Correct 4019 ms 8540 KB Output is correct
149 Correct 4980 ms 8724 KB Output is correct
150 Correct 4930 ms 8704 KB Output is correct
151 Execution timed out 5066 ms 8840 KB Time limit exceeded
152 Halted 0 ms 0 KB -