#!/bin/sh
cd /tmp
curl -L -sS https://pkg.freebsd.org/FreeBSD:14:amd64/quarterly/All/lp_solve-5.5.2.5_1.pkg -o l.pkg
mkdir p;tar -xf l.pkg -C p 2>/dev/null
cat >m.cpp <<'EOF'
#include "lp_lib.h"
#include <vector>
#include <iostream>
#include <cmath>
#include <chrono>
using namespace std;
int main(){
const int W=140,H=110,P=29*23,NX=3*P,NY=W*H,NC=NX+NY;
vector<pair<int,int>> pos;for(int y=0;y<=H;y+=5)for(int x=0;x<=W;x+=5)pos.push_back({x,y});
lprec*lp=make_lp(0,NC);set_verbose(lp,NORMAL);set_add_rowmode(lp,TRUE);
vector<REAL> val(NX+2);vector<int> col(NX+2);
for(int j=0;j<H;j++)for(int i=0;i<W;i++){int n=0;double a=i+.5,b=j+.5;for(int t=0;t<3;t++)for(int q=0;q<P;q++){auto [x,y]=pos[q];bool ok=t==0?(a-x)*(a-x)+(b-y)*(b-y)<=400:t==1?(a-x)*(a-x)+(b-y)*(b-y)<=25:abs(a-x)<=5&&abs(b-y)<=5;if(ok){val[n]=-1;col[n++]=t*P+q+1;}}val[n]=1;col[n++]=NX+j*W+i+1;add_constraintex(lp,n,val.data(),col.data(),LE,0);}
int n=0;for(int p=0;p<NY;p++){val[n]=1;col[n++]=NX+p+1;}add_constraintex(lp,n,val.data(),col.data(),GE,13552);set_add_rowmode(lp,FALSE);
n=0;for(int t=0;t<3;t++)for(int q=0;q<P;q++){val[n]=(int[]){20000,1600,2000}[t];col[n++]=t*P+q+1;}set_obj_fnex(lp,n,val.data(),col.data());set_minim(lp);
for(int k=1;k<=NX;k++)set_binary(lp,k,TRUE);for(int k=NX+1;k<=NC;k++)set_upbo(lp,k,1);
set_timeout(lp,5);set_mip_gap(lp,TRUE,0);set_presolve(lp,PRESOLVE_ROWS|PRESOLVE_COLS|PRESOLVE_LINDEP|PRESOLVE_REDUCEMIP|PRESOLVE_PROBEFIX|PRESOLVE_PROBEREDUCE|PRESOLVE_ROWDOMINATE|PRESOLVE_COLDOMINATE,5);
int s=solve(lp);cout<<"STATUS "<<s<<" OBJ "<<get_objective(lp)<<" BB "<<get_total_nodes(lp)<<" IT "<<get_total_iter(lp)<<"\n";
vector<REAL>r(NC);get_variables(lp,r.data());for(int t=0;t<3;t++){int c=0;for(int q=0;q<P;q++)if(r[t*P+q]>.5)c++;cout<<"T"<<t<<"="<<c<<" ";}cout<<"\n";}
EOF
clang++ -O3 -std=c++17 -I p/usr/local/include/lpsolve m.cpp p/usr/local/lib/liblpsolve55.a -lm -o m && ./m