oj.uz

Submission #915324

# Submission time Handle Problem Language Result Execution time Memory
915324 2024-01-23T16:56:51 Z Trisanu_Das Holiday (IOI14_holiday) C++17
47 / 100
 5000 ms 3976 KB 
#include <bits/stdc++.h>
#include "holiday.h"
using namespace std;
 
long long findMaxAttraction(int n, int s, int d, int a[]) {
    long long ans = 0;
    for(int l = 0; l <= s; l++) {
        priority_queue<long long, vector<long long>, greater<long long> > pq;
        long long curr = 0;
        for (int r = l; r < n; r++) {
            curr += a[r];
            pq.push(a[r]);
            int sm = min(abs(r - s), abs(l - s)) + r - l;
            sm = d - sm;
            if(sm < 0) continue;
            while(pq.size() > sm) curr -= pq.top(), pq.pop();
            ans = max(ans, curr);
        }
    }
    return ans;
}

Compilation message

holiday.cpp: In function 'long long int findMaxAttraction(int, int, int, int*)':
holiday.cpp:16: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]
   16 |             while(pq.size() > sm) curr -= pq.top(), pq.pop();
      |                   ~~~~~~~~~~^~~~

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 820 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2004 KB Output is correct
2 Correct 9 ms 2004 KB Output is correct
3 Correct 9 ms 2000 KB Output is correct
4 Correct 16 ms 2000 KB Output is correct
5 Correct 12 ms 1496 KB Output is correct
6 Correct 3 ms 1240 KB Output is correct
7 Correct 6 ms 1496 KB Output is correct
8 Correct 9 ms 1496 KB Output is correct
9 Correct 2 ms 1116 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 884 KB Output is correct
2 Correct 20 ms 860 KB Output is correct
3 Correct 22 ms 856 KB Output is correct
4 Correct 109 ms 860 KB Output is correct
5 Correct 117 ms 856 KB Output is correct
6 Correct 2 ms 600 KB Output is correct
7 Correct 9 ms 600 KB Output is correct
8 Correct 13 ms 820 KB Output is correct
9 Correct 14 ms 604 KB Output is correct

Subtask #4
0 / 53.0

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