oj.uz

Submission #1112589

# Submission time Handle Problem Language Result Execution time Memory
1112589 2024-11-14T11:11:18 Z guagua0407 Potatoes and fertilizers (LMIO19_bulves) C++17
30 / 100
 114 ms 10632 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

int main() {_
    int n;
    cin>>n;
    vector<ll> dif(n+1);
    for(int i=1;i<=n;i++){
        int a,b;
        cin>>a>>b;
        dif[i]=dif[i-1]+a-b;
    }
    priority_queue<ll> pq;
    pq.push(0);
    ll ans=0;
    for(int i=1;i<=n;i++){
        if(dif[i]<0){
            ans-=dif[i];
            dif[i]=0;
        }
        pq.push(dif[i]);
        if(pq.top()>dif[i]){
            pq.push(dif[i]);
            ans+=pq.top()-dif[i];
            pq.pop();
        }
    }
    int cnt=1;
    while(pq.top()>dif[n]){
        int r=pq.top();
        pq.pop();
        ans+=1ll*cnt*(r-max(dif[n],pq.top()));
        cnt++;
    }
    cout<<ans<<'\n';
    return 0;
}
//maybe its multiset not set

Compilation message

bulves.cpp: In function 'void setIO(std::string)':
bulves.cpp:12:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bulves.cpp:13:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 11 ms 1492 KB Output is correct
5 Correct 22 ms 2256 KB Output is correct
6 Correct 72 ms 5572 KB Output is correct
7 Correct 68 ms 10432 KB Output is correct
8 Incorrect 114 ms 10632 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 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 11 ms 1492 KB Output is correct
5 Correct 22 ms 2256 KB Output is correct
6 Correct 72 ms 5572 KB Output is correct
7 Correct 68 ms 10432 KB Output is correct
8 Incorrect 114 ms 10632 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 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 504 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 2 ms 336 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 504 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 11 ms 1492 KB Output is correct
12 Correct 22 ms 2256 KB Output is correct
13 Correct 72 ms 5572 KB Output is correct
14 Correct 68 ms 10432 KB Output is correct
15 Incorrect 114 ms 10632 KB Output isn't correct
16 Halted 0 ms 0 KB -