oj.uz

Submission #587057

# Submission time Handle Problem Language Result Execution time Memory
587057 2022-07-01T09:28:36 Z krit3379 Holiday (IOI14_holiday) C++17
47 / 100
 361 ms 1740 KB 
#include<bits/stdc++.h>
#include"holiday.h"
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define N 100005

long long sum,ans;
priority_queue<long long,vector<long long>,greater<long long>> q;

void add(long long x){
    q.push(x);
    sum+=x;
}

void upd(int k){
    while(!q.empty()&&(int)q.size()>k){
        sum-=q.top();
        q.pop();
    }
}

long long int findMaxAttraction(int n,int st,int d,int a[]){
    int i,j;
    if(n<=3000){
        for(i=0;i<=st;i++){
            sum=0;
            for(j=i;j<st;j++)add(a[j]);
            for(j=st;j<n;j++){
                add(a[j]);
                upd(d-j+i-min(st-i,j-st));
                ans=max(ans,sum);
            }
            while(!q.empty())q.pop();
        }
    }
    else if(st==0){
        sum=0;
        for(i=0;i<n;i++){
            add(a[i]);
            upd(d-i);
            ans=max(ans,sum);
        }
    }
    return ans;
}

Subtask #1
7.0 / 7.0

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

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1740 KB Output is correct
2 Correct 8 ms 1740 KB Output is correct
3 Correct 7 ms 1740 KB Output is correct
4 Correct 7 ms 1740 KB Output is correct
5 Correct 15 ms 1272 KB Output is correct
6 Correct 5 ms 980 KB Output is correct
7 Correct 7 ms 1276 KB Output is correct
8 Correct 13 ms 1320 KB Output is correct
9 Correct 2 ms 980 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 361 ms 732 KB Output is correct
2 Correct 74 ms 728 KB Output is correct
3 Correct 281 ms 724 KB Output is correct
4 Correct 157 ms 596 KB Output is correct
5 Correct 251 ms 696 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 11 ms 596 KB Output is correct
8 Correct 15 ms 696 KB Output is correct
9 Correct 20 ms 684 KB Output is correct

Subtask #4
0 / 53.0

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