oj.uz

Submission #308545

# Submission time Handle Problem Language Result Execution time Memory
308545 2020-10-01T14:27:15 Z shivensinha4 Lightning Conductor (POI11_pio) C++17
18 / 100
 53 ms 52088 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'

const int MXV = 1e6, INF = 1e9;
int rt[MXV+1];
vi pos[MXV+1];

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);
	int mx = 0;
	for_(i, 0, n) {
		cin >> h[i];
		mx = max(mx, h[i]);
		if (!pos[h[i]].size()) pos[h[i]] = {i, i};
		else pos[h[i]] = {min(pos[h[i]][0], i), max(pos[h[i]][1], i)};
	}
	
	int r = 0, sq = 0;
	for_(i, 0, mx+1) {
		rt[i] = r;
		if (i == sq) {
			r += 1;
			sq = r*r;
		}
	}
	
	vi poss;
	for (int i = mx; i >= max(mx-710, 0); i--) if (pos[i].size()) {
		 poss.push_back(i);
	}
	
	for_(i, 0, n) {
		int ans = 0;
		for (auto v: poss) ans = max({ans, v + rt[abs(pos[v][0] - i)], v + rt[abs(pos[v][1] - i)]});
		cout << max(ans-h[i], 0) << endl;
	}
	

	return 0;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
0 / 9.0

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

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 45 ms 48376 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 48 ms 48528 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 47 ms 48632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 47 ms 48888 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 46 ms 49912 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 53 ms 50808 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 47 ms 52088 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 50 ms 51968 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -