oj.uz

Submission #932813

# Submission time Handle Problem Language Result Execution time Memory
932813 2024-02-24T09:33:36 Z vjudge1 Holiday (IOI14_holiday) C++17
23 / 100
 3526 ms 7496 KB 
#include<bits/stdc++.h>

#pragma GCC optimize("Ofast")

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=1e5+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<ll> st;
    ll ans=0;
    ll cur=0;
    for(ll 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++){
    ans=max(ans,dpR[i]+dp1L[d-i-1]);
    ans=max(ans,dp1R[i]+dpL[d-i-1]);
  }
  return ans;
}

Subtask #1
0 / 7.0

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

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 5468 KB Output is correct
2 Correct 20 ms 5308 KB Output is correct
3 Correct 20 ms 5496 KB Output is correct
4 Correct 19 ms 5468 KB Output is correct
5 Correct 22 ms 3676 KB Output is correct
6 Correct 7 ms 2136 KB Output is correct
7 Correct 15 ms 2752 KB Output is correct
8 Correct 17 ms 2708 KB Output is correct
9 Correct 5 ms 1628 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3526 ms 3332 KB Output is correct
2 Correct 2195 ms 2984 KB Output is correct
3 Correct 1906 ms 2972 KB Output is correct
4 Correct 1317 ms 3184 KB Output is correct
5 Correct 1129 ms 3164 KB Output is correct
6 Correct 83 ms 2896 KB Output is correct
7 Correct 40 ms 2648 KB Output is correct
8 Incorrect 41 ms 2896 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Runtime error 19 ms 7496 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -