oj.uz

Submission #969572

# Submission time Handle Problem Language Result Execution time Memory
969572 2024-04-25T10:10:57 Z GrindMachine Holiday (IOI14_holiday) C++17
47 / 100
 5000 ms 4264 KB 
#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.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2076 KB Output is correct
2 Correct 7 ms 2172 KB Output is correct
3 Correct 7 ms 2004 KB Output is correct
4 Correct 7 ms 2156 KB Output is correct
5 Correct 12 ms 1492 KB Output is correct
6 Correct 3 ms 1488 KB Output is correct
7 Correct 6 ms 1496 KB Output is correct
8 Correct 8 ms 1632 KB Output is correct
9 Correct 2 ms 1240 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 860 KB Output is correct
2 Correct 14 ms 912 KB Output is correct
3 Correct 15 ms 840 KB Output is correct
4 Correct 104 ms 860 KB Output is correct
5 Correct 114 ms 856 KB Output is correct
6 Correct 3 ms 600 KB Output is correct
7 Correct 7 ms 800 KB Output is correct
8 Correct 11 ms 600 KB Output is correct
9 Correct 13 ms 600 KB Output is correct

Subtask #4
0 / 53.0

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