Submission #969572

#	Time	Username	Problem	Language	Result	Execution time	Memory
969572		GrindMachine	Holiday (IOI14_holiday)	C++17	47 / 100	5024 ms	4264 KiB

holiday

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include"holiday.h"

long long int findMaxAttraction(int n, int start, int d, int a[]) {
    ll ans = 0;

    rep(l,start+1){
        priority_queue<ll,vector<ll>,greater<ll>> pq;
        ll sum = 0;
        for(int r = l; r < n; ++r){
            pq.push(a[r]);
            sum += a[r];
            if(r < start) conts;
            ll move = min(start-l+r-l,r-start+r-l);
            if(move > d) break;
            ll pick = d-move;
            while(sz(pq) > pick){
                sum -= pq.top();
                pq.pop();
            }

            amax(ans,sum);
        }
    }

    return ans;
}

• Subtask 1: 7 / 7
• Subtask 2: 23 / 23
• Subtask 3: 17 / 17
• Subtask 4: 0 / 53