Submission #308842

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
308842	2020-10-02T04:55:58 Z	shivensinha4	Lightning Conductor (POI11_pio)	C++17	81 / 100	1000 ms	9592 KB

pio

#include <bits/stdc++.h> 
using namespace std; 
#define for_(i, s, e) for (int i = s; i < (int) e; i++)
#define for__(i, s, e) for (ll i = s; i < e; i++)
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
#define endl '\n'


int main() {
	#ifdef shiven
	freopen("test.in", "r", stdin);
	#endif
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	int n; cin >> n;
	vi h(n), pt, pref(n), suf(n);
	for_(i, 0, n) {
		cin >> h[i];
		pref[i] = suf[i] = h[i];
	}
	for_(i, 0, n) {
		if (i*i+1 < n) pt.push_back(i*i+1);
		else break;
	}
	
	int mx = 0;
	for_(i, 0, n) if (h[i] >= mx) {
		mx = h[i];
		for_(k, 0, pt.size()) {
			if (i+pt[k] < n) pref[i+pt[k]] = max(pref[i+pt[k]], h[i]+k+1);
			else break;
		}
	}
	
	mx = 0;
	for (int i = n-1; i >= 0; i--) if (h[i] >= mx) {
		for_(k, 0, pt.size()) {
			if (i-pt[k] >= 0) suf[i-pt[k]] = max(suf[i-pt[k]], h[i]+k+1);
			else break;
		}
	}
	
	for_(i, 1, n) pref[i] = max(pref[i], pref[i-1]);
	for (int i = n-2; i >= 0; i--) suf[i] = max(suf[i], suf[i+1]);
	
	for_(i, 0, n) cout << max(pref[i], suf[i]) - h[i] << endl;
	

	return 0;
}

Subtask #1

9.0 / 9.0

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

Subtask #2

9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	384 KB	Output is correct

Subtask #3

9.0 / 9.0

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

Subtask #4

9.0 / 9.0

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

Subtask #5

9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	47 ms	1400 KB	Output is correct

Subtask #6

9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	62 ms	1528 KB	Output is correct
2	Correct	109 ms	1400 KB	Output is correct
3	Correct	65 ms	1656 KB	Output is correct

Subtask #7

9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	99 ms	1916 KB	Output is correct
2	Correct	130 ms	2040 KB	Output is correct
3	Correct	105 ms	2552 KB	Output is correct

Subtask #8

9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	358 ms	4120 KB	Output is correct
2	Correct	418 ms	4088 KB	Output is correct
3	Correct	346 ms	4604 KB	Output is correct

Subtask #9

9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	653 ms	7992 KB	Output is correct
2	Correct	777 ms	6064 KB	Output is correct
3	Correct	643 ms	7996 KB	Output is correct

Subtask #10

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1093 ms	9592 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #11

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1093 ms	8824 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-