oj.uz

답안 #141617

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
141617 2019-08-08T14:34:28 Z abacaba Lightning Conductor (POI11_pio) C++14
45 / 100
 186 ms 9212 KB 
#include <bits/stdc++.h>
using namespace std;

#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define mp make_pair
#define f first
#define se second
#define pb push_back
#define ppb pop_back
#define ll long long
#define ull unsigned long long
#define cntbit(x) __builtin_popcount(x)
#define endl '\n'
#define uset unordered_set
#define umap unordered_map
#define pii pair<int, int>
#define ld long double
#define pll pair<long long, long long>

struct point {
	int i, l, r;
};

const int N = 5e5 + 15;
int n, a[N], dp[N];
deque <point> q;

inline double get(int j, int i) {
	return a[i] + sqrt(abs(i - j));
}

void process() {
	q.clear();
	for(int i = 1; i <= n; ++i) {
		if(!q.empty())
			++q.front().l;
		while(!q.empty() && q.front().r < q.front().l)
			q.pop_front();
		while(!q.empty() && get(q.back().l, q.back().i) < get(q.back().l, i))
			q.pop_front();
		if(q.empty())
			q.push_back({i, i, n});
		else if(get(n, i) > get(n, q.back().i)) {
			int l = q.back().l, r = q.back().r, res = 0;
			while(l <= r) {
				int mid = l + r >> 1;
				if(get(mid, i) > get(mid, q.back().i))
					res = mid, r = mid - 1;
				else
					l = mid + 1;
			}
			q.back().r = res - 1;
			q.push_back({i, res, n});
		}
		dp[i] = max(dp[i], (int)ceil(get(i, q.front().i)) - a[i]);
	}
}


int main() {
	scanf("%d", &n);
	for(int i = 1; i <= n; ++i)
		scanf("%d", &a[i]);
	process();
	reverse(a + 1, a + 1 + n);
	reverse(dp + 1, dp + 1 + n);
	process();
	for(int i = n; i; --i)
		printf("%d\n", dp[i]);
    return 0;
}

Compilation message

pio.cpp: In function 'void process()':
pio.cpp:47:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
     int mid = l + r >> 1;
               ~~^~~
pio.cpp: In function 'int main()':
pio.cpp:62:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
pio.cpp:64:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a[i]);
   ~~~~~^~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 372 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 380 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 888 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 1144 KB Output is correct

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 1144 KB Output is correct
2 Correct 18 ms 1244 KB Output is correct
3 Incorrect 22 ms 1756 KB Output isn't correct

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 1528 KB Output is correct
2 Correct 31 ms 2436 KB Output is correct
3 Incorrect 34 ms 2648 KB Output isn't correct

Subtask #8
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 3164 KB Output is correct
2 Correct 69 ms 5016 KB Output is correct
3 Incorrect 73 ms 4956 KB Output isn't correct

Subtask #9
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 133 ms 6520 KB Output is correct
2 Correct 108 ms 4600 KB Output is correct
3 Incorrect 117 ms 6648 KB Output isn't correct

Subtask #10
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 186 ms 9212 KB Output is correct
2 Correct 150 ms 6160 KB Output is correct
3 Incorrect 162 ms 9208 KB Output isn't correct

Subtask #11
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 168 ms 6896 KB Output is correct
2 Correct 155 ms 6264 KB Output is correct
3 Incorrect 161 ms 9208 KB Output isn't correct