oj.uz

Submission #161315

# Submission time Handle Problem Language Result Execution time Memory
161315 2019-11-01T19:32:39 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 5000 ms 6980 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 = 120;
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;
};
 
vector <seg> S;

vector <seg> 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> segs;
 
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 rebuild() { 
	ll q, w;
	lasts.clear();
	ll blocki = 0;
	for (q = 0; q < block; q++) {
		R[q].clear();
		L[q].clear();
	}
	sort(segs.begin(), segs.end(), cmpl);
	for (auto p : segs) {
		IL[p] = -1;
		if (used[p]) {
			continue;
		}
		if (L[blocki].size() > block_sz) {
			blocki++;
		}
		IL[p] = blocki;
		L[blocki].pb(p);
	}
	blocki = 0;
	sort(segs.begin(), segs.end(), cmpr);
	for (auto p: segs) {
		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);
	S.pb(a);
	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;
		}
		if (MNL[q] < l) {
			ans += slowL(q, x, l);
		}
	}
 
	for (q = 0; q < lasts.size(); q++) {
		if (used[lasts[q].i]) {
			continue;
		}
		if (lasts[q].l >= l && 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].i]) {
			continue;
		}
		if (lasts[q].r <= r && 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;
	segs.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 = S.size();
			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:71: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:82:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (w = 0; w < R[q].size(); w++) {
              ~~^~~~~~~~~~~~~
segments.cpp: In function 'void rebuild()':
segments.cpp:89:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'll slowL(ll, ll, ll)':
segments.cpp:151: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:162: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:241: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:281: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:296:5: warning: unused variable 'q' [-Wunused-variable]
  ll q, w;
     ^
segments.cpp:296:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'int main()':
segments.cpp:307:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w, e, a, b, c;
        ^
segments.cpp:307:11: warning: unused variable 'e' [-Wunused-variable]
  ll q, w, e, a, b, c;
           ^
segments.cpp:307:17: warning: unused variable 'b' [-Wunused-variable]
  ll q, w, e, a, b, c;
                 ^
segments.cpp:311:5: warning: unused variable 'nxt' [-Wunused-variable]
  ll nxt = 0;
     ^~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 10 ms 1516 KB Output is correct
4 Correct 10 ms 1528 KB Output is correct
5 Correct 19 ms 1656 KB Output is correct
6 Correct 24 ms 1656 KB Output is correct
7 Correct 37 ms 1524 KB Output is correct
8 Correct 77 ms 1812 KB Output is correct
9 Correct 82 ms 1656 KB Output is correct
10 Correct 33 ms 1752 KB Output is correct
11 Correct 34 ms 1656 KB Output is correct
12 Correct 33 ms 1784 KB Output is correct
13 Correct 35 ms 1788 KB Output is correct
14 Correct 89 ms 1532 KB Output is correct
15 Correct 9 ms 1500 KB Output is correct
16 Correct 13 ms 1516 KB Output is correct
17 Correct 63 ms 1528 KB Output is correct
18 Correct 55 ms 1656 KB Output is correct
19 Correct 74 ms 1608 KB Output is correct
20 Correct 91 ms 1656 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1973 ms 5284 KB Output is correct
2 Correct 2066 ms 4852 KB Output is correct
3 Correct 2124 ms 4864 KB Output is correct
4 Correct 1905 ms 5104 KB Output is correct
5 Correct 430 ms 6648 KB Output is correct
6 Correct 269 ms 6516 KB Output is correct
7 Correct 1993 ms 4832 KB Output is correct
8 Correct 1996 ms 5032 KB Output is correct
9 Correct 1959 ms 4900 KB Output is correct
10 Correct 1907 ms 3812 KB Output is correct
11 Correct 2056 ms 4088 KB Output is correct
12 Correct 1490 ms 5888 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 295 ms 3412 KB Output is correct
2 Correct 248 ms 3320 KB Output is correct
3 Correct 381 ms 3476 KB Output is correct
4 Correct 261 ms 3320 KB Output is correct
5 Correct 1192 ms 5756 KB Output is correct
6 Correct 1470 ms 5452 KB Output is correct
7 Correct 1352 ms 5556 KB Output is correct
8 Correct 349 ms 6652 KB Output is correct
9 Correct 867 ms 6632 KB Output is correct
10 Correct 2616 ms 5772 KB Output is correct
11 Correct 2205 ms 3688 KB Output is correct
12 Correct 2539 ms 5776 KB Output is correct
13 Correct 3020 ms 5596 KB Output is correct
14 Correct 3881 ms 4424 KB Output is correct
15 Correct 3791 ms 4320 KB Output is correct
16 Correct 3452 ms 3960 KB Output is correct
17 Correct 1669 ms 5020 KB Output is correct
18 Correct 1716 ms 5040 KB Output is correct
19 Correct 1734 ms 5132 KB Output is correct
20 Correct 1702 ms 5120 KB Output is correct
21 Correct 2341 ms 3640 KB Output is correct
22 Correct 3993 ms 4748 KB Output is correct
23 Correct 3468 ms 5324 KB Output is correct
24 Correct 3767 ms 4924 KB Output is correct
25 Correct 308 ms 3448 KB Output is correct
26 Correct 270 ms 3292 KB Output is correct
27 Correct 298 ms 3440 KB Output is correct
28 Correct 280 ms 3360 KB Output is correct
29 Correct 3202 ms 5560 KB Output is correct
30 Correct 3248 ms 5460 KB Output is correct
31 Correct 809 ms 6764 KB Output is correct
32 Correct 2632 ms 6128 KB Output is correct
33 Correct 2850 ms 5616 KB Output is correct
34 Correct 3732 ms 4172 KB Output is correct
35 Correct 3317 ms 5204 KB Output is correct
36 Correct 2684 ms 5740 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 264 ms 3064 KB Output is correct
2 Correct 269 ms 3036 KB Output is correct
3 Correct 282 ms 2980 KB Output is correct
4 Correct 274 ms 3192 KB Output is correct
5 Correct 1229 ms 5776 KB Output is correct
6 Correct 1763 ms 3588 KB Output is correct
7 Correct 1034 ms 6064 KB Output is correct
8 Correct 1954 ms 3956 KB Output is correct
9 Correct 3980 ms 4720 KB Output is correct
10 Correct 2514 ms 5992 KB Output is correct
11 Correct 3424 ms 3640 KB Output is correct
12 Correct 471 ms 6504 KB Output is correct
13 Correct 3055 ms 5232 KB Output is correct
14 Correct 3978 ms 4212 KB Output is correct
15 Correct 1002 ms 6512 KB Output is correct
16 Correct 2827 ms 5496 KB Output is correct
17 Correct 1977 ms 4848 KB Output is correct
18 Correct 2001 ms 5092 KB Output is correct
19 Correct 2104 ms 4724 KB Output is correct
20 Correct 1982 ms 4848 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 10 ms 1516 KB Output is correct
4 Correct 10 ms 1528 KB Output is correct
5 Correct 19 ms 1656 KB Output is correct
6 Correct 24 ms 1656 KB Output is correct
7 Correct 37 ms 1524 KB Output is correct
8 Correct 77 ms 1812 KB Output is correct
9 Correct 82 ms 1656 KB Output is correct
10 Correct 33 ms 1752 KB Output is correct
11 Correct 34 ms 1656 KB Output is correct
12 Correct 33 ms 1784 KB Output is correct
13 Correct 35 ms 1788 KB Output is correct
14 Correct 89 ms 1532 KB Output is correct
15 Correct 9 ms 1500 KB Output is correct
16 Correct 13 ms 1516 KB Output is correct
17 Correct 63 ms 1528 KB Output is correct
18 Correct 55 ms 1656 KB Output is correct
19 Correct 74 ms 1608 KB Output is correct
20 Correct 91 ms 1656 KB Output is correct
21 Correct 1973 ms 5284 KB Output is correct
22 Correct 2066 ms 4852 KB Output is correct
23 Correct 2124 ms 4864 KB Output is correct
24 Correct 1905 ms 5104 KB Output is correct
25 Correct 430 ms 6648 KB Output is correct
26 Correct 269 ms 6516 KB Output is correct
27 Correct 1993 ms 4832 KB Output is correct
28 Correct 1996 ms 5032 KB Output is correct
29 Correct 1959 ms 4900 KB Output is correct
30 Correct 1907 ms 3812 KB Output is correct
31 Correct 2056 ms 4088 KB Output is correct
32 Correct 1490 ms 5888 KB Output is correct
33 Correct 264 ms 3064 KB Output is correct
34 Correct 269 ms 3036 KB Output is correct
35 Correct 282 ms 2980 KB Output is correct
36 Correct 274 ms 3192 KB Output is correct
37 Correct 1229 ms 5776 KB Output is correct
38 Correct 1763 ms 3588 KB Output is correct
39 Correct 1034 ms 6064 KB Output is correct
40 Correct 1954 ms 3956 KB Output is correct
41 Correct 3980 ms 4720 KB Output is correct
42 Correct 2514 ms 5992 KB Output is correct
43 Correct 3424 ms 3640 KB Output is correct
44 Correct 471 ms 6504 KB Output is correct
45 Correct 3055 ms 5232 KB Output is correct
46 Correct 3978 ms 4212 KB Output is correct
47 Correct 1002 ms 6512 KB Output is correct
48 Correct 2827 ms 5496 KB Output is correct
49 Correct 1977 ms 4848 KB Output is correct
50 Correct 2001 ms 5092 KB Output is correct
51 Correct 2104 ms 4724 KB Output is correct
52 Correct 1982 ms 4848 KB Output is correct
53 Correct 297 ms 2968 KB Output is correct
54 Correct 328 ms 3024 KB Output is correct
55 Correct 250 ms 2936 KB Output is correct
56 Correct 287 ms 2988 KB Output is correct
57 Correct 2148 ms 4032 KB Output is correct
58 Correct 1615 ms 3540 KB Output is correct
59 Correct 1758 ms 5344 KB Output is correct
60 Correct 1626 ms 3484 KB Output is correct
61 Correct 3093 ms 5472 KB Output is correct
62 Correct 1238 ms 6512 KB Output is correct
63 Correct 715 ms 6636 KB Output is correct
64 Correct 1213 ms 6508 KB Output is correct
65 Correct 3728 ms 3172 KB Output is correct
66 Correct 3424 ms 3048 KB Output is correct
67 Correct 2925 ms 4716 KB Output is correct
68 Correct 3580 ms 4344 KB Output is correct
69 Correct 1997 ms 3952 KB Output is correct
70 Correct 1990 ms 4080 KB Output is correct
71 Correct 1994 ms 4152 KB Output is correct
72 Correct 1991 ms 4080 KB Output is correct
73 Correct 3977 ms 3204 KB Output is correct
74 Correct 3666 ms 4380 KB Output is correct
75 Correct 260 ms 5940 KB Output is correct
76 Correct 660 ms 5740 KB Output is correct
77 Correct 267 ms 2424 KB Output is correct
78 Correct 260 ms 2296 KB Output is correct
79 Correct 291 ms 2424 KB Output is correct
80 Correct 278 ms 2484 KB Output is correct
81 Correct 3719 ms 4228 KB Output is correct
82 Correct 4075 ms 3296 KB Output is correct
83 Correct 3546 ms 2832 KB Output is correct
84 Correct 3740 ms 4320 KB Output is correct
85 Correct 2793 ms 5188 KB Output is correct
86 Correct 2575 ms 5408 KB Output is correct
87 Correct 3883 ms 4096 KB Output is correct
88 Correct 3417 ms 3328 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 10 ms 1516 KB Output is correct
4 Correct 10 ms 1528 KB Output is correct
5 Correct 19 ms 1656 KB Output is correct
6 Correct 24 ms 1656 KB Output is correct
7 Correct 37 ms 1524 KB Output is correct
8 Correct 77 ms 1812 KB Output is correct
9 Correct 82 ms 1656 KB Output is correct
10 Correct 33 ms 1752 KB Output is correct
11 Correct 34 ms 1656 KB Output is correct
12 Correct 33 ms 1784 KB Output is correct
13 Correct 35 ms 1788 KB Output is correct
14 Correct 89 ms 1532 KB Output is correct
15 Correct 9 ms 1500 KB Output is correct
16 Correct 13 ms 1516 KB Output is correct
17 Correct 63 ms 1528 KB Output is correct
18 Correct 55 ms 1656 KB Output is correct
19 Correct 74 ms 1608 KB Output is correct
20 Correct 91 ms 1656 KB Output is correct
21 Correct 1973 ms 5284 KB Output is correct
22 Correct 2066 ms 4852 KB Output is correct
23 Correct 2124 ms 4864 KB Output is correct
24 Correct 1905 ms 5104 KB Output is correct
25 Correct 430 ms 6648 KB Output is correct
26 Correct 269 ms 6516 KB Output is correct
27 Correct 1993 ms 4832 KB Output is correct
28 Correct 1996 ms 5032 KB Output is correct
29 Correct 1959 ms 4900 KB Output is correct
30 Correct 1907 ms 3812 KB Output is correct
31 Correct 2056 ms 4088 KB Output is correct
32 Correct 1490 ms 5888 KB Output is correct
33 Correct 295 ms 3412 KB Output is correct
34 Correct 248 ms 3320 KB Output is correct
35 Correct 381 ms 3476 KB Output is correct
36 Correct 261 ms 3320 KB Output is correct
37 Correct 1192 ms 5756 KB Output is correct
38 Correct 1470 ms 5452 KB Output is correct
39 Correct 1352 ms 5556 KB Output is correct
40 Correct 349 ms 6652 KB Output is correct
41 Correct 867 ms 6632 KB Output is correct
42 Correct 2616 ms 5772 KB Output is correct
43 Correct 2205 ms 3688 KB Output is correct
44 Correct 2539 ms 5776 KB Output is correct
45 Correct 3020 ms 5596 KB Output is correct
46 Correct 3881 ms 4424 KB Output is correct
47 Correct 3791 ms 4320 KB Output is correct
48 Correct 3452 ms 3960 KB Output is correct
49 Correct 1669 ms 5020 KB Output is correct
50 Correct 1716 ms 5040 KB Output is correct
51 Correct 1734 ms 5132 KB Output is correct
52 Correct 1702 ms 5120 KB Output is correct
53 Correct 2341 ms 3640 KB Output is correct
54 Correct 3993 ms 4748 KB Output is correct
55 Correct 3468 ms 5324 KB Output is correct
56 Correct 3767 ms 4924 KB Output is correct
57 Correct 308 ms 3448 KB Output is correct
58 Correct 270 ms 3292 KB Output is correct
59 Correct 298 ms 3440 KB Output is correct
60 Correct 280 ms 3360 KB Output is correct
61 Correct 3202 ms 5560 KB Output is correct
62 Correct 3248 ms 5460 KB Output is correct
63 Correct 809 ms 6764 KB Output is correct
64 Correct 2632 ms 6128 KB Output is correct
65 Correct 2850 ms 5616 KB Output is correct
66 Correct 3732 ms 4172 KB Output is correct
67 Correct 3317 ms 5204 KB Output is correct
68 Correct 2684 ms 5740 KB Output is correct
69 Correct 264 ms 3064 KB Output is correct
70 Correct 269 ms 3036 KB Output is correct
71 Correct 282 ms 2980 KB Output is correct
72 Correct 274 ms 3192 KB Output is correct
73 Correct 1229 ms 5776 KB Output is correct
74 Correct 1763 ms 3588 KB Output is correct
75 Correct 1034 ms 6064 KB Output is correct
76 Correct 1954 ms 3956 KB Output is correct
77 Correct 3980 ms 4720 KB Output is correct
78 Correct 2514 ms 5992 KB Output is correct
79 Correct 3424 ms 3640 KB Output is correct
80 Correct 471 ms 6504 KB Output is correct
81 Correct 3055 ms 5232 KB Output is correct
82 Correct 3978 ms 4212 KB Output is correct
83 Correct 1002 ms 6512 KB Output is correct
84 Correct 2827 ms 5496 KB Output is correct
85 Correct 1977 ms 4848 KB Output is correct
86 Correct 2001 ms 5092 KB Output is correct
87 Correct 2104 ms 4724 KB Output is correct
88 Correct 1982 ms 4848 KB Output is correct
89 Correct 297 ms 2968 KB Output is correct
90 Correct 328 ms 3024 KB Output is correct
91 Correct 250 ms 2936 KB Output is correct
92 Correct 287 ms 2988 KB Output is correct
93 Correct 2148 ms 4032 KB Output is correct
94 Correct 1615 ms 3540 KB Output is correct
95 Correct 1758 ms 5344 KB Output is correct
96 Correct 1626 ms 3484 KB Output is correct
97 Correct 3093 ms 5472 KB Output is correct
98 Correct 1238 ms 6512 KB Output is correct
99 Correct 715 ms 6636 KB Output is correct
100 Correct 1213 ms 6508 KB Output is correct
101 Correct 3728 ms 3172 KB Output is correct
102 Correct 3424 ms 3048 KB Output is correct
103 Correct 2925 ms 4716 KB Output is correct
104 Correct 3580 ms 4344 KB Output is correct
105 Correct 1997 ms 3952 KB Output is correct
106 Correct 1990 ms 4080 KB Output is correct
107 Correct 1994 ms 4152 KB Output is correct
108 Correct 1991 ms 4080 KB Output is correct
109 Correct 3977 ms 3204 KB Output is correct
110 Correct 3666 ms 4380 KB Output is correct
111 Correct 260 ms 5940 KB Output is correct
112 Correct 660 ms 5740 KB Output is correct
113 Correct 267 ms 2424 KB Output is correct
114 Correct 260 ms 2296 KB Output is correct
115 Correct 291 ms 2424 KB Output is correct
116 Correct 278 ms 2484 KB Output is correct
117 Correct 3719 ms 4228 KB Output is correct
118 Correct 4075 ms 3296 KB Output is correct
119 Correct 3546 ms 2832 KB Output is correct
120 Correct 3740 ms 4320 KB Output is correct
121 Correct 2793 ms 5188 KB Output is correct
122 Correct 2575 ms 5408 KB Output is correct
123 Correct 3883 ms 4096 KB Output is correct
124 Correct 3417 ms 3328 KB Output is correct
125 Correct 866 ms 4060 KB Output is correct
126 Correct 853 ms 4108 KB Output is correct
127 Correct 1016 ms 4172 KB Output is correct
128 Correct 910 ms 4068 KB Output is correct
129 Correct 785 ms 4056 KB Output is correct
130 Correct 891 ms 4128 KB Output is correct
131 Correct 4303 ms 4172 KB Output is correct
132 Execution timed out 5069 ms 6980 KB Time limit exceeded
133 Halted 0 ms 0 KB -