Submission #1199950

#	Time	Username	Problem	Language	Result	Execution time	Memory
1199950		candi_ositos	Bulldozer (JOI17_bulldozer)	C++20	0 / 100	1 ms	324 KiB

bulldozer

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int N;
    cin>>N;
    vector <int> x;
    vector <int> y;
    vector <int> weight;
    x.resize(N);
    y.resize(N);
    weight.resize(N);
    for(int i=0; i<N; ++i)
    {
        cin>>x[i]>>y[i]>>weight[i];
    }
    map <int, int> wp;
    for(int i=0; i<N; ++i)
    {
        wp[x[i]]=weight[i];
    }
    vector <int> wx;
    wx.resize(N);
    int j=0;
    for(auto i:wp)
    {
        wx[j]=i.second;
        ++j;
    }
    vector <int> ps;
    ps.resize(N);
    ps[0]=wx[0];
    for(int i=1; i<N; ++i)
    {
        ps[i]=ps[i-1]+wx[i];
    }
    int max=0;
    for(int i=0; i<N; ++i)
    {
        if(max<ps[i])
        {
            max=ps[i];
        }
        for(int p=i+1; p<N; ++p)
        {
            if(max<ps[p]-ps[i])
            {
                max=ps[p]-ps[i];
            }
        }
    }
    cout<<max;
    return 0;
}

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