結果

問題 No.1360 [Zelkova 4th Tune] 協和音
ユーザー karinohitokarinohito
提出日時 2021-04-15 16:44:32
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 69 ms / 2,000 ms
コード長 2,905 bytes
コンパイル時間 1,364 ms
コンパイル使用メモリ 116,956 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-01 23:03:59
合計ジャッジ時間 6,225 ms
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 47
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

//#include <atcoder/all>
#include <iostream>
#include <numeric>
#include <cmath>
#include <limits>
#include <stdio.h>
#include <iomanip>
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
using namespace std;
//using namespace atcoder;
using ll = long long;
#define all(A) A.begin(),A.end()
using vll = vector<ll>;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
using Graph = vector<vector<int>>;
vector<ll> ISP;
ll M = 1500005;
void PP(ll M) {
ISP.assign(M + 1, -1);
for (ll i = 2; i <= M; i++) {
ISP[i] = i;
}
ISP[0] = -1;
ISP[1] = -1;
for (ll i = 2; i * i <= M; i++) {
if (ISP[i] == i) {
for (ll j = 2; i * j <= M; j++) {
if (ISP[i * j] != i * j)continue;
ISP[i * j] = i;
}
}
}
}
vector<ll> power(70);
ll mod = 1000000007;
vector<vector<vector<ll>>> matrixpow;
void prematrixpow(vector<vll> matrix) {
ll N = matrix.size();
matrixpow.assign(70, vector<vll>(N, vll(N)));
rep(h, N) {
rep(w, N) {
matrixpow[0][h][w] = matrix[h][w];
}
}
rep(k, 69) {
rep(h, N) {
rep(w, N) {
ll S = 0;
rep(i, N) {
S += matrixpow[k][h][i] * matrixpow[k][i][w];
S %= mod;
S = (S + mod) % mod;
}
matrixpow[k + 1][h][w] = S;
}
}
}
}
vector<vll> modmatrixpow(ll K) {
ll P = K;
ll N = matrixpow[0].size();
vector<vll> res(N, vll(N, 0));
rep(i, N) {
res[i][i] = 1;
}
rep(j, 70) {
if (P % 2 != 0) {
vector<vll> res2(N, vll(N, 0));
rep(h, N) {
rep(w, N) {
ll S = 0;
rep(i, N) {
S += matrixpow[j][h][i] * res[i][w];
S %= mod;
S = (S + mod) % mod;
}
res2[h][w] = S;
}
}
res = res2;
}
P /= 2;
}
return res;
}
int main() {
ll N;
cin >> N;
vll A(N);
rep(i, N)cin >> A[i];
vector<vll> B(N, vll(N));
rep(i, N) {
rep(j, N) {
cin >> B[i][j];
}
B[i][i] = A[i];
}
ll an = -1e18;
vll AN;
// {0, 1, ..., n-1}
for (int bit = 1; bit < (1 << N); ++bit) {
vector<ll> S;
for (int i = 0; i < N; ++i) {
if (bit & (1 << i)) { // i
S.push_back(i);
}
}
ll n = S.size();
ll k = 0;
for (ll i = 0; i < n; i++) {
for (ll j = i; j < n; j++) {
k += B[S[i]][S[j]];
}
}
if (k > an) {
an = k;
AN = S;
}
}
cout << an << endl;
rep(i, AN.size()) {
cout << AN[i]+1 << " ";
}
cout << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0