oj.uz

Submission #15724

# Submission time Handle Problem Language Result Execution time Memory
15724 2015-07-16T13:07:03 Z gs14004 Holiday (IOI14_holiday) C++14
100 / 100
 1080 ms 41708 KB 
#include"holiday.h"
#include <cstdio>
#include <queue>
#include <algorithm>
using namespace std;
typedef long long lint;
typedef pair<int, lint> pi;

priority_queue<int, vector<int>, greater<int> > pq;

lint ret;
int *a, st, dist;
pi value[100005];

struct range_tree{
	vector<pi> tree[270000]; // [pos, attraction]
	int lim;
	void init(int n, pi *a){
		for(lim = 1; lim <= n; lim <<= 1);
		for(int i=0; i<n; i++){
			int pos = i + lim;
			while(pos){
				tree[pos].push_back(a[i]);
				pos >>= 1;
			}
		}
		for(int i=lim-1; i; i--){
			sort(tree[i].begin(), tree[i].end());
			for(int j=1; j<tree[i].size(); j++){
				tree[i][j].second += tree[i][j-1].second;
			}
		}
	}
	pi count(int nd, int s, int e){
		pi ret(0,0);
		int stp = (int)(lower_bound(tree[nd].begin(), tree[nd].end(), pi(s, -1)) - tree[nd].begin());
		int edp = (int)(lower_bound(tree[nd].begin(), tree[nd].end(), pi(e+1, -1)) - tree[nd].begin());
		ret.first += edp - stp;
		ret.second += (edp ? tree[nd][edp - 1].second : 0) - (stp ? tree[nd][stp - 1].second : 0);
		return ret;
	}
	lint query(int s, int e, int x){
		x++;
		int pos = 1;
		lint ret = 0;
		while(pos <= lim){
			pi t = count(2*pos, s, e);
			if(x <= t.first) pos = 2 * pos;
			else{
				x -= t.first;
				ret += t.second;
				pos = 2 * pos + 1;
			}
		}
		return ret;
	}
}rtree;

void divConq(int s, int e, int rs, int re){ 
	if(s > e) return;
	int m = (s+e)/2;
	lint copt = 0, cres = -1;
	int opt = rs;
	for(int i=rs; i<=re; i++){
		int cnt = dist - (i - m + min(i - st, st - m));
		if(cnt <= 0) break;
		copt = rtree.query(m, i, min(cnt, i - m + 1));
		if(cres < copt){
			cres = copt;
			opt = i;
		}
	}
	ret = max(ret, cres);
	divConq(s,m-1,rs,opt);
	divConq(m+1,e,opt,re);
} 

long long int findMaxAttraction(int n, int start, int d, int attraction[]) {
	a = attraction;
	for(int i=0; i<n; i++){
		value[i] = pi(i, attraction[i]);
	}
	sort(value, value + n, [&](const pi &a, const pi &b){return a.second > b.second;});
	rtree.init(n,value);
	st = start;
	dist = d;
	divConq(0, start, start, n-1);
	return ret;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 9368 KB Output is correct
2 Correct 3 ms 9372 KB Output is correct
3 Correct 0 ms 9376 KB Output is correct
4 Correct 0 ms 9372 KB Output is correct
5 Correct 3 ms 9368 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 41704 KB Output is correct
2 Correct 160 ms 41708 KB Output is correct
3 Correct 148 ms 41708 KB Output is correct
4 Correct 153 ms 41704 KB Output is correct
5 Correct 212 ms 38916 KB Output is correct
6 Correct 49 ms 17420 KB Output is correct
7 Correct 101 ms 24908 KB Output is correct
8 Correct 134 ms 27992 KB Output is correct
9 Correct 32 ms 15156 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 10052 KB Output is correct
2 Correct 3 ms 10052 KB Output is correct
3 Correct 3 ms 10056 KB Output is correct
4 Correct 14 ms 10048 KB Output is correct
5 Correct 10 ms 9920 KB Output is correct
6 Correct 3 ms 9504 KB Output is correct
7 Correct 6 ms 9504 KB Output is correct
8 Correct 3 ms 9500 KB Output is correct
9 Correct 6 ms 9504 KB Output is correct

Subtask #4
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 164 ms 41704 KB Output is correct
2 Correct 140 ms 41708 KB Output is correct
3 Correct 224 ms 23204 KB Output is correct
4 Correct 13 ms 10056 KB Output is correct
5 Correct 3 ms 9500 KB Output is correct
6 Correct 3 ms 9504 KB Output is correct
7 Correct 3 ms 9508 KB Output is correct
8 Correct 1075 ms 41708 KB Output is correct
9 Correct 1080 ms 41704 KB Output is correct