結果

問題 No.515 典型LCP
ユーザー heno239heno239
提出日時 2022-10-21 11:53:00
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 271 ms / 1,000 ms
コード長 7,498 bytes
コンパイル時間 2,342 ms
コンパイル使用メモリ 164,384 KB
実行使用メモリ 31,888 KB
最終ジャッジ日時 2024-06-30 22:38:00
合計ジャッジ時間 5,203 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 271 ms
31,888 KB
testcase_01 AC 249 ms
31,868 KB
testcase_02 AC 106 ms
20,808 KB
testcase_03 AC 13 ms
20,036 KB
testcase_04 AC 13 ms
20,040 KB
testcase_05 AC 93 ms
20,808 KB
testcase_06 AC 101 ms
20,808 KB
testcase_07 AC 99 ms
20,808 KB
testcase_08 AC 103 ms
20,680 KB
testcase_09 AC 93 ms
20,808 KB
testcase_10 AC 94 ms
20,684 KB
testcase_11 AC 94 ms
20,676 KB
testcase_12 AC 94 ms
20,676 KB
testcase_13 AC 95 ms
20,808 KB
testcase_14 AC 18 ms
20,804 KB
testcase_15 AC 91 ms
20,676 KB
testcase_16 AC 90 ms
20,808 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//constexpr ll mod = 998244353;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 21;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
using ld = long double;
//typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
//-----------------------------------------





struct sparse_table {
private:
    int n;
    int tmp;
    vector<int> ori;
    vector<int> transtmp;
    vector<vector<int>> nodel;
public:
    sparse_table(vector<int> _ori) {
        ori = _ori;
        n = ori.size();
        int cop = n;
        tmp = 0;
        while (cop > 0) {
            tmp++; cop >>= 1;
        }
        nodel.resize(tmp);
        rep(i, tmp)nodel[i].resize(n);
        rep(i, n) {
            nodel[0][i] = ori[i];
        }
        rep(j, tmp - 1) {
            rep(i, n) {
                if (i + (1 << j) < n) {
                    nodel[j + 1][i] = min(nodel[j][i], nodel[j][i + (1 << j)]);
                }
            }
        }
        transtmp.resize(n + 1);
        int x = 1;
        int cnt = 0;
        rep1(i, n) {
            while (x * 2 <= i) {
                x *= 2; cnt++;
            }
            transtmp[i] = cnt;
        }
    }
    //[l,r)
    int query(int l, int r) {
        if (r - l == 0)return mod;
        int cnt = transtmp[r - l];
        return min(nodel[cnt][l], nodel[cnt][r - (1 << cnt)]);
    }
};
void solve() {
    int n; cin >> n;
    vector<string> s(n);
    rep(i, n)cin >> s[i];
    auto comp = [&](int i, int j) {
        return s[i] < s[j];
    };
    vector<int> sa(n);
    rep(i, n)sa[i] = i;
    sort(all(sa), comp);
    vector<int> lcp(n-1);
    rep(i, n - 1) {
        int idl = sa[i], idr = sa[i + 1];
        int len = min(s[idl].size(), s[idr].size());
        rep(j, len) {
            if (s[idl][j] == s[idr][j]) {
                lcp[i]++;
            }
            else break;
        }
    }
    vector<int> rev(sa.size());
    rep(i, sa.size())rev[sa[i]] = i;
    sparse_table st(lcp);
    auto query = [&](int i, int j) {
        int le = rev[i];
        int ri = rev[j];
        if (le > ri)swap(le, ri);
        int res = st.query(le, ri);
        chmin(res, (int)s[i].size());
        chmin(res, (int)s[j].size());
        return res;
    };
    ll m, x, d; cin >> m >> x >> d;
    ll ans = 0;
    rep1(k, m) {
        int i = (x / (n - 1)) + 1;
        int j = (x % (n - 1)) + 1;
        if (i > j) {
            swap(i, j);
        }
        else {
            j++;
        }
        x = (x + d) % ((ll)n * (n - 1));
        ans += query(i - 1, j - 1);
        //cout << query(i - 1, j - 1) << "\n";
    }
    cout << ans << "\n";
}





signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	//expr();
	//while(true)
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0