oj.uz

답안 #161314

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
161314 2019-11-01T19:30:12 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 5000 ms 7756 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;
};
 
inline bool operator==(seg a, seg b) {
	return a.i == b.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;
}

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;
}

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 = (lower_bound(R[i].begin(), R[i].end(), S.size() - 1, 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;
		}
		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:75: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:86: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:93:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'll slowL(ll, ll, ll)':
segments.cpp:155: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:166: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:245: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:285: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:300:5: warning: unused variable 'q' [-Wunused-variable]
  ll q, w;
     ^
segments.cpp:300:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'int main()':
segments.cpp:311:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w, e, a, b, c;
        ^
segments.cpp:311:11: warning: unused variable 'e' [-Wunused-variable]
  ll q, w, e, a, b, c;
           ^
segments.cpp:311:17: warning: unused variable 'b' [-Wunused-variable]
  ll q, w, e, a, b, c;
                 ^
segments.cpp:315:5: warning: unused variable 'nxt' [-Wunused-variable]
  ll nxt = 0;
     ^~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1400 KB Output is correct
3 Correct 15 ms 1400 KB Output is correct
4 Correct 10 ms 1468 KB Output is correct
5 Correct 19 ms 1704 KB Output is correct
6 Correct 24 ms 1576 KB Output is correct
7 Correct 38 ms 1460 KB Output is correct
8 Correct 80 ms 1656 KB Output is correct
9 Correct 81 ms 1528 KB Output is correct
10 Correct 36 ms 1528 KB Output is correct
11 Correct 72 ms 1528 KB Output is correct
12 Correct 36 ms 1528 KB Output is correct
13 Correct 37 ms 1644 KB Output is correct
14 Correct 88 ms 1528 KB Output is correct
15 Correct 9 ms 1396 KB Output is correct
16 Correct 12 ms 1400 KB Output is correct
17 Correct 63 ms 1528 KB Output is correct
18 Correct 55 ms 1528 KB Output is correct
19 Correct 74 ms 1464 KB Output is correct
20 Correct 93 ms 1400 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1759 ms 3924 KB Output is correct
2 Correct 1782 ms 4008 KB Output is correct
3 Correct 1814 ms 4048 KB Output is correct
4 Correct 1674 ms 4240 KB Output is correct
5 Correct 371 ms 5712 KB Output is correct
6 Correct 242 ms 5740 KB Output is correct
7 Correct 1750 ms 4008 KB Output is correct
8 Correct 1758 ms 3988 KB Output is correct
9 Correct 1786 ms 4004 KB Output is correct
10 Correct 1866 ms 2792 KB Output is correct
11 Correct 1943 ms 3176 KB Output is correct
12 Correct 1277 ms 4756 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 296 ms 2260 KB Output is correct
2 Correct 247 ms 2232 KB Output is correct
3 Correct 381 ms 2444 KB Output is correct
4 Correct 258 ms 2344 KB Output is correct
5 Correct 896 ms 4888 KB Output is correct
6 Correct 1120 ms 4408 KB Output is correct
7 Correct 1038 ms 4592 KB Output is correct
8 Correct 272 ms 5740 KB Output is correct
9 Correct 794 ms 5688 KB Output is correct
10 Correct 2476 ms 4796 KB Output is correct
11 Correct 1912 ms 2584 KB Output is correct
12 Correct 2381 ms 4872 KB Output is correct
13 Correct 2892 ms 4592 KB Output is correct
14 Correct 3732 ms 3592 KB Output is correct
15 Correct 3645 ms 3488 KB Output is correct
16 Correct 3368 ms 2984 KB Output is correct
17 Correct 1357 ms 4000 KB Output is correct
18 Correct 1366 ms 3984 KB Output is correct
19 Correct 1350 ms 3968 KB Output is correct
20 Correct 1364 ms 4004 KB Output is correct
21 Correct 2301 ms 2692 KB Output is correct
22 Correct 3677 ms 3784 KB Output is correct
23 Correct 3415 ms 4288 KB Output is correct
24 Correct 3827 ms 3948 KB Output is correct
25 Correct 310 ms 2392 KB Output is correct
26 Correct 285 ms 2296 KB Output is correct
27 Correct 296 ms 2424 KB Output is correct
28 Correct 329 ms 2276 KB Output is correct
29 Correct 3093 ms 4480 KB Output is correct
30 Correct 3118 ms 4424 KB Output is correct
31 Correct 776 ms 5716 KB Output is correct
32 Correct 2514 ms 4808 KB Output is correct
33 Correct 2729 ms 4720 KB Output is correct
34 Correct 3948 ms 3516 KB Output is correct
35 Correct 3352 ms 4060 KB Output is correct
36 Correct 2532 ms 4796 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 267 ms 2256 KB Output is correct
2 Correct 269 ms 2428 KB Output is correct
3 Correct 263 ms 2292 KB Output is correct
4 Correct 274 ms 2296 KB Output is correct
5 Correct 1037 ms 4996 KB Output is correct
6 Correct 1746 ms 2456 KB Output is correct
7 Correct 864 ms 5280 KB Output is correct
8 Correct 2027 ms 2768 KB Output is correct
9 Correct 3860 ms 3684 KB Output is correct
10 Correct 2297 ms 5048 KB Output is correct
11 Correct 3425 ms 2888 KB Output is correct
12 Correct 450 ms 5904 KB Output is correct
13 Correct 2992 ms 4568 KB Output is correct
14 Correct 3808 ms 3512 KB Output is correct
15 Correct 1109 ms 5620 KB Output is correct
16 Correct 2747 ms 4704 KB Output is correct
17 Correct 1781 ms 4092 KB Output is correct
18 Correct 1780 ms 4120 KB Output is correct
19 Correct 1778 ms 4004 KB Output is correct
20 Correct 1769 ms 3988 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1400 KB Output is correct
3 Correct 15 ms 1400 KB Output is correct
4 Correct 10 ms 1468 KB Output is correct
5 Correct 19 ms 1704 KB Output is correct
6 Correct 24 ms 1576 KB Output is correct
7 Correct 38 ms 1460 KB Output is correct
8 Correct 80 ms 1656 KB Output is correct
9 Correct 81 ms 1528 KB Output is correct
10 Correct 36 ms 1528 KB Output is correct
11 Correct 72 ms 1528 KB Output is correct
12 Correct 36 ms 1528 KB Output is correct
13 Correct 37 ms 1644 KB Output is correct
14 Correct 88 ms 1528 KB Output is correct
15 Correct 9 ms 1396 KB Output is correct
16 Correct 12 ms 1400 KB Output is correct
17 Correct 63 ms 1528 KB Output is correct
18 Correct 55 ms 1528 KB Output is correct
19 Correct 74 ms 1464 KB Output is correct
20 Correct 93 ms 1400 KB Output is correct
21 Correct 1759 ms 3924 KB Output is correct
22 Correct 1782 ms 4008 KB Output is correct
23 Correct 1814 ms 4048 KB Output is correct
24 Correct 1674 ms 4240 KB Output is correct
25 Correct 371 ms 5712 KB Output is correct
26 Correct 242 ms 5740 KB Output is correct
27 Correct 1750 ms 4008 KB Output is correct
28 Correct 1758 ms 3988 KB Output is correct
29 Correct 1786 ms 4004 KB Output is correct
30 Correct 1866 ms 2792 KB Output is correct
31 Correct 1943 ms 3176 KB Output is correct
32 Correct 1277 ms 4756 KB Output is correct
33 Correct 267 ms 2256 KB Output is correct
34 Correct 269 ms 2428 KB Output is correct
35 Correct 263 ms 2292 KB Output is correct
36 Correct 274 ms 2296 KB Output is correct
37 Correct 1037 ms 4996 KB Output is correct
38 Correct 1746 ms 2456 KB Output is correct
39 Correct 864 ms 5280 KB Output is correct
40 Correct 2027 ms 2768 KB Output is correct
41 Correct 3860 ms 3684 KB Output is correct
42 Correct 2297 ms 5048 KB Output is correct
43 Correct 3425 ms 2888 KB Output is correct
44 Correct 450 ms 5904 KB Output is correct
45 Correct 2992 ms 4568 KB Output is correct
46 Correct 3808 ms 3512 KB Output is correct
47 Correct 1109 ms 5620 KB Output is correct
48 Correct 2747 ms 4704 KB Output is correct
49 Correct 1781 ms 4092 KB Output is correct
50 Correct 1780 ms 4120 KB Output is correct
51 Correct 1778 ms 4004 KB Output is correct
52 Correct 1769 ms 3988 KB Output is correct
53 Correct 290 ms 2260 KB Output is correct
54 Correct 293 ms 2312 KB Output is correct
55 Correct 249 ms 2296 KB Output is correct
56 Correct 270 ms 2296 KB Output is correct
57 Correct 1973 ms 3268 KB Output is correct
58 Correct 1645 ms 2536 KB Output is correct
59 Correct 1537 ms 4624 KB Output is correct
60 Correct 1548 ms 2204 KB Output is correct
61 Correct 3031 ms 4624 KB Output is correct
62 Correct 1195 ms 5736 KB Output is correct
63 Correct 680 ms 5712 KB Output is correct
64 Correct 1181 ms 5576 KB Output is correct
65 Correct 3721 ms 4100 KB Output is correct
66 Correct 3489 ms 4080 KB Output is correct
67 Correct 2648 ms 5800 KB Output is correct
68 Correct 3469 ms 4936 KB Output is correct
69 Correct 1723 ms 5016 KB Output is correct
70 Correct 1874 ms 4984 KB Output is correct
71 Correct 1755 ms 5044 KB Output is correct
72 Correct 1725 ms 4976 KB Output is correct
73 Correct 3928 ms 4060 KB Output is correct
74 Correct 3551 ms 5396 KB Output is correct
75 Correct 250 ms 7020 KB Output is correct
76 Correct 623 ms 6908 KB Output is correct
77 Correct 277 ms 3488 KB Output is correct
78 Correct 260 ms 3460 KB Output is correct
79 Correct 343 ms 3412 KB Output is correct
80 Correct 276 ms 3496 KB Output is correct
81 Correct 3669 ms 5308 KB Output is correct
82 Correct 4062 ms 4452 KB Output is correct
83 Correct 3372 ms 3604 KB Output is correct
84 Correct 3633 ms 4984 KB Output is correct
85 Correct 2655 ms 5712 KB Output is correct
86 Correct 2470 ms 5772 KB Output is correct
87 Correct 3838 ms 4500 KB Output is correct
88 Correct 3293 ms 3676 KB Output is correct

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1272 KB Output is correct
2 Correct 3 ms 1400 KB Output is correct
3 Correct 15 ms 1400 KB Output is correct
4 Correct 10 ms 1468 KB Output is correct
5 Correct 19 ms 1704 KB Output is correct
6 Correct 24 ms 1576 KB Output is correct
7 Correct 38 ms 1460 KB Output is correct
8 Correct 80 ms 1656 KB Output is correct
9 Correct 81 ms 1528 KB Output is correct
10 Correct 36 ms 1528 KB Output is correct
11 Correct 72 ms 1528 KB Output is correct
12 Correct 36 ms 1528 KB Output is correct
13 Correct 37 ms 1644 KB Output is correct
14 Correct 88 ms 1528 KB Output is correct
15 Correct 9 ms 1396 KB Output is correct
16 Correct 12 ms 1400 KB Output is correct
17 Correct 63 ms 1528 KB Output is correct
18 Correct 55 ms 1528 KB Output is correct
19 Correct 74 ms 1464 KB Output is correct
20 Correct 93 ms 1400 KB Output is correct
21 Correct 1759 ms 3924 KB Output is correct
22 Correct 1782 ms 4008 KB Output is correct
23 Correct 1814 ms 4048 KB Output is correct
24 Correct 1674 ms 4240 KB Output is correct
25 Correct 371 ms 5712 KB Output is correct
26 Correct 242 ms 5740 KB Output is correct
27 Correct 1750 ms 4008 KB Output is correct
28 Correct 1758 ms 3988 KB Output is correct
29 Correct 1786 ms 4004 KB Output is correct
30 Correct 1866 ms 2792 KB Output is correct
31 Correct 1943 ms 3176 KB Output is correct
32 Correct 1277 ms 4756 KB Output is correct
33 Correct 296 ms 2260 KB Output is correct
34 Correct 247 ms 2232 KB Output is correct
35 Correct 381 ms 2444 KB Output is correct
36 Correct 258 ms 2344 KB Output is correct
37 Correct 896 ms 4888 KB Output is correct
38 Correct 1120 ms 4408 KB Output is correct
39 Correct 1038 ms 4592 KB Output is correct
40 Correct 272 ms 5740 KB Output is correct
41 Correct 794 ms 5688 KB Output is correct
42 Correct 2476 ms 4796 KB Output is correct
43 Correct 1912 ms 2584 KB Output is correct
44 Correct 2381 ms 4872 KB Output is correct
45 Correct 2892 ms 4592 KB Output is correct
46 Correct 3732 ms 3592 KB Output is correct
47 Correct 3645 ms 3488 KB Output is correct
48 Correct 3368 ms 2984 KB Output is correct
49 Correct 1357 ms 4000 KB Output is correct
50 Correct 1366 ms 3984 KB Output is correct
51 Correct 1350 ms 3968 KB Output is correct
52 Correct 1364 ms 4004 KB Output is correct
53 Correct 2301 ms 2692 KB Output is correct
54 Correct 3677 ms 3784 KB Output is correct
55 Correct 3415 ms 4288 KB Output is correct
56 Correct 3827 ms 3948 KB Output is correct
57 Correct 310 ms 2392 KB Output is correct
58 Correct 285 ms 2296 KB Output is correct
59 Correct 296 ms 2424 KB Output is correct
60 Correct 329 ms 2276 KB Output is correct
61 Correct 3093 ms 4480 KB Output is correct
62 Correct 3118 ms 4424 KB Output is correct
63 Correct 776 ms 5716 KB Output is correct
64 Correct 2514 ms 4808 KB Output is correct
65 Correct 2729 ms 4720 KB Output is correct
66 Correct 3948 ms 3516 KB Output is correct
67 Correct 3352 ms 4060 KB Output is correct
68 Correct 2532 ms 4796 KB Output is correct
69 Correct 267 ms 2256 KB Output is correct
70 Correct 269 ms 2428 KB Output is correct
71 Correct 263 ms 2292 KB Output is correct
72 Correct 274 ms 2296 KB Output is correct
73 Correct 1037 ms 4996 KB Output is correct
74 Correct 1746 ms 2456 KB Output is correct
75 Correct 864 ms 5280 KB Output is correct
76 Correct 2027 ms 2768 KB Output is correct
77 Correct 3860 ms 3684 KB Output is correct
78 Correct 2297 ms 5048 KB Output is correct
79 Correct 3425 ms 2888 KB Output is correct
80 Correct 450 ms 5904 KB Output is correct
81 Correct 2992 ms 4568 KB Output is correct
82 Correct 3808 ms 3512 KB Output is correct
83 Correct 1109 ms 5620 KB Output is correct
84 Correct 2747 ms 4704 KB Output is correct
85 Correct 1781 ms 4092 KB Output is correct
86 Correct 1780 ms 4120 KB Output is correct
87 Correct 1778 ms 4004 KB Output is correct
88 Correct 1769 ms 3988 KB Output is correct
89 Correct 290 ms 2260 KB Output is correct
90 Correct 293 ms 2312 KB Output is correct
91 Correct 249 ms 2296 KB Output is correct
92 Correct 270 ms 2296 KB Output is correct
93 Correct 1973 ms 3268 KB Output is correct
94 Correct 1645 ms 2536 KB Output is correct
95 Correct 1537 ms 4624 KB Output is correct
96 Correct 1548 ms 2204 KB Output is correct
97 Correct 3031 ms 4624 KB Output is correct
98 Correct 1195 ms 5736 KB Output is correct
99 Correct 680 ms 5712 KB Output is correct
100 Correct 1181 ms 5576 KB Output is correct
101 Correct 3721 ms 4100 KB Output is correct
102 Correct 3489 ms 4080 KB Output is correct
103 Correct 2648 ms 5800 KB Output is correct
104 Correct 3469 ms 4936 KB Output is correct
105 Correct 1723 ms 5016 KB Output is correct
106 Correct 1874 ms 4984 KB Output is correct
107 Correct 1755 ms 5044 KB Output is correct
108 Correct 1725 ms 4976 KB Output is correct
109 Correct 3928 ms 4060 KB Output is correct
110 Correct 3551 ms 5396 KB Output is correct
111 Correct 250 ms 7020 KB Output is correct
112 Correct 623 ms 6908 KB Output is correct
113 Correct 277 ms 3488 KB Output is correct
114 Correct 260 ms 3460 KB Output is correct
115 Correct 343 ms 3412 KB Output is correct
116 Correct 276 ms 3496 KB Output is correct
117 Correct 3669 ms 5308 KB Output is correct
118 Correct 4062 ms 4452 KB Output is correct
119 Correct 3372 ms 3604 KB Output is correct
120 Correct 3633 ms 4984 KB Output is correct
121 Correct 2655 ms 5712 KB Output is correct
122 Correct 2470 ms 5772 KB Output is correct
123 Correct 3838 ms 4500 KB Output is correct
124 Correct 3293 ms 3676 KB Output is correct
125 Correct 840 ms 4840 KB Output is correct
126 Correct 846 ms 4824 KB Output is correct
127 Correct 1028 ms 5112 KB Output is correct
128 Correct 929 ms 4924 KB Output is correct
129 Correct 805 ms 4836 KB Output is correct
130 Correct 895 ms 4804 KB Output is correct
131 Correct 4054 ms 5212 KB Output is correct
132 Execution timed out 5014 ms 7756 KB Time limit exceeded
133 Halted 0 ms 0 KB -