Submission #167457

#	Time	Username	Problem	Language	Result	Execution time	Memory
167457		Thuleanx	Lightning Conductor (POI11_pio)	C++14	27 / 100	621 ms	26036 KiB

pio

#include <bits/stdc++.h>
using namespace std;

const int N = 5e5+7;
int n;
int h[N];
int L[N], R[N];
int sqr[N];

struct Sol {
	int i, high;
	Sol(int i, int high):i(i), high(high) {}
	int value(int j) { return high + ceil(sqrt(j-i)); }
	int to(Sol &other) {
		int lo = other.i, hi = n-1;
		while (lo <= hi) {
			int mid = lo+hi>>1;	
			if (value(mid) > other.value(mid)) 	lo = mid+1;
			else								hi = mid-1;
		}
		return lo;
	}
};

void solve(int A[]) {
	deque<Sol> dq;
	for (int i = 0; i < n; i++) {
		while (dq.size() >= 2 && dq[0].value(i) <= dq[1].value(i))
			dq.pop_front();
		if (dq.size())
			A[i] = dq.front().value(i);
		Sol sol(i, h[i]);
		while (dq.size() && dq.back().value(i) <= h[i])
			dq.pop_back();
		while (dq.size() >= 2 && dq[dq.size()-2].to(dq.back()) <= dq.back().to(sol))
			dq.pop_back();
		dq.push_back(sol);
	}
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	cin>>n;
	memset(sqr,0,sizeof(sqr));
	for (int i = 0; i*i+1 < N; i++) 
		sqr[i*i+1] = i+1;
	for (int i = 1; i < N; i++)
		sqr[i] = max(sqr[i], sqr[i-1]);
	for (int i = 0; i < n; i++)
		cin>>h[i];
	solve(L);
	reverse(h, h+n);
	solve(R);
	reverse(h, h+n);
	reverse(R, R+n);
	stringstream ss;
	for (int i = 0; i < n; i++) 
		ss << max(0, max(L[i],R[i])-h[i]) << endl;
	cout << ss.str();

	return 0;
}

Compilation message (stderr)

pio.cpp: In member function 'int Sol::to(Sol&)':
pio.cpp:17:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
    int mid = lo+hi>>1; 
              ~~^~~

• Subtask 1: 0 / 9
• Subtask 2: 9 / 9
• Subtask 3: 0 / 9
• Subtask 4: 9 / 9
• Subtask 5: 9 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 9
• Subtask 8: 0 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 10