oj.uz

Submission #161304

# Submission time Handle Problem Language Result Execution time Memory
161304 2019-11-01T18:52:09 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 5000 ms 17188 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 cmp(seg a, seg b) {
	return (a.r - a.l) < (b.r - b.l);
}
 
inline bool cmpl(const seg& a, const seg& b) {
	return a.l < b.l;
}
 
inline bool cmpr(const seg& a, const seg& b) {
	return a.r < b.r;
}
 
inline bool cmpsz(const seg& a, const seg& b) {
	return a.sz() < b.sz();
}
 
vector <seg> segs;
 
vector <seg> R[block];
 
vector <seg> 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], L[q][w].l);
		MXL[q] = max(MXL[q], 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], R[q][w].r);
		MXR[q] = max(MXR[q], 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.i] = -1;
		if (used[p.i]) {
			continue;
		}
		if (L[blocki].size() > block_sz) {
			blocki++;
		}
		IL[p.i] = blocki;
		L[blocki].pb(p);
	}
	blocki = 0;
	sort(segs.begin(), segs.end(), cmpr);
	for (auto p: segs) {
		IR[p.i] = -1;
		if (used[p.i]) {
			continue;
		}
		if (R[blocki].size() > block_sz) {
			blocki++;
		}
		IR[p.i] = 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);
	IL[a.i] = IR[a.i] = -1;
}
 
inline void del(seg b) { 
	ll il = IL[b.i], ir = IR[b.i];
	if (used[b.i]) {
		return;
	}
	used[b.i] = 1;
	if (il == -1) {
		return;
	}
	L[il].erase(find(L[il].begin(), L[il].end(), b));
	R[ir].erase(find(R[ir].begin(), R[ir].end(), b));
	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 (L[i][q].l >= l && 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 (R[i][q].r <= r && R[i][q].sz() >= x) {
			ans++;
		}
	}
	return ans;
}
 
inline ll fastL(ll i, ll x) {
	if (L[i].empty()) {
		return 0;
	}
	seg good;
	good.l = 0; good.r = x - 1; 
	ll j = (lower_bound(L[i].begin(), L[i].end(), good, cmpsz) - L[i].begin());
	return (ll)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;
	ll j = (lower_bound(R[i].begin(), R[i].end(), good, cmpsz) - R[i].begin());
	return (ll)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;
	for (q = 0; q < block; q++) {
		L[q].reserve(block_sz);
		R[q].reserve(block_sz);
	}
	ll cnt1 = 0;
	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);
			}
			cnt1++;
			x.l = l; x.r = r;
			x.i = cnt1;
			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:79: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:90: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:97:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'll slowL(ll, ll, ll)':
segments.cpp:162: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:173: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:220: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:260: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:275:5: warning: unused variable 'q' [-Wunused-variable]
  ll q, w;
     ^
segments.cpp:275:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'int main()':
segments.cpp:286:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w, e, a, b, c;
        ^
segments.cpp:286:11: warning: unused variable 'e' [-Wunused-variable]
  ll q, w, e, a, b, c;
           ^
segments.cpp:286:17: warning: unused variable 'b' [-Wunused-variable]
  ll q, w, e, a, b, c;
                 ^
segments.cpp:290: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 1400 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 11 ms 1528 KB Output is correct
4 Correct 11 ms 1528 KB Output is correct
5 Correct 17 ms 1912 KB Output is correct
6 Correct 22 ms 1784 KB Output is correct
7 Correct 35 ms 1656 KB Output is correct
8 Correct 68 ms 1656 KB Output is correct
9 Correct 72 ms 1784 KB Output is correct
10 Correct 30 ms 1912 KB Output is correct
11 Correct 32 ms 1656 KB Output is correct
12 Correct 32 ms 1784 KB Output is correct
13 Correct 31 ms 1912 KB Output is correct
14 Correct 77 ms 1656 KB Output is correct
15 Correct 10 ms 1528 KB Output is correct
16 Correct 14 ms 1528 KB Output is correct
17 Correct 57 ms 1628 KB Output is correct
18 Correct 48 ms 1884 KB Output is correct
19 Correct 67 ms 1784 KB Output is correct
20 Correct 79 ms 1656 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1063 ms 6432 KB Output is correct
2 Correct 1049 ms 6536 KB Output is correct
3 Correct 1107 ms 6636 KB Output is correct
4 Correct 984 ms 6928 KB Output is correct
5 Correct 235 ms 9488 KB Output is correct
6 Correct 173 ms 9676 KB Output is correct
7 Correct 1078 ms 6592 KB Output is correct
8 Correct 1063 ms 6484 KB Output is correct
9 Correct 1090 ms 6600 KB Output is correct
10 Correct 1314 ms 4472 KB Output is correct
11 Correct 1279 ms 4992 KB Output is correct
12 Correct 745 ms 7864 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 292 ms 4248 KB Output is correct
2 Correct 254 ms 4120 KB Output is correct
3 Correct 365 ms 4060 KB Output is correct
4 Correct 270 ms 4024 KB Output is correct
5 Correct 503 ms 7956 KB Output is correct
6 Correct 645 ms 7340 KB Output is correct
7 Correct 582 ms 7504 KB Output is correct
8 Correct 179 ms 9592 KB Output is correct
9 Correct 648 ms 9544 KB Output is correct
10 Correct 1941 ms 8032 KB Output is correct
11 Correct 1634 ms 4556 KB Output is correct
12 Correct 1875 ms 8020 KB Output is correct
13 Correct 2243 ms 8028 KB Output is correct
14 Correct 3149 ms 5728 KB Output is correct
15 Correct 3082 ms 5136 KB Output is correct
16 Correct 2835 ms 4860 KB Output is correct
17 Correct 799 ms 6432 KB Output is correct
18 Correct 809 ms 6560 KB Output is correct
19 Correct 786 ms 6560 KB Output is correct
20 Correct 776 ms 6512 KB Output is correct
21 Correct 1973 ms 4424 KB Output is correct
22 Correct 3002 ms 6016 KB Output is correct
23 Correct 2626 ms 7336 KB Output is correct
24 Correct 2890 ms 6108 KB Output is correct
25 Correct 302 ms 4152 KB Output is correct
26 Correct 273 ms 4172 KB Output is correct
27 Correct 294 ms 4284 KB Output is correct
28 Correct 280 ms 4148 KB Output is correct
29 Correct 2409 ms 7596 KB Output is correct
30 Correct 2456 ms 7764 KB Output is correct
31 Correct 576 ms 9360 KB Output is correct
32 Correct 1927 ms 7844 KB Output is correct
33 Correct 2180 ms 7712 KB Output is correct
34 Correct 2991 ms 5176 KB Output is correct
35 Correct 2626 ms 6736 KB Output is correct
36 Correct 2029 ms 7932 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 262 ms 4220 KB Output is correct
2 Correct 262 ms 4028 KB Output is correct
3 Correct 267 ms 4172 KB Output is correct
4 Correct 275 ms 4020 KB Output is correct
5 Correct 625 ms 8232 KB Output is correct
6 Correct 1344 ms 3748 KB Output is correct
7 Correct 516 ms 8516 KB Output is correct
8 Correct 1277 ms 4536 KB Output is correct
9 Correct 3017 ms 5852 KB Output is correct
10 Correct 1702 ms 8184 KB Output is correct
11 Correct 2796 ms 4344 KB Output is correct
12 Correct 458 ms 9612 KB Output is correct
13 Correct 2391 ms 7968 KB Output is correct
14 Correct 3117 ms 5756 KB Output is correct
15 Correct 752 ms 9748 KB Output is correct
16 Correct 2208 ms 8072 KB Output is correct
17 Correct 1051 ms 6560 KB Output is correct
18 Correct 1051 ms 6304 KB Output is correct
19 Correct 1104 ms 6592 KB Output is correct
20 Correct 1055 ms 6408 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1400 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 11 ms 1528 KB Output is correct
4 Correct 11 ms 1528 KB Output is correct
5 Correct 17 ms 1912 KB Output is correct
6 Correct 22 ms 1784 KB Output is correct
7 Correct 35 ms 1656 KB Output is correct
8 Correct 68 ms 1656 KB Output is correct
9 Correct 72 ms 1784 KB Output is correct
10 Correct 30 ms 1912 KB Output is correct
11 Correct 32 ms 1656 KB Output is correct
12 Correct 32 ms 1784 KB Output is correct
13 Correct 31 ms 1912 KB Output is correct
14 Correct 77 ms 1656 KB Output is correct
15 Correct 10 ms 1528 KB Output is correct
16 Correct 14 ms 1528 KB Output is correct
17 Correct 57 ms 1628 KB Output is correct
18 Correct 48 ms 1884 KB Output is correct
19 Correct 67 ms 1784 KB Output is correct
20 Correct 79 ms 1656 KB Output is correct
21 Correct 1063 ms 6432 KB Output is correct
22 Correct 1049 ms 6536 KB Output is correct
23 Correct 1107 ms 6636 KB Output is correct
24 Correct 984 ms 6928 KB Output is correct
25 Correct 235 ms 9488 KB Output is correct
26 Correct 173 ms 9676 KB Output is correct
27 Correct 1078 ms 6592 KB Output is correct
28 Correct 1063 ms 6484 KB Output is correct
29 Correct 1090 ms 6600 KB Output is correct
30 Correct 1314 ms 4472 KB Output is correct
31 Correct 1279 ms 4992 KB Output is correct
32 Correct 745 ms 7864 KB Output is correct
33 Correct 262 ms 4220 KB Output is correct
34 Correct 262 ms 4028 KB Output is correct
35 Correct 267 ms 4172 KB Output is correct
36 Correct 275 ms 4020 KB Output is correct
37 Correct 625 ms 8232 KB Output is correct
38 Correct 1344 ms 3748 KB Output is correct
39 Correct 516 ms 8516 KB Output is correct
40 Correct 1277 ms 4536 KB Output is correct
41 Correct 3017 ms 5852 KB Output is correct
42 Correct 1702 ms 8184 KB Output is correct
43 Correct 2796 ms 4344 KB Output is correct
44 Correct 458 ms 9612 KB Output is correct
45 Correct 2391 ms 7968 KB Output is correct
46 Correct 3117 ms 5756 KB Output is correct
47 Correct 752 ms 9748 KB Output is correct
48 Correct 2208 ms 8072 KB Output is correct
49 Correct 1051 ms 6560 KB Output is correct
50 Correct 1051 ms 6304 KB Output is correct
51 Correct 1104 ms 6592 KB Output is correct
52 Correct 1055 ms 6408 KB Output is correct
53 Correct 294 ms 4100 KB Output is correct
54 Correct 288 ms 4280 KB Output is correct
55 Correct 252 ms 4148 KB Output is correct
56 Correct 269 ms 4148 KB Output is correct
57 Correct 1232 ms 5192 KB Output is correct
58 Correct 1263 ms 3376 KB Output is correct
59 Correct 877 ms 7260 KB Output is correct
60 Correct 1279 ms 3348 KB Output is correct
61 Correct 2377 ms 7828 KB Output is correct
62 Correct 914 ms 9104 KB Output is correct
63 Correct 546 ms 9644 KB Output is correct
64 Correct 874 ms 9248 KB Output is correct
65 Correct 3037 ms 4768 KB Output is correct
66 Correct 2844 ms 4448 KB Output is correct
67 Correct 2108 ms 7860 KB Output is correct
68 Correct 2848 ms 7848 KB Output is correct
69 Correct 1078 ms 7248 KB Output is correct
70 Correct 1063 ms 7232 KB Output is correct
71 Correct 1055 ms 7300 KB Output is correct
72 Correct 1053 ms 7228 KB Output is correct
73 Correct 3167 ms 5832 KB Output is correct
74 Correct 2875 ms 7048 KB Output is correct
75 Correct 207 ms 10272 KB Output is correct
76 Correct 495 ms 10056 KB Output is correct
77 Correct 276 ms 4408 KB Output is correct
78 Correct 260 ms 4392 KB Output is correct
79 Correct 290 ms 4452 KB Output is correct
80 Correct 271 ms 4392 KB Output is correct
81 Correct 2954 ms 6680 KB Output is correct
82 Correct 3130 ms 5524 KB Output is correct
83 Correct 2812 ms 4136 KB Output is correct
84 Correct 2809 ms 6352 KB Output is correct
85 Correct 2108 ms 7920 KB Output is correct
86 Correct 1946 ms 7716 KB Output is correct
87 Correct 3059 ms 5688 KB Output is correct
88 Correct 2741 ms 4240 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1400 KB Output is correct
2 Correct 3 ms 1272 KB Output is correct
3 Correct 11 ms 1528 KB Output is correct
4 Correct 11 ms 1528 KB Output is correct
5 Correct 17 ms 1912 KB Output is correct
6 Correct 22 ms 1784 KB Output is correct
7 Correct 35 ms 1656 KB Output is correct
8 Correct 68 ms 1656 KB Output is correct
9 Correct 72 ms 1784 KB Output is correct
10 Correct 30 ms 1912 KB Output is correct
11 Correct 32 ms 1656 KB Output is correct
12 Correct 32 ms 1784 KB Output is correct
13 Correct 31 ms 1912 KB Output is correct
14 Correct 77 ms 1656 KB Output is correct
15 Correct 10 ms 1528 KB Output is correct
16 Correct 14 ms 1528 KB Output is correct
17 Correct 57 ms 1628 KB Output is correct
18 Correct 48 ms 1884 KB Output is correct
19 Correct 67 ms 1784 KB Output is correct
20 Correct 79 ms 1656 KB Output is correct
21 Correct 1063 ms 6432 KB Output is correct
22 Correct 1049 ms 6536 KB Output is correct
23 Correct 1107 ms 6636 KB Output is correct
24 Correct 984 ms 6928 KB Output is correct
25 Correct 235 ms 9488 KB Output is correct
26 Correct 173 ms 9676 KB Output is correct
27 Correct 1078 ms 6592 KB Output is correct
28 Correct 1063 ms 6484 KB Output is correct
29 Correct 1090 ms 6600 KB Output is correct
30 Correct 1314 ms 4472 KB Output is correct
31 Correct 1279 ms 4992 KB Output is correct
32 Correct 745 ms 7864 KB Output is correct
33 Correct 292 ms 4248 KB Output is correct
34 Correct 254 ms 4120 KB Output is correct
35 Correct 365 ms 4060 KB Output is correct
36 Correct 270 ms 4024 KB Output is correct
37 Correct 503 ms 7956 KB Output is correct
38 Correct 645 ms 7340 KB Output is correct
39 Correct 582 ms 7504 KB Output is correct
40 Correct 179 ms 9592 KB Output is correct
41 Correct 648 ms 9544 KB Output is correct
42 Correct 1941 ms 8032 KB Output is correct
43 Correct 1634 ms 4556 KB Output is correct
44 Correct 1875 ms 8020 KB Output is correct
45 Correct 2243 ms 8028 KB Output is correct
46 Correct 3149 ms 5728 KB Output is correct
47 Correct 3082 ms 5136 KB Output is correct
48 Correct 2835 ms 4860 KB Output is correct
49 Correct 799 ms 6432 KB Output is correct
50 Correct 809 ms 6560 KB Output is correct
51 Correct 786 ms 6560 KB Output is correct
52 Correct 776 ms 6512 KB Output is correct
53 Correct 1973 ms 4424 KB Output is correct
54 Correct 3002 ms 6016 KB Output is correct
55 Correct 2626 ms 7336 KB Output is correct
56 Correct 2890 ms 6108 KB Output is correct
57 Correct 302 ms 4152 KB Output is correct
58 Correct 273 ms 4172 KB Output is correct
59 Correct 294 ms 4284 KB Output is correct
60 Correct 280 ms 4148 KB Output is correct
61 Correct 2409 ms 7596 KB Output is correct
62 Correct 2456 ms 7764 KB Output is correct
63 Correct 576 ms 9360 KB Output is correct
64 Correct 1927 ms 7844 KB Output is correct
65 Correct 2180 ms 7712 KB Output is correct
66 Correct 2991 ms 5176 KB Output is correct
67 Correct 2626 ms 6736 KB Output is correct
68 Correct 2029 ms 7932 KB Output is correct
69 Correct 262 ms 4220 KB Output is correct
70 Correct 262 ms 4028 KB Output is correct
71 Correct 267 ms 4172 KB Output is correct
72 Correct 275 ms 4020 KB Output is correct
73 Correct 625 ms 8232 KB Output is correct
74 Correct 1344 ms 3748 KB Output is correct
75 Correct 516 ms 8516 KB Output is correct
76 Correct 1277 ms 4536 KB Output is correct
77 Correct 3017 ms 5852 KB Output is correct
78 Correct 1702 ms 8184 KB Output is correct
79 Correct 2796 ms 4344 KB Output is correct
80 Correct 458 ms 9612 KB Output is correct
81 Correct 2391 ms 7968 KB Output is correct
82 Correct 3117 ms 5756 KB Output is correct
83 Correct 752 ms 9748 KB Output is correct
84 Correct 2208 ms 8072 KB Output is correct
85 Correct 1051 ms 6560 KB Output is correct
86 Correct 1051 ms 6304 KB Output is correct
87 Correct 1104 ms 6592 KB Output is correct
88 Correct 1055 ms 6408 KB Output is correct
89 Correct 294 ms 4100 KB Output is correct
90 Correct 288 ms 4280 KB Output is correct
91 Correct 252 ms 4148 KB Output is correct
92 Correct 269 ms 4148 KB Output is correct
93 Correct 1232 ms 5192 KB Output is correct
94 Correct 1263 ms 3376 KB Output is correct
95 Correct 877 ms 7260 KB Output is correct
96 Correct 1279 ms 3348 KB Output is correct
97 Correct 2377 ms 7828 KB Output is correct
98 Correct 914 ms 9104 KB Output is correct
99 Correct 546 ms 9644 KB Output is correct
100 Correct 874 ms 9248 KB Output is correct
101 Correct 3037 ms 4768 KB Output is correct
102 Correct 2844 ms 4448 KB Output is correct
103 Correct 2108 ms 7860 KB Output is correct
104 Correct 2848 ms 7848 KB Output is correct
105 Correct 1078 ms 7248 KB Output is correct
106 Correct 1063 ms 7232 KB Output is correct
107 Correct 1055 ms 7300 KB Output is correct
108 Correct 1053 ms 7228 KB Output is correct
109 Correct 3167 ms 5832 KB Output is correct
110 Correct 2875 ms 7048 KB Output is correct
111 Correct 207 ms 10272 KB Output is correct
112 Correct 495 ms 10056 KB Output is correct
113 Correct 276 ms 4408 KB Output is correct
114 Correct 260 ms 4392 KB Output is correct
115 Correct 290 ms 4452 KB Output is correct
116 Correct 271 ms 4392 KB Output is correct
117 Correct 2954 ms 6680 KB Output is correct
118 Correct 3130 ms 5524 KB Output is correct
119 Correct 2812 ms 4136 KB Output is correct
120 Correct 2809 ms 6352 KB Output is correct
121 Correct 2108 ms 7920 KB Output is correct
122 Correct 1946 ms 7716 KB Output is correct
123 Correct 3059 ms 5688 KB Output is correct
124 Correct 2741 ms 4240 KB Output is correct
125 Correct 763 ms 6180 KB Output is correct
126 Correct 758 ms 6052 KB Output is correct
127 Correct 902 ms 6140 KB Output is correct
128 Correct 805 ms 6196 KB Output is correct
129 Correct 718 ms 6120 KB Output is correct
130 Correct 810 ms 6160 KB Output is correct
131 Correct 2942 ms 5448 KB Output is correct
132 Correct 2845 ms 10360 KB Output is correct
133 Correct 2179 ms 13500 KB Output is correct
134 Correct 3159 ms 6552 KB Output is correct
135 Correct 2011 ms 14068 KB Output is correct
136 Correct 2505 ms 4324 KB Output is correct
137 Correct 1918 ms 17188 KB Output is correct
138 Execution timed out 5085 ms 12812 KB Time limit exceeded
139 Halted 0 ms 0 KB -