oj.uz

Submission #161256

# Submission time Handle Problem Language Result Execution time Memory
161256 2019-11-01T16:05:08 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 5000 ms 9808 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;
};
 
inline bool operator==(seg a, seg b) {
	return a.i == b.i;
}
 
vector <seg> S;
 
struct R {
	bool operator()(seg a, seg b) const {
		if (a.r == b.r) {
			return a.i < b.i;
		}
		return a.r < b.r; 
	}
};
 
struct L {
	bool operator()(seg a, seg b) const {
		if (a.l == b.l) {
			return a.i < b.i;
		}
		return a.l < b.l;
	}
};
 
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();
}
 
ll LASTL[block];
 
ll LASTR[block];
 
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) {
		if (used[p.i]) {
			continue;
		}
		if (L[blocki].size() > block_sz) {
			blocki++;
		}
		IL[p.i] = blocki;
		L[blocki].pb(p);
	}
	sort(segs.begin(), segs.end(), cmpr);
	for (auto p: segs) {
		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];
	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) {
	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 L[i].size() - j;
}
 
inline ll fastR(ll i, ll x) {
	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 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;
	ll nxt = 0;
	ll lastans = 0;
	ll cnt3 = 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);
			}
			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:101: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:112: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:119:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'll slowL(ll, ll, ll)':
segments.cpp:178: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:189: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:230: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:270: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:285:5: warning: unused variable 'q' [-Wunused-variable]
  ll q, w;
     ^
segments.cpp:285:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'int main()':
segments.cpp:296:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w, e, a, b, c;
        ^
segments.cpp:296:11: warning: unused variable 'e' [-Wunused-variable]
  ll q, w, e, a, b, c;
           ^
segments.cpp:296:17: warning: unused variable 'b' [-Wunused-variable]
  ll q, w, e, a, b, c;
                 ^
segments.cpp:299:5: warning: unused variable 'nxt' [-Wunused-variable]
  ll nxt = 0;
     ^~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 9 ms 504 KB Output is correct
4 Correct 9 ms 632 KB Output is correct
5 Correct 16 ms 888 KB Output is correct
6 Correct 19 ms 760 KB Output is correct
7 Correct 34 ms 632 KB Output is correct
8 Correct 63 ms 888 KB Output is correct
9 Correct 68 ms 760 KB Output is correct
10 Correct 28 ms 928 KB Output is correct
11 Correct 28 ms 760 KB Output is correct
12 Correct 27 ms 760 KB Output is correct
13 Correct 28 ms 888 KB Output is correct
14 Correct 77 ms 760 KB Output is correct
15 Correct 10 ms 504 KB Output is correct
16 Correct 11 ms 608 KB Output is correct
17 Correct 68 ms 736 KB Output is correct
18 Correct 48 ms 888 KB Output is correct
19 Correct 74 ms 892 KB Output is correct
20 Correct 67 ms 664 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2944 ms 5256 KB Output is correct
2 Correct 3035 ms 7068 KB Output is correct
3 Correct 2956 ms 7240 KB Output is correct
4 Correct 2886 ms 7584 KB Output is correct
5 Correct 662 ms 9808 KB Output is correct
6 Correct 372 ms 9764 KB Output is correct
7 Correct 2896 ms 7148 KB Output is correct
8 Correct 2888 ms 7220 KB Output is correct
9 Correct 2935 ms 7368 KB Output is correct
10 Correct 2243 ms 5372 KB Output is correct
11 Correct 2620 ms 5772 KB Output is correct
12 Correct 2487 ms 8388 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 275 ms 3060 KB Output is correct
2 Correct 245 ms 3572 KB Output is correct
3 Correct 347 ms 3508 KB Output is correct
4 Correct 252 ms 3512 KB Output is correct
5 Correct 1954 ms 7412 KB Output is correct
6 Correct 2326 ms 7472 KB Output is correct
7 Correct 2188 ms 7976 KB Output is correct
8 Correct 565 ms 9620 KB Output is correct
9 Correct 844 ms 9484 KB Output is correct
10 Correct 2319 ms 7884 KB Output is correct
11 Correct 1443 ms 4428 KB Output is correct
12 Correct 2446 ms 8092 KB Output is correct
13 Correct 2881 ms 7892 KB Output is correct
14 Correct 3223 ms 5456 KB Output is correct
15 Correct 3186 ms 5352 KB Output is correct
16 Correct 2830 ms 4848 KB Output is correct
17 Correct 2535 ms 6812 KB Output is correct
18 Correct 2547 ms 6940 KB Output is correct
19 Correct 2570 ms 6816 KB Output is correct
20 Correct 2568 ms 6760 KB Output is correct
21 Correct 1944 ms 4156 KB Output is correct
22 Correct 3167 ms 5812 KB Output is correct
23 Correct 2964 ms 7372 KB Output is correct
24 Correct 3289 ms 5960 KB Output is correct
25 Correct 284 ms 4008 KB Output is correct
26 Correct 258 ms 4132 KB Output is correct
27 Correct 272 ms 4060 KB Output is correct
28 Correct 269 ms 3952 KB Output is correct
29 Correct 2759 ms 7544 KB Output is correct
30 Correct 2901 ms 7704 KB Output is correct
31 Correct 803 ms 9332 KB Output is correct
32 Correct 2368 ms 7748 KB Output is correct
33 Correct 2581 ms 7500 KB Output is correct
34 Correct 3231 ms 5036 KB Output is correct
35 Correct 3017 ms 6508 KB Output is correct
36 Correct 2520 ms 7744 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 258 ms 2984 KB Output is correct
2 Correct 258 ms 3484 KB Output is correct
3 Correct 253 ms 3468 KB Output is correct
4 Correct 262 ms 3460 KB Output is correct
5 Correct 2091 ms 7572 KB Output is correct
6 Correct 1878 ms 5108 KB Output is correct
7 Correct 1555 ms 9064 KB Output is correct
8 Correct 2341 ms 5360 KB Output is correct
9 Correct 3329 ms 5956 KB Output is correct
10 Correct 2227 ms 8384 KB Output is correct
11 Correct 3111 ms 4624 KB Output is correct
12 Correct 670 ms 9624 KB Output is correct
13 Correct 2786 ms 7588 KB Output is correct
14 Correct 3394 ms 5616 KB Output is correct
15 Correct 954 ms 9216 KB Output is correct
16 Correct 2593 ms 7648 KB Output is correct
17 Correct 3068 ms 7036 KB Output is correct
18 Correct 3002 ms 7012 KB Output is correct
19 Correct 3082 ms 7148 KB Output is correct
20 Correct 2955 ms 7124 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 9 ms 504 KB Output is correct
4 Correct 9 ms 632 KB Output is correct
5 Correct 16 ms 888 KB Output is correct
6 Correct 19 ms 760 KB Output is correct
7 Correct 34 ms 632 KB Output is correct
8 Correct 63 ms 888 KB Output is correct
9 Correct 68 ms 760 KB Output is correct
10 Correct 28 ms 928 KB Output is correct
11 Correct 28 ms 760 KB Output is correct
12 Correct 27 ms 760 KB Output is correct
13 Correct 28 ms 888 KB Output is correct
14 Correct 77 ms 760 KB Output is correct
15 Correct 10 ms 504 KB Output is correct
16 Correct 11 ms 608 KB Output is correct
17 Correct 68 ms 736 KB Output is correct
18 Correct 48 ms 888 KB Output is correct
19 Correct 74 ms 892 KB Output is correct
20 Correct 67 ms 664 KB Output is correct
21 Correct 2944 ms 5256 KB Output is correct
22 Correct 3035 ms 7068 KB Output is correct
23 Correct 2956 ms 7240 KB Output is correct
24 Correct 2886 ms 7584 KB Output is correct
25 Correct 662 ms 9808 KB Output is correct
26 Correct 372 ms 9764 KB Output is correct
27 Correct 2896 ms 7148 KB Output is correct
28 Correct 2888 ms 7220 KB Output is correct
29 Correct 2935 ms 7368 KB Output is correct
30 Correct 2243 ms 5372 KB Output is correct
31 Correct 2620 ms 5772 KB Output is correct
32 Correct 2487 ms 8388 KB Output is correct
33 Correct 258 ms 2984 KB Output is correct
34 Correct 258 ms 3484 KB Output is correct
35 Correct 253 ms 3468 KB Output is correct
36 Correct 262 ms 3460 KB Output is correct
37 Correct 2091 ms 7572 KB Output is correct
38 Correct 1878 ms 5108 KB Output is correct
39 Correct 1555 ms 9064 KB Output is correct
40 Correct 2341 ms 5360 KB Output is correct
41 Correct 3329 ms 5956 KB Output is correct
42 Correct 2227 ms 8384 KB Output is correct
43 Correct 3111 ms 4624 KB Output is correct
44 Correct 670 ms 9624 KB Output is correct
45 Correct 2786 ms 7588 KB Output is correct
46 Correct 3394 ms 5616 KB Output is correct
47 Correct 954 ms 9216 KB Output is correct
48 Correct 2593 ms 7648 KB Output is correct
49 Correct 3068 ms 7036 KB Output is correct
50 Correct 3002 ms 7012 KB Output is correct
51 Correct 3082 ms 7148 KB Output is correct
52 Correct 2955 ms 7124 KB Output is correct
53 Correct 298 ms 4256 KB Output is correct
54 Correct 282 ms 4348 KB Output is correct
55 Correct 249 ms 4308 KB Output is correct
56 Correct 263 ms 4256 KB Output is correct
57 Correct 2807 ms 5908 KB Output is correct
58 Correct 1541 ms 4440 KB Output is correct
59 Correct 2661 ms 7736 KB Output is correct
60 Correct 1419 ms 4308 KB Output is correct
61 Correct 2845 ms 7996 KB Output is correct
62 Correct 1395 ms 9216 KB Output is correct
63 Correct 671 ms 9492 KB Output is correct
64 Correct 1150 ms 9248 KB Output is correct
65 Correct 3009 ms 5000 KB Output is correct
66 Correct 2849 ms 4892 KB Output is correct
67 Correct 2558 ms 7924 KB Output is correct
68 Correct 3228 ms 6864 KB Output is correct
69 Correct 2963 ms 6616 KB Output is correct
70 Correct 2926 ms 4592 KB Output is correct
71 Correct 3023 ms 4560 KB Output is correct
72 Correct 2960 ms 4532 KB Output is correct
73 Correct 3321 ms 3288 KB Output is correct
74 Correct 3258 ms 4624 KB Output is correct
75 Correct 244 ms 7644 KB Output is correct
76 Correct 619 ms 7388 KB Output is correct
77 Correct 332 ms 2356 KB Output is correct
78 Correct 259 ms 2340 KB Output is correct
79 Correct 278 ms 2244 KB Output is correct
80 Correct 268 ms 2372 KB Output is correct
81 Correct 3283 ms 4468 KB Output is correct
82 Correct 3555 ms 3124 KB Output is correct
83 Correct 2697 ms 2536 KB Output is correct
84 Correct 3213 ms 4736 KB Output is correct
85 Correct 2544 ms 6248 KB Output is correct
86 Correct 2461 ms 6140 KB Output is correct
87 Correct 3402 ms 4116 KB Output is correct
88 Correct 2733 ms 2932 KB Output is correct

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 9 ms 504 KB Output is correct
4 Correct 9 ms 632 KB Output is correct
5 Correct 16 ms 888 KB Output is correct
6 Correct 19 ms 760 KB Output is correct
7 Correct 34 ms 632 KB Output is correct
8 Correct 63 ms 888 KB Output is correct
9 Correct 68 ms 760 KB Output is correct
10 Correct 28 ms 928 KB Output is correct
11 Correct 28 ms 760 KB Output is correct
12 Correct 27 ms 760 KB Output is correct
13 Correct 28 ms 888 KB Output is correct
14 Correct 77 ms 760 KB Output is correct
15 Correct 10 ms 504 KB Output is correct
16 Correct 11 ms 608 KB Output is correct
17 Correct 68 ms 736 KB Output is correct
18 Correct 48 ms 888 KB Output is correct
19 Correct 74 ms 892 KB Output is correct
20 Correct 67 ms 664 KB Output is correct
21 Correct 2944 ms 5256 KB Output is correct
22 Correct 3035 ms 7068 KB Output is correct
23 Correct 2956 ms 7240 KB Output is correct
24 Correct 2886 ms 7584 KB Output is correct
25 Correct 662 ms 9808 KB Output is correct
26 Correct 372 ms 9764 KB Output is correct
27 Correct 2896 ms 7148 KB Output is correct
28 Correct 2888 ms 7220 KB Output is correct
29 Correct 2935 ms 7368 KB Output is correct
30 Correct 2243 ms 5372 KB Output is correct
31 Correct 2620 ms 5772 KB Output is correct
32 Correct 2487 ms 8388 KB Output is correct
33 Correct 275 ms 3060 KB Output is correct
34 Correct 245 ms 3572 KB Output is correct
35 Correct 347 ms 3508 KB Output is correct
36 Correct 252 ms 3512 KB Output is correct
37 Correct 1954 ms 7412 KB Output is correct
38 Correct 2326 ms 7472 KB Output is correct
39 Correct 2188 ms 7976 KB Output is correct
40 Correct 565 ms 9620 KB Output is correct
41 Correct 844 ms 9484 KB Output is correct
42 Correct 2319 ms 7884 KB Output is correct
43 Correct 1443 ms 4428 KB Output is correct
44 Correct 2446 ms 8092 KB Output is correct
45 Correct 2881 ms 7892 KB Output is correct
46 Correct 3223 ms 5456 KB Output is correct
47 Correct 3186 ms 5352 KB Output is correct
48 Correct 2830 ms 4848 KB Output is correct
49 Correct 2535 ms 6812 KB Output is correct
50 Correct 2547 ms 6940 KB Output is correct
51 Correct 2570 ms 6816 KB Output is correct
52 Correct 2568 ms 6760 KB Output is correct
53 Correct 1944 ms 4156 KB Output is correct
54 Correct 3167 ms 5812 KB Output is correct
55 Correct 2964 ms 7372 KB Output is correct
56 Correct 3289 ms 5960 KB Output is correct
57 Correct 284 ms 4008 KB Output is correct
58 Correct 258 ms 4132 KB Output is correct
59 Correct 272 ms 4060 KB Output is correct
60 Correct 269 ms 3952 KB Output is correct
61 Correct 2759 ms 7544 KB Output is correct
62 Correct 2901 ms 7704 KB Output is correct
63 Correct 803 ms 9332 KB Output is correct
64 Correct 2368 ms 7748 KB Output is correct
65 Correct 2581 ms 7500 KB Output is correct
66 Correct 3231 ms 5036 KB Output is correct
67 Correct 3017 ms 6508 KB Output is correct
68 Correct 2520 ms 7744 KB Output is correct
69 Correct 258 ms 2984 KB Output is correct
70 Correct 258 ms 3484 KB Output is correct
71 Correct 253 ms 3468 KB Output is correct
72 Correct 262 ms 3460 KB Output is correct
73 Correct 2091 ms 7572 KB Output is correct
74 Correct 1878 ms 5108 KB Output is correct
75 Correct 1555 ms 9064 KB Output is correct
76 Correct 2341 ms 5360 KB Output is correct
77 Correct 3329 ms 5956 KB Output is correct
78 Correct 2227 ms 8384 KB Output is correct
79 Correct 3111 ms 4624 KB Output is correct
80 Correct 670 ms 9624 KB Output is correct
81 Correct 2786 ms 7588 KB Output is correct
82 Correct 3394 ms 5616 KB Output is correct
83 Correct 954 ms 9216 KB Output is correct
84 Correct 2593 ms 7648 KB Output is correct
85 Correct 3068 ms 7036 KB Output is correct
86 Correct 3002 ms 7012 KB Output is correct
87 Correct 3082 ms 7148 KB Output is correct
88 Correct 2955 ms 7124 KB Output is correct
89 Correct 298 ms 4256 KB Output is correct
90 Correct 282 ms 4348 KB Output is correct
91 Correct 249 ms 4308 KB Output is correct
92 Correct 263 ms 4256 KB Output is correct
93 Correct 2807 ms 5908 KB Output is correct
94 Correct 1541 ms 4440 KB Output is correct
95 Correct 2661 ms 7736 KB Output is correct
96 Correct 1419 ms 4308 KB Output is correct
97 Correct 2845 ms 7996 KB Output is correct
98 Correct 1395 ms 9216 KB Output is correct
99 Correct 671 ms 9492 KB Output is correct
100 Correct 1150 ms 9248 KB Output is correct
101 Correct 3009 ms 5000 KB Output is correct
102 Correct 2849 ms 4892 KB Output is correct
103 Correct 2558 ms 7924 KB Output is correct
104 Correct 3228 ms 6864 KB Output is correct
105 Correct 2963 ms 6616 KB Output is correct
106 Correct 2926 ms 4592 KB Output is correct
107 Correct 3023 ms 4560 KB Output is correct
108 Correct 2960 ms 4532 KB Output is correct
109 Correct 3321 ms 3288 KB Output is correct
110 Correct 3258 ms 4624 KB Output is correct
111 Correct 244 ms 7644 KB Output is correct
112 Correct 619 ms 7388 KB Output is correct
113 Correct 332 ms 2356 KB Output is correct
114 Correct 259 ms 2340 KB Output is correct
115 Correct 278 ms 2244 KB Output is correct
116 Correct 268 ms 2372 KB Output is correct
117 Correct 3283 ms 4468 KB Output is correct
118 Correct 3555 ms 3124 KB Output is correct
119 Correct 2697 ms 2536 KB Output is correct
120 Correct 3213 ms 4736 KB Output is correct
121 Correct 2544 ms 6248 KB Output is correct
122 Correct 2461 ms 6140 KB Output is correct
123 Correct 3402 ms 4116 KB Output is correct
124 Correct 2733 ms 2932 KB Output is correct
125 Correct 778 ms 4200 KB Output is correct
126 Correct 740 ms 4180 KB Output is correct
127 Correct 850 ms 4216 KB Output is correct
128 Correct 784 ms 4284 KB Output is correct
129 Correct 717 ms 4092 KB Output is correct
130 Correct 776 ms 4352 KB Output is correct
131 Execution timed out 5087 ms 3356 KB Time limit exceeded
132 Halted 0 ms 0 KB -