# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
229366 | osaaateiasavtnl | 휴가 (IOI14_holiday) | C++14 | 5065 ms | 3052 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#include"holiday.h"
using namespace std;
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define f first
#define s second
#define Time (double)clock()/CLOCKS_PER_SEC
long long int findMaxAttraction(int n, int start, int d, int a[]) {
ll ans = 0;
for (int l = 0; l <= start; ++l) {
for (int r = start; r < n; ++r) {
int go = (start - l) + (r - start) + min(start - l, r - start);
if (go <= d) {
int k = d - go;
vector <int> v;
for (int i = l; i <= r; ++i)
v.app(a[i]);
sort(all(v));
reverse(all(v));
ll nn = 0;
for (int i = 0; i < k && i < v.size(); ++i)
nn += v[i];
ans = max(ans, nn);
}
}
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |