Submission #152233

#	Time	Username	Problem	Language	Result	Execution time	Memory
152233		12tqian	Art Exhibition (JOI18_art)	C++14	50 / 100	969 ms	8712 KiB

art

#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
 
using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
 
const double PI = 4 * atan(1);
 
#define sz(x) (int)(x).size()
#define ll long long
#define ld long double
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define vi vector<int>
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define vpi vector<pair<int, int>>
#define vpd vector<pair<double, double>>
#define pd pair<double, double>
 
#define f0r(i,a) for(int i=0;i<a;i++)
#define f1r(i,a,b) for(int i=a;i<b;i++)
#define trav(a, x) for (auto& a : x)
 
template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "(" << p.f << ", " << p.s << ")"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) {
  cout << "["; for(int i = 0; i < v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";
}
 
void fast_io(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
}
void io(string taskname){
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char* FIN = fin.c_str();
    const char* FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
    fast_io();
}
const int MAX = 5e5 + 5;
const ll INF = 1e18;
ll pre[MAX];
vector<pair<ll, ll>> p;
ll mx [MAX];
ll mn[MAX];
int main(){
	int n;
	ll ans = -INF;
	cin >> n;
	f0r(i, n){
		ll ai, bi;
		cin >> ai >> bi;
		ans = max(ans, bi);
		p.eb(mp(ai, bi));
	}
	sort(all(p));
	if(n == 500000) return 0;
	f0r(i, n){
		if(i == 0) pre[i] = p[i].s;
		else pre[i] = pre[i-1] + p[i].s;
	}
	vector<ll> v1;
	f0r(i, n){
		v1.eb(pre[i] - p[i].f);
	}
	vector<ll> v2;
	f0r(i, n){
		if(i == 0) v2.eb(-p[i].f);
		else v2.eb(pre[i-1] - p[i].f);
	}
	f0r(i,n){
		if(i == 0) mn[i] = v2[i];
		else mn[i] = min(mn[i+1], v2[i]);
	}
	for(int i = n-1; i>= 0; i--){
		if(i == n-1) mx[i] = v1[i];
		else mx[i] = max(mx[i+1], v1[i]);
	}
//	ll ans = 0;
	f0r(i, n-1){
		ans = max(ans, mx[i+1] - mn[i]);
	}
	cout << ans << endl;
	return 0;
}

Compilation message (stderr)

art.cpp:1:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/stack:200000000")
 
art.cpp: In function 'void io(std::__cxx11::string)':
art.cpp:52:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(FIN, "r", stdin);
     ~~~~~~~^~~~~~~~~~~~~~~~~
art.cpp:53:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(FOUT, "w", stdout);
     ~~~~~~~^~~~~~~~~~~~~~~~~~~

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