提出詳細

提出id	提出時刻	ユーザー名	問題	言語	判定状況	判定	実行時間
115013	2023-10-25 10:33:39	arad	H	cpp	19/19	TLE	1994

#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using VS = vector<string>;
using P = pair<ll,ll>;
using VP = vector<P>;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define out(x) cout << x << endl
#define dout(x) cout << fixed << setprecision(10) << x << endl
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(x) (int)(x.size())
#define re0 return 0
#define pcnt __builtin_popcountll
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
constexpr int inf = 1e9;
constexpr ll INF = 1e18;
//using mint = modint1000000007;
//using mint = modint998244353;
int di[4] = {1,0,-1,0};
int dj[4] = {0,1,0,-1};

ll dp[1<<16][26][26];

int main(){
    ll n;
    cin >> n;
    VS s(n);
    rep(i,n) cin >> s[i];
    ll n2 = 1<<n;
    rep(i,n2)rep(j,26)rep(k,26) dp[i][j][k] = -INF;
    rep(j,26) dp[0][j][j] = 0;
    ll ans = 0;
    /* rep(bit,n2)rep(j,26)rep(k,26){
        rep(i,n){
            if(bit>>i&1) continue;
            if(s[i].back()-'a' == j){
                chmax(dp[bit|(1<<i)][s[i][0]-'a'][k],dp[bit][j][k]+sz(s[i]));
            }
            if(s[i][0]-'a' == k){
                chmax(dp[bit|(1<<i)][j][s[i].back()-'a'],dp[bit][j][k]+sz(s[i]));
            }
        }
        chmax(ans,dp[bit][j][k]);
    } */
    rep(bit,n2){
        rep(i,n){
            if(bit>>i&1) continue;
            rep(k,26){
                ll j = s[i].back()-'a';
                chmax(dp[bit|(1<<i)][s[i][0]-'a'][k],dp[bit][j][k]+sz(s[i]));
            }
            rep(j,26){
                ll k = s[i][0]-'a';
                chmax(dp[bit|(1<<i)][j][s[i].back()-'a'],dp[bit][j][k]+sz(s[i]));
            }
        }
        rep(j,26)rep(k,26) chmax(ans,dp[bit][j][k]);
    }
    out(ans);
}

sample1.txt AC 3
sample2.txt AC 3
sample3.txt AC 3
case1.txt TLE 1994
case2.txt TLE 299
case3.txt TLE 299
case4.txt TLE 1342
case5.txt TLE 299
case6.txt AC 1188
case7.txt TLE 304
case8.txt WA 4
case9.txt WA 82
case10.txt WA 33
case11.txt WA 2
case12.txt WA 3
case13.txt WA 34
case14.txt WA 3
case15.txt WA 13
case16.txt TLE 328
1994 RE1994 TLE

timeout: the monitored command dumped core
Segmentation fault