oj.uz

Submission #950529

# Submission time Handle Problem Language Result Execution time Memory
950529 2024-03-20T11:43:54 Z hengliao Holiday (IOI14_holiday) C++17
23 / 100
 22 ms 5468 KB 
#include<bits/stdc++.h>
using namespace std;

#define F first
#define S second
#define pb push_back
#define vll vector<ll>
#define pll pair<ll, ll>
typedef long long ll;

ll findMaxAttraction(int n, int s, int d, int a[]){
    ll ans=0;
    if(s==0){
        multiset<ll> st;
        ll cur=0;
        
        ll siz=0;
        for(ll i=0;i<n;i++){
            if(d<=0) break;
            st.insert(a[i]);
            cur+=a[i];
            siz++;
            while(siz>d){
                cur-=*st.begin();
                st.erase(st.begin());
                siz--;
            }
            ans=max(ans, cur);
            d--;
        }
        
    }
    return ans;
}

/*int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    ll a[5]={10, 2, 20, 30, 1};

    cout<<findMaxAttraction(5, 0, 7, a);
    return 0;
}*/

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 600 KB Output isn't correct
2 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 22 ms 5444 KB Output is correct
3 Correct 22 ms 5428 KB Output is correct
4 Correct 22 ms 5428 KB Output is correct
5 Correct 22 ms 3676 KB Output is correct
6 Correct 7 ms 2164 KB Output is correct
7 Correct 13 ms 2908 KB Output is correct
8 Correct 18 ms 2908 KB Output is correct
9 Correct 5 ms 1624 KB Output is correct

Subtask #3
0 / 17.0

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

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 820 KB Output isn't correct
2 Halted 0 ms 0 KB -