oj.uz

Submission #517012

# Submission time Handle Problem Language Result Execution time Memory
517012 2022-01-22T11:12:45 Z amukkalir Holiday (IOI14_holiday) C++17
23 / 100
 5000 ms 1824 KB 
#include <bits/stdc++.h>
#include "holiday.h"
using namespace std; 
typedef long long ll;

const int nax = 20; 
int n; 
int s, d; 

int cost (int l, int r) {
    return (r-l) + min(abs(s-l), abs(r-s)); 
}

bool ok (int mask) {
    int l=n, r=0; 
    for(int i=0; (1<<i)<=mask; i++) {
        if(mask & (1<<i)) {
            l = min(l, i); 
            r = max(r, i); 
        }
    }

    int travel = (r-l) + min(abs(s-l), abs(r-s)); 
    return travel + __builtin_popcount(mask) <= d; 
}

long long int findMaxAttraction(int N, int S, int D, int attraction[]) {
    n = N; 
    s = S; 
    d = D; 

    ll ans = 0; 

    priority_queue<ll, vector<ll>, greater<ll>> pq;

    ll sum = 0; 
    for(int l=s; l>=0; l--) {
        while(!pq.empty()) pq.pop(); 
        sum = 0; 

        for(int i=l;i<n;i++){
            int rem = d - cost(l,i);
            //if(d <= 0) break;
            sum += attraction[i];
            pq.push(attraction[i]); 
            while(pq.size() > rem) {
                sum -= pq.top(); 
                pq.pop(); 
            }

            //cout << l << ' ' << i << " " << rem << " " << sum << endl; 
            ans = max(ans, sum); 
        }
    }

    return ans; 
}

/*

*/

Compilation message

holiday.cpp: In function 'long long int findMaxAttraction(int, int, int, int*)':
holiday.cpp:46:29: warning: comparison of integer expressions of different signedness: 'std::priority_queue<long long int, std::vector<long long int>, std::greater<long long int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   46 |             while(pq.size() > rem) {
      |                   ~~~~~~~~~~^~~~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 588 KB Output is correct
2 Correct 1 ms 588 KB Output is correct
3 Correct 1 ms 680 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Incorrect 1 ms 588 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 8 ms 1732 KB Output is correct
2 Correct 9 ms 1732 KB Output is correct
3 Correct 8 ms 1824 KB Output is correct
4 Correct 13 ms 1732 KB Output is correct
5 Correct 14 ms 1224 KB Output is correct
6 Correct 4 ms 972 KB Output is correct
7 Correct 7 ms 1224 KB Output is correct
8 Correct 9 ms 1224 KB Output is correct
9 Correct 2 ms 972 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 396 ms 716 KB Output is correct
2 Correct 92 ms 748 KB Output is correct
3 Correct 279 ms 696 KB Output is correct
4 Correct 161 ms 684 KB Output is correct
5 Correct 262 ms 696 KB Output is correct
6 Correct 3 ms 584 KB Output is correct
7 Incorrect 17 ms 696 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

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