제출 #1140016

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1140016		brover29	Bulldozer (JOI17_bulldozer)	C++20	5 / 100	0 ms	328 KiB

bulldozer

#include <bits/stdc++.h>
//qwerty47924692
using namespace std;
using ll = long long;
const ll N=2e5+29;
const string br="617283";
#define sz(a)(ll)a.size()
#define f first
#define s second
ll n,x[N],y[N],w[N],timer,pref[N];
set<ll>s;
map<ll,ll>mp;
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin>>n;
    for(ll i=1;i<=n;i++){
        cin>>x[i]>>y[i]>>w[i];
    }
    for(ll i=1;i<=n;i++){
        s.insert(x[i]);
    }
    for(auto i:s){
        mp[i]=++timer;
    }for(ll i=1;i<=n;i++){
        x[i]=mp[x[i]];
    }
    timer=0;
    mp.clear();
    s.clear();
    for(ll i=1;i<=n;i++){
        s.insert(y[i]);
    }
    for(auto i:s){
        mp[i]=++timer;
    }for(ll i=1;i<=n;i++){
        y[i]=mp[y[i]];
    }for(ll i=1;i<=n;i++){
        pref[x[i]]+=w[i];
    }ll ans=0;
    for(ll i=1;i<=n;i++){
        pref[i]+=pref[i-1];
        for(ll j=0;j<i;j++){
            ans=max(ans,pref[i]-pref[j]);
        }
    }
    cout<<ans;
}

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