oj.uz

Submission #473518

# Submission time Handle Problem Language Result Execution time Memory
473518 2021-09-15T15:56:51 Z Fgdxx Potatoes and fertilizers (LMIO19_bulves) C++17
20 / 100
 32 ms 1784 KB 
#include <bits/stdc++.h>
using namespace std;
int main()
{
    int n;
    cin>>n;
    vector<long long>odp1(n);
    priority_queue<long long,vector<long long>,greater<long long>>odp2;
    for(auto &x : odp1)
    {
        int a,b;
        cin>>a>>b;
        x=(a-b);
        odp2.push(0);
    }
    partial_sum(odp1.begin(),odp1.end(),odp1.begin());
    odp2.push(0);
    odp2.push(0);
    int punkty=0;
    for(auto x : odp1 )
    {
        odp2.pop();
        punkty+=max(-x-odp2.top(),0LL);
        odp2.push(-x);
        odp2.push(-x);
    }
    long long wi=0;
    while(odp2.top()!=-odp1.back())
    {
        auto m=odp2.top();
        
        
        odp2.pop();
        punkty+=wi*(odp2.top()-m);
        wi++;
    }
    cout<<punkty;
    return 0;
}

Subtask #1
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Incorrect 32 ms 1784 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 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Incorrect 32 ms 1784 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 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 3 ms 460 KB Output is correct
14 Incorrect 3 ms 460 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 3 ms 332 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Incorrect 32 ms 1784 KB Output isn't correct
12 Halted 0 ms 0 KB -