Submission #1138828

#	Time	Username	Problem	Language	Result	Execution time	Memory
1138828		Noproblem29	Bulldozer (JOI17_bulldozer)	C++20	5 / 100	69 ms	776 KiB

bulldozer

#include<bits/stdc++.h>
using namespace std;
#ifndef BADGNU
#pragma GCC target("sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#endif
#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds;
#define ll long long
#define int ll
#define ld long double
#define y1 cheza
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
template<class T> using ordered_multiset = tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;
const int N=2100;
const int M=5001;
const int B=447;
const int mod=998244353;
const ll INF=1e18;
const int dx[]={1,-1,0,0};
const int dy[]={0,0,1,-1};
const double eps=1e-6;

struct pt{
    int x,y;
    int w;
};
bool operator<(const pt&a,const pt&b){
    if(a.x==b.x){
        if(a.y==b.y){
            return a.w<b.w;
        }
        return a.y<b.y;
    }
    return a.x<b.x;
}
bool operator==(const pt&a,const pt&b){
    return (a.x==b.x)&&(a.y==b.y)&&(a.w==b.w);
}
int n;
pt a[N];
int pref[N];
void test(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i].x>>a[i].y>>a[i].w;
    }
    sort(a+1,a+n+1);
    vector<pt>v;
    n++;
    a[n]={0,0,0};
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            pt dif={a[i].x-a[j].x,a[i].y-a[j].y,0};
            if(dif.x<=0&&dif.y<=0){
                dif.x=-dif.x;
                dif.y=-dif.y;
            }

            int g=gcd(abs(dif.x),abs(dif.y));
            if(g==0)continue;
            dif.x/=g;
            dif.y/=g;
            v.push_back(dif);
        }
    }
    v.push_back({0,1,0});
    v.push_back({1,0,0});
    v.push_back({0,-1,0});
    v.push_back({-1,0,0});
    v.push_back({1,1,0});
    v.push_back({-1,-1,0});
    v.push_back({-1,1,0});
    v.push_back({1,-1,0});
    
    sort(v.begin(),v.end());
    v.resize(unique(v.begin(),v.end())-v.begin());
    int ans=0;
    for(auto f:v){
        map<int,int>res;
        for(int i=1;i<=n;i++){
            int h=(a[i].y*f.x-a[i].x*f.y);
            // a[i].y=a[i].x*f.y/f.x+h
            res[h]+=a[i].w;
        }
        int tin=0;
        for(auto i:res){
            ++tin;
            pref[tin]=pref[tin-1]+i.second;
        }
        int mn=0;
        for(int i=1;i<=tin;i++){
            mn=min(mn,pref[i-1]);
            ans=max(ans,pref[i]-mn);
        }
    }
    cout<<ans<<'\n';

}
/*

*/
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    // cout.tie(nullptr);
    int t2=1;
    // cin>>t2;
    for(int i=1;i<=t2;i++){
        test();
    }
}

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