# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
67286 | 2018-08-13T19:22:20 Z | theknife2001 | Holiday (IOI14_holiday) | C++17 | 20 ms | 2552 KB |
#include"holiday.h" #include <bits/stdc++.h> using namespace std; priority_queue < int , vector < int > , greater < int > > pq; long long int findMaxAttraction(int n, int start, int d, int a[]) { if(!d) return 0; d--; int x=d/2; d-=x*2; long long ans=0; for(int i=0;i<=x&&i<n;i++) { pq.push(a[i]); ans+=a[i]; } long long ret=ans; for(int i=x+1;i<n&&pq.size();i++) { if(!d) { ans-=pq.top(); pq.pop(); } else d--; if(pq.size()&&a[i]>pq.top()) { ans+=a[i]-pq.top(); pq.pop(); ret=max(ans,ret); pq.push(a[i]); } } return ret; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 464 KB | Output is correct |
3 | Correct | 2 ms | 464 KB | Output is correct |
4 | Correct | 2 ms | 604 KB | Output is correct |
5 | Incorrect | 2 ms | 604 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 1572 KB | Output is correct |
2 | Correct | 12 ms | 1572 KB | Output is correct |
3 | Correct | 13 ms | 1596 KB | Output is correct |
4 | Correct | 11 ms | 1640 KB | Output is correct |
5 | Correct | 20 ms | 1640 KB | Output is correct |
6 | Correct | 7 ms | 1640 KB | Output is correct |
7 | Correct | 11 ms | 1640 KB | Output is correct |
8 | Correct | 13 ms | 1640 KB | Output is correct |
9 | Correct | 5 ms | 1640 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 1640 KB | Output is correct |
2 | Correct | 2 ms | 1640 KB | Output is correct |
3 | Correct | 3 ms | 1640 KB | Output is correct |
4 | Incorrect | 3 ms | 1640 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 19 ms | 1656 KB | Output is correct |
2 | Correct | 19 ms | 2552 KB | Output is correct |
3 | Incorrect | 11 ms | 2552 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |