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

提出ソース

結果

問題	No.962 LCPs
ユーザー	ningenMe
提出日時	2019-12-27 06:29:55
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	158 ms / 2,000 ms
コード長	4,033 bytes
コンパイル時間	2,386 ms
コンパイル使用メモリ	178,216 KB
実行使用メモリ	25,856 KB
最終ジャッジ日時	2024-04-16 04:51:46
合計ジャッジ時間	10,139 ms
ジャッジサーバーID （参考情報）	judge2 / judge5

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
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	2 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	2 ms 5,376 KB
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	3 ms 5,376 KB
testcase_09	AC	2 ms 5,376 KB
testcase_10	AC	2 ms 5,376 KB
testcase_11	AC	2 ms 5,376 KB
testcase_12	AC	2 ms 5,376 KB
testcase_13	AC	2 ms 5,376 KB
testcase_14	AC	2 ms 5,376 KB
testcase_15	AC	2 ms 5,376 KB
testcase_16	AC	2 ms 5,376 KB
testcase_17	AC	158 ms 25,856 KB
testcase_18	AC	145 ms 22,272 KB
testcase_19	AC	145 ms 22,016 KB
testcase_20	AC	143 ms 20,824 KB
testcase_21	AC	145 ms 20,864 KB
testcase_22	AC	139 ms 19,968 KB
testcase_23	AC	139 ms 19,968 KB
testcase_24	AC	141 ms 19,584 KB
testcase_25	AC	143 ms 19,712 KB
testcase_26	AC	140 ms 19,328 KB
testcase_27	AC	141 ms 20,224 KB
testcase_28	AC	139 ms 19,584 KB
testcase_29	AC	139 ms 19,328 KB
testcase_30	AC	137 ms 19,968 KB
testcase_31	AC	140 ms 20,736 KB
testcase_32	AC	139 ms 19,072 KB
testcase_33	AC	145 ms 21,788 KB
testcase_34	AC	139 ms 19,456 KB
testcase_35	AC	140 ms 19,456 KB
testcase_36	AC	137 ms 19,840 KB
testcase_37	AC	120 ms 19,200 KB
testcase_38	AC	123 ms 19,200 KB
testcase_39	AC	118 ms 19,200 KB
testcase_40	AC	124 ms 19,200 KB
testcase_41	AC	121 ms 19,200 KB
testcase_42	AC	123 ms 19,200 KB
testcase_43	AC	122 ms 19,328 KB
testcase_44	AC	121 ms 19,072 KB
testcase_45	AC	121 ms 19,072 KB
testcase_46	AC	123 ms 19,072 KB
testcase_47	AC	54 ms 14,976 KB
testcase_48	AC	49 ms 13,696 KB
testcase_49	AC	64 ms 16,640 KB
testcase_50	AC	65 ms 17,152 KB
testcase_51	AC	56 ms 14,976 KB
testcase_52	AC	40 ms 11,648 KB
testcase_53	AC	58 ms 15,616 KB
testcase_54	AC	50 ms 13,568 KB
testcase_55	AC	36 ms 10,880 KB
testcase_56	AC	67 ms 17,792 KB
testcase_57	AC	105 ms 14,592 KB
testcase_58	AC	105 ms 14,720 KB
testcase_59	AC	105 ms 14,592 KB
testcase_60	AC	138 ms 18,560 KB
testcase_61	AC	138 ms 18,432 KB
testcase_62	AC	138 ms 18,432 KB
testcase_63	AC	62 ms 18,048 KB
testcase_64	AC	72 ms 18,432 KB
testcase_65	AC	62 ms 18,248 KB

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

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
 
#define REP(i,n) for(long long i = 0; i < (n); i++)
#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);
 
template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;
 
constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;
 
template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
template <template <class tmp>  class T, class U> ostream &operator<<(ostream &o, const T<U> &obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr)o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

//Union Find Tree
class UnionFindTreeSize {
public:
	vector<int> parent;

    UnionFindTreeSize(int N = 1) : parent(N,-1){
	}
 
	int root(int n) {
        return (parent[n]<0?n:parent[n] = root(parent[n]));
	}

    bool same(int n, int m) {
		return root(n) == root(m);
	}
 
	void unite(int n, int m) {
		n = root(n);
		m = root(m);
		if (n == m) return;
		if(parent[n]>parent[m]) swap(n, m);
        parent[n] += parent[m];
        parent[m] = n;
	}

    int size(int n){
        return (-parent[root(n)]);
    }
};


//verify 

int main() {
	ll N; cin >> N;
	vector<string> S(N+1);
	for(int i = 0; i < N; ++i) cin >> S[i];
	//カウント前計算
	vector<ll> cnt(N+1,0);
	for(ll i = 1; i <= N; ++i) cnt[i] = cnt[i-1] + (i*(i+1))/2;
	int M = 0;
	map<pair<int,int>,int> mp;
	for(int i = 0; i < N; ++i){
		for(int j = 0; j < S[i].size(); ++j){
			mp[{i,j}] = M++;
		}
	}
	UnionFindTreeSize uf(M);
	for(int i = 0; i+1 < N; ++i){
		int idx = 0;
		for(int j = 0; j < S[i].size() && j < S[i+1].size(); ++j){
			if(S[i][j]!=S[i+1][j]) break;
			idx++;
		}
		for(int j = 0; j < idx; ++j){
			uf.unite(mp[{i,j}],mp[{i+1,j}]);
		}
	}
	vector<ll> sz(M,0);
	for(int i = 0; i < M; ++i) sz[uf.root(i)] = uf.size(i);
	ll ans = 0;
	for(int i = 0; i < M; ++i) ans += cnt[sz[i]];
	cout << ans << endl;
	return 0;
}

yukicoder

結果

テストケース

ソースコード