oj.uz

Submission #783604

# Submission time Handle Problem Language Result Execution time Memory
783604 2023-07-15T05:39:13 Z vjudge1 Potatoes and fertilizers (LMIO19_bulves) C++17
30 / 100
 102 ms 11100 KB 
#include<bits/stdc++.h>
using namespace std; 


int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
 
	int n;
    long long ans=0, pref=0, a, b;
    priority_queue <int> pq;
    cin >> n;
	
	for(int i=0; i<n; i++){
        pq.push(0);
    }
	for (int i=0; i<n-1; i++){
        cin >> a >> b;
        pref+=(a-b);
        pq.push(pref);
        if(pref<pq.top()){
            ans+=pq.top()-pref;
            pq.pop();
            pq.push(pref);
        }
	}
	cin >> a >> b;
	pref+=(a-b);
	while(pq.size() && pref<pq.top()){
        ans+=pq.top()-pref;
        pq.pop();
	}
	cout << ans << endl;
}

Subtask #1
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 11 ms 1112 KB Output is correct
5 Correct 24 ms 1796 KB Output is correct
6 Correct 82 ms 5780 KB Output is correct
7 Correct 102 ms 11100 KB Output is correct
8 Incorrect 91 ms 9260 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 11 ms 1112 KB Output is correct
5 Correct 24 ms 1796 KB Output is correct
6 Correct 82 ms 5780 KB Output is correct
7 Correct 102 ms 11100 KB Output is correct
8 Incorrect 91 ms 9260 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 324 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 396 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 332 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 396 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 336 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 396 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 11 ms 1112 KB Output is correct
12 Correct 24 ms 1796 KB Output is correct
13 Correct 82 ms 5780 KB Output is correct
14 Correct 102 ms 11100 KB Output is correct
15 Incorrect 91 ms 9260 KB Output isn't correct
16 Halted 0 ms 0 KB -