oj.uz

Submission #307609

# Submission time Handle Problem Language Result Execution time Memory
307609 2020-09-28T19:56:15 Z MarcoMeijer Potatoes and fertilizers (LMIO19_bulves) C++14
100 / 100
 231 ms 26988 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];

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];

    ll ans = 0;
    priority_queue<ll> pq;
    RE(i,n) {
        if(d[i] < 0) ans -= d[i], d[i] = 0;
        ans += d[i];
        pq.push(d[i]);
        pq.push(d[i]);
        pq.pop();
    }
    while(!pq.empty()) {
        ans -= min(pq.top(), d[n]); pq.pop();
    }

    OUTL(ans);
}

Subtask #1
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 16 ms 2560 KB Output is correct
5 Correct 36 ms 4724 KB Output is correct
6 Correct 110 ms 10352 KB Output is correct
7 Correct 167 ms 20332 KB Output is correct
8 Correct 196 ms 20204 KB Output is correct
9 Correct 165 ms 20200 KB Output is correct
10 Correct 135 ms 20328 KB Output is correct
11 Correct 140 ms 20184 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 16 ms 2560 KB Output is correct
5 Correct 36 ms 4724 KB Output is correct
6 Correct 110 ms 10352 KB Output is correct
7 Correct 167 ms 20332 KB Output is correct
8 Correct 196 ms 20204 KB Output is correct
9 Correct 165 ms 20200 KB Output is correct
10 Correct 135 ms 20328 KB Output is correct
11 Correct 140 ms 20184 KB Output is correct
12 Correct 51 ms 5492 KB Output is correct
13 Correct 129 ms 14060 KB Output is correct
14 Correct 169 ms 20208 KB Output is correct
15 Correct 203 ms 20204 KB Output is correct
16 Correct 207 ms 20316 KB Output is correct
17 Correct 141 ms 20200 KB Output is correct
18 Correct 2 ms 512 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 544 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 2 ms 512 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 544 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 2 ms 512 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 544 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 16 ms 2560 KB Output is correct
12 Correct 36 ms 4724 KB Output is correct
13 Correct 110 ms 10352 KB Output is correct
14 Correct 167 ms 20332 KB Output is correct
15 Correct 196 ms 20204 KB Output is correct
16 Correct 165 ms 20200 KB Output is correct
17 Correct 135 ms 20328 KB Output is correct
18 Correct 140 ms 20184 KB Output is correct
19 Correct 51 ms 5492 KB Output is correct
20 Correct 129 ms 14060 KB Output is correct
21 Correct 169 ms 20208 KB Output is correct
22 Correct 203 ms 20204 KB Output is correct
23 Correct 207 ms 20316 KB Output is correct
24 Correct 141 ms 20200 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 2 ms 512 KB Output is correct
29 Correct 2 ms 512 KB Output is correct
30 Correct 1 ms 512 KB Output is correct
31 Correct 1 ms 512 KB Output is correct
32 Correct 54 ms 7156 KB Output is correct
33 Correct 132 ms 18024 KB Output is correct
34 Correct 231 ms 26988 KB Output is correct
35 Correct 229 ms 24720 KB Output is correct
36 Correct 197 ms 25196 KB Output is correct
37 Correct 226 ms 26988 KB Output is correct
38 Correct 163 ms 23148 KB Output is correct
39 Correct 169 ms 21608 KB Output is correct
40 Correct 136 ms 22256 KB Output is correct
41 Correct 137 ms 22252 KB Output is correct
42 Correct 139 ms 22252 KB Output is correct
43 Correct 137 ms 22252 KB Output is correct
44 Correct 217 ms 26984 KB Output is correct
45 Correct 174 ms 22636 KB Output is correct
46 Correct 151 ms 19560 KB Output is correct
47 Correct 2 ms 512 KB Output is correct