oj.uz

Submission #932839

# Submission time Handle Problem Language Result Execution time Memory
932839 2024-02-24T10:04:35 Z vjudge1 Holiday (IOI14_holiday) C++17
40 / 100
 5000 ms 11244 KB 
#include<bits/stdc++.h>

#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")

using namespace std;

#define F first
#define S second
#define ll long long
// #define int ll
#define pb push_back
#define sz(s) (int)s.size()
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define mem(a,i) memset(a,i,sizeof(a))
#define in insert
#define lb lower_bound
#define ub upper_bound
#define y1 yy
#define ppb pop_back
#define ull unsigned ll

const int MAX=5e5+55;
const int inf=1e9;
const int N=2e5;
const int C=331;
const int C1=431;
const int mod=1e9+9;
const int mod1=1e9+9;
#include "holiday.h"

ll dpL[MAX],dpR[MAX];
ll dp1L[MAX],dp1R[MAX];

ll findMaxAttraction(int n, int start, int d, int attraction[]) {
  if(start==0){
      multiset<int> st;
  int ans=0;
  int cur=0;
  for(int i=0;i<n;i++){
    st.in(attraction[i]);
    cur+=attraction[i];
    while(!st.empty()&&sz(st)>d-i){
      cur-=*st.begin();
      st.erase(st.begin());
    }
    ans=max(ans,cur);
  }
  return ans;
  }
  for(ll ds=0;ds<=d;ds++){
    multiset<ll> st;
    ll ans=0;
    ll cur=0;
    for(ll i=start;i<n;i++){
      st.in(attraction[i]);
      cur+=attraction[i];
      while(!st.empty()&&sz(st)>ds-(i-start)){
        cur-=*st.begin();
        st.erase(st.begin());
      }
      ans=max(ans,cur);
    }
    dpR[ds]=ans;
    st.clear();
    ans=cur=0;
    for(ll i=start;i<n;i++){
      st.in(attraction[i]);
      cur+=attraction[i];
      while(!st.empty()&&sz(st)>ds-2*(i-start)){
        cur-=*st.begin();
        st.erase(st.begin());
      }
      ans=max(ans,cur);
    }
    dp1R[ds]=ans;
  }
  for(ll ds=0;ds<=d;ds++){
    multiset<ll> st;
    ll ans=0;
    ll cur=0;
    for(ll i=start-1;i>=0;i--){
      st.in(attraction[i]);
      cur+=attraction[i];
      while(!st.empty()&&sz(st)>ds-(start-i-1)){
        cur-=*st.begin();
        st.erase(st.begin());
      }
      ans=max(ans,cur);
    }
    dpL[ds]=ans;
    st.clear();
    ans=cur=0;
    for(ll i=start-1;i>=0;i--){
      st.in(attraction[i]);
      cur+=attraction[i];
      while(!st.empty()&&sz(st)>ds-2*(start-i-1)){
        cur-=*st.begin();
        st.erase(st.begin());
      }
      ans=max(ans,cur);
    }
    dp1L[ds]=ans;
  }
  // cout<<dpR[4]<<"\n";
  ll ans=0;
  for(ll i=0;i<=d;i++){
    // cout<<i<<" "<<dpR[i]<<" "<<dp1L[d-i-1]<<"\n";
    // cout<<i<<" "<<dp1R[i]<<" "<<dpL[d-i-1]<<"\n";
    ans=max(ans,dpR[i]+dp1L[d-i-2]);
    ans=max(ans,dp1R[i]+dpL[d-i-1]);
  }
  return ans;
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6744 KB Output is correct
2 Incorrect 0 ms 604 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 5516 KB Output is correct
2 Correct 22 ms 5700 KB Output is correct
3 Correct 22 ms 5456 KB Output is correct
4 Correct 22 ms 5456 KB Output is correct
5 Correct 24 ms 3932 KB Output is correct
6 Correct 7 ms 2140 KB Output is correct
7 Correct 13 ms 2948 KB Output is correct
8 Correct 16 ms 2908 KB Output is correct
9 Correct 5 ms 1608 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3567 ms 7584 KB Output is correct
2 Correct 3210 ms 7064 KB Output is correct
3 Correct 2879 ms 7348 KB Output is correct
4 Correct 1452 ms 7088 KB Output is correct
5 Correct 1239 ms 7232 KB Output is correct
6 Correct 106 ms 6992 KB Output is correct
7 Correct 55 ms 6740 KB Output is correct
8 Correct 56 ms 6748 KB Output is correct
9 Correct 59 ms 6736 KB Output is correct

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5012 ms 11244 KB Time limit exceeded
2 Halted 0 ms 0 KB -