Submission #1268459

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

bulldozer

#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
const int MAX_N=1e2+2;
int n;
long long x[MAX_N];
long long y[MAX_N];
long long cost[MAX_N];
vector<pair<long long,int>>order;
long long distance(long long A,long long B,long long C,long long x0,long long y0)
{
    return A*x0+B*y0+C;
}
long long solvefor()
{
    long long curbest=0;
    for(int i=0;i<order.size();i++)
    {
        long long cur=0;
        for(int j=i;j<order.size();j++)
        {
            cur+=cost[order[j].second];
        }
        curbest=max(curbest,cur);
    }
    return curbest;
}
void solve()
{
    for(int i=1;i<=n;i++)
    {
        order.push_back({x[i],i});
    }
    sort(order.begin(),order.end());
    long long ans=max(0LL,solvefor());
    cout<<ans<<"\n";
}
int main ()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>x[i]>>y[i]>>cost[i];
    }
    solve();
    return 0;
}

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