Submission #202122

#	Time	Username	Problem	Language	Result	Execution time	Memory
202122		Segtree	Bulldozer (JOI17_bulldozer)	C++14	5 / 100	5 ms	376 KiB

bulldozer

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<unordered_set>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
#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;
vector<P> v;
int main(){
    cin>>n;
    rep(i,n){
	ll x,y,w;
	cin>>x>>y>>w;
	v.push_back(make_pair(x,w));
    }
    sort(all(v));
    ll ans=0;
    ll mi=0,rui=0;
    rep(i,n){
	rui+=v[i].second;
	chmax(ans,rui-mi);
	chmin(mi,rui);
    }
    cout<<ans<<endl;
}

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