oj.uz

답안 #161303

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
161303 2019-11-01T18:47:46 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 5000 ms 16136 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 = 2000;
 
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

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 11 ms 1784 KB Output is correct
4 Correct 11 ms 1788 KB Output is correct
5 Correct 19 ms 2168 KB Output is correct
6 Correct 24 ms 2168 KB Output is correct
7 Correct 70 ms 1912 KB Output is correct
8 Correct 77 ms 2020 KB Output is correct
9 Correct 86 ms 1912 KB Output is correct
10 Correct 37 ms 2168 KB Output is correct
11 Correct 39 ms 2108 KB Output is correct
12 Correct 39 ms 2040 KB Output is correct
13 Correct 38 ms 2172 KB Output is correct
14 Correct 110 ms 2012 KB Output is correct
15 Correct 11 ms 1784 KB Output is correct
16 Correct 31 ms 1784 KB Output is correct
17 Correct 51 ms 1912 KB Output is correct
18 Correct 63 ms 2168 KB Output is correct
19 Correct 58 ms 1912 KB Output is correct
20 Correct 62 ms 1912 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1143 ms 6812 KB Output is correct
2 Correct 1145 ms 6524 KB Output is correct
3 Correct 1186 ms 6512 KB Output is correct
4 Correct 1067 ms 6816 KB Output is correct
5 Correct 245 ms 9680 KB Output is correct
6 Correct 175 ms 9740 KB Output is correct
7 Correct 1162 ms 6488 KB Output is correct
8 Correct 1143 ms 6504 KB Output is correct
9 Correct 1144 ms 6596 KB Output is correct
10 Correct 1472 ms 4292 KB Output is correct
11 Correct 1418 ms 4956 KB Output is correct
12 Correct 788 ms 8000 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 295 ms 4252 KB Output is correct
2 Correct 288 ms 4400 KB Output is correct
3 Correct 370 ms 4324 KB Output is correct
4 Correct 261 ms 4328 KB Output is correct
5 Correct 568 ms 8084 KB Output is correct
6 Correct 747 ms 7304 KB Output is correct
7 Correct 679 ms 7716 KB Output is correct
8 Correct 188 ms 9748 KB Output is correct
9 Correct 732 ms 9644 KB Output is correct
10 Correct 2231 ms 8028 KB Output is correct
11 Correct 1843 ms 4404 KB Output is correct
12 Correct 2174 ms 8144 KB Output is correct
13 Correct 2621 ms 7932 KB Output is correct
14 Correct 3561 ms 5640 KB Output is correct
15 Correct 3678 ms 5440 KB Output is correct
16 Correct 3618 ms 4952 KB Output is correct
17 Correct 905 ms 6708 KB Output is correct
18 Correct 907 ms 6880 KB Output is correct
19 Correct 903 ms 6924 KB Output is correct
20 Correct 917 ms 6680 KB Output is correct
21 Correct 2485 ms 4312 KB Output is correct
22 Correct 3547 ms 6044 KB Output is correct
23 Correct 3144 ms 7824 KB Output is correct
24 Correct 3677 ms 6364 KB Output is correct
25 Correct 306 ms 4348 KB Output is correct
26 Correct 306 ms 4276 KB Output is correct
27 Correct 315 ms 4416 KB Output is correct
28 Correct 303 ms 4408 KB Output is correct
29 Correct 2799 ms 7712 KB Output is correct
30 Correct 2862 ms 7868 KB Output is correct
31 Correct 668 ms 9612 KB Output is correct
32 Correct 2304 ms 8196 KB Output is correct
33 Correct 2504 ms 7976 KB Output is correct
34 Correct 3517 ms 5376 KB Output is correct
35 Correct 3121 ms 6884 KB Output is correct
36 Correct 2427 ms 8096 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 262 ms 4364 KB Output is correct
2 Correct 262 ms 4276 KB Output is correct
3 Correct 276 ms 4392 KB Output is correct
4 Correct 290 ms 4340 KB Output is correct
5 Correct 644 ms 8596 KB Output is correct
6 Correct 1502 ms 4216 KB Output is correct
7 Correct 532 ms 8868 KB Output is correct
8 Correct 1503 ms 4524 KB Output is correct
9 Correct 3711 ms 6044 KB Output is correct
10 Correct 2021 ms 8580 KB Output is correct
11 Correct 3338 ms 4884 KB Output is correct
12 Correct 442 ms 10000 KB Output is correct
13 Correct 2732 ms 8148 KB Output is correct
14 Correct 3622 ms 5964 KB Output is correct
15 Correct 831 ms 9580 KB Output is correct
16 Correct 2548 ms 8164 KB Output is correct
17 Correct 1154 ms 6708 KB Output is correct
18 Correct 1135 ms 6564 KB Output is correct
19 Correct 1122 ms 6688 KB Output is correct
20 Correct 1116 ms 6680 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 11 ms 1784 KB Output is correct
4 Correct 11 ms 1788 KB Output is correct
5 Correct 19 ms 2168 KB Output is correct
6 Correct 24 ms 2168 KB Output is correct
7 Correct 70 ms 1912 KB Output is correct
8 Correct 77 ms 2020 KB Output is correct
9 Correct 86 ms 1912 KB Output is correct
10 Correct 37 ms 2168 KB Output is correct
11 Correct 39 ms 2108 KB Output is correct
12 Correct 39 ms 2040 KB Output is correct
13 Correct 38 ms 2172 KB Output is correct
14 Correct 110 ms 2012 KB Output is correct
15 Correct 11 ms 1784 KB Output is correct
16 Correct 31 ms 1784 KB Output is correct
17 Correct 51 ms 1912 KB Output is correct
18 Correct 63 ms 2168 KB Output is correct
19 Correct 58 ms 1912 KB Output is correct
20 Correct 62 ms 1912 KB Output is correct
21 Correct 1143 ms 6812 KB Output is correct
22 Correct 1145 ms 6524 KB Output is correct
23 Correct 1186 ms 6512 KB Output is correct
24 Correct 1067 ms 6816 KB Output is correct
25 Correct 245 ms 9680 KB Output is correct
26 Correct 175 ms 9740 KB Output is correct
27 Correct 1162 ms 6488 KB Output is correct
28 Correct 1143 ms 6504 KB Output is correct
29 Correct 1144 ms 6596 KB Output is correct
30 Correct 1472 ms 4292 KB Output is correct
31 Correct 1418 ms 4956 KB Output is correct
32 Correct 788 ms 8000 KB Output is correct
33 Correct 262 ms 4364 KB Output is correct
34 Correct 262 ms 4276 KB Output is correct
35 Correct 276 ms 4392 KB Output is correct
36 Correct 290 ms 4340 KB Output is correct
37 Correct 644 ms 8596 KB Output is correct
38 Correct 1502 ms 4216 KB Output is correct
39 Correct 532 ms 8868 KB Output is correct
40 Correct 1503 ms 4524 KB Output is correct
41 Correct 3711 ms 6044 KB Output is correct
42 Correct 2021 ms 8580 KB Output is correct
43 Correct 3338 ms 4884 KB Output is correct
44 Correct 442 ms 10000 KB Output is correct
45 Correct 2732 ms 8148 KB Output is correct
46 Correct 3622 ms 5964 KB Output is correct
47 Correct 831 ms 9580 KB Output is correct
48 Correct 2548 ms 8164 KB Output is correct
49 Correct 1154 ms 6708 KB Output is correct
50 Correct 1135 ms 6564 KB Output is correct
51 Correct 1122 ms 6688 KB Output is correct
52 Correct 1116 ms 6680 KB Output is correct
53 Correct 287 ms 4244 KB Output is correct
54 Correct 281 ms 4320 KB Output is correct
55 Correct 255 ms 4280 KB Output is correct
56 Correct 265 ms 4292 KB Output is correct
57 Correct 1355 ms 5516 KB Output is correct
58 Correct 1454 ms 3704 KB Output is correct
59 Correct 943 ms 7332 KB Output is correct
60 Correct 1521 ms 3576 KB Output is correct
61 Correct 2776 ms 7856 KB Output is correct
62 Correct 1152 ms 9356 KB Output is correct
63 Correct 611 ms 9488 KB Output is correct
64 Correct 1000 ms 9328 KB Output is correct
65 Correct 3592 ms 4900 KB Output is correct
66 Correct 3515 ms 4592 KB Output is correct
67 Correct 2729 ms 7984 KB Output is correct
68 Correct 3194 ms 6820 KB Output is correct
69 Correct 1158 ms 6444 KB Output is correct
70 Correct 1133 ms 6580 KB Output is correct
71 Correct 1149 ms 6564 KB Output is correct
72 Correct 1167 ms 6524 KB Output is correct
73 Correct 3729 ms 5040 KB Output is correct
74 Correct 3256 ms 6316 KB Output is correct
75 Correct 226 ms 9244 KB Output is correct
76 Correct 567 ms 9104 KB Output is correct
77 Correct 289 ms 3652 KB Output is correct
78 Correct 268 ms 3476 KB Output is correct
79 Correct 287 ms 3628 KB Output is correct
80 Correct 276 ms 3508 KB Output is correct
81 Correct 3427 ms 5992 KB Output is correct
82 Correct 3742 ms 4644 KB Output is correct
83 Correct 3230 ms 3900 KB Output is correct
84 Correct 3385 ms 6164 KB Output is correct
85 Correct 2380 ms 7520 KB Output is correct
86 Correct 2228 ms 7504 KB Output is correct
87 Correct 3522 ms 5296 KB Output is correct
88 Correct 3292 ms 3972 KB Output is correct

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 3 ms 1528 KB Output is correct
3 Correct 11 ms 1784 KB Output is correct
4 Correct 11 ms 1788 KB Output is correct
5 Correct 19 ms 2168 KB Output is correct
6 Correct 24 ms 2168 KB Output is correct
7 Correct 70 ms 1912 KB Output is correct
8 Correct 77 ms 2020 KB Output is correct
9 Correct 86 ms 1912 KB Output is correct
10 Correct 37 ms 2168 KB Output is correct
11 Correct 39 ms 2108 KB Output is correct
12 Correct 39 ms 2040 KB Output is correct
13 Correct 38 ms 2172 KB Output is correct
14 Correct 110 ms 2012 KB Output is correct
15 Correct 11 ms 1784 KB Output is correct
16 Correct 31 ms 1784 KB Output is correct
17 Correct 51 ms 1912 KB Output is correct
18 Correct 63 ms 2168 KB Output is correct
19 Correct 58 ms 1912 KB Output is correct
20 Correct 62 ms 1912 KB Output is correct
21 Correct 1143 ms 6812 KB Output is correct
22 Correct 1145 ms 6524 KB Output is correct
23 Correct 1186 ms 6512 KB Output is correct
24 Correct 1067 ms 6816 KB Output is correct
25 Correct 245 ms 9680 KB Output is correct
26 Correct 175 ms 9740 KB Output is correct
27 Correct 1162 ms 6488 KB Output is correct
28 Correct 1143 ms 6504 KB Output is correct
29 Correct 1144 ms 6596 KB Output is correct
30 Correct 1472 ms 4292 KB Output is correct
31 Correct 1418 ms 4956 KB Output is correct
32 Correct 788 ms 8000 KB Output is correct
33 Correct 295 ms 4252 KB Output is correct
34 Correct 288 ms 4400 KB Output is correct
35 Correct 370 ms 4324 KB Output is correct
36 Correct 261 ms 4328 KB Output is correct
37 Correct 568 ms 8084 KB Output is correct
38 Correct 747 ms 7304 KB Output is correct
39 Correct 679 ms 7716 KB Output is correct
40 Correct 188 ms 9748 KB Output is correct
41 Correct 732 ms 9644 KB Output is correct
42 Correct 2231 ms 8028 KB Output is correct
43 Correct 1843 ms 4404 KB Output is correct
44 Correct 2174 ms 8144 KB Output is correct
45 Correct 2621 ms 7932 KB Output is correct
46 Correct 3561 ms 5640 KB Output is correct
47 Correct 3678 ms 5440 KB Output is correct
48 Correct 3618 ms 4952 KB Output is correct
49 Correct 905 ms 6708 KB Output is correct
50 Correct 907 ms 6880 KB Output is correct
51 Correct 903 ms 6924 KB Output is correct
52 Correct 917 ms 6680 KB Output is correct
53 Correct 2485 ms 4312 KB Output is correct
54 Correct 3547 ms 6044 KB Output is correct
55 Correct 3144 ms 7824 KB Output is correct
56 Correct 3677 ms 6364 KB Output is correct
57 Correct 306 ms 4348 KB Output is correct
58 Correct 306 ms 4276 KB Output is correct
59 Correct 315 ms 4416 KB Output is correct
60 Correct 303 ms 4408 KB Output is correct
61 Correct 2799 ms 7712 KB Output is correct
62 Correct 2862 ms 7868 KB Output is correct
63 Correct 668 ms 9612 KB Output is correct
64 Correct 2304 ms 8196 KB Output is correct
65 Correct 2504 ms 7976 KB Output is correct
66 Correct 3517 ms 5376 KB Output is correct
67 Correct 3121 ms 6884 KB Output is correct
68 Correct 2427 ms 8096 KB Output is correct
69 Correct 262 ms 4364 KB Output is correct
70 Correct 262 ms 4276 KB Output is correct
71 Correct 276 ms 4392 KB Output is correct
72 Correct 290 ms 4340 KB Output is correct
73 Correct 644 ms 8596 KB Output is correct
74 Correct 1502 ms 4216 KB Output is correct
75 Correct 532 ms 8868 KB Output is correct
76 Correct 1503 ms 4524 KB Output is correct
77 Correct 3711 ms 6044 KB Output is correct
78 Correct 2021 ms 8580 KB Output is correct
79 Correct 3338 ms 4884 KB Output is correct
80 Correct 442 ms 10000 KB Output is correct
81 Correct 2732 ms 8148 KB Output is correct
82 Correct 3622 ms 5964 KB Output is correct
83 Correct 831 ms 9580 KB Output is correct
84 Correct 2548 ms 8164 KB Output is correct
85 Correct 1154 ms 6708 KB Output is correct
86 Correct 1135 ms 6564 KB Output is correct
87 Correct 1122 ms 6688 KB Output is correct
88 Correct 1116 ms 6680 KB Output is correct
89 Correct 287 ms 4244 KB Output is correct
90 Correct 281 ms 4320 KB Output is correct
91 Correct 255 ms 4280 KB Output is correct
92 Correct 265 ms 4292 KB Output is correct
93 Correct 1355 ms 5516 KB Output is correct
94 Correct 1454 ms 3704 KB Output is correct
95 Correct 943 ms 7332 KB Output is correct
96 Correct 1521 ms 3576 KB Output is correct
97 Correct 2776 ms 7856 KB Output is correct
98 Correct 1152 ms 9356 KB Output is correct
99 Correct 611 ms 9488 KB Output is correct
100 Correct 1000 ms 9328 KB Output is correct
101 Correct 3592 ms 4900 KB Output is correct
102 Correct 3515 ms 4592 KB Output is correct
103 Correct 2729 ms 7984 KB Output is correct
104 Correct 3194 ms 6820 KB Output is correct
105 Correct 1158 ms 6444 KB Output is correct
106 Correct 1133 ms 6580 KB Output is correct
107 Correct 1149 ms 6564 KB Output is correct
108 Correct 1167 ms 6524 KB Output is correct
109 Correct 3729 ms 5040 KB Output is correct
110 Correct 3256 ms 6316 KB Output is correct
111 Correct 226 ms 9244 KB Output is correct
112 Correct 567 ms 9104 KB Output is correct
113 Correct 289 ms 3652 KB Output is correct
114 Correct 268 ms 3476 KB Output is correct
115 Correct 287 ms 3628 KB Output is correct
116 Correct 276 ms 3508 KB Output is correct
117 Correct 3427 ms 5992 KB Output is correct
118 Correct 3742 ms 4644 KB Output is correct
119 Correct 3230 ms 3900 KB Output is correct
120 Correct 3385 ms 6164 KB Output is correct
121 Correct 2380 ms 7520 KB Output is correct
122 Correct 2228 ms 7504 KB Output is correct
123 Correct 3522 ms 5296 KB Output is correct
124 Correct 3292 ms 3972 KB Output is correct
125 Correct 735 ms 5264 KB Output is correct
126 Correct 757 ms 5080 KB Output is correct
127 Correct 857 ms 5300 KB Output is correct
128 Correct 771 ms 5204 KB Output is correct
129 Correct 767 ms 5256 KB Output is correct
130 Correct 817 ms 5184 KB Output is correct
131 Correct 3305 ms 4328 KB Output is correct
132 Correct 2985 ms 9244 KB Output is correct
133 Correct 2304 ms 12112 KB Output is correct
134 Correct 3424 ms 5248 KB Output is correct
135 Correct 2103 ms 12784 KB Output is correct
136 Correct 2688 ms 2908 KB Output is correct
137 Correct 2180 ms 16136 KB Output is correct
138 Execution timed out 5061 ms 14792 KB Time limit exceeded
139 Halted 0 ms 0 KB -