oj.uz

Submission #940226

# Submission time Handle Problem Language Result Execution time Memory
940226 2024-03-07T06:46:53 Z 12345678 Potatoes and fertilizers (LMIO19_bulves) C++17
20 / 100
 46 ms 1112 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=3e3+5, kx=3e4+5;

ll n, a[nx], b[nx], ans, d[nx], dp[2][kx];

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    cin>>n;
    for (int i=1; i<=n; i++) cin>>a[i]>>b[i], d[i]=d[i-1]+a[i]-b[i];
    for (int i=1; i<=n; i++)
    {
        int c=i%2, p=1-c;
        dp[c][0]=dp[p][0]+abs(d[i]);
        for (int j=1; j<=d[n]; j++) dp[c][j]=min(dp[c][j-1], dp[p][j]+abs(j-d[i])); //printf("%d %d %d\n", i, j, dp[c][j]);
    }
    cout<<dp[n%2][d[n]];
}

Subtask #1
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Incorrect 1 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 3 ms 536 KB Output is correct
5 Correct 9 ms 604 KB Output is correct
6 Correct 46 ms 604 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 5 ms 348 KB Output is correct
9 Correct 5 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 3 ms 536 KB Output is correct
6 Correct 9 ms 604 KB Output is correct
7 Correct 46 ms 604 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 5 ms 348 KB Output is correct
10 Correct 5 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Runtime error 1 ms 1112 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 3 ms 536 KB Output is correct
6 Correct 9 ms 604 KB Output is correct
7 Correct 46 ms 604 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 5 ms 348 KB Output is correct
10 Correct 5 ms 348 KB Output is correct
11 Incorrect 1 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -