結果

問題 No.1045 直方体大学
ユーザー heno239heno239
提出日時 2020-05-01 22:05:54
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
MLE  
実行時間 -
コード長 3,902 bytes
コンパイル時間 1,793 ms
コンパイル使用メモリ 132,644 KB
実行使用メモリ 597,608 KB
最終ジャッジ日時 2024-06-07 09:07:45
合計ジャッジ時間 6,625 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 7 ms
7,424 KB
testcase_01 AC 6 ms
7,424 KB
testcase_02 AC 7 ms
7,808 KB
testcase_03 AC 6 ms
7,808 KB
testcase_04 AC 7 ms
7,808 KB
testcase_05 AC 11 ms
16,768 KB
testcase_06 AC 12 ms
16,512 KB
testcase_07 AC 11 ms
16,768 KB
testcase_08 MLE -
testcase_09 MLE -
testcase_10 MLE -
testcase_11 MLE -
testcase_12 MLE -
testcase_13 MLE -
testcase_14 MLE -
testcase_15 MLE -
testcase_16 MLE -
testcase_17 AC 9 ms
8,704 KB
testcase_18 MLE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll a, ll n, ll m = mod) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1<<18;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };

ll gcd(ll a, ll b) {
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}

int dp[1 << 16][48][48];
void solve() {
	int n; cin >> n;
	vector<int> a(n), b(n), c(n);
	vector<int> xs;
	rep(i, n) {
		cin >> a[i] >> b[i] >> c[i];
		xs.push_back(a[i]);
		xs.push_back(b[i]);
		xs.push_back(c[i]);
	}
	sort(all(xs));
	xs.erase(unique(all(xs)), xs.end());
	map<int, int> mp;
	rep(i, xs.size())mp[xs[i]] = i;
	vector<vector<int>> vs(n);
	rep(i, n) {
		a[i] = mp[a[i]];
		b[i] = mp[b[i]];
		c[i] = mp[c[i]];
		vs[i] = { a[i],b[i],c[i] };
		sort(all(vs[i]));
	}
	int len = xs.size();
	rep(i, (1 << n))rep(j, len)rep(k, j+1) {
		dp[i][j][k] = -mod;
	}
	dp[0][len - 1][len - 1] = 0;
	vector<int> v;
	int ans = 0;
	rep(i, (1 << n))rep(j, len)rep(k, j+1) {
		if (dp[i][j][k] < 0)continue;
		rep(t, n) {
			if (i&(1 << t))continue;
			int ni = i ^ (1 << t);
			v = vs[t];
			do {
				if (v[0] <= j && v[1] <= k&&v[0]>=v[1]) {
					dp[ni][v[0]][v[1]] = max(dp[ni][v[0]][v[1]], dp[i][j][k] + xs[v[2]]);
				}


			} while (next_permutation(all(v)));
		}
		ans = max(ans, dp[i][j][k]);
	}
	cout << ans << "\n";
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	//cout << fixed << setprecision(7);
	init_f();
	//init();
	//experi();
	//int t; cin >> t; rep(i, t)solve();
	solve();
	stop
		return 0;
}
0