結果
問題 | No.1045 直方体大学 |
ユーザー |
![]() |
提出日時 | 2020-05-02 13:58:01 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,162 bytes |
コンパイル時間 | 1,251 ms |
コンパイル使用メモリ | 113,260 KB |
実行使用メモリ | 28,044 KB |
最終ジャッジ日時 | 2024-12-29 22:50:00 |
合計ジャッジ時間 | 4,490 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 WA * 1 |
other | AC * 2 WA * 15 |
ソースコード
#include<iostream>#include<string>#include<algorithm>#include<vector>#include<queue>#include<map>#include<math.h>#include<iomanip>#include<set>#include<numeric>#include<cstring>#include<cstdio>#include<functional>#include<bitset>#include<limits.h>#include<cassert>#include<iterator>#include<complex>#include<stack>#include<unordered_map>#include<unordered_set>#include<time.h>#include<random>#include<array>using namespace std;using ll = long long;#define rep(i, a, b) for(int i = a; i < b; i++)#define rrep(i, a, b) for(int i = b - 1; i >= a; i--)#define ALL(a) a.begin(), a.end()using pii = pair<int,int>;using piii = pair<pii,int>;using pll = pair<long long, long long>;using plll = pair<pll, long long>;// #pragma GCC optimize("Ofast")#define pcnt __builtin_popcount#define buli(x) __builtin_popcountll(x)#define pb push_back#define mp make_pair#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );#define isSquare(x) (sqrt(x)*sqrt(x) == x)template<class T>bool chmax(T &a, const T &b) {if(a<b){a = b; return 1;} return 0; };template<class T>bool chmin(T &a, const T &b) {if(a>b){a = b; return 1;} return 0; };inline void in(void){return;}template <typename First, typename... Rest> void in(First& first, Rest&... rest){cin >> first;in(rest...);return;}inline void out(void){cout << "\n";return;}template <typename First, typename... Rest> void out(First first, Rest... rest){cout << first << " ";out(rest...);return;}const double EPS = 1e-9;const int mod = 1e9 + 7;const int INF = 1e9;const long long INFLL = 1e18;void iosetup() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(10);cerr << fixed << setprecision(10);}template< typename T1, typename T2 >ostream &operator<<(ostream &os, const pair< T1, T2 >& p) {os << p.first << " " << p.second;return os;}template< typename T1, typename T2 >istream &operator>>(istream &is, pair< T1, T2 > &p) {is >> p.first >> p.second;return is;}template< typename T >ostream &operator<<(ostream &os, const vector< T > &v) {for(int i = 0; i < (int) v.size(); i++) {os << v[i] << (i + 1 != v.size() ? " " : "");}return os;}template< typename T >istream &operator>>(istream &is, vector< T > &v) {for(T &in : v) is >> in;return is;}template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S, T>& t){return pair<S,T>(s.first+t.first, s.second+t.second);}template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S, T>& t){return pair<S,T>(s.first-t.first, s.second-t.second);}template<class S, class T> pair<S,T> operator*(const pair<S,T> &s, const S& t){return pair<S,T>(s.first*t, s.second*t);}template <typename T> void Exit(T first){cout << first << endl;exit(0); };template< int mod > struct ModInt {unsigned x; ModInt() : x(0) {}ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}ModInt &operator+=(const ModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}ModInt &operator-=(const ModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}ModInt &operator*=(const ModInt &p) {x = (int) (1LL * x * p.x % mod);return *this;}ModInt &operator/=(const ModInt &p) {*this *= p.inverse();return *this;}ModInt operator-() const { return ModInt(-x); }ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }bool operator==(const ModInt &p) const { return x == p.x; }bool operator!=(const ModInt &p) const { return x != p.x; }ModInt inverse() const {int a = x, b = mod, u = 1, v = 0, t;while(b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); }return ModInt(u);}ModInt pow(int64_t n) const {ModInt ret(1), mul(x); while(n > 0) {if(n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x;}friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt< mod >(t); return (is); }static int get_mod() { return mod; }}; using modint = ModInt< mod >;int A[16][3];int dp[1 << 16][16][6]; // dp[S][l][m] := 最後に載せたのがl,mはどの方向で載せるかを表すint dx[6] = {0, 0, 1, 1, 2, 2};int dy[6] = {1, 2, 0, 2, 0, 1};int dz[6] = {2, 1, 2, 0, 1, 0};int main(){iosetup();int N; cin >> N;rep(i, 0, N) rep(j, 0, 3) cin >> A[i][j];rep(i, 0, N) rep(j, 0, 6)dp[1 << i][i][j] = A[i][dx[j]];int ans = 0;rep(i, 1, 1 << N) rep(j, 0, N) rep(k, 0, 6){if(dp[i][j][k] == 0) continue;chmax(ans, dp[i][j][k]);rep(l, 0, N)if(not(i >> l & 1))rep(m, 0, 6){if(A[j][dx[k]] >= A[l][dx[m]] and A[j][dy[k]] >= A[k][dy[m]]){chmax(dp[i|1<<l][l][m], dp[i][j][k] + A[l][dz[m]]);}}}cout << ans << endl;return 0;}