제출 #202125

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
202125		Segtree	Bulldozer (JOI17_bulldozer)	C++14	0 / 100	61 ms	376 KiB

bulldozer

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<complex>
#include<math.h>
#include<unordered_set>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef complex<long double> C;
#define chmax(a,b) a=max(a,b)
#define chmin(a,b) a=min(a,b)
#define all(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
#define mad(a,b) a=(a+b)%mod
ll n,w[110];
C p[110];
ll solve(C g,C e){
    vector<pair<long double,ll> >v;
    rep(i,n){
	C c=p[i]-g;
	c*=e;
	v.push_back(make_pair(c.imag(),i));
    }
    sort(all(v));
    ll res=0,mi=0,rui=0;
    rep(i,n){
	rui+=w[v[i].second];
	chmin(mi,rui);
	chmax(res,rui-mi);
    }
    return res;
}
int main(){
    cin>>n;
    rep(i,n){
	ll x,y;
	cin>>x>>y>>w[i];
	p[i]=C(x,y);
    }
    ll ans=0;
    rep(i,n)rep(j,i){
	ll dx=p[i].real()-p[j].real();
	ll dy=p[i].imag()-p[j].imag();
	chmax(ans,solve(p[j],C(dx,-dy)));
    }
    cout<<ans<<endl;
}

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