01分数规划
01分数规划的题目一般比较明显,是一个sigma(a[i] * x[i]) / sigma(b[i] * x[i]) 的形式,这类题目套路比较固定,写出数学表达式之后,二分就好了,有时候需要一些贪心,二分的Check需要根据表达式判断大于0还是小于0
- 经典例题:P1730
- 二分 + 最短路
//#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define sz(a) (int)a.size()
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define LF putchar('\n')
#define SP putchar(' ')
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)
template<typename T>
void read(T &x) {x = 0;char ch = getchar();ll f = 1;while(!isdigit(ch)){if(ch == '-')f *= -1;ch = getchar();}while(isdigit(ch)){x = x * 10 + ch - 48; ch = getchar();}x *= f;}
template<typename T, typename... Args>
void read(T &first, Args& ... args) {read(first);read(args...);}
template<typename T>
void write(T arg) {T x = arg;if(x < 0) {putchar('-'); x =- x;}if(x > 9) {write(x / 10);}putchar(x % 10 + '0');}
template<typename T, typename ... Ts>
void write(T arg, Ts ... args) {write(arg);if(sizeof...(args) != 0) {putchar(' ');write(args ...);}}
using namespace std;
ll gcd(ll a, ll b) {
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
const int N = 55, M = 1005;
const double eps = 1e-6;
int n , m;
int head[N] , cnt;
struct node {
int t, next;
double w;
}edge[M << 1];
void add (int f, int t, double w)
{
edge[cnt].t = t;
edge[cnt].w = w;
edge[cnt].next = head[f];
head[f] = cnt ++;
}
int a[N][N];
double ans[N][N];
void floyd ()
{
for (int k = 1 ; k <= n ; k ++)
for (int i = 1 ; i <= n ; i ++)
for (int j = 1 ; j <= n ; j ++)
a[i][j] |= (a[i][k] && a[k][j]);
}
double dis[N];
int vis[N], times[N];
bool spfa (int s, int t, double x)
{
queue <int> q;
for (int i = 1 ;i <= n ; i ++)
dis[i] = 0x3f3f3f3f, vis[i] = 0;
dis[s] = 0.0;
vis[s] = 1;
q.push(s);
while (!q.empty())
{
int u = q.front();
q.pop();
vis[u] = 0;
for (int i = head[u] ; i != -1 ; i = edge[i].next)
{
int v = edge[i].t;
double w = edge[i].w;
if (dis[v] > dis[u] + w - x)
{
dis[v] = dis[u] + w - x;
if (!vis[v])
q.push(v) , vis[v] = 1;
}
}
}
return dis[t] > 0;
}
void solve ()
{
for (int i = 1 ; i <= n ; i ++)
{
for (int j = 1 ; j <= n ; j ++)
{
if (a[i][j] && i != j)
{
double l = 0.0 , r = 100000.0;
while(r-l > 1e-6){
double mid = (l+r)/2;
if(spfa(i,j,mid))
l=mid;
else
r=mid;
}
ans[i][j] = l;
}
}
}
}
int main (void)
{
mem(head,-1);
read (n, m);
for (int i = 1 ; i <= m ; i ++)
{
int u , v;
double w;
read (u , v);
scanf("%lf",&w);
add (u , v , w);
a[u][v] = 1;
}
floyd ();
solve ();
int Q;
read (Q);
while (Q --)
{
int u , v;
read (u , v);
if (a[u][v])
printf("%.3lf\n", ans[u][v]);
else
printf("OMG!\n");
}
}
- AcWing361 01分数划分+spfa判负环
//#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define p_queue priority_queue
ll gcd(ll a, ll b) {
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
int n, m;
int head[1005], cnt;
struct e{
int t, next;
double w;
}edge[10005];
void add(int f, int t, double w)
{
edge[cnt].t = t;
edge[cnt].w = w;
edge[cnt].next = head[f];
head[f] = cnt ++;
}
double ve[1005];
double f[1005][1005];
bool vis[1005];
double dis[1005];
int times[1005];
bool check(double x)
{
mem(dis,DNF);
mem(times,0);
mem(vis,0);
queue <int> q;
dis[1] = 0.0;
vis[1] = 1;
q.push(1);
while(!q.empty())
{
int no = q.front();
q.pop();
vis[no] = 0;
for(int i = head[no] ; i != -1 ; i = edge[i].next)
{
int v = edge[i].t;
double w = x * edge[i].w - ve[no];
if(dis[v] > dis[no] + w)
{
dis[v] = dis[no] + w;
times[v] = times[no] + 1;
if(times[v] >= n)
return true;
if(!vis[v])
{
q.push(v);
vis[v] = 1;
}
}
}
}
return false;
}
int main(void)
{
#ifdef LOCAL
freopen("data.in", "r", stdin);
freopen("odata.out", "w", stdout);
#endif
mem(head,-1);
int u ,v;
double w;
scanf("%d %d",&n , &m);
for(int i = 1 ; i <= n ; i ++)
scanf("%lf",&ve[i]);
for(int i = 1 ; i <= m ; i ++)
{
scanf("%d %d %lf",&u,&v,&w);
add(u,v,w);
}
double l = 0.0, r = 1000.0;
for(int i = 1 ; i <= 50 ; i ++)
{
double mid = (l + r) / 2.0;
if(check(mid))
l = mid;
else
r = mid;
}
printf("%.2lf\n",r);
}
- AcWing348 最优比率生成树
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define p_queue priority_queue
ll gcd(ll a, ll b) {
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
int n, tot;
struct po{
double x , y, h;
}point[1010];
struct e
{
int u, v;
double cost, val;
double w;
bool operator < (const e& no) const{
return w < no.w;
}
}edge[1010];
double dp[1010];
int vis[1010];
double dis(double x1, double y1 , double x2, double y2) {
return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}
bool prime(double R)
{
for(int i = 1 ; i <= n ; i ++)
dp[i] = 10000001.0;
mem(vis,0);
double sum = 0.0;
dp[1] = 0.0;
for(int i = 1 ; i <= n ; i ++)
{
int index = 1;
double minn = INF;
for(int j = 1 ; j <= n ; j ++)
{
if(dp[j] < minn && !vis[j])
{
minn = dp[j];
index = j;
}
}
vis[index] = 1;
sum += minn;
for(int j = 1 ; j <= n ; j ++)
{
double cost = dis(point[index].x, point[index].y, point[j].x, point[j].y);
double h = fabs(point[index].h - point[j].h);
if(!vis[j] && dp[j] > h - cost*R + 1e-6) {
dp[j] = h - cost * R;
}
}
}
if(sum < 0.0) //最小 反之最大
return true;
return false;
}
int main(void)
{
while(~scanf("%d",&n),n) {
tot = 1;
for (int i = 1; i <= n; i++)
scanf("%lf %lf %lf",&point[i].x,&point[i].y,&point[i].h);
double l = 0.0, r = 10000001.0;
for (int i = 1; i <= 40; i++) {
double mid = (l + r) / 2.0;
if ((prime (mid)))
r = mid;
else
l = mid;
}
printf("%.3lf\n", r);
}
}
- P1768
- 最优比率环:SPFA判断负环+二分(推式子)
//#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define sz(a) (int)a.size()
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define LF putchar('\n')
#define SP putchar(' ')
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)
template<typename T>
void read(T &x) {x = 0;char ch = getchar();ll f = 1;while(!isdigit(ch)){if(ch == '-')f *= -1;ch = getchar();}while(isdigit(ch)){x = x * 10 + ch - 48; ch = getchar();}x *= f;}
template<typename T, typename... Args>
void read(T &first, Args& ... args) {read(first);read(args...);}
template<typename T>
void write(T arg) {T x = arg;if(x < 0) {putchar('-'); x =- x;}if(x > 9) {write(x / 10);}putchar(x % 10 + '0');}
template<typename T, typename ... Ts>
void write(T arg, Ts ... args) {write(arg);if(sizeof...(args) != 0) {putchar(' ');write(args ...);}}
using namespace std;
ll gcd(ll a, ll b) {
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b) {
return a / gcd(a, b) * b;
}
const int N = 5e4 + 50;
int n , m;
int head[N] , cnt;
struct node {
int t, next;
double v , p;
}edge[N];
void add (int f, int t, double v, double p)
{
edge[cnt].t = t;
edge[cnt].v = v;
edge[cnt].p = p;
edge[cnt].next = head[f];
head[f] = cnt ++;
}
double dis[N];
int vis[N], times[N], in[N];
bool spfa (double x)
{
queue<int>q;
for (int i = 0 ; i <= n ; i ++)
dis[i] = 1000000000000.0 , vis[i] = times[i] = 0;
dis[0] = 0.0;
vis[0] = 1;
q.push(0);
while (!q.empty())
{
int u = q.front();
q.pop();
vis[u] = 0;
for (int i = head[u] ; i != -1 ; i = edge[i].next)
{
int t = edge[i].t;
double v = edge[i].v , p = edge[i].p;
double w = 1.0 * x * p - 1.0 * v;
if (dis[t] > dis[u] + w)
{
dis[t] = dis[u] + w;
times[t] = times[u] + 1;
if (times[t] >= n+1)
return true;
if (!vis[t])
q.push(t), vis[t] = 1;
}
}
}
return false;
}
bool topo()
{
int tot = 0;
queue <int> q;
for (int i = 1 ; i <= n ; i ++)
if (!in[i])
q.push(i), tot ++;
while (!q.empty())
{
int u = q.front();
q.pop ();
for (int i = head[u] ; i != -1 ; i = edge[i].next)
{
int t = edge[i].t;
in[t] --;
if (!in[t])
q.push(t), tot ++;
}
}
if (tot == n)
return true;
return false;
}
int main (void)
{
mem (head,-1);
read (n , m);
for (int i = 1 ; i <= m ; i ++)
{
int u , v;
double a, b;
scanf("%d %d %lf %lf",&u ,&v , &a , &b);
add (u , v , a, b);
in[v] ++;
}
for (int i = 1; i <= n ; i ++)
add (0 , i , 0 , 1000000);
if (topo())
{
printf("-1\n");
return 0;
}
double l = 0.0 , r = 200.0;
while (r - l > 1e-6)
{
double mid = (l+r)/2.0;
if(spfa(mid))
l=mid;
else
r=mid;
}
printf("%.1lf\n",l);
}