oj.uz

Submission #29545

# Submission time Handle Problem Language Result Execution time Memory
29545 2017-07-20T05:52:24 Z 김동현(#1239) Lightning Conductor (POI11_pio) C++14
27 / 100
 219 ms 13736 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;

int n;
ll h[500010], la[500010], ra[500010];

struct CHT{
	struct Cnv{ ll a, b; };
	ld inv(Cnv p, ll y){
		ll s = 1, e = n;
		while(s <= e){
			ll m = (s + e) / 2;
			if(m * m >= y - p.b) e = m - 1;
			else s = m + 1;
		}
		return s + p.a;
	}
	deque<Cnv> dq;
	void ini(){ dq.clear(); }
	void upd(ll a, ll b){
		Cnv cur = {a, b};
		if(!dq.empty() && dq.back().a >= cur.a) return;
		dq.push_back(cur);
	}
	ll get(ll y){
		if(dq.empty()) return 0;
		while(dq.size() > 1 && inv(dq[0], y) <= inv(dq[1], y)) dq.pop_front();
		return inv(dq[0], y);
	}
} C;

void f(ll *a){
	C.ini();
	for(int i = 1; i <= n; i++){
		a[i] = max(h[i], C.get(i));
		C.upd(h[i], i);
	}
}

int main(){
	scanf("%d", &n);
	for(int i = 1; i <= n; i++) scanf("%lld", h + i);
	f(la);
	reverse(h + 1, h + n + 1);
	f(ra);
	reverse(h + 1, h + n + 1);
	for(int i = 1; i <= n; i++) printf("%lld\n", max(la[i], ra[n + 1 - i]) - h[i]);
}

Compilation message

pio.cpp: In function 'int main()':
pio.cpp:43:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
pio.cpp:44:50: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 1; i <= n; i++) scanf("%lld", h + i);
                                                  ^

Subtask #1
0 / 9.0

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

Subtask #2
9.0 / 9.0

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

Subtask #3
0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 13736 KB Output is correct
2 Correct 16 ms 13736 KB Output is correct
3 Incorrect 23 ms 13736 KB Output isn't correct

Subtask #7
0 / 9.0

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

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 13736 KB Output is correct
2 Correct 93 ms 13736 KB Output is correct
3 Incorrect 136 ms 13736 KB Output isn't correct

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 183 ms 13736 KB Output is correct
2 Correct 119 ms 13736 KB Output is correct
3 Incorrect 199 ms 13736 KB Output isn't correct

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 183 ms 13736 KB Output is correct
2 Correct 176 ms 13736 KB Output is correct
3 Incorrect 219 ms 13736 KB Output isn't correct

Subtask #11
0 / 10.0

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