oj.uz

Submission #85928

# Submission time Handle Problem Language Result Execution time Memory
85928 2018-11-23T01:57:08 Z wzy Dancing Elephants (IOI11_elephants) C++11
97 / 100
 9000 ms 113272 KB 
#include <bits/stdc++.h>
#include "elephants.h"
using namespace std;
int sqt = 0;
int n , L;
int V[150005];

vector<int> bucket[390];
int DP[150005];
int G[150005];
int pos[150005];
int lastbucket = 0;
int pot = 0;
int v[150005];
void rebuild(bool C){
	pot = 0;
	if(C){
		for(int i = 0 ; i < n ; i ++) v[i] = i;
	}
	else{
		int CC = 0;
		for(int i = 0 ; i <= lastbucket; i ++){
			for(int j = 0 ; j < bucket[i].size() ; j++){
				v[CC++] = bucket[i][j];
			}
			bucket[i].clear();
		}
	}
	int currbucket = 0;
	for(int i = 0 ; i < n; i++){
		if(bucket[currbucket].size() <= sqt){
			bucket[currbucket].push_back(v[i]);
		}
		else{
			bucket[++currbucket].push_back(v[i]);
		}
		pos[v[i]] = currbucket;
		lastbucket = currbucket;
	}
	for(int i = 0 ; i <= lastbucket ; i++){
		int curr = 0;
		int X = bucket[i].size();
		curr = X-1;
		for(int j = X - 1  ; j >=0  ; j--){		
			DP[bucket[i][j]] = 1;
			while(curr > j && V[bucket[i][curr - 1]] > (V[bucket[i][j]] + L)){
				curr--;
			}
			G[bucket[i][j]] = j;
			if(V[bucket[i][curr]] > (V[bucket[i][j]] + L)){
				DP[bucket[i][j]] += DP[bucket[i][curr]];
				G[bucket[i][j]] = G[bucket[i][curr]];
			}
		}
	}
}

void erase_elem(int currbucket, int vl){
	vector<int> w;
	for(int i = 0 ; i < bucket[currbucket].size() ; i++){
		if(bucket[currbucket][i] == vl){
			continue;
		}
		w.push_back(bucket[currbucket][i]);
	}
	bucket[currbucket] = w;
	int i = currbucket;
	int X = bucket[i].size();
	int curr = X-1;
	for(int j = X - 1  ; j >=0  ; j--){		
		DP[bucket[i][j]] = 1;
		while(curr > j && V[bucket[i][curr - 1]] > (V[bucket[i][j]] + L)){
			curr--;
		}
		G[bucket[i][j]] = j;
		if(V[bucket[i][curr]] > (V[bucket[i][j]] + L)){
			DP[bucket[i][j]] += DP[bucket[i][curr]];
			G[bucket[i][j]] = G[bucket[i][curr]];
		}
	}
	// recalculate DP now
}

void add_elem(int currbucket , int vl){
	vector<int> w;
	bool jafoi = false;
	pos[vl] = currbucket;
	for(int i = 0 ; i < bucket[currbucket].size() ; i++){
		if(V[bucket[currbucket][i]] >= V[vl] && !jafoi){
			jafoi = true;
			w.push_back(vl);
		}
		w.push_back(bucket[currbucket][i]);
	}
	if(!jafoi) w.push_back(vl);
	swap(bucket[currbucket] , w);
	int i = currbucket;
	int X = bucket[i].size();
	int curr = X - 1;
	for(int j = X - 1  ; j >=0  ; j--){		
		DP[bucket[i][j]] = 1;
		while(curr > j && V[bucket[i][curr - 1]] > (V[bucket[i][j]] + L)){
			curr--;
		}
		G[bucket[i][j]] = j;
		if(V[bucket[i][curr]] > (V[bucket[i][j]] + L)){
			DP[bucket[i][j]] += DP[bucket[i][curr]];
			G[bucket[i][j]] = G[bucket[i][curr]];
		}
	}	
}

void init(int N, int Lx, int X[])
{
  sqt = 1100;
  n = N;
  L = Lx;
  for(int i = 0 ; i < N ; i ++) V[i] = X[i];
  rebuild(1);
}

int update(int ix, int yx)
{
	erase_elem(pos[ix],ix);
	int oldd = pos[ix];
	V[ix] = yx;
	int newbucket = lastbucket;
	for(int i = 0 ; i <= lastbucket -1 ; i++){
		if(bucket[i+1].size() && V[bucket[i+1].front()] >= yx){
			newbucket = i;
			break;
		}
	}
	add_elem(newbucket , ix);
	pot++;
	if(bucket[oldd].size() == 0 || pot >= 680){
		rebuild(0);
	}
	int currpos = 0;
	int currbucket = 0;
	int ans = 0;
	while(true){
 		ans += DP[bucket[currbucket][currpos]];
		currpos = G[bucket[currbucket][currpos]];
		int ansj = -1;
		int R = V[bucket[currbucket][currpos]] + L;
		for(int j = currbucket + 1 ; j <= lastbucket ; j++){
			if(V[bucket[j].back()] <= R){
				continue;
			}
			else{
				ansj = j;
				break;
			}
		}
		if(ansj == -1) break;
		else{
			currbucket = ansj;
			int l= 0 , r = bucket[currbucket].size();
			r--;
			int ansj2 = -1;
			while(l<=r){
				int mid = (l+r)/2;
				if(V[bucket[ansj][mid]] > R){
					r = mid - 1;
					ansj2 = mid;
				}
				else l = mid + 1;
			}
			currpos = ansj2;
		}
 	}
 	return ans;

}


/*
int32_t main(){
	int n , l , q;
	cin>>n>>l>>q;
	vector<int> X(n);
	for(int i = 0 ; i < n ; i ++) cin>>X[i];
	init(n , l , X);
	while(q--){
		int x , y;
		cin>>x>>y;
		cout<< update(x,y) << endl;
	}
}*/

Compilation message

elephants.cpp: In function 'void rebuild(bool)':
elephants.cpp:23:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int j = 0 ; j < bucket[i].size() ; j++){
                    ~~^~~~~~~~~~~~~~~~~~
elephants.cpp:31:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(bucket[currbucket].size() <= sqt){
      ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
elephants.cpp: In function 'void erase_elem(int, int)':
elephants.cpp:60:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0 ; i < bucket[currbucket].size() ; i++){
                  ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
elephants.cpp: In function 'void add_elem(int, int)':
elephants.cpp:88:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0 ; i < bucket[currbucket].size() ; i++){
                  ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 560 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 560 KB Output is correct
4 Correct 3 ms 708 KB Output is correct
5 Correct 3 ms 708 KB Output is correct
6 Correct 2 ms 820 KB Output is correct

Subtask #3
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 560 KB Output is correct
4 Correct 3 ms 708 KB Output is correct
5 Correct 3 ms 708 KB Output is correct
6 Correct 2 ms 820 KB Output is correct
7 Correct 1575 ms 2760 KB Output is correct
8 Correct 1581 ms 4028 KB Output is correct
9 Correct 1344 ms 6676 KB Output is correct
10 Correct 965 ms 7880 KB Output is correct
11 Correct 883 ms 9232 KB Output is correct
12 Correct 2269 ms 10764 KB Output is correct
13 Correct 942 ms 11684 KB Output is correct

Subtask #4
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 560 KB Output is correct
4 Correct 3 ms 708 KB Output is correct
5 Correct 3 ms 708 KB Output is correct
6 Correct 2 ms 820 KB Output is correct
7 Correct 1575 ms 2760 KB Output is correct
8 Correct 1581 ms 4028 KB Output is correct
9 Correct 1344 ms 6676 KB Output is correct
10 Correct 965 ms 7880 KB Output is correct
11 Correct 883 ms 9232 KB Output is correct
12 Correct 2269 ms 10764 KB Output is correct
13 Correct 942 ms 11684 KB Output is correct
14 Correct 1579 ms 12688 KB Output is correct
15 Correct 2193 ms 14144 KB Output is correct
16 Correct 3791 ms 16940 KB Output is correct
17 Correct 3706 ms 19536 KB Output is correct
18 Correct 4103 ms 21448 KB Output is correct
19 Correct 1666 ms 23540 KB Output is correct
20 Correct 3862 ms 25716 KB Output is correct
21 Correct 3695 ms 27616 KB Output is correct
22 Correct 1613 ms 29284 KB Output is correct

Subtask #5
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 2 ms 560 KB Output is correct
4 Correct 3 ms 708 KB Output is correct
5 Correct 3 ms 708 KB Output is correct
6 Correct 2 ms 820 KB Output is correct
7 Correct 1575 ms 2760 KB Output is correct
8 Correct 1581 ms 4028 KB Output is correct
9 Correct 1344 ms 6676 KB Output is correct
10 Correct 965 ms 7880 KB Output is correct
11 Correct 883 ms 9232 KB Output is correct
12 Correct 2269 ms 10764 KB Output is correct
13 Correct 942 ms 11684 KB Output is correct
14 Correct 1579 ms 12688 KB Output is correct
15 Correct 2193 ms 14144 KB Output is correct
16 Correct 3791 ms 16940 KB Output is correct
17 Correct 3706 ms 19536 KB Output is correct
18 Correct 4103 ms 21448 KB Output is correct
19 Correct 1666 ms 23540 KB Output is correct
20 Correct 3862 ms 25716 KB Output is correct
21 Correct 3695 ms 27616 KB Output is correct
22 Correct 1613 ms 29284 KB Output is correct
23 Correct 6614 ms 37680 KB Output is correct
24 Correct 7169 ms 42772 KB Output is correct
25 Correct 5277 ms 47808 KB Output is correct
26 Correct 3949 ms 52700 KB Output is correct
27 Correct 5167 ms 57608 KB Output is correct
28 Correct 7332 ms 57608 KB Output is correct
29 Correct 7318 ms 59076 KB Output is correct
30 Correct 7357 ms 62024 KB Output is correct
31 Correct 7189 ms 64980 KB Output is correct
32 Correct 3921 ms 73888 KB Output is correct
33 Correct 2741 ms 77588 KB Output is correct
34 Correct 3617 ms 82264 KB Output is correct
35 Correct 3965 ms 87196 KB Output is correct
36 Correct 5771 ms 91780 KB Output is correct
37 Correct 7889 ms 96624 KB Output is correct
38 Correct 4419 ms 100300 KB Output is correct
39 Correct 4470 ms 104888 KB Output is correct
40 Correct 4243 ms 108704 KB Output is correct
41 Execution timed out 9087 ms 113272 KB Time limit exceeded
42 Halted 0 ms 0 KB -