oj.uz

답안 #307601

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
307601 2020-09-28T19:43:37 Z MarcoMeijer Potatoes and fertilizers (LMIO19_bulves) C++14
54 / 100
 232 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 prevDP, curDP;

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];
    curDP.assign(d[n]+1, 0);
    RE(i,n) {
        prevDP = curDP;
        curDP.assign(d[n]+1,INF);
        RE(j,d[n]+1) {
            if(j) curDP[j] = min(curDP[j], curDP[j-1]);
            curDP[j] = min(curDP[j], abs(d[i]-(ll)j) + (i ? prevDP[j] : 0ll));
        }
    }
    OUTL(curDP[d[n]]);
}

Subtask #1
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 9 ms 1920 KB Output is correct
5 Correct 17 ms 3456 KB Output is correct
6 Correct 51 ms 8184 KB Output is correct
7 Correct 101 ms 15992 KB Output is correct
8 Correct 90 ms 15992 KB Output is correct
9 Correct 90 ms 15992 KB Output is correct
10 Correct 72 ms 15992 KB Output is correct
11 Correct 78 ms 16120 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 9 ms 1920 KB Output is correct
5 Correct 17 ms 3456 KB Output is correct
6 Correct 51 ms 8184 KB Output is correct
7 Correct 101 ms 15992 KB Output is correct
8 Correct 90 ms 15992 KB Output is correct
9 Correct 90 ms 15992 KB Output is correct
10 Correct 72 ms 15992 KB Output is correct
11 Correct 78 ms 16120 KB Output is correct
12 Correct 26 ms 4224 KB Output is correct
13 Correct 66 ms 9720 KB Output is correct
14 Correct 108 ms 15992 KB Output is correct
15 Correct 104 ms 15960 KB Output is correct
16 Correct 92 ms 15992 KB Output is correct
17 Correct 82 ms 15992 KB Output is correct
18 Correct 1 ms 512 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 13 ms 384 KB Output is correct
5 Correct 45 ms 548 KB Output is correct
6 Correct 232 ms 640 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 19 ms 512 KB Output is correct
9 Correct 19 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 13 ms 384 KB Output is correct
6 Correct 45 ms 548 KB Output is correct
7 Correct 232 ms 640 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 19 ms 512 KB Output is correct
10 Correct 19 ms 512 KB Output is correct
11 Runtime error 142 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 13 ms 384 KB Output is correct
6 Correct 45 ms 548 KB Output is correct
7 Correct 232 ms 640 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 19 ms 512 KB Output is correct
10 Correct 19 ms 512 KB Output is correct
11 Correct 9 ms 1920 KB Output is correct
12 Correct 17 ms 3456 KB Output is correct
13 Correct 51 ms 8184 KB Output is correct
14 Correct 101 ms 15992 KB Output is correct
15 Correct 90 ms 15992 KB Output is correct
16 Correct 90 ms 15992 KB Output is correct
17 Correct 72 ms 15992 KB Output is correct
18 Correct 78 ms 16120 KB Output is correct
19 Correct 26 ms 4224 KB Output is correct
20 Correct 66 ms 9720 KB Output is correct
21 Correct 108 ms 15992 KB Output is correct
22 Correct 104 ms 15960 KB Output is correct
23 Correct 92 ms 15992 KB Output is correct
24 Correct 82 ms 15992 KB Output is correct
25 Runtime error 142 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
26 Halted 0 ms 0 KB -