Submission #337447

#	Time	Username	Problem	Language	Result	Execution time	Memory
337447		YJU	Bulldozer (JOI17_bulldozer)	C++14	80 / 100	1924 ms	66548 KiB

bulldozer

#include<bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector,ofast")
using namespace std;
typedef long long ll;
typedef __float128 ld;
typedef pair<ll,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ll N=2e3+5;
const ld pi=acos(-1);
const ll INF=(1LL<<30);
const ld zero=1e-24;
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;++i)
#define REP1(i,n) for(ll i=1;i<=n;++i)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()
 
ll n,x[N],y[N],c[N],pos[N],ans,ma[4*N],lma[4*N],rma[4*N],sum[4*N];
vector<ll> lis;
vector<pair<ld,pll> > event;
 
void mod(ll nda,ll ndb){
	ld cel=asin(1.0*(y[nda]-y[ndb])/sqrt(1.0*SQ(y[nda]-y[ndb])+1.0*SQ(x[nda]-x[ndb])));
	cel=(cel+pi/2>2*pi?cel+pi/2-2*pi:cel+pi/2);
	event.pb(mp(cel,mp(nda,ndb)));
}
 
void upd(ll id,ll l,ll r,ll to){
	if(l==r-1){ma[id]=lma[id]=rma[id]=max(0LL,c[lis[l]]);sum[id]=c[lis[l]];return ;}
	ll mid=(l+r)>>1;
	if(to<mid)upd((id<<1),l,mid,to);
	else upd((id<<1)|1,mid,r,to);
	sum[id]=sum[(id<<1)]+sum[(id<<1)|1];
	lma[id]=max(lma[(id<<1)],lma[(id<<1)|1]+sum[(id<<1)]);
	rma[id]=max(rma[(id<<1)]+sum[(id<<1)|1],rma[(id<<1)|1]);
	ma[id]=max(max(ma[(id<<1)],ma[(id<<1)|1]),lma[(id<<1)|1]+rma[(id<<1)]);
}
 
int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n;
	REP(i,n){
		cin>>x[i]>>y[i]>>c[i];
		lis.pb(i);
	}
	sort(lis.begin(),lis.end(),[](ll A,ll B){
		if(x[A]!=x[B])return (x[A]<x[B]);
		return (y[A]>y[B]);
	});
	REP(i,n)pos[lis[i]]=i;
	REP(i,n)upd(1,0,n,i);
	ans=ma[1];
	REP(i,n){
		for(int j=i+1;j<n;j++){
			mod(lis[i],lis[j]);
		}
	}
	
	sort(event.begin(),event.end());
	
	REP(i,SZ(event)){
		if(i&&(event[i].X-event[i-1].X)>zero)ans=max(ans,ma[1]);
		ll nx=event[i].Y.X,ny=event[i].Y.Y;
		swap(lis[pos[nx]],lis[pos[ny]]);
		upd(1,0,n,pos[nx]);
		upd(1,0,n,pos[ny]);
		swap(pos[nx],pos[ny]);
	}
	cout<<ans<<"\n";
	return 0;
}

Compilation message (stderr)

bulldozer.cpp:2:61: warning: bad option '-fofast' to pragma 'optimize' [-Wpragmas]
    2 | #pragma GCC optimize("unroll-loops,no-stack-protector,ofast")
      |                                                             ^
bulldozer.cpp:28:23: warning: bad option '-fofast' to attribute 'optimize' [-Wattributes]
   28 | void mod(ll nda,ll ndb){
      |                       ^
bulldozer.cpp:34:31: warning: bad option '-fofast' to attribute 'optimize' [-Wattributes]
   34 | void upd(ll id,ll l,ll r,ll to){
      |                               ^
bulldozer.cpp:45:10: warning: bad option '-fofast' to attribute 'optimize' [-Wattributes]
   45 | int main(){
      |          ^
bulldozer.cpp: In function 'int main()':
bulldozer.cpp:52:41: warning: bad option '-fofast' to attribute 'optimize' [-Wattributes]
   52 |  sort(lis.begin(),lis.end(),[](ll A,ll B){
      |                                         ^

• Subtask 1: 5 / 5
• Subtask 2: 20 / 20
• Subtask 3: 35 / 35
• Subtask 4: 20 / 20
• Subtask 5: 0 / 20