Submission #207697

#	Time	Username	Problem	Language	Result	Execution time	Memory
207697		Nucleist	Art Exhibition (JOI18_art)	C++14	100 / 100	257 ms	36600 KiB

art

#include <bits/stdc++.h> 
using namespace std; 
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#define flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) cerr << " - " << #x << ": " << x << " " << #y << ": " << y << endl;
#define all(x) (x).begin(),(x).end()
#define sz(x) (ll)x.size()
#define ll long long
#define int ll
#define INF 1000000000
#define MOD 1000000007
#define pb push_back
#define ve vector<ll>
#define dos pair<ll,ll>
#define vedos vector<dos>
#define rand mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
struct greateri
{
    template<class T>
    bool operator()(T const &a, T const &b) const { return a > b; }
};
int A[500003],B[500003],maxi[500003];
int32_t main()
{
    flash;
    int n,ans=0;
    cin>>n;
    ve cum(n,0);
    vedos vec(n);
    for (int i = 0; i < n; ++i){
        cin>>A[i]>>B[i],ans=max(ans,B[i]);    
        vec[i]=dos(A[i],B[i]);
    }
    sort(all(vec));
    for (int i = n-1; i >=0 ; i--){
        cum[i]+=vec[i].second;
        if(i!=(n-1))cum[i]+=cum[i+1];
    }
    for (int i = n-1; i >=0 ; i--)
        cum[i]+=vec[i].first;
    for (int i = 0; i < n; ++i)
    {
        maxi[i]=cum[i];
        if(i)maxi[i]=max(maxi[i],maxi[i-1]);
    }
    for (int i = n-1; i >=1; i--)
        ans=max(ans,maxi[i-1]-vec[i].first-((i!=(n-1))?(cum[i+1]-vec[i+1].first):0));
    cout<<ans;
    return 0;
}
//code the AC sol !
// BS/queue/map

Compilation message (stderr)

art.cpp:4:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("O3")
 
art.cpp:5:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 20 / 20
• Subtask 4: 50 / 50