Submission #1678183


Source Code Expand

// need
#include <iostream>
#include <algorithm>

// data structure
#include <bitset>
//#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <array>
//#include <tuple>
//#include <unordered_map>
#include <unordered_set>
#include <complex>
//#include <deque>
#include <valarray>

// stream
//#include <istream>
//#include <sstream>
//#include <ostream>
//#include <fstream>

// etc
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
//#include <typeinfo>
#include <chrono>
#include <random>
#include <numeric>

// input
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;

// output
#define OUT(d) std::cout<<d;
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(i, n) std::cout<<(i + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define SHOW(d) {std::cerr << #d << "\t:" << d << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}

// utility
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns  (" << res / (1.0e9) << "s)]\n"; }

// test
template<class T> std::vector<std::vector<T>> VV(int n) {
	return std::vector<std::vector<T>>(n);
}
template<class T> std::vector<std::vector<T>> VV(int n, int m, T init = T()) {
	return std::vector<std::vector<T>>(n, std::vector<T>(m, init));
}
template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
	os << "(" << p.first << ", " << p.second << ")"; return os;
}

// type/const

#define int ll
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = 1 << 30;                          // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;              // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                          // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);  // 9.22x10^18
constexpr double EPS = 1e-7;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;

constexpr int MAX_COMB_N = 50;
int comb[MAX_COMB_N + 1][MAX_COMB_N + 1];
struct InitComb {
	InitComb() {
		comb[0][0] = 1;
		for (int i = 1; i <= MAX_COMB_N; ++i) {
			for (int j = 0; j <= i; ++j) {
				if (j == 0 || j == i) comb[i][j] = 1;
				else comb[i][j] = (comb[i - 1][j - 1] + comb[i - 1][j]) % MOD;
			}
		}
	}
}init_comb;

signed main() {
	INIT;
	VAR(int, n, p);
	std::cin.ignore();
	VAR(int, q);
	ld P = (ld)p / q;
	MAT(int, a, n, n);
	std::vector<int> b(n);
	std::vector<int> win(n, 0);
	{
		std::vector<PAIR> pv(n);
		REP(i, n) REP(j, n) {
			win[i] += a[i][j];
		}
		REP(i, n) pv[i] = PAIR(-win[i], i);
		std::sort(ALL(pv));
		REP(i, n) {
			win[i] = -pv[i].first;
			b[i] = pv[i].second;
		}
	}
	std::vector<int> c(n);
	{
		int ma = n - 1;
		c[0] = ma;
		FOR(i, 1, n) {
			if (b[i - 1] > b[i]) --ma;
			c[i] = ma;
		}
	}
	ld ans = 0;
	auto calc = [&](int base, int win) {
		ld sum = 0;
		int re = n - 1 - base;
		REP(i, win + 1) {
			int j = win - i;
			if (i > base || j > re) continue;
			sum += std::pow(P, i + (re - j)) * std::pow(1 - P, (base - i) + j) * comb[base][i] * comb[re][j];
		}
		return sum;
	};
	auto next = [&]() {
		int lp = n - 1;
		int p = n - 1;
		while (true) {
			p = lp;
			--c[p];
			while (c[p] < 0) {
				--lp;
				if (lp < 0) return false;
				--c[lp];
				p = lp;
			}
			while (++p < n) {
				c[p] = c[p - 1];
				if (b[p - 1] > b[p]) --c[p];
			}
			if (c[n - 1] < 0) continue;
			else return true;
		}
	};

	do {
		ld t = 1;
		REP(i, n) {
			t *= calc(win[i], c[i]);
		}
		ans += t;
	} while (next());
	FOUT(12, ans)BR;
	return 0;
}

Submission Info

Submission Time
Task C - 天下一プログラマーコンテスト1999
User satanic0258
Language C++14 (GCC 5.4.1)
Score 0
Code Size 6586 Byte
Status TLE
Exec Time 2103 ms
Memory 640 KB

Judge Result

Set Name All
Score / Max Score 0 / 600
Status
AC × 19
TLE × 24
Set Name Test Cases
All 00_sample_01, 00_sample_02, 00_sample_03, 00_sample_04, 02_manual_01, 02_manual_02, 02_manual_03, 02_manual_04, 02_manual_05, 02_manual_06, 02_manual_07, 02_manual_08, 02_manual_09, 02_manual_10, 02_manual_11, 02_manual_12, 20_random_00, 20_random_01, 20_random_02, 20_random_03, 20_random_04, 20_random_05, 20_random_06, 20_random_07, 20_random_08, 20_random_09, 20_random_10, 20_random_11, 20_random_12, 20_random_13, 20_random_14, 20_random_15, 20_random_16, 20_random_17, 20_random_18, 20_random_19, 30_manual_13, 30_manual_14, 30_manual_15, 30_manual_16, 30_manual_17, 30_manual_18, 30_manual_19
Case Name Status Exec Time Memory
00_sample_01 AC 6 ms 640 KB
00_sample_02 AC 1 ms 256 KB
00_sample_03 AC 1 ms 256 KB
00_sample_04 AC 1 ms 256 KB
02_manual_01 AC 1 ms 256 KB
02_manual_02 AC 1 ms 256 KB
02_manual_03 AC 1 ms 256 KB
02_manual_04 AC 1 ms 256 KB
02_manual_05 AC 1 ms 256 KB
02_manual_06 AC 1 ms 256 KB
02_manual_07 AC 1 ms 256 KB
02_manual_08 AC 1 ms 256 KB
02_manual_09 AC 1 ms 256 KB
02_manual_10 AC 1 ms 256 KB
02_manual_11 AC 1 ms 256 KB
02_manual_12 AC 1 ms 256 KB
20_random_00 TLE 2103 ms 256 KB
20_random_01 TLE 2103 ms 256 KB
20_random_02 TLE 2103 ms 256 KB
20_random_03 TLE 2103 ms 256 KB
20_random_04 TLE 2103 ms 256 KB
20_random_05 TLE 2103 ms 256 KB
20_random_06 TLE 2103 ms 256 KB
20_random_07 TLE 2103 ms 256 KB
20_random_08 TLE 2103 ms 256 KB
20_random_09 TLE 2103 ms 256 KB
20_random_10 TLE 2103 ms 256 KB
20_random_11 TLE 2103 ms 256 KB
20_random_12 TLE 2103 ms 256 KB
20_random_13 AC 32 ms 256 KB
20_random_14 AC 29 ms 256 KB
20_random_15 TLE 2103 ms 256 KB
20_random_16 TLE 2103 ms 256 KB
20_random_17 TLE 2103 ms 256 KB
20_random_18 TLE 2103 ms 256 KB
20_random_19 TLE 2103 ms 256 KB
30_manual_13 TLE 2103 ms 256 KB
30_manual_14 AC 2 ms 256 KB
30_manual_15 TLE 2103 ms 256 KB
30_manual_16 TLE 2103 ms 256 KB
30_manual_17 TLE 2103 ms 256 KB
30_manual_18 TLE 2103 ms 256 KB
30_manual_19 TLE 2103 ms 256 KB