#411783 (C++14) No.962 LCPs

提出ソース

結果

問題	No.962 LCPs
ユーザー	hitonanode
提出日時	2019-12-24 23:38:51
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	169 ms / 2,000 ms
コード長	4,367 bytes
コンパイル時間	1,755 ms
コンパイル使用メモリ	180,232 KB
実行使用メモリ	28,972 KB
最終ジャッジ日時	2024-09-22 16:03:43
合計ジャッジ時間	5,390 ms
ジャッジサーバーID （参考情報）	judge1 / judge3

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,816 KB
testcase_01	AC	2 ms 6,940 KB
testcase_02	AC	2 ms 6,940 KB
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,944 KB
testcase_05	AC	2 ms 6,944 KB
testcase_06	AC	2 ms 6,944 KB
testcase_07	AC	2 ms 6,940 KB
testcase_08	AC	2 ms 6,940 KB
testcase_09	AC	2 ms 6,940 KB
testcase_10	AC	2 ms 6,944 KB
testcase_11	AC	2 ms 6,944 KB
testcase_12	AC	2 ms 6,944 KB
testcase_13	AC	2 ms 6,940 KB
testcase_14	AC	1 ms 6,940 KB
testcase_15	AC	2 ms 6,940 KB
testcase_16	AC	2 ms 6,944 KB
testcase_17	AC	169 ms 28,972 KB
testcase_18	AC	89 ms 16,128 KB
testcase_19	AC	90 ms 16,128 KB
testcase_20	AC	63 ms 11,776 KB
testcase_21	AC	63 ms 11,776 KB
testcase_22	AC	51 ms 9,728 KB
testcase_23	AC	51 ms 9,728 KB
testcase_24	AC	44 ms 8,448 KB
testcase_25	AC	44 ms 8,448 KB
testcase_26	AC	38 ms 7,552 KB
testcase_27	AC	51 ms 9,472 KB
testcase_28	AC	36 ms 6,940 KB
testcase_29	AC	35 ms 6,940 KB
testcase_30	AC	47 ms 8,960 KB
testcase_31	AC	56 ms 10,240 KB
testcase_32	AC	33 ms 6,944 KB
testcase_33	AC	85 ms 15,472 KB
testcase_34	AC	40 ms 7,552 KB
testcase_35	AC	38 ms 7,424 KB
testcase_36	AC	41 ms 7,808 KB
testcase_37	AC	37 ms 6,944 KB
testcase_38	AC	36 ms 6,940 KB
testcase_39	AC	37 ms 6,944 KB
testcase_40	AC	37 ms 6,944 KB
testcase_41	AC	36 ms 6,940 KB
testcase_42	AC	37 ms 6,940 KB
testcase_43	AC	37 ms 6,944 KB
testcase_44	AC	37 ms 6,944 KB
testcase_45	AC	36 ms 6,944 KB
testcase_46	AC	36 ms 6,940 KB
testcase_47	AC	5 ms 6,944 KB
testcase_48	AC	4 ms 6,944 KB
testcase_49	AC	4 ms 6,940 KB
testcase_50	AC	4 ms 6,944 KB
testcase_51	AC	5 ms 6,944 KB
testcase_52	AC	4 ms 6,944 KB
testcase_53	AC	5 ms 6,948 KB
testcase_54	AC	4 ms 6,940 KB
testcase_55	AC	3 ms 6,944 KB
testcase_56	AC	5 ms 6,940 KB
testcase_57	AC	10 ms 6,944 KB
testcase_58	AC	10 ms 6,944 KB
testcase_59	AC	10 ms 6,944 KB
testcase_60	AC	12 ms 6,940 KB
testcase_61	AC	12 ms 6,944 KB
testcase_62	AC	12 ms 6,940 KB
testcase_63	AC	120 ms 20,128 KB
testcase_64	AC	6 ms 6,940 KB
testcase_65	AC	120 ms 20,172 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/

int N;

int main()
{
    cin >> N;
    vector<string> S(N);
    cin >> S;
    lint ret = 0;
    int L = 0;
    for (auto x : S) mmax(L, (int)x.length());
    set<int> s;
    vector<int> suc(N, 1);
    suc.back() = 0;
    REP(i, N) s.insert(i);
    REP(d, L) {
        set<int> serase;
        int i = -1;
        while (true)
        {
            auto itr = s.upper_bound(i);
            if (itr == s.end()) break;
            int j = *itr;
            lint n = 1;
            while (s.count(j + 1) and suc[j] and S[j + 1][d] == S[j][d]) j++, n++;
            suc[j] = 0;
            lint add = n * n + (n - 1) * n * (n - 1) / 2 - (n - 1) * (n) * (2 * n - 1) / 6;
            ret += add;
            i = j;
        }
        for (auto i : s) if ((int)S[i].length() == d + 1) serase.insert(i);
        for (auto x : serase) s.erase(x);
    }
    cout << ret << endl;
}

yukicoder

結果

テストケース

ソースコード