Submission #1026297

#	Time	Username	Problem	Language	Result	Execution time	Memory
1026297		Malix	모임들 (IOI18_meetings)	C++14	36 / 100	382 ms	196492 KiB

meetings

#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;
typedef vector<ll> li;
typedef vector<li> lii;

#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))

ll INF=1e18+10;
int inf=1e9+10;
ll M=1e9+7;

pii arr;

pi build(vi &st,vi &H,int x,int l,int r){
  if(l==r){
    if(H[l]==1)st[x]=1;
    else st[x]=0;
    arr[x]={st[x],st[x]};
    return {st[x],st[x]};
  }
  int m=(l+r)/2;
  pi a=build(st,H,2*x,l,m);
  pi b=build(st,H,2*x+1,m+1,r);
  st[x]=max(a.S+b.F,max(st[2*x],st[2*x+1]));
  if(a.F==m-l+1&&b.S==r-m)arr[x]={a.F+b.S,a.F+b.S};
  else if(a.F==m-l+1)arr[x]={a.F+b.F,b.S};
  else if(b.S==r-m)arr[x]={a.F,a.S+b.S};
  else arr[x]={a.F,b.S};
  return arr[x];
}

int solve(vi &st,vi &H,int x,int l,int r,int a,int b){
  if(a>b)return 0;
  if(l==a&&b==r)return st[x];
  int m=(l+r)/2;
  int ans=max(solve(st,H,2*x,l,m,a,min(b,m)),solve(st,H,2*x+1,m+1,r,max(a,m+1),b));
  if(a<=m&&b>m)ans=max(ans,min(m-a+1,arr[2*x].S)+min(b-m,arr[2*x+1].F));
  return ans;
}

std::vector<long long> minimum_costs(std::vector<int> H, std::vector<int> L,
                                     std::vector<int> R) {
  int n=H.size();
  int q=L.size();
  li ans(q,INF);
if(n<=5000&&q<=5000){
  lii a(n,li(n,0));
  REP(i,0,n){
    int k=H[i];
    REP(j,i,n){
      k=max(k,H[j]);
      a[i][j]=k;
    }
    k=H[i];
    for(int j=i;j>=0;j--){
      k=max(k,H[j]);
      a[i][j]=k;
    }
  }
  REP(i,0,n){
    REP(j,i+1,n)a[i][j]+=a[i][j-1];
    for(int j=i-1;j>=0;j--)a[i][j]+=a[i][j+1];
  }
  //REP(i,0,n)cerr<<a[3][i]<<" ";
  REP(i,0,q)REP(j,L[i],R[i]+1)ans[i]=min(ans[i],a[j][L[i]]+a[j][R[i]]-a[j][j]);
  return ans;
}
  vi st(4*n,0);
  arr.resize(4*n,{0,0});
  build(st,H,1,0,n-1);
  REP(i,0,q){
    int k=solve(st,H,1,0,n-1,L[i],R[i]);
    ans[i]=(R[i]-L[i]+1)*2-k;
  }
  //int pos=0;
  //for(auto u:st)cerr<<pos++<<"-"<<u<<" ";cerr<<"\n";
  return ans;
}

• Subtask 1: 4 / 4
• Subtask 2: 15 / 15
• Subtask 3: 17 / 17
• Subtask 4: 0 / 24
• Subtask 5: 0 / 40