oj.uz

답안 #44203

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
44203 2018-03-30T13:52:00 Z imaxblue Lightning Conductor (POI11_pio) C++17
81 / 100
 1000 ms 9284 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_unlocked())<'0'); for(X-='0'; '0'<=(_=getchar_unlocked()); X=(X<<3)+(X<<1)+_-'0');}while(0)
char _;
#define pi 3.14159265358979323846

int n, a[500005], hi[500005], best, l2, l3, l4;
int main(){
    scan(n);
    fox(l, n){
        scan(a[l]);
        //a[l]=l;
        best=max(best, a[l]);
        for(l2=1, l3=l-1, l4=1; l3>=0; l3-=l2, l2+=2, l4++){
            best=max(a[l3]+l4, best);
        }
        hi[l]=best;
    }
    best=0;
    foxr(l, n){
        best=max(best, a[l]);
        for(l2=1, l3=l+1, l4=1; l3<n; l3+=l2, l2+=2, l4++){
            best=max(a[l3]+l4, 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

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

Subtask #2
9.0 / 9.0

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

Subtask #3
9.0 / 9.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
9.0 / 9.0

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

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 1472 KB Output is correct
2 Correct 43 ms 1472 KB Output is correct
3 Correct 67 ms 1504 KB Output is correct

Subtask #7
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 114 ms 1820 KB Output is correct
2 Correct 81 ms 1820 KB Output is correct
3 Correct 112 ms 2284 KB Output is correct

Subtask #8
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 356 ms 3364 KB Output is correct
2 Correct 293 ms 3364 KB Output is correct
3 Correct 289 ms 4000 KB Output is correct

Subtask #9
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 561 ms 6764 KB Output is correct
2 Correct 529 ms 6764 KB Output is correct
3 Correct 532 ms 6808 KB Output is correct

Subtask #10
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 932 ms 9284 KB Output is correct
2 Execution timed out 1059 ms 9284 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1014 ms 9284 KB Time limit exceeded
2 Halted 0 ms 0 KB -