# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
422671 | 2021-06-10T09:56:21 Z | Andyvanh1 | Holiday (IOI14_holiday) | C++14 | 44 ms | 6212 KB |
#include <bits/stdc++.h> #include "holiday.h" using namespace std; #define vt vector #define pb push_back #define all(x) (x).begin(),(x).end() #define rep(i,x) for(int (i) = 0; (i) < (x); (i)++ ) typedef long long ll; typedef long double ld; typedef vt<int> vi; typedef pair<int,int> pii; long long int findMaxAttraction(int n, int start, int d,int attraction[]){ ll Max = 0; if(d>2*n-1)d = 2*n-1; multiset<int> st; ll cur = 0; int a = d/2+1; int b = (d+1)/2; for(int i = 0; i < a; i++){ st.insert(attraction[i]); cur+=attraction[i]; } while(st.size()!=b){ cur-=*st.begin(); st.erase(st.begin()); } Max = cur; while(a < n&&b!=0){ b--; cur += attraction[a]; st.insert(attraction[a]); cur -= *st.begin(); st.erase(st.begin()); cur -= *st.begin(); st.erase(st.begin()); Max = max(Max, cur); a++; } return Max; }
Compilation message
# | 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 | 588 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 | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 44 ms | 5468 KB | Output is correct |
2 | Correct | 34 ms | 5476 KB | Output is correct |
3 | Correct | 36 ms | 5556 KB | Output is correct |
4 | Correct | 35 ms | 5452 KB | Output is correct |
5 | Correct | 41 ms | 3888 KB | Output is correct |
6 | Correct | 13 ms | 1996 KB | Output is correct |
7 | Correct | 21 ms | 2876 KB | Output is correct |
8 | Correct | 23 ms | 2724 KB | Output is correct |
9 | Correct | 7 ms | 1612 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 832 KB | Output is correct |
2 | Correct | 2 ms | 844 KB | Output is correct |
3 | Correct | 2 ms | 844 KB | Output is correct |
4 | Incorrect | 2 ms | 756 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 37 ms | 6212 KB | Output is correct |
2 | Correct | 37 ms | 6212 KB | Output is correct |
3 | Incorrect | 8 ms | 1308 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |