Submission #300130

#	Time	Username	Problem	Language	Result	Execution time	Memory
300130		CSQ31	Art Exhibition (JOI18_art)	C++14	100 / 100	223 ms	19176 KiB

art

#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) a.size()
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(1e8)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
int main()
{
	owo
	//exchange argument,always optimal to take whole prefix,
	ll n;
	cin>>n;
	vector<PII>art(n);
	ll ans = 0;
	for(int i=0;i<n;i++){
		cin>>art[i].fi>>art[i].se;
	}
	sort(all(art));
	vector<PII>a;
	for(int i=0;i<n;i++){
		int j = i;
		ll w = art[i].se;
		while(j+1 < n && art[j+1].fi == art[i].fi){
			j++;
			w+=art[j].se;
		}
		ans = max(ans,w);
		a.pb({art[i].fi,w});
		i = j;
	}
	ll mx = 0;
	n = a.size();
	//for(int i=0;i<n;i++)cout<<a[i].fi<<","<<a[i].se<<" ";
	///cout<<'\n';
	for(int i=0;i<n;i++){
		mx = max(mx,a[i].fi);
		mx+=a[i].se;
		ans = max(ans,mx-a[i].fi);
			
	}
	cout<<ans;
	
}

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