# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42470 | sinhriv | 도장 모으기 (JOI14_stamps) | C++14 | 128 ms | 36652 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 N = 3030;
int n, T;
int f[N][N];
bool minimize(int &u, int v){
if(u > v){
u = v;
return 1;
}
return 0;
}
int main(){
scanf("%d%d", &n, &T);
memset(f, 60, sizeof f);
f[0][0] = T;
for(int i = 0; i < n; ++i){
int U, V, D, E;
cin >> U >> V >> D >> E;
for(int j = 0; j <= n; ++j){
if(f[i][j] == f[n + 2][1]) continue;
f[i + 1][j] = min(f[i + 1][j], f[i][j] + U + V + T * (j * 2 + 1));
f[i + 1][j + 1] = min(f[i + 1][j + 1], f[i][j] + V + D + T * (j * 2 + 1));
if(j > 0){
f[i + 1][j] = min(f[i + 1][j], f[i][j] + E + D + T * (j * 2 + 1));
f[i + 1][j - 1] = min(f[i + 1][j - 1], f[i][j] + U + E + T * (j * 2 + 1));
}
}
for(int j = 1; j <= n; ++j) f[i + 1][j] = min(f[i + 1][j - 1] + V + D, f[i + 1][j]);
}
cout << f[n][0];
return 0;
}
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... |