oj.uz

Submission #307600

# Submission time Handle Problem Language Result Execution time Memory
307600 2020-09-28T19:41:52 Z MarcoMeijer Potatoes and fertilizers (LMIO19_bulves) C++14
34 / 100
 148 ms 262148 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
//===================//
//  Added libraries  //
//===================//
 
//===================//
//end added libraries//
//===================//
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 5e5+2;

ll n;
ll a[MX], b[MX], dif[MX], d[MX];
vll dp[MX];

void program() {
    IN(n);
    RE(i,n) IN(a[i],b[i]);
    RE(i,n) dif[i] = a[i]-b[i];

    d[0]=0;
    RE(i,n) d[i+1] = d[i] + dif[i];
    RE(i,n) dp[i].assign(d[n]+1, INF);
    RE(i,n) RE(j,d[n]+1) {
        if(j) dp[i][j] = min(dp[i][j], dp[i][j-1]);
        dp[i][j] = min(dp[i][j], abs(d[i]-(ll)j) + (i ? dp[i-1][j] : 0ll));
    }
    OUTL(dp[n-1][d[n]]);
}

Subtask #1
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12160 KB Output is correct
2 Correct 8 ms 12288 KB Output is correct
3 Correct 9 ms 12288 KB Output is correct
4 Correct 19 ms 15616 KB Output is correct
5 Correct 30 ms 19064 KB Output is correct
6 Correct 76 ms 31352 KB Output is correct
7 Correct 137 ms 50168 KB Output is correct
8 Correct 122 ms 48248 KB Output is correct
9 Correct 120 ms 47608 KB Output is correct
10 Correct 105 ms 45432 KB Output is correct
11 Correct 104 ms 45432 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12160 KB Output is correct
2 Correct 8 ms 12288 KB Output is correct
3 Correct 9 ms 12288 KB Output is correct
4 Correct 19 ms 15616 KB Output is correct
5 Correct 30 ms 19064 KB Output is correct
6 Correct 76 ms 31352 KB Output is correct
7 Correct 137 ms 50168 KB Output is correct
8 Correct 122 ms 48248 KB Output is correct
9 Correct 120 ms 47608 KB Output is correct
10 Correct 105 ms 45432 KB Output is correct
11 Correct 104 ms 45432 KB Output is correct
12 Correct 50 ms 21624 KB Output is correct
13 Correct 86 ms 34976 KB Output is correct
14 Correct 147 ms 50296 KB Output is correct
15 Correct 148 ms 48248 KB Output is correct
16 Correct 124 ms 47608 KB Output is correct
17 Correct 105 ms 45304 KB Output is correct
18 Correct 9 ms 12288 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12160 KB Output is correct
2 Correct 8 ms 12288 KB Output is correct
3 Correct 8 ms 12288 KB Output is correct
4 Correct 29 ms 27768 KB Output is correct
5 Correct 83 ms 70904 KB Output is correct
6 Runtime error 139 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
7 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12160 KB Output is correct
2 Correct 8 ms 12288 KB Output is correct
3 Correct 9 ms 12288 KB Output is correct
4 Correct 8 ms 12288 KB Output is correct
5 Correct 29 ms 27768 KB Output is correct
6 Correct 83 ms 70904 KB Output is correct
7 Runtime error 139 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
8 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12160 KB Output is correct
2 Correct 8 ms 12288 KB Output is correct
3 Correct 9 ms 12288 KB Output is correct
4 Correct 8 ms 12288 KB Output is correct
5 Correct 29 ms 27768 KB Output is correct
6 Correct 83 ms 70904 KB Output is correct
7 Runtime error 139 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
8 Halted 0 ms 0 KB -