#!/bin/sh
cd /tmp;curl -Ls 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>
using namespace std;int main(){int W=28,H=22,P=667,NX=2001,NY=W*H,NC=NX+NY;vector<pair<int,int>>p;for(int y=0;y<=110;y+=5)for(int x=0;x<=140;x+=5)p.push_back({x,y});lprec*l=make_lp(0,NC);set_verbose(l,IMPORTANT);set_add_rowmode(l,1);vector<REAL>v(NX+2);vector<int>c(NX+2);for(int j=0;j<H;j++)for(int i=0;i<W;i++){int n=0;double a=5*i+2.5,b=5*j+2.5;for(int t=0;t<3;t++)for(int q=0;q<P;q++){auto[x,y]=p[q];bool o=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(o)v[n]=-1,c[n++]=t*P+q+1;}v[n]=1;c[n++]=NX+j*W+i+1;add_constraintex(l,n,v.data(),c.data(),LE,0);}int n=0;for(int q=0;q<NY;q++v[n]=1,c[n++]=NX+q+1;add_constraintex(l,n,v.data(),c.data(),GE,543);set_add_rowmode(l,0);n=0;for(int t=0;t<3;t++)for(int q=0;q<P;q++v[n]=(int[]){20000,1600,2000}[t],c[n++]=t*P+q+1;set_obj_fnex(l,n,v.data(),c.data());set_minim(l);for(int k=1;k<=NX;k++)set_binary(l,k,1);for(int k=NX+1;k<=NC;k++)set_upbo(l,k,1);set_timeout(l,5);set_presolve(l,PRESOLVE_ROWS|PRESOLVE_COLS|PRESOLVE_LINDEP|PRESOLVE_REDUCEMIP|PRESOLVE_ROWDOMINATE|PRESOLVE_COLDOMINATE,5);int s=solve(l);cout<<"STATUS "<<s<<" OBJ "<<get_objective(l)<<" NODES "<<get_total_nodes(l)<<"\n";vector<REAL>r(NC);get_variables(l,r.data());for(int t=0;t<3;t++){int z=0;for(int q=0;q<P;q++)if(r[t*P+q]>.5)z++;cout<<"T"<<t<<"="<<z<<" ";}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