oj.uz

답안 #27498

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
27498 2017-07-13T08:08:27 Z 김현수(#1153) OGLEDALA (COI15_ogledala) C++14
41 / 100
 4000 ms 128260 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
const ll N = 300005;

ll l, n, m, a[N], qry[N], cur[N];
vector<ll> dt[N], v[N];

priority_queue<pll> pq;

void add (vector<ll> &V, ll A) {
	if(A <= 0) return;
	for(auto &T : V) if(T == A) return;
	V.push_back(A);
}

ll geti (vector<ll> &V, ll I, ll P) {
	for(ll i=max(0ll, I-3);i<I;i++) if(V[i] == P) return i;
	return -1;
}

void kth (ll I, ll C, ll O, ll S, ll E, ll K) {
	if(C == O) {printf("%lld\n",(S+E)/2); return;}
	ll L = E-S+1, I1 = geti(v[I], C, (L-1)/2), I2 = (L/2 == (L-1)/2 ? I1 : I1+1);
	if(I1>=O && dt[I][I1] >= K) kth(I, I1, O, S, (S+E)/2-1, K);
	else kth(I, I2, O, (S+E)/2+1, E, K - (I1>=O?dt[I][I1]:0));
}

void calc (vector<ll> &D, vector<ll> &V, ll O) {
	D.clear();
	for(ll i=0;i<V.size();i++) {
		D.push_back(0);
		if(i == O) D[i] = 1;
		else if(i > O) {
			ll I1 = geti(V, i, (V[i]-1)/2);
			ll I2 = (V[i]/2 == (V[i]-1)/2 ? I1 : I1+1);
			if(I1 != -1) D[i] += D[I1];
			if(I2 != -1) D[i] += D[I2];
		}
	}
}

int main() {
	scanf("%lld%lld%lld",&l,&n,&m);
	for(ll i=1;i<=n;i++) scanf("%lld",&a[i]);
	a[n+1] = l+1;
	for(ll i=1;i<=n+1;i++) {
		add(v[i], a[i]-a[i-1]-1);
		for(ll j=0;j<v[i].size();j++) {
			add(v[i], v[i][j]/2);
			add(v[i], (v[i][j]-1)/2);
		}
		reverse(v[i].begin(), v[i].end());
	}
	for(ll i=1;i<=n+1;i++) {
		cur[i] = v[i].size();
		if(--cur[i] >= 0) {
			calc(dt[i], v[i], cur[i]);
			pq.push({v[i][cur[i]], -i});
		}
	}
	ll cq = 1, dn = n;
	for(ll i=1;i<=m;i++) {
		scanf("%lld",&qry[i]);
		if(qry[i] <= n) {
			cq++;
			printf("%lld\n",a[qry[i]]);
		}
	}
	while(!pq.empty()) {
		ll C = -pq.top().second, V = dt[C][v[C].size()-1]; pq.pop();
		for(;cq <= m && qry[cq] <= dn + V; cq++) {
			kth(C, v[C].size()-1, cur[C], a[C-1]+1, a[C]-1, qry[cq]-dn);
		}
		if(cq > m) break;
		dn += V;
		if(--cur[C] >= 0) {
			calc(dt[C], v[C], cur[C]);
			pq.push({v[C][cur[C]], -C});
		}
	}
}

Compilation message

ogledala.cpp: In function 'void calc(std::vector<long long int>&, std::vector<long long int>&, ll)':
ogledala.cpp:32:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(ll i=0;i<V.size();i++) {
              ^
ogledala.cpp: In function 'int main()':
ogledala.cpp:50:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(ll j=0;j<v[i].size();j++) {
               ^
ogledala.cpp:45:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld%lld",&l,&n,&m);
                                ^
ogledala.cpp:46:42: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(ll i=1;i<=n;i++) scanf("%lld",&a[i]);
                                          ^
ogledala.cpp:65:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld",&qry[i]);
                        ^

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 23116 KB Output is correct
2 Correct 3 ms 23116 KB Output is correct
3 Correct 53 ms 24456 KB Output is correct
4 Correct 43 ms 24564 KB Output is correct
5 Correct 119 ms 31080 KB Output is correct
6 Correct 129 ms 31372 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 23248 KB Output is correct
2 Correct 9 ms 23248 KB Output is correct
3 Correct 696 ms 128192 KB Output is correct
4 Correct 726 ms 128260 KB Output is correct
5 Correct 826 ms 128260 KB Output is correct
6 Correct 816 ms 128260 KB Output is correct

Subtask #3
0 / 59.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3149 ms 87076 KB Output is correct
2 Correct 3303 ms 84304 KB Output is correct
3 Execution timed out 4000 ms 127148 KB Execution timed out
4 Halted 0 ms 0 KB -