제출 #1228023

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1228023		Muhammad_Aneeq	Homecoming (BOI18_homecoming)	C++20	0 / 100	24 ms	20288 KiB

homecoming

#include <iostream>
#include <deque>
#include <vector>
#include <set>
using namespace std;
int const MAXN=2e6+10;
long long dp[MAXN]={};
long long pre[MAXN]={};
long long sol(deque<int>a,deque<int>b,int k)
{
  int n=a.size();
  for (int i=0;i<n;i++)
    pre[i+1]=pre[i]+b[i];
  for (int i=0;i<n;i++)
    dp[i]=-1e15;
  dp[0]=a[0]-pre[k];
  multiset<long long>s;
  s.insert(dp[0]+pre[k]);
  long long mx=dp[0];
  for (int i=1;i<n;i++)
  {
    if (i>=k)
      s.erase(s.find(dp[i-k]+pre[i]));
    long long sm=pre[min(n,i+k)]-pre[i];
    dp[i]=mx;
    if (s.size())
      dp[i]=max(dp[i],*rbegin(s)-pre[i+1]);
    dp[i]=dp[i]+a[i]-sm;
    mx=max(mx,dp[i]);
    s.insert(dp[i]+sm);
  }
  return mx;
}
long long solve(int N, int K, int *A, int *B)
{
  long long ans=0;
  int n=N;
  deque<int>a,b;
  for (int i=0;i<n;i++)
    a.push_back(A[i]),b.push_back(B[i]);
  for (int i=0;i<n;i++)
  {
    ans=max(ans,sol(a,b,K));
    a.push_back(a.front());
    a.pop_front();
    b.push_back(b.front());
    b.pop_front();
  }
  return ans;
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 18
• Subtask 3: 0 / 31
• Subtask 4: 0 / 38