oj.uz

답안 #161342

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
161342 2019-11-01T21:19:19 Z pink_bittern Segments (IZhO18_segments) C++14
75 / 100
 5000 ms 13872 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 = 320;
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;
};
 
seg S[maxn];

ll ssz = 0;

vector <ll> 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> segsl;
vector <ll> segsr;
 
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 mrgl() {
	ll i, j;
	vector <ll> ANS;
	while (i != segsl.size() && j != lasts.size()) {
		if (cmpl(segsl[i], lasts[j])) {
			ANS.pb(segsl[i]);
			i++;
		}
		else {
			ANS.pb(lasts[j]);
			j++;
		}
	}
	for (; i < segsl.size(); i++) {
		ANS.pb(segsl[i]);
	}
	for (; j < lasts.size(); j++) {
		ANS.pb(lasts[j]);
	}
	segsl = ANS;
}

inline void mrgr() {
	ll i, j;
	vector <ll> ANS;
	while (i != segsr.size() && j != lasts.size()) {
		if (cmpr(segsr[i], lasts[j])) {
			ANS.pb(segsr[i]);
			i++;
		}
		else {
			ANS.pb(lasts[j]);
			j++;
		}
	}
	for (; i < segsr.size(); i++) {
		ANS.pb(segsr[i]);
	}
	for (; j < lasts.size(); j++) {
		ANS.pb(lasts[j]);
	}
	segsr = ANS;
}
 
inline void rebuild() { 
	ll q, w;
	ll blocki = 0;
	for (q = 0; q < block; q++) {
		R[q].clear();
		L[q].clear();
	}
	sort(lasts.begin(), lasts.end(), cmpl);
	mrgl();
	// sort(segs.begin(), segs.end(), cmpl);
	for (auto p : segsl) {
		IL[p] = -1;
		if (used[p]) {
			continue;
		}
		if (L[blocki].size() > block_sz) {
			blocki++;
		}
		IL[p] = blocki;
		L[blocki].pb(p);
	}
	sort(lasts.begin(), lasts.end(), cmpr);
	mrgr();
	lasts.clear();
	blocki = 0;
	// sort(segs.begin(), segs.end(), cmpr);
	for (auto p: segsr) {
		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.i);
	// S.pb(a);
	S[ssz] = a;
	ssz++;
	// 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;
}

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

