# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
927236 | math_rabbit_1028 | Uplifting Excursion (BOI22_vault) | C++14 | 398 ms | 160640 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>
#define fi first
#define se second
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
int M;
ll L, S, arr[1010], rem[1010], ans;
ll dp[660][101010];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> M >> L;
for (int i = 0; i <= 2*M; i++) cin >> arr[i];
for (int i = 0; i <= 2*M; i++) S += (i-M)*arr[i];
if (S < L) {
L = -L;
for (int i = 0; i <= M; i++) swap(arr[i], arr[2*M-i]);
}
S = 0;
for (int i = 0; i <= M; i++) {
S += (i-M)*arr[i];
ans += arr[i];
rem[2*M-i] = arr[i];
arr[i] = 0;
# | 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... |
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |