#659440 (C++14) No.1512 作文

• 問題: No.1512 作文
• ユーザー: Enjapma_kyopro
• 提出日時: 2021-05-21 22:19:08
• 言語: C++14 (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 28 ms / 2,000 ms
• コード長: 3,921 bytes
• コンパイル時間: 1,853 ms
• コンパイル使用メモリ: 170,796 KB
• 実行使用メモリ: 7,396 KB
• 最終ジャッジ日時: 2024-04-18 15:49:42
• 合計ジャッジ時間: 3,369 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	21 ms; 5,504 KB
testcase_05	AC	21 ms; 5,504 KB
testcase_06	AC	21 ms; 5,632 KB
testcase_07	AC	21 ms; 5,632 KB
testcase_08	AC	22 ms; 5,504 KB
testcase_09	AC	6 ms; 5,376 KB
testcase_10	AC	6 ms; 5,376 KB
testcase_11	AC	5 ms; 5,376 KB
testcase_12	AC	6 ms; 5,376 KB
testcase_13	AC	6 ms; 5,376 KB
testcase_14	AC	8 ms; 5,376 KB
testcase_15	AC	8 ms; 5,376 KB
testcase_16	AC	8 ms; 5,376 KB
testcase_17	AC	8 ms; 5,376 KB
testcase_18	AC	8 ms; 5,376 KB
testcase_19	AC	8 ms; 5,376 KB
testcase_20	AC	8 ms; 5,376 KB
testcase_21	AC	2 ms; 5,376 KB
testcase_22	AC	2 ms; 5,376 KB
testcase_23	AC	2 ms; 5,376 KB
testcase_24	AC	2 ms; 5,376 KB
testcase_25	AC	2 ms; 5,376 KB
testcase_26	AC	2 ms; 5,376 KB
testcase_27	AC	2 ms; 5,376 KB
testcase_28	AC	2 ms; 5,376 KB
testcase_29	AC	2 ms; 5,376 KB
testcase_30	AC	2 ms; 5,376 KB
testcase_31	AC	2 ms; 5,376 KB
testcase_32	AC	2 ms; 5,376 KB
testcase_33	AC	2 ms; 5,376 KB
testcase_34	AC	2 ms; 5,376 KB
testcase_35	AC	6 ms; 5,376 KB
testcase_36	AC	6 ms; 5,376 KB
testcase_37	AC	4 ms; 5,376 KB
testcase_38	AC	6 ms; 5,376 KB
testcase_39	AC	6 ms; 5,376 KB
testcase_40	AC	26 ms; 6,784 KB
testcase_41	AC	28 ms; 7,396 KB

コンパイルメッセージ

main.cpp: In function 'bool solve()':
main.cpp:125:19: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  125 |         for (auto [start, len] : G[i]) {
      |                   ^

ソースコード

#include <bits/stdc++.h>

using namespace std;

// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> T;
typedef pair<ll, vector<ll>> Pd;

const ll INF = 1e18;
const ll fact_table = 320000;

priority_queue<ll> pql;
priority_queue<P> pqp;
// big priority queue
priority_queue<ll, vector<ll>, greater<ll>> pqls;
priority_queue<P, vector<P>, greater<P>> pqps;

// small priority queue
// top pop

ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
ll dy[8] = {0, 1, 0, -1, -1, 1, 1, -1};
//↓,→,↑,←

#define p(x) cout << x << "\n";
#define el cout << "\n";
#define pe(x) cout << x << " ";
#define ps(x) cout << fixed << setprecision(25) << x << endl;
#define pu(x) cout << (x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pc(x) cout << x << ",";
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, a, b) for (ll i = a; i <= (b); i++)
#define rep3(i, a, b) for (ll i = a; i >= (b); i--)
#define all(c) begin(c), end(c)
#define sorti(v) sort(all(v))
#define sortd(v)                                                               \
    sort(all(v));                                                              \
    reverse(all(v));
#define SUM(v) accumulate(all(v), 0LL)
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))

typedef vector<ll> vec;
typedef vector<vector<ll>> mat;

// vec v(n) -> 長さnのベクトルを宣言
// mat dp(h, vec(w)) -> h * w の行列を宣言

const ll mod = 1000000007ll;
// const ll mod = 998244353ll;

ll mypow(ll a, ll b, ll m = mod) {
    ll x = 1;
    while (b) {
        while (!(b & 1)) {
            (a *= a) %= m;
            b >>= 1;
        }
        (x *= a) %= m;
        b--;
    }
    return x;
}
vec rv(ll read) {
    vec res(read);
    for (int i = 0; i < read; i++) {
        cin >> res[i];
    }
    return res;
}
/*
ll fact[fact_table + 5], rfact[fact_table + 5];

void c3_init() {
    fact[0] = rfact[0] = 1;
    for (ll i = 1; i <= fact_table; i++) {
        fact[i] = (fact[i - 1] * i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod);
    for (ll i = fact_table; i >= 1; i--) {
        rfact[i - 1] = rfact[i] * i;
        rfact[i - 1] %= mod;
    }
    return;
}

ll c3(ll n, ll r) {
    return (((fact[n] * rfact[r]) % mod) * rfact[n - r]) % mod;
}
*/

bool icpc = false;
bool multicase = false;

ll n;
ll x[40][40];
ll dp[30];
vector<P> G[50];

bool solve() {
    dp[0] = 0;
    cin >> n;
    rep(i, n) {
        string s;
        cin >> s;
        bool sorted = true;
        for (int i = 0; i + 1 < s.size(); i++) {
            if (s[i] > s[i + 1]) sorted = false;
        }
        if (!sorted) continue;
        G[s.back() - 'a' + 1].pb(P(s[0] - 'a' + 1, s.size()));
    }
    ll ans = 0;
    for (int i = 1; i <= 26; i++) {
        // i で終わるやつらをチェック
        ll sum = 0;
        for (auto [start, len] : G[i]) {
            if (start == i) {
                sum += len;
                continue;
            }
            ll maxi = 0;
            for (int j = 0; j <= start; j++) {
                maxi = max(maxi, dp[j]);
            }
            dp[i] = max(dp[i], maxi + len);
        }
        ll maxi = 0;
        for (int j = 0; j <= i; j++) {
            maxi = max(maxi, dp[j]);
        }
        dp[i] = maxi + sum;
    }
    for (int i = 1; i <= 26; i++) {
        ans = max(ans, dp[i]);
    }
    p(ans);
    return true;
}

/*







*/

int main() {
    // ios::sync_with_stdio(false);
    // cin.tie(nullptr);
    if (icpc) {
        while (solve())
            ;
        return 0;
    }
    ll q, testcase = 1;
    if (multicase) {
        cin >> q;
    } else {
        q = 1;
    }
    while (q--) {
        // cout << "Case #" << testcase << ": ";
        solve();
        testcase++;
    }

    // solve();
    return 0;
}