oj.uz

Submission #158429

# Submission time Handle Problem Language Result Execution time Memory
158429 2019-10-17T03:08:43 Z luciocf Lightning Conductor (POI11_pio) C++14
63 / 100
 1000 ms 45900 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("Ofast")

using namespace std;
 
const int maxn = 5e5+5;
const int maxl = 21;
 
int n;
int a[maxn];
 
int tab[maxn][maxl];
int lg[maxn];
 
void build(void)
{

	for (int i = 1; i <= n; i++)
	{
		tab[i][0] = a[i];

		if (i > 1) lg[i] = lg[i/2]+1;
	}
 
	for (int j = 1; j < maxl; j++)
		for (int i = 1; i + (1<<j) <= n+1; i++)
			tab[i][j] = max(tab[i][j-1], tab[i+(1<<(j-1))][j-1]);
}
 
int mx(int l, int r)
{
	int j = lg[r-l+1];
 
	return max(tab[l][j], tab[r-(1<<j)+1][j]);
}
 
int main(void)
{
	scanf("%d", &n);
 
	for (int i = 1; i <= n; i++)
		scanf("%d", &a[i]);
 
	build();
 
	for (int i = 1; i <= n; i++)
	{
		int k = 0;
 
		for (int d = 1; (d-1)*(d-1) <= i; d++)
		{
			int l = max(1, i - d*d);
			int r = min(i-1, i - d*d + 2*d - 2);
 
			if (l > r) break;
 
			k = max(k, mx(l, r) + d);
		}
 
		for (int d = 1; (d-1)*(d-1) <= n-i; d++)
		{
			int l = max(i+1, d*d - 2*d + i + 2);
			int r = min(n, i + d*d);
 
			if (l > r) break;
 
			k = max(k, mx(l, r) + d);
		}
 
		printf("%d\n", max(0, k-a[i]));
	}
}

Compilation message

pio.cpp: In function 'int main()':
pio.cpp:40:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
pio.cpp:43: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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 3412 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 5368 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 285 ms 6620 KB Output is correct
2 Correct 292 ms 6520 KB Output is correct
3 Correct 292 ms 6692 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 545 ms 9724 KB Output is correct
2 Correct 532 ms 9784 KB Output is correct
3 Correct 544 ms 10124 KB Output is correct

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1073 ms 21492 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1068 ms 32672 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1067 ms 45900 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1080 ms 45692 KB Time limit exceeded
2 Halted 0 ms 0 KB -