oj.uz

답안 #132589

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
132589 2019-07-19T07:53:03 Z tmwilliamlin168 코끼리 (Dancing Elephants) (IOI11_elephants) C++14
100 / 100
 5667 ms 12372 KB 
#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;

const int mxN=1.5e5, B=570, mxBC=(mxN-1)/B+1;
int n, l, *x, uc, bc, r[mxBC];
map<int, int> mp;
vector<int> v[mxBC];
vector<array<int, 2>> w[mxBC];

void init(int N, int L, int X[]) {
	n=N, l=L, x=X;
	for(int i=0; i<n; ++i)
		++mp[x[i]];
}

void bb(int i) {
	w[i]=vector<array<int, 2>>(v[i].size());
	for(int j1=(int)v[i].size()-1, j2=v[i].size(); ~j1; --j1) {
		while(v[i][j2-1]>v[i][j1]+l)
			--j2;
		w[i][j1]=j2<v[i].size()?array<int, 2>{w[i][j2][0]+1, w[i][j2][1]}:array<int, 2>{1, v[i][j1]+l};
	}
}
void bld() {
	bc=0;
	for(pair<int, int> p : mp) {
		if(!bc||v[bc-1].size()>=B)
			v[bc++].clear();
		v[bc-1].push_back(p.first);
	}
	for(int i=0; i<bc; ++i) {
		r[i]=i+1<bc?v[i+1][0]-1:1e9;
		bb(i);
	}
}

void upd(int x, bool a) {
	int c=-1;
	while(x>r[++c]);
	int p=lower_bound(v[c].begin(), v[c].end(), x)-v[c].begin();
	if(a)
		v[c].insert(v[c].begin()+p, x);
	else
		v[c].erase(v[c].begin()+p);
	bb(c);
}

int update(int i, int y) {
	if(uc++%B==0)
		bld();
	--mp[x[i]];
	if(!mp[x[i]]) {
		upd(x[i], 0);
		mp.erase(x[i]);
	}
	if(!mp[y])
		upd(y, 1);
	++mp[y];
	x[i]=y;
	int a=0;
	for(int i=0, c=-1; i<bc; ++i) {
		int p=upper_bound(v[i].begin(), v[i].end(), c)-v[i].begin();
		if(p<v[i].size()) {
			a+=w[i][p][0];
			c=w[i][p][1];
		}
	}
	return a;
}

Compilation message

elephants.cpp: In function 'void bb(int)':
elephants.cpp:22:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   w[i][j1]=j2<v[i].size()?array<int, 2>{w[i][j2][0]+1, w[i][j2][1]}:array<int, 2>{1, v[i][j1]+l};
            ~~^~~~~~~~~~~~
elephants.cpp: In function 'int update(int, int)':
elephants.cpp:64:7: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(p<v[i].size()) {
      ~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 516 ms 1968 KB Output is correct
8 Correct 533 ms 2296 KB Output is correct
9 Correct 502 ms 4344 KB Output is correct
10 Correct 481 ms 4216 KB Output is correct
11 Correct 522 ms 4352 KB Output is correct
12 Correct 872 ms 4488 KB Output is correct
13 Correct 430 ms 4344 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 516 ms 1968 KB Output is correct
8 Correct 533 ms 2296 KB Output is correct
9 Correct 502 ms 4344 KB Output is correct
10 Correct 481 ms 4216 KB Output is correct
11 Correct 522 ms 4352 KB Output is correct
12 Correct 872 ms 4488 KB Output is correct
13 Correct 430 ms 4344 KB Output is correct
14 Correct 278 ms 2800 KB Output is correct
15 Correct 780 ms 2920 KB Output is correct
16 Correct 1358 ms 4728 KB Output is correct
17 Correct 1408 ms 6004 KB Output is correct
18 Correct 1595 ms 6108 KB Output is correct
19 Correct 758 ms 6008 KB Output is correct
20 Correct 1637 ms 6008 KB Output is correct
21 Correct 1481 ms 5992 KB Output is correct
22 Correct 786 ms 5856 KB Output is correct

Subtask #5
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 516 ms 1968 KB Output is correct
8 Correct 533 ms 2296 KB Output is correct
9 Correct 502 ms 4344 KB Output is correct
10 Correct 481 ms 4216 KB Output is correct
11 Correct 522 ms 4352 KB Output is correct
12 Correct 872 ms 4488 KB Output is correct
13 Correct 430 ms 4344 KB Output is correct
14 Correct 278 ms 2800 KB Output is correct
15 Correct 780 ms 2920 KB Output is correct
16 Correct 1358 ms 4728 KB Output is correct
17 Correct 1408 ms 6004 KB Output is correct
18 Correct 1595 ms 6108 KB Output is correct
19 Correct 758 ms 6008 KB Output is correct
20 Correct 1637 ms 6008 KB Output is correct
21 Correct 1481 ms 5992 KB Output is correct
22 Correct 786 ms 5856 KB Output is correct
23 Correct 3747 ms 12040 KB Output is correct
24 Correct 3706 ms 12268 KB Output is correct
25 Correct 2908 ms 12044 KB Output is correct
26 Correct 3026 ms 12188 KB Output is correct
27 Correct 3216 ms 12084 KB Output is correct
28 Correct 2207 ms 2852 KB Output is correct
29 Correct 2133 ms 2940 KB Output is correct
30 Correct 2248 ms 2808 KB Output is correct
31 Correct 2137 ms 2936 KB Output is correct
32 Correct 3276 ms 12336 KB Output is correct
33 Correct 1114 ms 12132 KB Output is correct
34 Correct 2595 ms 12192 KB Output is correct
35 Correct 1214 ms 12128 KB Output is correct
36 Correct 77 ms 2684 KB Output is correct
37 Correct 1887 ms 12344 KB Output is correct
38 Correct 2739 ms 12024 KB Output is correct
39 Correct 2799 ms 12064 KB Output is correct
40 Correct 2909 ms 12348 KB Output is correct
41 Correct 5545 ms 12372 KB Output is correct
42 Correct 5667 ms 12368 KB Output is correct