oj.uz

Submission #161324

# Submission time Handle Problem Language Result Execution time Memory
161324 2019-11-01T20:15:08 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 5000 ms 7124 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 = 100;
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.pb(good);
	ll j = bpl(i, x);
	// 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.pb(good);
	ll j = bpr(i, x);
	// 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 1148 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 10 ms 1144 KB Output is correct
4 Correct 10 ms 1144 KB Output is correct
5 Correct 23 ms 1400 KB Output is correct
6 Correct 29 ms 1400 KB Output is correct
7 Correct 39 ms 1272 KB Output is correct
8 Correct 88 ms 1500 KB Output is correct
9 Correct 128 ms 1492 KB Output is correct
10 Correct 40 ms 1400 KB Output is correct
11 Correct 45 ms 1400 KB Output is correct
12 Correct 44 ms 1400 KB Output is correct
13 Correct 42 ms 1488 KB Output is correct
14 Correct 109 ms 1384 KB Output is correct
15 Correct 10 ms 1264 KB Output is correct
16 Correct 13 ms 1272 KB Output is correct
17 Correct 56 ms 1272 KB Output is correct
18 Correct 75 ms 1400 KB Output is correct
19 Correct 66 ms 1272 KB Output is correct
20 Correct 71 ms 1272 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2305 ms 3848 KB Output is correct
2 Correct 2145 ms 4020 KB Output is correct
3 Correct 2149 ms 3888 KB Output is correct
4 Correct 2067 ms 4252 KB Output is correct
5 Correct 437 ms 5748 KB Output is correct
6 Correct 273 ms 5740 KB Output is correct
7 Correct 2175 ms 3944 KB Output is correct
8 Correct 2159 ms 3912 KB Output is correct
9 Correct 2198 ms 3932 KB Output is correct
10 Correct 2308 ms 2592 KB Output is correct
11 Correct 2399 ms 2860 KB Output is correct
12 Correct 1578 ms 5048 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 251 ms 2760 KB Output is correct
2 Correct 211 ms 2772 KB Output is correct
3 Correct 375 ms 2968 KB Output is correct
4 Correct 216 ms 2900 KB Output is correct
5 Correct 1341 ms 5196 KB Output is correct
6 Correct 1678 ms 4464 KB Output is correct
7 Correct 1594 ms 4964 KB Output is correct
8 Correct 371 ms 6136 KB Output is correct
9 Correct 961 ms 6356 KB Output is correct
10 Correct 2919 ms 6132 KB Output is correct
11 Correct 2164 ms 3336 KB Output is correct
12 Correct 2785 ms 6552 KB Output is correct
13 Correct 3293 ms 6092 KB Output is correct
14 Correct 4358 ms 4620 KB Output is correct
15 Correct 4510 ms 4468 KB Output is correct
16 Correct 4094 ms 4032 KB Output is correct
17 Correct 2013 ms 4372 KB Output is correct
18 Correct 1966 ms 4404 KB Output is correct
19 Correct 2015 ms 4400 KB Output is correct
20 Correct 1953 ms 4272 KB Output is correct
21 Correct 2624 ms 3536 KB Output is correct
22 Correct 4409 ms 4804 KB Output is correct
23 Correct 3913 ms 5364 KB Output is correct
24 Correct 4431 ms 5048 KB Output is correct
25 Correct 257 ms 2900 KB Output is correct
26 Correct 223 ms 2792 KB Output is correct
27 Correct 249 ms 2772 KB Output is correct
28 Correct 236 ms 2900 KB Output is correct
29 Correct 3672 ms 5656 KB Output is correct
30 Correct 3784 ms 5748 KB Output is correct
31 Correct 881 ms 6428 KB Output is correct
32 Correct 2880 ms 6260 KB Output is correct
33 Correct 3157 ms 5980 KB Output is correct
34 Correct 4243 ms 4620 KB Output is correct
35 Correct 3904 ms 5252 KB Output is correct
36 Correct 2956 ms 6364 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 210 ms 2948 KB Output is correct
2 Correct 209 ms 2868 KB Output is correct
3 Correct 218 ms 2868 KB Output is correct
4 Correct 233 ms 2772 KB Output is correct
5 Correct 1297 ms 5532 KB Output is correct
6 Correct 2102 ms 2680 KB Output is correct
7 Correct 1031 ms 5680 KB Output is correct
8 Correct 2301 ms 3104 KB Output is correct
9 Correct 4620 ms 4780 KB Output is correct
10 Correct 2624 ms 6712 KB Output is correct
11 Correct 4019 ms 3760 KB Output is correct
12 Correct 544 ms 6008 KB Output is correct
13 Correct 3384 ms 6064 KB Output is correct
14 Correct 4488 ms 4712 KB Output is correct
15 Correct 1079 ms 6584 KB Output is correct
16 Correct 3166 ms 6224 KB Output is correct
17 Correct 2156 ms 4244 KB Output is correct
18 Correct 2211 ms 4272 KB Output is correct
19 Correct 2178 ms 4368 KB Output is correct
20 Correct 2185 ms 4284 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1148 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 10 ms 1144 KB Output is correct
4 Correct 10 ms 1144 KB Output is correct
5 Correct 23 ms 1400 KB Output is correct
6 Correct 29 ms 1400 KB Output is correct
7 Correct 39 ms 1272 KB Output is correct
8 Correct 88 ms 1500 KB Output is correct
9 Correct 128 ms 1492 KB Output is correct
10 Correct 40 ms 1400 KB Output is correct
11 Correct 45 ms 1400 KB Output is correct
12 Correct 44 ms 1400 KB Output is correct
13 Correct 42 ms 1488 KB Output is correct
14 Correct 109 ms 1384 KB Output is correct
15 Correct 10 ms 1264 KB Output is correct
16 Correct 13 ms 1272 KB Output is correct
17 Correct 56 ms 1272 KB Output is correct
18 Correct 75 ms 1400 KB Output is correct
19 Correct 66 ms 1272 KB Output is correct
20 Correct 71 ms 1272 KB Output is correct
21 Correct 2305 ms 3848 KB Output is correct
22 Correct 2145 ms 4020 KB Output is correct
23 Correct 2149 ms 3888 KB Output is correct
24 Correct 2067 ms 4252 KB Output is correct
25 Correct 437 ms 5748 KB Output is correct
26 Correct 273 ms 5740 KB Output is correct
27 Correct 2175 ms 3944 KB Output is correct
28 Correct 2159 ms 3912 KB Output is correct
29 Correct 2198 ms 3932 KB Output is correct
30 Correct 2308 ms 2592 KB Output is correct
31 Correct 2399 ms 2860 KB Output is correct
32 Correct 1578 ms 5048 KB Output is correct
33 Correct 210 ms 2948 KB Output is correct
34 Correct 209 ms 2868 KB Output is correct
35 Correct 218 ms 2868 KB Output is correct
36 Correct 233 ms 2772 KB Output is correct
37 Correct 1297 ms 5532 KB Output is correct
38 Correct 2102 ms 2680 KB Output is correct
39 Correct 1031 ms 5680 KB Output is correct
40 Correct 2301 ms 3104 KB Output is correct
41 Correct 4620 ms 4780 KB Output is correct
42 Correct 2624 ms 6712 KB Output is correct
43 Correct 4019 ms 3760 KB Output is correct
44 Correct 544 ms 6008 KB Output is correct
45 Correct 3384 ms 6064 KB Output is correct
46 Correct 4488 ms 4712 KB Output is correct
47 Correct 1079 ms 6584 KB Output is correct
48 Correct 3166 ms 6224 KB Output is correct
49 Correct 2156 ms 4244 KB Output is correct
50 Correct 2211 ms 4272 KB Output is correct
51 Correct 2178 ms 4368 KB Output is correct
52 Correct 2185 ms 4284 KB Output is correct
53 Correct 237 ms 2776 KB Output is correct
54 Correct 239 ms 2772 KB Output is correct
55 Correct 208 ms 2880 KB Output is correct
56 Correct 216 ms 2832 KB Output is correct
57 Correct 2456 ms 3416 KB Output is correct
58 Correct 2001 ms 2400 KB Output is correct
59 Correct 2189 ms 4672 KB Output is correct
60 Correct 1950 ms 2168 KB Output is correct
61 Correct 3480 ms 6380 KB Output is correct
62 Correct 1514 ms 7060 KB Output is correct
63 Correct 774 ms 6416 KB Output is correct
64 Correct 1309 ms 7124 KB Output is correct
65 Correct 4423 ms 4048 KB Output is correct
66 Correct 4094 ms 3648 KB Output is correct
67 Correct 3286 ms 6200 KB Output is correct
68 Correct 4043 ms 5188 KB Output is correct
69 Correct 2168 ms 4096 KB Output is correct
70 Correct 2192 ms 4024 KB Output is correct
71 Correct 2300 ms 4140 KB Output is correct
72 Correct 2206 ms 4112 KB Output is correct
73 Correct 4551 ms 4280 KB Output is correct
74 Correct 4082 ms 5268 KB Output is correct
75 Correct 298 ms 6124 KB Output is correct
76 Correct 705 ms 6412 KB Output is correct
77 Correct 226 ms 2776 KB Output is correct
78 Correct 215 ms 3036 KB Output is correct
79 Correct 271 ms 2952 KB Output is correct
80 Correct 222 ms 2772 KB Output is correct
81 Correct 4310 ms 5152 KB Output is correct
82 Correct 4581 ms 4460 KB Output is correct
83 Correct 3972 ms 3860 KB Output is correct
84 Correct 4164 ms 5360 KB Output is correct
85 Correct 3029 ms 6324 KB Output is correct
86 Correct 2860 ms 6372 KB Output is correct
87 Correct 4427 ms 4900 KB Output is correct
88 Correct 3949 ms 3968 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1148 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 10 ms 1144 KB Output is correct
4 Correct 10 ms 1144 KB Output is correct
5 Correct 23 ms 1400 KB Output is correct
6 Correct 29 ms 1400 KB Output is correct
7 Correct 39 ms 1272 KB Output is correct
8 Correct 88 ms 1500 KB Output is correct
9 Correct 128 ms 1492 KB Output is correct
10 Correct 40 ms 1400 KB Output is correct
11 Correct 45 ms 1400 KB Output is correct
12 Correct 44 ms 1400 KB Output is correct
13 Correct 42 ms 1488 KB Output is correct
14 Correct 109 ms 1384 KB Output is correct
15 Correct 10 ms 1264 KB Output is correct
16 Correct 13 ms 1272 KB Output is correct
17 Correct 56 ms 1272 KB Output is correct
18 Correct 75 ms 1400 KB Output is correct
19 Correct 66 ms 1272 KB Output is correct
20 Correct 71 ms 1272 KB Output is correct
21 Correct 2305 ms 3848 KB Output is correct
22 Correct 2145 ms 4020 KB Output is correct
23 Correct 2149 ms 3888 KB Output is correct
24 Correct 2067 ms 4252 KB Output is correct
25 Correct 437 ms 5748 KB Output is correct
26 Correct 273 ms 5740 KB Output is correct
27 Correct 2175 ms 3944 KB Output is correct
28 Correct 2159 ms 3912 KB Output is correct
29 Correct 2198 ms 3932 KB Output is correct
30 Correct 2308 ms 2592 KB Output is correct
31 Correct 2399 ms 2860 KB Output is correct
32 Correct 1578 ms 5048 KB Output is correct
33 Correct 251 ms 2760 KB Output is correct
34 Correct 211 ms 2772 KB Output is correct
35 Correct 375 ms 2968 KB Output is correct
36 Correct 216 ms 2900 KB Output is correct
37 Correct 1341 ms 5196 KB Output is correct
38 Correct 1678 ms 4464 KB Output is correct
39 Correct 1594 ms 4964 KB Output is correct
40 Correct 371 ms 6136 KB Output is correct
41 Correct 961 ms 6356 KB Output is correct
42 Correct 2919 ms 6132 KB Output is correct
43 Correct 2164 ms 3336 KB Output is correct
44 Correct 2785 ms 6552 KB Output is correct
45 Correct 3293 ms 6092 KB Output is correct
46 Correct 4358 ms 4620 KB Output is correct
47 Correct 4510 ms 4468 KB Output is correct
48 Correct 4094 ms 4032 KB Output is correct
49 Correct 2013 ms 4372 KB Output is correct
50 Correct 1966 ms 4404 KB Output is correct
51 Correct 2015 ms 4400 KB Output is correct
52 Correct 1953 ms 4272 KB Output is correct
53 Correct 2624 ms 3536 KB Output is correct
54 Correct 4409 ms 4804 KB Output is correct
55 Correct 3913 ms 5364 KB Output is correct
56 Correct 4431 ms 5048 KB Output is correct
57 Correct 257 ms 2900 KB Output is correct
58 Correct 223 ms 2792 KB Output is correct
59 Correct 249 ms 2772 KB Output is correct
60 Correct 236 ms 2900 KB Output is correct
61 Correct 3672 ms 5656 KB Output is correct
62 Correct 3784 ms 5748 KB Output is correct
63 Correct 881 ms 6428 KB Output is correct
64 Correct 2880 ms 6260 KB Output is correct
65 Correct 3157 ms 5980 KB Output is correct
66 Correct 4243 ms 4620 KB Output is correct
67 Correct 3904 ms 5252 KB Output is correct
68 Correct 2956 ms 6364 KB Output is correct
69 Correct 210 ms 2948 KB Output is correct
70 Correct 209 ms 2868 KB Output is correct
71 Correct 218 ms 2868 KB Output is correct
72 Correct 233 ms 2772 KB Output is correct
73 Correct 1297 ms 5532 KB Output is correct
74 Correct 2102 ms 2680 KB Output is correct
75 Correct 1031 ms 5680 KB Output is correct
76 Correct 2301 ms 3104 KB Output is correct
77 Correct 4620 ms 4780 KB Output is correct
78 Correct 2624 ms 6712 KB Output is correct
79 Correct 4019 ms 3760 KB Output is correct
80 Correct 544 ms 6008 KB Output is correct
81 Correct 3384 ms 6064 KB Output is correct
82 Correct 4488 ms 4712 KB Output is correct
83 Correct 1079 ms 6584 KB Output is correct
84 Correct 3166 ms 6224 KB Output is correct
85 Correct 2156 ms 4244 KB Output is correct
86 Correct 2211 ms 4272 KB Output is correct
87 Correct 2178 ms 4368 KB Output is correct
88 Correct 2185 ms 4284 KB Output is correct
89 Correct 237 ms 2776 KB Output is correct
90 Correct 239 ms 2772 KB Output is correct
91 Correct 208 ms 2880 KB Output is correct
92 Correct 216 ms 2832 KB Output is correct
93 Correct 2456 ms 3416 KB Output is correct
94 Correct 2001 ms 2400 KB Output is correct
95 Correct 2189 ms 4672 KB Output is correct
96 Correct 1950 ms 2168 KB Output is correct
97 Correct 3480 ms 6380 KB Output is correct
98 Correct 1514 ms 7060 KB Output is correct
99 Correct 774 ms 6416 KB Output is correct
100 Correct 1309 ms 7124 KB Output is correct
101 Correct 4423 ms 4048 KB Output is correct
102 Correct 4094 ms 3648 KB Output is correct
103 Correct 3286 ms 6200 KB Output is correct
104 Correct 4043 ms 5188 KB Output is correct
105 Correct 2168 ms 4096 KB Output is correct
106 Correct 2192 ms 4024 KB Output is correct
107 Correct 2300 ms 4140 KB Output is correct
108 Correct 2206 ms 4112 KB Output is correct
109 Correct 4551 ms 4280 KB Output is correct
110 Correct 4082 ms 5268 KB Output is correct
111 Correct 298 ms 6124 KB Output is correct
112 Correct 705 ms 6412 KB Output is correct
113 Correct 226 ms 2776 KB Output is correct
114 Correct 215 ms 3036 KB Output is correct
115 Correct 271 ms 2952 KB Output is correct
116 Correct 222 ms 2772 KB Output is correct
117 Correct 4310 ms 5152 KB Output is correct
118 Correct 4581 ms 4460 KB Output is correct
119 Correct 3972 ms 3860 KB Output is correct
120 Correct 4164 ms 5360 KB Output is correct
121 Correct 3029 ms 6324 KB Output is correct
122 Correct 2860 ms 6372 KB Output is correct
123 Correct 4427 ms 4900 KB Output is correct
124 Correct 3949 ms 3968 KB Output is correct
125 Correct 509 ms 4584 KB Output is correct
126 Correct 552 ms 4628 KB Output is correct
127 Correct 724 ms 4860 KB Output is correct
128 Correct 546 ms 4752 KB Output is correct
129 Correct 480 ms 4732 KB Output is correct
130 Correct 602 ms 4860 KB Output is correct
131 Execution timed out 5022 ms 3336 KB Time limit exceeded
132 Halted 0 ms 0 KB -