結果
問題 | No.1360 [Zelkova 4th Tune] 協和音 |
ユーザー |
|
提出日時 | 2021-01-22 21:26:08 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 90 ms / 2,000 ms |
コード長 | 8,803 bytes |
コンパイル時間 | 2,372 ms |
コンパイル使用メモリ | 202,684 KB |
最終ジャッジ日時 | 2025-01-18 03:38:15 |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 47 |
ソースコード
// URL : https://yukicoder.me/problems/no/1360#pragma region optimize// #pragma GCC optimize("Ofast")// #pragma GCC optimize("unroll-loops")// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")#pragma endregion#include <bits/stdc++.h>using namespace std;// #include <atcoder/all>#pragma region boost multiprecision// #include <boost/multiprecision/cpp_dec_float.hpp>// #include <boost/multiprecision/cpp_int.hpp>// using Bint = boost::multiprecision::cpp_int;// using Bfloat32 = boost::multiprecision::number<boost::multiprecision::cpp_dec_float<32>>;// using Bfloat1024 = boost::multiprecision::number<boost::multiprecision::cpp_dec_float<1024>>;#pragma endregion// #define int long long// #define endl '\n'#pragma region TEMPLATE// clang-format off/* TYPE */typedef long long ll; typedef long double ld;typedef pair<int, int> pii; typedef pair<ll, ll> pll;typedef vector<pii> vpii; typedef vector<pll> vpll;typedef vector<int> vi; typedef vector<ll> vl;typedef vector<string> vst; typedef vector<bool> vb;typedef vector<ld> vld; typedef vector<vector<int>> vvi;template<typename T, typename Cmp = less<>> using prique = priority_queue<T, vector<T>, Cmp>;template<typename T> using prique_r = prique<T, greater<>>;/* CONSTANT */#define ln '\n'const int INF = 1 << 30; const ll INFF = 1LL << 60; const string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";const int MOD = 1e9 + 7; const int MODD = 998244353; const string alphabet = "abcdefghijklmnopqrstuvwxyz";const double EPS = 1e-9; const ld PI = 3.14159265358979323846264338327950288;const int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1, 0 };const int dy[] = { 0, 1, 0, -1, -1, -1, 1, 1, 0 };/* CONTAINER */#define PB emplace_back#define ALL(v) (v).begin(), (v).end()#define RALL(v) (v).rbegin(), (v).rend()#define SORT(v) sort(ALL(v))#define RSORT(v) sort(RALL(v))#define LESS(x, val) (lower_bound(x.begin(), x.end(), val) - x.begin())#define LEQ(x, val) (upper_bound(x.begin(), x.end(), val) - x.begin())#define GREATER(x, val) (int)(x).size() - LEQ((x), (val))#define GEQ(x, val) (int)(x).size() - LESS((x), (val))#define UNIQUE(v) sort(ALL(v)); (v).erase(unique(ALL(v)), (v).end())template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }template<typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...)); }template<typename T, typename U, typename... V> enable_if_t<is_same<T, U>::value != 0> fill_v(U &u, const V... v) { u = U(v...); }template<typename T, typename U, typename... V> enable_if_t<is_same<T, U>::value == 0> fill_v(U &u, const V... v) { for (auto &e : u) fill_v<T>(e, v...); }/* LOOP */#define _overload3(_1, _2, _3, name, ...) name#define _REP(i, n) REPI(i, 0, n)#define REPI(i, a, b) for (ll i = (ll)a; i < (ll)b; ++i)#define REP(...) _overload3(__VA_ARGS__, REPI, _REP,)(__VA_ARGS__)#define _RREP(i, n) RREPI(i, n, 0)#define RREPI(i, a, b) for (ll i = (ll)a; i >= (ll)b; --i)#define RREP(...) _overload3(__VA_ARGS__, RREPI, _RREP,)(__VA_ARGS__)#define EACH(e, v) for (auto& e : v)#define PERM(v) sort(ALL(v)); for (bool c##p = true; c##p; c##p = next_permutation(ALL(v)))/* INPUT */template<typename T> void SSS(T& t) { cin >> t; }template<typename Head, typename... Tail> void SSS(Head&& head, Tail&&... tail) { cin >> head; SSS(tail...); }#define SS(T, ...) T __VA_ARGS__; SSS(__VA_ARGS__);#define SV(T, v, n) vector<T> v(n); for (auto& i : v) cin >> i;#define SVV(T, v, n, m) vector<vector<T>> v(n, vector<T>(m)); for (auto& r : v) for (auto& i : r) cin >> i;/* OUTPUT */// Yes / Noinline int YES(bool x) { cout << (x ? "YES" : "NO") << endl; return 0; }inline int Yes(bool x) { cout << (x ? "Yes" : "No") << endl; return 0; }inline int yes(bool x) { cout << (x ? "yes" : "no") << endl; return 0; }inline int yES(bool x) { cout << (x ? "yES" : "nO") << endl; return 0; }inline int Yay(bool x) { cout << (x ? "Yay!" : ":(") << endl; return 0; }// PROTOTYPE DECLARATIONtemplate<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &j);template<typename... T> ostream &operator<<(ostream &os, const tuple<T...> &t);template<class C, enable_if_t<!is_same<C, string>::value, decltype(declval<const C &>().begin(), nullptr)> = nullptr> ostream& operator<<(ostream &os, const C &c);template<typename T> ostream &operator<<(ostream &os, const stack<T> &j);template<typename T> ostream &operator<<(ostream &os, const queue<T> &j);template<typename T, typename C, typename Cmp> ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j);// IMPLEMENTATIONtemplate<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &j) { return os << '{' << j.first << ", " << j.second << '}'; }template<size_t num = 0, typename... T> enable_if_t<num == sizeof...(T)> PRINT_TUPLE(ostream &os, const tuple<T...> &t) {}template<size_t num = 0, typename... T> enable_if_t<num < sizeof...(T)> PRINT_TUPLE(ostream &os, const tuple<T...> &t) { os << get<num>(t); if (num+ 1 < sizeof...(T)) os << ", "; PRINT_TUPLE<num + 1>(os, t); }template<typename... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { PRINT_TUPLE(os << '{', t); return os << '}'; }template<class C, enable_if_t<!is_same<C, string>::value, decltype(declval<const C &>().begin(), nullptr)>> ostream& operator<<(ostream &os, const C&c) { os << '{'; for (auto it = begin(c); it != end(c); it++) { if (begin(c) != it) os << ", "; os << *it; } return os << '}'; }template<typename T> ostream &operator<<(ostream &os, const stack<T> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_front(c.top());return os << d; }template<typename T> ostream &operator<<(ostream &os, const queue<T> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_back(c.front());return os << d; }template<typename T, typename C, typename Cmp> ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_front(c.top()); return os << d; }// OUTPUT FUNCTIONtemplate<typename T> int PV(T &v) { int sz = v.size(); for (int i = 0; i < sz; ++i) cout << v[i] << " \n"[i == sz - 1]; return 0; }inline int print() { cout << endl; return 0; }template<typename Head> int print(Head&& head){ cout << head; return print(); }template<typename Head, typename... Tail> int print(Head&& head, Tail&&... tail) { cout << head << " "; return print(forward<Tail>(tail)...); }#ifdef LOCALinline void dump() { cerr << endl; }template<typename Head> void dump(Head&& head) { cerr << head; dump(); }template<typename Head, typename... Tail> void dump(Head&& head, Tail&&... tail) { cerr << head << ", "; dump(forward<Tail>(tail)...); }#define debug(...) do {cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; dump(__VA_ARGS__); } while (false)#else#define dump(...)#define debug(...)#endif/* OTHER */#define fi first#define se second#define MP make_pair#define MT make_tupletemplate<typename T, typename A, typename B> inline bool between(T x, A a, B b) { return ((a <= x) && (x < b)); }template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }inline ll POW(ll a, ll b) { ll r = 1; do { if (b & 1) r *= a; a *= a; } while (b >>= 1); return r; }struct abracadabra {abracadabra() {cin.tie(nullptr); ios::sync_with_stdio(false);cout << fixed << setprecision(20);cerr << fixed << setprecision(5);};} ABRACADABRA;// clang-format on#pragma endregionint solve();signed main() {// int _T; cin >> _T; for (int t = 1; t <= _T; ++t)solve();}int solve() {SS(int, N);SV(ll, A, N);SVV(ll, B, N, N);ll res = -INFF;vector<int> vec;REP (i, 1, 1 << N) {vector<int> on;ll tmp = 0;REP (j, N)if (i >> j & 1) {tmp += A[j];on.emplace_back(j);}int sz = on.size();REP (j, sz) {REP (k, j + 1, sz) {tmp += B[on[j]][on[k]];}}if (chmax(res, tmp)) {vec.swap(on);}}print(res);int sz = vec.size();REP(i, sz) {cout << vec[i] + 1;if (i != sz - 1) cout << ' ';}cout << endl;return 0;}