Submission #1143440

#TimeUsernameProblemLanguageResultExecution timeMemory
1143440simplemind_31Holiday (IOI14_holiday)C++20
23 / 100
33 ms5448 KiB
#include"holiday.h" #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> using namespace __gnu_pbds; using namespace std; typedef pair<int,int> pii; typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> intset; typedef long long ll; ll findMaxAttraction(int n,int start,int d,int attraction[]) { intset res; int sum=0; int maxi=0; for(int i=0;i<(int)((d+1)/2) && i<n;i++){ res.insert(attraction[i]); sum+=attraction[i]; } maxi=sum; for(int i=(d+1)/2;i<n;i++){ sum+=attraction[i]; res.insert(attraction[i]); while(res.size()>0 && res.size()>d-i){ sum-=*res.begin(); res.erase(res.begin()); } maxi=max(maxi,sum); } return maxi; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...