oj.uz

답안 #393982

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
393982 2021-04-25T06:18:21 Z sinamhdv 코끼리 (Dancing Elephants) (IOI11_elephants) C++11
100 / 100
 5625 ms 7608 KB 
// IOI11_elephants
#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int mod = 1000 * 1000 * 1000 + 7;
const int INF = 1e9 + 100;
const ll LINF = 1e18 + 100;

#ifdef DEBUG
#define dbg(x) cout << #x << " = " << (x) << endl << flush;
#define dbgr(s, f) { cout << #s << ": "; for (auto _ = (s); _ != (f); _++) cout << *_ << ' '; cout << endl << flush; }
#else
#define dbg(x) ;
#define dbgr(s, f) ;
#endif
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define fast_io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define endl '\n'

#define MAXN 150100
#define SQ 600
#define BLK (MAXN / SQ + 10)

int n, L;
vector<int> blk[BLK];
int bnum[MAXN], blkind[MAXN];
int pos[MAXN], ind[MAXN];
pii dp[MAXN];
int qnum;
int bcnt;

inline bool cmp(int x, int y)
{
	return pos[x] < pos[y];
}

inline void prep_dp(int b)
{
	int ptr = blk[b].size() - 1;
	for (int i = (int)blk[b].size() - 1; i >= 0; i--)
	{
		int u = blk[b][i];
		int nxt = pos[u] + L;
		if (nxt >= pos[blk[b].back()])
			dp[u] = {1, nxt};
		else
		{
			while (pos[blk[b][ptr]] > nxt) ptr--;
			dp[u] = dp[blk[b][ptr + 1]];
			dp[u].fr++;
		}
	}
}


inline int blocklb(int x)
{
	int l = -1, r = bcnt - 1;
	if (blk[r].empty()) r--;
	if (pos[blk[r].back()] < x) return INF;
	while (r - l > 1)
	{
		int mid = (r + l) / 2;
		if (pos[blk[mid].back()] < x) l = mid;
		else r = mid;
	}
	return r;
}


inline void rebuild(void)
{
	int ptr = 0;
	FOR(i, 0, bcnt)
	{
		for (int u : blk[i]) ind[ptr++] = u;
		blk[i].clear();
	}
	FOR(i, 0, n) blk[i/SQ].pb(ind[i]), bnum[ind[i]] = i/SQ, blkind[ind[i]] = i % SQ;
	FOR(i, 0, bcnt) prep_dp(i);
}

void init(int N, int L, int X[])
{
	n = N;
	::L = L;
	bcnt = (n - 1) / SQ + 1;
	copy(X, X + n, pos);
	iota(ind, ind + n, 0);
	FOR(i, 0, BLK) blk[i].reserve(2 * SQ + 10);
	rebuild();
}

inline void swapadj(int b, int i)
{
	blkind[blk[b][i - 1]]++;
	blkind[blk[b][i]]--;
	swap(blk[b][i], blk[b][i - 1]);
}

int update(int i, int y)
{
	qnum++;
	if (qnum % (SQ - 5) == 0)
		rebuild();

	// update blocks
	int old = bnum[i];
	int nw = blocklb(y);
	if (nw >= INF) nw = bcnt-  1;
	pos[i] = y;
	bnum[i] = nw;

	FOR(j, blkind[i] + 1, (int)blk[old].size()) blkind[blk[old][j]]--;
	
	blk[old].erase(blk[old].begin() + blkind[i]);
	blk[nw].pb(i);
	blkind[i] = blk[nw].size() - 1;
	while (blkind[i] && y < pos[blk[nw][blkind[i] - 1]])
		swapadj(nw, blkind[i]);

	// re-calc dp
	prep_dp(old);
	prep_dp(nw);

	// get answer
	int p = -1;
	int ans = 0;
	FOR(b, 0, bcnt)
	{
		pos[MAXN - 1] = p;
		auto l = upper_bound(all(blk[b]), MAXN - 1, cmp);
		if (l == blk[b].end()) continue;
		ans += dp[*l].fr;
		p = dp[*l].sc;
	}

	return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
16.0 / 16.0

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

Subtask #3
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1356 KB Output is correct
2 Correct 1 ms 1356 KB Output is correct
3 Correct 1 ms 1360 KB Output is correct
4 Correct 1 ms 1360 KB Output is correct
5 Correct 2 ms 1356 KB Output is correct
6 Correct 1 ms 1360 KB Output is correct
7 Correct 617 ms 2336 KB Output is correct
8 Correct 771 ms 2468 KB Output is correct
9 Correct 709 ms 3396 KB Output is correct
10 Correct 394 ms 3384 KB Output is correct
11 Correct 435 ms 3396 KB Output is correct
12 Correct 1048 ms 3480 KB Output is correct
13 Correct 395 ms 3404 KB Output is correct

Subtask #4
47.0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1356 KB Output is correct
2 Correct 1 ms 1356 KB Output is correct
3 Correct 1 ms 1360 KB Output is correct
4 Correct 1 ms 1360 KB Output is correct
5 Correct 2 ms 1356 KB Output is correct
6 Correct 1 ms 1360 KB Output is correct
7 Correct 617 ms 2336 KB Output is correct
8 Correct 771 ms 2468 KB Output is correct
9 Correct 709 ms 3396 KB Output is correct
10 Correct 394 ms 3384 KB Output is correct
11 Correct 435 ms 3396 KB Output is correct
12 Correct 1048 ms 3480 KB Output is correct
13 Correct 395 ms 3404 KB Output is correct
14 Correct 649 ms 2692 KB Output is correct
15 Correct 877 ms 2884 KB Output is correct
16 Correct 1770 ms 3652 KB Output is correct
17 Correct 1766 ms 4200 KB Output is correct
18 Correct 1904 ms 4292 KB Output is correct
19 Correct 1451 ms 4196 KB Output is correct
20 Correct 1746 ms 4200 KB Output is correct
21 Correct 1723 ms 4192 KB Output is correct
22 Correct 704 ms 4200 KB Output is correct

Subtask #5
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1356 KB Output is correct
2 Correct 1 ms 1356 KB Output is correct
3 Correct 1 ms 1360 KB Output is correct
4 Correct 1 ms 1360 KB Output is correct
5 Correct 2 ms 1356 KB Output is correct
6 Correct 1 ms 1360 KB Output is correct
7 Correct 617 ms 2336 KB Output is correct
8 Correct 771 ms 2468 KB Output is correct
9 Correct 709 ms 3396 KB Output is correct
10 Correct 394 ms 3384 KB Output is correct
11 Correct 435 ms 3396 KB Output is correct
12 Correct 1048 ms 3480 KB Output is correct
13 Correct 395 ms 3404 KB Output is correct
14 Correct 649 ms 2692 KB Output is correct
15 Correct 877 ms 2884 KB Output is correct
16 Correct 1770 ms 3652 KB Output is correct
17 Correct 1766 ms 4200 KB Output is correct
18 Correct 1904 ms 4292 KB Output is correct
19 Correct 1451 ms 4196 KB Output is correct
20 Correct 1746 ms 4200 KB Output is correct
21 Correct 1723 ms 4192 KB Output is correct
22 Correct 704 ms 4200 KB Output is correct
23 Correct 4042 ms 7408 KB Output is correct
24 Correct 4283 ms 7408 KB Output is correct
25 Correct 3280 ms 7408 KB Output is correct
26 Correct 3112 ms 7408 KB Output is correct
27 Correct 4665 ms 7484 KB Output is correct
28 Correct 2709 ms 3256 KB Output is correct
29 Correct 2689 ms 3256 KB Output is correct
30 Correct 2715 ms 3316 KB Output is correct
31 Correct 2649 ms 3256 KB Output is correct
32 Correct 2882 ms 7492 KB Output is correct
33 Correct 2421 ms 7436 KB Output is correct
34 Correct 2650 ms 7408 KB Output is correct
35 Correct 2511 ms 7408 KB Output is correct
36 Correct 2698 ms 7404 KB Output is correct
37 Correct 4463 ms 7404 KB Output is correct
38 Correct 2512 ms 7408 KB Output is correct
39 Correct 4279 ms 7604 KB Output is correct
40 Correct 2822 ms 7600 KB Output is correct
41 Correct 5487 ms 7600 KB Output is correct
42 Correct 5625 ms 7608 KB Output is correct