| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1356965 | Irate | Potatoes and fertilizers (LMIO19_bulves) | C++20 | 206 ms | 305844 KiB |
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int>a(n + 1), b(n + 1);
vector<long long>p(n + 1);
for(int i = 1;i <= n;++i){
cin >> a[i] >> b[i];
p[i] = p[i - 1] + (a[i] - b[i]);
}
vector<vector<long long>>dp(n + 1, vector<long long>(p[n] + 1));
for(int i = 1;i < n;++i){
for(int j = 0;j <= p[n];++j){
dp[i][j] = dp[i - 1][j] + abs(p[i] - j);
if(j - 1 >= 0){
dp[i][j] = min(dp[i][j], dp[i][j - 1]);
}
}
}
cout << dp[n - 1][p[n]] << '\n';
}
| # | 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... | ||||
