oj.uz

답안 #161260

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
161260 2019-11-01T16:14:43 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 4150 ms 19104 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 + 1e4;
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();
}
 
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:97: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:108: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:115:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'll slowL(ll, ll, ll)':
segments.cpp:174: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:185: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:226: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:266: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:281:5: warning: unused variable 'q' [-Wunused-variable]
  ll q, w;
     ^
segments.cpp:281:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'int main()':
segments.cpp:292:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w, e, a, b, c;
        ^
segments.cpp:292:11: warning: unused variable 'e' [-Wunused-variable]
  ll q, w, e, a, b, c;
           ^
segments.cpp:292:17: warning: unused variable 'b' [-Wunused-variable]
  ll q, w, e, a, b, c;
                 ^
segments.cpp:295:5: warning: unused variable 'nxt' [-Wunused-variable]
  ll nxt = 0;
     ^~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 9 ms 508 KB Output is correct
4 Correct 9 ms 504 KB Output is correct
5 Correct 14 ms 1016 KB Output is correct
6 Correct 16 ms 760 KB Output is correct
7 Correct 34 ms 632 KB Output is correct
8 Correct 68 ms 912 KB Output is correct
9 Correct 66 ms 792 KB Output is correct
10 Correct 28 ms 1020 KB Output is correct
11 Correct 26 ms 760 KB Output is correct
12 Correct 24 ms 760 KB Output is correct
13 Correct 29 ms 888 KB Output is correct
14 Correct 71 ms 724 KB Output is correct
15 Correct 9 ms 504 KB Output is correct
16 Correct 12 ms 636 KB Output is correct
17 Correct 68 ms 760 KB Output is correct
18 Correct 44 ms 1016 KB Output is correct
19 Correct 89 ms 732 KB Output is correct
20 Correct 81 ms 788 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1004 ms 5308 KB Output is correct
2 Correct 1101 ms 5576 KB Output is correct
3 Correct 971 ms 5556 KB Output is correct
4 Correct 939 ms 5760 KB Output is correct
5 Correct 225 ms 8764 KB Output is correct
6 Correct 159 ms 8720 KB Output is correct
7 Correct 936 ms 5644 KB Output is correct
8 Correct 927 ms 5680 KB Output is correct
9 Correct 1010 ms 5680 KB Output is correct
10 Correct 1096 ms 3560 KB Output is correct
11 Correct 1054 ms 4268 KB Output is correct
12 Correct 680 ms 7056 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 258 ms 3040 KB Output is correct
2 Correct 227 ms 3124 KB Output is correct
3 Correct 353 ms 3384 KB Output is correct
4 Correct 236 ms 3324 KB Output is correct
5 Correct 437 ms 6976 KB Output is correct
6 Correct 536 ms 6256 KB Output is correct
7 Correct 483 ms 6800 KB Output is correct
8 Correct 163 ms 8632 KB Output is correct
9 Correct 620 ms 8540 KB Output is correct
10 Correct 1792 ms 7204 KB Output is correct
11 Correct 1379 ms 3828 KB Output is correct
12 Correct 1722 ms 7104 KB Output is correct
13 Correct 2104 ms 7060 KB Output is correct
14 Correct 2755 ms 4704 KB Output is correct
15 Correct 2807 ms 4516 KB Output is correct
16 Correct 2572 ms 4088 KB Output is correct
17 Correct 629 ms 5524 KB Output is correct
18 Correct 642 ms 5540 KB Output is correct
19 Correct 640 ms 5664 KB Output is correct
20 Correct 630 ms 5536 KB Output is correct
21 Correct 1750 ms 3836 KB Output is correct
22 Correct 4150 ms 5376 KB Output is correct
23 Correct 2424 ms 6788 KB Output is correct
24 Correct 2657 ms 5384 KB Output is correct
25 Correct 361 ms 3636 KB Output is correct
26 Correct 254 ms 3572 KB Output is correct
27 Correct 270 ms 3636 KB Output is correct
28 Correct 244 ms 3816 KB Output is correct
29 Correct 2235 ms 6816 KB Output is correct
30 Correct 2248 ms 6568 KB Output is correct
31 Correct 576 ms 8556 KB Output is correct
32 Correct 1818 ms 7200 KB Output is correct
33 Correct 1998 ms 7060 KB Output is correct
34 Correct 2813 ms 4568 KB Output is correct
35 Correct 2381 ms 5920 KB Output is correct
36 Correct 1895 ms 7112 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 234 ms 3072 KB Output is correct
2 Correct 235 ms 3124 KB Output is correct
3 Correct 253 ms 3188 KB Output is correct
4 Correct 257 ms 3200 KB Output is correct
5 Correct 746 ms 7436 KB Output is correct
6 Correct 1056 ms 3192 KB Output is correct
7 Correct 451 ms 7952 KB Output is correct
8 Correct 1093 ms 3232 KB Output is correct
9 Correct 2829 ms 4576 KB Output is correct
10 Correct 1622 ms 6856 KB Output is correct
11 Correct 2555 ms 3324 KB Output is correct
12 Correct 372 ms 8204 KB Output is correct
13 Correct 2267 ms 6612 KB Output is correct
14 Correct 2825 ms 4324 KB Output is correct
15 Correct 701 ms 7956 KB Output is correct
16 Correct 2078 ms 6764 KB Output is correct
17 Correct 943 ms 5128 KB Output is correct
18 Correct 947 ms 5032 KB Output is correct
19 Correct 936 ms 5116 KB Output is correct
20 Correct 934 ms 5152 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 9 ms 508 KB Output is correct
4 Correct 9 ms 504 KB Output is correct
5 Correct 14 ms 1016 KB Output is correct
6 Correct 16 ms 760 KB Output is correct
7 Correct 34 ms 632 KB Output is correct
8 Correct 68 ms 912 KB Output is correct
9 Correct 66 ms 792 KB Output is correct
10 Correct 28 ms 1020 KB Output is correct
11 Correct 26 ms 760 KB Output is correct
12 Correct 24 ms 760 KB Output is correct
13 Correct 29 ms 888 KB Output is correct
14 Correct 71 ms 724 KB Output is correct
15 Correct 9 ms 504 KB Output is correct
16 Correct 12 ms 636 KB Output is correct
17 Correct 68 ms 760 KB Output is correct
18 Correct 44 ms 1016 KB Output is correct
19 Correct 89 ms 732 KB Output is correct
20 Correct 81 ms 788 KB Output is correct
21 Correct 1004 ms 5308 KB Output is correct
22 Correct 1101 ms 5576 KB Output is correct
23 Correct 971 ms 5556 KB Output is correct
24 Correct 939 ms 5760 KB Output is correct
25 Correct 225 ms 8764 KB Output is correct
26 Correct 159 ms 8720 KB Output is correct
27 Correct 936 ms 5644 KB Output is correct
28 Correct 927 ms 5680 KB Output is correct
29 Correct 1010 ms 5680 KB Output is correct
30 Correct 1096 ms 3560 KB Output is correct
31 Correct 1054 ms 4268 KB Output is correct
32 Correct 680 ms 7056 KB Output is correct
33 Correct 234 ms 3072 KB Output is correct
34 Correct 235 ms 3124 KB Output is correct
35 Correct 253 ms 3188 KB Output is correct
36 Correct 257 ms 3200 KB Output is correct
37 Correct 746 ms 7436 KB Output is correct
38 Correct 1056 ms 3192 KB Output is correct
39 Correct 451 ms 7952 KB Output is correct
40 Correct 1093 ms 3232 KB Output is correct
41 Correct 2829 ms 4576 KB Output is correct
42 Correct 1622 ms 6856 KB Output is correct
43 Correct 2555 ms 3324 KB Output is correct
44 Correct 372 ms 8204 KB Output is correct
45 Correct 2267 ms 6612 KB Output is correct
46 Correct 2825 ms 4324 KB Output is correct
47 Correct 701 ms 7956 KB Output is correct
48 Correct 2078 ms 6764 KB Output is correct
49 Correct 943 ms 5128 KB Output is correct
50 Correct 947 ms 5032 KB Output is correct
51 Correct 936 ms 5116 KB Output is correct
52 Correct 934 ms 5152 KB Output is correct
53 Correct 262 ms 3132 KB Output is correct
54 Correct 254 ms 3188 KB Output is correct
55 Correct 231 ms 2964 KB Output is correct
56 Correct 235 ms 2948 KB Output is correct
57 Correct 1038 ms 3856 KB Output is correct
58 Correct 1006 ms 2356 KB Output is correct
59 Correct 806 ms 5900 KB Output is correct
60 Correct 1012 ms 2132 KB Output is correct
61 Correct 2241 ms 6468 KB Output is correct
62 Correct 1002 ms 7712 KB Output is correct
63 Correct 540 ms 8240 KB Output is correct
64 Correct 891 ms 7824 KB Output is correct
65 Correct 2778 ms 3632 KB Output is correct
66 Correct 2685 ms 3456 KB Output is correct
67 Correct 1979 ms 6716 KB Output is correct
68 Correct 2524 ms 5432 KB Output is correct
69 Correct 959 ms 5028 KB Output is correct
70 Correct 951 ms 5280 KB Output is correct
71 Correct 927 ms 5028 KB Output is correct
72 Correct 922 ms 5148 KB Output is correct
73 Correct 2811 ms 3848 KB Output is correct
74 Correct 2525 ms 5328 KB Output is correct
75 Correct 192 ms 8456 KB Output is correct
76 Correct 460 ms 8216 KB Output is correct
77 Correct 250 ms 3000 KB Output is correct
78 Correct 250 ms 3000 KB Output is correct
79 Correct 259 ms 2996 KB Output is correct
80 Correct 243 ms 3044 KB Output is correct
81 Correct 2631 ms 5168 KB Output is correct
82 Correct 2890 ms 4032 KB Output is correct
83 Correct 2633 ms 3328 KB Output is correct
84 Correct 2635 ms 5224 KB Output is correct
85 Correct 1930 ms 6680 KB Output is correct
86 Correct 1849 ms 6608 KB Output is correct
87 Correct 2800 ms 4768 KB Output is correct
88 Correct 2738 ms 3260 KB Output is correct

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 9 ms 508 KB Output is correct
4 Correct 9 ms 504 KB Output is correct
5 Correct 14 ms 1016 KB Output is correct
6 Correct 16 ms 760 KB Output is correct
7 Correct 34 ms 632 KB Output is correct
8 Correct 68 ms 912 KB Output is correct
9 Correct 66 ms 792 KB Output is correct
10 Correct 28 ms 1020 KB Output is correct
11 Correct 26 ms 760 KB Output is correct
12 Correct 24 ms 760 KB Output is correct
13 Correct 29 ms 888 KB Output is correct
14 Correct 71 ms 724 KB Output is correct
15 Correct 9 ms 504 KB Output is correct
16 Correct 12 ms 636 KB Output is correct
17 Correct 68 ms 760 KB Output is correct
18 Correct 44 ms 1016 KB Output is correct
19 Correct 89 ms 732 KB Output is correct
20 Correct 81 ms 788 KB Output is correct
21 Correct 1004 ms 5308 KB Output is correct
22 Correct 1101 ms 5576 KB Output is correct
23 Correct 971 ms 5556 KB Output is correct
24 Correct 939 ms 5760 KB Output is correct
25 Correct 225 ms 8764 KB Output is correct
26 Correct 159 ms 8720 KB Output is correct
27 Correct 936 ms 5644 KB Output is correct
28 Correct 927 ms 5680 KB Output is correct
29 Correct 1010 ms 5680 KB Output is correct
30 Correct 1096 ms 3560 KB Output is correct
31 Correct 1054 ms 4268 KB Output is correct
32 Correct 680 ms 7056 KB Output is correct
33 Correct 258 ms 3040 KB Output is correct
34 Correct 227 ms 3124 KB Output is correct
35 Correct 353 ms 3384 KB Output is correct
36 Correct 236 ms 3324 KB Output is correct
37 Correct 437 ms 6976 KB Output is correct
38 Correct 536 ms 6256 KB Output is correct
39 Correct 483 ms 6800 KB Output is correct
40 Correct 163 ms 8632 KB Output is correct
41 Correct 620 ms 8540 KB Output is correct
42 Correct 1792 ms 7204 KB Output is correct
43 Correct 1379 ms 3828 KB Output is correct
44 Correct 1722 ms 7104 KB Output is correct
45 Correct 2104 ms 7060 KB Output is correct
46 Correct 2755 ms 4704 KB Output is correct
47 Correct 2807 ms 4516 KB Output is correct
48 Correct 2572 ms 4088 KB Output is correct
49 Correct 629 ms 5524 KB Output is correct
50 Correct 642 ms 5540 KB Output is correct
51 Correct 640 ms 5664 KB Output is correct
52 Correct 630 ms 5536 KB Output is correct
53 Correct 1750 ms 3836 KB Output is correct
54 Correct 4150 ms 5376 KB Output is correct
55 Correct 2424 ms 6788 KB Output is correct
56 Correct 2657 ms 5384 KB Output is correct
57 Correct 361 ms 3636 KB Output is correct
58 Correct 254 ms 3572 KB Output is correct
59 Correct 270 ms 3636 KB Output is correct
60 Correct 244 ms 3816 KB Output is correct
61 Correct 2235 ms 6816 KB Output is correct
62 Correct 2248 ms 6568 KB Output is correct
63 Correct 576 ms 8556 KB Output is correct
64 Correct 1818 ms 7200 KB Output is correct
65 Correct 1998 ms 7060 KB Output is correct
66 Correct 2813 ms 4568 KB Output is correct
67 Correct 2381 ms 5920 KB Output is correct
68 Correct 1895 ms 7112 KB Output is correct
69 Correct 234 ms 3072 KB Output is correct
70 Correct 235 ms 3124 KB Output is correct
71 Correct 253 ms 3188 KB Output is correct
72 Correct 257 ms 3200 KB Output is correct
73 Correct 746 ms 7436 KB Output is correct
74 Correct 1056 ms 3192 KB Output is correct
75 Correct 451 ms 7952 KB Output is correct
76 Correct 1093 ms 3232 KB Output is correct
77 Correct 2829 ms 4576 KB Output is correct
78 Correct 1622 ms 6856 KB Output is correct
79 Correct 2555 ms 3324 KB Output is correct
80 Correct 372 ms 8204 KB Output is correct
81 Correct 2267 ms 6612 KB Output is correct
82 Correct 2825 ms 4324 KB Output is correct
83 Correct 701 ms 7956 KB Output is correct
84 Correct 2078 ms 6764 KB Output is correct
85 Correct 943 ms 5128 KB Output is correct
86 Correct 947 ms 5032 KB Output is correct
87 Correct 936 ms 5116 KB Output is correct
88 Correct 934 ms 5152 KB Output is correct
89 Correct 262 ms 3132 KB Output is correct
90 Correct 254 ms 3188 KB Output is correct
91 Correct 231 ms 2964 KB Output is correct
92 Correct 235 ms 2948 KB Output is correct
93 Correct 1038 ms 3856 KB Output is correct
94 Correct 1006 ms 2356 KB Output is correct
95 Correct 806 ms 5900 KB Output is correct
96 Correct 1012 ms 2132 KB Output is correct
97 Correct 2241 ms 6468 KB Output is correct
98 Correct 1002 ms 7712 KB Output is correct
99 Correct 540 ms 8240 KB Output is correct
100 Correct 891 ms 7824 KB Output is correct
101 Correct 2778 ms 3632 KB Output is correct
102 Correct 2685 ms 3456 KB Output is correct
103 Correct 1979 ms 6716 KB Output is correct
104 Correct 2524 ms 5432 KB Output is correct
105 Correct 959 ms 5028 KB Output is correct
106 Correct 951 ms 5280 KB Output is correct
107 Correct 927 ms 5028 KB Output is correct
108 Correct 922 ms 5148 KB Output is correct
109 Correct 2811 ms 3848 KB Output is correct
110 Correct 2525 ms 5328 KB Output is correct
111 Correct 192 ms 8456 KB Output is correct
112 Correct 460 ms 8216 KB Output is correct
113 Correct 250 ms 3000 KB Output is correct
114 Correct 250 ms 3000 KB Output is correct
115 Correct 259 ms 2996 KB Output is correct
116 Correct 243 ms 3044 KB Output is correct
117 Correct 2631 ms 5168 KB Output is correct
118 Correct 2890 ms 4032 KB Output is correct
119 Correct 2633 ms 3328 KB Output is correct
120 Correct 2635 ms 5224 KB Output is correct
121 Correct 1930 ms 6680 KB Output is correct
122 Correct 1849 ms 6608 KB Output is correct
123 Correct 2800 ms 4768 KB Output is correct
124 Correct 2738 ms 3260 KB Output is correct
125 Correct 709 ms 4784 KB Output is correct
126 Correct 740 ms 4800 KB Output is correct
127 Correct 861 ms 4904 KB Output is correct
128 Correct 735 ms 4852 KB Output is correct
129 Correct 685 ms 4800 KB Output is correct
130 Correct 760 ms 4964 KB Output is correct
131 Correct 2450 ms 3936 KB Output is correct
132 Correct 2634 ms 8084 KB Output is correct
133 Runtime error 120 ms 19104 KB Execution killed with signal 11 (could be triggered by violating memory limits)
134 Halted 0 ms 0 KB -