看着很神的一个题,每条边的权值随时间变化,问你对于每个时间点的,最小花费的平均值
一个积分题,函数表达式推不出,那么如何解呢
自适应simpson积分帮助您
只要自己写一下F函数,然后调用自适应simpson即可
知道左右界和精度即可
代码:
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <string>
#include <vector>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <sstream>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#pragma comment(linker,"/STACK:102400000,102400000")
using namespace std;
#define MAX 100005
#define MAXN 1000005
#define maxnode 205
#define sigma_size 2
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define lrt rt<<1
#define rrt rt<<1|1
#define middle int m=(r+l)>>1
#define LL long long
#define ull unsigned long long
#define mem(x,v) memset(x,v,sizeof(x))
#define lowbit(x) (x&-x)
#define pii pair<int,int>
#define bits(a) __builtin_popcount(a)
#define mk make_pair
#define limit 10000
//const int prime = 999983;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f;
//const double pi = acos(-1.0);
const double inf = 1e18;
//const double eps = 1e-9;
const LL mod = 1e9+7;
const ull mx = 133333331;
/*****************************************************/
inline void RI(int &x) {
char c;
while((c=getchar())<'0' || c>'9');
x=c-'0';
while((c=getchar())>='0' && c<='9') x=(x<<3)+(x<<1)+c-'0';
}
/*****************************************************/
struct Edge{
int v,next;
double c;
}edge[105];
int head[15];
int tot;
int a[105],b[105],c[105],d[105];
double dis[15];
int vis[15];
int n,m;
void init(){
mem(head,-1);
mem(vis,0);
tot=0;
}
void add_edge(int a,int b,double c){
edge[tot]=(Edge){b,head[a],c};
head[a]=tot++;
}
double spfa(int s,int t){
for(int i=1;i<=n;i++) dis[i]=INF;
dis[s]=0;
vis[s]=1;
queue<int> q;
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].v;
if(dis[v]>dis[u]+edge[i].c){
dis[v]=dis[u]+edge[i].c;
if(!vis[v]){
vis[v]=1;
q.push(v);
}
}
}
}
return dis[t];
}
double F(double t){
init();
for(int i=1;i<=m;i++){
add_edge(a[i],b[i],c[i]*t+d[i]);
}
return spfa(1,n);
}
double simpson(double a,double b){
double c=a+(b-a)/2;
return (F(a)+4*F(c)+F(b))*(b-a)/6;
}
double asr(double a,double b,double eps,double A){
double c=a+(b-a)/2;
double L=simpson(a,c),R=simpson(c,b);
if(fabs(L+R-A)<=15*eps) return L+R+(L+R-A)/15.0;
return asr(a,c,eps/2,L)+asr(c,b,eps/2,R);
}
double asr(double a,double b,double eps){
return asr(a,b,eps,simpson(a,b));
}
int main(){
//freopen("in.txt","r",stdin);
int T;
while(cin>>n>>m>>T){
for(int i=1;i<=m;i++) scanf("%d%d%d%d",&a[i],&b[i],&c[i],&d[i]);
printf("%.6f\n",asr(0,T,1e-6)/T);
}
return 0;
}