제출 #699710

#제출 시각아이디문제언어결과실행 시간메모리
699710realacceptedArt Exhibition (JOI18_art)C++17
100 / 100
185 ms14212 KiB
#include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#define ll long long
#define fi ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define yes cout<<"YES"<<"\n";
#define no cout<<"NO"<<"\n";
#define all(a) a.begin(),a.end()
#define all1(a) a.rbegin(),a.rend()
#define mod 1000000007
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
signed main()
{
    ll T=1;
    fi
    //cin>>T;
    while(T--)
    {
        ll n,c=-1e18;
        cin>>n;
        pair<ll,ll>a[n+1];
        a[0].first=0,a[0].second=0;
        for(ll i=1;i<=n;i++)
        {
            cin>>a[i].first>>a[i].second;c=max(c,a[i].second);
        }
        sort(a,a+n+1);a[0].first=a[1].first;
        ll x=1;
        vector<ll>s;
        for(ll i=1;i<=n;i++)
        {
           s.push_back(a[i].second-(a[i].first-a[i-1].first));
           //cout<<a[i].first<<" "<<a[i].second<<"\n";
        }ll o=0;
        for(ll i=0;i<n;i++)
        {
            if(o+s[i]<=0||a[i+1].second>o+s[i])
            {
                o=a[i+1].second;
            }else
            o+=s[i];//cout<<o<<"\n";
            c=max(c,o);
        }cout<<c<<"\n";
    }
}

컴파일 시 표준 에러 (stderr) 메시지

art.cpp: In function 'int main()':
art.cpp:33:12: warning: unused variable 'x' [-Wunused-variable]
   33 |         ll x=1;
      |            ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...