Submission #1834209

---

Source Code Expand

#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL<<29;
const ll mod = 1e9+7;
#define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i))
#define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d))
#define all(v) (v).begin(), (v).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset((m),(v),sizeof(m))
#define chmin(X,Y) ((X)>(Y)?X=(Y),true:false)
#define chmax(X,Y) ((X)<(Y)?X=(Y),true:false)
#define fst first
#define snd second
#define UNIQUE(x) (x).erase(unique(all(x)),(x).end())
template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;}

#define N 33
int n, a[N][N];
double p, dp[N][N], dp2[N][N], dp3[N][N];
int main(){
	int x, y;
	scanf("%d %d/%d", &n, &x, &y);
	p = (double)x/y;
	rep(i, n) rep(j, n) scanf("%d", a[i]+j);
	vector<P> v(n);
	rep(i, n){
		int cnt = 0;
		rep(j, n) cnt += a[i][j];
		v[i] = P(-cnt, i);
	}
	sort(all(v));
	rep(i, n){
		mset(dp3, 0);
		dp3[0][0] = 1;
		rep(j, n-1){
			if(i==j) swap(a[i][j], a[i][n-1]);
			for(int k = n; k >= 0; k--){
				dp3[j+1][k+a[i][j]] += dp3[j][k]*p;
				dp3[j+1][k+!a[i][j]] += dp3[j][k]*(1-p);
			}
		}
		memcpy(dp[i], dp3[n-1], sizeof(dp[0]));
	}
	//rep(i, n) rep(j, n) cerr<<dp[i][j]<<(j==n-1?'\n':' ');
	for(int j = n; j >= 0; j--) dp2[v[0].snd][j] += dp2[v[0].snd][j+1]+dp[v[0].snd][j];
	rep(i, n-1){
		int i1 = v[i].snd;
		int i2 = v[i+1].snd;
		for(int j = n; j >=0; j--){
			int j1 = j+(i1>i2);
			dp2[i2][j] = dp[i2][j]*dp2[i1][j1]+dp2[i2][j+1];
		}
	}
	//rep(i, n) rep(j, n) cerr<<dp2[i][j]<<(j==n-1?'\n':' ');
	double res = 0;
	res = dp2[v[n-1].snd][0];
	cout.precision(11);
	cout<<res<<endl;
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:46:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d/%d", &n, &x, &y);
                               ^
./Main.cpp:48:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  rep(i, n) rep(j, n) scanf("%d", a[i]+j);
                                         ^

Judge Result