inline 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[ssz] = good;
	ll j = (lower_bound(L[i].begin(), L[i].end(), ssz, cmpsz) - L[i].begin());
	// 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[ssz] = good;
	ll j = (lower_bound(R[i].begin(), R[i].end(), ssz, 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;
		}
		ans += slowL(q, x, l);
	}
 
	for (q = 0; q < lasts.size(); q++) {
		if (used[lasts[q]]) {
			continue;
		}
		if (S[lasts[q]].l >= l && S[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]]) {
			continue;
		}
		if (S[lasts[q]].r <= r && S[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;
	// segsl.reserve(n);
	// segsr.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 = ssz;
			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:74: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:85:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (w = 0; w < R[q].size(); w++) {
              ~~^~~~~~~~~~~~~
segments.cpp: In function 'void mrgl()':
segments.cpp:94:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while (i != segsl.size() && j != lasts.size()) {
         ~~^~~~~~~~~~~~~~~
segments.cpp:94:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while (i != segsl.size() && j != lasts.size()) {
                              ~~^~~~~~~~~~~~~~~
segments.cpp:104:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (; i < segsl.size(); i++) {
         ~~^~~~~~~~~~~~~~
segments.cpp:107:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (; j < lasts.size(); j++) {
         ~~^~~~~~~~~~~~~~
segments.cpp: In function 'void mrgr()':
segments.cpp:116:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while (i != segsr.size() && j != lasts.size()) {
         ~~^~~~~~~~~~~~~~~
segments.cpp:116:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while (i != segsr.size() && j != lasts.size()) {
                              ~~^~~~~~~~~~~~~~~
segments.cpp:126:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (; i < segsr.size(); i++) {
         ~~^~~~~~~~~~~~~~
segments.cpp:129:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (; j < lasts.size(); j++) {
         ~~^~~~~~~~~~~~~~
segments.cpp: In function 'void rebuild()':
segments.cpp:136:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'll slowL(ll, ll, ll)':
segments.cpp:204: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:215: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:292: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:332: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:347:5: warning: unused variable 'q' [-Wunused-variable]
  ll q, w;
     ^
segments.cpp:347:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w;
        ^
segments.cpp: In function 'int main()':
segments.cpp:358:8: warning: unused variable 'w' [-Wunused-variable]
  ll q, w, e, a, b, c;
        ^
segments.cpp:358:11: warning: unused variable 'e' [-Wunused-variable]
  ll q, w, e, a, b, c;
           ^
segments.cpp:358:17: warning: unused variable 'b' [-Wunused-variable]
  ll q, w, e, a, b, c;
                 ^
segments.cpp:362:5: warning: unused variable 'nxt' [-Wunused-variable]
  ll nxt = 0;
     ^~~
segments.cpp: In function 'void rebuild()':
segments.cpp:129:11: warning: 'j' may be used uninitialized in this function [-Wmaybe-uninitialized]
  for (; j < lasts.size(); j++) {
         ~~^~~~~~~~~~~~~~
segments.cpp:114:8: note: 'j' was declared here
  ll i, j;
        ^
segments.cpp:116:11: warning: 'i' may be used uninitialized in this function [-Wmaybe-uninitialized]
  while (i != segsr.size() && j != lasts.size()) {
         ~~^~~~~~~~~~~~~~~
segments.cpp:114:5: note: 'i' was declared here
  ll i, j;
     ^
segments.cpp:107:11: warning: 'j' may be used uninitialized in this function [-Wmaybe-uninitialized]
  for (; j < lasts.size(); j++) {
         ~~^~~~~~~~~~~~~~
segments.cpp:92:8: note: 'j' was declared here
  ll i, j;
        ^
segments.cpp:94:11: warning: 'i' may be used uninitialized in this function [-Wmaybe-uninitialized]
  while (i != segsl.size() && j != lasts.size()) {
         ~~^~~~~~~~~~~~~~~
segments.cpp:92:5: note: 'i' was declared here
  ll i, j;
     ^

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1912 KB Output is correct
2 Correct 9 ms 1912 KB Output is correct
3 Correct 9 ms 2168 KB Output is correct
4 Correct 10 ms 2040 KB Output is correct
5 Correct 15 ms 2168 KB Output is correct
6 Correct 17 ms 2168 KB Output is correct
7 Correct 42 ms 2176 KB Output is correct
8 Correct 38 ms 2168 KB Output is correct
9 Correct 41 ms 2224 KB Output is correct
10 Correct 18 ms 2296 KB Output is correct
11 Correct 26 ms 2208 KB Output is correct
12 Correct 25 ms 2168 KB Output is correct
13 Correct 19 ms 2172 KB Output is correct
14 Correct 44 ms 2228 KB Output is correct
15 Correct 9 ms 2040 KB Output is correct
16 Correct 11 ms 2100 KB Output is correct
17 Correct 48 ms 2168 KB Output is correct
18 Correct 27 ms 2276 KB Output is correct
19 Correct 44 ms 2188 KB Output is correct
20 Correct 43 ms 2168 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1525 ms 4904 KB Output is correct
2 Correct 1476 ms 5020 KB Output is correct
3 Correct 1505 ms 4928 KB Output is correct
4 Correct 1456 ms 5204 KB Output is correct
5 Correct 341 ms 6600 KB Output is correct
6 Correct 266 ms 6720 KB Output is correct
7 Correct 1521 ms 4904 KB Output is correct
8 Correct 1485 ms 5028 KB Output is correct
9 Correct 1527 ms 4988 KB Output is correct
10 Correct 1287 ms 3944 KB Output is correct
11 Correct 1457 ms 4128 KB Output is correct
12 Correct 1159 ms 5864 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 218 ms 3584 KB Output is correct
2 Correct 173 ms 3660 KB Output is correct
3 Correct 320 ms 3616 KB Output is correct
4 Correct 174 ms 3588 KB Output is correct
5 Correct 592 ms 5420 KB Output is correct
6 Correct 690 ms 4836 KB Output is correct
7 Correct 674 ms 5232 KB Output is correct
8 Correct 214 ms 6288 KB Output is correct
9 Correct 522 ms 7588 KB Output is correct
10 Correct 1282 ms 6328 KB Output is correct
11 Correct 880 ms 3796 KB Output is correct
12 Correct 1190 ms 6696 KB Output is correct
13 Correct 1374 ms 6196 KB Output is correct
14 Correct 1693 ms 5048 KB Output is correct
15 Correct 1698 ms 4792 KB Output is correct
16 Correct 1517 ms 4204 KB Output is correct
17 Correct 868 ms 4556 KB Output is correct
18 Correct 813 ms 4576 KB Output is correct
19 Correct 807 ms 4552 KB Output is correct
20 Correct 826 ms 4540 KB Output is correct
21 Correct 1041 ms 3932 KB Output is correct
22 Correct 1729 ms 5156 KB Output is correct
23 Correct 1593 ms 5640 KB Output is correct
24 Correct 1679 ms 5184 KB Output is correct
25 Correct 220 ms 3740 KB Output is correct
26 Correct 180 ms 3640 KB Output is correct
27 Correct 212 ms 3692 KB Output is correct
28 Correct 194 ms 3652 KB Output is correct
29 Correct 1496 ms 6204 KB Output is correct
30 Correct 1500 ms 6176 KB Output is correct
31 Correct 440 ms 7588 KB Output is correct
32 Correct 1240 ms 6392 KB Output is correct
33 Correct 1351 ms 6292 KB Output is correct
34 Correct 1605 ms 4812 KB Output is correct
35 Correct 1553 ms 5540 KB Output is correct
36 Correct 1279 ms 6312 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 172 ms 3648 KB Output is correct
2 Correct 179 ms 3632 KB Output is correct
3 Correct 208 ms 3472 KB Output is correct
4 Correct 194 ms 3652 KB Output is correct
5 Correct 997 ms 5664 KB Output is correct
6 Correct 1236 ms 3040 KB Output is correct
7 Correct 784 ms 5880 KB Output is correct
8 Correct 1324 ms 3352 KB Output is correct
9 Correct 1943 ms 5024 KB Output is correct
10 Correct 1304 ms 6864 KB Output is correct
11 Correct 1569 ms 4188 KB Output is correct
12 Correct 320 ms 7628 KB Output is correct
13 Correct 1539 ms 6012 KB Output is correct
14 Correct 1799 ms 5076 KB Output is correct
15 Correct 567 ms 7572 KB Output is correct
16 Correct 1449 ms 6436 KB Output is correct
17 Correct 1466 ms 4576 KB Output is correct
18 Correct 1459 ms 4496 KB Output is correct
19 Correct 1482 ms 4520 KB Output is correct
20 Correct 1486 ms 4500 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1912 KB Output is correct
2 Correct 9 ms 1912 KB Output is correct
3 Correct 9 ms 2168 KB Output is correct
4 Correct 10 ms 2040 KB Output is correct
5 Correct 15 ms 2168 KB Output is correct
6 Correct 17 ms 2168 KB Output is correct
7 Correct 42 ms 2176 KB Output is correct
8 Correct 38 ms 2168 KB Output is correct
9 Correct 41 ms 2224 KB Output is correct
10 Correct 18 ms 2296 KB Output is correct
11 Correct 26 ms 2208 KB Output is correct
12 Correct 25 ms 2168 KB Output is correct
13 Correct 19 ms 2172 KB Output is correct
14 Correct 44 ms 2228 KB Output is correct
15 Correct 9 ms 2040 KB Output is correct
16 Correct 11 ms 2100 KB Output is correct
17 Correct 48 ms 2168 KB Output is correct
18 Correct 27 ms 2276 KB Output is correct
19 Correct 44 ms 2188 KB Output is correct
20 Correct 43 ms 2168 KB Output is correct
21 Correct 1525 ms 4904 KB Output is correct
22 Correct 1476 ms 5020 KB Output is correct
23 Correct 1505 ms 4928 KB Output is correct
24 Correct 1456 ms 5204 KB Output is correct
25 Correct 341 ms 6600 KB Output is correct
26 Correct 266 ms 6720 KB Output is correct
27 Correct 1521 ms 4904 KB Output is correct
28 Correct 1485 ms 5028 KB Output is correct
29 Correct 1527 ms 4988 KB Output is correct
30 Correct 1287 ms 3944 KB Output is correct
31 Correct 1457 ms 4128 KB Output is correct
32 Correct 1159 ms 5864 KB Output is correct
33 Correct 172 ms 3648 KB Output is correct
34 Correct 179 ms 3632 KB Output is correct
35 Correct 208 ms 3472 KB Output is correct
36 Correct 194 ms 3652 KB Output is correct
37 Correct 997 ms 5664 KB Output is correct
38 Correct 1236 ms 3040 KB Output is correct
39 Correct 784 ms 5880 KB Output is correct
40 Correct 1324 ms 3352 KB Output is correct
41 Correct 1943 ms 5024 KB Output is correct
42 Correct 1304 ms 6864 KB Output is correct
43 Correct 1569 ms 4188 KB Output is correct
44 Correct 320 ms 7628 KB Output is correct
45 Correct 1539 ms 6012 KB Output is correct
46 Correct 1799 ms 5076 KB Output is correct
47 Correct 567 ms 7572 KB Output is correct
48 Correct 1449 ms 6436 KB Output is correct
49 Correct 1466 ms 4576 KB Output is correct
50 Correct 1459 ms 4496 KB Output is correct
51 Correct 1482 ms 4520 KB Output is correct
52 Correct 1486 ms 4500 KB Output is correct
53 Correct 196 ms 3676 KB Output is correct
54 Correct 206 ms 3592 KB Output is correct
55 Correct 174 ms 3628 KB Output is correct
56 Correct 175 ms 3688 KB Output is correct
57 Correct 1623 ms 3872 KB Output is correct
58 Correct 993 ms 2868 KB Output is correct
59 Correct 1344 ms 4944 KB Output is correct
60 Correct 968 ms 2836 KB Output is correct
61 Correct 1612 ms 6176 KB Output is correct
62 Correct 725 ms 7392 KB Output is correct
63 Correct 439 ms 7660 KB Output is correct
64 Correct 678 ms 7444 KB Output is correct
65 Correct 1645 ms 4536 KB Output is correct
66 Correct 1590 ms 4324 KB Output is correct
67 Correct 1432 ms 6364 KB Output is correct
68 Correct 1704 ms 5568 KB Output is correct
69 Correct 1530 ms 4480 KB Output is correct
70 Correct 1700 ms 4608 KB Output is correct
71 Correct 1500 ms 4500 KB Output is correct
72 Correct 1532 ms 4552 KB Output is correct
73 Correct 1835 ms 4664 KB Output is correct
74 Correct 1799 ms 5524 KB Output is correct
75 Correct 223 ms 6836 KB Output is correct
76 Correct 409 ms 7664 KB Output is correct
77 Correct 184 ms 3588 KB Output is correct
78 Correct 175 ms 3632 KB Output is correct
79 Correct 201 ms 3596 KB Output is correct
80 Correct 180 ms 3708 KB Output is correct
81 Correct 1867 ms 5464 KB Output is correct
82 Correct 1834 ms 4832 KB Output is correct
83 Correct 1499 ms 4068 KB Output is correct
84 Correct 1847 ms 5496 KB Output is correct
85 Correct 1424 ms 6412 KB Output is correct
86 Correct 1371 ms 6644 KB Output is correct
87 Correct 1816 ms 5100 KB Output is correct
88 Correct 1467 ms 4172 KB Output is correct

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1912 KB Output is correct
2 Correct 9 ms 1912 KB Output is correct
3 Correct 9 ms 2168 KB Output is correct
4 Correct 10 ms 2040 KB Output is correct
5 Correct 15 ms 2168 KB Output is correct
6 Correct 17 ms 2168 KB Output is correct
7 Correct 42 ms 2176 KB Output is correct
8 Correct 38 ms 2168 KB Output is correct
9 Correct 41 ms 2224 KB Output is correct
10 Correct 18 ms 2296 KB Output is correct
11 Correct 26 ms 2208 KB Output is correct
12 Correct 25 ms 2168 KB Output is correct
13 Correct 19 ms 2172 KB Output is correct
14 Correct 44 ms 2228 KB Output is correct
15 Correct 9 ms 2040 KB Output is correct
16 Correct 11 ms 2100 KB Output is correct
17 Correct 48 ms 2168 KB Output is correct
18 Correct 27 ms 2276 KB Output is correct
19 Correct 44 ms 2188 KB Output is correct
20 Correct 43 ms 2168 KB Output is correct
21 Correct 1525 ms 4904 KB Output is correct
22 Correct 1476 ms 5020 KB Output is correct
23 Correct 1505 ms 4928 KB Output is correct
24 Correct 1456 ms 5204 KB Output is correct
25 Correct 341 ms 6600 KB Output is correct
26 Correct 266 ms 6720 KB Output is correct
27 Correct 1521 ms 4904 KB Output is correct
28 Correct 1485 ms 5028 KB Output is correct
29 Correct 1527 ms 4988 KB Output is correct
30 Correct 1287 ms 3944 KB Output is correct
31 Correct 1457 ms 4128 KB Output is correct
32 Correct 1159 ms 5864 KB Output is correct
33 Correct 218 ms 3584 KB Output is correct
34 Correct 173 ms 3660 KB Output is correct
35 Correct 320 ms 3616 KB Output is correct
36 Correct 174 ms 3588 KB Output is correct
37 Correct 592 ms 5420 KB Output is correct
38 Correct 690 ms 4836 KB Output is correct
39 Correct 674 ms 5232 KB Output is correct
40 Correct 214 ms 6288 KB Output is correct
41 Correct 522 ms 7588 KB Output is correct
42 Correct 1282 ms 6328 KB Output is correct
43 Correct 880 ms 3796 KB Output is correct
44 Correct 1190 ms 6696 KB Output is correct
45 Correct 1374 ms 6196 KB Output is correct
46 Correct 1693 ms 5048 KB Output is correct
47 Correct 1698 ms 4792 KB Output is correct
48 Correct 1517 ms 4204 KB Output is correct
49 Correct 868 ms 4556 KB Output is correct
50 Correct 813 ms 4576 KB Output is correct
51 Correct 807 ms 4552 KB Output is correct
52 Correct 826 ms 4540 KB Output is correct
53 Correct 1041 ms 3932 KB Output is correct
54 Correct 1729 ms 5156 KB Output is correct
55 Correct 1593 ms 5640 KB Output is correct
56 Correct 1679 ms 5184 KB Output is correct
57 Correct 220 ms 3740 KB Output is correct
58 Correct 180 ms 3640 KB Output is correct
59 Correct 212 ms 3692 KB Output is correct
60 Correct 194 ms 3652 KB Output is correct
61 Correct 1496 ms 6204 KB Output is correct
62 Correct 1500 ms 6176 KB Output is correct
63 Correct 440 ms 7588 KB Output is correct
64 Correct 1240 ms 6392 KB Output is correct
65 Correct 1351 ms 6292 KB Output is correct
66 Correct 1605 ms 4812 KB Output is correct
67 Correct 1553 ms 5540 KB Output is correct
68 Correct 1279 ms 6312 KB Output is correct
69 Correct 172 ms 3648 KB Output is correct
70 Correct 179 ms 3632 KB Output is correct
71 Correct 208 ms 3472 KB Output is correct
72 Correct 194 ms 3652 KB Output is correct
73 Correct 997 ms 5664 KB Output is correct
74 Correct 1236 ms 3040 KB Output is correct
75 Correct 784 ms 5880 KB Output is correct
76 Correct 1324 ms 3352 KB Output is correct
77 Correct 1943 ms 5024 KB Output is correct
78 Correct 1304 ms 6864 KB Output is correct
79 Correct 1569 ms 4188 KB Output is correct
80 Correct 320 ms 7628 KB Output is correct
81 Correct 1539 ms 6012 KB Output is correct
82 Correct 1799 ms 5076 KB Output is correct
83 Correct 567 ms 7572 KB Output is correct
84 Correct 1449 ms 6436 KB Output is correct
85 Correct 1466 ms 4576 KB Output is correct
86 Correct 1459 ms 4496 KB Output is correct
87 Correct 1482 ms 4520 KB Output is correct
88 Correct 1486 ms 4500 KB Output is correct
89 Correct 196 ms 3676 KB Output is correct
90 Correct 206 ms 3592 KB Output is correct
91 Correct 174 ms 3628 KB Output is correct
92 Correct 175 ms 3688 KB Output is correct
93 Correct 1623 ms 3872 KB Output is correct
94 Correct 993 ms 2868 KB Output is correct
95 Correct 1344 ms 4944 KB Output is correct
96 Correct 968 ms 2836 KB Output is correct
97 Correct 1612 ms 6176 KB Output is correct
98 Correct 725 ms 7392 KB Output is correct
99 Correct 439 ms 7660 KB Output is correct
100 Correct 678 ms 7444 KB Output is correct
101 Correct 1645 ms 4536 KB Output is correct
102 Correct 1590 ms 4324 KB Output is correct
103 Correct 1432 ms 6364 KB Output is correct
104 Correct 1704 ms 5568 KB Output is correct
105 Correct 1530 ms 4480 KB Output is correct
106 Correct 1700 ms 4608 KB Output is correct
107 Correct 1500 ms 4500 KB Output is correct
108 Correct 1532 ms 4552 KB Output is correct
109 Correct 1835 ms 4664 KB Output is correct
110 Correct 1799 ms 5524 KB Output is correct
111 Correct 223 ms 6836 KB Output is correct
112 Correct 409 ms 7664 KB Output is correct
113 Correct 184 ms 3588 KB Output is correct
114 Correct 175 ms 3632 KB Output is correct
115 Correct 201 ms 3596 KB Output is correct
116 Correct 180 ms 3708 KB Output is correct
117 Correct 1867 ms 5464 KB Output is correct
118 Correct 1834 ms 4832 KB Output is correct
119 Correct 1499 ms 4068 KB Output is correct
120 Correct 1847 ms 5496 KB Output is correct
121 Correct 1424 ms 6412 KB Output is correct
122 Correct 1371 ms 6644 KB Output is correct
123 Correct 1816 ms 5100 KB Output is correct
124 Correct 1467 ms 4172 KB Output is correct
125 Correct 491 ms 5300 KB Output is correct
126 Correct 538 ms 5240 KB Output is correct
127 Correct 647 ms 5204 KB Output is correct
128 Correct 519 ms 5160 KB Output is correct
129 Correct 460 ms 5192 KB Output is correct
130 Correct 552 ms 5188 KB Output is correct
131 Correct 2934 ms 3856 KB Output is correct
132 Correct 4890 ms 6924 KB Output is correct
133 Correct 4140 ms 9568 KB Output is correct
134 Correct 3826 ms 5460 KB Output is correct
135 Correct 3776 ms 10640 KB Output is correct
136 Correct 1670 ms 4808 KB Output is correct
137 Correct 1865 ms 13872 KB Output is correct
138 Correct 4910 ms 10756 KB Output is correct
139 Correct 3811 ms 11756 KB Output is correct
140 Correct 2539 ms 12620 KB Output is correct
141 Correct 4384 ms 10604 KB Output is correct
142 Correct 2786 ms 5964 KB Output is correct
143 Correct 4289 ms 6852 KB Output is correct
144 Correct 1906 ms 5768 KB Output is correct
145 Correct 2578 ms 12688 KB Output is correct
146 Execution timed out 5082 ms 8228 KB Time limit exceeded
147 Halted 0 ms 0 KB -