csu 1806 & csu 1742 (simpson公式+最短路)

1806: Toll

Time Limit: 5 Sec  Memory Limit: 128 MB  Special Judge
Submit: 256  Solved: 74
[Submit][Status][Web Board]

Description

 In ICPCCamp, there are n cities and m unidirectional roads between cities. The i-th road goes from the a_i-th city to the b_i-th city. For each pair of cities u and v, there is at most one road from u to v.

As traffic in ICPCCamp is becoming heavier, toll of the roads also varies. At time t, one should pay (c_i⋅t+d_i) dollars to travel along the i-th road.

Bobo living in the 1-st city would like to go to the n-th city. He
wants to know the average money he must spend at least if he starts from
city 1 at t∈[0,T]. Note that since Bobo's car is super-fast, traveling on the roads costs him no time.

Formally, if f(t) is the minimum money he should pay from city 1 to city n at time t, Bobo would like to find

Input

The first line contains 3 integers n,m,T (2≤n≤10,1≤m≤n(n-1),1≤T≤10⁴).

The i-th of the following m lines contains 4 integers a_i,b_i,c_i,d_i (1≤a_i,b_i≤n,a_i≠b_i,0≤c_i,d_i≤10³).

It is guaranteed that Bobo is able to drive from city 1 to city n.

Output

 A floating number denotes the answer. It will be considered correct if its absolute or relative error does not exceed 10^-6.

Sample Input

3 3 2
1 2 1 0
2 3 1 0
1 3 1 1
3 3 2
1 2 1 0
2 3 1 0
1 3 0 5

Sample Output

1.75000000
2.00000000
 
这东西实在太好用了,可惜省赛不会...simpson公式就是求定积分用的,这题的F函数就是在时间点为 t 时从 1点到n点的最小花费.

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const double INF = ;
struct Edge{
    int v,next;
    int c,d;
}edge[];
int head[],tot;
int n,m,T;
void init(){
    memset(head,-,sizeof(head));
    tot = ;
}
void addEdge(int u,int v,int c,int d,int &k){
    edge[k].v = v,edge[k].c = c,edge[k].d = d,edge[k].next = head[u],head[u] = k++;
}
double dis[];
bool vis[];
double F(double x){
    for(int i=;i<=n;i++){
        dis[i] = INF;
        vis[i] = false;
    }
    dis[] = ;
    queue<int> q;
    q.push();
    while(!q.empty()){
        int u = q.front();
        q.pop();
        vis[u] = false;
        for(int k = head[u];k!=-;k = edge[k].next){
            int v = edge[k].v,c = edge[k].c,d = edge[k].d;
            double t = x*c+d;
            if(dis[v]>dis[u]+t){
                dis[v] = dis[u]+t;
                if(!vis[v]){
                    vis[v] = true;
                    q.push(v);
                }
            }
        }
    }
    double ret = dis[n];
    return ret;
}
// 三点simpson法。这里要求F是一个全局函数
double simpson(double a,double b){
    double c =  a+(b-a)/;
    return (F(a) + *F(c) + F(b))*(b-a)/;
}
// 自适应Simpson公式（递归过程）。已知整个区间[a,b]上的三点simpson值A
double asr(double a , double b ,double eps ,double A){
    double c = a+ (b-a)/;
    double L = simpson(a,c) ,R = simpson(c,b);
    if(fabs(A-L-R)<=*eps) return L + R +(A-L-R)/;
    return asr(a,c,eps/,L) + asr(c,b,eps/,R);
}
// 自适应Simpson公式（主过程）
double asr(double a, double b, double eps) {
  return asr(a, b, eps, simpson(a, b));
}
 
int main()
{
    while(scanf("%d%d%d",&n,&m,&T)!=EOF){
        init();
        for(int i=;i<m;i++){
            int u,v,c,d;
            scanf("%d%d%d%d",&u,&v,&c,&d);
            addEdge(u,v,c,d,tot);
        }
        double ans = asr(,T,1e-)/T;
        printf("%.8lf\n",ans);
    }
    return ;
}

csu 1742

1742: Integral Function

Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 79  Solved: 27
[Submit][Status][Web Board]

Description

In mathematics, several function are unable to integral. For example:

