#pragma GCC optimize ("O3") #pragma GCC target ("avx") #include "bits/stdc++.h" using namespace std; typedef unsigned int uint; typedef long long int ll; typedef unsigned long long int ull; #define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout< ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<=l;--cnt) #define BIGINT 0x7FFFFFFF #define MD 1000000007ll #define PI 3.1415926535897932384626433832795 void printbit(int u) { if (u == 0)cout << 0; else { int s = 0, k = 0; for (; 0>= 1, k++)s = (s << 1) | (u & 1); for (; 0>= 1)cout << (s & 1); } }template ostream& operator <<(ostream &o, const pair p) { o << "(" << p.first << ":" << p.second << ")"; return o; } #define TIME chrono::system_clock::now() #define MILLISEC(t) (chrono::duration_cast(t).count()) namespace { std::chrono::system_clock::time_point t; void tic() { t = TIME; } void toc() { fprintf(stderr, "TIME : %lldms\n", MILLISEC(TIME - t)); } std::chrono::system_clock::time_point tle = TIME; //#ifdef __MAI void safe_tle(int msec) { assert(MILLISEC(TIME - tle) < msec); } //#else //#define safe_tle(k) ; //#endif } #ifdef __MAI //_getchar_nolock #define getchar_unlocked getchar #endif namespace { class MaiScanner { public: template void input_integer(T& var) { var = 0; T sign = 1; int cc = getchar_unlocked(); for (; cc<'0' || '9'>(int& var) { input_integer(var); return *this; } inline MaiScanner& operator>>(long long& var) { input_integer(var); return *this; } }; } MaiScanner scanner; // Segment tree // T : プリミティブ型推奨。vectorで色々したい場合はインデックス番号やポインタを使う。 // idt : 無効な値を表す。 // Compare : 区間最小であればstd::less。 // segtree(size) : データ数。勝手に2のべき乗サイズになる。 template class segtree { size_t size; //vector data; T data[300010]; public: segtree(size_t n) { size = 1; while (size> n; scanner.c(); repeat(n) { str[cnt].reserve(40); while ((c = scanner.c()) != '\n') str[cnt].push_back(c); warp[cnt] = cnt; } scanner >> m >> x >> d; sort(warp, warp + n, [](auto l, auto r) {return str[l] < str[r]; }); segtree st(n); repeat(n - 1) { rwarp[warp[cnt]] = cnt; st.update(cnt, lcp(str[warp[cnt]], str[warp[cnt + 1]])); } rwarp[warp[n - 1]] = n - 1; ll result = 0; for (ll k = 1; k <= m; ++k) { l = (x / (n - 1)); r = (x % (n - 1)); if (l > r) swap(l, r); else { r = r + 1; } x = (x + d) % (n * (n - 1)); l = rwarp[l]; r = rwarp[r]; if (l > r) result += st.query(r, l); else result += st.query(l, r); } cout << result << endl; return 0; }