oj.uz

Submission #44198

# Submission time Handle Problem Language Result Execution time Memory
44198 2018-03-30T13:34:52 Z imaxblue Lightning Conductor (POI11_pio) C++17
81 / 100
 1000 ms 6828 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define lseg L, (L+R)/2, N*2+1
#define rseg (L+R)/2+1, R, N*2+2
#define ub upper_bound
#define lb lower_bound
#define pq priority_queue
#define MN 1000000007
#define fox(k, x) for (int k=0; k<x; ++k)
#define fox1(k, x) for (int k=1; k<=x; ++k)
#define foxr(k, x) for (int k=x-1; k>=0; --k)
#define fox1r(k, x) for (int k=x; k>0; --k)
#define ms multiset
#define flood(x) memset(x, 0x3f3f3f3f, sizeof x)
#define drain(x) memset(x, 0, sizeof x)
#define rng() ((rand() << 14)+rand())
#define scan(X) do{while((X=getchar())<'0'); for(X-='0'; '0'<=(_=getchar()); X=(X<<3)+(X<<1)+_-'0');}while(0)
char _;
#define pi 3.14159265358979323846

int n, a[500005], hi[500005], best;
int main(){
    scan(n);
    fox(l, n){
        scan(a[l]);
        best=max(best, a[l]);
        for(int l2=1, l3=l-1; l3>=0; l3-=l2, l2+=2){
            best=max(a[l3]+(l2>>1)+1, best);
        }
        hi[l]=best;
    }
    best=0;
    foxr(l, n){
        best=max(best, a[l]);
        for(int l2=1, l3=l+1; l3<n; l3+=l2, l2+=2){
            best=max(a[l3]+(l2>>1)+1, best);
        }
        hi[l]=max(hi[l], best);
    }
    fox(l, n){
        printf("%i\n", hi[l]-a[l]);
    }
    return 0;
}

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 488 KB Output is correct

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 980 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 1336 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 1336 KB Output is correct
2 Correct 44 ms 1336 KB Output is correct
3 Correct 47 ms 1608 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 1776 KB Output is correct
2 Correct 89 ms 1776 KB Output is correct
3 Correct 85 ms 2300 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 3448 KB Output is correct
2 Correct 316 ms 3448 KB Output is correct
3 Correct 304 ms 4012 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 622 ms 6752 KB Output is correct
2 Correct 620 ms 6752 KB Output is correct
3 Correct 624 ms 6828 KB Output is correct

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1086 ms 6828 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 1064 ms 6828 KB Time limit exceeded
2 Halted 0 ms 0 KB -