# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
587143 | 2022-07-01T11:36:32 Z | Jomnoi | Holiday (IOI14_holiday) | C++17 | 140 ms | 1712 KB |
#include <bits/stdc++.h> #include"holiday.h" using namespace std; const int MAX_N = 1e5 + 5; int N; int A[MAX_N]; long long int findMaxAttraction(int n, int start, int d, int attraction[]) { N = n; for(int i = 0; i < N; i++) { A[i] = attraction[i]; } long long ans = 0; if(N <= 3000) { for(int l = 0; l <= start; l++) { long long sum = 0; priority_queue <int, vector <int>, greater <int>> pq; for(int i = l; i < start; i++) { sum += A[i]; pq.push(A[i]); } for(int r = start; r < N; r++) { sum += A[r]; pq.push(A[r]); while(pq.size() > max(0, d - (r - l) - min(start - l, r - start))) { sum -= pq.top(); pq.pop(); } ans = max(ans, sum); } } } else if(start == 0) { long long sum = 0; priority_queue <int, vector <int>, greater <int>> pq; for(int i = 0; i < N; i++) { sum += A[i]; pq.push(A[i]); while(pq.size() > max(0, d - i)) { sum -= pq.top(); pq.pop(); } ans = max(ans, sum); } } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 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 |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 9 ms | 1616 KB | Output is correct |
2 | Correct | 9 ms | 1616 KB | Output is correct |
3 | Correct | 9 ms | 1616 KB | Output is correct |
4 | Correct | 10 ms | 1712 KB | Output is correct |
5 | Correct | 19 ms | 1328 KB | Output is correct |
6 | Correct | 4 ms | 980 KB | Output is correct |
7 | Correct | 6 ms | 1236 KB | Output is correct |
8 | Correct | 11 ms | 1324 KB | Output is correct |
9 | Correct | 3 ms | 980 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 69 ms | 724 KB | Output is correct |
2 | Correct | 20 ms | 724 KB | Output is correct |
3 | Correct | 21 ms | 724 KB | Output is correct |
4 | Correct | 120 ms | 704 KB | Output is correct |
5 | Correct | 140 ms | 704 KB | Output is correct |
6 | Correct | 3 ms | 596 KB | Output is correct |
7 | Correct | 10 ms | 708 KB | Output is correct |
8 | Correct | 14 ms | 596 KB | Output is correct |
9 | Correct | 17 ms | 596 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 10 ms | 980 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |