Submission #90624

#	Time	Username	Problem	Language	Result	Execution time	Memory
90624		jasony123123	OGLEDALA (COI15_ogledala)	C++11	41 / 100	4035 ms	410056 KiB

ogledala

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;

#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define mp make_pair
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"

typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }

void io() {
#ifdef LOCAL_PROJECT 
	freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else 
	/* online submission */

#endif 
	ios_base::sync_with_stdio(false); cin.tie(NULL);
}

const ll MOD = 1000000007LL;
const ll PRIME = 105943LL;
const ll INF = 1e18;
/****************************************************************/

struct Seg {
	ll l, r, sz;
	Seg(ll a, ll b) {
		l = a, r = b;
		sz = b - a + 1LL;
	}
	bool operator<(const Seg &other) const {
		return mp(sz, -r) < mp(other.sz, -other.r);
	}
};

ll M, N, Q;
v<ll> A, B;
priority_queue<Seg> pq;

int main() {
	io();
	cin >> M >> N >> Q;
	A.resize(N);
	B.resize(Q);
	FOR(i, 0, N) cin >> A[i];
	FOR(i, 0, Q) {
		cin >> B[i];
		B[i] -= N;
	}
	reverse(all(B));
	while (B.back() <= 0) {
		cout << A[B.back() + N - 1] << "\n";
		B.pop_back();
		if (B.empty())
			return 0;
	}
	
	if (1 < A[0]) 
		pq.push(Seg(1, A[0] - 1));
	FOR(i, 0, N - 1)
		if (A[i] < A[i + 1] - 1)
			pq.push(Seg(A[i] + 1, A[i + 1] - 1));
	if (A[N - 1] < M)
		pq.push(Seg(A[N - 1] + 1, M));

	FOR(i, 1, M + 1) {
		Seg chosen = pq.top();
		pq.pop();
		ll mid = (chosen.l + chosen.r) / 2LL;
		if (i == B.back()) {
			cout << mid << "\n";
			B.pop_back();
			if (B.empty())
				break;
		}
		if (chosen.l <= mid - 1)
			pq.push(Seg(chosen.l, mid - 1));
		if (mid + 1 <= chosen.r)
			pq.push(Seg(mid + 1, chosen.r));
	}
	return 0;
}

• Subtask 1: 19 / 19
• Subtask 2: 22 / 22
• Subtask 3: 0 / 59