Submission #141622

#	Time	Username	Problem	Language	Result	Execution time	Memory
141622		abacaba	Lightning Conductor (POI11_pio)	C++14	100 / 100	322 ms	9284 KiB

pio

#include <bits/stdc++.h>
using namespace std;
 
struct point {
	int i, l, r;
};
 
const int N = 5e5 + 15;
int n, a[N], dp[N];
deque <point> q;
 
inline double get(int j, int i) {
	return a[i] + sqrt(abs(i - j));
}
 
void process() {
	q.clear();
	for(int i = 1; i <= n; ++i) {
		while(!q.empty() && q.front().r < i)
			q.pop_front();
		while(!q.empty() && get(max(i, q.back().l), q.back().i) <= get(max(i, q.back().l), i))
			q.pop_back();
		if(q.empty())
			q.push_back({i, i, n});
		else {
			int l = max(i, q.back().l), r = q.back().r, res = 0;
			while(l <= r) {
				int mid = l + r >> 1;
				if(get(mid, i) >= get(mid, q.back().i))
					res = mid, r = mid - 1;
				else
					l = mid + 1;
			}
			if(res) {
				if(res - 1 >= q.back().l)
					q.back().r = res - 1;
				else
					q.pop_back();
				q.push_back({i, res, n});
			}
		}
		dp[i] = max(dp[i], (int)ceil(get(i, q.front().i)) - a[i]);
	}
}
 
 
int main() {
	scanf("%d", &n);
	for(int i = 1; i <= n; ++i)
		scanf("%d", &a[i]);
	process();
	reverse(a + 1, a + 1 + n);
	reverse(dp + 1, dp + 1 + n);
	process();
	for(int i = n; i; --i)
		printf("%d\n", dp[i]);
    return 0;
}

Compilation message (stderr)

pio.cpp: In function 'void process()':
pio.cpp:28:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid = l + r >> 1;
               ~~^~~
pio.cpp: In function 'int main()':
pio.cpp:48:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
pio.cpp:50:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
   ~~~~~^~~~~~~~~~~~~

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