oj.uz

답안 #80425

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
80425 2018-10-20T16:25:16 Z igzi Homecoming (BOI18_homecoming) C++17
0 / 100
 90 ms 25628 KB 
#include <bits/stdc++.h>
#include "homecoming.h"
#define maxN 2000005

using namespace std;

int n,k,i,a[maxN],b[maxN],p[maxN],q[maxN];
long long dp[maxN],sb[maxN];

long long dp0(int n,int k,int a[],int b[]){
long long i,ans=0;
deque <long long> dq;
sb[n-1]=b[n-1];
for(i=n-2;i>=0;i--) sb[i]=sb[i+1]+b[i];
dp[n-1]=a[n-1]-b[n-1];
dq.push_back(n-1);
for(i=n-2;i>=0;i--){
    long long x=dq.front();
    dp[i]=a[i]+dp[x]-sb[i]+sb[x];
    ans=max(ans,dp[i]);
    if(dq.front()==i+k) dq.pop_front();
    while(dq.size() && dp[dq.back()]+sb[dq.back()]<=dp[i]+sb[i]){
        dq.pop_back();
    }
    dq.push_back(i);
}
return ans;
}

long long solve(int n,int k,int a[],int b[]){
long long ans=0,s;
int i,j;
for(j=0;j<k;j++){
s=0;
for(i=0;i<n;i++){
    p[i]=a[(i+j)%n];
    if(i>=k) q[i]=b[(i+j)%n];
    else q[i]=0;
    if(i<k) s+=b[(i+j)%n];
    }
    ans=max(ans,dp0(n,k,p,q)-s);
}
for(i=0;i<k;i++){
    b[n-k+i]+=b[i];
}
for(i=k;i<n;i++){
    p[i-k]=a[i];
    q[i-k]=b[i];
}
ans=max(ans,dp0(n-k,k,p,q));
return ans;
}

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 5 ms 552 KB Output is correct
3 Incorrect 2 ms 552 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 5 ms 552 KB Output is correct
3 Incorrect 2 ms 552 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 90 ms 25628 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 38.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 5 ms 552 KB Output is correct
3 Incorrect 2 ms 552 KB Output isn't correct
4 Halted 0 ms 0 KB -