結果
| 問題 | No.753 最強王者決定戦 |
| ユーザー |
 jell
|
| 提出日時 | 2018-12-03 18:22:31 |
| 言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 339 ms / 1,000 ms |
| コード長 | 5,766 bytes |
| コンパイル時間 | 1,063 ms |
| コンパイル使用メモリ | 114,792 KB |
| 実行使用メモリ | 44,648 KB |
| 最終ジャッジ日時 | 2023-09-17 01:48:12 |
| 合計ジャッジ時間 | 3,622 ms |
|
ジャッジサーバーID （参考情報） |
judge14 / judge12 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 338 ms
44,648 KB |
| testcase_01 | AC | 339 ms
44,468 KB |
| testcase_02 | AC | 339 ms
44,408 KB |
| testcase_03 | AC | 339 ms
44,416 KB |
コンパイルメッセージ
main.cpp:132:26: 警告: use of ‘auto’ in parameter declaration only available with ‘-std=c++20’ or ‘-fconcepts’
132 | i64 bins(i64 ok, i64 ng, auto judge) {
| ^~~~
ソースコード
/*
#include <boost/functional/hash.hpp>
#include <boost/multiprecision/cpp_int.hpp>
typedef boost::multiprecision::cpp_int mlint;
*/
#include <cassert>
#include <deque>
#include <queue>
#include <stack>
#include <algorithm>
#include <iostream>
#include <set>
#include <map>
#include <list>
#include <cmath>
#include <complex>
#include <functional>
#include <random>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <iomanip>
using namespace std;
typedef int64_t i64;
typedef double db;
typedef vector<vector<int64_t>> mat;
typedef pair<int,int> pii;
typedef pair<int64_t,int> pli;
typedef pair<db,int> pdi;
#define esc(x) cout << (x) << endl,exit(0)
#define inf(T) (numeric_limits<T>::max() / 2 - 1)
#define each(i,v) for(auto i = begin(v); i != end(v); ++i)
#define reach(i,v) for(auto i = rbegin(v); i != rend(v); ++i)
#define urep(i,s,t) for(int64_t i = (s); i <= (t); ++i)
#define drep(i,s,t) for(int64_t i = (s); i >= (t); --i)
#define rep(i,n) urep(i,0,(n) - 1)
#define rep1(i,n) urep(i,1,(n))
#define rrep(i,n) drep(i,(n) - 1,0)
#define all(v) begin(v),end(v)
#define rall(v) rbegin(v),rend(v)
#define vct vector
#define prque priority_queue
#define u_map unordered_map
#define u_set unordered_set
#define l_bnd lower_bound
#define u_bnd upper_bound
#define rsz resize
#define ers erase
#define emp emplace
#define emf emplace_front
#define emb emplace_back
#define pof pop_front
#define pob pop_back
#define mkp make_pair
#define mkt make_tuple
#define fir first
#define sec second
struct setupper {
setupper(uint8_t prec) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(prec);
#ifdef Local
#define debug 1
#define print(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
cout << "-- Execution At Local ---\n" << "\n<Standard Output>\n\n";
auto print_atexit = []() {
time_t end_time = time(NULL);
struct tm *ret = localtime(&end_time);
cout << "\n----------------\n";
cout << "\nSuccessfully Executed At " << (ret -> tm_hour) << ":" << (ret -> tm_min) << ":" << (ret -> tm_sec) << "\n\n";
};
atexit(print_atexit);
#endif
}
} setupper_obj(10);
template <class T, class U> ostream& operator << (ostream &s, pair<T,U> p) { return s << p.fir << " " << p.sec; }
template <class T> ostream& operator << (ostream &s, vector<T> &v) { for(auto i = v.begin(); i != v.end(); ++i) { if(i != begin(v)) s << " "; s << *i; } return s; }
template <class T> void hash_combine(size_t &seed, T const &key) {
hash<T> hasher;
seed ^= hasher(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
}
namespace std {
template <class T, class U> struct hash<pair<T,U>> {
size_t operator()(pair<T,U> const &p) const {
size_t seed(0);
hash_combine(seed,p.first);
hash_combine(seed,p.second);
return seed;
}
};
template <class T, class U, class V> struct hash<tuple<T,U,V>> {
size_t operator()(tuple<T,U,V> const &t) const {
size_t seed(0);
hash_combine(seed,get<0>(t));
hash_combine(seed,get<1>(t));
hash_combine(seed,get<2>(t));
return seed;
}
};
}
const auto add = [](auto &x, auto y) { x += y; };
const auto mul = [](auto &x, auto y) { x *= y; };
const auto lam_min = [](auto x, auto y) { return min(x,y); };
const auto lam_max = [](auto x, auto y) { return max(x,y); };
const auto chmax = [](auto &m, auto x) { if(m < x){ m = x; return true; } return false; };
const auto chmin = [](auto &m, auto x) { if(m > x){ m = x; return true; } return false; };
bool odd(i64 x) { return x & 1; }
bool even(i64 x) { return !odd(x); }
bool bit(i64 n, uint8_t e) { return n >> e & 1; }
i64 mask(i64 n, uint8_t e) { return n & (1 << e) - 1; }
int ilog(i64 x, uint64_t b = 2) { if(x) return ilog(x / b, b) + 1; return -1; }
i64 qceil(i64 x, i64 y) { return x > 0 ? (x - 1) / y + 1 : x / y; }
i64 gcd(i64 a, i64 b) { if(!b) return abs(a); return gcd(b, a % b); }
i64 lcm(i64 a, i64 b) { if(a | b) return abs(a / gcd(a, b) * b); return 0; }
i64 extgcd(i64 a, i64 b, i64 &x, i64 &y) {
i64 d = a;
if(b) {
d = extgcd(b,a % b,y,x);
y -= (a / b) * x;
} else {
x = 1,y = 0;
}
return d;
}
i64 bins(i64 ok, i64 ng, auto judge) {
while(abs(ok - ng) > 1) {
i64 mid = ok + ng >> 1;
(judge(mid) ? ok : ng) = mid;
}
return ok;
}
template <class T> T cmprs(T &v) {
T tmp = v,ret = v;
sort(all(tmp));
tmp.erase(unique(all(tmp)),end(tmp));
each(i,ret) *i = l_bnd(all(tmp),*i) - begin(tmp) + 1;
return ret;
}
const int dx[9] = {1,0,-1,0,1,-1,-1,1,0};
const int dy[9] = {0,1,0,-1,1,1,-1,-1,0};
const i64 mod = 1e9 + 7;
const db gold = sqrt(1.25) + 0.5;
const db eps = 1e-15;
int nxt(int s) {
int b=s&-s;
int t=s+b;
int u=s&~t;
return t+(u/b>>1);
}
int pw2[17];
int win[17][17];
vct<int> mem[4];
i64 dp[5][17][1<<16];
int main() {
pw2[0]=1;
rep(i,16) pw2[i+1]=pw2[i]<<1;
rep(i,16)rep(j,16) cin>>win[i][j];
rep(i,16)rep(j,i) win[i][j]=-win[j][i];
rep(i,16) dp[0][i][pw2[i]]=1;
rep(i,4) for(int s=pw2[pw2[i]]-1;s<pw2[16];s=nxt(s)) mem[i].emb(s);
rep(i,4) {
for(int s:mem[i]) {
for(int t:mem[i]) {
if(s&t) continue;
rep(j,16) {
if(!bit(s,j)) continue;
rep(k,16) {
if(!bit(t,k)) continue;
dp[i+1][win[j][k]>0?j:k][s|t]+=dp[i][j][s]*dp[i][k][t];
}
}
}
}
}
rep(i,16) cout<<dp[4][i][(1<<16)-1]<<endl;
}