답안 #207733

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
207733 2020-03-08T17:27:38 Z cgiosy 코끼리 (Dancing Elephants) (IOI11_elephants) C++17
100 / 100
3742 ms 7704 KB
#include <bits/stdc++.h>
#define lb(a, x) lower_bound(begin(a), end(a), x)
using namespace std;
constexpr int MX=150000, B=448, C=(MX+B-1)/B;

struct iii { int x, n, y; };
bool operator<(const iii& a, int b) { return a.x<b; }
bool operator<(int a, const iii& b) { return a<b.x; }
int A[MX], X[MX], N, M, Q;
vector<iii> D[C];
void calc_bucket(vector<iii>& v) {
	for(int n=v.size(), i=n, p=n; i--;) {
		while(p && v[i].x<v[p-1].x-M) p--;
		if(p==n) v[i].n=1, v[i].y=v[i].x+M;
		else v[i].n=v[p].n+1, v[i].y=v[p].y;
	}
}
void init_buckets() {
	int k=0;
	for(auto&v:D) {
		for(auto[x,n,y]:v) X[k++]=x;
		v.clear();
	}
	for(int i=0, j=0; i<N;) {
		D[j].push_back({X[i], 0, 0});
		if(++i%B==0 || i==N) calc_bucket(D[j++]);
	}
}
void del(int x) {
	for(auto&v:D) if(v.size() && v.front().x<=x && x<=v.back().x) {
		v.erase(lb(v, x));
		calc_bucket(v);
		break;
	}
}
void add(int x) {
	int p=0, n=N-1;
	for(auto&v:D) if(!(n-=v.size()) || v.size() && p<=x && x<=(p=v.back().x)) {
		v.insert(lb(v, x), {x, 0, 0});
		calc_bucket(v);
		break;
	}
}
int answer() {
	int p=0, n=0;
	for(auto&v:D) if(v.size() && p<=v.back().x) {
		auto[x,m,y]=*lb(v, p);
		n+=m, p=y+1;
	}
	return n;
}

void init(int n, int m, int E[]) {
	N=n, M=m;
	for(int i=0; i<C; i++) D[i].reserve(B);
	for(int i=0; i<N; i++) D[i/B].push_back({A[i]=E[i], 0, 0});
}
int update(int n, int x) {
	if(Q++%B==0) init_buckets();
	del(A[n]);
	add(A[n]=x);
	return answer();
}

Compilation message

elephants.cpp: In function 'void init_buckets()':
elephants.cpp:21:17: warning: unused variable 'n' [-Wunused-variable]
   for(auto[x,n,y]:v) X[k++]=x;
                 ^
elephants.cpp:21:17: warning: unused variable 'y' [-Wunused-variable]
elephants.cpp: In function 'void add(int)':
elephants.cpp:38:54: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
  for(auto&v:D) if(!(n-=v.size()) || v.size() && p<=x && x<=(p=v.back().x)) {
                                     ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
elephants.cpp: In function 'int answer()':
elephants.cpp:47:13: warning: unused variable 'x' [-Wunused-variable]
   auto[x,m,y]=*lb(v, p);
             ^
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1656 KB Output is correct
2 Correct 5 ms 1656 KB Output is correct
3 Correct 5 ms 1660 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1656 KB Output is correct
2 Correct 5 ms 1656 KB Output is correct
3 Correct 5 ms 1660 KB Output is correct
4 Correct 5 ms 1656 KB Output is correct
5 Correct 5 ms 1656 KB Output is correct
6 Correct 5 ms 1656 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1656 KB Output is correct
2 Correct 5 ms 1656 KB Output is correct
3 Correct 5 ms 1660 KB Output is correct
4 Correct 5 ms 1656 KB Output is correct
5 Correct 5 ms 1656 KB Output is correct
6 Correct 5 ms 1656 KB Output is correct
7 Correct 421 ms 2552 KB Output is correct
8 Correct 428 ms 2808 KB Output is correct
9 Correct 435 ms 3448 KB Output is correct
10 Correct 395 ms 3192 KB Output is correct
11 Correct 380 ms 3064 KB Output is correct
12 Correct 667 ms 3832 KB Output is correct
13 Correct 400 ms 3064 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1656 KB Output is correct
2 Correct 5 ms 1656 KB Output is correct
3 Correct 5 ms 1660 KB Output is correct
4 Correct 5 ms 1656 KB Output is correct
5 Correct 5 ms 1656 KB Output is correct
6 Correct 5 ms 1656 KB Output is correct
7 Correct 421 ms 2552 KB Output is correct
8 Correct 428 ms 2808 KB Output is correct
9 Correct 435 ms 3448 KB Output is correct
10 Correct 395 ms 3192 KB Output is correct
11 Correct 380 ms 3064 KB Output is correct
12 Correct 667 ms 3832 KB Output is correct
13 Correct 400 ms 3064 KB Output is correct
14 Correct 423 ms 3064 KB Output is correct
15 Correct 689 ms 3196 KB Output is correct
16 Correct 1147 ms 3932 KB Output is correct
17 Correct 1160 ms 4472 KB Output is correct
18 Correct 1241 ms 4432 KB Output is correct
19 Correct 587 ms 3600 KB Output is correct
20 Correct 1147 ms 4472 KB Output is correct
21 Correct 1111 ms 4344 KB Output is correct
22 Correct 643 ms 3576 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1656 KB Output is correct
2 Correct 5 ms 1656 KB Output is correct
3 Correct 5 ms 1660 KB Output is correct
4 Correct 5 ms 1656 KB Output is correct
5 Correct 5 ms 1656 KB Output is correct
6 Correct 5 ms 1656 KB Output is correct
7 Correct 421 ms 2552 KB Output is correct
8 Correct 428 ms 2808 KB Output is correct
9 Correct 435 ms 3448 KB Output is correct
10 Correct 395 ms 3192 KB Output is correct
11 Correct 380 ms 3064 KB Output is correct
12 Correct 667 ms 3832 KB Output is correct
13 Correct 400 ms 3064 KB Output is correct
14 Correct 423 ms 3064 KB Output is correct
15 Correct 689 ms 3196 KB Output is correct
16 Correct 1147 ms 3932 KB Output is correct
17 Correct 1160 ms 4472 KB Output is correct
18 Correct 1241 ms 4432 KB Output is correct
19 Correct 587 ms 3600 KB Output is correct
20 Correct 1147 ms 4472 KB Output is correct
21 Correct 1111 ms 4344 KB Output is correct
22 Correct 643 ms 3576 KB Output is correct
23 Correct 2906 ms 6976 KB Output is correct
24 Correct 3213 ms 7016 KB Output is correct
25 Correct 2169 ms 6676 KB Output is correct
26 Correct 2719 ms 5736 KB Output is correct
27 Correct 2638 ms 5752 KB Output is correct
28 Correct 1493 ms 3704 KB Output is correct
29 Correct 1436 ms 3704 KB Output is correct
30 Correct 1485 ms 3704 KB Output is correct
31 Correct 1426 ms 3636 KB Output is correct
32 Correct 2166 ms 5752 KB Output is correct
33 Correct 1783 ms 5768 KB Output is correct
34 Correct 2218 ms 5624 KB Output is correct
35 Correct 1879 ms 7704 KB Output is correct
36 Correct 1577 ms 5624 KB Output is correct
37 Correct 2747 ms 7556 KB Output is correct
38 Correct 2400 ms 5752 KB Output is correct
39 Correct 2005 ms 5724 KB Output is correct
40 Correct 2661 ms 5756 KB Output is correct
41 Correct 3651 ms 7480 KB Output is correct
42 Correct 3742 ms 7468 KB Output is correct