oj.uz

Submission #308603

# Submission time Handle Problem Language Result Execution time Memory
308603 2020-10-01T14:58:16 Z shivensinha4 Lightning Conductor (POI11_pio) C++17
0 / 100
 110 ms 3348 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 = 1e7, INF = 1e9;
//int rt[MXV+1];
int pos[MXV+2];

//int grt(int p) {
	//for_(i, 0, p+1) {
		//if (i*i >= p) {
			//cout << p << " -> " << i << endl;
			//return i;
		//}
	//}
	//return -1;
//}

int main() {
	#ifdef shiven
	freopen("test.in", "r", stdin);
	#endif
	
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	
	int n; cin >> n;
	//for_(i, 0, MXV+1) {
		//pos[i][0] = INF;
		//pos[i][1] = -1;
	//}
	vi h(n);
	int mx = 0;
	for_(i, 0, n) {
		cin >> h[i];
		mx = max(mx, h[i]);
		//assert(h[i] <= MXV);
		//pos[h[i]] = i;
		//if (!pos[h[i]].size()) pos[h[i]] = {i, i};
		//pos[h[i]][0] = min(pos[h[i]][0], i);
		//pos[h[i]][1] = 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 = h[i];
		//for (int v = mx; v >= max(mx-710, 0); v--) if (pos[v][0] != INF) ans = max({ans, v + rt[abs(pos[v][0] - i)], v + rt[abs(pos[v][1] - i)]});
		//for (int v = mx; v >= max(mx-710, 0); v--) if (pos[v][0] != INF) ans = max({ans, v + grt(abs(pos[v][0] - i)), v + grt(abs(pos[v][1] - i))});
		//for (int v = mx; v >= max(mx-710, 0); v--) if (pos[v][0] != INF) ans = max(ans, 10);
		cout << ans-h[i] << endl;
	}
	

	return 0;
}

Subtask #1
0 / 9.0

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

Subtask #2
0 / 9.0

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

Subtask #3
0 / 9.0

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

Subtask #4
0 / 9.0

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

Subtask #5
0 / 9.0

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

Subtask #6
0 / 9.0

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

Subtask #7
0 / 9.0

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

Subtask #8
0 / 9.0

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

Subtask #9
0 / 9.0

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

Subtask #10
0 / 9.0

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

Subtask #11
0 / 10.0

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