# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
588644 | peuch | Uplifting Excursion (BOI22_vault) | C++17 | 175 ms | 988 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>
using namespace std;
const int MAXN = 210;
const long long INF = 1e18;
const int HALF = MAXN * MAXN / 2;
int m;
long long l;
long long v[MAXN];
long long dp[2][MAXN * MAXN];
int main(){
scanf("%d %lld", &m, &l);
long long sum = 0;
long long cnt = 0;
for(int i = -m; i <= m; i++){
scanf("%lld", &v[i + m]);
sum += v[i + m] * i;
cnt += v[i + m];
}
if(l + HALF >= MAXN * MAXN || l + HALF < 0){
printf("impossible\n");
return 0;
}
for(int j = 0; j < MAXN * MAXN; j++)
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... |
# | 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... |