oj.uz

Submission #167450

# Submission time Handle Problem Language Result Execution time Memory
167450 2019-12-08T15:13:58 Z Thuleanx Lightning Conductor (POI11_pio) C++14
27 / 100
 147 ms 27832 KB 
#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 + sqr[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;
	}
};

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

	cin>>n;
	memset(L,0,sizeof(L)); 
	memset(R,0,sizeof(R));
	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]);

	deque<Sol> dq;
	// forward
	for (int i = 0; i < n; i++) {
		cin>>h[i];
		while (dq.size() >= 2 && dq[dq.size()-2].value(i) > dq.back().value(i))
			dq.pop_back();
		if (dq.size())
			L[i] = dq.back().value(i);
		Sol sol(i, h[i]);
		if (dq.size() && dq.back().value(i) >= h[i]) continue;
		while (dq.size() >= 2 && dq[dq.size()-2].to(dq.back()) <= dq.back().to(sol))
			dq.pop_back();
		dq.push_back(sol);
	}
	// backward
	reverse(h, h+n);
	dq.clear();
	for (int i = 0; i < n; i++) {
		while (dq.size() >= 2 && dq[dq.size()-2].value(i) > dq.back().value(i))
			dq.pop_back();
		if (dq.size())
			R[i] = dq.back().value(i);
		Sol sol(i, h[i]);
		if (dq.size() && dq.back().value(i) >= h[i]) continue;
		while (dq.size() >= 2 && dq[dq.size()-2].to(dq.back()) <= dq.back().to(sol))
			dq.pop_back();
		dq.push_back(sol);
	}
	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

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.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 6264 KB Output isn't correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 6264 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 6264 KB Output isn't correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 7640 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 8564 KB Output is correct

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 8180 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 34 ms 9076 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 66 ms 12844 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 106 ms 21436 KB Output is correct
2 Correct 93 ms 15336 KB Output is correct
3 Incorrect 94 ms 20192 KB Output isn't correct

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 27832 KB Output is correct
2 Incorrect 127 ms 19156 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 139 ms 20708 KB Output isn't correct
2 Halted 0 ms 0 KB -