제출 #1119984

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1119984		yeediot	Potatoes and fertilizers (LMIO19_bulves)	C++17	100 / 100	117 ms	8592 KiB

bulves

#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){
    freopen("/Users/iantsai/cpp/input.txt","r",stdin);
    freopen("/Users/iantsai/cpp/output.txt","w",stdout);
}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
#define TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);setio();
inline void solve(){
    int n;
    cin >> n;
    int a, b;
    long long d[n + 1];
    d[0] = 0;
    for(int i = 1; i <= n; i++){
        cin >> a >> b;
        d[i] = d[i - 1] + a - b;
    }
    priority_queue<long long>pq;
    pq.push(0);
    long long ans = 0;
    for(int i = 1; i <= n; i++){
        if(d[i] < 0) ans += -d[i], d[i] = 0;
        else if(d[i] > d[n]) ans += d[i] - d[n], d[i] = d[n];
    }
    for(int i = 1; i <= n; i++){
        pq.push(d[i]);
        pq.push(d[i]);
        ans += pq.top() - d[i];
        pq.pop();
    }
    cout << ans << '\n';
}
signed main(){
    TOI_is_so_de;
    solve();
}
/*
input:
 
*/

• Subtask 1: 24 / 24
• Subtask 2: 10 / 10
• Subtask 3: 20 / 20
• Subtask 4: 10 / 10
• Subtask 5: 36 / 36