aaarticlea/png;base64,iVBORw0KGgoAAAANSUhEUgAAAX8AAADYAQMAAAA55HHGAAAABlBMVEX///8AAABVwtN+AAAFC0lEQVR4nO3ZMY/kNBQAYFs+XZq9CeWedEz+wnTsitXkr2xHySKaQawmOa0EDTr+Ab+DAomgK7Y56Voq5BMFraVrXFgx7zlxknHsxIZDRzFPKyXK5Jt1PM6z80LIOc5xjnP8z4MKu/ek29QrgEm796Lb8BWQKbt36DZ30aBv200soE233caCrO62eSywJ2bNMhh6yTaF8WUw/A57e2AFDDH0jlg4aRoHuyOXzprEcN593PnjmNqvfB4JCu4cGHuz9P+HMCjiQDaC2gdY4xzIhwN5MnA/GgFVcFteEVaX9SowgznTPxAqodGakwJPu8Ixm/MgyLUimSTVSy3MpcJQh80CKJgipWT6ey0JtIqULSkbkokg2BNFvpRP9Y8jqELA3F/3MKaxST9BWxBQTXQQ4O95AAB3XPkzNK3Cf1lRBPPxDT9Njt8oIXkhELQH5cNbLyg52UJjB8ApNN588MBqH4Be3D5yBBcGNKQHxXdkmjxtUOiUAken6kE9gFcBoMiWGvBkANqANwiUCxiAPYLWBfnvXpABuEGga5IGKu4CEQQHA6QDMj/ICwmgMWPHAdwP4IsODEABFxEDNvAbCAQ53DgxABO7YNhD8JOfAOa/BgPwhsBfMBbwDPeqNqqXtpjHNrhXJIALc4I+Bc9kGFziHo0DJYKd2dX1yfB+bsBseGM+v+ME1yHVKbhWQWBSdA3nDgAP7MLARAPuBNxisp3f016AWYRw9XQRcAfQpr0gnkQ2BWQKWL0CxCnIHurj5SKQkI4tgPkhf0uOu3G243PQkuMJaM1d3s8PlQfolwonkaqBIQITVa4wifZTFtONB8ANBF+rOdM1ApM17RxXTkDd7zzCLVrpR60KLaDlWTdx9aDwgFqPPQGANQTvkn5in8zv5bg7xmzpsApEIpgtfyZn+cEw5CwYP/OC2RJuFQxLvX61WK0Bdxl6XAN2ZWyvfgIqL7Brb7tWWwV2dc+abjvJTn5gT7RwFdimbEgkcB5p6CR3VI0XXHWbQzQ4eSwrfpOwd7MITh789DtZCNu1ATANxt8LWMLoaJDVnwOg8aAghcgUiwd7eF6gKosH95jO2ryMBtKAi00sgCEO2el4SWIB5BwEV9EAnkch8VW7aJAbUN5GA0hi8JcCjBnytwWlDoQsTaYoXFCFQLs3eWzIruvgaPJYArj3g3AonDDH57MPDyABwCPIvJeWAEsG0KrPeCyA1UGWBgTZAPgiBeD68i+RAD4F8DoFXEPPPohP4sFXsO5/EJexQJI/xW3G5C4a0Nei2SQABc35Y0PlbSSgbc7e/XpDZRMLdJu9LyF515GAaJW1pSADqNdAJZmC9aJdsPmXDtMoOZMwuO1iYB3kNeX5MK9GAPcfnsEZfCzgL0aewb8FuORq0kD+dSK4nDyargekqJ2/khwGd6mAu+Bq6VXIhtDG+birFgdCbghzQVct9gdTAOo5CE4zrN3C84RT0e+qxf7I9Au4QPf1kKkWh4AC4L6VMNXiEJBegJXCINhOn2VNmGpxCAgA7qsYUy32B9McwC8ueLMAGrKl7ls3U/z1By4ICnaoowFeb/HqG/c/iDDAj+W3zhH/K4HJ97ndOr7V8QZrDs6RFTCPZDBWi/4rsNJLHwA8i32T+I/B81RwPStFr8QuFZhqcUqYanFCdNXihOiqxfHRV4vjo68WJ4B2WiKOAV21OAHI8Hzijb5aHB+sGcp75zjHOT5m/A188CFzlzTsVAAAAABJRU5ErkJggg==" alt="" name="图片 1" width="113" height="64" align="bottom" border="0" data-pagespeed-url-hash="2268721189" />

But you can get the answer by computer.

Input

There are no more than T (T<=30) cases. Each case include two integer a, b (0<a <= b<=10).

Output

Each case output an answer.

(Please output the answer by ‘‘ printf (“%d\n”,(int)(answer*10000)) ‘‘ ).

Sample Input

1 1
1 2
2 8

Sample Output

0
6593
-312
 
这题更好用..直接带进去算

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
 
double F(double x){
    return sin(x)/x;
}
// 三点simpson法。这里要求F是一个全局函数
double simpson(double a,double b){
    double c =  a+(b-a)/;
    return (F(a) + *F(c) + F(b))*(b-a)/;
}
// 自适应Simpson公式（递归过程）。已知整个区间[a,b]上的三点simpson值A
double asr(double a , double b ,double eps ,double A){
    double c = a+ (b-a)/;
    double L = simpson(a,c) ,R = simpson(c,b);
    if(fabs(A-L-R)<=*eps) return L + R +(A-L-R)/;
    return asr(a,c,eps/,L) + asr(c,b,eps/,R);
}
// 自适应Simpson公式（主过程）
double asr(double a, double b, double eps) {
  return asr(a, b, eps, simpson(a, b));
}
 
int main()
{
    double a,b;
    while(scanf("%lf%lf",&a,&b)!=EOF){
        printf("%d\n",(int)(asr(a,b,1e-)*));
    }
    return ;
}