제출 #615074

#제출 시각아이디문제언어결과실행 시간메모리
615074cheissmart휴가 (IOI14_holiday)C++14
24 / 100
5088 ms2828 KiB
#include"holiday.h" #include <bits/stdc++.h> #define F first #define S second #define V vector #define PB push_back #define EB emplace_back #define MP make_pair #define SZ(v) int((v).size()) #define ALL(v) (v).begin(), (v).end() using namespace std; typedef long long ll; typedef pair<int, int> pi; typedef V<int> vi; const int INF = 1e9 + 7; ll go(int n, int s, int d, int a[]) { priority_queue<int, vi, greater<int>> pq; ll ans = 0, sum = 0; int cost = 0; for(int i = s; i < n; i++) { pq.push(a[i]); sum += a[i]; while(SZ(pq) + cost > d) { if(pq.empty()) return ans; sum -= pq.top(); pq.pop(); } ans = max(ans, sum); cost++; } return ans; } struct DS { vi a; int c, n; DS(vi _a, int _c) { a = _a; c = _c; n = SZ(a); } ll qry(int d) { priority_queue<int, vi, greater<int>> pq; ll ans = 0, sum = 0; int cost = 0; for(int i = 0; i < n; i++) { pq.push(a[i]); sum += a[i]; while(SZ(pq) + cost > d) { if(pq.empty()) return ans; sum -= pq.top(); pq.pop(); } ans = max(ans, sum); cost += c; } return ans; } }; ll solve(int n, int s, int d, int a[]) { // go left in the first step if(s == 0) return 0; vi pl, pr; for(int i = s - 1; i >= 0; i--) pl.PB(a[i]); for(int i = s; i < n; i++) pr.PB(a[i]); DS dsl = DS(pl, 2); DS dsr = DS(pr, 1); ll ans = 0; for(int i = 0; i + 2 <= d; i++) { ans = max(ans, dsl.qry(i) + dsr.qry(d - i - 2)); } return ans; } ll findMaxAttraction(int n, int s, int d, int a[]) { ll ans = go(n, s, d, a); ans = max(ans, solve(n, s, d, a)); reverse(a, a + n); s = n - s - 1; ans = max(ans, go(n, s, d, a)); ans = max(ans, solve(n, s, d, a)); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...