oj.uz

Submission #161327

# Submission time Handle Problem Language Result Execution time Memory
161327 2019-11-01T20:22:00 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 5000 ms 8224 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 = 150;
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 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 10 ms 1656 KB Output is correct
4 Correct 16 ms 1656 KB Output is correct
5 Correct 19 ms 1912 KB Output is correct
6 Correct 47 ms 1784 KB Output is correct
7 Correct 35 ms 1784 KB Output is correct
8 Correct 70 ms 1888 KB Output is correct
9 Correct 76 ms 1852 KB Output is correct
10 Correct 30 ms 1912 KB Output is correct
11 Correct 37 ms 1784 KB Output is correct
12 Correct 37 ms 1784 KB Output is correct
13 Correct 31 ms 1912 KB Output is correct
14 Correct 76 ms 1816 KB Output is correct
15 Correct 9 ms 1692 KB Output is correct
16 Correct 12 ms 1656 KB Output is correct
17 Correct 74 ms 1784 KB Output is correct
18 Correct 50 ms 1784 KB Output is correct
19 Correct 77 ms 1784 KB Output is correct
20 Correct 89 ms 1912 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1993 ms 4668 KB Output is correct
2 Correct 2049 ms 4736 KB Output is correct
3 Correct 2001 ms 4772 KB Output is correct
4 Correct 1908 ms 5092 KB Output is correct
5 Correct 446 ms 6532 KB Output is correct
6 Correct 288 ms 6900 KB Output is correct
7 Correct 2160 ms 5388 KB Output is correct
8 Correct 2031 ms 5316 KB Output is correct
9 Correct 2035 ms 5440 KB Output is correct
10 Correct 2110 ms 4160 KB Output is correct
11 Correct 2118 ms 4476 KB Output is correct
12 Correct 1520 ms 6264 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 241 ms 4184 KB Output is correct
2 Correct 182 ms 4308 KB Output is correct
3 Correct 320 ms 4272 KB Output is correct
4 Correct 189 ms 4276 KB Output is correct
5 Correct 1325 ms 6500 KB Output is correct
6 Correct 1492 ms 5828 KB Output is correct
7 Correct 1400 ms 6156 KB Output is correct
8 Correct 381 ms 7180 KB Output is correct
9 Correct 797 ms 8224 KB Output is correct
10 Correct 2374 ms 7048 KB Output is correct
11 Correct 1571 ms 4356 KB Output is correct
12 Correct 2332 ms 7376 KB Output is correct
13 Correct 2487 ms 6960 KB Output is correct
14 Correct 3123 ms 5712 KB Output is correct
15 Correct 3421 ms 5384 KB Output is correct
16 Correct 2911 ms 5012 KB Output is correct
17 Correct 1684 ms 5420 KB Output is correct
18 Correct 1665 ms 5360 KB Output is correct
19 Correct 1675 ms 5320 KB Output is correct
20 Correct 1683 ms 5292 KB Output is correct
21 Correct 2013 ms 4568 KB Output is correct
22 Correct 3233 ms 5816 KB Output is correct
23 Correct 2878 ms 6264 KB Output is correct
24 Correct 3206 ms 5948 KB Output is correct
25 Correct 226 ms 4220 KB Output is correct
26 Correct 195 ms 4328 KB Output is correct
27 Correct 226 ms 4036 KB Output is correct
28 Correct 209 ms 4172 KB Output is correct
29 Correct 2702 ms 6700 KB Output is correct
30 Correct 2728 ms 6612 KB Output is correct
31 Correct 730 ms 7220 KB Output is correct
32 Correct 2280 ms 6196 KB Output is correct
33 Correct 2383 ms 5960 KB Output is correct
34 Correct 3083 ms 4504 KB Output is correct
35 Correct 2906 ms 5228 KB Output is correct
36 Correct 2252 ms 6032 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 180 ms 3156 KB Output is correct
2 Correct 202 ms 3304 KB Output is correct
3 Correct 189 ms 3072 KB Output is correct
4 Correct 202 ms 3048 KB Output is correct
5 Correct 1271 ms 5428 KB Output is correct
6 Correct 1662 ms 2732 KB Output is correct
7 Correct 1006 ms 5632 KB Output is correct
8 Correct 1803 ms 2964 KB Output is correct
9 Correct 3282 ms 4756 KB Output is correct
10 Correct 1997 ms 6616 KB Output is correct
11 Correct 2858 ms 3956 KB Output is correct
12 Correct 458 ms 6480 KB Output is correct
13 Correct 2583 ms 5720 KB Output is correct
14 Correct 3329 ms 4768 KB Output is correct
15 Correct 865 ms 7120 KB Output is correct
16 Correct 2471 ms 5968 KB Output is correct
17 Correct 2084 ms 4356 KB Output is correct
18 Correct 1999 ms 4240 KB Output is correct
19 Correct 1980 ms 4212 KB Output is correct
20 Correct 1984 ms 4144 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 1528 KB Output is correct
3 Correct 10 ms 1656 KB Output is correct
4 Correct 16 ms 1656 KB Output is correct
5 Correct 19 ms 1912 KB Output is correct
6 Correct 47 ms 1784 KB Output is correct
7 Correct 35 ms 1784 KB Output is correct
8 Correct 70 ms 1888 KB Output is correct
9 Correct 76 ms 1852 KB Output is correct
10 Correct 30 ms 1912 KB Output is correct
11 Correct 37 ms 1784 KB Output is correct
12 Correct 37 ms 1784 KB Output is correct
13 Correct 31 ms 1912 KB Output is correct
14 Correct 76 ms 1816 KB Output is correct
15 Correct 9 ms 1692 KB Output is correct
16 Correct 12 ms 1656 KB Output is correct
17 Correct 74 ms 1784 KB Output is correct
18 Correct 50 ms 1784 KB Output is correct
19 Correct 77 ms 1784 KB Output is correct
20 Correct 89 ms 1912 KB Output is correct
21 Correct 1993 ms 4668 KB Output is correct
22 Correct 2049 ms 4736 KB Output is correct
23 Correct 2001 ms 4772 KB Output is correct
24 Correct 1908 ms 5092 KB Output is correct
25 Correct 446 ms 6532 KB Output is correct
26 Correct 288 ms 6900 KB Output is correct
27 Correct 2160 ms 5388 KB Output is correct
28 Correct 2031 ms 5316 KB Output is correct
29 Correct 2035 ms 5440 KB Output is correct
30 Correct 2110 ms 4160 KB Output is correct
31 Correct 2118 ms 4476 KB Output is correct
32 Correct 1520 ms 6264 KB Output is correct
33 Correct 180 ms 3156 KB Output is correct
34 Correct 202 ms 3304 KB Output is correct
35 Correct 189 ms 3072 KB Output is correct
36 Correct 202 ms 3048 KB Output is correct
37 Correct 1271 ms 5428 KB Output is correct
38 Correct 1662 ms 2732 KB Output is correct
39 Correct 1006 ms 5632 KB Output is correct
40 Correct 1803 ms 2964 KB Output is correct
41 Correct 3282 ms 4756 KB Output is correct
42 Correct 1997 ms 6616 KB Output is correct
43 Correct 2858 ms 3956 KB Output is correct
44 Correct 458 ms 6480 KB Output is correct
45 Correct 2583 ms 5720 KB Output is correct
46 Correct 3329 ms 4768 KB Output is correct
47 Correct 865 ms 7120 KB Output is correct
48 Correct 2471 ms 5968 KB Output is correct
49 Correct 2084 ms 4356 KB Output is correct
50 Correct 1999 ms 4240 KB Output is correct
51 Correct 1980 ms 4212 KB Output is correct
52 Correct 1984 ms 4144 KB Output is correct
53 Correct 208 ms 3312 KB Output is correct
54 Correct 212 ms 3264 KB Output is correct
55 Correct 247 ms 3276 KB Output is correct
56 Correct 188 ms 3156 KB Output is correct
57 Correct 2090 ms 3576 KB Output is correct
58 Correct 1617 ms 2532 KB Output is correct
59 Correct 1769 ms 4716 KB Output is correct
60 Correct 1468 ms 2404 KB Output is correct
61 Correct 2669 ms 5780 KB Output is correct
62 Correct 1087 ms 7176 KB Output is correct
63 Correct 630 ms 6428 KB Output is correct
64 Correct 1116 ms 7232 KB Output is correct
65 Correct 3147 ms 4336 KB Output is correct
66 Correct 2950 ms 3836 KB Output is correct
67 Correct 2367 ms 6028 KB Output is correct
68 Correct 2946 ms 5224 KB Output is correct
69 Correct 2004 ms 4324 KB Output is correct
70 Correct 1982 ms 4292 KB Output is correct
71 Correct 2005 ms 4208 KB Output is correct
72 Correct 2039 ms 4128 KB Output is correct
73 Correct 3285 ms 4436 KB Output is correct
74 Correct 3319 ms 5332 KB Output is correct
75 Correct 241 ms 6212 KB Output is correct
76 Correct 572 ms 6532 KB Output is correct
77 Correct 197 ms 3152 KB Output is correct
78 Correct 194 ms 3136 KB Output is correct
79 Correct 221 ms 3292 KB Output is correct
80 Correct 190 ms 3280 KB Output is correct
81 Correct 3137 ms 5172 KB Output is correct
82 Correct 3407 ms 4436 KB Output is correct
83 Correct 2784 ms 3760 KB Output is correct
84 Correct 3127 ms 5116 KB Output is correct
85 Correct 2335 ms 6036 KB Output is correct
86 Correct 2152 ms 6352 KB Output is correct
87 Correct 3276 ms 4960 KB Output is correct
88 Correct 3023 ms 4028 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 1528 KB Output is correct
3 Correct 10 ms 1656 KB Output is correct
4 Correct 16 ms 1656 KB Output is correct
5 Correct 19 ms 1912 KB Output is correct
6 Correct 47 ms 1784 KB Output is correct
7 Correct 35 ms 1784 KB Output is correct
8 Correct 70 ms 1888 KB Output is correct
9 Correct 76 ms 1852 KB Output is correct
10 Correct 30 ms 1912 KB Output is correct
11 Correct 37 ms 1784 KB Output is correct
12 Correct 37 ms 1784 KB Output is correct
13 Correct 31 ms 1912 KB Output is correct
14 Correct 76 ms 1816 KB Output is correct
15 Correct 9 ms 1692 KB Output is correct
16 Correct 12 ms 1656 KB Output is correct
17 Correct 74 ms 1784 KB Output is correct
18 Correct 50 ms 1784 KB Output is correct
19 Correct 77 ms 1784 KB Output is correct
20 Correct 89 ms 1912 KB Output is correct
21 Correct 1993 ms 4668 KB Output is correct
22 Correct 2049 ms 4736 KB Output is correct
23 Correct 2001 ms 4772 KB Output is correct
24 Correct 1908 ms 5092 KB Output is correct
25 Correct 446 ms 6532 KB Output is correct
26 Correct 288 ms 6900 KB Output is correct
27 Correct 2160 ms 5388 KB Output is correct
28 Correct 2031 ms 5316 KB Output is correct
29 Correct 2035 ms 5440 KB Output is correct
30 Correct 2110 ms 4160 KB Output is correct
31 Correct 2118 ms 4476 KB Output is correct
32 Correct 1520 ms 6264 KB Output is correct
33 Correct 241 ms 4184 KB Output is correct
34 Correct 182 ms 4308 KB Output is correct
35 Correct 320 ms 4272 KB Output is correct
36 Correct 189 ms 4276 KB Output is correct
37 Correct 1325 ms 6500 KB Output is correct
38 Correct 1492 ms 5828 KB Output is correct
39 Correct 1400 ms 6156 KB Output is correct
40 Correct 381 ms 7180 KB Output is correct
41 Correct 797 ms 8224 KB Output is correct
42 Correct 2374 ms 7048 KB Output is correct
43 Correct 1571 ms 4356 KB Output is correct
44 Correct 2332 ms 7376 KB Output is correct
45 Correct 2487 ms 6960 KB Output is correct
46 Correct 3123 ms 5712 KB Output is correct
47 Correct 3421 ms 5384 KB Output is correct
48 Correct 2911 ms 5012 KB Output is correct
49 Correct 1684 ms 5420 KB Output is correct
50 Correct 1665 ms 5360 KB Output is correct
51 Correct 1675 ms 5320 KB Output is correct
52 Correct 1683 ms 5292 KB Output is correct
53 Correct 2013 ms 4568 KB Output is correct
54 Correct 3233 ms 5816 KB Output is correct
55 Correct 2878 ms 6264 KB Output is correct
56 Correct 3206 ms 5948 KB Output is correct
57 Correct 226 ms 4220 KB Output is correct
58 Correct 195 ms 4328 KB Output is correct
59 Correct 226 ms 4036 KB Output is correct
60 Correct 209 ms 4172 KB Output is correct
61 Correct 2702 ms 6700 KB Output is correct
62 Correct 2728 ms 6612 KB Output is correct
63 Correct 730 ms 7220 KB Output is correct
64 Correct 2280 ms 6196 KB Output is correct
65 Correct 2383 ms 5960 KB Output is correct
66 Correct 3083 ms 4504 KB Output is correct
67 Correct 2906 ms 5228 KB Output is correct
68 Correct 2252 ms 6032 KB Output is correct
69 Correct 180 ms 3156 KB Output is correct
70 Correct 202 ms 3304 KB Output is correct
71 Correct 189 ms 3072 KB Output is correct
72 Correct 202 ms 3048 KB Output is correct
73 Correct 1271 ms 5428 KB Output is correct
74 Correct 1662 ms 2732 KB Output is correct
75 Correct 1006 ms 5632 KB Output is correct
76 Correct 1803 ms 2964 KB Output is correct
77 Correct 3282 ms 4756 KB Output is correct
78 Correct 1997 ms 6616 KB Output is correct
79 Correct 2858 ms 3956 KB Output is correct
80 Correct 458 ms 6480 KB Output is correct
81 Correct 2583 ms 5720 KB Output is correct
82 Correct 3329 ms 4768 KB Output is correct
83 Correct 865 ms 7120 KB Output is correct
84 Correct 2471 ms 5968 KB Output is correct
85 Correct 2084 ms 4356 KB Output is correct
86 Correct 1999 ms 4240 KB Output is correct
87 Correct 1980 ms 4212 KB Output is correct
88 Correct 1984 ms 4144 KB Output is correct
89 Correct 208 ms 3312 KB Output is correct
90 Correct 212 ms 3264 KB Output is correct
91 Correct 247 ms 3276 KB Output is correct
92 Correct 188 ms 3156 KB Output is correct
93 Correct 2090 ms 3576 KB Output is correct
94 Correct 1617 ms 2532 KB Output is correct
95 Correct 1769 ms 4716 KB Output is correct
96 Correct 1468 ms 2404 KB Output is correct
97 Correct 2669 ms 5780 KB Output is correct
98 Correct 1087 ms 7176 KB Output is correct
99 Correct 630 ms 6428 KB Output is correct
100 Correct 1116 ms 7232 KB Output is correct
101 Correct 3147 ms 4336 KB Output is correct
102 Correct 2950 ms 3836 KB Output is correct
103 Correct 2367 ms 6028 KB Output is correct
104 Correct 2946 ms 5224 KB Output is correct
105 Correct 2004 ms 4324 KB Output is correct
106 Correct 1982 ms 4292 KB Output is correct
107 Correct 2005 ms 4208 KB Output is correct
108 Correct 2039 ms 4128 KB Output is correct
109 Correct 3285 ms 4436 KB Output is correct
110 Correct 3319 ms 5332 KB Output is correct
111 Correct 241 ms 6212 KB Output is correct
112 Correct 572 ms 6532 KB Output is correct
113 Correct 197 ms 3152 KB Output is correct
114 Correct 194 ms 3136 KB Output is correct
115 Correct 221 ms 3292 KB Output is correct
116 Correct 190 ms 3280 KB Output is correct
117 Correct 3137 ms 5172 KB Output is correct
118 Correct 3407 ms 4436 KB Output is correct
119 Correct 2784 ms 3760 KB Output is correct
120 Correct 3127 ms 5116 KB Output is correct
121 Correct 2335 ms 6036 KB Output is correct
122 Correct 2152 ms 6352 KB Output is correct
123 Correct 3276 ms 4960 KB Output is correct
124 Correct 3023 ms 4028 KB Output is correct
125 Correct 486 ms 4664 KB Output is correct
126 Correct 492 ms 4576 KB Output is correct
127 Correct 617 ms 4840 KB Output is correct
128 Correct 506 ms 4800 KB Output is correct
129 Correct 439 ms 4584 KB Output is correct
130 Correct 553 ms 4728 KB Output is correct
131 Correct 4110 ms 3484 KB Output is correct
132 Execution timed out 5024 ms 6424 KB Time limit exceeded
133 Halted 0 ms 0 KB -