Submission #1195474

#TimeUsernameProblemLanguageResultExecution timeMemory
1195474ozner77Bulldozer (JOI17_bulldozer)C++17
0 / 100
0 ms324 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
    ll n;
    ll x,y,w;
    map<ll,ll> M,M1;
    vector<ll> V,V1;
    cin>>n;
    for(ll i=0;i<n;i++){
        cin>>x>>y>>w;
        M[x]+=w;
        M1[y]+=w;
    }
    for(auto x:M){
        V.push_back(x.second);
    }
    for(auto x:M1){
        V1.push_back(x.second);
    }
    ll ans1=0,ans2=0;
    ll suma=0;
    for(ll i=0;i<V1.size();i++){
        if(suma+V1[i]>0){
            suma+=V1[i];
        }else{
            suma=0;
        }
        ans1=max(ans1,suma);
    }
    suma=0;
    for(ll i=0;i<V.size();i++){
        if(suma+V[i]>0){
            suma+=V[i];
        }else{
            suma=0;
        }
        ans2=max(ans1,suma);
    }
    ll res=max(ans1,ans2);
    if(res<0){
        cout<<0;
    }else{
        cout<<res;
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...