# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
915315 | 2024-01-23T16:33:40 Z | Trisanu_Das | Holiday (IOI14_holiday) | C++17 | 5000 ms | 5460 KB |
#include <bits/stdc++.h> #include "holiday.h" using namespace std; long long findMaxAttraction(int n , int start , int d , int* a){ #define int long long int ans = 0 ; for(int i=start;i<n;i++){ multiset<int> el ; for(int j=start;j<=i;j++) el.insert(a[j]) ; int sum = 0; int rest = d-(i-start) ; if(rest<0) break ; while(el.size()>rest) el.erase(el.begin()); for(int x: el) sum+=x ; ans=max(ans,sum) ; for(int j=start-1;j>-1;--j){ rest = d-(min(start-j,i-start)*2+max(start-j,i-start)); if(rest<0) break ; el.insert(a[j]) ; sum+=a[j] ; while(el.size()>rest){ sum-=*el.begin(); el.erase(el.begin()) ; } ans=max(ans,sum) ; } } return ans ; #undef int }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 604 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 | 604 KB | Output is correct |
5 | Correct | 1 ms | 604 KB | Output is correct |
6 | Correct | 0 ms | 604 KB | Output is correct |
7 | Correct | 1 ms | 604 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 5046 ms | 1852 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 860 KB | Output is correct |
2 | Correct | 1 ms | 860 KB | Output is correct |
3 | Correct | 1 ms | 860 KB | Output is correct |
4 | Correct | 305 ms | 880 KB | Output is correct |
5 | Correct | 104 ms | 856 KB | Output is correct |
6 | Correct | 24 ms | 604 KB | Output is correct |
7 | Correct | 11 ms | 604 KB | Output is correct |
8 | Correct | 12 ms | 832 KB | Output is correct |
9 | Correct | 11 ms | 600 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 24 ms | 5460 KB | Output is correct |
2 | Execution timed out | 5043 ms | 1428 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |