这篇博客写得不错,我没有思路和debug的时候都是参考这篇博客的,所以题意和思路就不写了。
http://972169909-qq-com.iteye.com/blog/1689107
坑点:m可能大于n呀,没考虑这点,WA到死。
题目地址:
http://acm.hdu.edu.cn/showproblem.php?pid=4418
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <vector>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define rep(i,a,b) for(int i = (a) ; i <= (b) ; i ++)
#define rrep(i,a,b) for(int i = (b) ; i >= (a) ; i --)
#define repS(it,p) for(auto it = p.begin() ; it != p.end() ; it ++)
#define repE(p,u) for(Edge * p = G[u].first ; p ; p = p -> next)
#define cls(a,x) memset(a,x,sizeof(a))
#define eps 1e-8
using namespace std;
const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const int MAXE = 2e5+5;
typedef long long LL;
typedef unsigned long long ULL;
int T,n,m;
int X,Y,D;
int fx[] = {0,1,-1,0,0};
int fy[] = {0,0,0,-1,1};
const int MAXN = 205;
double a[MAXN][MAXN],x[MAXN];
int equ ;
void debug() {
rep(i,1,equ) {
rep(j,1,equ) {
printf("%f ",a[i][j]);
}
printf("= %f\n",x[i]);
}
puts("");
}
bool gauss() {
rep(i,1,equ) {
int maxd = i;
rep(j,i+1,equ) if(fabs(a[maxd][i])<fabs(a[j][i])) maxd = j;
if(fabs(a[maxd][i])<eps) return false;
if(maxd != i) {
rep(j,i,equ) swap(a[maxd][j],a[i][j]);
swap(x[maxd],x[i]);
}
rep(j,i+1,equ) {
double rate = a[j][i] / a[i][i];
rep(k,i,equ) {
a[j][k] -= rate * a[i][k];
}
x[j] -= rate * x[i];
}
}
rrep(i,1,equ) {
rep(j,i+1,equ) {
x[i] -= a[i][j] * x[j];
}
x[i] /= a[i][i];
}
return true;
}
bool vis[205];
int idx[205];
double rate[205];
double sum;
queue<int>q;
bool BFS() {
cls(vis,0); cls(a,0); cls(x,0);
while(!q.empty()) q.pop();
if(D == 1) X = (n - X) % n;
q.push(X);
idx[X] = 1; vis[X] = true; equ = 0;
int count = 1;
bool flg = false;
while(!q.empty()) {
int tmp = q.front(); q.pop();
++ equ;
if(tmp == Y || tmp == n - Y) {
a[equ][idx[tmp]] = 1;
x[equ] = 0;
flg = true;
continue;
}
x[equ] = -sum;
a[equ][idx[tmp]] = -1;
rep(i,1,m) {
int pos = ( tmp + i) % n;
if(fabs(rate[i]) < eps) continue;
if(!vis[pos]) {
vis[pos] = true;
idx[pos] = ++count;
q.push(pos);
}
a[equ][idx[pos]] += rate[i];
}
}
return flg;
}
void input() {
scanf("%d %d %d %d %d",&n,&m,&Y,&X,&D);
sum = 0;
rep(i,1,m) {
scanf("%lf",&rate[i]); rate[i] /= 100.0;
sum += rate[i] * i;
}
}
void solve() {
n = 2 * n - 2;
if(!BFS()) {
puts("Impossible !");
}
else {
if(!gauss()) {puts("Impossible !");}
else printf("%.2f\n",x[1]);
}
}
int main(void) {
scanf("%d",&T); while(T--) {
input();
solve();
}
return 0;
}