POJ3615 超多次输入输出数据 Scanf比cin速度快很多（最短路 Floyd）

0）这是个裸的Floyd，但是因为用了cin而不是scanf，一晚都在超时！

scanf的读取速度比cin快，对于有些输入次数很多的题，用cin会超时（cout与printf速度相比，printf速度比cout更快，下面这个题如果输入全部用scanf，那么输出全为printf速度是400到500ms，如果输出全为cout，那么虽然也能ac不超时，但是会在800到900ms），比如下面这个题，1)是用scanf，时间400ms左右，2）是部分用scanf，部分用cin，时间是800ms左右，3）如果再把剩下的任何一个scanf改成cin，就会超时

//头文件多写没事，不会明显的影响速度

1)

#include <iostream>
#include <string.h>
#include <stdio.h>
using namespace std;
const int maxn=330;
const int INF=99999999;
int cost[maxn][maxn];//存储边的高度
int d[maxn][maxn];//存储点到点的最低高度
int main()
{
    int n,m,t;
while(scanf("%d%d%d",&n,&m,&t)!=EOF){
    int a,b,h;
    //memset()
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            if(i==j){
                cost[i][j]=0;
            }
            else
                cost[i][j]=INF;//问题！
            //d[i][j]=INF;
        }
    }
    for(int i=1;i<=m;i++){
        scanf("%d%d%d",&a,&b,&h);
        cost[a][b]=h;
    }
    for(int k=1;k<=n;k++){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){

                int cur=max(cost[i][k],cost[k][j]);
                if(cost[i][j]>cur){
                    cost[i][j]=cur;
                }

            }
        }
    }

    for(int i=1;i<=t;i++){
        scanf("%d%d",&a,&b);
        if(cost[a][b]<INF){
            cout<<cost[a][b]<<endl;
        }
        else{
            cout<<"-1"<<endl;
        }
    }
}
    return 0;
}

2）

#include <iostream>
#include <string.h>
#include <stdio.h>
using namespace std;
const int maxn=330;
const int INF=99999999;
int cost[maxn][maxn];//存储边的高度
int d[maxn][maxn];//存储点到点的最低高度
int main()
{
    int n,m,t;
while(cin>>n){
    cin>>m>>t;
    int a,b,h;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
                cost[i][j]=INF;//问题！
            //d[i][j]=INF;
        }
    }
    for(int i=1;i<=m;i++){
    	scanf("%d%d",&a,&b);
        cin>>cost[a][b];//scanf("%d",&cost[a][b]);
    }
    for(int k=1;k<=n;k++){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){

                int cur=max(cost[i][k],cost[k][j]);
                if(cost[i][j]>cur){
                    cost[i][j]=cur;
                }

            }
        }
    }

    for(int i=1;i<=t;i++){
        scanf("%d%d",&a,&b);
        if(cost[a][b]<INF){
            cout<<cost[a][b]<<endl;
        }
        else{
            cout<<"-1"<<endl;
        }
    }
}
    return 0;
}

3)

B - B

Time Limit:1000MS    Memory Limit:65536KB    64bit IO Format:%I64d & %I64u

Submit Status Practice POJ 3615

Description

Farmer John wants the cows to prepare for the county jumping competition, so Bessie and the gang are practicing jumping over hurdles. They are getting tired, though, so they want to be able to use as little energy as possible to jump over the hurdles.

Obviously, it is not very difficult for a cow to jump over several very short hurdles, but one tall hurdle can be very stressful. Thus, the cows are only concerned about the height of the tallest hurdle they have to jump over.

The cows' practice room has N (1 ≤ N ≤ 300) stations, conveniently labeled 1..N. A set ofM (1 ≤M ≤ 25,000) one-way paths connects pairs of stations; the paths are also conveniently labeled 1..M. Pathi travels from stationS_i to station E_i and contains exactly one hurdle of heightH_i (1 ≤H_i ≤ 1,000,000). Cows must jump hurdles in any path they traverse.

The cows have T (1 ≤ T ≤ 40,000) tasks to complete. Task i comprises two distinct numbers, A_i and B_i (1 ≤A_i ≤N; 1 ≤ B_i ≤ N), which connote that a cow has to travel from stationA_i to stationB_i (by traversing over one or more paths over some route). The cows want to take a path the minimizes the height of the tallest hurdle they jump over when traveling fromA_i toB_i . Your job is to write a program that determines the path whose tallest hurdle is smallest and report that height.
　

Input

* Line 1: Three space-separated integers: N, M, and T
* Lines 2..M+1: Line i+1 contains three space-separated integers:S_i ,E_i , and H_i
* Lines M+2..M+T+1: Line i+M+1 contains two space-separated integers that describe task i:A_i andB_i

Output

* Lines 1..T: Line i contains the result for task i and tells the smallest possible maximum height necessary to travel between the stations. Output -1 if it is impossible to travel between the two stations.

Sample Input

5 6 3
1 2 12
3 2 8
1 3 5
2 5 3
3 4 4
2 4 8
3 4
1 2
5 1

Sample Output

4
8
-1