oj.uz

Submission #308847

# Submission time Handle Problem Language Result Execution time Memory
308847 2020-10-02T04:59:33 Z shivensinha4 Lightning Conductor (POI11_pio) C++17
100 / 100
 122 ms 11384 KB 
#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 = -1;
	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 = -1;
	for (int i = n-1; i >= 0; i--) if (h[i] > mx) {
		mx = h[i];
		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 384 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 416 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 8 ms 1024 KB Output is correct

Subtask #5
9.0 / 9.0

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

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 1408 KB Output is correct
2 Correct 11 ms 1408 KB Output is correct
3 Correct 15 ms 1664 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 1920 KB Output is correct
2 Correct 21 ms 1920 KB Output is correct
3 Correct 22 ms 2560 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 4088 KB Output is correct
2 Correct 47 ms 3964 KB Output is correct
3 Correct 52 ms 4600 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 7928 KB Output is correct
2 Correct 74 ms 5880 KB Output is correct
3 Correct 78 ms 8056 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 11256 KB Output is correct
2 Correct 104 ms 8184 KB Output is correct
3 Correct 109 ms 11384 KB Output is correct

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 8824 KB Output is correct
2 Correct 104 ms 8184 KB Output is correct
3 Correct 107 ms 11256 KB Output is correct