oj.uz

Submission #503863

# Submission time Handle Problem Language Result Execution time Memory
503863 2022-01-09T05:43:24 Z Khizri Art Exhibition (JOI18_art) C++17
0 / 100
 0 ms 204 KB 
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define int long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
    if(a>b) swap(a,b);
    if(a==0) return a+b;
    return gcd(b%a,a);
}
ll lcm(ll a,ll b){
    return a/gcd(a,b)*b;
}
bool is_prime(ll n){
    ll k=sqrt(n);
    if(n==2) return true;
    if(n<2||n%2==0||k*k==n) return false;
    for(int i=3;i<=k;i+=2){
        if(n%i==0){
            return false;
        }
    }
    return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=2e5+5;
ll t=1,n,a,b;
vector<pll>vt;
ll funk(int ind,int ans){
    return ans-vt[ind].S;
}
void solve(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a>>b;
        vt.pb({a,b});
    }
    sort(all(vt));
    ll ans=vt[0].S,k=vt[0].S;
    int l=0;
    for(int i=1;i<n;i++){
        if(vt[i].F-vt[i-1].F<vt[i].S){
            k+=vt[i].S;
        }
        else{
            k+=vt[i].S;
            while(l<i&&funk(l,k)-(vt[i].F-vt[l+1].F)>k-(vt[i].F-vt[l].F)){
                l++;
                k-=vt[l-1].S;
            }
        }
        ans=max(ans,k-(vt[i].F-vt[l].F));
    }
    while(l<n-1&&funk(l,k)-(vt[n-1].F-vt[l+1].F)>k-(vt[n-1].F-vt[l].F)){
        l++;
        k-=vt[l-1].S;
    }
    ans=max(ans,k-(vt[n-1].F-vt[l].F));
    cout<<ans<<endl;
}
signed main(){
    IOS;
    //cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 0 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 0 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 0 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Incorrect 0 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -