problem_id stringlengths 6 6 | language stringclasses 2 values | original_status stringclasses 3 values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3 values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270 values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02913 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n;
string s;
cin >> n >> s;
vvl dp(n, vl(n)); // dp[i][j] : s[i]とs[j]から始めたとき一致する長さの最大値
for (ll i = n - 1; i >= 0; i--) {
for (ll j = n - 1; j >= 0; j--) {
if (s[i] == s[j]) {
dp[i][j] = min(j - i, dp[i + 1][j + 1] + 1);
}
}
}
ll ans = 0;
rep(i, n - 1) {
exrep(j, i + 1, n - 1) { chmax(ans, dp[i][j]); }
}
out(ans);
re0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n;
string s;
cin >> n >> s;
vvl dp(n + 1,
vl(n + 1)); // dp[i][j] : s[i]とs[j]から始めたとき一致する長さの最大値
for (ll i = n - 1; i >= 0; i--) {
for (ll j = n - 1; j >= 0; j--) {
if (s[i] == s[j]) {
dp[i][j] = min(j - i, dp[i + 1][j + 1] + 1);
}
}
}
ll ans = 0;
rep(i, n - 1) {
exrep(j, i + 1, n - 1) { chmax(ans, dp[i][j]); }
}
out(ans);
re0;
} | replace | 33 | 34 | 33 | 35 | -11 | |
p02913 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(a) ((a) > (0) ? (a) : -(a))
#define rep(i, a, b) for (SINT64(i) = SINT64(a); (i) < SINT64(b); (i)++)
#define rrep(i, a, b) for (SINT64(i) = SINT64(a); (i) >= SINT64(b); (i)--)
#define put(a) cout << (a) << endl
#define puts(a) cout << (a) << " "
#define putr(a) \
rep(testIncrement, 0, a.size()) { puts(a[testIncrement]); } \
cout << endl
#define INF 1000000001
#define MOD 1000000007
#define INF64 1000000000000000001
#define F first
#define S second
#define Pii pair<SINT32, SINT32>
#define Pll pair<SINT64, SINT64>
#define Piii pair<SINT32, pair<SINT32, SINT32>>
#define Plll pair<SINT64, pair<SINT64, SINT64>>
#define Vll(a, b, c) vector<vector<SINT64>> (a)((b),vector<SINT64>((c))
#define Vlll(a, b, c, d) vector<vector<vector<SINT64>>> (a)((b),vector<vector<SINT64>>((c),vector<SINT64>((d)))
using namespace std;
class SegTree {
private:
SINT64 size;
vector<SINT64> node;
SINT64 jugdement(SINT64 a, SINT64 b) {
SINT64 ans = 0;
ans = MIN(a, b);
return ans;
}
public:
// コンストラクタ
SegTree(vector<SINT64> data) {
SINT64 ori_size;
ori_size = data.size();
size = 1;
while (size < ori_size) {
size *= 2;
}
node.resize(2 * size - 1, INF64);
rep(i, 0, ori_size) { node[size - 1 + i] = data[i]; }
rrep(i, size - 2, 0) {
node[i] = jugdement(node[2 * i + 1], node[2 * i + 2]);
}
}
// データ更新
void update(SINT64 x, SINT64 val) {
x += (size - 1);
node[x] = val + node[x];
while (x > 0) {
x = (x - 1) / 2;
node[x] = jugdement(node[2 * x + 1], node[2 * x + 2]);
}
}
// データ取得 [a,b)
SINT64 getdata(SINT64 a, SINT64 b, SINT64 k = 0, SINT64 l = 0,
SINT64 r = -1) {
if (r < 0) {
r = size;
}
// 要求範囲外
if ((r <= a) || (b <= l)) {
return INF64;
}
// 完全要求区間内
if ((a <= l) && (r <= b)) {
return node[k];
}
SINT64 vl = getdata(a, b, 2 * k + 1, l, (l + r) / 2);
SINT64 vr = getdata(a, b, 2 * k + 2, (l + r) / 2, r);
return jugdement(vl, vr);
}
};
class SuffixArray {
private:
vector<string> array; // サフィックスアレイ
vector<SINT64> lcp; // LCP
vector<SINT64> sais; // SA IS
string str;
public:
// コンストラクタ
SuffixArray(string s) {
str = s;
vector<SINT64> Vstr;
rep(i, 0, str.length()) { Vstr.emplace_back(str[i]); }
sais_act(Vstr, sais, 255); // SAIS実行
lcp_act(); // 隣り合うSUFFIXの先頭から同じ長さを算出
SegTree seg(lcp);
SINT64 ans = 0;
rep(i, 0, str.length()) {
rep(j, i + 1, str.length()) {
SINT64 a = ABS(sais[i] - sais[j]);
SINT64 b = seg.getdata(i, j);
// puts(i);puts(j);puts(a);put(b);
ans = MAX(ans, MIN(a, b));
}
}
put(ans);
// suffix array作成
// array.resize(str.length());
// rep(i,0,array.size()) {
// array[i] = str.substr(sais[i]);
// }
// rep(i,0,array.size()) {put(array[i]);} // 表示用
}
void lcp_act(void) {
lcp.resize(str.length() - 1);
vector<SINT64> buffer(str.length() - 1);
rep(i, 0, str.length()) { buffer[sais[i]] = i; }
SINT64 cnt = 0;
rep(i, 0, str.length()) {
if (buffer[i] >= str.length() - 1) {
cnt = 0;
} else {
SINT64 a = buffer[i];
SINT64 b = buffer[i] + 1;
while (1) {
if (cnt >= str.length() - sais[a])
break;
if (cnt >= str.length() - sais[a])
break;
if (str[sais[a] + cnt] == str[sais[b] + cnt]) {
cnt++;
} else {
break;
}
}
}
lcp[buffer[i]] = cnt;
if (cnt != 0)
cnt--;
}
}
// 引数の文字列が何個含まれるか算出
SINT64 get_cnt(string t) {
SINT64 low, high;
SINT64 L, R;
L = -1;
R = str.length();
while (R - L > 1) {
SINT64 M = (R + L) / 2;
string buf = str.substr(sais[M]);
if (buf.length() > t.length()) {
buf = buf.substr(0, t.length());
}
if (buf > t) {
R = M;
} else {
L = M;
}
}
high = R;
L = -1;
R = str.length();
while (R - L > 1) {
SINT64 M = (R + L) / 2;
string buf = str.substr(sais[M]);
if (buf >= t) {
R = M;
} else {
L = M;
}
}
low = R;
return high - low;
}
// SAIS実行
void sais_act(vector<SINT64> &Vstr, vector<SINT64> &r_sais, SINT64 type) {
Vstr.push_back(0); // 番兵追加
vector<SINT64> lms_seed; // LMS ソート前
vector<SINT64> lms_sort; // LMS ソート後
vector<SINT64> lms_long(Vstr.size(), 0); // LMS 長さ
vector<SINT64> lms_type(Vstr.size(), 1); // 0:L 1:S 2:LMS
vector<SINT64> lms_posi(Vstr.size(), -1); // LMS内での位置
SINT64 len = 0;
// L S LMS判定 初期値は全てS
rrep(i, Vstr.size() - 2, 0) {
len++;
if (Vstr[i] > Vstr[i + 1]) {
lms_type[i] = 0; // L
if (lms_type[i + 1] == 1) {
lms_type[i + 1] = 2; // LMS
lms_long[i + 1] = len; // LMSの長さ格納
len = 1;
}
}
if (Vstr[i] == Vstr[i + 1])
lms_type[i] = lms_type[i + 1]; // 右と同じ
}
SINT64 cnt = 0;
rep(i, 0, Vstr.size()) {
if (lms_type[i] == 2)
lms_seed.emplace_back(i);
if (lms_type[i] == 2)
lms_posi[i] = cnt++;
}
// Induced Sort初回
vector<SINT64> bucket; // Induced Sort初回結果格納用
induced_sort(Vstr, lms_seed, bucket, lms_type, type);
// lms_sortにLMSのソートを格納
rrep(i, Vstr.size() - 1, 0) {
if ((bucket[i] != -1) && (lms_type[bucket[i]] == 2)) {
lms_sort.emplace_back(bucket[i]);
}
}
SINT64 ok = 0; // 再帰必要性判定
SINT64 rank = 1; // 再帰用文字
vector<SINT64> next(lms_sort.size(), 1); // 再帰用文字列
rrep(i, lms_sort.size() - 2, 0) {
SINT64 A = lms_long[lms_sort[i]];
SINT64 B = lms_long[lms_sort[i + 1]];
if (A == B) {
SINT64 ck = 0;
rep(j, 0, A) {
if (Vstr[lms_sort[i] + j] != Vstr[lms_sort[i + 1] + j]) {
ck = 1;
break;
}
}
if (ck == 0) {
ok = 1; // 再帰必要
} else {
rank++;
}
} else {
rank++;
}
next[lms_posi[lms_sort[i]]] = rank;
}
if (ok == 1) {
vector<SINT64> recursive;
sais_act(next, recursive, rank + 1);
rep(i, 0, recursive.size()) {
lms_sort[recursive.size() - i - 1] = lms_seed[recursive[i]];
}
}
// SORT済みLMSでInduced Sorting
r_sais.resize(Vstr.size(), -1);
induced_sort(Vstr, lms_sort, r_sais, lms_type, type);
r_sais.erase(r_sais.begin()); // 番兵削除
}
// induced_sort
void induced_sort(vector<SINT64> &Vstr, vector<SINT64> &seed,
vector<SINT64> &bucket_sort, vector<SINT64> &lms_type,
SINT64 type) {
vector<SINT64> bucket_cnt(type, 0); // バケット 文字種ごとの数
vector<SINT64> bucket_st(type, 0); // バケット 文字種の開始位置
vector<SINT64> bucket_end(type, 0); // バケット 文字種の終了位置
vector<SINT64> bucket_pre(Vstr.size(), -1); // バケット 初回格納用
vector<SINT64> cnt1(type, 0);
vector<SINT64> cnt2(type, 0);
vector<SINT64> cnt3(type, 0);
bucket_sort.resize(Vstr.size(), -1);
// バケットソート位置作成
rep(i, 0, Vstr.size()) bucket_cnt[Vstr[i]]++; // 個数作成
rep(i, 1, type) bucket_st[i] =
bucket_st[i - 1] + bucket_cnt[i - 1]; // 開始位置
rep(i, 0, type) bucket_end[i] =
bucket_st[i] + bucket_cnt[i] - 1; // 終了位置
// LMSをbucket_preに格納
rep(i, 0, seed.size()) {
SINT64 no = seed[i];
bucket_pre[bucket_end[Vstr[no]] - cnt1[Vstr[no]]] = no;
cnt1[Vstr[no]]++;
}
// Lをbucket_sortに格納
rep(i, 0, Vstr.size()) {
if ((bucket_pre[i] != -1) && (bucket_pre[i] != 0)) {
if (lms_type[bucket_pre[i] - 1] == 0) { // -1がLの場合
SINT64 buf = Vstr[bucket_pre[i] - 1];
bucket_pre[bucket_st[buf] + cnt2[buf]] = bucket_pre[i] - 1;
bucket_sort[bucket_st[buf] + cnt2[buf]] = bucket_pre[i] - 1;
cnt2[buf]++;
}
}
}
// Sをbucket_sortに格納
bucket_sort[0] = Vstr.size() - 1; // 番兵追加
rrep(i, Vstr.size() - 1, 0) {
if ((bucket_sort[i] != -1) && (bucket_sort[i] != 0)) {
if (lms_type[bucket_sort[i] - 1] != 0) { // -1がS(LMS)の場合
SINT64 buf = Vstr[bucket_sort[i] - 1];
bucket_sort[bucket_end[buf] - cnt3[buf]] = bucket_sort[i] - 1;
cnt3[buf]++;
}
}
}
}
};
int main() {
SINT64 N;
cin >> N;
string s;
cin >> s;
SuffixArray sss(s);
return 0;
}
// vector<vector<SINT64>> data(N,vector<SINT64>(N));
////2次元配列 vector<vector<vector<SINT64>>>
//data(N,vector<vector<SINT64>>(N,vector<SINT64>(N))); //3次元配列
// Vll(data,N,N); //2次元配列
// Vlll(data,N,N,N); //3次元配列
// sort(data.begin(),data.end());
// sort(data.begin(),data.end(),std::greater<SINT64>());
// __gcd(A,B);
// reverse(data.begin(),data.end());
// 関数へのvectorポインタ渡し
// void dfs(SINT64 poi, SINT64 d, vector<vector<Pll>>& data) {
// }
/* 複数条件ソート
bool sortcompare(Pll A, Pll B) {
if(A.F == B.F){
return A.S > B.S;
} else {
return A.F < B.F;
}
}
sort(data.begin(),data.end(),sortcompare);
*/
// タプル
// vector<tuple<SINT64,SINT64,SINT64>> edges;
// edges.emplace_back(a,b,c);
// cout << get<0>(edges[i]);
// cout << get<1>(edges[i]);
// cout << get<2>(edges[i]);
// sort(begin(edges), end(edges)); //ソート
// data.emplace_back(BUF); //後ろに追加
// data.erase(std::unique(data.begin(), data.end()), data.end());
// //ソート後に使用 同じ値を消す
// data.insert(data.begin() + X, 0); //X番目の要素に0を挿入
// 隣接リスト
// vector<vector<SINT64>> data(N);
// data[ A ].emplace_back( B );
// 両端キュー
// deque<SINT64> data;
// data.emplace_front(buf); //先頭挿入
// lower_boundは値がなければ最大値(.size())を返す
// posi = lower_bound(data.begin(),data.end(), X) - data.begin();
// // X以上を探す posi = lower_bound(data.begin(),data.end(),make_pair(X,0)) -
// data.begin(); //pair
/* 文字列回転
string N;
cin >> N;
N = N[N.length()-1] + N.substr(0,N.length()-1);
s = to_string(i); //ストリング変換
*/
/* 文字列合成
string N,M;
cin >> N >> M;
SINT64 ans = 0;
ans = stoi(N+M);
*/
/* 文字列変更
string s; cin >> s;
rep(i,0,s.length()) {
s[i] = (((s[i]-'A' + N) % 26) + 'A');
}
put(s);
*/
/*
//ワーシャルフロイド
vector<vector<SINT64>> dist(N,vector<SINT64>(N,INF64));
rep(i,0,N) {
dist[i][i] = 0;
}
rep(k,0,N) {
rep(i,0,N) {
rep(j,0,N) {
dist[i][j] = MIN(dist[i][j],
dist[i][k]+dist[k][j]);
}
}
}
*/
/* 優先度付きキュー
priority_queue<SINT64, vector<SINT64>, greater<SINT64>> bufq;
//小さいほうから取り出せる priority_queue<SINT64, vector<SINT64>> bufq;
//大きいほうから取り出せる
bufq.push(X); //X を挿入
bufq.top(); //先頭データ読み
bufq.pop(); //先頭データ削除
*/
/* キュー
queue<SINT64> bufq; //宣言
bufq.push(0); //挿入
bufq.front(); //先頭データ読み
bufq.pop(); //先頭データ削除
*/
/* SET コンテナ
set<SINT64> data;
data.insert(X); //X を挿入
data.erase(data.begin()); //先頭を削除
data.erase(--data.end()); //末尾を削除
*data.begin(); //先頭要素にアクセス
*data.rbegin(); //末尾要素にアクセス
//全表示
set<SINT64>::iterator it; //イテレータを用意
for(it = data.begin(); it != data.end(); it++) {
cout << *it << " ";
}
cout << endl;
//N番目を一部表示
set<SINT64>::iterator it; // イテレータを用意
it = data.begin();
rep (i,0,N) {
it++;
}
cout << *it << endl;
*/
/* map
map<string,SINT32> mp;
SINT32 N = 0;
SINT32 mx = 0;
cin >> N;
for (SINT32 i = 0; i < N; i++) {
string s;
cin >> s;
mp[s]++;
}
for(auto it=mp.begin();it!=mp.end();it++) {
mx=max(mx,it->second);
}
//abc146E
map<SINT64,SINT64> mp;
rep(i,0,N+1) {
ans += mp[rui[i]];
mp[rui[i]]++;
bufq.push(rui[i]);
if (bufq.size() == M) {
mp[bufq.front()]--;
bufq.pop();
}
}
*/
/*
//順列全表示
//sortしてからでないと全列挙にならない
sort(data.begin(),data.end());
do {
cout << buf << endl;
rep(i,0,R) {
cout << data[i] << " ";
}
cout << endl;
} while (next_permutation(data.begin(),data.end()));
*/
/* bit数数え上げ
SINT64 bits64(SINT64 bits)
{
bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555);
bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333);
bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f);
bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff);
return (bits & 0x0000ffff) + (bits >>16 & 0x0000ffff);
}
*/
// bitシフトのLONG対応
// ans += (1L<<50);
// 桁指定表示
// ans = ans * M_PI;
// cout << setprecision(15) << ans << endl;
// 桁数0埋め
// cout << std::setfill('0') << std::right << std::setw(2) << 5; //05
// 2次元累積和
/*
vector<vector<SINT64>> data(H,vector<SINT64>(W));
vector<vector<SINT64>> rui(H+1,vector<SINT64>(W+1));
rep(i,0,H) {
rep(j,0,W) {
cin >> data[i][j];
}
}
rep(i,1,H+1) {
rep(j,1,W+1) {
rui[i][j] = data[i-1][j-1] + rui[i][j-1];
}
}
rep(i,1,H+1) {
rep(j,1,W+1) {
rui[i][j] += rui[i-1][j];
}
}
*/
// 逆元 コンビネーション
/*
SINT64 modpow(SINT64 a, SINT64 p) {
if (p == 0) return 1;
if (p % 2 == 0) {
//pが偶数の時
SINT64 halfP = p / 2;
SINT64 half = modpow(a, halfP);
//a^(p/2) をhalfとして、half*halfを計算
return half * half % MOD;
} else {
//pが奇数の時は、偶数にするために1減らす
return a * modpow(a, p - 1) % MOD;
}
}
SINT64 calcComb(SINT64 a, SINT64 b) {
SINT64 Mul = 1;
SINT64 Div = 1;
SINT64 ans = 0;
if (b > a - b) {
return calcComb(a, a - b);
}
rep(i,0,b) {
Mul *= (a - i);
Div *= (i + 1);
Mul %= MOD;
Div %= MOD;
}
ans = Mul * modpow(Div, MOD - 2) % MOD;
return ans;
}
*/
/* UNION FIND
class UnionFind {
public:
vector<SINT64> parent;
UnionFind(SINT64 N) {
parent = vector<SINT64>(N+10, -1); //少し多めに
}
SINT64 root(SINT64 A) {
if (parent[A] < 0) {
return A;
} else {
parent[A] = root(parent[A]);
return parent[A];
}
}
SINT64 size(SINT64 A) {
return parent[root(A)] * (-1);
}
bool judge(SINT64 A, SINT64 B) {
A = root(A);
B = root(B);
if (A == B) {
return true; //同じグループ
} else {
return false; //違うグループ
}
}
void connect(SINT64 A, SINT64 B) {
A = root(A);
B = root(B);
if (A != B) {
if (size(A) < size(B)) {
swap(A, B);
}
parent[A] += parent[B];
parent[B] = A;
}
}
};
UnionFind uni(N);
*/
/* セグ木
class SegTree {
private:
SINT64 size;
vector<SINT64> node;
SINT64 jugdement(SINT64 a, SINT64 b) {
SINT64 ans = 0;
ans = a+b;
return ans;
}
public:
//コンストラクタ
SegTree(vector<SINT64> data) {
SINT64 ori_size;
ori_size = data.size();
size = 1;
while (size < ori_size) {
size *= 2;
}
node.resize(2*size-1, 0);
rep(i,0,ori_size) {
node[size-1+i] = data[i];
}
rrep(i,size-2,0) {
node[i] = jugdement(node[2*i+1], node[2*i+2]);
}
}
//データ更新
void update(SINT64 x, SINT64 val) {
x += (size - 1);
node[x] = val+node[x];
while(x > 0) {
x = (x - 1) / 2;
node[x] = jugdement(node[2*x+1], node[2*x+2]);
}
}
//データ取得 [a,b)
SINT64 getdata(SINT64 a, SINT64 b, SINT64 k = 0, SINT64 l = 0, SINT64 r
= -1) { if (r < 0) { r = size;
}
//要求範囲外
if ((r <= a) || (b <= l)) {
return 0;
}
//完全要求区間内
if ((a <= l) && (r <= b)) {
return node[k];
}
SINT64 vl = getdata(a, b, 2*k+1, l, (l+r)/2);
SINT64 vr = getdata(a, b, 2*k+2, (l+r)/2, r);
return jugdement(vl, vr);
}
//表示
void disp() {
rep(i,0,size) {
puts(node[size-1+i]);
} cout << endl;
}
void alldisp() {
SINT64 cnt = 0;
SINT64 end = 2;
while (1) {
puts(node[cnt]);
if (cnt == end-2) {
end *= 2;
cout << endl;
}
cnt++;
if (cnt == size*2-1) {
break;
}
}
}
};
SegTree seg(N);
*/
/* 最大フロー最小カット
class Dinic {
struct EDGE {
SINT64 to;
SINT64 cap;
SINT64 rev;
};
vector<vector<EDGE>> G;
vector<SINT64> level;
vector<SINT64> root;
SINT64 N;
public:
Dinic(SINT64 n) {
N = n;
G.resize(N);
level.resize(N);
}
void add(SINT64 a, SINT64 b, SINT64 cap) {
G[a].emplace_back((EDGE){b,cap,(SINT64)G[b].size()});
G[b].emplace_back((EDGE){a,0,(SINT64)G[a].size()-1});
}
void bfs(SINT64 s) {
level[s] = 0;
queue<SINT64> q;
q.push(s);
while(q.size() != 0) {
SINT64 buf = q.front();
q.pop();
rep(i,0,G[buf].size()) {
EDGE now = G[buf][i];
if ((now.cap > 0) && (level[now.to] == -1)) {
level[now.to] = level[buf]+1;
q.push(now.to);
}
}
}
}
SINT64 dfs(SINT64 now, SINT64 g, SINT64 flow) {
if (now == g) return flow;
rep(i,root[now],G[now].size()) {
EDGE buf = G[now][i];
root[now] = i;
//dsf進捗更新 if ((buf.cap > 0) && (level[buf.to] > level[now])) { SINT64 mi =
MIN(buf.cap,flow); SINT64 nowf = dfs(buf.to,g,mi); if (nowf > 0) { G[now][i].cap
-= nowf; //順経路に容量削減 G[buf.to][buf.rev].cap +=
nowf; //逆経路に容量追加 return nowf;
//今回探索のFLOW追加数
}
}
}
return 0;
}
SINT64 act(SINT64 s, SINT64 g) {
SINT64 cnt = 0;
//最大FLOWカウント if (s == g) return cnt;
//スタート＝ゴールは例外 while(1) { level.assign(N,-1);
//sからの最短距離初期化 root.assign(N,0);
//dsf進捗初期化 bfs(s); if (level[g] == -1) break;
//gへ到達不可 while(1) { SINT64 flow; flow = dfs(s,g,INF64); if (flow == 0)
break; cnt += flow;
}
}
return cnt;
}
};
*/
/* ダイクストラ
class Dijkstra {
vector<vector<Pll>> G;
vector<SINT64> dist;
public:
Dijkstra(SINT64 n) {
G.resize(n);
dist.resize(n, INF64);
}
void add(SINT64 a, SINT64 b, SINT64 cost) {
G[a].emplace_back(Pll(b,cost));
}
void form(SINT64 s) {
priority_queue<Pll, vector<Pll>, greater<Pll>> q;
q.push(Pll(0,s));
//cost,位置 while(q.size() != 0) { Pll now = q.top(); q.pop(); if (dist[now.S]
== INF64) { dist[now.S] = now.F; rep(i,0,G[now.S].size()) { Pll buf =
G[now.S][i]; if (dist[buf.F] == INF64) { q.push(Pll(buf.S+now.F,buf.F));
}
}
}
}
}
//form()で構築したsからの距離を返す
SINT64 get_dist(SINT64 a) {
if (dist[a] == INF64) {
return -1; //到達不可
} else {
return dist[a];
}
}
};
*/
/* LCA
class Lca {
vector<vector<SINT64>> G;
vector<vector<SINT64>> D; //ダブリング
vector<SINT64> depth;
SINT64 N;
SINT64 LOG_N;
public:
Lca(SINT64 n) {
N = n;
LOG_N = floor(log2(N));
G.resize(N);
D.resize(N);
depth.resize(N,-1);
}
void add(SINT64 a, SINT64 b) {
G[a].emplace_back(b);
G[b].emplace_back(a);
}
void bfs(SINT64 s) {
depth[s] = 0;
D[s].emplace_back(-1);
queue<SINT64> q;
q.push(s);
while(q.size() != 0) {
SINT64 now = q.front();
q.pop();
rep(i,0,G[now].size()) {
SINT64 next = G[now][i];
if (depth[next] == -1) {
depth[next] = depth[now]+1;
D[next].emplace_back(now);
q.push(next);
}
}
}
}
//頂点のsからのダブリング構築
void form(SINT64 s) {
bfs(s);
rep(i,1,LOG_N+1) {
rep(j,0,N) {
SINT64 buf = D[j][i-1];
if (buf == -1) {
D[j].emplace_back(-1);
} else {
D[j].emplace_back(D[buf][i-1]);
}
}
}
}
//aのx上の頂点を求める
SINT64 get(SINT64 a, SINT64 x) {
rrep(i,LOG_N,0) {
if (((x >> i) & 1) == 1) {
a = D[a][i];
if (a == -1) return -1;
}
}
return a;
}
//aとbの共通祖先を求める
SINT64 get_lca(SINT64 a, SINT64 b) {
if (depth[a] < depth[b]) swap(a,b);
SINT64 diff = depth[a] - depth[b];
a = get(a,diff);
//aのx上の頂点を求める if (a == b) return a; rrep(i,LOG_N,0) { if (D[a][i] !=
D[b][i]) { a = D[a][i]; b = D[b][i];
}
}
return D[a][0];
}
//aとbの共通祖先までの距離の合計を求める
SINT64 get_dist(SINT64 a, SINT64 b) {
SINT64 buf = get_lca(a,b);
return depth[a] + depth[b] - depth[buf]*2;
}
};
*/
/* ベルマンフォード
class Bellman {
struct EDGE {
SINT64 from;
SINT64 to;
SINT64 cost;
};
vector<EDGE> edges;
vector<SINT64> dist;
SINT64 N;
public:
Bellman(SINT64 n) {
N = n;
dist.resize(n, INF64);
}
void add(SINT64 from, SINT64 to, SINT64 cost) {
edges.emplace_back((EDGE){from,to,cost});
}
//sで構築したt迄の距離取得
SINT64 get_dist(SINT64 t) {
//到達不可はINF64
return dist[t];
}
//構築
//負の閉路無し : 0
//負の閉路有り : 1
//負の閉路有るが目的地gの更新は停止 : 2
SINT64 form(SINT64 s, SINT64 g) {
dist[s] = 0;
SINT64 cnt = 0;
SINT64 check = 0;
while(1) {
SINT64 renew = 0;
rep(i,0,edges.size()) {
EDGE e = edges[i];
if (dist[e.from] != INF64) {
if (dist[e.to] > dist[e.from] + e.cost)
{ renew = 1; dist[e.to] = dist[e.from] + e.cost;
}
}
}
if (renew == 0) return 0;
//N回更新後のgの距離と 2N回更新後のgの距離を比較
if (cnt == N) check = dist[g];
if (cnt > 2*N) {
if (check == dist[g]) return 2;
return 1;
}
cnt++;
}
}
};
*/
/*コンビネーション
class Comb {
vector<SINT64> base;
SINT64 N;
public:
Comb (SINT64 n) {
N = n+5;
base.resize(N);
base[0] = 1;
rep(i,1,N) {
base[i] = base[i-1]*i;
base[i] %= MOD;
}
}
SINT64 get_comb(SINT64 a, SINT64 b) {
SINT64 ans = 0;
SINT64 aa = base[a] * modpow(base[a-b], MOD - 2) % MOD;
ans = aa * modpow(base[b], MOD - 2) % MOD;
return ans;
}
SINT64 modpow(SINT64 a, SINT64 p) {
if (p == 0) return 1;
if (p % 2 == 0) {
SINT64 halfP = p / 2;
SINT64 half = modpow(a, halfP);
return half * half % MOD;
} else {
return a * modpow(a, p - 1) % MOD;
}
}
};
*/
/* SUFFIX ARRAY
class SaIs {
private:
string str;
SINT64 size; // 文字列サイズ+1(番兵)
SINT64 type = 255; // 文字種類数
vector<SINT64> bucket_cnt; // バケット 文字種ごとの数
vector<SINT64> bucket_st; // バケット 文字種の開始位置
vector<SINT64> bucket_end; // バケット 文字種の終了位置
vector<SINT64> lms; // 0:L 1:S 2:LMS
vector<SINT64> lms_pre; // LMS ソート前
vector<SINT64> lms_sort; // LMS ソート後
vector<SINT64> sais; // 最終配列
vector<string> array; // サフィックスアレイ
public:
// コンストラクタ
SaIs (string s) {
str = s + '$';
size = str.length();
lms.resize(size);
sais.resize(size);
bucket_cnt.resize(type);
bucket_st.resize(type);
bucket_end.resize(type);
// バケット位置作成
rep(i,0,size) bucket_cnt[str[i]]++;
// 個数作成
rep(i,1,type) bucket_st[i] = bucket_st[i-1] + bucket_cnt[i-1];
// 開始位置
rep(i,0,type) bucket_end[i] = bucket_st[i] + bucket_cnt[i]-1;
// 終了位置
// L S LMS判定
lms[size-1] = 1;
// 最後尾は一旦 S rrep(i,size-2,0) { if (str[i] > str[i+1]) lms[i] = 0;
// L
if (str[i] < str[i+1]) lms[i] = 1;
// S if (str[i] == str[i+1]) lms[i] = lms[i+1]; // 右と同じ
}
rrep(i,size-1,1) {
// 左がLのSはLMS if ((lms[i] == 1) && (lms[i-1] == 0)) lms[i] = 2; // LMS
}
rep(i,0,size) {
if (lms[i] == 2) lms_pre.emplace_back(i);
}
first_bucket(); // LMSの先頭文字でInduced
SortingしてLMSをソート second_bucket(); // ソートされたLMSでInduced Sorting
sais.erase(sais.begin()); // 番兵削除
str.pop_back(); // 番兵削除
size = str.length(); // size修正
array.resize(size);
// suffix array作成
rep(i,0,array.size()) {
array[i] = str.substr(sais[i]);
}
// rep(i,0,sais.size()) {puts(sais[i]);} cout << endl; //
表示用
// rep(i,0,array.size()) {put(array[i]);} cout << endl; //
表示用
}
void first_bucket(void) {
vector<SINT64> buf_bucket1(size,-1);
vector<SINT64> buf_bucket2(size,-1);
vector<SINT64> buf_cnt1(type,0);
vector<SINT64> buf_cnt2(type,0);
vector<SINT64> buf_cnt3(type,0);
// LMSをbuf_bucket1に格納
rep(i,0,lms_pre.size()) {
SINT64 cnt = lms_pre[i];
SINT64 buf;
buf = bucket_end[str[cnt]] - buf_cnt1[str[cnt]];
buf_bucket1[buf] = cnt;
buf_cnt1[str[cnt]]++;
}
// Lをbuf_bucket2に格納
rep(i,0,size) {
if ((buf_bucket1[i] != -1) && (buf_bucket1[i] != 0)) {
if (lms[buf_bucket1[i]-1] == 0) { //
-1がLの場合 SINT64 buf = str[buf_bucket1[i]-1]; buf_bucket1[bucket_st[buf] +
buf_cnt2[buf]] = buf_bucket1[i]-1; buf_bucket2[bucket_st[buf] + buf_cnt2[buf]] =
buf_bucket1[i]-1; buf_cnt2[buf]++;
}
}
}
// Sをbuf_bucket2に格納
rrep(i,size-1,0) {
if ((buf_bucket2[i] != -1) && (buf_bucket2[i] != 0)) {
if (lms[buf_bucket2[i]-1] != 0) { //
-1がS(LMS)の場合 SINT64 buf = str[buf_bucket2[i]-1]; buf_bucket2[bucket_end[buf]
- buf_cnt3[buf]] = buf_bucket2[i]-1; buf_cnt3[buf]++;
}
}
}
// lms_sortにLMSのソートを格納
rrep(i,size-1,0) {
if (buf_bucket2[i] != -1) {
if (lms[buf_bucket2[i]] == 2) {
lms_sort.emplace_back(buf_bucket2[i]);
}
}
}
lms_sort.emplace_back(size-1); // 番兵追加
}
void second_bucket(void) {
vector<SINT64> buf_bucket1(size,-1);
vector<SINT64> buf_bucket2(size,-1);
vector<SINT64> buf_cnt1(type,0);
vector<SINT64> buf_cnt2(type,0);
vector<SINT64> buf_cnt3(type,0);
// LMSをbuf_bucket1に格納
rep(i,0,lms_sort.size()) {
SINT64 cnt = lms_sort[i];
SINT64 buf;
buf = bucket_end[str[cnt]] - buf_cnt1[str[cnt]];
buf_bucket1[buf] = cnt;
buf_cnt1[str[cnt]]++;
}
// Lをsaisに格納
rep(i,0,size) {
if ((buf_bucket1[i] != -1) && (buf_bucket1[i] != 0)) {
if (lms[buf_bucket1[i]-1] == 0) { //
-1がLの場合 SINT64 buf = str[buf_bucket1[i]-1]; buf_bucket1[bucket_st[buf] +
buf_cnt2[buf]] = buf_bucket1[i]-1; sais[bucket_st[buf] + buf_cnt2[buf]] =
buf_bucket1[i]-1; buf_cnt2[buf]++;
}
}
}
// Sをsaisに格納
rrep(i,size-1,0) {
if ((sais[i] != -1) && (sais[i] != 0)) {
if (lms[sais[i]-1] != 0) { //
-1がS(LMS)の場合 SINT64 buf = str[sais[i]-1]; sais[bucket_end[buf] -
buf_cnt3[buf]] = sais[i]-1; buf_cnt3[buf]++;
}
}
}
sais[0] = size-1; // 番兵追加
}
};
*/
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(a) ((a) > (0) ? (a) : -(a))
#define rep(i, a, b) for (SINT64(i) = SINT64(a); (i) < SINT64(b); (i)++)
#define rrep(i, a, b) for (SINT64(i) = SINT64(a); (i) >= SINT64(b); (i)--)
#define put(a) cout << (a) << endl
#define puts(a) cout << (a) << " "
#define putr(a) \
rep(testIncrement, 0, a.size()) { puts(a[testIncrement]); } \
cout << endl
#define INF 1000000001
#define MOD 1000000007
#define INF64 1000000000000000001
#define F first
#define S second
#define Pii pair<SINT32, SINT32>
#define Pll pair<SINT64, SINT64>
#define Piii pair<SINT32, pair<SINT32, SINT32>>
#define Plll pair<SINT64, pair<SINT64, SINT64>>
#define Vll(a, b, c) vector<vector<SINT64>> (a)((b),vector<SINT64>((c))
#define Vlll(a, b, c, d) vector<vector<vector<SINT64>>> (a)((b),vector<vector<SINT64>>((c),vector<SINT64>((d)))
using namespace std;
class SegTree {
private:
SINT64 size;
vector<SINT64> node;
SINT64 jugdement(SINT64 a, SINT64 b) {
SINT64 ans = 0;
ans = MIN(a, b);
return ans;
}
public:
// コンストラクタ
SegTree(vector<SINT64> data) {
SINT64 ori_size;
ori_size = data.size();
size = 1;
while (size < ori_size) {
size *= 2;
}
node.resize(2 * size - 1, INF64);
rep(i, 0, ori_size) { node[size - 1 + i] = data[i]; }
rrep(i, size - 2, 0) {
node[i] = jugdement(node[2 * i + 1], node[2 * i + 2]);
}
}
// データ更新
void update(SINT64 x, SINT64 val) {
x += (size - 1);
node[x] = val + node[x];
while (x > 0) {
x = (x - 1) / 2;
node[x] = jugdement(node[2 * x + 1], node[2 * x + 2]);
}
}
// データ取得 [a,b)
SINT64 getdata(SINT64 a, SINT64 b, SINT64 k = 0, SINT64 l = 0,
SINT64 r = -1) {
if (r < 0) {
r = size;
}
// 要求範囲外
if ((r <= a) || (b <= l)) {
return INF64;
}
// 完全要求区間内
if ((a <= l) && (r <= b)) {
return node[k];
}
SINT64 vl = getdata(a, b, 2 * k + 1, l, (l + r) / 2);
SINT64 vr = getdata(a, b, 2 * k + 2, (l + r) / 2, r);
return jugdement(vl, vr);
}
};
class SuffixArray {
private:
vector<string> array; // サフィックスアレイ
vector<SINT64> lcp; // LCP
vector<SINT64> sais; // SA IS
string str;
public:
// コンストラクタ
SuffixArray(string s) {
str = s;
vector<SINT64> Vstr;
rep(i, 0, str.length()) { Vstr.emplace_back(str[i]); }
sais_act(Vstr, sais, 255); // SAIS実行
lcp_act(); // 隣り合うSUFFIXの先頭から同じ長さを算出
SegTree seg(lcp);
SINT64 ans = 0;
rep(i, 0, str.length()) {
rep(j, i + 1, str.length()) {
SINT64 a = ABS(sais[i] - sais[j]);
SINT64 b = seg.getdata(i, j);
// puts(i);puts(j);puts(a);put(b);
ans = MAX(ans, MIN(a, b));
}
}
put(ans);
// suffix array作成
// array.resize(str.length());
// rep(i,0,array.size()) {
// array[i] = str.substr(sais[i]);
// }
// rep(i,0,array.size()) {put(array[i]);} // 表示用
}
void lcp_act(void) {
lcp.resize(str.length());
vector<SINT64> buffer(str.length());
rep(i, 0, str.length()) { buffer[sais[i]] = i; }
SINT64 cnt = 0;
rep(i, 0, str.length()) {
if (buffer[i] >= str.length() - 1) {
cnt = 0;
} else {
SINT64 a = buffer[i];
SINT64 b = buffer[i] + 1;
while (1) {
if (cnt >= str.length() - sais[a])
break;
if (cnt >= str.length() - sais[a])
break;
if (str[sais[a] + cnt] == str[sais[b] + cnt]) {
cnt++;
} else {
break;
}
}
}
lcp[buffer[i]] = cnt;
if (cnt != 0)
cnt--;
}
}
// 引数の文字列が何個含まれるか算出
SINT64 get_cnt(string t) {
SINT64 low, high;
SINT64 L, R;
L = -1;
R = str.length();
while (R - L > 1) {
SINT64 M = (R + L) / 2;
string buf = str.substr(sais[M]);
if (buf.length() > t.length()) {
buf = buf.substr(0, t.length());
}
if (buf > t) {
R = M;
} else {
L = M;
}
}
high = R;
L = -1;
R = str.length();
while (R - L > 1) {
SINT64 M = (R + L) / 2;
string buf = str.substr(sais[M]);
if (buf >= t) {
R = M;
} else {
L = M;
}
}
low = R;
return high - low;
}
// SAIS実行
void sais_act(vector<SINT64> &Vstr, vector<SINT64> &r_sais, SINT64 type) {
Vstr.push_back(0); // 番兵追加
vector<SINT64> lms_seed; // LMS ソート前
vector<SINT64> lms_sort; // LMS ソート後
vector<SINT64> lms_long(Vstr.size(), 0); // LMS 長さ
vector<SINT64> lms_type(Vstr.size(), 1); // 0:L 1:S 2:LMS
vector<SINT64> lms_posi(Vstr.size(), -1); // LMS内での位置
SINT64 len = 0;
// L S LMS判定 初期値は全てS
rrep(i, Vstr.size() - 2, 0) {
len++;
if (Vstr[i] > Vstr[i + 1]) {
lms_type[i] = 0; // L
if (lms_type[i + 1] == 1) {
lms_type[i + 1] = 2; // LMS
lms_long[i + 1] = len; // LMSの長さ格納
len = 1;
}
}
if (Vstr[i] == Vstr[i + 1])
lms_type[i] = lms_type[i + 1]; // 右と同じ
}
SINT64 cnt = 0;
rep(i, 0, Vstr.size()) {
if (lms_type[i] == 2)
lms_seed.emplace_back(i);
if (lms_type[i] == 2)
lms_posi[i] = cnt++;
}
// Induced Sort初回
vector<SINT64> bucket; // Induced Sort初回結果格納用
induced_sort(Vstr, lms_seed, bucket, lms_type, type);
// lms_sortにLMSのソートを格納
rrep(i, Vstr.size() - 1, 0) {
if ((bucket[i] != -1) && (lms_type[bucket[i]] == 2)) {
lms_sort.emplace_back(bucket[i]);
}
}
SINT64 ok = 0; // 再帰必要性判定
SINT64 rank = 1; // 再帰用文字
vector<SINT64> next(lms_sort.size(), 1); // 再帰用文字列
rrep(i, lms_sort.size() - 2, 0) {
SINT64 A = lms_long[lms_sort[i]];
SINT64 B = lms_long[lms_sort[i + 1]];
if (A == B) {
SINT64 ck = 0;
rep(j, 0, A) {
if (Vstr[lms_sort[i] + j] != Vstr[lms_sort[i + 1] + j]) {
ck = 1;
break;
}
}
if (ck == 0) {
ok = 1; // 再帰必要
} else {
rank++;
}
} else {
rank++;
}
next[lms_posi[lms_sort[i]]] = rank;
}
if (ok == 1) {
vector<SINT64> recursive;
sais_act(next, recursive, rank + 1);
rep(i, 0, recursive.size()) {
lms_sort[recursive.size() - i - 1] = lms_seed[recursive[i]];
}
}
// SORT済みLMSでInduced Sorting
r_sais.resize(Vstr.size(), -1);
induced_sort(Vstr, lms_sort, r_sais, lms_type, type);
r_sais.erase(r_sais.begin()); // 番兵削除
}
// induced_sort
void induced_sort(vector<SINT64> &Vstr, vector<SINT64> &seed,
vector<SINT64> &bucket_sort, vector<SINT64> &lms_type,
SINT64 type) {
vector<SINT64> bucket_cnt(type, 0); // バケット 文字種ごとの数
vector<SINT64> bucket_st(type, 0); // バケット 文字種の開始位置
vector<SINT64> bucket_end(type, 0); // バケット 文字種の終了位置
vector<SINT64> bucket_pre(Vstr.size(), -1); // バケット 初回格納用
vector<SINT64> cnt1(type, 0);
vector<SINT64> cnt2(type, 0);
vector<SINT64> cnt3(type, 0);
bucket_sort.resize(Vstr.size(), -1);
// バケットソート位置作成
rep(i, 0, Vstr.size()) bucket_cnt[Vstr[i]]++; // 個数作成
rep(i, 1, type) bucket_st[i] =
bucket_st[i - 1] + bucket_cnt[i - 1]; // 開始位置
rep(i, 0, type) bucket_end[i] =
bucket_st[i] + bucket_cnt[i] - 1; // 終了位置
// LMSをbucket_preに格納
rep(i, 0, seed.size()) {
SINT64 no = seed[i];
bucket_pre[bucket_end[Vstr[no]] - cnt1[Vstr[no]]] = no;
cnt1[Vstr[no]]++;
}
// Lをbucket_sortに格納
rep(i, 0, Vstr.size()) {
if ((bucket_pre[i] != -1) && (bucket_pre[i] != 0)) {
if (lms_type[bucket_pre[i] - 1] == 0) { // -1がLの場合
SINT64 buf = Vstr[bucket_pre[i] - 1];
bucket_pre[bucket_st[buf] + cnt2[buf]] = bucket_pre[i] - 1;
bucket_sort[bucket_st[buf] + cnt2[buf]] = bucket_pre[i] - 1;
cnt2[buf]++;
}
}
}
// Sをbucket_sortに格納
bucket_sort[0] = Vstr.size() - 1; // 番兵追加
rrep(i, Vstr.size() - 1, 0) {
if ((bucket_sort[i] != -1) && (bucket_sort[i] != 0)) {
if (lms_type[bucket_sort[i] - 1] != 0) { // -1がS(LMS)の場合
SINT64 buf = Vstr[bucket_sort[i] - 1];
bucket_sort[bucket_end[buf] - cnt3[buf]] = bucket_sort[i] - 1;
cnt3[buf]++;
}
}
}
}
};
int main() {
SINT64 N;
cin >> N;
string s;
cin >> s;
SuffixArray sss(s);
return 0;
}
// vector<vector<SINT64>> data(N,vector<SINT64>(N));
////2次元配列 vector<vector<vector<SINT64>>>
//data(N,vector<vector<SINT64>>(N,vector<SINT64>(N))); //3次元配列
// Vll(data,N,N); //2次元配列
// Vlll(data,N,N,N); //3次元配列
// sort(data.begin(),data.end());
// sort(data.begin(),data.end(),std::greater<SINT64>());
// __gcd(A,B);
// reverse(data.begin(),data.end());
// 関数へのvectorポインタ渡し
// void dfs(SINT64 poi, SINT64 d, vector<vector<Pll>>& data) {
// }
/* 複数条件ソート
bool sortcompare(Pll A, Pll B) {
if(A.F == B.F){
return A.S > B.S;
} else {
return A.F < B.F;
}
}
sort(data.begin(),data.end(),sortcompare);
*/
// タプル
// vector<tuple<SINT64,SINT64,SINT64>> edges;
// edges.emplace_back(a,b,c);
// cout << get<0>(edges[i]);
// cout << get<1>(edges[i]);
// cout << get<2>(edges[i]);
// sort(begin(edges), end(edges)); //ソート
// data.emplace_back(BUF); //後ろに追加
// data.erase(std::unique(data.begin(), data.end()), data.end());
// //ソート後に使用 同じ値を消す
// data.insert(data.begin() + X, 0); //X番目の要素に0を挿入
// 隣接リスト
// vector<vector<SINT64>> data(N);
// data[ A ].emplace_back( B );
// 両端キュー
// deque<SINT64> data;
// data.emplace_front(buf); //先頭挿入
// lower_boundは値がなければ最大値(.size())を返す
// posi = lower_bound(data.begin(),data.end(), X) - data.begin();
// // X以上を探す posi = lower_bound(data.begin(),data.end(),make_pair(X,0)) -
// data.begin(); //pair
/* 文字列回転
string N;
cin >> N;
N = N[N.length()-1] + N.substr(0,N.length()-1);
s = to_string(i); //ストリング変換
*/
/* 文字列合成
string N,M;
cin >> N >> M;
SINT64 ans = 0;
ans = stoi(N+M);
*/
/* 文字列変更
string s; cin >> s;
rep(i,0,s.length()) {
s[i] = (((s[i]-'A' + N) % 26) + 'A');
}
put(s);
*/
/*
//ワーシャルフロイド
vector<vector<SINT64>> dist(N,vector<SINT64>(N,INF64));
rep(i,0,N) {
dist[i][i] = 0;
}
rep(k,0,N) {
rep(i,0,N) {
rep(j,0,N) {
dist[i][j] = MIN(dist[i][j],
dist[i][k]+dist[k][j]);
}
}
}
*/
/* 優先度付きキュー
priority_queue<SINT64, vector<SINT64>, greater<SINT64>> bufq;
//小さいほうから取り出せる priority_queue<SINT64, vector<SINT64>> bufq;
//大きいほうから取り出せる
bufq.push(X); //X を挿入
bufq.top(); //先頭データ読み
bufq.pop(); //先頭データ削除
*/
/* キュー
queue<SINT64> bufq; //宣言
bufq.push(0); //挿入
bufq.front(); //先頭データ読み
bufq.pop(); //先頭データ削除
*/
/* SET コンテナ
set<SINT64> data;
data.insert(X); //X を挿入
data.erase(data.begin()); //先頭を削除
data.erase(--data.end()); //末尾を削除
*data.begin(); //先頭要素にアクセス
*data.rbegin(); //末尾要素にアクセス
//全表示
set<SINT64>::iterator it; //イテレータを用意
for(it = data.begin(); it != data.end(); it++) {
cout << *it << " ";
}
cout << endl;
//N番目を一部表示
set<SINT64>::iterator it; // イテレータを用意
it = data.begin();
rep (i,0,N) {
it++;
}
cout << *it << endl;
*/
/* map
map<string,SINT32> mp;
SINT32 N = 0;
SINT32 mx = 0;
cin >> N;
for (SINT32 i = 0; i < N; i++) {
string s;
cin >> s;
mp[s]++;
}
for(auto it=mp.begin();it!=mp.end();it++) {
mx=max(mx,it->second);
}
//abc146E
map<SINT64,SINT64> mp;
rep(i,0,N+1) {
ans += mp[rui[i]];
mp[rui[i]]++;
bufq.push(rui[i]);
if (bufq.size() == M) {
mp[bufq.front()]--;
bufq.pop();
}
}
*/
/*
//順列全表示
//sortしてからでないと全列挙にならない
sort(data.begin(),data.end());
do {
cout << buf << endl;
rep(i,0,R) {
cout << data[i] << " ";
}
cout << endl;
} while (next_permutation(data.begin(),data.end()));
*/
/* bit数数え上げ
SINT64 bits64(SINT64 bits)
{
bits = (bits & 0x55555555) + (bits >> 1 & 0x55555555);
bits = (bits & 0x33333333) + (bits >> 2 & 0x33333333);
bits = (bits & 0x0f0f0f0f) + (bits >> 4 & 0x0f0f0f0f);
bits = (bits & 0x00ff00ff) + (bits >> 8 & 0x00ff00ff);
return (bits & 0x0000ffff) + (bits >>16 & 0x0000ffff);
}
*/
// bitシフトのLONG対応
// ans += (1L<<50);
// 桁指定表示
// ans = ans * M_PI;
// cout << setprecision(15) << ans << endl;
// 桁数0埋め
// cout << std::setfill('0') << std::right << std::setw(2) << 5; //05
// 2次元累積和
/*
vector<vector<SINT64>> data(H,vector<SINT64>(W));
vector<vector<SINT64>> rui(H+1,vector<SINT64>(W+1));
rep(i,0,H) {
rep(j,0,W) {
cin >> data[i][j];
}
}
rep(i,1,H+1) {
rep(j,1,W+1) {
rui[i][j] = data[i-1][j-1] + rui[i][j-1];
}
}
rep(i,1,H+1) {
rep(j,1,W+1) {
rui[i][j] += rui[i-1][j];
}
}
*/
// 逆元 コンビネーション
/*
SINT64 modpow(SINT64 a, SINT64 p) {
if (p == 0) return 1;
if (p % 2 == 0) {
//pが偶数の時
SINT64 halfP = p / 2;
SINT64 half = modpow(a, halfP);
//a^(p/2) をhalfとして、half*halfを計算
return half * half % MOD;
} else {
//pが奇数の時は、偶数にするために1減らす
return a * modpow(a, p - 1) % MOD;
}
}
SINT64 calcComb(SINT64 a, SINT64 b) {
SINT64 Mul = 1;
SINT64 Div = 1;
SINT64 ans = 0;
if (b > a - b) {
return calcComb(a, a - b);
}
rep(i,0,b) {
Mul *= (a - i);
Div *= (i + 1);
Mul %= MOD;
Div %= MOD;
}
ans = Mul * modpow(Div, MOD - 2) % MOD;
return ans;
}
*/
/* UNION FIND
class UnionFind {
public:
vector<SINT64> parent;
UnionFind(SINT64 N) {
parent = vector<SINT64>(N+10, -1); //少し多めに
}
SINT64 root(SINT64 A) {
if (parent[A] < 0) {
return A;
} else {
parent[A] = root(parent[A]);
return parent[A];
}
}
SINT64 size(SINT64 A) {
return parent[root(A)] * (-1);
}
bool judge(SINT64 A, SINT64 B) {
A = root(A);
B = root(B);
if (A == B) {
return true; //同じグループ
} else {
return false; //違うグループ
}
}
void connect(SINT64 A, SINT64 B) {
A = root(A);
B = root(B);
if (A != B) {
if (size(A) < size(B)) {
swap(A, B);
}
parent[A] += parent[B];
parent[B] = A;
}
}
};
UnionFind uni(N);
*/
/* セグ木
class SegTree {
private:
SINT64 size;
vector<SINT64> node;
SINT64 jugdement(SINT64 a, SINT64 b) {
SINT64 ans = 0;
ans = a+b;
return ans;
}
public:
//コンストラクタ
SegTree(vector<SINT64> data) {
SINT64 ori_size;
ori_size = data.size();
size = 1;
while (size < ori_size) {
size *= 2;
}
node.resize(2*size-1, 0);
rep(i,0,ori_size) {
node[size-1+i] = data[i];
}
rrep(i,size-2,0) {
node[i] = jugdement(node[2*i+1], node[2*i+2]);
}
}
//データ更新
void update(SINT64 x, SINT64 val) {
x += (size - 1);
node[x] = val+node[x];
while(x > 0) {
x = (x - 1) / 2;
node[x] = jugdement(node[2*x+1], node[2*x+2]);
}
}
//データ取得 [a,b)
SINT64 getdata(SINT64 a, SINT64 b, SINT64 k = 0, SINT64 l = 0, SINT64 r
= -1) { if (r < 0) { r = size;
}
//要求範囲外
if ((r <= a) || (b <= l)) {
return 0;
}
//完全要求区間内
if ((a <= l) && (r <= b)) {
return node[k];
}
SINT64 vl = getdata(a, b, 2*k+1, l, (l+r)/2);
SINT64 vr = getdata(a, b, 2*k+2, (l+r)/2, r);
return jugdement(vl, vr);
}
//表示
void disp() {
rep(i,0,size) {
puts(node[size-1+i]);
} cout << endl;
}
void alldisp() {
SINT64 cnt = 0;
SINT64 end = 2;
while (1) {
puts(node[cnt]);
if (cnt == end-2) {
end *= 2;
cout << endl;
}
cnt++;
if (cnt == size*2-1) {
break;
}
}
}
};
SegTree seg(N);
*/
/* 最大フロー最小カット
class Dinic {
struct EDGE {
SINT64 to;
SINT64 cap;
SINT64 rev;
};
vector<vector<EDGE>> G;
vector<SINT64> level;
vector<SINT64> root;
SINT64 N;
public:
Dinic(SINT64 n) {
N = n;
G.resize(N);
level.resize(N);
}
void add(SINT64 a, SINT64 b, SINT64 cap) {
G[a].emplace_back((EDGE){b,cap,(SINT64)G[b].size()});
G[b].emplace_back((EDGE){a,0,(SINT64)G[a].size()-1});
}
void bfs(SINT64 s) {
level[s] = 0;
queue<SINT64> q;
q.push(s);
while(q.size() != 0) {
SINT64 buf = q.front();
q.pop();
rep(i,0,G[buf].size()) {
EDGE now = G[buf][i];
if ((now.cap > 0) && (level[now.to] == -1)) {
level[now.to] = level[buf]+1;
q.push(now.to);
}
}
}
}
SINT64 dfs(SINT64 now, SINT64 g, SINT64 flow) {
if (now == g) return flow;
rep(i,root[now],G[now].size()) {
EDGE buf = G[now][i];
root[now] = i;
//dsf進捗更新 if ((buf.cap > 0) && (level[buf.to] > level[now])) { SINT64 mi =
MIN(buf.cap,flow); SINT64 nowf = dfs(buf.to,g,mi); if (nowf > 0) { G[now][i].cap
-= nowf; //順経路に容量削減 G[buf.to][buf.rev].cap +=
nowf; //逆経路に容量追加 return nowf;
//今回探索のFLOW追加数
}
}
}
return 0;
}
SINT64 act(SINT64 s, SINT64 g) {
SINT64 cnt = 0;
//最大FLOWカウント if (s == g) return cnt;
//スタート＝ゴールは例外 while(1) { level.assign(N,-1);
//sからの最短距離初期化 root.assign(N,0);
//dsf進捗初期化 bfs(s); if (level[g] == -1) break;
//gへ到達不可 while(1) { SINT64 flow; flow = dfs(s,g,INF64); if (flow == 0)
break; cnt += flow;
}
}
return cnt;
}
};
*/
/* ダイクストラ
class Dijkstra {
vector<vector<Pll>> G;
vector<SINT64> dist;
public:
Dijkstra(SINT64 n) {
G.resize(n);
dist.resize(n, INF64);
}
void add(SINT64 a, SINT64 b, SINT64 cost) {
G[a].emplace_back(Pll(b,cost));
}
void form(SINT64 s) {
priority_queue<Pll, vector<Pll>, greater<Pll>> q;
q.push(Pll(0,s));
//cost,位置 while(q.size() != 0) { Pll now = q.top(); q.pop(); if (dist[now.S]
== INF64) { dist[now.S] = now.F; rep(i,0,G[now.S].size()) { Pll buf =
G[now.S][i]; if (dist[buf.F] == INF64) { q.push(Pll(buf.S+now.F,buf.F));
}
}
}
}
}
//form()で構築したsからの距離を返す
SINT64 get_dist(SINT64 a) {
if (dist[a] == INF64) {
return -1; //到達不可
} else {
return dist[a];
}
}
};
*/
/* LCA
class Lca {
vector<vector<SINT64>> G;
vector<vector<SINT64>> D; //ダブリング
vector<SINT64> depth;
SINT64 N;
SINT64 LOG_N;
public:
Lca(SINT64 n) {
N = n;
LOG_N = floor(log2(N));
G.resize(N);
D.resize(N);
depth.resize(N,-1);
}
void add(SINT64 a, SINT64 b) {
G[a].emplace_back(b);
G[b].emplace_back(a);
}
void bfs(SINT64 s) {
depth[s] = 0;
D[s].emplace_back(-1);
queue<SINT64> q;
q.push(s);
while(q.size() != 0) {
SINT64 now = q.front();
q.pop();
rep(i,0,G[now].size()) {
SINT64 next = G[now][i];
if (depth[next] == -1) {
depth[next] = depth[now]+1;
D[next].emplace_back(now);
q.push(next);
}
}
}
}
//頂点のsからのダブリング構築
void form(SINT64 s) {
bfs(s);
rep(i,1,LOG_N+1) {
rep(j,0,N) {
SINT64 buf = D[j][i-1];
if (buf == -1) {
D[j].emplace_back(-1);
} else {
D[j].emplace_back(D[buf][i-1]);
}
}
}
}
//aのx上の頂点を求める
SINT64 get(SINT64 a, SINT64 x) {
rrep(i,LOG_N,0) {
if (((x >> i) & 1) == 1) {
a = D[a][i];
if (a == -1) return -1;
}
}
return a;
}
//aとbの共通祖先を求める
SINT64 get_lca(SINT64 a, SINT64 b) {
if (depth[a] < depth[b]) swap(a,b);
SINT64 diff = depth[a] - depth[b];
a = get(a,diff);
//aのx上の頂点を求める if (a == b) return a; rrep(i,LOG_N,0) { if (D[a][i] !=
D[b][i]) { a = D[a][i]; b = D[b][i];
}
}
return D[a][0];
}
//aとbの共通祖先までの距離の合計を求める
SINT64 get_dist(SINT64 a, SINT64 b) {
SINT64 buf = get_lca(a,b);
return depth[a] + depth[b] - depth[buf]*2;
}
};
*/
/* ベルマンフォード
class Bellman {
struct EDGE {
SINT64 from;
SINT64 to;
SINT64 cost;
};
vector<EDGE> edges;
vector<SINT64> dist;
SINT64 N;
public:
Bellman(SINT64 n) {
N = n;
dist.resize(n, INF64);
}
void add(SINT64 from, SINT64 to, SINT64 cost) {
edges.emplace_back((EDGE){from,to,cost});
}
//sで構築したt迄の距離取得
SINT64 get_dist(SINT64 t) {
//到達不可はINF64
return dist[t];
}
//構築
//負の閉路無し : 0
//負の閉路有り : 1
//負の閉路有るが目的地gの更新は停止 : 2
SINT64 form(SINT64 s, SINT64 g) {
dist[s] = 0;
SINT64 cnt = 0;
SINT64 check = 0;
while(1) {
SINT64 renew = 0;
rep(i,0,edges.size()) {
EDGE e = edges[i];
if (dist[e.from] != INF64) {
if (dist[e.to] > dist[e.from] + e.cost)
{ renew = 1; dist[e.to] = dist[e.from] + e.cost;
}
}
}
if (renew == 0) return 0;
//N回更新後のgの距離と 2N回更新後のgの距離を比較
if (cnt == N) check = dist[g];
if (cnt > 2*N) {
if (check == dist[g]) return 2;
return 1;
}
cnt++;
}
}
};
*/
/*コンビネーション
class Comb {
vector<SINT64> base;
SINT64 N;
public:
Comb (SINT64 n) {
N = n+5;
base.resize(N);
base[0] = 1;
rep(i,1,N) {
base[i] = base[i-1]*i;
base[i] %= MOD;
}
}
SINT64 get_comb(SINT64 a, SINT64 b) {
SINT64 ans = 0;
SINT64 aa = base[a] * modpow(base[a-b], MOD - 2) % MOD;
ans = aa * modpow(base[b], MOD - 2) % MOD;
return ans;
}
SINT64 modpow(SINT64 a, SINT64 p) {
if (p == 0) return 1;
if (p % 2 == 0) {
SINT64 halfP = p / 2;
SINT64 half = modpow(a, halfP);
return half * half % MOD;
} else {
return a * modpow(a, p - 1) % MOD;
}
}
};
*/
/* SUFFIX ARRAY
class SaIs {
private:
string str;
SINT64 size; // 文字列サイズ+1(番兵)
SINT64 type = 255; // 文字種類数
vector<SINT64> bucket_cnt; // バケット 文字種ごとの数
vector<SINT64> bucket_st; // バケット 文字種の開始位置
vector<SINT64> bucket_end; // バケット 文字種の終了位置
vector<SINT64> lms; // 0:L 1:S 2:LMS
vector<SINT64> lms_pre; // LMS ソート前
vector<SINT64> lms_sort; // LMS ソート後
vector<SINT64> sais; // 最終配列
vector<string> array; // サフィックスアレイ
public:
// コンストラクタ
SaIs (string s) {
str = s + '$';
size = str.length();
lms.resize(size);
sais.resize(size);
bucket_cnt.resize(type);
bucket_st.resize(type);
bucket_end.resize(type);
// バケット位置作成
rep(i,0,size) bucket_cnt[str[i]]++;
// 個数作成
rep(i,1,type) bucket_st[i] = bucket_st[i-1] + bucket_cnt[i-1];
// 開始位置
rep(i,0,type) bucket_end[i] = bucket_st[i] + bucket_cnt[i]-1;
// 終了位置
// L S LMS判定
lms[size-1] = 1;
// 最後尾は一旦 S rrep(i,size-2,0) { if (str[i] > str[i+1]) lms[i] = 0;
// L
if (str[i] < str[i+1]) lms[i] = 1;
// S if (str[i] == str[i+1]) lms[i] = lms[i+1]; // 右と同じ
}
rrep(i,size-1,1) {
// 左がLのSはLMS if ((lms[i] == 1) && (lms[i-1] == 0)) lms[i] = 2; // LMS
}
rep(i,0,size) {
if (lms[i] == 2) lms_pre.emplace_back(i);
}
first_bucket(); // LMSの先頭文字でInduced
SortingしてLMSをソート second_bucket(); // ソートされたLMSでInduced Sorting
sais.erase(sais.begin()); // 番兵削除
str.pop_back(); // 番兵削除
size = str.length(); // size修正
array.resize(size);
// suffix array作成
rep(i,0,array.size()) {
array[i] = str.substr(sais[i]);
}
// rep(i,0,sais.size()) {puts(sais[i]);} cout << endl; //
表示用
// rep(i,0,array.size()) {put(array[i]);} cout << endl; //
表示用
}
void first_bucket(void) {
vector<SINT64> buf_bucket1(size,-1);
vector<SINT64> buf_bucket2(size,-1);
vector<SINT64> buf_cnt1(type,0);
vector<SINT64> buf_cnt2(type,0);
vector<SINT64> buf_cnt3(type,0);
// LMSをbuf_bucket1に格納
rep(i,0,lms_pre.size()) {
SINT64 cnt = lms_pre[i];
SINT64 buf;
buf = bucket_end[str[cnt]] - buf_cnt1[str[cnt]];
buf_bucket1[buf] = cnt;
buf_cnt1[str[cnt]]++;
}
// Lをbuf_bucket2に格納
rep(i,0,size) {
if ((buf_bucket1[i] != -1) && (buf_bucket1[i] != 0)) {
if (lms[buf_bucket1[i]-1] == 0) { //
-1がLの場合 SINT64 buf = str[buf_bucket1[i]-1]; buf_bucket1[bucket_st[buf] +
buf_cnt2[buf]] = buf_bucket1[i]-1; buf_bucket2[bucket_st[buf] + buf_cnt2[buf]] =
buf_bucket1[i]-1; buf_cnt2[buf]++;
}
}
}
// Sをbuf_bucket2に格納
rrep(i,size-1,0) {
if ((buf_bucket2[i] != -1) && (buf_bucket2[i] != 0)) {
if (lms[buf_bucket2[i]-1] != 0) { //
-1がS(LMS)の場合 SINT64 buf = str[buf_bucket2[i]-1]; buf_bucket2[bucket_end[buf]
- buf_cnt3[buf]] = buf_bucket2[i]-1; buf_cnt3[buf]++;
}
}
}
// lms_sortにLMSのソートを格納
rrep(i,size-1,0) {
if (buf_bucket2[i] != -1) {
if (lms[buf_bucket2[i]] == 2) {
lms_sort.emplace_back(buf_bucket2[i]);
}
}
}
lms_sort.emplace_back(size-1); // 番兵追加
}
void second_bucket(void) {
vector<SINT64> buf_bucket1(size,-1);
vector<SINT64> buf_bucket2(size,-1);
vector<SINT64> buf_cnt1(type,0);
vector<SINT64> buf_cnt2(type,0);
vector<SINT64> buf_cnt3(type,0);
// LMSをbuf_bucket1に格納
rep(i,0,lms_sort.size()) {
SINT64 cnt = lms_sort[i];
SINT64 buf;
buf = bucket_end[str[cnt]] - buf_cnt1[str[cnt]];
buf_bucket1[buf] = cnt;
buf_cnt1[str[cnt]]++;
}
// Lをsaisに格納
rep(i,0,size) {
if ((buf_bucket1[i] != -1) && (buf_bucket1[i] != 0)) {
if (lms[buf_bucket1[i]-1] == 0) { //
-1がLの場合 SINT64 buf = str[buf_bucket1[i]-1]; buf_bucket1[bucket_st[buf] +
buf_cnt2[buf]] = buf_bucket1[i]-1; sais[bucket_st[buf] + buf_cnt2[buf]] =
buf_bucket1[i]-1; buf_cnt2[buf]++;
}
}
}
// Sをsaisに格納
rrep(i,size-1,0) {
if ((sais[i] != -1) && (sais[i] != 0)) {
if (lms[sais[i]-1] != 0) { //
-1がS(LMS)の場合 SINT64 buf = str[sais[i]-1]; sais[bucket_end[buf] -
buf_cnt3[buf]] = sais[i]-1; buf_cnt3[buf]++;
}
}
}
sais[0] = size-1; // 番兵追加
}
};
*/
| replace | 144 | 146 | 144 | 146 | 0 | |
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
const ll MOD = 1e9 + 7;
const ll inf = (LLONG_MAX >> 2);
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n;
string s;
cin >> n >> s;
ll ans = 0;
for (ll l = n / 2; l > 0; --l) {
if (l <= ans)
break;
for (ll i = 0; i < n; ++i) {
for (ll j = l; j < n; ++j) {
for (ll k = i; k < j and j + k - i < n; ++k) {
if (s[k] != s[j + k - i])
break;
ans = max(ans, k - i + 1);
}
}
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
const ll MOD = 1e9 + 7;
const ll inf = (LLONG_MAX >> 2);
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll n;
string s;
cin >> n >> s;
ll ans = 0;
for (ll l = n - 1; l > 0; --l) {
ll crt = 0;
for (ll i = 0; i + l < n; ++i) {
if (s[i] == s[i + l]) {
++crt;
ans = max(ans, min(l, crt));
} else
crt = 0;
}
}
cout << ans;
return 0;
} | replace | 12 | 23 | 12 | 20 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<int> z_algorithm(string s) {
vector<int> a(s.size());
int c = 0;
for (int i = 1; i < s.size(); i++) {
if (i + a[i - c] < c + a[c]) {
a[i] = a[i - c];
} else {
int j = max(0, c + a[c] - i);
while (i + j < s.size() && s[j] == s[i + j])
++j;
a[i] = j;
}
}
a[0] = a.size();
return a;
}
int main() {
int n;
string s;
cin >> n >> s;
int ans = 0;
for (int i = 0; i < n - 1; i++) {
auto z = z_algorithm(s.substr(i));
for (int j = 0; j < z.size(); j++) {
if (z[j] - 1 < j) {
ans = max(ans, z[j]);
}
}
}
cout << ans << endl;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<int> z_algorithm(string s) {
vector<int> a(s.size());
int c = 0;
for (int i = 1; i < s.size(); i++) {
if (i + a[i - c] < c + a[c]) {
a[i] = a[i - c];
} else {
int j = max(0, c + a[c] - i);
while (i + j < s.size() && s[j] == s[i + j])
++j;
a[i] = j;
c = i;
}
}
a[0] = a.size();
return a;
}
int main() {
int n;
string s;
cin >> n >> s;
int ans = 0;
for (int i = 0; i < n - 1; i++) {
auto z = z_algorithm(s.substr(i));
for (int j = 0; j < z.size(); j++) {
if (z[j] - 1 < j) {
ans = max(ans, z[j]);
}
}
}
cout << ans << endl;
} | insert | 17 | 17 | 17 | 18 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
typedef uint32_t u32;
typedef int32_t s32;
typedef vector<s32> vs32;
typedef vector<u32> vu32;
typedef vector<s64> vs64;
typedef vector<u64> vu64;
const double PI = 3.14159265358979323846;
#define MAX(x, y) ((x) < (y) ? (y) : (x))
#define MIN(x, y) ((x) > (y) ? (y) : (x))
#define rep(i, N) for (int i = 0; i < N; ++i)
#define CEIL(x, y) (((x) + (y)-1) / (y))
#define MOD 1000000007ULL
#define IN(l, r, x) ((l) <= (x) && (x) < (r))
int n;
string s;
bool ok(int len) {
bool ret = 0;
for (int i = 0; i < n - len; ++i) {
map<string, bool> m;
m[s.substr(i, len)] = true;
for (int j = i + len; j < n; ++j) {
if (m[s.substr(j, len)])
ret = true;
}
}
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
cin >> s;
int l = 0, r = n / 2 + 1;
while (l + 1 < r) {
int m = (l + r) / 2;
if (ok(m)) {
l = m;
} else {
r = m;
}
}
cout << l << "\n";
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
typedef uint32_t u32;
typedef int32_t s32;
typedef vector<s32> vs32;
typedef vector<u32> vu32;
typedef vector<s64> vs64;
typedef vector<u64> vu64;
const double PI = 3.14159265358979323846;
#define MAX(x, y) ((x) < (y) ? (y) : (x))
#define MIN(x, y) ((x) > (y) ? (y) : (x))
#define rep(i, N) for (int i = 0; i < N; ++i)
#define CEIL(x, y) (((x) + (y)-1) / (y))
#define MOD 1000000007ULL
#define IN(l, r, x) ((l) <= (x) && (x) < (r))
int n;
string s;
bool ok(int len) {
bool ret = false;
map<string, int> m;
for (int i = 0; i <= n - len; ++i) {
string t = s.substr(i, len);
if (m[t] == 0) {
m[t] = i + 1 + len;
} else if (m[t] <= i + 1) {
ret = true;
}
}
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
cin >> s;
int l = 0, r = n / 2 + 1;
while (l + 1 < r) {
int m = (l + r) / 2;
if (ok(m)) {
l = m;
} else {
r = m;
}
}
cout << l << "\n";
return 0;
}
| replace | 44 | 51 | 44 | 52 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "../../dump.hpp"
#else
#define dump(...)
#endif
#define int ll
#define rep(i, n) for (int i = 0, i##_cond = (n); i < i##_cond; ++i)
#define FOR(i, a, b) for (int i = (a), i##_cond = (b); i < i##_cond; ++i)
#define ROF(i, a, b) \
for (int i = (a)-1, i##_cond = (b); i >= i##_cond; --i) // ROF(i,n,0)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend() // sortで降順
#define SUM(a) accumulate(all(a), int(0))
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using pii = pair<int, int>;
constexpr ll inf = 1ll << 61;
constexpr ll mod = 1e9 + 7;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> T add(const T &a, const T &b) { return (a + b) % mod; }
template <unsigned mod> struct RollingHash {
vector<unsigned> hashed, power;
inline unsigned mul(unsigned a, unsigned b) const {
unsigned long long x = (unsigned long long)a * b;
unsigned xh = (unsigned)(x >> 32), xl = (unsigned)x, d, m;
asm("divl %4; \n\t" : "=a"(d), "=d"(m) : "d"(xh), "a"(xl), "r"(mod));
return m;
}
RollingHash(const string &s, unsigned base = 10007) {
int sz = (int)s.size();
hashed.assign(sz + 1, 0);
power.assign(sz + 1, 0);
power[0] = 1;
for (int i = 0; i < sz; i++) {
power[i + 1] = mul(power[i], base);
hashed[i + 1] = mul(hashed[i], base) + s[i];
if (hashed[i + 1] >= mod)
hashed[i + 1] -= mod;
}
}
unsigned get(int l, int r) const {
unsigned ret = hashed[r] + mod - mul(hashed[l], power[r - l]);
if (ret >= mod)
ret -= mod;
return ret;
}
unsigned connect(unsigned h1, int h2, int h2len) const {
unsigned ret = mul(h1, power[h2len]) + h2;
if (ret >= mod)
ret -= mod;
return ret;
}
int LCP(const RollingHash<mod> &b, int l1, int r1, int l2, int r2) {
int len = min(r1 - l1, r2 - l2);
int low = -1, high = len + 1;
while (high - low > 1) {
int mid = (low + high) / 2;
if (get(l1, l1 + mid) == b.get(l2, l2 + mid))
low = mid;
else
high = mid;
}
return (low);
}
};
using RH = RollingHash<1000000007>;
signed main() {
int n;
cin >> n;
string s;
cin >> s;
RH rh(s);
int ans = 0;
rep(i, n) FOR(j, i + 1, n) { // i : 左, j : 右
int ok = 0;
int ng = n;
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2; // 文字数
bool f;
if (i + mid <= j and j + mid <= n) {
if (rh.get(i, i + mid - 1) == rh.get(j, j + mid - 1) and
s.substr(i, mid) == s.substr(j, mid))
f = true;
else
f = false;
} else {
f = false;
}
if (f) {
ok = mid;
} else {
ng = mid;
}
}
chmax(ans, ok);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "../../dump.hpp"
#else
#define dump(...)
#endif
#define int ll
#define rep(i, n) for (int i = 0, i##_cond = (n); i < i##_cond; ++i)
#define FOR(i, a, b) for (int i = (a), i##_cond = (b); i < i##_cond; ++i)
#define ROF(i, a, b) \
for (int i = (a)-1, i##_cond = (b); i >= i##_cond; --i) // ROF(i,n,0)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend() // sortで降順
#define SUM(a) accumulate(all(a), int(0))
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using pii = pair<int, int>;
constexpr ll inf = 1ll << 61;
constexpr ll mod = 1e9 + 7;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> T add(const T &a, const T &b) { return (a + b) % mod; }
template <unsigned mod> struct RollingHash {
vector<unsigned> hashed, power;
inline unsigned mul(unsigned a, unsigned b) const {
unsigned long long x = (unsigned long long)a * b;
unsigned xh = (unsigned)(x >> 32), xl = (unsigned)x, d, m;
asm("divl %4; \n\t" : "=a"(d), "=d"(m) : "d"(xh), "a"(xl), "r"(mod));
return m;
}
RollingHash(const string &s, unsigned base = 10007) {
int sz = (int)s.size();
hashed.assign(sz + 1, 0);
power.assign(sz + 1, 0);
power[0] = 1;
for (int i = 0; i < sz; i++) {
power[i + 1] = mul(power[i], base);
hashed[i + 1] = mul(hashed[i], base) + s[i];
if (hashed[i + 1] >= mod)
hashed[i + 1] -= mod;
}
}
unsigned get(int l, int r) const {
unsigned ret = hashed[r] + mod - mul(hashed[l], power[r - l]);
if (ret >= mod)
ret -= mod;
return ret;
}
unsigned connect(unsigned h1, int h2, int h2len) const {
unsigned ret = mul(h1, power[h2len]) + h2;
if (ret >= mod)
ret -= mod;
return ret;
}
int LCP(const RollingHash<mod> &b, int l1, int r1, int l2, int r2) {
int len = min(r1 - l1, r2 - l2);
int low = -1, high = len + 1;
while (high - low > 1) {
int mid = (low + high) / 2;
if (get(l1, l1 + mid) == b.get(l2, l2 + mid))
low = mid;
else
high = mid;
}
return (low);
}
};
using RH = RollingHash<1000000007>;
signed main() {
int n;
cin >> n;
string s;
cin >> s;
RH rh(s);
int ans = 0;
rep(i, n) FOR(j, i + 1, n) { // i : 左, j : 右
int ok = 0;
int ng = n;
while (abs(ok - ng) > 1) {
int mid = (ok + ng) / 2; // 文字数
bool f;
if (i + mid <= j and j + mid <= n) {
if (rh.get(i, i + mid) == rh.get(j, j + mid))
f = true;
else
f = false;
} else {
f = false;
}
if (f) {
ok = mid;
} else {
ng = mid;
}
}
chmax(ans, ok);
}
cout << ans << endl;
}
| replace | 102 | 104 | 102 | 103 | TLE | |
p02913 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define vi vector<int>
#define br cout << "\n";
#define all(x) (x).begin(), (x).end()
#define tr(c, i) for (auto i : c)
#define pii pair<int, int>
#define fast_io() \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr)
#define pq \
priority_queue<pair<ll, pii>, vector<pair<ll, pii>>, greater<pair<ll, pii>>> \
p; // container adapter makes ascending q
#define er(x) cout << x << " "
#define err(x, y) cout << x << " " << y
const int M = 200005;
using namespace std;
clock_t time_p = clock();
void dem() {
time_p = clock() - time_p;
cerr << "Time Taken : " << (float)(time_p) / CLOCKS_PER_SEC << "\n";
}
using namespace std;
const int N = 5 * 1000;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
int lcp[N][N];
int main() {
int n;
cin >> n;
string s;
cin >> s;
int res = 0;
for (int i = n - 1; i >= 0; --i) {
for (int j = n - 1; j >= i; --j) {
lcp[i][j] = s[i] == s[j] ? 1 + lcp[i + 1][j + 1] : 0;
res = max(min(j - i, lcp[i][j]), res);
}
}
cout << res;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define vi vector<int>
#define br cout << "\n";
#define all(x) (x).begin(), (x).end()
#define tr(c, i) for (auto i : c)
#define pii pair<int, int>
#define fast_io() \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr)
#define pq \
priority_queue<pair<ll, pii>, vector<pair<ll, pii>>, greater<pair<ll, pii>>> \
p; // container adapter makes ascending q
#define er(x) cout << x << " "
#define err(x, y) cout << x << " " << y
const int M = 200005;
using namespace std;
clock_t time_p = clock();
void dem() {
time_p = clock() - time_p;
cerr << "Time Taken : " << (float)(time_p) / CLOCKS_PER_SEC << "\n";
}
using namespace std;
const int N = 5 * 1000 + 10;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
int lcp[N][N];
int main() {
int n;
cin >> n;
string s;
cin >> s;
int res = 0;
for (int i = n - 1; i >= 0; --i) {
for (int j = n - 1; j >= i; --j) {
lcp[i][j] = s[i] == s[j] ? 1 + lcp[i + 1][j + 1] : 0;
res = max(min(j - i, lcp[i][j]), res);
}
}
cout << res;
return 0;
}
| replace | 28 | 29 | 28 | 29 | 127 | /tmp/39d3ed9e-dd4c-4b99-85ab-b18a4b004228.out: error while loading shared libraries: libc.so.6: failed to map segment from shared object
|
p02913 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m, i, j, k, l, ma, res = 0;
vector<int> v[26];
string s;
cin >> n;
cin >> s;
for (i = n - 1; i >= 0; i--)
v[(int)(s[i] - 'a')].push_back(i);
for (i = 0; i < n - 1; i++) {
m = (int)(s[i] - 'a');
if (v[m].size() < 2)
continue;
for (j = 0; j < v[m].size() - 1; j++) {
k = v[m][j];
if (min(k - i, n - k) <= res)
continue;
if (s.substr(i, res + 1) != s.substr(k, res + 1))
continue;
res++;
ma = min(k - i, n - k);
if (ma == res)
continue;
l = ma;
while (ma > res) {
if (s.substr(i, l) != s.substr(k, l)) {
if (ma == l)
ma--;
l = (l + res) / 2;
} else {
res = l;
l = (ma + res + 1) / 2;
}
}
}
v[m].pop_back();
}
cout << res << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m, i, j, k, l, ma, res = 0;
vector<int> v[26];
string s;
cin >> n;
cin >> s;
for (i = n - 1; i >= 0; i--)
v[(int)(s[i] - 'a')].push_back(i);
for (i = 0; i < n - 1; i++) {
m = (int)(s[i] - 'a');
if (v[m].size() < 2)
continue;
for (j = 0; j < v[m].size() - 1; j++) {
k = v[m][j];
if (min(k - i, n - k) <= res)
continue;
if (s.substr(i, res + 1) != s.substr(k, res + 1))
continue;
res++;
ma = min(k - i, n - k);
if (ma == res)
continue;
l = ma;
while (l > res) {
if (s.substr(i + res, l - res) != s.substr(k + res, l - res)) {
ma = l - 1;
l = (l + res) / 2;
} else {
res = l;
l = (ma + res + 1) / 2;
}
}
}
v[m].pop_back();
}
cout << res << endl;
return 0;
}
| replace | 28 | 32 | 28 | 31 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// debug
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl;
#define ddd(x, y, z) \
cerr << "(" #x "," #y "," #z "):(" << x << "," << y << "," << z << ")" \
<< endl;
#define dump(v) \
cerr << #v ":[ "; \
for (auto macro_vi : v) { \
cerr << macro_vi << " "; \
} \
cerr << "]" << endl;
#define ddump(v) \
cerr << #v ":" << endl; \
for (auto macro_row : v) { \
cerr << "["; \
for (auto macro__vi : macro_row) { \
cerr << macro__vi << " "; \
} \
cerr << "]" << endl; \
}
#define damp(m) \
for (auto macro_pair : m) { \
cerr << macro_pair.first << ":" << macro_pair.second << endl; \
}
#define dpair(p) \
cerr << #p ":" \
<< "(" << p.first << "," << p.second << ")" << endl;
// iterate
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define reprev(i, n) reprrev(i, 0, n)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define all(v) v.begin(), v.end()
// etc
#define chmin(mi, val) mi = min(mi, val);
#define chmax(ma, val) ma = max(ma, val);
using ll = long long;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
string s;
cin >> n >> s;
vector<vector<int>> dp(n, vector<int>(n, 0));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == 0 or j == 0) {
if (s[i] == s[j]) {
dp[i][j] = 1;
} else {
dp[i][j] = 0;
}
continue;
}
if (s[i] == s[j]) {
dp[i][j] = dp[i - 1][j - 1] + 1;
} else {
dp[i][j] = 0;
}
}
}
d(s) ddump(dp) int ma = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i >= j)
continue;
int now = min(dp[i][j], j - i);
chmax(ma, now);
}
}
cout << ma << endl;
return 0;
} | #include <bits/stdc++.h>
// debug
#define d(x) cerr << #x ":" << x << endl;
#define dd(x, y) cerr << "(" #x "," #y "):(" << x << "," << y << ")" << endl;
#define ddd(x, y, z) \
cerr << "(" #x "," #y "," #z "):(" << x << "," << y << "," << z << ")" \
<< endl;
#define dump(v) \
cerr << #v ":[ "; \
for (auto macro_vi : v) { \
cerr << macro_vi << " "; \
} \
cerr << "]" << endl;
#define ddump(v) \
cerr << #v ":" << endl; \
for (auto macro_row : v) { \
cerr << "["; \
for (auto macro__vi : macro_row) { \
cerr << macro__vi << " "; \
} \
cerr << "]" << endl; \
}
#define damp(m) \
for (auto macro_pair : m) { \
cerr << macro_pair.first << ":" << macro_pair.second << endl; \
}
#define dpair(p) \
cerr << #p ":" \
<< "(" << p.first << "," << p.second << ")" << endl;
// iterate
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define reprev(i, n) reprrev(i, 0, n)
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define all(v) v.begin(), v.end()
// etc
#define chmin(mi, val) mi = min(mi, val);
#define chmax(ma, val) ma = max(ma, val);
using ll = long long;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
string s;
cin >> n >> s;
vector<vector<int>> dp(n, vector<int>(n, 0));
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == 0 or j == 0) {
if (s[i] == s[j]) {
dp[i][j] = 1;
} else {
dp[i][j] = 0;
}
continue;
}
if (s[i] == s[j]) {
dp[i][j] = dp[i - 1][j - 1] + 1;
} else {
dp[i][j] = 0;
}
}
}
int ma = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i >= j)
continue;
int now = min(dp[i][j], j - i);
chmax(ma, now);
}
}
cout << ma << endl;
return 0;
} | replace | 66 | 67 | 66 | 67 | TLE | |
p02913 | Python | Runtime Error | N = int(input())
S = input()
ans = 0
# 2文字以上
for i in range(0, N - 3):
for j in range(i + 2, N):
if S[i : i + 1] == S[j : j + 1]:
length, max_length = 2, j
i, j = i + 1, j + 1
while True:
if i + 1 == max_length or j + 1 == N:
break
else:
print(i, j)
i, j = i + 1, j + 1
print(i, j)
if S[i] == S[j]:
length += 1
else:
break
if length > ans:
ans = length
# 1文字
if ans == 0:
for i in range(N - 1):
s = S[i]
if s in S[i + 1 :]:
ans = 1
print(ans)
| N = int(input())
S = input()
ans = 0
left, right = 0, 1
while right < N:
s = S[left:right]
if s in S[right:]:
ans = max(ans, len(s))
right += 1
else:
left += 1
print(ans)
| replace | 4 | 31 | 4 | 12 | 0 | |
p02913 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const ll INF = MOD * MOD;
const long double EPS = 1e-12;
struct mint {
ll x;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct edge {
ll to, cost;
tuple<ll, ll> get_value() { return make_tuple(to, cost); }
};
struct fpoint {
ld x = 0;
ld y = 0;
bool operator<(const fpoint &p) const {
if (x == p.x)
return y < p.y;
return x < p.x;
}
bool operator==(const fpoint &p) const {
if (p.x - EPS < x && x < p.x + EPS && p.y - EPS < y && y < p.y + EPS)
return true;
return false;
}
bool operator!=(const fpoint &p) const {
if (p.x - EPS > x || x > p.x + EPS || p.y - EPS > y || y > p.y + EPS)
return true;
return false;
}
fpoint &operator+=(const ld a) {
x += a, y += a;
return *this;
}
fpoint &operator-=(const ld a) {
x -= a, y -= a;
return *this;
}
fpoint &operator*=(const ld a) {
x *= a, y *= a;
return *this;
}
fpoint &operator/=(const ld a) {
x /= a, y /= a;
return *this;
}
fpoint &operator+=(const fpoint p) {
x += p.x, y += p.y;
return *this;
}
fpoint &operator-=(const fpoint p) {
x -= p.x, y -= p.y;
return *this;
}
fpoint &operator*=(const fpoint p) {
x *= p.x, y *= p.y;
return *this;
}
fpoint &operator/=(const fpoint p) {
x /= p.x, y /= p.y;
return *this;
}
fpoint operator+(const fpoint p) const { return fpoint(*this) += p; }
fpoint operator-(const fpoint p) const { return fpoint(*this) -= p; }
fpoint operator*(const fpoint p) const { return fpoint(*this) *= p; }
fpoint operator/(const fpoint p) const { return fpoint(*this) /= p; }
fpoint operator+(const ld a) const { return fpoint(*this) += a; }
fpoint operator-(const ld a) const { return fpoint(*this) -= a; }
fpoint operator*(const ld a) const { return fpoint(*this) *= a; }
fpoint operator/(const ld a) const { return fpoint(*this) /= a; }
ld dot(const fpoint &p) const { return x * p.x + y * p.y; }
ll cross(const fpoint &p) const { return x * p.y - y * p.x; }
ld squared_norm() const { return x * x + y * y; }
ld norm() const { return sqrt(x * x + y * y); }
tuple<ld, ld> get_value() { return make_tuple(x, y); }
ll which_quadrant() const {
if (abs(x) < EPS && abs(y) < EPS)
return 0;
if (y > 0)
return x > 0 ? 1 : 2;
return x < 0 ? 3 : 4;
}
bool is_zero() {
fpoint z = {0, 0};
return z == *this;
}
};
struct point {
ll x = 0;
ll y = 0;
bool operator<(const point &p) const {
if (x == p.x)
return y < p.y;
return x < p.x;
}
bool operator==(const point &p) const {
if (x == p.x && y == p.y)
return true;
return false;
}
bool operator!=(const point &p) const {
if (x != p.x || y != p.y)
return true;
return false;
}
point &operator+=(const ll a) {
x += a, y += a;
return *this;
}
point &operator-=(const ll a) {
x -= a, y -= a;
return *this;
}
point &operator*=(const ll a) {
x *= a, y *= a;
return *this;
}
point &operator+=(const point p) {
x += p.x, y += p.y;
return *this;
}
point &operator-=(const point p) {
x -= p.x, y -= p.y;
return *this;
}
point &operator*=(const point p) {
x *= p.x, y *= p.y;
return *this;
}
void operator++(int) { x++, y++; }
void operator++() { x++, y++; }
void operator--(int) { x--, y--; }
void operator--() { x--, y--; }
point operator+(const point p) const { return point(*this) += p; }
point operator-(const point p) const { return point(*this) -= p; }
point operator*(const point p) const { return point(*this) *= p; }
point operator+(const ll a) const { return point(*this) += a; }
point operator-(const ll a) const { return point(*this) -= a; }
point operator*(const ll a) const { return point(*this) *= a; }
ll dot(const point &p) const { return x * p.x + y * p.y; }
ll cross(const point &p) const { return x * p.y - y * p.x; }
ll squared_norm() const { return x * x + y * y; }
tuple<ll, ll> get_value() { return make_tuple(x, y); }
ll which_quadrant() const {
if (x == 0 && y == 0)
return 0;
if (x >= 0 && y >= 0)
return 1;
else if (x <= 0 && y >= 0)
return 2;
else if (x <= 0 && y <= 0)
return 3;
else
return 4;
}
bool is_zero() {
point z = {0, 0};
return z == *this;
}
fpoint to_fpoint() {
fpoint ret = {ld(x), ld(y)};
return ret;
}
};
// angle_comparator
struct {
template <typename T> bool operator()(const T p1, const T p2) const {
ll q1 = p1.which_quadrant();
ll q2 = p2.which_quadrant();
if (q1 != q2)
return q1 < q2;
// judge for parallel lines
// if p1 cross p2 > 0 -> sin arg(p1 -> o -> p2) > 0
return p1.cross(p2) > 0;
}
} angle_comparator;
struct undirected_edge {
ll from;
ll to;
ll cost;
bool operator<(const undirected_edge &ue) const { return cost < ue.cost; }
tuple<ll, ll, ll> get_value() { return make_tuple(from, to, cost); }
};
struct event {
ll loc, val, sgn;
bool operator<(const event &e) const {
if (loc == e.loc)
return sgn == 1;
return loc < e.loc;
}
bool operator>(const event &e) const {
if (loc == e.loc)
return sgn == -1;
return loc > e.loc;
}
tuple<ll, ll, ll> get_value() { return make_tuple(loc, val, sgn); }
};
typedef std::pair<ll, ll> pl;
typedef std::tuple<ll, ll, ll> tp3;
typedef std::tuple<ll, ll, ll, ll> tp4;
typedef std::vector<ll> vl;
typedef std::vector<vl> vl2;
typedef std::vector<vl2> vl3;
typedef std::vector<vl3> vl4;
typedef std::vector<mint> vmi;
typedef std::vector<vmi> vmi2;
typedef std::vector<vmi2> vmi3;
typedef std::vector<vmi3> vmi4;
typedef std::vector<bool> vb;
typedef std::vector<vb> vb2;
typedef std::vector<vb2> vb3;
typedef std::vector<vb3> vb4;
typedef std::vector<pl> vpl;
typedef std::vector<tp3> vtp3;
typedef std::vector<tp4> vtp4;
typedef std::vector<point> points;
typedef std::vector<fpoint> fpoints;
// priority queue. Taking from the higher value. Don't forget calling !q.empty()
typedef std::priority_queue<ll> pq;
// priority queue. Taking from the lower value
typedef std::priority_queue<ll, vl, greater<ll>> pql;
typedef std::vector<vector<edge>> Graph;
const ll N_DIGITS = 60;
const long double PI = 3.14159265358979323846;
const points dirs = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}, // four directions
{1, 1}, {-1, 1}, {-1, -1}, {1, -1}, // diagonal
{0, 0}}; // self
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(char c) { return string(1, c); }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(mint a) { return to_string(a.x); }
string to_string(point p) {
return "{" + to_string(p.x) + ", " + to_string(p.y) + "}";
}
string to_string(fpoint p) {
return "{" + to_string(p.x) + ", " + to_string(p.y) + "}";
}
string to_string(edge e) {
return "{" + to_string(e.to) + ", " + to_string(e.cost) + "}";
}
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first)
res += ", ";
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N> string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++)
res += static_cast<char>('0' + v[i]);
return res;
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename T> string to_string(priority_queue<T> &q) {
priority_queue<T> copy;
bool first = true;
string res = "{";
while (!q.empty()) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(q.top());
copy.push(q.top());
q.pop();
}
swap(q, copy);
res += "}";
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define revrep(i, n) for (ll(i) = n - 1; (i) >= 0; (i)--)
#define For(i, a, b) for (ll(i) = (a); (i) < (b); (i)++)
#define revFor(i, b, a) for (ll(i) = (b)-1; (i) >= (a); (i)--)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isUpper(c) ('a' - c > 0)
#define isNum(c) (0 <= (c) - '0' && (c) - '0' <= 9)
#define toLower(c) char((c) + 0x20)
#define toUpper(c) char((c)-0x20)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define pr(a) std::cout << (a)
#define prl(a) std::cout << (a) << endl
#define prl2(a, b) std::cout << (a) << " " << (b) << endl
#define prl3(a, b, c) std::cout << (a) << " " << (b) << " " << (c) << endl
#define prl4(a, b, c, d) \
std::cout << (a) << " " << (b) << " " << (c) << " " << (d) << endl
#define prs(a) std::cout << (a) << " "
#define prs2(a, b) std::cout << (a) << " " << (b) << " "
#define prs3(a, b, c) std::cout << (a) << " " << (b) << " " << (c) << " "
#define prs4(a, b, c, d) \
std::cout << (a) << " " << (b) << " " << (c) << " " << (d) << " "
#define yn(condition) \
if ((condition)) \
prl("Yes"); \
else \
prl("No");
#define YN(condition) \
if ((condition)) \
prl("YES"); \
else \
prl("NO");
#define in1(a) cin >> (a)
#define in2(a, b) cin >> (a) >> (b)
#define in3(a, b, c) cin >> (a) >> (b) >> (c)
#define in4(a, b, c, d) cin >> (a) >> (b) >> (c) >> (d)
#define in5(a, b, c, d, e) cin >> (a) >> (b) >> (c) >> (d) >> (e)
#define in6(a, b, c, d, e, f) cin >> (a) >> (b) >> (c) >> (d) >> (e) >> (f)
#define in7(a, b, c, d, e, f, g) \
cin >> (a) >> (b) >> (c) >> (d) >> (e) >> (f) >> (g)
#define e1 first
#define e2 second
#define popcount(i) __builtin_popcountl((i))
#define Forchar(c, a, z) for (char(c) = (a); (c) <= (z); (c)++)
#define cntchar(s, c) count(all((s)), c)
#define substring(s, start, end) s.substr((start), (end) - (start) + 1)
#define prl_nd(num, digits) \
std::cout << fixed << setprecision(digits) << (num) << endl;
#define prl_time(s) \
prl3("Elapsed Time:", 1000.0 * (clock() - s) / CLOCKS_PER_SEC, "[ms]");
#define char_to_str(c) string(1, (c))
#ifdef _LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
struct MaxFlow {
struct F_edge {
ll to, rev, capacity;
F_edge(ll to, ll rev, ll capacity) : to(to), rev(rev), capacity(capacity) {}
};
typedef vector<F_edge> F_edges;
vector<F_edges> graph;
ll n_vertex;
// level is the shortest path to get a given node from the source node.
vl level, iter;
MaxFlow(ll n_vertex) : n_vertex(n_vertex) { graph.resize(n_vertex); }
void add_edge(ll from, ll to, ll capacity) {
graph[from].pb({to, ll(graph[to].size()), capacity});
graph[to].pb({from, ll(graph[from].size()) - 1, 0});
}
void bfs(ll source) {
level = vl(n_vertex, -1);
level[source] = 0;
queue<ll> q;
q.push(source);
while (!q.empty()) {
ll vertex = q.front();
q.pop();
rep(i, graph[vertex].size()) {
ll target = graph[vertex][i].to;
ll cap_target = graph[vertex][i].capacity;
// if the flow can be into the target node, implement below.
if (cap_target > 0 && level[target] < 0) {
level[target] = level[vertex] + 1;
q.push(target);
}
}
}
}
ll dfs(ll vertex, ll sink, ll flow) {
if (vertex == sink)
return flow;
for (ll &i = iter[vertex]; i < graph[vertex].size(); i++) {
ll target = graph[vertex][i].to;
ll cap_target = graph[vertex][i].capacity;
ll rev_target = graph[vertex][i].rev;
// if capasitiy is not full yet and target is farther,
// then assign current flow.
if (cap_target > 0 && level[vertex] < level[target]) {
ll d = dfs(target, sink, min(cap_target, flow));
if (d > 0) { // if the flow successfully reaches the sink, reduce the
// flow from the capacity
graph[vertex][i].capacity -= d;
graph[target][rev_target].capacity += d;
return d;
}
}
}
return 0;
}
ll dinic(ll source, ll sink) {
// complexity O(EV^2)
ll flow = 0;
while (true) {
bfs(source);
// if there is no path leading to the sink, the maximum flow is 0.
if (level[sink] < 0)
return flow;
iter = vl(n_vertex, 0);
ll f;
while ((f = dfs(source, sink, INF)) > 0)
flow += f;
}
}
};
struct UnionFind {
vl parents, set_size;
set<ll> root_idx;
ll n_groups;
UnionFind(ll n) {
parents = set_size = vl(n);
n_groups = n;
rep(i, n) {
parents[i] = i;
set_size[i] = 1LL;
root_idx.insert(i);
}
}
ll root_find(ll x) {
if (parents[x] == x)
return x;
return parents[x] = root_find(parents[x]);
}
void unite(ll x, ll y) {
// priority for x is larger than that of y
x = root_find(x);
y = root_find(y);
if (x == y)
return;
parents[y] = x, set_size[x] += set_size[y];
root_idx.erase(y);
n_groups--;
}
// connected or not
bool is_same(ll x, ll y) { return root_find(x) == root_find(y); }
ll size(ll x) { return set_size[root_find(x)]; }
};
struct WeightedUnionFind {
vl parents, set_size, weights;
set<ll> root_idx;
ll n_groups;
WeightedUnionFind(ll n) {
parents = set_size = weights = vl(n);
n_groups = n;
rep(i, n) {
parents[i] = i;
set_size[i] = 1LL;
weights[i] = 0;
root_idx.insert(i);
}
}
ll root_find(ll x) {
if (parents[x] == x)
return x;
ll r = root_find(parents[x]);
weights[x] += weights[parents[x]];
return parents[x] = r;
}
ll weight(ll x) {
root_find(x);
return weights[x];
}
void unite(ll x, ll y, ll w) {
// priority for x is larger than that of y
w += weight(x) - weight(y);
x = root_find(x);
y = root_find(y);
if (x == y)
return;
parents[y] = x, set_size[x] += set_size[y];
root_idx.erase(y);
weights[y] = w;
n_groups--;
}
// connected or not
bool is_same(ll x, ll y) { return root_find(x) == root_find(y); }
ll size(ll x) { return set_size[root_find(x)]; }
ll difference(ll x, ll y) { return weight(y) - weight(x); }
};
struct Doubling { // ABC167D
ll n;
ll sz;
vl2 next;
/*
next[k + 1][i] := next[k][next[k][i]]
next[0][i] := edge[i]
e.g. a0, a1, ..., an-1 / 0 <= ai <= n - 1
a0 -> a[a0] -> a[a[a0]] -> ... -> a[a[...[a[0]]]] (m times)
Let the function repeatedly inputting a[i] m times be f[m](a[i])
- get(i, x) returns f[x](a[i])
- lower_bound(i, j) returns minimum x which satisfies f[x](a[i]) >= j.
if not possible returns n.
*/
// edge[i]: the step size for one iteration
Doubling(vl &edge) : n(edge.size()), sz(62) {
next.resize(sz, vl(n, -1));
rep(i, n) next[0][i] = edge[i];
rep(k, sz - 1) rep(i, n) next[k + 1][i] = next[k][next[k][i]];
}
ll get(ll i, ll x) {
ll ret = i;
rep(bit, sz) {
if (!(x >> bit & 1))
continue;
ret = next[bit][ret];
}
return ret;
}
ll lower_bound(ll i, ll j) {
ll cur = i, acc = 0;
revrep(wid, sz) {
if (next[wid][cur] < j) {
acc += 1LL << wid;
cur = next[wid][cur];
}
}
return min(n, acc + 1);
}
};
template <class T> class LowestCommonAncestor {
public:
ll N, logN;
vl depth, len;
T tree;
vl2 parents;
LowestCommonAncestor(ll n, T &_tree) {
N = n;
logN = 0;
while (N > (1LL << logN))
logN++;
depth = len = vl(N);
parents = vl2(logN, vl(N));
tree = _tree;
init(0, -1, 0, 0);
build();
}
void init(ll source, ll parent, ll d, ll l) {
depth[source] = d;
parents[0][source] = parent;
len[source] = l;
rep(i, tree[source].size()) {
ll target = tree[source][i].to;
ll cost = tree[source][i].cost;
if (target == parent)
continue;
init(target, source, d + 1, cost + l);
}
}
void build() {
rep(k, logN - 1) rep(n, N) {
// if there is no parent, -1.
// otherwise, the parent of the parent is the parent.
if (parents[k][n] < 0)
parents[k + 1][n] = -1;
else
parents[k + 1][n] = parents[k][parents[k][n]];
}
}
ll query(ll u, ll v) {
if (depth[u] > depth[v])
swap(u, v);
rep(k, logN) if ((depth[v] - depth[u]) >> k & 1) v = parents[k][v];
if (u == v)
return u;
revrep(k, logN) {
if (parents[k][u] != parents[k][v]) {
u = parents[k][u];
v = parents[k][v];
}
}
return parents[0][u];
}
ll distance(ll u, ll v) {
ll w = query(u, v);
return len[u] + len[v] - 2 * len[w];
}
};
struct BinaryIndexedTree {
ll n, ini;
vl dat;
BinaryIndexedTree(ll n, ll ini = 0) : dat(n + 1, ini), n(n), ini(ini){};
// x: 1001 1010 1100 1011 1101 1111
// x & - x: 0001 0010 0100 0001 0001 0001
// ->: 1010 1100 10000 1100 1100 10000
ll update_func(ll val, ll d) {
// if maximum -> max(val, dat)
// return max(val, d);
// if cumulative sum
return val + d;
}
ll query(ll i) {
/*
v[0] + v[1] + ... + v[i]
e.g.) i = 10101
itr1. 10101 -> 10100
itr2. 10100 -> 10000
itr3. 10000 -> 00000 (break)
*/
if (i < 0)
return ini;
ll ret = 0;
for (ll j = i; j >= 0; j = (j & (j + 1)) - 1) {
ret = update_func(ret, dat[j]);
}
return ret;
}
ll query(ll l, ll r) {
// a[l] + a[l + 1] + ... + a[r - 1] + a[r]
return query(r) - query(l - 1);
}
ll lower_bound(ll key) {
// v[0] + v[1] + ... + v[left - 1] < key <= v[0] + v[1] + ... + v[left]
if (key <= 0)
return 0;
ll left = 0, right = 1;
while (right <= n)
right *= 2;
for (ll i = right; i > 0; i /= 2) {
if (left + i <= n && dat[left + i - 1] < key) {
key -= dat[left + i - 1];
left += i;
}
}
return left;
}
void update(ll i, ll val) {
/*
e.g.) i = 10101, n = 11111
itr1. i: 10101, i+1: 10110 -> 10111
itr2. i: 10111, i+1: 11000 -> 11111 (break)
*/
if (i < 0)
return;
for (ll j = i; j < n; j |= j + 1) {
dat[j] = update_func(val, dat[j]);
}
}
};
struct SegmentTree {
ll n, ini, minimize;
vl dat;
// when seeking minimum
// ini = INF
// when seeking maximum
// ini = -INF
SegmentTree(ll n_, bool minimize_ = true) {
n = 1;
minimize = minimize_;
if (minimize)
ini = INF;
else
ini = -INF;
while (n < n_)
n *= 2;
dat.resize(2 * n - 1);
rep(i, 2 * n - 1) dat[i] = ini;
};
void update(ll idx, ll val) {
idx += n - 1;
if (minimize && dat[idx] <= val)
return;
if (!minimize && dat[idx] >= val)
return;
dat[idx] = val;
while (idx > 0) {
idx = (idx - 1) / 2;
// when seeking minimum
if (minimize)
dat[idx] = min(dat[idx * 2 + 1], dat[idx * 2 + 2]);
// when seeking maximum
else
dat[idx] = max(dat[idx * 2 + 1], dat[idx * 2 + 2]);
}
}
ll query(ll l, ll r) {
// ### NOTE ###
// the range is [l, r]
// l, l + 1, ..., r
r++; // to adjust to this method
return query_segment(l, r, 0, 0, n);
}
ll query_segment(ll a, ll b, ll idx, ll l, ll r) {
assert(a < b);
if (r <= a || b <= l)
return ini;
if (a <= l && r <= b)
return dat[idx];
else {
ll seg1 = query_segment(a, b, idx * 2 + 1, l, (l + r) / 2);
ll seg2 = query_segment(a, b, idx * 2 + 2, (l + r) / 2, r);
// when seeking minimum
if (minimize)
return min(seg1, seg2);
// when seeking maximum
else
return max(seg1, seg2);
}
}
};
template <class Target> class RerootingTreeDP {
public:
using T = typename Target::type;
struct DP_edge {
ll to, rev; // rev is the index to trace the source node.
T value; // objective value
};
private:
ll n;
void dfs_fwd(ll source, ll parent) {
ll par_idx = -1;
vector<T> values;
rep(i, tree[source].size()) {
const DP_edge &e = tree[source][i];
if (e.to == parent) {
par_idx = i;
continue;
}
dfs_fwd(e.to, source);
values.pb(e.value);
}
// If the parent != -1, update the value on edge from parent to source
if (par_idx != -1) {
ll src_idx = tree[source][par_idx].rev;
// update values on the edge from parent to source
tree[parent][src_idx].value = Target::merge(values);
}
}
void dfs_bwd(ll source, ll parent) {
vector<T> values;
for (auto &&e : tree[source])
values.pb(e.value);
values = Target::evaluate(values);
rep(i, tree[source].size()) {
const DP_edge &e = tree[source][i];
if (e.to == parent)
continue;
// tree[e.to][e.rev]: e.to -> source
tree[e.to][e.rev].value = values[i];
dfs_bwd(e.to, source);
}
}
public:
UnionFind uf;
vector<vector<DP_edge>> tree;
RerootingTreeDP(ll n) : n(n), uf(n), tree(n) {}
void add_edge(ll u, ll v, T val) {
assert(!uf.is_same(u, v));
tree[u].pb({v, ll(tree[v].size()), val});
tree[v].pb({u, ll(tree[u].size()) - 1, val});
uf.unite(u, v);
}
void dp() {
vb visited(n, false);
rep(i, n) {
if (visited[uf.root_find(i)])
continue;
dfs_fwd(i, -1);
visited[uf.root_find(i)] = true;
}
visited.assign(n, false);
rep(i, n) {
if (visited[uf.root_find(i)])
continue;
dfs_bwd(i, -1);
visited[uf.root_find(i)] = true;
}
}
ll size() const { return tree.size(); }
};
// ABC160F is one example
// Modify the functions evaluate and merge based on given problems
struct Merger {
using type = ll;
// This is the exaple of the number of children
static type merge(const vector<type> &value) {
// merge the result below the source node
// each value is from each child node of the source node
// value[i] := f(child i)
// Here, we would like to obtain f(source) using f(child i) (i = 0, 1, ...,
// n_children)
ll ret = 1;
for (auto &&v : value)
ret += v;
return ret;
}
static vector<type> evaluate(const vector<type> &value) {
// value[i] := f(source -> child i)
// we would like to obtain f(child i -> source)
// child j (j != i) is the grandchildren of child i
// represent f(child i -> source) using f(source -> j) (j != i)
// L[i + 1] := the result using f(source -> k) (k = 0, 1, ..., i)
// R[i] := the result using f(source -> k) (k = i, i + 1, ..., n_children)
const ll n_children = value.size();
vl L(n_children + 1, 0), R(n_children + 1, 0);
rep(i, n_children) L[i + 1] = L[i] + value[i];
revrep(i, n_children) R[i] = R[i + 1] + value[i];
vl ret(n_children);
rep(i, n_children) ret[i] = L[i] + R[i + 1] + 1;
return ret;
}
};
struct StronglyConnectedComponents {
ll n, n_cmp;
// dag: edges from a cmp to another cmp
vl2 graph, graph_rev, dag, cmp;
vl order, visited, cmp_idx;
StronglyConnectedComponents() {}
StronglyConnectedComponents(ll sz)
: n(sz), graph(sz), graph_rev(sz), visited(sz), cmp_idx(sz) {}
void add_edge(ll from, ll to) {
graph[from].pb(to);
graph_rev[to].pb(from);
}
void input(ll m, ll offset = -1) {
ll a, b;
rep(i, m) {
in2(a, b);
add_edge(a + offset, b + offset);
}
}
ll operator[](ll k) { return cmp_idx[k]; }
void dfs_fwd(ll source) {
visited[source] = 1;
rep(i, graph[source].size()) {
ll target = graph[source][i];
if (!visited[target])
dfs_fwd(target);
}
order.pb(source);
}
void dfs_bwd(ll source, ll num) {
visited[source] = 1, cmp_idx[source] = num;
cmp[num].pb(source);
rep(i, graph_rev[source].size()) {
ll target = graph_rev[source][i];
if (!visited[target])
dfs_bwd(target, num);
}
}
ll build() {
fill(all(visited), 0);
order.clear();
rep(i, n) if (!visited[i]) dfs_fwd(i);
fill(all(visited), 0);
ll num = 0;
revrep(i, order.size()) {
if (!visited[order[i]]) {
dag.pb(vl());
cmp.pb(vl());
dfs_bwd(order[i], num++);
}
}
rep(i, n) for (ll to : graph[i]) if (cmp_idx[i] != cmp_idx[to])
dag[cmp_idx[i]]
.pb(cmp_idx[to]);
rep(i, num) {
sort(all(dag[i]));
dag[i].erase(unique(all(dag[i])), dag[i].end());
}
return n_cmp = num;
}
// if the v-th vertex is in loop or not
bool in_loop(ll v) { return cmp[cmp_idx[v]].size() > 1; }
// if the dag has loops or not
bool has_loop() {
rep(i, cmp.size()) if (cmp[i].size() > 1) return true;
return false;
}
};
struct CombinationMemo {
ll sz, mod;
vl facts, facts_inv, minv;
CombinationMemo(ll sz, ll _mod) : sz(sz), mod(_mod) {
facts.resize(sz + 5);
facts_inv.resize(sz + 5);
minv.resize(sz + 5);
init();
}
void init() {
facts[0] = facts[1] = 1;
minv[1] = 1;
facts_inv[0] = facts_inv[1] = 1;
For(i, 2, sz + 3) {
facts[i] = (i * facts[i - 1]) % mod;
minv[i] = mod - minv[mod % i] * (mod / i) % mod;
facts_inv[i] = facts_inv[i - 1] * minv[i] % mod;
}
}
ll nCk(ll n, ll r) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll val = (facts[n] * facts_inv[n - r]) % mod;
val *= facts_inv[r];
return val % mod;
}
ll nPk(ll n, ll r) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll val = (facts[n] * facts_inv[n - r]) % mod;
return val % mod;
}
};
struct PowerMemo {
ll sz, mod, base;
vl powB;
PowerMemo(ll sz, ll base, ll _mod) : sz(sz), base(base), mod(_mod) {
powB.resize(sz + 5);
init();
}
void init() {
powB[0] = 1;
rep(i, sz + 3) powB[i + 1] = (powB[i] * base) % mod;
}
ll operator[](ll k) { return powB[k]; }
};
struct Grid2D {
Graph graph;
ll Width, Height;
Grid2D(ll w, ll h) : Width(w), Height(h) { graph.resize(w * h); }
ll pos_to_idx(point p) { return p.y * Width + p.x; }
point idx_to_pos(ll idx) { return {idx % Width, idx / Width}; }
bool undefined_region(point p, vb2 &block) {
if (p.x < 0 || p.x > Width - 1)
return true;
if (p.y < 0 || p.y > Height - 1)
return true;
if (block[p.x][p.y])
return true;
return false;
}
void build(vb2 &block, ll val = 1) {
rep(x, Width) rep(y, Height) {
point p = {x, y};
ll idx1 = pos_to_idx(p);
ll idx2;
if (block[x][y])
continue;
rep(i, 4) {
point nxt = p + dirs[i];
idx2 = pos_to_idx(nxt);
if (!undefined_region(nxt, block))
graph[idx1].pb(
{idx2, val}); // dist[idx1][idx2] = val; (warshall-floyd)
}
}
}
};
struct Cumulative2D {
vl2 cum;
ll w, h;
Cumulative2D(ll w, ll h) : w(w), h(h) { cum = vl2(w + 1, vl(h + 1, 0)); }
template <typename T> void build(vector<T> &vec) {
// never forget building
rep(x, w + 1) cum[x][0] = 0;
rep(y, h + 1) cum[0][y] = 0;
rep(y, h) rep(x, w) cum[x + 1][y + 1] = cum[x][y + 1] + vec[x][y];
rep(x, w + 1) rep(y, h) cum[x][y + 1] += cum[x][y];
}
ll func(ll x, ll y, ll dx, ll dy) {
// 1-indexed
// the rectangle of (x, y), (x + dx, y), (x, y + dy) and (x + dx, y + dy)
// think about the case of (1, 1, 1, 1).
if (x + dx > w || y + dy > h)
return -INF;
ll val = cum[x + dx][y + dy];
val += cum[x][y];
val -= cum[x][y + dy];
val -= cum[x + dx][y];
return val;
}
};
struct LinearSystemIncidence {
struct Edge {
ll idx, to;
bool fwd;
};
/*
Ax = c
A: A in R^(V * E) <- given
x: x in R^E <- estimate this vector
c: c in R^V <- given
*/
ll n_vertex, n_edge;
bool mod2;
vl x;
vb visited;
vector<vector<Edge>> graph;
LinearSystemIncidence(ll n, vpl &es, bool mod2 = false)
: n_vertex(n), n_edge(es.size()), mod2(mod2) {
graph.resize(n);
visited.resize(n);
rep(i, n_edge) {
auto &e = es[i];
graph[e.e1].pb({i, e.e2, true});
graph[e.e2].pb({i, e.e1, false});
}
}
ll dfs(vl &c, ll src) {
visited[src] = true;
ll ret = c[src];
for (Edge &e : graph[src]) {
if (visited[e.to])
continue;
ll tmp = dfs(c, e.to);
x[e.idx] = e.fwd ? tmp : -tmp;
ret += tmp;
if (mod2)
x[e.idx] = ((x[e.idx] % 2) + 2) % 2;
}
return mod2 ? ret % 2 : ret;
}
bool solve(vl &c) {
x.assign(n_edge, 0);
visited.assign(n_vertex, false);
rep(src, n_vertex) {
if (visited[src])
continue;
if (dfs(c, src))
return false;
}
return true;
}
};
struct BigInt10 {
string num;
ll sz;
map<ll, vl> mod;
BigInt10(string num) : num(num), sz(num.size()) {}
void compute_mod(ll _mod) {
mod[_mod] = vl(sz + 1, 0);
ll tenth = 1;
rep(i, sz) {
ll top = num[sz - 1 - i] - '0';
mod[_mod][i + 1] = (mod[_mod][i] + top * tenth) % _mod;
(tenth *= 10) %= _mod;
}
}
ll n_digits() { return num.length(); }
ll operator[](ll k) { return num[k] - '0'; }
ll subseq_mod(ll l, ll r, ll m) {
// s1 s2 ... sl .... sr ... sn
// the modulo of 00 ... 0 sl ... sr 00 ... 0
assert(l <= r);
ll tot = mod[m][sz];
ll ls = (tot - mod[m][sz - l] + m) % m;
ll rs = mod[m][sz - r];
return (tot - ls - rs + 2 * m) % m;
}
bool operator<(BigInt10 &n2) const {
if (num.length() < n2.n_digits())
return true;
else if (num.length() > n2.n_digits())
return false;
return num < n2.num;
}
bool operator>(BigInt10 &n2) const {
if (num.length() > n2.n_digits())
return true;
else if (num.length() < n2.n_digits())
return false;
return num > n2.num;
}
};
struct BigInt2 {
string num;
ll sz;
map<ll, vl> mod;
ll nz;
BigInt2(string num) : num(num), sz(num.size()) {
nz = 0;
rep(i, sz) if (num[i] == '1') nz++;
}
void compute_mod(ll _mod) {
mod[_mod] = vl(sz + 1, 0);
ll base = 1;
rep(i, sz) {
ll top = num[sz - 1 - i] - '0';
mod[_mod][i + 1] = (mod[_mod][i] + top * base) % _mod;
(base *= 2) %= _mod;
}
}
ll n_digits() { return num.length(); }
ll bit_count() { return nz; }
ll operator[](ll k) { return num[k] - '0'; }
ll subseq_mod(ll l, ll r, ll m) {
// s1 s2 ... sl .... sr ... sn
// the modulo of 00 ... 0 sl ... sr 00 ... 0
assert(l <= r);
ll tot = mod[m][sz];
ll ls = (tot - mod[m][sz - l] + m) % m;
ll rs = mod[m][sz - r];
return (tot - ls - rs + 2 * m) % m;
}
bool operator<(BigInt10 &n2) const {
if (num.length() < n2.n_digits())
return true;
else if (num.length() > n2.n_digits())
return false;
return num < n2.num;
}
bool operator>(BigInt10 &n2) const {
if (num.length() > n2.n_digits())
return true;
else if (num.length() < n2.n_digits())
return false;
return num > n2.num;
}
};
ll gcd(ll m, ll n) {
ll a = max(m, n);
ll b = min(m, n);
while (b != 1 && b != 0) {
a %= b;
swap(a, b);
}
return b == 1 ? 1 : a;
}
ll lcm(ll m, ll n) { return m / gcd(m, n) * n; }
ll power_normal(ll a, ll power) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = value * a;
a = a * a;
power = power >> 1;
}
return value;
}
ll power_mod(ll a, ll power, ll mod) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = (value * a) % mod;
a = (a * a) % mod;
power = power >> 1;
}
return value % mod;
}
ll modinv(ll a, ll mod) { return power_mod(a, mod - 2, mod); }
ll combination(ll n, ll r, ll mod) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll numerator = 1;
ll denomenator = 1;
for (ll i = 0; i < r; i++) {
ll num = (n - i) % mod, den = (i + 1) % mod;
(numerator *= num) %= mod;
(denomenator *= modinv(den, mod)) %= mod;
}
return (numerator * denomenator) % mod;
}
vl2 pascal_triangle(ll n) {
/*
Complexity: O(n^2)
The upper bound of n is nearly 50.
Parameters
----------
n; the size of returned vector
Returns
-------
comb[i][j]: combination(i, j). 0 <= i <= n, 0 <= j <= i
*/
vl2 comb(n + 1, vl(n + 1));
comb[0][0] = 1;
For(i, 1, n + 1) rep(j, i + 1) {
comb[i][j] += comb[i - 1][j];
if (j > 0)
comb[i][j] += comb[i - 1][j - 1];
}
return comb;
}
ld log_combination(ll n, ll r) {
if (n == r && n == 0)
return 0;
else if (n <= 0 || r < 0 || r > n)
return -INF;
ld val = 0;
for (ll i = 0; i < r; i++) {
val += log(n - i);
val -= log(i + 1);
}
return val;
}
string bin_expression(ll n, ll dig) {
string s = "";
rep(i, dig) {
s += to_string(n % 2);
n /= 2;
}
reverse(all(s));
return s;
}
bool is_prime(ll n) {
if (n <= 1)
return false;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
map<ll, ll> prime_factorization(ll n) {
ll i = 2;
map<ll, ll> table;
while (i * i <= n) {
while (n % i == 0) {
table[i]++;
n /= i;
}
i++;
}
if (n > 1)
table[n] = 1;
return table;
}
vl divisor_table(ll n) {
vl table;
ll i = 1;
while (i * i <= n) {
if (n % i == 0) {
table.pb(i);
if (i * i != n)
table.pb(n / i);
}
i++;
}
sort(all(table));
return table;
}
vl base_converter(ll num, ll base, ll sz) {
vl coefs(sz);
ll cur = 0;
while (num) {
ll val = num % base;
assert(cur < sz);
coefs[cur++] = val;
num -= val, num /= base;
}
while (cur < sz)
coefs[cur++] = 0;
return coefs;
}
string indexed_alphabet(ll leng, ll idx) {
// 0-indexed
// returns the string whose order is the-idx-th in the set of strings of the
// given length.
string ret = "";
if (idx >= power_normal(26, leng))
return ret;
vl cs = base_converter(idx, 26, leng);
reverse(all(cs));
rep(i, cs.size()) ret += char('a' + cs[i]);
return ret;
}
ll alphabetical_index(string s) {
// including the strings whose length is less than that of s.
// excluding the empty string.
ll leng = s.length();
ll ret = 0, p = 1;
rep(i, leng) {
ll b = s[leng - 1 - i] - 'a';
ret += p + p * b, p *= 26;
}
return ret;
}
ll next_combination(ll sub) {
/*
nCk
ll bit = (1 << k) - 1;
for (; bit < (1 << n); bit = next_combination(bit)){
bool ith = bit & (1 << i);
procedures...
}
sub & -sub: the binary which shares the last digit whose value is 1 in sub
sub + x : carry up the last digit
~y : the binary whose digits are 1 if y's digit is 0.
(sub & ~y) / x: reduce the same number of 0s after first 1 in x from (sub &
~y).
*/
ll x = sub & -sub, y = sub + x;
if (x != 0)
return (((sub & ~y) / x) >> 1) | y;
else
return INF;
}
// just change the input if you want to change the target.
// If you want to check the common sequences in two strings,
// combine them. e.g. ABC150F
template <typename T> vl z_algorithm(T &s, ll n) {
/*
Paramters
---------
T: the string or list of interest
n: the size of string or list
Returns
-------
res[i] is the maximum number of K which satisfies
s[:K] == s[i:i + K]
for each i = 0, 1, 2, ..., n - 1.
*/
vl res(n);
res[0] = n;
ll i1 = 1, i2 = 0;
while (i1 < n) {
/*
i1: the starting point
i2: the length of substring
*/
while (i1 + i2 < n && s[i2] == s[i1 + i2])
++i2;
res[i1] = i2;
if (i2 == 0) {
++i1;
continue;
}
ll i3 = 1;
// update the already seen points
while (i1 + i3 < n && i3 + res[i3] < i2) {
res[i1 + i3] = res[i3];
++i3;
}
// update up to i1 + i3 and the next possible minimum length is i2 - i3 (=
// res[i3])
i1 += i3, i2 -= i3;
}
return res;
}
ll string_to_ll(string s) {
ll l = s.length();
ll idx = 0;
ll val = 0;
ll tenth = 1;
while (idx < l) {
ll m = s[l - 1 - idx] - '0';
val += (m * tenth);
tenth *= 10;
idx++;
}
return val;
}
string reflected_string(string s) {
string t, u;
ll n = s.length();
t = s;
reverse(all(t));
u = substring(t, 0, n - 2) + s + substring(t, 1, n - 1);
return u;
}
ld distance_between_point_line(point l_begin, point l_end, point p) {
ll xl1 = l_begin.x, yl1 = l_begin.y;
ll xl2 = l_end.x, yl2 = l_end.y;
ll xp = p.x, yp = p.y;
ll a = yl2 - yl1;
ll b = -xl2 + xl1;
ll c = -a * xl2 - b * yl2;
return abs(ld(a * xp + b * yp + c)) / ld(sqrt(a * a + b * b));
}
bool is_cross(point l1_begin, point l1_end, point l2_begin, point l2_end) {
ll x1 = l1_begin.x, y1 = l1_begin.y;
ll x2 = l1_end.x, y2 = l1_end.y;
ll x3 = l2_begin.x, y3 = l2_begin.y;
ll x4 = l2_end.x, y4 = l2_end.y;
ll val1 = (x1 - x2) * (y3 - y1) + (y1 - y2) * (x1 - x3);
ll val2 = (x1 - x2) * (y4 - y1) + (y1 - y2) * (x1 - x4);
ll val3 = (x3 - x4) * (y1 - y3) + (y3 - y4) * (x3 - x1);
ll val4 = (x3 - x4) * (y2 - y3) + (y3 - y4) * (x3 - x2);
return val1 * val2 < 0 && val3 * val4 < 0;
}
template <typename T> bool isColinear(T p1, T p2, T p3) {
T v1 = p2 - p1, v2 = p3 - p1;
return v1.x * v2.y == v1.y * v2.x;
}
template <typename T> T PerpendicularBisector(T p1, T p2) {
T vec = p2 - p1;
assert(!vec.is_zero());
T ret = {vec.y, -vec.x};
return ret;
}
template <typename T> ld Distance2DPoints(T p1, T p2) {
T vec = (p1 - p2) * (p1 - p2);
return sqrt(vec.x + vec.y);
}
ll SquaredDistance2DPoints(point p1, point p2) {
point vec = (p1 - p2) * (p1 - p2);
return vec.x + vec.y;
}
ld space_of_triangle(point p1, point p2, point p3) {
ll x1 = p1.x, y1 = p1.y;
ll x2 = p2.x, y2 = p2.y;
ll x3 = p3.x, y3 = p3.y;
ll v1 = x2 - x1;
ll u1 = y2 - y1;
ll v2 = x3 - x1;
ll u2 = y3 - y1;
ld s = ld(v1 * u2 - u1 * v2) / ld(2);
return abs(s);
}
pair<point, ll> OuterCenter(point p1, point p2, point p3) {
// the center of circle on the given three points
// return the determinant value and the product of center points and 2 *
// determinant value
point ret;
if (isColinear(p1, p2, p3)) {
ll d1 = SquaredDistance2DPoints(p1, p2);
ll d2 = SquaredDistance2DPoints(p2, p3);
ll d3 = SquaredDistance2DPoints(p3, p1);
if (d1 >= d2 && d1 >= d3) {
ret = p1 + p2;
return mp(ret, 2);
} else if (d2 >= d1 && d2 >= d3) {
ret = p2 + p3;
return mp(ret, 2);
} else {
ret = p3 + p1;
return mp(ret, 2);
}
}
point pv1 = PerpendicularBisector(p1, p2);
point pv2 = PerpendicularBisector(p1, p3);
point cv1_2x = p1 + p2, cv2_2x = p1 + p3;
// cv1 + k pv1 == cv2 + m pv2
// (pv1x -pv2x) (k) = (cv2x - cv1x)
// (pv1y -pv2y) (m) = (cv2y - cv1y)
ll det_inv = -pv1.x * pv2.y + pv1.y * pv2.x;
ll x1_2x = cv2_2x.x - cv1_2x.x, x2_2x = cv2_2x.y - cv1_2x.y;
pl c_2x_det = {-pv2.y * x1_2x + pv2.x * x2_2x,
-pv1.y * x1_2x + pv1.x * x2_2x};
// ret.x = ld(cv1_2x.x * det_inv + pv1.x * c_2x_det.e1) / ld(2 * det_inv);
// ret.y = ld(cv1_2x.y * det_inv + pv1.y * c_2x_det.e1) / ld(2 * det_inv);
ret.x = cv1_2x.x * det_inv + pv1.x * c_2x_det.e1;
ret.y = cv1_2x.y * det_inv + pv1.y * c_2x_det.e1;
ll jacobian = 2 * det_inv;
return mp(ret, jacobian);
}
ll inversion_number(vl a, ll a_max) {
/*
Paramters
---------
a: vector<ll>
All the elements must be non-negative.
Prefably the elements are compressed to reduce the computational cost.
a_max: ll
The maximum value of the vector a or the value bigger than the value
stated previously.
*/
BinaryIndexedTree bit(a_max + 1);
ll val = 0;
rep(i, a.size()) {
// i is the number of elements that have lower index than a[i].
// call the number of elements that have lower value than a[i]
// by subtracting these two, the residual number is the number of elements
// that have larger value.
val += i - bit.query(a[i] - 1); // cumulative sum from 0 to a[i] - 1
bit.update(a[i], 1);
}
return val;
}
ld bin_search(ld left, ld right, bool lb, function<bool(ld)> judge) {
ld mid;
while (right - left > EPS) {
mid = (right + left) / 2;
if (lb) {
if (judge(mid))
right = mid;
else
left = mid + EPS;
} else {
if (judge(mid))
left = mid;
else
right = mid - EPS;
}
}
return right;
}
ll bin_search(ll left, ll right, bool lb, function<bool(ll)> judge) {
ll mid;
while (right > left) {
if (lb) {
// if true (satisfies the condition), range shifts smaller direction
mid = (right + left) / 2;
if (judge(mid))
right = mid;
else
left = mid + 1;
} else {
// if true (satisfies the condition), range shitfs larger direction
mid = (right + left + 1) / 2;
if (judge(mid))
left = mid;
else
right = mid - 1;
}
}
return right;
}
ld trinary_search(ld left, ld right, function<ld(ld)> func) {
// Care the value EPS!!! Compare to the condition
while (abs(right - left) > EPS) {
ld left2 = (2.0 * left + right) / 3.0;
ld right2 = (left + 2.0 * right) / 3.0;
ld f1 = func(left2);
ld f2 = func(right2);
if (f1 <= f2)
right = right2;
else if (f2 <= f1)
left = left2;
}
return right;
}
template <typename T> vector<T> compress(vector<T> v) {
// sort and remove all the duplicated values
sort(all(v));
v.erase(unique(all(v)), v.end());
return v;
}
template <typename T> map<T, ll> dict(const vector<T> &v) {
map<T, ll> d;
rep(i, v.size()) d[v[i]] = i;
return d;
}
points compress2D(vl xs, vl ys) {
/*
NOTE
----
Add the corner points if required
*/
ll n = xs.size();
vl xcs = compress(xs), ycs = compress(ys);
map<ll, ll> xd = dict(xcs), yd = dict(ycs);
points ps(n);
rep(i, n) xs[i] = xd[xs[i]], ys[i] = yd[ys[i]];
rep(i, n) ps[i] = {xs[i], ys[i]};
sort(all(ps));
return ps;
}
void GaussJordanBitVector(vl &bs) {
ll n = bs.size();
ll rank = 0;
ll j = 0;
revrep(i, N_DIGITS) {
for (j = rank; j < n; j++)
if (bs[j] & (1LL << i))
break;
if (j == n)
continue;
if (j > rank)
bs[rank] ^= bs[j];
for (j = 0; j < n; j++)
if (j != rank)
bs[j] = min(bs[j], bs[j] ^ bs[rank]);
rank++;
}
}
ll kruskal(vector<undirected_edge> &es, ll n_vertex) {
// O(ElogE)
sort(all(es));
UnionFind uf(n_vertex);
ll min_cost = 0;
rep(i, es.size()) {
undirected_edge &e = es[i];
if (!uf.is_same(e.from, e.to)) {
min_cost += e.cost;
uf.unite(e.from, e.to);
}
}
return min_cost;
}
ll LongestIncreasedSequence(vl &v) {
ll n = v.size();
vl dp(n, INF);
rep(i, n) * lower_bound(all(dp), v[i]) = v[i];
return lower_bound(all(dp), INF) - dp.begin();
}
void dijkstra(ll start, Graph &graph, vl &dist, vl &vertex_pre,
bool trace = false) {
priority_queue<pl, vpl, greater<pl>> q;
ll n = graph.size();
dist = vl(n, INF);
if (trace)
vertex_pre = vl(n, -1);
dist[start] = 0;
q.push(pl(0, start));
while (!q.empty()) {
ll idx, cost;
tie(cost, idx) = q.top();
q.pop();
if (dist[idx] < cost)
continue;
for (auto &e : graph[idx]) {
if (chmin(dist[e.to], dist[idx] + e.cost)) {
if (trace)
vertex_pre[e.to] = idx;
q.push(pl(dist[e.to], e.to));
}
}
}
}
vl get_predecessor(ll g, vl &vertex_pre) {
vl path;
for (; g != -1; g = vertex_pre[g])
path.pb(g);
reverse(all(path));
return path;
}
void warshall_floyd(vl2 &dist) {
ll n = dist.size();
// Dont forget the initialization
// rep(i, n) rep(j, n) dist[i][j] = INF * (i != j);
rep(k, n) rep(i, n) rep(j, n) dist[i][j] =
min(dist[i][j], dist[i][k] + dist[k][j]);
}
// ABC061D, 137E
bool find_negative_cycle(ll n, ll goal, Graph &graph, vl &dist) {
rep(i, n) rep(v, n) rep(k, graph[v].size()) {
edge e = graph[v][k];
if (dist[e.to] != INF && dist[e.to] > dist[v] + e.cost) {
dist[e.to] = -INF;
if (goal == -1)
return true;
else if (goal == e.to)
return true;
}
}
return false;
}
bool bellman_ford(ll start, ll goal, Graph &graph, vl &dist) {
// if there is a closed circuit, it returns false. (when goal == -1)
// if the distance to goal cannot be obtained, it returns false (when goal !=
// -1)
ll n = graph.size();
dist = vl(n, INF);
dist[start] = 0;
rep(i, n) rep(v, n) rep(k, graph[v].size()) {
edge e = graph[v][k];
if (dist[v] != INF && dist[e.to] > dist[v] + e.cost)
dist[e.to] = dist[v] + e.cost;
}
if (find_negative_cycle(n, goal, graph, dist))
return false;
return true;
}
void Euler_Tour(Graph &tree, vl &euler_tour, vl &in, vl &out, ll anc = 0) {
// record only when we first reach a node and leave the node.
ll n = tree.size();
vb visited(n, false);
in = out = vl(n);
auto dfs = [&](auto dfs, ll source) -> void {
visited[source] = true;
in[source] = euler_tour.size();
euler_tour.pb(source);
bool is_leaf = true;
for (auto &e : tree[source]) {
ll target = e.to;
if (visited[target])
continue;
else
is_leaf = false;
dfs(dfs, target);
}
euler_tour.pb(-source);
out[source] = euler_tour.size() - 1;
};
dfs(dfs, anc);
}
void Euler_Tour2(Graph &tree, vl &euler_tour, vl &in, vl &out, ll anc = 0) {
// record everytime we reach a node
ll n = tree.size();
vb visited(n, false);
in = out = vl(n);
auto dfs = [&](auto dfs, ll source) -> void {
visited[source] = true;
in[source] = euler_tour.size();
euler_tour.pb(source);
bool is_leaf = true;
for (auto &e : tree[source]) {
ll target = e.to;
if (visited[target])
continue;
else
is_leaf = false;
dfs(dfs, target);
euler_tour.pb(source);
}
out[source] = euler_tour.size() - 1;
};
dfs(dfs, anc);
}
std::mt19937 create_rand_engine() {
std::random_device rnd;
std::vector<std::uint_least32_t> v(10);
std::generate(v.begin(), v.end(), std::ref(rnd));
std::seed_seq seed(v.begin(), v.end());
return std::mt19937(seed);
}
vl generate_unique_array(const size_t sz, ll vm, ll vM) {
const size_t range = static_cast<size_t>(vM - vm + 1);
const size_t num = static_cast<size_t>(sz * 1.2);
assert(vm <= vM);
assert(sz <= range);
vl ret;
auto engine = create_rand_engine();
std::uniform_int_distribution<ll> distribution(vm, vM);
while (ret.size() < sz) {
while (ret.size() < num)
ret.pb(distribution(engine));
sort(all(ret));
auto unique_end = unique(all(ret));
if (sz < distance(ret.begin(), unique_end))
unique_end = next(ret.begin(), sz);
ret.erase(unique_end, ret.end());
}
return ret;
}
vl generate_array(const size_t sz, ll vm, ll vM) {
const size_t range = static_cast<size_t>(vM - vm + 1);
assert(vm <= vM);
vl ret;
auto engine = create_rand_engine();
std::uniform_int_distribution<ll> distribution(vm, vM);
while (ret.size() < sz)
ret.pb(distribution(engine));
return ret;
}
void read_vector(ll n, vl &v, ll offset = 0) {
v.resize(n);
rep(i, n) {
in1(v[i]);
v[i] += offset;
}
}
void read_points(ll n, points &ps, ll offset = 0) {
ps.resize(n);
rep(i, n) {
ll x, y;
in2(x, y);
ps[i] = {x, y};
ps[i] += offset;
}
}
void read_2DMap(ll w, ll h, vb2 &block, char b) {
block = vb2(w, vb(h, false));
string s;
rep(y, h) {
in1(s);
rep(x, w) block[x][y] = (s[x] == b);
}
}
ll diameter_of_tree(Graph &tree) {
ll dM = 0, vM = 0, v1, v2;
auto dfs = [&](auto dfs, ll src, ll par, ll d) -> void {
if (chmax(dM, d))
vM = src;
for (auto &e : tree[src]) {
if (e.to == par)
continue;
dfs(dfs, e.to, src, d + 1);
}
};
dfs(dfs, 0, -1, 0);
v1 = vM;
dfs(dfs, vM, -1, 0);
v2 = vM;
return dM;
}
/*
diameter of tree
Graph tree;
ll dM = 0, vM = 0, v2 = 0;
void dfs1(ll source, ll parent, ll d){
if (d > dM) dM = d, vM = source;
rep(i, tree[source].size()){
ll target = tree[source][i].to;
if (target == parent) continue;
dfs1(target, source, d + 1);
}
}
void dfs2(ll source, ll parent, ll d){
if (dM <= d) dM = d, v2 = source;
rep(i, tree[source].size()){
ll target = tree[source][i].to;
if (target == parent) continue;
dfs2(target, source, d + 1);
}
}
dfs(0, -1, 0);
dfs2(vM, -1, 0);
prl2(vM + 1, v2 + 1); // the two edges of tree
*/
/*
#5. shakutori method (syakutori, two pointers technique)
// 1. strech right side while the condition is met.
// 2. renew the answer
// 3. increments left side
// 4. Back to 1. (l <= r must be satisfied all the time.)
ll l = 0, r = 0;
while (l < n){
if (l == r) r++;
while(r < n && cond) r++;
l++;
}
prl(answer);
#11. bfs ABC146D, ABC007C
1. first create a graph.
2. start searching from a node.
3. do some processes and push nodes connected with a given target node in
BFS.
4. repeat a series of procedure until queue is empty.
ll n; in1(n);
queue<tp3> q; vb visited(n, false);
auto bfs = [&](ll src, ll par){
visited[src] = true;
for (auto& e: graph[src]){
if (e.to != par && !visited[e.to]){
q.push(mt(e.to, src, ...));
}
}
};
q.push(mt(0, -1, 0));
while(!q.empty()){
ll src, par, ...; tie(src, par, ...) = q.front(); q.pop();
bfs(src, par, ...);
}
*/
/*
x: 1001 1010 1100 1011 1101 1111
x & ~ x: 0001 0010 0100 0001 0001 0001
sum: 1010 1100 10000 1100 1100 10000
####### Attention #######
S | (1 << i) -> S union {i}
S & ~(1 << i) -> S - {i}
# inclusion-exclusion principle
|U[i = 1 to n] Ai| = sum[i = 1 to n] |Ai| - sum[i < j]|Ai ^ Aj| + ... + (-1)^(n
- 1) |^[i = 1 to n]Ai|
*/
const ll MAX_N = 200005;
const size_t MAX_BIT = 160 * 160 + 10;
typedef bitset<MAX_BIT> bts;
typedef vector<bts> vbt;
typedef vector<vbt> vbt2;
typedef vector<vbt2> vbt3;
void solve() {
// generate_array(size, min, max);
ll n;
string s;
in2(n, s);
ll answer = 0;
rep(i, n) {
string t = substring(s, i, n - 1);
vl cnt = z_algorithm(t, n - i);
For(i, 1, n - i) chmax(answer, min(cnt[i], i));
}
prl(answer);
// ### DEBUG PART ###
auto naive_solver = [&]() {};
#ifdef _LOCAL
naive_solver();
#endif
}
void test(ll num = 0, bool verbose = false) {
rep(i, max(1LL, num)) {
ll t = clock();
if (verbose)
prl4("\n#####", i + 1, "#####", "\n## Answer ##");
solve();
if (verbose) {
prl("");
prl_time(t);
}
}
}
int main(void) {
#ifdef _LOCAL
test(6, true);
#else
test(0, false);
#endif
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const ll INF = MOD * MOD;
const long double EPS = 1e-12;
struct mint {
ll x;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct edge {
ll to, cost;
tuple<ll, ll> get_value() { return make_tuple(to, cost); }
};
struct fpoint {
ld x = 0;
ld y = 0;
bool operator<(const fpoint &p) const {
if (x == p.x)
return y < p.y;
return x < p.x;
}
bool operator==(const fpoint &p) const {
if (p.x - EPS < x && x < p.x + EPS && p.y - EPS < y && y < p.y + EPS)
return true;
return false;
}
bool operator!=(const fpoint &p) const {
if (p.x - EPS > x || x > p.x + EPS || p.y - EPS > y || y > p.y + EPS)
return true;
return false;
}
fpoint &operator+=(const ld a) {
x += a, y += a;
return *this;
}
fpoint &operator-=(const ld a) {
x -= a, y -= a;
return *this;
}
fpoint &operator*=(const ld a) {
x *= a, y *= a;
return *this;
}
fpoint &operator/=(const ld a) {
x /= a, y /= a;
return *this;
}
fpoint &operator+=(const fpoint p) {
x += p.x, y += p.y;
return *this;
}
fpoint &operator-=(const fpoint p) {
x -= p.x, y -= p.y;
return *this;
}
fpoint &operator*=(const fpoint p) {
x *= p.x, y *= p.y;
return *this;
}
fpoint &operator/=(const fpoint p) {
x /= p.x, y /= p.y;
return *this;
}
fpoint operator+(const fpoint p) const { return fpoint(*this) += p; }
fpoint operator-(const fpoint p) const { return fpoint(*this) -= p; }
fpoint operator*(const fpoint p) const { return fpoint(*this) *= p; }
fpoint operator/(const fpoint p) const { return fpoint(*this) /= p; }
fpoint operator+(const ld a) const { return fpoint(*this) += a; }
fpoint operator-(const ld a) const { return fpoint(*this) -= a; }
fpoint operator*(const ld a) const { return fpoint(*this) *= a; }
fpoint operator/(const ld a) const { return fpoint(*this) /= a; }
ld dot(const fpoint &p) const { return x * p.x + y * p.y; }
ll cross(const fpoint &p) const { return x * p.y - y * p.x; }
ld squared_norm() const { return x * x + y * y; }
ld norm() const { return sqrt(x * x + y * y); }
tuple<ld, ld> get_value() { return make_tuple(x, y); }
ll which_quadrant() const {
if (abs(x) < EPS && abs(y) < EPS)
return 0;
if (y > 0)
return x > 0 ? 1 : 2;
return x < 0 ? 3 : 4;
}
bool is_zero() {
fpoint z = {0, 0};
return z == *this;
}
};
struct point {
ll x = 0;
ll y = 0;
bool operator<(const point &p) const {
if (x == p.x)
return y < p.y;
return x < p.x;
}
bool operator==(const point &p) const {
if (x == p.x && y == p.y)
return true;
return false;
}
bool operator!=(const point &p) const {
if (x != p.x || y != p.y)
return true;
return false;
}
point &operator+=(const ll a) {
x += a, y += a;
return *this;
}
point &operator-=(const ll a) {
x -= a, y -= a;
return *this;
}
point &operator*=(const ll a) {
x *= a, y *= a;
return *this;
}
point &operator+=(const point p) {
x += p.x, y += p.y;
return *this;
}
point &operator-=(const point p) {
x -= p.x, y -= p.y;
return *this;
}
point &operator*=(const point p) {
x *= p.x, y *= p.y;
return *this;
}
void operator++(int) { x++, y++; }
void operator++() { x++, y++; }
void operator--(int) { x--, y--; }
void operator--() { x--, y--; }
point operator+(const point p) const { return point(*this) += p; }
point operator-(const point p) const { return point(*this) -= p; }
point operator*(const point p) const { return point(*this) *= p; }
point operator+(const ll a) const { return point(*this) += a; }
point operator-(const ll a) const { return point(*this) -= a; }
point operator*(const ll a) const { return point(*this) *= a; }
ll dot(const point &p) const { return x * p.x + y * p.y; }
ll cross(const point &p) const { return x * p.y - y * p.x; }
ll squared_norm() const { return x * x + y * y; }
tuple<ll, ll> get_value() { return make_tuple(x, y); }
ll which_quadrant() const {
if (x == 0 && y == 0)
return 0;
if (x >= 0 && y >= 0)
return 1;
else if (x <= 0 && y >= 0)
return 2;
else if (x <= 0 && y <= 0)
return 3;
else
return 4;
}
bool is_zero() {
point z = {0, 0};
return z == *this;
}
fpoint to_fpoint() {
fpoint ret = {ld(x), ld(y)};
return ret;
}
};
// angle_comparator
struct {
template <typename T> bool operator()(const T p1, const T p2) const {
ll q1 = p1.which_quadrant();
ll q2 = p2.which_quadrant();
if (q1 != q2)
return q1 < q2;
// judge for parallel lines
// if p1 cross p2 > 0 -> sin arg(p1 -> o -> p2) > 0
return p1.cross(p2) > 0;
}
} angle_comparator;
struct undirected_edge {
ll from;
ll to;
ll cost;
bool operator<(const undirected_edge &ue) const { return cost < ue.cost; }
tuple<ll, ll, ll> get_value() { return make_tuple(from, to, cost); }
};
struct event {
ll loc, val, sgn;
bool operator<(const event &e) const {
if (loc == e.loc)
return sgn == 1;
return loc < e.loc;
}
bool operator>(const event &e) const {
if (loc == e.loc)
return sgn == -1;
return loc > e.loc;
}
tuple<ll, ll, ll> get_value() { return make_tuple(loc, val, sgn); }
};
typedef std::pair<ll, ll> pl;
typedef std::tuple<ll, ll, ll> tp3;
typedef std::tuple<ll, ll, ll, ll> tp4;
typedef std::vector<ll> vl;
typedef std::vector<vl> vl2;
typedef std::vector<vl2> vl3;
typedef std::vector<vl3> vl4;
typedef std::vector<mint> vmi;
typedef std::vector<vmi> vmi2;
typedef std::vector<vmi2> vmi3;
typedef std::vector<vmi3> vmi4;
typedef std::vector<bool> vb;
typedef std::vector<vb> vb2;
typedef std::vector<vb2> vb3;
typedef std::vector<vb3> vb4;
typedef std::vector<pl> vpl;
typedef std::vector<tp3> vtp3;
typedef std::vector<tp4> vtp4;
typedef std::vector<point> points;
typedef std::vector<fpoint> fpoints;
// priority queue. Taking from the higher value. Don't forget calling !q.empty()
typedef std::priority_queue<ll> pq;
// priority queue. Taking from the lower value
typedef std::priority_queue<ll, vl, greater<ll>> pql;
typedef std::vector<vector<edge>> Graph;
const ll N_DIGITS = 60;
const long double PI = 3.14159265358979323846;
const points dirs = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}, // four directions
{1, 1}, {-1, 1}, {-1, -1}, {1, -1}, // diagonal
{0, 0}}; // self
template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(char c) { return string(1, c); }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(mint a) { return to_string(a.x); }
string to_string(point p) {
return "{" + to_string(p.x) + ", " + to_string(p.y) + "}";
}
string to_string(fpoint p) {
return "{" + to_string(p.x) + ", " + to_string(p.y) + "}";
}
string to_string(edge e) {
return "{" + to_string(e.to) + ", " + to_string(e.cost) + "}";
}
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
string to_string(vector<bool> v) {
bool first = true;
string res = "{";
for (int i = 0; i < static_cast<int>(v.size()); i++) {
if (!first)
res += ", ";
first = false;
res += to_string(v[i]);
}
res += "}";
return res;
}
template <size_t N> string to_string(bitset<N> v) {
string res = "";
for (size_t i = 0; i < N; i++)
res += static_cast<char>('0' + v[i]);
return res;
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
template <typename T> string to_string(priority_queue<T> &q) {
priority_queue<T> copy;
bool first = true;
string res = "{";
while (!q.empty()) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(q.top());
copy.push(q.top());
q.pop();
}
swap(q, copy);
res += "}";
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define revrep(i, n) for (ll(i) = n - 1; (i) >= 0; (i)--)
#define For(i, a, b) for (ll(i) = (a); (i) < (b); (i)++)
#define revFor(i, b, a) for (ll(i) = (b)-1; (i) >= (a); (i)--)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isUpper(c) ('a' - c > 0)
#define isNum(c) (0 <= (c) - '0' && (c) - '0' <= 9)
#define toLower(c) char((c) + 0x20)
#define toUpper(c) char((c)-0x20)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define pr(a) std::cout << (a)
#define prl(a) std::cout << (a) << endl
#define prl2(a, b) std::cout << (a) << " " << (b) << endl
#define prl3(a, b, c) std::cout << (a) << " " << (b) << " " << (c) << endl
#define prl4(a, b, c, d) \
std::cout << (a) << " " << (b) << " " << (c) << " " << (d) << endl
#define prs(a) std::cout << (a) << " "
#define prs2(a, b) std::cout << (a) << " " << (b) << " "
#define prs3(a, b, c) std::cout << (a) << " " << (b) << " " << (c) << " "
#define prs4(a, b, c, d) \
std::cout << (a) << " " << (b) << " " << (c) << " " << (d) << " "
#define yn(condition) \
if ((condition)) \
prl("Yes"); \
else \
prl("No");
#define YN(condition) \
if ((condition)) \
prl("YES"); \
else \
prl("NO");
#define in1(a) cin >> (a)
#define in2(a, b) cin >> (a) >> (b)
#define in3(a, b, c) cin >> (a) >> (b) >> (c)
#define in4(a, b, c, d) cin >> (a) >> (b) >> (c) >> (d)
#define in5(a, b, c, d, e) cin >> (a) >> (b) >> (c) >> (d) >> (e)
#define in6(a, b, c, d, e, f) cin >> (a) >> (b) >> (c) >> (d) >> (e) >> (f)
#define in7(a, b, c, d, e, f, g) \
cin >> (a) >> (b) >> (c) >> (d) >> (e) >> (f) >> (g)
#define e1 first
#define e2 second
#define popcount(i) __builtin_popcountl((i))
#define Forchar(c, a, z) for (char(c) = (a); (c) <= (z); (c)++)
#define cntchar(s, c) count(all((s)), c)
#define substring(s, start, end) s.substr((start), (end) - (start) + 1)
#define prl_nd(num, digits) \
std::cout << fixed << setprecision(digits) << (num) << endl;
#define prl_time(s) \
prl3("Elapsed Time:", 1000.0 * (clock() - s) / CLOCKS_PER_SEC, "[ms]");
#define char_to_str(c) string(1, (c))
#ifdef _LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
struct MaxFlow {
struct F_edge {
ll to, rev, capacity;
F_edge(ll to, ll rev, ll capacity) : to(to), rev(rev), capacity(capacity) {}
};
typedef vector<F_edge> F_edges;
vector<F_edges> graph;
ll n_vertex;
// level is the shortest path to get a given node from the source node.
vl level, iter;
MaxFlow(ll n_vertex) : n_vertex(n_vertex) { graph.resize(n_vertex); }
void add_edge(ll from, ll to, ll capacity) {
graph[from].pb({to, ll(graph[to].size()), capacity});
graph[to].pb({from, ll(graph[from].size()) - 1, 0});
}
void bfs(ll source) {
level = vl(n_vertex, -1);
level[source] = 0;
queue<ll> q;
q.push(source);
while (!q.empty()) {
ll vertex = q.front();
q.pop();
rep(i, graph[vertex].size()) {
ll target = graph[vertex][i].to;
ll cap_target = graph[vertex][i].capacity;
// if the flow can be into the target node, implement below.
if (cap_target > 0 && level[target] < 0) {
level[target] = level[vertex] + 1;
q.push(target);
}
}
}
}
ll dfs(ll vertex, ll sink, ll flow) {
if (vertex == sink)
return flow;
for (ll &i = iter[vertex]; i < graph[vertex].size(); i++) {
ll target = graph[vertex][i].to;
ll cap_target = graph[vertex][i].capacity;
ll rev_target = graph[vertex][i].rev;
// if capasitiy is not full yet and target is farther,
// then assign current flow.
if (cap_target > 0 && level[vertex] < level[target]) {
ll d = dfs(target, sink, min(cap_target, flow));
if (d > 0) { // if the flow successfully reaches the sink, reduce the
// flow from the capacity
graph[vertex][i].capacity -= d;
graph[target][rev_target].capacity += d;
return d;
}
}
}
return 0;
}
ll dinic(ll source, ll sink) {
// complexity O(EV^2)
ll flow = 0;
while (true) {
bfs(source);
// if there is no path leading to the sink, the maximum flow is 0.
if (level[sink] < 0)
return flow;
iter = vl(n_vertex, 0);
ll f;
while ((f = dfs(source, sink, INF)) > 0)
flow += f;
}
}
};
struct UnionFind {
vl parents, set_size;
set<ll> root_idx;
ll n_groups;
UnionFind(ll n) {
parents = set_size = vl(n);
n_groups = n;
rep(i, n) {
parents[i] = i;
set_size[i] = 1LL;
root_idx.insert(i);
}
}
ll root_find(ll x) {
if (parents[x] == x)
return x;
return parents[x] = root_find(parents[x]);
}
void unite(ll x, ll y) {
// priority for x is larger than that of y
x = root_find(x);
y = root_find(y);
if (x == y)
return;
parents[y] = x, set_size[x] += set_size[y];
root_idx.erase(y);
n_groups--;
}
// connected or not
bool is_same(ll x, ll y) { return root_find(x) == root_find(y); }
ll size(ll x) { return set_size[root_find(x)]; }
};
struct WeightedUnionFind {
vl parents, set_size, weights;
set<ll> root_idx;
ll n_groups;
WeightedUnionFind(ll n) {
parents = set_size = weights = vl(n);
n_groups = n;
rep(i, n) {
parents[i] = i;
set_size[i] = 1LL;
weights[i] = 0;
root_idx.insert(i);
}
}
ll root_find(ll x) {
if (parents[x] == x)
return x;
ll r = root_find(parents[x]);
weights[x] += weights[parents[x]];
return parents[x] = r;
}
ll weight(ll x) {
root_find(x);
return weights[x];
}
void unite(ll x, ll y, ll w) {
// priority for x is larger than that of y
w += weight(x) - weight(y);
x = root_find(x);
y = root_find(y);
if (x == y)
return;
parents[y] = x, set_size[x] += set_size[y];
root_idx.erase(y);
weights[y] = w;
n_groups--;
}
// connected or not
bool is_same(ll x, ll y) { return root_find(x) == root_find(y); }
ll size(ll x) { return set_size[root_find(x)]; }
ll difference(ll x, ll y) { return weight(y) - weight(x); }
};
struct Doubling { // ABC167D
ll n;
ll sz;
vl2 next;
/*
next[k + 1][i] := next[k][next[k][i]]
next[0][i] := edge[i]
e.g. a0, a1, ..., an-1 / 0 <= ai <= n - 1
a0 -> a[a0] -> a[a[a0]] -> ... -> a[a[...[a[0]]]] (m times)
Let the function repeatedly inputting a[i] m times be f[m](a[i])
- get(i, x) returns f[x](a[i])
- lower_bound(i, j) returns minimum x which satisfies f[x](a[i]) >= j.
if not possible returns n.
*/
// edge[i]: the step size for one iteration
Doubling(vl &edge) : n(edge.size()), sz(62) {
next.resize(sz, vl(n, -1));
rep(i, n) next[0][i] = edge[i];
rep(k, sz - 1) rep(i, n) next[k + 1][i] = next[k][next[k][i]];
}
ll get(ll i, ll x) {
ll ret = i;
rep(bit, sz) {
if (!(x >> bit & 1))
continue;
ret = next[bit][ret];
}
return ret;
}
ll lower_bound(ll i, ll j) {
ll cur = i, acc = 0;
revrep(wid, sz) {
if (next[wid][cur] < j) {
acc += 1LL << wid;
cur = next[wid][cur];
}
}
return min(n, acc + 1);
}
};
template <class T> class LowestCommonAncestor {
public:
ll N, logN;
vl depth, len;
T tree;
vl2 parents;
LowestCommonAncestor(ll n, T &_tree) {
N = n;
logN = 0;
while (N > (1LL << logN))
logN++;
depth = len = vl(N);
parents = vl2(logN, vl(N));
tree = _tree;
init(0, -1, 0, 0);
build();
}
void init(ll source, ll parent, ll d, ll l) {
depth[source] = d;
parents[0][source] = parent;
len[source] = l;
rep(i, tree[source].size()) {
ll target = tree[source][i].to;
ll cost = tree[source][i].cost;
if (target == parent)
continue;
init(target, source, d + 1, cost + l);
}
}
void build() {
rep(k, logN - 1) rep(n, N) {
// if there is no parent, -1.
// otherwise, the parent of the parent is the parent.
if (parents[k][n] < 0)
parents[k + 1][n] = -1;
else
parents[k + 1][n] = parents[k][parents[k][n]];
}
}
ll query(ll u, ll v) {
if (depth[u] > depth[v])
swap(u, v);
rep(k, logN) if ((depth[v] - depth[u]) >> k & 1) v = parents[k][v];
if (u == v)
return u;
revrep(k, logN) {
if (parents[k][u] != parents[k][v]) {
u = parents[k][u];
v = parents[k][v];
}
}
return parents[0][u];
}
ll distance(ll u, ll v) {
ll w = query(u, v);
return len[u] + len[v] - 2 * len[w];
}
};
struct BinaryIndexedTree {
ll n, ini;
vl dat;
BinaryIndexedTree(ll n, ll ini = 0) : dat(n + 1, ini), n(n), ini(ini){};
// x: 1001 1010 1100 1011 1101 1111
// x & - x: 0001 0010 0100 0001 0001 0001
// ->: 1010 1100 10000 1100 1100 10000
ll update_func(ll val, ll d) {
// if maximum -> max(val, dat)
// return max(val, d);
// if cumulative sum
return val + d;
}
ll query(ll i) {
/*
v[0] + v[1] + ... + v[i]
e.g.) i = 10101
itr1. 10101 -> 10100
itr2. 10100 -> 10000
itr3. 10000 -> 00000 (break)
*/
if (i < 0)
return ini;
ll ret = 0;
for (ll j = i; j >= 0; j = (j & (j + 1)) - 1) {
ret = update_func(ret, dat[j]);
}
return ret;
}
ll query(ll l, ll r) {
// a[l] + a[l + 1] + ... + a[r - 1] + a[r]
return query(r) - query(l - 1);
}
ll lower_bound(ll key) {
// v[0] + v[1] + ... + v[left - 1] < key <= v[0] + v[1] + ... + v[left]
if (key <= 0)
return 0;
ll left = 0, right = 1;
while (right <= n)
right *= 2;
for (ll i = right; i > 0; i /= 2) {
if (left + i <= n && dat[left + i - 1] < key) {
key -= dat[left + i - 1];
left += i;
}
}
return left;
}
void update(ll i, ll val) {
/*
e.g.) i = 10101, n = 11111
itr1. i: 10101, i+1: 10110 -> 10111
itr2. i: 10111, i+1: 11000 -> 11111 (break)
*/
if (i < 0)
return;
for (ll j = i; j < n; j |= j + 1) {
dat[j] = update_func(val, dat[j]);
}
}
};
struct SegmentTree {
ll n, ini, minimize;
vl dat;
// when seeking minimum
// ini = INF
// when seeking maximum
// ini = -INF
SegmentTree(ll n_, bool minimize_ = true) {
n = 1;
minimize = minimize_;
if (minimize)
ini = INF;
else
ini = -INF;
while (n < n_)
n *= 2;
dat.resize(2 * n - 1);
rep(i, 2 * n - 1) dat[i] = ini;
};
void update(ll idx, ll val) {
idx += n - 1;
if (minimize && dat[idx] <= val)
return;
if (!minimize && dat[idx] >= val)
return;
dat[idx] = val;
while (idx > 0) {
idx = (idx - 1) / 2;
// when seeking minimum
if (minimize)
dat[idx] = min(dat[idx * 2 + 1], dat[idx * 2 + 2]);
// when seeking maximum
else
dat[idx] = max(dat[idx * 2 + 1], dat[idx * 2 + 2]);
}
}
ll query(ll l, ll r) {
// ### NOTE ###
// the range is [l, r]
// l, l + 1, ..., r
r++; // to adjust to this method
return query_segment(l, r, 0, 0, n);
}
ll query_segment(ll a, ll b, ll idx, ll l, ll r) {
assert(a < b);
if (r <= a || b <= l)
return ini;
if (a <= l && r <= b)
return dat[idx];
else {
ll seg1 = query_segment(a, b, idx * 2 + 1, l, (l + r) / 2);
ll seg2 = query_segment(a, b, idx * 2 + 2, (l + r) / 2, r);
// when seeking minimum
if (minimize)
return min(seg1, seg2);
// when seeking maximum
else
return max(seg1, seg2);
}
}
};
template <class Target> class RerootingTreeDP {
public:
using T = typename Target::type;
struct DP_edge {
ll to, rev; // rev is the index to trace the source node.
T value; // objective value
};
private:
ll n;
void dfs_fwd(ll source, ll parent) {
ll par_idx = -1;
vector<T> values;
rep(i, tree[source].size()) {
const DP_edge &e = tree[source][i];
if (e.to == parent) {
par_idx = i;
continue;
}
dfs_fwd(e.to, source);
values.pb(e.value);
}
// If the parent != -1, update the value on edge from parent to source
if (par_idx != -1) {
ll src_idx = tree[source][par_idx].rev;
// update values on the edge from parent to source
tree[parent][src_idx].value = Target::merge(values);
}
}
void dfs_bwd(ll source, ll parent) {
vector<T> values;
for (auto &&e : tree[source])
values.pb(e.value);
values = Target::evaluate(values);
rep(i, tree[source].size()) {
const DP_edge &e = tree[source][i];
if (e.to == parent)
continue;
// tree[e.to][e.rev]: e.to -> source
tree[e.to][e.rev].value = values[i];
dfs_bwd(e.to, source);
}
}
public:
UnionFind uf;
vector<vector<DP_edge>> tree;
RerootingTreeDP(ll n) : n(n), uf(n), tree(n) {}
void add_edge(ll u, ll v, T val) {
assert(!uf.is_same(u, v));
tree[u].pb({v, ll(tree[v].size()), val});
tree[v].pb({u, ll(tree[u].size()) - 1, val});
uf.unite(u, v);
}
void dp() {
vb visited(n, false);
rep(i, n) {
if (visited[uf.root_find(i)])
continue;
dfs_fwd(i, -1);
visited[uf.root_find(i)] = true;
}
visited.assign(n, false);
rep(i, n) {
if (visited[uf.root_find(i)])
continue;
dfs_bwd(i, -1);
visited[uf.root_find(i)] = true;
}
}
ll size() const { return tree.size(); }
};
// ABC160F is one example
// Modify the functions evaluate and merge based on given problems
struct Merger {
using type = ll;
// This is the exaple of the number of children
static type merge(const vector<type> &value) {
// merge the result below the source node
// each value is from each child node of the source node
// value[i] := f(child i)
// Here, we would like to obtain f(source) using f(child i) (i = 0, 1, ...,
// n_children)
ll ret = 1;
for (auto &&v : value)
ret += v;
return ret;
}
static vector<type> evaluate(const vector<type> &value) {
// value[i] := f(source -> child i)
// we would like to obtain f(child i -> source)
// child j (j != i) is the grandchildren of child i
// represent f(child i -> source) using f(source -> j) (j != i)
// L[i + 1] := the result using f(source -> k) (k = 0, 1, ..., i)
// R[i] := the result using f(source -> k) (k = i, i + 1, ..., n_children)
const ll n_children = value.size();
vl L(n_children + 1, 0), R(n_children + 1, 0);
rep(i, n_children) L[i + 1] = L[i] + value[i];
revrep(i, n_children) R[i] = R[i + 1] + value[i];
vl ret(n_children);
rep(i, n_children) ret[i] = L[i] + R[i + 1] + 1;
return ret;
}
};
struct StronglyConnectedComponents {
ll n, n_cmp;
// dag: edges from a cmp to another cmp
vl2 graph, graph_rev, dag, cmp;
vl order, visited, cmp_idx;
StronglyConnectedComponents() {}
StronglyConnectedComponents(ll sz)
: n(sz), graph(sz), graph_rev(sz), visited(sz), cmp_idx(sz) {}
void add_edge(ll from, ll to) {
graph[from].pb(to);
graph_rev[to].pb(from);
}
void input(ll m, ll offset = -1) {
ll a, b;
rep(i, m) {
in2(a, b);
add_edge(a + offset, b + offset);
}
}
ll operator[](ll k) { return cmp_idx[k]; }
void dfs_fwd(ll source) {
visited[source] = 1;
rep(i, graph[source].size()) {
ll target = graph[source][i];
if (!visited[target])
dfs_fwd(target);
}
order.pb(source);
}
void dfs_bwd(ll source, ll num) {
visited[source] = 1, cmp_idx[source] = num;
cmp[num].pb(source);
rep(i, graph_rev[source].size()) {
ll target = graph_rev[source][i];
if (!visited[target])
dfs_bwd(target, num);
}
}
ll build() {
fill(all(visited), 0);
order.clear();
rep(i, n) if (!visited[i]) dfs_fwd(i);
fill(all(visited), 0);
ll num = 0;
revrep(i, order.size()) {
if (!visited[order[i]]) {
dag.pb(vl());
cmp.pb(vl());
dfs_bwd(order[i], num++);
}
}
rep(i, n) for (ll to : graph[i]) if (cmp_idx[i] != cmp_idx[to])
dag[cmp_idx[i]]
.pb(cmp_idx[to]);
rep(i, num) {
sort(all(dag[i]));
dag[i].erase(unique(all(dag[i])), dag[i].end());
}
return n_cmp = num;
}
// if the v-th vertex is in loop or not
bool in_loop(ll v) { return cmp[cmp_idx[v]].size() > 1; }
// if the dag has loops or not
bool has_loop() {
rep(i, cmp.size()) if (cmp[i].size() > 1) return true;
return false;
}
};
struct CombinationMemo {
ll sz, mod;
vl facts, facts_inv, minv;
CombinationMemo(ll sz, ll _mod) : sz(sz), mod(_mod) {
facts.resize(sz + 5);
facts_inv.resize(sz + 5);
minv.resize(sz + 5);
init();
}
void init() {
facts[0] = facts[1] = 1;
minv[1] = 1;
facts_inv[0] = facts_inv[1] = 1;
For(i, 2, sz + 3) {
facts[i] = (i * facts[i - 1]) % mod;
minv[i] = mod - minv[mod % i] * (mod / i) % mod;
facts_inv[i] = facts_inv[i - 1] * minv[i] % mod;
}
}
ll nCk(ll n, ll r) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll val = (facts[n] * facts_inv[n - r]) % mod;
val *= facts_inv[r];
return val % mod;
}
ll nPk(ll n, ll r) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll val = (facts[n] * facts_inv[n - r]) % mod;
return val % mod;
}
};
struct PowerMemo {
ll sz, mod, base;
vl powB;
PowerMemo(ll sz, ll base, ll _mod) : sz(sz), base(base), mod(_mod) {
powB.resize(sz + 5);
init();
}
void init() {
powB[0] = 1;
rep(i, sz + 3) powB[i + 1] = (powB[i] * base) % mod;
}
ll operator[](ll k) { return powB[k]; }
};
struct Grid2D {
Graph graph;
ll Width, Height;
Grid2D(ll w, ll h) : Width(w), Height(h) { graph.resize(w * h); }
ll pos_to_idx(point p) { return p.y * Width + p.x; }
point idx_to_pos(ll idx) { return {idx % Width, idx / Width}; }
bool undefined_region(point p, vb2 &block) {
if (p.x < 0 || p.x > Width - 1)
return true;
if (p.y < 0 || p.y > Height - 1)
return true;
if (block[p.x][p.y])
return true;
return false;
}
void build(vb2 &block, ll val = 1) {
rep(x, Width) rep(y, Height) {
point p = {x, y};
ll idx1 = pos_to_idx(p);
ll idx2;
if (block[x][y])
continue;
rep(i, 4) {
point nxt = p + dirs[i];
idx2 = pos_to_idx(nxt);
if (!undefined_region(nxt, block))
graph[idx1].pb(
{idx2, val}); // dist[idx1][idx2] = val; (warshall-floyd)
}
}
}
};
struct Cumulative2D {
vl2 cum;
ll w, h;
Cumulative2D(ll w, ll h) : w(w), h(h) { cum = vl2(w + 1, vl(h + 1, 0)); }
template <typename T> void build(vector<T> &vec) {
// never forget building
rep(x, w + 1) cum[x][0] = 0;
rep(y, h + 1) cum[0][y] = 0;
rep(y, h) rep(x, w) cum[x + 1][y + 1] = cum[x][y + 1] + vec[x][y];
rep(x, w + 1) rep(y, h) cum[x][y + 1] += cum[x][y];
}
ll func(ll x, ll y, ll dx, ll dy) {
// 1-indexed
// the rectangle of (x, y), (x + dx, y), (x, y + dy) and (x + dx, y + dy)
// think about the case of (1, 1, 1, 1).
if (x + dx > w || y + dy > h)
return -INF;
ll val = cum[x + dx][y + dy];
val += cum[x][y];
val -= cum[x][y + dy];
val -= cum[x + dx][y];
return val;
}
};
struct LinearSystemIncidence {
struct Edge {
ll idx, to;
bool fwd;
};
/*
Ax = c
A: A in R^(V * E) <- given
x: x in R^E <- estimate this vector
c: c in R^V <- given
*/
ll n_vertex, n_edge;
bool mod2;
vl x;
vb visited;
vector<vector<Edge>> graph;
LinearSystemIncidence(ll n, vpl &es, bool mod2 = false)
: n_vertex(n), n_edge(es.size()), mod2(mod2) {
graph.resize(n);
visited.resize(n);
rep(i, n_edge) {
auto &e = es[i];
graph[e.e1].pb({i, e.e2, true});
graph[e.e2].pb({i, e.e1, false});
}
}
ll dfs(vl &c, ll src) {
visited[src] = true;
ll ret = c[src];
for (Edge &e : graph[src]) {
if (visited[e.to])
continue;
ll tmp = dfs(c, e.to);
x[e.idx] = e.fwd ? tmp : -tmp;
ret += tmp;
if (mod2)
x[e.idx] = ((x[e.idx] % 2) + 2) % 2;
}
return mod2 ? ret % 2 : ret;
}
bool solve(vl &c) {
x.assign(n_edge, 0);
visited.assign(n_vertex, false);
rep(src, n_vertex) {
if (visited[src])
continue;
if (dfs(c, src))
return false;
}
return true;
}
};
struct BigInt10 {
string num;
ll sz;
map<ll, vl> mod;
BigInt10(string num) : num(num), sz(num.size()) {}
void compute_mod(ll _mod) {
mod[_mod] = vl(sz + 1, 0);
ll tenth = 1;
rep(i, sz) {
ll top = num[sz - 1 - i] - '0';
mod[_mod][i + 1] = (mod[_mod][i] + top * tenth) % _mod;
(tenth *= 10) %= _mod;
}
}
ll n_digits() { return num.length(); }
ll operator[](ll k) { return num[k] - '0'; }
ll subseq_mod(ll l, ll r, ll m) {
// s1 s2 ... sl .... sr ... sn
// the modulo of 00 ... 0 sl ... sr 00 ... 0
assert(l <= r);
ll tot = mod[m][sz];
ll ls = (tot - mod[m][sz - l] + m) % m;
ll rs = mod[m][sz - r];
return (tot - ls - rs + 2 * m) % m;
}
bool operator<(BigInt10 &n2) const {
if (num.length() < n2.n_digits())
return true;
else if (num.length() > n2.n_digits())
return false;
return num < n2.num;
}
bool operator>(BigInt10 &n2) const {
if (num.length() > n2.n_digits())
return true;
else if (num.length() < n2.n_digits())
return false;
return num > n2.num;
}
};
struct BigInt2 {
string num;
ll sz;
map<ll, vl> mod;
ll nz;
BigInt2(string num) : num(num), sz(num.size()) {
nz = 0;
rep(i, sz) if (num[i] == '1') nz++;
}
void compute_mod(ll _mod) {
mod[_mod] = vl(sz + 1, 0);
ll base = 1;
rep(i, sz) {
ll top = num[sz - 1 - i] - '0';
mod[_mod][i + 1] = (mod[_mod][i] + top * base) % _mod;
(base *= 2) %= _mod;
}
}
ll n_digits() { return num.length(); }
ll bit_count() { return nz; }
ll operator[](ll k) { return num[k] - '0'; }
ll subseq_mod(ll l, ll r, ll m) {
// s1 s2 ... sl .... sr ... sn
// the modulo of 00 ... 0 sl ... sr 00 ... 0
assert(l <= r);
ll tot = mod[m][sz];
ll ls = (tot - mod[m][sz - l] + m) % m;
ll rs = mod[m][sz - r];
return (tot - ls - rs + 2 * m) % m;
}
bool operator<(BigInt10 &n2) const {
if (num.length() < n2.n_digits())
return true;
else if (num.length() > n2.n_digits())
return false;
return num < n2.num;
}
bool operator>(BigInt10 &n2) const {
if (num.length() > n2.n_digits())
return true;
else if (num.length() < n2.n_digits())
return false;
return num > n2.num;
}
};
ll gcd(ll m, ll n) {
ll a = max(m, n);
ll b = min(m, n);
while (b != 1 && b != 0) {
a %= b;
swap(a, b);
}
return b == 1 ? 1 : a;
}
ll lcm(ll m, ll n) { return m / gcd(m, n) * n; }
ll power_normal(ll a, ll power) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = value * a;
a = a * a;
power = power >> 1;
}
return value;
}
ll power_mod(ll a, ll power, ll mod) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = (value * a) % mod;
a = (a * a) % mod;
power = power >> 1;
}
return value % mod;
}
ll modinv(ll a, ll mod) { return power_mod(a, mod - 2, mod); }
ll combination(ll n, ll r, ll mod) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll numerator = 1;
ll denomenator = 1;
for (ll i = 0; i < r; i++) {
ll num = (n - i) % mod, den = (i + 1) % mod;
(numerator *= num) %= mod;
(denomenator *= modinv(den, mod)) %= mod;
}
return (numerator * denomenator) % mod;
}
vl2 pascal_triangle(ll n) {
/*
Complexity: O(n^2)
The upper bound of n is nearly 50.
Parameters
----------
n; the size of returned vector
Returns
-------
comb[i][j]: combination(i, j). 0 <= i <= n, 0 <= j <= i
*/
vl2 comb(n + 1, vl(n + 1));
comb[0][0] = 1;
For(i, 1, n + 1) rep(j, i + 1) {
comb[i][j] += comb[i - 1][j];
if (j > 0)
comb[i][j] += comb[i - 1][j - 1];
}
return comb;
}
ld log_combination(ll n, ll r) {
if (n == r && n == 0)
return 0;
else if (n <= 0 || r < 0 || r > n)
return -INF;
ld val = 0;
for (ll i = 0; i < r; i++) {
val += log(n - i);
val -= log(i + 1);
}
return val;
}
string bin_expression(ll n, ll dig) {
string s = "";
rep(i, dig) {
s += to_string(n % 2);
n /= 2;
}
reverse(all(s));
return s;
}
bool is_prime(ll n) {
if (n <= 1)
return false;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
map<ll, ll> prime_factorization(ll n) {
ll i = 2;
map<ll, ll> table;
while (i * i <= n) {
while (n % i == 0) {
table[i]++;
n /= i;
}
i++;
}
if (n > 1)
table[n] = 1;
return table;
}
vl divisor_table(ll n) {
vl table;
ll i = 1;
while (i * i <= n) {
if (n % i == 0) {
table.pb(i);
if (i * i != n)
table.pb(n / i);
}
i++;
}
sort(all(table));
return table;
}
vl base_converter(ll num, ll base, ll sz) {
vl coefs(sz);
ll cur = 0;
while (num) {
ll val = num % base;
assert(cur < sz);
coefs[cur++] = val;
num -= val, num /= base;
}
while (cur < sz)
coefs[cur++] = 0;
return coefs;
}
string indexed_alphabet(ll leng, ll idx) {
// 0-indexed
// returns the string whose order is the-idx-th in the set of strings of the
// given length.
string ret = "";
if (idx >= power_normal(26, leng))
return ret;
vl cs = base_converter(idx, 26, leng);
reverse(all(cs));
rep(i, cs.size()) ret += char('a' + cs[i]);
return ret;
}
ll alphabetical_index(string s) {
// including the strings whose length is less than that of s.
// excluding the empty string.
ll leng = s.length();
ll ret = 0, p = 1;
rep(i, leng) {
ll b = s[leng - 1 - i] - 'a';
ret += p + p * b, p *= 26;
}
return ret;
}
ll next_combination(ll sub) {
/*
nCk
ll bit = (1 << k) - 1;
for (; bit < (1 << n); bit = next_combination(bit)){
bool ith = bit & (1 << i);
procedures...
}
sub & -sub: the binary which shares the last digit whose value is 1 in sub
sub + x : carry up the last digit
~y : the binary whose digits are 1 if y's digit is 0.
(sub & ~y) / x: reduce the same number of 0s after first 1 in x from (sub &
~y).
*/
ll x = sub & -sub, y = sub + x;
if (x != 0)
return (((sub & ~y) / x) >> 1) | y;
else
return INF;
}
// just change the input if you want to change the target.
// If you want to check the common sequences in two strings,
// combine them. e.g. ABC150F
template <typename T> vl z_algorithm(T &s, ll n) {
/*
Paramters
---------
T: the string or list of interest
n: the size of string or list
Returns
-------
res[i] is the maximum number of K which satisfies
s[:K] == s[i:i + K]
for each i = 0, 1, 2, ..., n - 1.
*/
vl res(n);
res[0] = n;
ll i1 = 1, i2 = 0;
while (i1 < n) {
/*
i1: the starting point
i2: the length of substring
*/
while (i1 + i2 < n && s[i2] == s[i1 + i2])
++i2;
res[i1] = i2;
if (i2 == 0) {
++i1;
continue;
}
ll i3 = 1;
// update the already seen points
while (i1 + i3 < n && i3 + res[i3] < i2) {
res[i1 + i3] = res[i3];
++i3;
}
// update up to i1 + i3 and the next possible minimum length is i2 - i3 (=
// res[i3])
i1 += i3, i2 -= i3;
}
return res;
}
ll string_to_ll(string s) {
ll l = s.length();
ll idx = 0;
ll val = 0;
ll tenth = 1;
while (idx < l) {
ll m = s[l - 1 - idx] - '0';
val += (m * tenth);
tenth *= 10;
idx++;
}
return val;
}
string reflected_string(string s) {
string t, u;
ll n = s.length();
t = s;
reverse(all(t));
u = substring(t, 0, n - 2) + s + substring(t, 1, n - 1);
return u;
}
ld distance_between_point_line(point l_begin, point l_end, point p) {
ll xl1 = l_begin.x, yl1 = l_begin.y;
ll xl2 = l_end.x, yl2 = l_end.y;
ll xp = p.x, yp = p.y;
ll a = yl2 - yl1;
ll b = -xl2 + xl1;
ll c = -a * xl2 - b * yl2;
return abs(ld(a * xp + b * yp + c)) / ld(sqrt(a * a + b * b));
}
bool is_cross(point l1_begin, point l1_end, point l2_begin, point l2_end) {
ll x1 = l1_begin.x, y1 = l1_begin.y;
ll x2 = l1_end.x, y2 = l1_end.y;
ll x3 = l2_begin.x, y3 = l2_begin.y;
ll x4 = l2_end.x, y4 = l2_end.y;
ll val1 = (x1 - x2) * (y3 - y1) + (y1 - y2) * (x1 - x3);
ll val2 = (x1 - x2) * (y4 - y1) + (y1 - y2) * (x1 - x4);
ll val3 = (x3 - x4) * (y1 - y3) + (y3 - y4) * (x3 - x1);
ll val4 = (x3 - x4) * (y2 - y3) + (y3 - y4) * (x3 - x2);
return val1 * val2 < 0 && val3 * val4 < 0;
}
template <typename T> bool isColinear(T p1, T p2, T p3) {
T v1 = p2 - p1, v2 = p3 - p1;
return v1.x * v2.y == v1.y * v2.x;
}
template <typename T> T PerpendicularBisector(T p1, T p2) {
T vec = p2 - p1;
assert(!vec.is_zero());
T ret = {vec.y, -vec.x};
return ret;
}
template <typename T> ld Distance2DPoints(T p1, T p2) {
T vec = (p1 - p2) * (p1 - p2);
return sqrt(vec.x + vec.y);
}
ll SquaredDistance2DPoints(point p1, point p2) {
point vec = (p1 - p2) * (p1 - p2);
return vec.x + vec.y;
}
ld space_of_triangle(point p1, point p2, point p3) {
ll x1 = p1.x, y1 = p1.y;
ll x2 = p2.x, y2 = p2.y;
ll x3 = p3.x, y3 = p3.y;
ll v1 = x2 - x1;
ll u1 = y2 - y1;
ll v2 = x3 - x1;
ll u2 = y3 - y1;
ld s = ld(v1 * u2 - u1 * v2) / ld(2);
return abs(s);
}
pair<point, ll> OuterCenter(point p1, point p2, point p3) {
// the center of circle on the given three points
// return the determinant value and the product of center points and 2 *
// determinant value
point ret;
if (isColinear(p1, p2, p3)) {
ll d1 = SquaredDistance2DPoints(p1, p2);
ll d2 = SquaredDistance2DPoints(p2, p3);
ll d3 = SquaredDistance2DPoints(p3, p1);
if (d1 >= d2 && d1 >= d3) {
ret = p1 + p2;
return mp(ret, 2);
} else if (d2 >= d1 && d2 >= d3) {
ret = p2 + p3;
return mp(ret, 2);
} else {
ret = p3 + p1;
return mp(ret, 2);
}
}
point pv1 = PerpendicularBisector(p1, p2);
point pv2 = PerpendicularBisector(p1, p3);
point cv1_2x = p1 + p2, cv2_2x = p1 + p3;
// cv1 + k pv1 == cv2 + m pv2
// (pv1x -pv2x) (k) = (cv2x - cv1x)
// (pv1y -pv2y) (m) = (cv2y - cv1y)
ll det_inv = -pv1.x * pv2.y + pv1.y * pv2.x;
ll x1_2x = cv2_2x.x - cv1_2x.x, x2_2x = cv2_2x.y - cv1_2x.y;
pl c_2x_det = {-pv2.y * x1_2x + pv2.x * x2_2x,
-pv1.y * x1_2x + pv1.x * x2_2x};
// ret.x = ld(cv1_2x.x * det_inv + pv1.x * c_2x_det.e1) / ld(2 * det_inv);
// ret.y = ld(cv1_2x.y * det_inv + pv1.y * c_2x_det.e1) / ld(2 * det_inv);
ret.x = cv1_2x.x * det_inv + pv1.x * c_2x_det.e1;
ret.y = cv1_2x.y * det_inv + pv1.y * c_2x_det.e1;
ll jacobian = 2 * det_inv;
return mp(ret, jacobian);
}
ll inversion_number(vl a, ll a_max) {
/*
Paramters
---------
a: vector<ll>
All the elements must be non-negative.
Prefably the elements are compressed to reduce the computational cost.
a_max: ll
The maximum value of the vector a or the value bigger than the value
stated previously.
*/
BinaryIndexedTree bit(a_max + 1);
ll val = 0;
rep(i, a.size()) {
// i is the number of elements that have lower index than a[i].
// call the number of elements that have lower value than a[i]
// by subtracting these two, the residual number is the number of elements
// that have larger value.
val += i - bit.query(a[i] - 1); // cumulative sum from 0 to a[i] - 1
bit.update(a[i], 1);
}
return val;
}
ld bin_search(ld left, ld right, bool lb, function<bool(ld)> judge) {
ld mid;
while (right - left > EPS) {
mid = (right + left) / 2;
if (lb) {
if (judge(mid))
right = mid;
else
left = mid + EPS;
} else {
if (judge(mid))
left = mid;
else
right = mid - EPS;
}
}
return right;
}
ll bin_search(ll left, ll right, bool lb, function<bool(ll)> judge) {
ll mid;
while (right > left) {
if (lb) {
// if true (satisfies the condition), range shifts smaller direction
mid = (right + left) / 2;
if (judge(mid))
right = mid;
else
left = mid + 1;
} else {
// if true (satisfies the condition), range shitfs larger direction
mid = (right + left + 1) / 2;
if (judge(mid))
left = mid;
else
right = mid - 1;
}
}
return right;
}
ld trinary_search(ld left, ld right, function<ld(ld)> func) {
// Care the value EPS!!! Compare to the condition
while (abs(right - left) > EPS) {
ld left2 = (2.0 * left + right) / 3.0;
ld right2 = (left + 2.0 * right) / 3.0;
ld f1 = func(left2);
ld f2 = func(right2);
if (f1 <= f2)
right = right2;
else if (f2 <= f1)
left = left2;
}
return right;
}
template <typename T> vector<T> compress(vector<T> v) {
// sort and remove all the duplicated values
sort(all(v));
v.erase(unique(all(v)), v.end());
return v;
}
template <typename T> map<T, ll> dict(const vector<T> &v) {
map<T, ll> d;
rep(i, v.size()) d[v[i]] = i;
return d;
}
points compress2D(vl xs, vl ys) {
/*
NOTE
----
Add the corner points if required
*/
ll n = xs.size();
vl xcs = compress(xs), ycs = compress(ys);
map<ll, ll> xd = dict(xcs), yd = dict(ycs);
points ps(n);
rep(i, n) xs[i] = xd[xs[i]], ys[i] = yd[ys[i]];
rep(i, n) ps[i] = {xs[i], ys[i]};
sort(all(ps));
return ps;
}
void GaussJordanBitVector(vl &bs) {
ll n = bs.size();
ll rank = 0;
ll j = 0;
revrep(i, N_DIGITS) {
for (j = rank; j < n; j++)
if (bs[j] & (1LL << i))
break;
if (j == n)
continue;
if (j > rank)
bs[rank] ^= bs[j];
for (j = 0; j < n; j++)
if (j != rank)
bs[j] = min(bs[j], bs[j] ^ bs[rank]);
rank++;
}
}
ll kruskal(vector<undirected_edge> &es, ll n_vertex) {
// O(ElogE)
sort(all(es));
UnionFind uf(n_vertex);
ll min_cost = 0;
rep(i, es.size()) {
undirected_edge &e = es[i];
if (!uf.is_same(e.from, e.to)) {
min_cost += e.cost;
uf.unite(e.from, e.to);
}
}
return min_cost;
}
ll LongestIncreasedSequence(vl &v) {
ll n = v.size();
vl dp(n, INF);
rep(i, n) * lower_bound(all(dp), v[i]) = v[i];
return lower_bound(all(dp), INF) - dp.begin();
}
void dijkstra(ll start, Graph &graph, vl &dist, vl &vertex_pre,
bool trace = false) {
priority_queue<pl, vpl, greater<pl>> q;
ll n = graph.size();
dist = vl(n, INF);
if (trace)
vertex_pre = vl(n, -1);
dist[start] = 0;
q.push(pl(0, start));
while (!q.empty()) {
ll idx, cost;
tie(cost, idx) = q.top();
q.pop();
if (dist[idx] < cost)
continue;
for (auto &e : graph[idx]) {
if (chmin(dist[e.to], dist[idx] + e.cost)) {
if (trace)
vertex_pre[e.to] = idx;
q.push(pl(dist[e.to], e.to));
}
}
}
}
vl get_predecessor(ll g, vl &vertex_pre) {
vl path;
for (; g != -1; g = vertex_pre[g])
path.pb(g);
reverse(all(path));
return path;
}
void warshall_floyd(vl2 &dist) {
ll n = dist.size();
// Dont forget the initialization
// rep(i, n) rep(j, n) dist[i][j] = INF * (i != j);
rep(k, n) rep(i, n) rep(j, n) dist[i][j] =
min(dist[i][j], dist[i][k] + dist[k][j]);
}
// ABC061D, 137E
bool find_negative_cycle(ll n, ll goal, Graph &graph, vl &dist) {
rep(i, n) rep(v, n) rep(k, graph[v].size()) {
edge e = graph[v][k];
if (dist[e.to] != INF && dist[e.to] > dist[v] + e.cost) {
dist[e.to] = -INF;
if (goal == -1)
return true;
else if (goal == e.to)
return true;
}
}
return false;
}
bool bellman_ford(ll start, ll goal, Graph &graph, vl &dist) {
// if there is a closed circuit, it returns false. (when goal == -1)
// if the distance to goal cannot be obtained, it returns false (when goal !=
// -1)
ll n = graph.size();
dist = vl(n, INF);
dist[start] = 0;
rep(i, n) rep(v, n) rep(k, graph[v].size()) {
edge e = graph[v][k];
if (dist[v] != INF && dist[e.to] > dist[v] + e.cost)
dist[e.to] = dist[v] + e.cost;
}
if (find_negative_cycle(n, goal, graph, dist))
return false;
return true;
}
void Euler_Tour(Graph &tree, vl &euler_tour, vl &in, vl &out, ll anc = 0) {
// record only when we first reach a node and leave the node.
ll n = tree.size();
vb visited(n, false);
in = out = vl(n);
auto dfs = [&](auto dfs, ll source) -> void {
visited[source] = true;
in[source] = euler_tour.size();
euler_tour.pb(source);
bool is_leaf = true;
for (auto &e : tree[source]) {
ll target = e.to;
if (visited[target])
continue;
else
is_leaf = false;
dfs(dfs, target);
}
euler_tour.pb(-source);
out[source] = euler_tour.size() - 1;
};
dfs(dfs, anc);
}
void Euler_Tour2(Graph &tree, vl &euler_tour, vl &in, vl &out, ll anc = 0) {
// record everytime we reach a node
ll n = tree.size();
vb visited(n, false);
in = out = vl(n);
auto dfs = [&](auto dfs, ll source) -> void {
visited[source] = true;
in[source] = euler_tour.size();
euler_tour.pb(source);
bool is_leaf = true;
for (auto &e : tree[source]) {
ll target = e.to;
if (visited[target])
continue;
else
is_leaf = false;
dfs(dfs, target);
euler_tour.pb(source);
}
out[source] = euler_tour.size() - 1;
};
dfs(dfs, anc);
}
std::mt19937 create_rand_engine() {
std::random_device rnd;
std::vector<std::uint_least32_t> v(10);
std::generate(v.begin(), v.end(), std::ref(rnd));
std::seed_seq seed(v.begin(), v.end());
return std::mt19937(seed);
}
vl generate_unique_array(const size_t sz, ll vm, ll vM) {
const size_t range = static_cast<size_t>(vM - vm + 1);
const size_t num = static_cast<size_t>(sz * 1.2);
assert(vm <= vM);
assert(sz <= range);
vl ret;
auto engine = create_rand_engine();
std::uniform_int_distribution<ll> distribution(vm, vM);
while (ret.size() < sz) {
while (ret.size() < num)
ret.pb(distribution(engine));
sort(all(ret));
auto unique_end = unique(all(ret));
if (sz < distance(ret.begin(), unique_end))
unique_end = next(ret.begin(), sz);
ret.erase(unique_end, ret.end());
}
return ret;
}
vl generate_array(const size_t sz, ll vm, ll vM) {
const size_t range = static_cast<size_t>(vM - vm + 1);
assert(vm <= vM);
vl ret;
auto engine = create_rand_engine();
std::uniform_int_distribution<ll> distribution(vm, vM);
while (ret.size() < sz)
ret.pb(distribution(engine));
return ret;
}
void read_vector(ll n, vl &v, ll offset = 0) {
v.resize(n);
rep(i, n) {
in1(v[i]);
v[i] += offset;
}
}
void read_points(ll n, points &ps, ll offset = 0) {
ps.resize(n);
rep(i, n) {
ll x, y;
in2(x, y);
ps[i] = {x, y};
ps[i] += offset;
}
}
void read_2DMap(ll w, ll h, vb2 &block, char b) {
block = vb2(w, vb(h, false));
string s;
rep(y, h) {
in1(s);
rep(x, w) block[x][y] = (s[x] == b);
}
}
ll diameter_of_tree(Graph &tree) {
ll dM = 0, vM = 0, v1, v2;
auto dfs = [&](auto dfs, ll src, ll par, ll d) -> void {
if (chmax(dM, d))
vM = src;
for (auto &e : tree[src]) {
if (e.to == par)
continue;
dfs(dfs, e.to, src, d + 1);
}
};
dfs(dfs, 0, -1, 0);
v1 = vM;
dfs(dfs, vM, -1, 0);
v2 = vM;
return dM;
}
/*
diameter of tree
Graph tree;
ll dM = 0, vM = 0, v2 = 0;
void dfs1(ll source, ll parent, ll d){
if (d > dM) dM = d, vM = source;
rep(i, tree[source].size()){
ll target = tree[source][i].to;
if (target == parent) continue;
dfs1(target, source, d + 1);
}
}
void dfs2(ll source, ll parent, ll d){
if (dM <= d) dM = d, v2 = source;
rep(i, tree[source].size()){
ll target = tree[source][i].to;
if (target == parent) continue;
dfs2(target, source, d + 1);
}
}
dfs(0, -1, 0);
dfs2(vM, -1, 0);
prl2(vM + 1, v2 + 1); // the two edges of tree
*/
/*
#5. shakutori method (syakutori, two pointers technique)
// 1. strech right side while the condition is met.
// 2. renew the answer
// 3. increments left side
// 4. Back to 1. (l <= r must be satisfied all the time.)
ll l = 0, r = 0;
while (l < n){
if (l == r) r++;
while(r < n && cond) r++;
l++;
}
prl(answer);
#11. bfs ABC146D, ABC007C
1. first create a graph.
2. start searching from a node.
3. do some processes and push nodes connected with a given target node in
BFS.
4. repeat a series of procedure until queue is empty.
ll n; in1(n);
queue<tp3> q; vb visited(n, false);
auto bfs = [&](ll src, ll par){
visited[src] = true;
for (auto& e: graph[src]){
if (e.to != par && !visited[e.to]){
q.push(mt(e.to, src, ...));
}
}
};
q.push(mt(0, -1, 0));
while(!q.empty()){
ll src, par, ...; tie(src, par, ...) = q.front(); q.pop();
bfs(src, par, ...);
}
*/
/*
x: 1001 1010 1100 1011 1101 1111
x & ~ x: 0001 0010 0100 0001 0001 0001
sum: 1010 1100 10000 1100 1100 10000
####### Attention #######
S | (1 << i) -> S union {i}
S & ~(1 << i) -> S - {i}
# inclusion-exclusion principle
|U[i = 1 to n] Ai| = sum[i = 1 to n] |Ai| - sum[i < j]|Ai ^ Aj| + ... + (-1)^(n
- 1) |^[i = 1 to n]Ai|
*/
const ll MAX_N = 200005;
const size_t MAX_BIT = 160 * 160 + 10;
typedef bitset<MAX_BIT> bts;
typedef vector<bts> vbt;
typedef vector<vbt> vbt2;
typedef vector<vbt2> vbt3;
void solve() {
// generate_array(size, min, max);
ll n;
string s;
in2(n, s);
ll answer = 0;
rep(i, n) {
string t = substring(s, i, n - 1);
vl cnt = z_algorithm(t, n - i);
For(j, 1, n - i) chmax(answer, min(cnt[j], j));
}
prl(answer);
// ### DEBUG PART ###
auto naive_solver = [&]() {};
#ifdef _LOCAL
naive_solver();
#endif
}
void test(ll num = 0, bool verbose = false) {
rep(i, max(1LL, num)) {
ll t = clock();
if (verbose)
prl4("\n#####", i + 1, "#####", "\n## Answer ##");
solve();
if (verbose) {
prl("");
prl_time(t);
}
}
}
int main(void) {
#ifdef _LOCAL
test(6, true);
#else
test(0, false);
#endif
return 0;
}
| replace | 2,218 | 2,219 | 2,218 | 2,219 | 0 | |
p02913 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
using namespace std;
int n;
string str;
bool check(int mid) {
for (int i = 0; i < n - mid; i++) {
for (int j = i + mid; j < n; j++) {
if (str[i] != str[j])
continue;
if (str.substr(i, mid) == str.substr(j, mid)) {
return true;
}
}
}
return false;
}
int main() {
cin >> n;
cin >> str;
int s = 0, g = n / 2 + 1;
while (g - s > 1) {
int mid = (s + g) / 2;
if (check(mid)) {
s = mid;
} else {
g = mid;
}
}
cout << s << "\n";
} | #include <iostream>
#include <string>
using namespace std;
int n;
string str;
bool check(int mid) {
for (int i = 0; i < n - mid; i++) {
if (string(str.begin() + i + mid, str.end()).find(str.substr(i, mid)) !=
string::npos) {
return true;
}
}
return false;
}
int main() {
cin >> n;
cin >> str;
int s = 0, g = n / 2 + 1;
while (g - s > 1) {
int mid = (s + g) / 2;
if (check(mid)) {
s = mid;
} else {
g = mid;
}
}
cout << s << "\n";
} | replace | 10 | 16 | 10 | 13 | TLE | |
p02913 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = (1 << 30) - 1;
const ll LINF = (1LL << 60) - 1;
int dp[3010][3010];
int main() {
int n;
string s;
cin >> n >> s;
for (int i = n - 1; i >= 0; --i) {
for (int j = n - 1; j >= i; --j) {
if (s[i] == s[j]) {
dp[i][j] = dp[i + 1][j + 1] + 1;
}
}
}
int res = 0;
for (int i = 0; i < n; ++i) {
for (int j = i; j < n; ++j) {
if (dp[i][j] <= j - i)
chmax(res, dp[i][j]);
}
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = (1 << 30) - 1;
const ll LINF = (1LL << 60) - 1;
int dp[5010][5010];
int main() {
int n;
string s;
cin >> n >> s;
for (int i = n - 1; i >= 0; --i) {
for (int j = n - 1; j >= i; --j) {
if (s[i] == s[j]) {
dp[i][j] = dp[i + 1][j + 1] + 1;
}
}
}
int res = 0;
for (int i = 0; i < n; ++i) {
for (int j = i; j < n; ++j) {
if (dp[i][j] <= j - i)
chmax(res, dp[i][j]);
}
}
cout << res << endl;
} | replace | 25 | 26 | 25 | 26 | 0 | |
p02913 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define sc second
#define ALL(x) x.begin(), x.end()
#define RALL(X) x.begin(), x.end()
#define FOR(i, n, k) for (i = 0; i < n; i += k)
#define FO(i, n, k) for (i = 1; i <= n; i += k)
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define N 100005
#define mid ((l + r) / 2)
#define dbg(x) (cerr << #x << " : " << x << endl)
#define endl "\n"
using namespace std;
#define int long long
const int NMAX = 1e3 + 5;
int dp[NMAX][NMAX];
int n, res;
string s;
signed main() {
ios_base::sync_with_stdio(false);
cin >> n;
cin >> s;
for (int i = n - 1; i >= 0; i--) {
for (int j = n - 1; j > i; j--) {
if (s[i] == s[j]) {
dp[i][j] = max(dp[i][j], 1 + dp[i + 1][j + 1]);
}
res = max(res, min(dp[i][j], j - i));
}
}
cout << res;
return 0;
}
/*
ababab
2 7
2 3 4 5 6 7
1 8
1 2 3 4 5 6 7 8
*/ | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define sc second
#define ALL(x) x.begin(), x.end()
#define RALL(X) x.begin(), x.end()
#define FOR(i, n, k) for (i = 0; i < n; i += k)
#define FO(i, n, k) for (i = 1; i <= n; i += k)
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define N 100005
#define mid ((l + r) / 2)
#define dbg(x) (cerr << #x << " : " << x << endl)
#define endl "\n"
using namespace std;
#define int long long
const int NMAX = 5e3 + 5;
int dp[NMAX][NMAX];
int n, res;
string s;
signed main() {
ios_base::sync_with_stdio(false);
cin >> n;
cin >> s;
for (int i = n - 1; i >= 0; i--) {
for (int j = n - 1; j > i; j--) {
if (s[i] == s[j]) {
dp[i][j] = max(dp[i][j], 1 + dp[i + 1][j + 1]);
}
res = max(res, min(dp[i][j], j - i));
}
}
cout << res;
return 0;
}
/*
ababab
2 7
2 3 4 5 6 7
1 8
1 2 3 4 5 6 7 8
*/ | replace | 20 | 21 | 20 | 21 | 0 | |
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
#define repa(i, n) for (auto &i : n)
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
struct init {
init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} init_;
#ifdef DEBUG
template <class T, class N> void verr(const T &a, const N &n) {
rep(i, n) cerr << a[i] << " ";
cerr << "\n" << flush;
}
ll dbgt = 1;
void err() { cerr << "passed " << dbgt++ << "\n" << flush; }
template <class H, class... T> void err(H &&h, T &&...t) {
cerr << h << (sizeof...(t) ? " " : "\n") << flush;
if (sizeof...(t) > 0)
err(forward<T>(t)...);
}
#endif
const ll INF = 4e18;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
//--------------------------------------------------------------------------------//
int main() {
ll N;
cin >> N;
string S;
cin >> S;
ll ans = 0;
repe(n, 1, N) {
string s = S.substr(0, n), t = S.substr(n, N - n);
ll sn = n, tn = N - n;
vvc<ll> dp(sn + 1, vl(tn + 1));
rep(i, sn) rep(j, tn) {
if (s[i] == t[j])
chmax(dp[i + 1][j + 1], dp[i][j] + 1), chmax(ans, dp[i + 1][j + 1]);
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
#define repa(i, n) for (auto &i : n)
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
struct init {
init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} init_;
#ifdef DEBUG
template <class T, class N> void verr(const T &a, const N &n) {
rep(i, n) cerr << a[i] << " ";
cerr << "\n" << flush;
}
ll dbgt = 1;
void err() { cerr << "passed " << dbgt++ << "\n" << flush; }
template <class H, class... T> void err(H &&h, T &&...t) {
cerr << h << (sizeof...(t) ? " " : "\n") << flush;
if (sizeof...(t) > 0)
err(forward<T>(t)...);
}
#endif
const ll INF = 4e18;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
//--------------------------------------------------------------------------------//
int main() {
ll N;
cin >> N;
string S;
cin >> S;
ll ans = 0;
vvc<ll> dp(N + 1, vl(N + 1));
rep(i, N) repe(j, i + 1, N) {
if (S[i] == S[j]) {
chmax(dp[i + 1][j + 1], dp[i][j] + 1);
chmax(ans, min(j - i, dp[i + 1][j + 1]));
}
}
cout << ans << endl;
} | replace | 66 | 74 | 66 | 71 | TLE | |
p02913 | C++ | Runtime Error | #include <iostream>
using namespace std;
int table[5001][5001];
int main() {
int N;
cin >> N;
char S[5001];
cin >> S;
for (int diff = 1; diff < N; diff++) {
for (int i2 = N - 1; i2 >= 0; i2--) {
int i1 = i2 - diff;
if (i2 < 0)
break;
if (S[i1] == S[i2]) {
if (i2 == N - 1) {
table[i1][i2] = 1;
} else {
table[i1][i2] = min(i2 - i1, 1 + table[i1 + 1][i2 + 1]);
}
}
}
}
int ans = 0;
int a1 = -1;
int a2 = -1;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
if (ans < table[i][j]) {
ans = table[i][j];
a1 = i;
a2 = j;
}
}
}
cout << ans << endl;
// cerr << a1 << " " << a2 << endl;
return 0;
} | #include <iostream>
using namespace std;
int table[5001][5001];
int main() {
int N;
cin >> N;
char S[5001];
cin >> S;
for (int diff = 1; diff < N; diff++) {
for (int i2 = N - 1; i2 >= 0; i2--) {
int i1 = i2 - diff;
if (i1 < 0)
break;
if (S[i1] == S[i2]) {
if (i2 == N - 1) {
table[i1][i2] = 1;
} else {
table[i1][i2] = min(i2 - i1, 1 + table[i1 + 1][i2 + 1]);
}
}
}
}
int ans = 0;
int a1 = -1;
int a2 = -1;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
if (ans < table[i][j]) {
ans = table[i][j];
a1 = i;
a2 = j;
}
}
}
cout << ans << endl;
// cerr << a1 << " " << a2 << endl;
return 0;
} | replace | 14 | 15 | 14 | 15 | 127 | /tmp/f4245b20-8c0c-486c-83b1-3064a1f2fcd0.out: error while loading shared libraries: libc.so.6: failed to map segment from shared object
|
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i, x) for (long long i = 0; i < x; i++)
#define repn(i, x) for (long long i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
vector<pair<string, P>> vec;
// vector<vector<int>> data(3, vector<int>(4));
ll dp[2502][5001];
void solve(long long N, string S) {
ll res = 0;
ll s[N];
rep(i, N) s[i] = S[i] - 'a' + 1;
repn(i, N / 2 + 1) {
map<ll, ll> m;
repn(j, N) {
if (j + i - 2 >= N)
break;
dp[i][j] = (dp[i - 1][j] * 27 + (S[i + j - 2] - 'a' + 1)) % 90071992547;
if (res != i) {
ll n = m[dp[i][j]];
if (n > 0) {
if (j > n + i - 1) {
res = i;
}
} else {
m[dp[i][j]] = j;
}
}
}
}
cout << res << endl;
}
int main() {
string S;
long long N;
scanf("%lld", &N);
cin >> S;
solve(N, S);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i, x) for (long long i = 0; i < x; i++)
#define repn(i, x) for (long long i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
vector<pair<string, P>> vec;
// vector<vector<int>> data(3, vector<int>(4));
ll dp[2502][5001];
void solve(long long N, string S) {
ll res = 0;
ll s[N];
rep(i, N) s[i] = S[i] - 'a' + 1;
repn(i, N / 2 + 1) {
map<ll, ll> m;
repn(j, N) {
if (j + i - 2 >= N)
break;
dp[i][j] = (dp[i - 1][j] * 27 + (S[i + j - 2] - 'a' + 1)) % 90071992547;
if (res != i) {
ll n = m[dp[i][j]];
if (n > 0) {
if (j > n + i - 1) {
res = i;
}
} else {
m[dp[i][j]] = j;
}
}
}
if (res != i)
break;
}
cout << res << endl;
}
int main() {
string S;
long long N;
scanf("%lld", &N);
cin >> S;
solve(N, S);
return 0;
}
| insert | 46 | 46 | 46 | 48 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <array>
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::string S;
std::cin >> S;
// 各アルファベットの登場箇所
std::array<std::vector<short>, 26 * 26> top;
for (int i = 0; i < (N - 1); ++i) {
top[(((size_t)S[i] - 'a') * 26) + (size_t)S[(size_t)i + 1] - 'a'].push_back(
(short)i);
}
size_t max = 0;
for (auto &alpha : top) {
const int size = (int)alpha.size();
for (int i = 0; i < (size - 1); ++i) {
for (int j = i + 1; j < size; ++j) {
const size_t maxLength =
std::min(std::min(alpha[j] - alpha[i], (N + 1) / 2), N - alpha[j]);
// 先頭2文字は合致しているので2スタート
size_t length;
for (length = 2; length < maxLength; ++length) {
// 一致文字数を調べる
if (S[alpha[i] + length] != S[alpha[j] + length]) {
// 違う文字が見つかった
break;
}
}
if (max < length) {
max = length;
}
}
}
}
if (max <= 1) {
max = 0;
}
std::cout << max;
return 0;
}
| #include <array>
#include <iostream>
#include <vector>
int main() {
int N;
std::cin >> N;
std::string S;
std::cin >> S;
// 各アルファベットの登場箇所
std::array<std::vector<short>, 26 * 26> top;
for (int i = 0; i < (N - 1); ++i) {
top[(((size_t)S[i] - 'a') * 26) + (size_t)S[(size_t)i + 1] - 'a'].push_back(
(short)i);
}
size_t max = 0;
for (auto &alpha : top) {
const int size = (int)alpha.size();
for (int i = 0; i < (size - 1); ++i) {
for (int j = i + 1; j < size; ++j) {
const size_t maxLength =
std::min(std::min(alpha[j] - alpha[i], (N + 1) / 2), N - alpha[j]);
if (maxLength < max) {
// すでに短い
continue;
}
// 先頭2文字は合致しているので2スタート
size_t length;
for (length = 2; length < maxLength; ++length) {
// 一致文字数を調べる
if (S[alpha[i] + length] != S[alpha[j] + length]) {
// 違う文字が見つかった
break;
}
}
if (max < length) {
max = length;
}
}
}
}
if (max <= 1) {
max = 0;
}
std::cout << max;
return 0;
}
| insert | 26 | 26 | 26 | 30 | TLE | |
p02913 | C++ | Runtime Error | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define DBG_N(hoge) cerr << " " << (hoge) << endl;
#define DBG cerr << "!" << endl;
#define BITLE(n) (1LL << ((ll)n))
#define BITCNT(n) (__builtin_popcountll(n))
#define SUBS(s, f, t) ((s).substr((f)-1, (t) - (f) + 1))
#define ALL(a) (a).begin(), (a).end()
using namespace std;
ll n;
string s;
bool hogege = true;
bool check(ll mid) {
map<string, pair<ll, ll>> MP;
for (ll i = 0; i <= s.size() - mid; i++) {
string ss = SUBS(s, i + 1, i + mid);
ll num = MP[ss].F, num2 = MP[ss].S;
if (num == 0) {
MP[ss] = mp(i + 1, i + 1);
} else {
MP[ss] = mp(min(i + 1, num), max(i + 1, num2));
}
}
for (auto a : MP) {
ll po = a.S.F, po2 = a.S.S;
if (po + mid <= po2) {
return true;
}
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> s;
ll le = 0, ri = 222222;
while (ri - le > 1) {
ll mid = (le + ri) / 2;
if (check(mid)) {
le = mid;
} else
ri = mid;
}
cout << le << endl;
return 0;
}
| #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define ull unsigned long long
#define vi vector<ll>
#define vvi vector<vi>
#define DBG_N(hoge) cerr << " " << (hoge) << endl;
#define DBG cerr << "!" << endl;
#define BITLE(n) (1LL << ((ll)n))
#define BITCNT(n) (__builtin_popcountll(n))
#define SUBS(s, f, t) ((s).substr((f)-1, (t) - (f) + 1))
#define ALL(a) (a).begin(), (a).end()
using namespace std;
ll n;
string s;
bool hogege = true;
bool check(ll mid) {
map<string, pair<ll, ll>> MP;
for (ll i = 0; i <= s.size() - mid; i++) {
string ss = SUBS(s, i + 1, i + mid);
ll num = MP[ss].F, num2 = MP[ss].S;
if (num == 0) {
MP[ss] = mp(i + 1, i + 1);
} else {
MP[ss] = mp(min(i + 1, num), max(i + 1, num2));
}
}
for (auto a : MP) {
ll po = a.S.F, po2 = a.S.S;
if (po + mid <= po2) {
return true;
}
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> s;
ll le = 0, ri = n / 2 + 1;
while (ri - le > 1) {
ll mid = (le + ri) / 2;
if (check(mid)) {
le = mid;
} else
ri = mid;
}
cout << le << endl;
return 0;
}
| replace | 45 | 46 | 45 | 46 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::substr: __pos (which is 6) > this->size() (which is 5)
|
p02913 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void Main();
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
}
void Main() {
auto &fin = cin;
int64_t n;
string s;
fin >> n >> s;
auto max_length_of_true_seq = [](const vector<bool> &v) -> int64_t {
int64_t ret = 0;
int64_t tmp = 0;
for (int64_t i = 0; i < v.size(); ++i) {
if (v[i]) {
tmp++;
} else {
ret = max(tmp, ret);
tmp = 0;
}
}
ret = max(tmp, ret);
return ret;
};
int64_t ans = 0;
for (int64_t i = 0; i < n; ++i) {
vector<bool> tmp(n - i);
for (int64_t j = 0; j < n - 1; ++j) {
tmp[j] = s[i + j] == s[j];
}
ans = max(ans, min(i, max_length_of_true_seq(tmp)));
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
void Main();
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
}
void Main() {
auto &fin = cin;
int64_t n;
string s;
fin >> n >> s;
auto max_length_of_true_seq = [](const vector<bool> &v) -> int64_t {
int64_t ret = 0;
int64_t tmp = 0;
for (int64_t i = 0; i < v.size(); ++i) {
if (v[i]) {
tmp++;
} else {
ret = max(tmp, ret);
tmp = 0;
}
}
ret = max(tmp, ret);
return ret;
};
int64_t ans = 0;
for (int64_t i = 0; i < n; ++i) {
vector<bool> tmp(n - i);
for (int64_t j = 0; j < n - i; ++j) {
tmp[j] = s[i + j] == s[j];
}
ans = max(ans, min(i, max_length_of_true_seq(tmp)));
}
cout << ans << endl;
}
| replace | 34 | 35 | 34 | 35 | 0 | |
p02913 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 1; i <= n; ++i)
#define all(x) x.begin(), x.end()
#define mp make_pair
#define pb push_back
#define pf push_front
#define F first
#define S second
#define read(x) scanf("%d", &x)
int n;
char s[5005];
const ll H = 19260817, P = 998244353;
ll nxt[5005][5005];
int ans = 0;
int main() {
ios::sync_with_stdio(false);
cin >> n >> s + 1;
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= n; ++j)
nxt[i][j] = (nxt[i][j - 1] + s[i + j - 1]) * H % P;
}
for (int i = 1; i < n; ++i) {
for (int j = i + 1; j <= n; ++j) {
if (s[i] != s[j])
continue;
int L = 0, R = min(n - j + 1, j - i);
if (nxt[i][R] == nxt[j][R]) {
ans = max(ans, R);
continue;
}
while (R - L > 1) {
if (R <= ans)
break;
int M = L + R >> 1;
if (nxt[i][M] == nxt[j][M])
L = M;
else
R = M;
}
ans = max(ans, L);
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 1; i <= n; ++i)
#define all(x) x.begin(), x.end()
#define mp make_pair
#define pb push_back
#define pf push_front
#define F first
#define S second
#define read(x) scanf("%d", &x)
int n;
char s[5005];
const ll H = 19260817, P = 998244353;
ll nxt[5005][5005];
int ans = 0;
int main() {
ios::sync_with_stdio(false);
cin >> n >> s + 1;
for (int i = 1; i <= n; ++i) {
for (int j = 1; i + j - 1 <= n; ++j)
nxt[i][j] = (nxt[i][j - 1] + s[i + j - 1]) * H % P;
}
for (int i = 1; i < n; ++i) {
for (int j = i + 1; j <= n; ++j) {
if (s[i] != s[j])
continue;
int L = 0, R = min(n - j + 1, j - i);
if (nxt[i][R] == nxt[j][R]) {
ans = max(ans, R);
continue;
}
while (R - L > 1) {
if (R <= ans)
break;
int M = L + R >> 1;
if (nxt[i][M] == nxt[j][M])
L = M;
else
R = M;
}
ans = max(ans, L);
}
}
cout << ans << endl;
return 0;
} | replace | 41 | 42 | 41 | 42 | -11 | |
p02913 | Python | Time Limit Exceeded | n = int(input())
s = input()
dp = [[0] * (n + 1) for _ in range(n + 1)]
res = 0
for i in range(n - 1, -1, -1):
for j in range(n - 1, i, -1):
if s[i] == s[j]:
dp[i][j] = max(dp[i][j], dp[i + 1][j + 1] + 1)
res = max(res, min(dp[i][j], j - i))
print(res)
| n = int(input())
s = input()
dp = [[0] * (n + 1) for _ in range(n + 1)]
res = 0
for i in range(n - 1, -1, -1):
for j in range(n - 1, i, -1):
if s[i] == s[j]:
dp[i][j] = dp[i + 1][j + 1] + 1
# dp[i][j] = max(dp[i][j], dp[i + 1][j + 1] + 1)
res = max(res, min(dp[i][j], j - i))
print(res)
| replace | 9 | 10 | 9 | 11 | TLE | |
p02913 | Python | Runtime Error | from sys import stdin
N = int(stdin.readline().rstrip())
S = stdin.readline().rstrip()
dp = [[0] * (N + 1) for _ in range(N + 1)]
res = 0
for i in range(N - 1, -1, -1):
for j in range(N - 1, i, -1):
if S[i] == S[j]:
dp[i][j] = dp[i + 1][j + 1] + 1, dp[i][j]
res = max(res, min(j - i, dp[i][j]))
print(res)
| from sys import stdin
N = int(stdin.readline().rstrip())
S = stdin.readline().rstrip()
dp = [[0] * (N + 1) for _ in range(N + 1)]
res = 0
for i in range(N - 1, -1, -1):
for j in range(N - 1, i, -1):
if S[i] == S[j]:
dp[i][j] = dp[i + 1][j + 1] + 1
res = max(res, min(j - i, dp[i][j]))
print(res)
| replace | 10 | 11 | 10 | 11 | TypeError: '<' not supported between instances of 'tuple' and 'int' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02913/Python/s512048354.py", line 12, in <module>
res = max(res, min(j - i, dp[i][j]))
TypeError: '<' not supported between instances of 'tuple' and 'int'
|
p02913 | Python | Time Limit Exceeded | def z_algorithm(s):
n = len(s)
prefix = [0] * n
j = 0
ret = 0
for i in range(1, n):
if i + prefix[i - j] < j + prefix[j]:
prefix[i] = prefix[i - j]
else:
k = max(0, j + prefix[j] - i)
while i + k < n and s[k] == s[i + k]:
k += 1
prefix[i] = k
ret = min(i, k)
j = i
return ret
n = int(input())
s = input()
print(max(z_algorithm(s[i:]) for i in range(n - 1)))
| def z_algorithm(s):
n = len(s)
prefix = [0] * n
j = 0
ret = 0
for i in range(1, n):
if i + prefix[i - j] < j + prefix[j]:
prefix[i] = prefix[i - j]
else:
k = max(0, j + prefix[j] - i)
while i + k < n and s[k] == s[i + k]:
k += 1
prefix[i] = k
ret = max(ret, min(i, k))
j = i
return ret
n = int(input())
s = input()
print(max(z_algorithm(s[i:]) for i in range(n - 1)))
| replace | 13 | 14 | 13 | 14 | TLE | |
p02913 | Python | Time Limit Exceeded | import sys
input = sys.stdin.readline
class AtCoder:
def main(self):
N = int(input())
S = input().rstrip()
half = N // 2
for length in range(1, half + 1)[::-1]:
i = 0
already = set()
while i + length < N:
v = S[i : i + length]
if v in already:
i += 1
continue
if S.count(S[i : i + length]) >= 2:
print(length)
exit()
else:
already.add(v)
i += 1
print(0)
# Run main
if __name__ == "__main__":
AtCoder().main()
| import sys
input = sys.stdin.readline
class AtCoder:
def main(self):
N = int(input())
S = input().rstrip()
dp = [[0 for i in range(N + 1)] for j in range(N + 1)]
ans = 0
for i in range(N)[::-1]:
for j in range(N)[::-1]:
if S[i] == S[j]:
dp[i][j] = min(dp[i + 1][j + 1] + 1, abs(i - j))
ans = max(ans, dp[i][j])
print(ans)
# Run main
if __name__ == "__main__":
AtCoder().main()
| replace | 10 | 27 | 10 | 18 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll N;
char S[5050];
ll ln[5050];
ll i, j, k, ans;
ll calc(ll b) {
ll i = 1;
ll j = 0;
ll ret = 0;
while (i + b < N) {
// printf("%lld%lld\n", b,i);
if (i + ln[i - j] < j + ln[j]) {
ln[i] = ln[i - j];
if (ret < min(i, ln[i])) {
ret = min(i, ln[i]);
}
} else {
ll k = j + ln[i] - i > 0 ? j + ln[i] - i : 0;
while (i + k + b < N && S[k + b] == S[i + k + b])
k++;
ln[i] = k;
if (ret < min(i, ln[i])) {
ret = min(i, ln[i]);
}
j = i;
}
i++;
}
return ret;
}
int main() {
scanf("%lld%s", &N, S);
fornum(i, 0, N) {
ll a = calc(i);
// printf("%lld:%lld\n", i, a);
if (ans < a)
ans = a;
ll j;
fornum(j, 0, i) { ln[j] = 0ll; }
}
printf("%lld", ans);
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll N;
char S[5050];
ll ln[5050];
ll i, j, k, ans;
ll calc(ll b) {
ll i = 1;
ll j = 0;
ll ret = 0;
while (i + b < N) {
// printf("%lld%lld\n", b,i);
if (i + ln[i - j] < j + ln[j]) {
ln[i] = ln[i - j];
if (ret < min(i, ln[i])) {
ret = min(i, ln[i]);
}
} else {
ll k = j + ln[i] - i > 0 ? j + ln[i] - i : 0;
while (i + k + b < N && S[k + b] == S[i + k + b])
k++;
ln[i] = k;
if (ret < min(i, ln[i])) {
ret = min(i, ln[i]);
}
j = i;
}
i++;
}
return ret;
}
int main() {
scanf("%lld%s", &N, S);
fornum(i, 0, N) {
ll a = calc(i);
// printf("%lld:%lld\n", i, a);
if (ans < a)
ans = a;
ll j;
fornum(j, 0, i) {}
}
printf("%lld", ans);
return 0;
}
| replace | 51 | 52 | 51 | 52 | TLE | |
p02913 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
// s[i:], s[j:] が何文字目まで一致するか
// 0 <= i < j < |S|
int solve(string &s, vector<vector<int>> memo, int i, int j) {
if (i >= s.size() || j >= s.size() || s[i] != s[j]) {
return 0;
}
if (memo[i][j] < 0) {
memo[i][j] = min(j - i, solve(s, memo, i + 1, j + 1) + 1);
}
return memo[i][j];
}
int main(int argc, const char *argv[]) {
int n;
string s;
cin >> n >> s;
vector<vector<int>> memo(s.size(), vector<int>(s.size(), -1));
int ans = 0;
for (int i = 0; i < s.size() - 1; i++) {
for (int j = i + 1; j < s.size(); j++) {
ans = max(ans, solve(s, memo, i, j));
}
}
cout << ans << '\n';
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
// s[i:], s[j:] が何文字目まで一致するか
// 0 <= i < j < |S|
int solve(string &s, vector<vector<int>> &memo, int i, int j) {
if (i >= s.size() || j >= s.size() || s[i] != s[j]) {
return 0;
}
if (memo[i][j] < 0) {
memo[i][j] = min(j - i, solve(s, memo, i + 1, j + 1) + 1);
}
return memo[i][j];
}
int main(int argc, const char *argv[]) {
int n;
string s;
cin >> n >> s;
vector<vector<int>> memo(s.size(), vector<int>(s.size(), -1));
int ans = 0;
for (int i = 0; i < s.size() - 1; i++) {
for (int j = i + 1; j < s.size(); j++) {
ans = max(ans, solve(s, memo, i, j));
}
}
cout << ans << '\n';
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02913 | C++ | Runtime Error |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int dp[5001][5001];
int main() {
int N;
cin >> N;
string S;
cin >> S;
for (int i = N - 1; i >= 0; i--) {
for (int j = N - 1; j >= 0; j--) {
if (S[i] != S[j]) {
dp[i][j] = 0;
} else {
dp[i][j] = dp[i - 1][j - 1] + 1;
}
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (i >= j) {
continue;
} else {
int now = min(dp[i][j], j - i);
ans = max(ans, now);
}
}
}
cout << ans << endl;
return 0;
} |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int dp[5001][5001];
int main() {
int N;
cin >> N;
string S;
cin >> S;
for (int i = N - 1; i >= 0; i--) {
for (int j = N - 1; j >= 0; j--) {
if (S[i] != S[j]) {
dp[i][j] = 0;
} else {
dp[i][j] = dp[i + 1][j + 1] + 1;
}
}
}
int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (i >= j) {
continue;
} else {
int now = min(dp[i][j], j - i);
ans = max(ans, now);
}
}
}
cout << ans << endl;
return 0;
} | replace | 21 | 22 | 21 | 22 | 127 | /tmp/a1688baa-538c-460c-a959-effa66210d5f.out: error while loading shared libraries: libc.so.6: failed to map segment from shared object
|
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
const int INT_INF = 1 << 30;
#define MOD 1000000007LL
#define endl "\n"
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll N;
cin >> N;
string S;
cin >> S;
vvll a(26, vll(0));
for (int i = 0; i < N; i++) {
a.at(S.at(i) - 'a').push_back(i);
}
ll ans = 0LL;
for (int i = 0; i < 26; i++) {
int num = a.at(i).size();
for (int j = 0; j < num - 1; j++) {
for (int k = j + 1; k < num; k++) {
ll counter = 0;
int jj = a.at(i).at(j), kk = a.at(i).at(k);
while (jj + counter < kk && kk + counter < N &&
S[jj + counter] == S[kk + counter]) {
counter++;
}
chmax(ans, counter);
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
const int INT_INF = 1 << 30;
#define MOD 1000000007LL
#define endl "\n"
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll N;
cin >> N;
string S;
cin >> S;
vvll a(26, vll(0));
for (int i = 0; i < N; i++) {
a.at(S.at(i) - 'a').push_back(i);
}
ll ans = 0LL;
for (int i = 0; i < 26; i++) {
int num = a.at(i).size();
for (int j = 0; j < num - 1; j++) {
for (int k = j + 1; k < num; k++) {
ll counter = 0;
int jj = a.at(i).at(j), kk = a.at(i).at(k);
if (jj - 1 >= 0 && kk - 1 >= jj + 1 && S[jj - 1] == S[kk - 1])
continue;
while (jj + counter < kk && kk + counter < N &&
S[jj + counter] == S[kk + counter]) {
counter++;
}
chmax(ans, counter);
}
}
}
cout << ans << endl;
} | insert | 47 | 47 | 47 | 49 | TLE | |
p02913 | C++ | Time Limit Exceeded | #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx")
#include <bits/stdc++.h>
constexpr int INF = 2147483647;
constexpr long long int INF_LL = 9223372036854775807;
constexpr int MOD = 1000000007;
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
// modint 2^61-1
class RHint {
private:
const ull MASK30 = (1UL << 30) - 1;
const ull MASK31 = (1UL << 31) - 1;
const ull RMOD = (1UL << 61) - 1;
inline ull Mul(ull a, ull b) {
ull au = a >> 31;
ull ad = a & MASK31;
ull bu = b >> 31;
ull bd = b & MASK31;
ull mid = ad * bu + au * bd;
ull midu = mid >> 30;
ull midd = mid & MASK30;
return (au * bu * 2 + midu + (midd << 31) + ad * bd);
}
// mod 2^61-1を計算する関数
inline ull CalcMod(ull a) {
a = (a & RMOD) + (a >> 61);
if (a > RMOD)
a -= RMOD;
return a;
}
public:
ull val;
RHint() { val = 0; };
RHint(ull a) { val = CalcMod(a); }
inline RHint operator+(const RHint &r) {
return RHint(CalcMod(this->val + r.val));
}
inline RHint operator*(const RHint &r) {
return RHint(Mul(this->val, r.val));
}
inline RHint &operator=(const RHint &r) {
val = r.val;
return *this;
}
inline RHint &operator+=(const RHint &r) {
*this = *this + r;
return *this;
}
inline RHint &operator*=(const RHint &r) {
*this = *this * r;
return *this;
}
};
inline bool operator==(const RHint &l, const RHint &r) {
return l.val == r.val;
}
inline bool operator!=(const RHint &l, const RHint &r) {
return l.val != r.val;
}
class RollingHash {
private:
const ull RMOD = (1UL << 61) - 1;
const ull PV = RMOD * 3;
RHint base;
public:
vector<RHint> hash, pow;
RollingHash(string s, ull b) {
int l = s.size();
base = RHint(b);
hash = vector<RHint>(l + 1, 0);
pow = vector<RHint>(l + 1, 1);
for (int i = 0; i < l; i++) {
hash[i + 1] = (hash[i] + RHint(s[i])) * base;
pow[i + 1] = pow[i] * base;
}
}
RHint get(int l, int r) {
return RHint(hash[r].val + PV - (hash[l] * pow[r - l]).val);
}
RHint connect(RHint h1, RHint h2, int h2l) { return (h1 * pow[h2l] + h2); }
int lcp(RollingHash &b, int l1, int r1, int l2, int r2) {
int len = min(r1 - l1, r2 - l2);
int low = -1, high = len + 1;
while (high - low > 1) {
int mid = (low + high) / 2;
if (get(l1, l1 + mid) == b.get(l2, l2 + mid))
low = mid;
else
high = mid;
}
return low;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int N;
cin >> N;
string s;
cin >> s;
RollingHash S(s, 10007);
int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = i; j < N; j++) {
ans = max(ans, S.lcp(S, i, j, j, N));
// cout << S.lcp(S, i, j, j, N) << endl;
}
}
cout << ans << endl;
} | #pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx")
#include <bits/stdc++.h>
constexpr int INF = 2147483647;
constexpr long long int INF_LL = 9223372036854775807;
constexpr int MOD = 1000000007;
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
// modint 2^61-1
class RHint {
private:
const ull MASK30 = (1UL << 30) - 1;
const ull MASK31 = (1UL << 31) - 1;
const ull RMOD = (1UL << 61) - 1;
inline ull Mul(ull a, ull b) {
ull au = a >> 31;
ull ad = a & MASK31;
ull bu = b >> 31;
ull bd = b & MASK31;
ull mid = ad * bu + au * bd;
ull midu = mid >> 30;
ull midd = mid & MASK30;
return (au * bu * 2 + midu + (midd << 31) + ad * bd);
}
// mod 2^61-1を計算する関数
inline ull CalcMod(ull a) {
a = (a & RMOD) + (a >> 61);
if (a > RMOD)
a -= RMOD;
return a;
}
public:
ull val;
RHint() { val = 0; };
RHint(ull a) { val = CalcMod(a); }
inline RHint operator+(const RHint &r) {
return RHint(CalcMod(this->val + r.val));
}
inline RHint operator*(const RHint &r) {
return RHint(Mul(this->val, r.val));
}
inline RHint &operator=(const RHint &r) {
val = r.val;
return *this;
}
inline RHint &operator+=(const RHint &r) {
*this = *this + r;
return *this;
}
inline RHint &operator*=(const RHint &r) {
*this = *this * r;
return *this;
}
};
inline bool operator==(const RHint &l, const RHint &r) {
return l.val == r.val;
}
inline bool operator!=(const RHint &l, const RHint &r) {
return l.val != r.val;
}
class RollingHash {
private:
const ull RMOD = (1UL << 61) - 1;
const ull PV = RMOD * 3;
RHint base;
public:
vector<RHint> hash, pow;
RollingHash(string s, ull b) {
int l = s.size();
base = RHint(b);
hash = vector<RHint>(l + 1, 0);
pow = vector<RHint>(l + 1, 1);
for (int i = 0; i < l; i++) {
hash[i + 1] = (hash[i] + RHint(s[i])) * base;
pow[i + 1] = pow[i] * base;
}
}
RHint get(int l, int r) {
return RHint(hash[r].val + PV - (hash[l] * pow[r - l]).val);
}
RHint connect(RHint h1, RHint h2, int h2l) { return (h1 * pow[h2l] + h2); }
int lcp(RollingHash &b, int l1, int r1, int l2, int r2) {
int len = min(r1 - l1, r2 - l2);
int low = -1, high = len + 1;
while (high - low > 1) {
int mid = (low + high) / 2;
if (get(l1, l1 + mid) == b.get(l2, l2 + mid))
low = mid;
else
high = mid;
}
return low;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int N;
cin >> N;
string s;
cin >> s;
RollingHash S(s, 10007);
int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = i; j < N; j++) {
while (ans < j - i && j + ans < N &&
S.get(i, i + ans + 1) == S.get(j, j + ans + 1))
ans++;
}
}
cout << ans << endl;
} | replace | 114 | 116 | 114 | 117 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template <class T> void printvec(const vector<T> &v) {
for (auto x : v) {
cout << x << " ";
}
cout << endl;
}
template <class T> void printtree(const vector<vector<T>> &tree) {
for (long long i = 0; i < tree.size(); ++i) {
cout << i + 1 << ": ";
printvec(tree[i]);
}
}
template <class T, class U> void printmap(const map<T, U> &mp) {
for (auto x : mp) {
cout << x.first << "=>" << x.second << endl;
}
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all(s) s.begin(), s.end()
#define sz(x) (ll)(x).size()
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> triple;
typedef double D;
typedef vector<ll> vl;
typedef vector<P> vp;
const ll INF = 1e9;
const ll MOD = 1000000007; // 1e9 + 7
// RollingHash with mod(2**64)
struct RollingHash {
// Mod is 2**64 (max of ull + 1)
static const ull base1 = 1000000007;
vector<ull> _hash, _power;
RollingHash(const string &S) { init(S); }
void init(const string &S) {
int n = S.size();
_hash.resize(n + 1);
_power.assign(n + 1, 1);
rep(i, n) {
_hash[i + 1] = _hash[i] * base1 + S[i];
_power[i + 1] = _power[i] * base1;
}
}
// get hash of S[l,r)
inline ull get(int l, int r) const {
ull res1 = _hash[r] - _hash[l] * _power[r - l];
return res1;
}
// get lcp of S[a:] and T[b:]
inline int getLCP(int a, int b) const {
int len = min((int)_hash.size() - a, (int)_hash.size() - b);
int low = 0, high = len;
while (high - low > 1) {
int mid = (low + high) >> 1;
if (get(a, a + mid) != get(b, b + mid))
high = mid;
else
low = mid;
}
return low;
}
};
// int main(int argc, char** argv) {
// string S("abcabc");
//
// RollingHash rh(S);
//
// cout << (rh.get(0, 3) == rh.get(3, 6)) << endl; // abc == abc: true
// cout << (rh.get(0, 3) == rh.get(3, 5)) << endl; // abc == ab: false
//
// cout << rh.getLCP(0, 3) << endl; // abc, abc: 3
// cout << rh.getLCP(1, 4) << endl; // bc, bc: 2
// cout << rh.getLCP(0, 4) << endl; // abc, bc: 0
// }
int main(int argc, char **argv) {
cin.tie(NULL);
cout.tie(NULL);
ios_base::sync_with_stdio(false);
// cout << setprecision(10) << fixed;
ll n;
cin >> n;
string S;
cin >> S;
RollingHash rh(S);
ll ans = 0;
for (ll len = n / 2; len >= 1; --len) {
if (ans > 0) {
break;
} // already found
map<ull, ll> hashes; // all hashes in [s, n)
ll s = len;
for (ll s = len; s < n; ++s) {
// Here, consider [s, s+len)
if (s + len > n) {
break;
}
ull hsh = rh.get(s, s + len);
++hashes[hsh];
}
rep(s, n) {
// Here, consider [s, s+len)
if (s + len > n) {
break;
}
{
ull hsh = rh.get(s, s + len);
if (hashes.find(hsh) != hashes.end()) { // found
chmax(ans, len);
break;
}
}
// Here, remove [s+len, s+2*len)
if (s + 2 * len > n) {
break;
}
{
ull hsh = rh.get(s + len, s + 2 * len);
--hashes[hsh];
if (hashes[hsh] == 0) {
hashes.erase(hsh);
}
}
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string.h>
#include <unordered_map>
#include <vector>
using namespace std;
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
template <class T> void printvec(const vector<T> &v) {
for (auto x : v) {
cout << x << " ";
}
cout << endl;
}
template <class T> void printtree(const vector<vector<T>> &tree) {
for (long long i = 0; i < tree.size(); ++i) {
cout << i + 1 << ": ";
printvec(tree[i]);
}
}
template <class T, class U> void printmap(const map<T, U> &mp) {
for (auto x : mp) {
cout << x.first << "=>" << x.second << endl;
}
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all(s) s.begin(), s.end()
#define sz(x) (ll)(x).size()
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> triple;
typedef double D;
typedef vector<ll> vl;
typedef vector<P> vp;
const ll INF = 1e9;
const ll MOD = 1000000007; // 1e9 + 7
// RollingHash with mod(2**64)
struct RollingHash {
// Mod is 2**64 (max of ull + 1)
static const ull base1 = 1000000007;
vector<ull> _hash, _power;
RollingHash(const string &S) { init(S); }
void init(const string &S) {
int n = S.size();
_hash.resize(n + 1);
_power.assign(n + 1, 1);
rep(i, n) {
_hash[i + 1] = _hash[i] * base1 + S[i];
_power[i + 1] = _power[i] * base1;
}
}
// get hash of S[l,r)
inline ull get(int l, int r) const {
ull res1 = _hash[r] - _hash[l] * _power[r - l];
return res1;
}
// get lcp of S[a:] and T[b:]
inline int getLCP(int a, int b) const {
int len = min((int)_hash.size() - a, (int)_hash.size() - b);
int low = 0, high = len;
while (high - low > 1) {
int mid = (low + high) >> 1;
if (get(a, a + mid) != get(b, b + mid))
high = mid;
else
low = mid;
}
return low;
}
};
// int main(int argc, char** argv) {
// string S("abcabc");
//
// RollingHash rh(S);
//
// cout << (rh.get(0, 3) == rh.get(3, 6)) << endl; // abc == abc: true
// cout << (rh.get(0, 3) == rh.get(3, 5)) << endl; // abc == ab: false
//
// cout << rh.getLCP(0, 3) << endl; // abc, abc: 3
// cout << rh.getLCP(1, 4) << endl; // bc, bc: 2
// cout << rh.getLCP(0, 4) << endl; // abc, bc: 0
// }
int main(int argc, char **argv) {
cin.tie(NULL);
cout.tie(NULL);
ios_base::sync_with_stdio(false);
// cout << setprecision(10) << fixed;
ll n;
cin >> n;
string S;
cin >> S;
RollingHash rh(S);
ll ans = 0;
rep(l, n) {
for (ll r = l + 1; r < n; ++r) {
ll lcp = rh.getLCP(l, r);
lcp = min(lcp, r - l); // NOTE: overlap is not allowed
chmax(ans, lcp);
}
}
cout << ans << endl;
}
| replace | 135 | 173 | 135 | 140 | TLE | |
p02913 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ((n) ? "Yes" : "No") << endl;
#define CFYN(n) cout << ((n) ? "YES" : "NO") << endl;
using ll = long long;
using ull = unsigned long long;
int main(void) {
IOS int n;
cin >> n;
string s;
cin >> s;
int ans = 0;
FOR(i, 1, n) {
int tmp = 0;
REP(j, n) {
if (s[j] == s[j + i]) {
tmp++;
ans = max(ans, tmp);
if (ans == i)
break;
} else {
tmp = 0;
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0);
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(n) (n).begin(), (n).end()
#define RALL(n) (n).rbegin(), (n).rend()
#define ATYN(n) cout << ((n) ? "Yes" : "No") << endl;
#define CFYN(n) cout << ((n) ? "YES" : "NO") << endl;
using ll = long long;
using ull = unsigned long long;
int main(void) {
IOS int n;
cin >> n;
string s;
cin >> s;
int ans = 0;
FOR(i, 1, n) {
int tmp = 0;
REP(j, n - i) {
if (s[j] == s[j + i]) {
tmp++;
ans = max(ans, tmp);
if (ans == i)
break;
} else {
tmp = 0;
}
}
}
cout << ans << endl;
return 0;
} | replace | 22 | 23 | 22 | 23 | 0 | |
p02913 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pint;
typedef pair<llint, llint> pllint;
typedef vector<int> vint;
typedef vector<llint> vllint;
typedef vector<pint> vpint;
typedef vector<string> vstring;
typedef vector<pair<llint, llint>> vpllint;
typedef vector<vector<int>> vvint;
typedef vector<vector<llint>> vvllint;
typedef vector<vector<pint>> vvpint;
typedef vector<bool> vbool;
typedef vector<vbool> vvbool;
typedef vector<vpllint> vvpllint;
#define rep(i, n) for (int i = 0; i < n; i++)
#define drep(i, n) for (int i = n - 1; 0 <= i; i--)
#define yes(ans) \
if (ans) \
cout << "yes" << endl; \
else \
cout << "no" << endl;
#define Yes(ans) \
if (ans) \
cout << "Yes" << endl; \
else \
cout << "No" << endl;
#define YES(ans) \
if (ans) \
cout << "YES" << endl; \
else \
cout << "NO" << endl;
#define POSSIBLE(ans) \
if (ans) \
cout << "POSSIBLE" << endl; \
else \
cout << "IMPOSSIBLE" << endl;
#define Pi 3.1415926535897932384626
#define mod llint(1e9 + 7)
#define Inf 2147483647
#define llInf 9223372036854775807
#define all(x) x.begin(), x.end()
#define pb push_back
#define isin(n, i) 0 <= i &&i < n
class UnionFind {
public:
// 親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
// 作るときはParentの値を全て-1にする
// こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
// 自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; // 親をとってきたい
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
// すでにくっついてるからくっ付けない
return false;
}
// 大きい方(A)に小さいほう(B)をくっ付けたい
// 大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
// セグ木・0-indexed・非再帰・(大きさ・単位元・関数)で初期化
template <typename T> struct SegTree {
// 比較関数の型
using F = function<T(T, T)>;
// 二分木を配列で表したもの
vector<T> seg;
// 木の半分の大きさ
int siz;
// 単位元
const T unit;
// 比較する関数
const F f;
// 大きさn、unit(単位元)、f(モノイド)でsegtreeを初期化する
SegTree(int n, const T unit, const F f) : unit(unit), f(f) {
siz = 1;
while (siz < n)
siz <<= 1;
seg.assign(siz * 2 - 1, unit);
siz--;
}
// k番目にtを入力
void set(int k, const T &t) { seg[k + siz] = t; }
// fによって木を構築する
void build() {
for (int i = siz - 1; 0 <= i; i--) {
seg[i] = f(seg[i * 2 + 1], seg[i * 2 + 2]);
}
}
T operator[](const int i) { return seg[i + siz]; }
// k番目をxに更新する
void update(int k, T x) {
k += siz;
seg[k] = x;
while (0 < k) {
k = (k - 1) >> 1;
seg[k] = f(seg[k * 2 + 1], seg[k * 2 + 2]);
}
}
//[a,b)について、fした結果を返す
// 半開区域のためa以上b未満の位置を指す
T query(int a, int b) {
T l = unit, r = unit;
for (a += siz, b += siz; a < b; a >>= 1, b >>= 1) {
if (!(a & 1))
l = f(seg[a++], l);
if (!(b & 1))
r = f(seg[--b], r);
}
return f(l, r);
}
};
// aとbの最大公約数を求めるよ
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
// 返り値: a と b の最大公約数
// ax + by = gcd(a, b) を満たす (x, y) が格納される
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
// mod. m での a の逆元 a^{-1} を計算する
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// nCrをmで割った余りを求める
llint nCr(llint n, llint r, llint m) {
llint ans = 1;
for (llint i = 0; i < r; i++) {
ans *= n - i;
ans %= m;
}
for (llint i = 1; i <= r; i++) {
ans *= modinv(i, m);
ans %= m;
}
return ans;
}
// aのb乗をmで割った余りを求める
llint power(llint a, llint b, llint m) {
if (b == 1)
return a;
if (b == 0)
return 1;
llint tmp = power(a, (llint)b / 2, m);
tmp *= tmp;
tmp %= m;
if (b % 2 == 1) {
tmp *= a;
tmp %= m;
}
return tmp;
}
// bitを表すsub,要素数を表すlength
bool next_combination(llint &sub, int length) {
llint x = sub & -sub, y = sub + x;
sub = (((sub & ~y) / x) >> 1) | y;
return sub < (llint)(1 << (llint)length);
}
void Zalgorithm(string &s, vint &a) {
a[0] = s.size();
int i = 1, j = 0;
while (i < s.size()) {
while (i + j < s.size() && s[j] == s[i + j])
j++;
a[i] = j;
if (j == 0) {
i++;
continue;
}
int k = 1;
while (i + k < s.size() && a[k] + k < j) {
a[i + k] += a[k];
k++;
}
i += k;
j = 0;
}
return;
}
int main() {
int n;
cin >> n;
string s;
cin >> s;
int ans = 0;
rep(i, s.size()) {
string t = s.substr(i, s.size() - i);
vint a(t.size());
Zalgorithm(t, a);
rep(i, t.size()) { ans = max(min(i, a[i]), ans); }
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pint;
typedef pair<llint, llint> pllint;
typedef vector<int> vint;
typedef vector<llint> vllint;
typedef vector<pint> vpint;
typedef vector<string> vstring;
typedef vector<pair<llint, llint>> vpllint;
typedef vector<vector<int>> vvint;
typedef vector<vector<llint>> vvllint;
typedef vector<vector<pint>> vvpint;
typedef vector<bool> vbool;
typedef vector<vbool> vvbool;
typedef vector<vpllint> vvpllint;
#define rep(i, n) for (int i = 0; i < n; i++)
#define drep(i, n) for (int i = n - 1; 0 <= i; i--)
#define yes(ans) \
if (ans) \
cout << "yes" << endl; \
else \
cout << "no" << endl;
#define Yes(ans) \
if (ans) \
cout << "Yes" << endl; \
else \
cout << "No" << endl;
#define YES(ans) \
if (ans) \
cout << "YES" << endl; \
else \
cout << "NO" << endl;
#define POSSIBLE(ans) \
if (ans) \
cout << "POSSIBLE" << endl; \
else \
cout << "IMPOSSIBLE" << endl;
#define Pi 3.1415926535897932384626
#define mod llint(1e9 + 7)
#define Inf 2147483647
#define llInf 9223372036854775807
#define all(x) x.begin(), x.end()
#define pb push_back
#define isin(n, i) 0 <= i &&i < n
class UnionFind {
public:
// 親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
// 作るときはParentの値を全て-1にする
// こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
// 自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; // 親をとってきたい
}
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
// すでにくっついてるからくっ付けない
return false;
}
// 大きい方(A)に小さいほう(B)をくっ付けたい
// 大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
// セグ木・0-indexed・非再帰・(大きさ・単位元・関数)で初期化
template <typename T> struct SegTree {
// 比較関数の型
using F = function<T(T, T)>;
// 二分木を配列で表したもの
vector<T> seg;
// 木の半分の大きさ
int siz;
// 単位元
const T unit;
// 比較する関数
const F f;
// 大きさn、unit(単位元)、f(モノイド)でsegtreeを初期化する
SegTree(int n, const T unit, const F f) : unit(unit), f(f) {
siz = 1;
while (siz < n)
siz <<= 1;
seg.assign(siz * 2 - 1, unit);
siz--;
}
// k番目にtを入力
void set(int k, const T &t) { seg[k + siz] = t; }
// fによって木を構築する
void build() {
for (int i = siz - 1; 0 <= i; i--) {
seg[i] = f(seg[i * 2 + 1], seg[i * 2 + 2]);
}
}
T operator[](const int i) { return seg[i + siz]; }
// k番目をxに更新する
void update(int k, T x) {
k += siz;
seg[k] = x;
while (0 < k) {
k = (k - 1) >> 1;
seg[k] = f(seg[k * 2 + 1], seg[k * 2 + 2]);
}
}
//[a,b)について、fした結果を返す
// 半開区域のためa以上b未満の位置を指す
T query(int a, int b) {
T l = unit, r = unit;
for (a += siz, b += siz; a < b; a >>= 1, b >>= 1) {
if (!(a & 1))
l = f(seg[a++], l);
if (!(b & 1))
r = f(seg[--b], r);
}
return f(l, r);
}
};
// aとbの最大公約数を求めるよ
long long GCD(long long a, long long b) {
if (b == 0)
return a;
else
return GCD(b, a % b);
}
// 返り値: a と b の最大公約数
// ax + by = gcd(a, b) を満たす (x, y) が格納される
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
// mod. m での a の逆元 a^{-1} を計算する
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// nCrをmで割った余りを求める
llint nCr(llint n, llint r, llint m) {
llint ans = 1;
for (llint i = 0; i < r; i++) {
ans *= n - i;
ans %= m;
}
for (llint i = 1; i <= r; i++) {
ans *= modinv(i, m);
ans %= m;
}
return ans;
}
// aのb乗をmで割った余りを求める
llint power(llint a, llint b, llint m) {
if (b == 1)
return a;
if (b == 0)
return 1;
llint tmp = power(a, (llint)b / 2, m);
tmp *= tmp;
tmp %= m;
if (b % 2 == 1) {
tmp *= a;
tmp %= m;
}
return tmp;
}
// bitを表すsub,要素数を表すlength
bool next_combination(llint &sub, int length) {
llint x = sub & -sub, y = sub + x;
sub = (((sub & ~y) / x) >> 1) | y;
return sub < (llint)(1 << (llint)length);
}
void Zalgorithm(string &s, vint &a) {
a[0] = s.size();
int i = 1, j = 0;
while (i < s.size()) {
while (i + j < s.size() && s[j] == s[i + j])
j++;
a[i] = j;
if (j == 0) {
i++;
continue;
}
int k = 1;
while (i + k < s.size() && a[k] + k < j) {
a[i + k] += a[k];
k++;
}
i += k;
j -= k;
}
return;
}
int main() {
int n;
cin >> n;
string s;
cin >> s;
int ans = 0;
rep(i, s.size()) {
string t = s.substr(i, s.size() - i);
vint a(t.size());
Zalgorithm(t, a);
rep(i, t.size()) { ans = max(min(i, a[i]), ans); }
}
cout << ans << endl;
return 0;
} | replace | 256 | 257 | 256 | 257 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BRUTEFORCE WITH A LOT OF LOOPS)
#pragma GCC optimize("unroll-loops")
#define DEBUG(x) cout << ">> " << #x << ": " << x << endl;
#define _ \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const int MOD = 1000000007;
typedef long long ll;
typedef long double ld;
int main() {
_ int n;
cin >> n;
string s;
cin >> s;
int maxx = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (n - j <= maxx)
break;
if (s[i] == s[j] && s[i + maxx] == s[j + maxx]) {
int local = 1, len = j - i - 1;
int l = i + 1, r = j + 1;
while (s[l] == s[r] && len-- > 0) {
l++;
r++;
local++;
}
maxx = max(maxx, local);
}
}
}
cout << maxx << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//(UNCOMMENT WHEN HAVING LOTS OF RECURSIONS)
#pragma comment(linker, "/stack:200000000")
//(UNCOMMENT WHEN TRYING TO BRUTEFORCE WITH A LOT OF LOOPS)
#pragma GCC optimize("unroll-loops")
#define DEBUG(x) cout << ">> " << #x << ": " << x << endl;
#define _ \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const int MOD = 1000000007;
typedef long long ll;
typedef long double ld;
int main() {
_ int n;
cin >> n;
string s;
cin >> s;
int maxx = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
if (n - j <= maxx)
break;
if (s[i] == s[j] && s[i + maxx] == s[j + maxx]) {
int local = 1, len = j - i - 1;
if (len + 1 <= maxx)
continue;
if (maxx != 0) {
if (s[i + maxx - 1] != s[j + maxx - 1])
continue;
}
int l = i + 1, r = j + 1;
while (s[l] == s[r] && len-- > 0) {
l++;
r++;
local++;
}
maxx = max(maxx, local);
}
}
}
cout << maxx << endl;
return 0;
} | insert | 37 | 37 | 37 | 43 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <type_traits>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using grid = vector<vector<char>>;
/*
メモ書き
cout << setw(5) << setfill('0') << 〇〇 << endl;
は5つ右寄せで0埋め出力
*/
constexpr ll MOD = 1000000007; // 良く出てくるMOD
constexpr ll INF = 1050000000; // intで使うでかい数
constexpr ll LONGINF = 1050000000000000000; // longlongで使うでかい数
struct all_init {
// 初期化のためだけの構造体
// コンストラクタが呼ばれ、cin,cout高速化がされる
// ついでに少数も出力できるようにしている
all_init() {
cout.tie(nullptr);
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
};
} ALL_INIT;
struct edge {
// 辺の重みを管理できるような構造体
// フローで使う容量を意味するcapaも追加
// コンストラクタによって簡単に値を入れられるようにしている
// operatorは辺の重みでソート出来るようにしている(主に最小全域木用)
int from, to;
ll cost;
ll capa;
edge(int s, int d) : from(s), to(d) {
cost = 0;
capa = 0;
}
edge(int s, int d, ll w) : from(s), to(d), cost(w) { capa = 0; }
edge(int s, int d, ll x, ll y) : from(s), to(d), cost(x), capa(y) {}
bool operator<(const edge &x) const { return cost < x.cost; }
};
using graph = vector<vector<edge>>;
#define CIN(vector_array_etc, n) \
for (int loop = 0; loop < n; loop++) { \
cin >> vector_array_etc[loop]; \
}
#define COUT(vector_array_etc, n) \
for (int LOOP = 0; LOOP < n; LOOP++) { \
cout << vector_array_etc[LOOP] << (LOOP == n - 1 ? '\n' : ' '); \
}
#define VC(Type_name) vector<Type_name> // 1次元ならあまり意味ないかも
#define SORT(vector_etc) sort(vector_etc.begin(), vector_etc.end())
#define ALL(vec_etc) vec_etc.begin(), vec_etc.end()
#define VCVC(Type_name) vector<vector<Type_name>> // 2次元配列定義怠過ぎ問題
#define WARSHALL vector<vector<ll>> g(n, vector<ll>(n, LONGINF))
#define endl '\n'
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl
#define no cout << "no" << endl
#define Tof(x) x ? Yes : No
#define TOF(x) x ? YES : NO
#define tof(x) x ? yes : no
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
} // aに最大値が入る
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
} // aに最小値が入る
template <typename T> istream &operator>>(istream &is, vector<T> &Vec) {
for (T &x : Vec) {
is >> x;
}
return is;
}
template <typename V, typename H> void resize(vector<V> &vec, const H head) {
vec.resize(head);
}
template <typename V, typename H, typename... T>
void resize(vector<V> &vec, const H &head, const T... tail) {
vec.resize(head);
for (auto &v : vec) {
resize(v, tail...);
}
}
template <ll mod> struct ModInt {
// けんちょんさん作modをとる整数
// 名前だけ変えた
// これがないと二項係数が動かないので注意
// 普通に計算するとmodがとれる
long long val;
constexpr ModInt(long long v = 0) noexcept : val(v % mod) {
if (val < 0)
v += mod;
}
constexpr int getmod() { return mod; }
constexpr ModInt operator-() const noexcept { return val ? mod - val : 0; }
constexpr ModInt operator+(const ModInt &r) const noexcept {
return ModInt(*this) += r;
}
constexpr ModInt operator-(const ModInt &r) const noexcept {
return ModInt(*this) -= r;
}
constexpr ModInt operator*(const ModInt &r) const noexcept {
return ModInt(*this) *= r;
}
constexpr ModInt operator/(const ModInt &r) const noexcept {
return ModInt(*this) /= r;
}
constexpr ModInt &operator+=(const ModInt &r) noexcept {
val += r.val;
if (val >= mod)
val -= mod;
return *this;
}
constexpr ModInt &operator-=(const ModInt &r) noexcept {
val -= r.val;
if (val < 0)
val += mod;
return *this;
}
constexpr ModInt &operator*=(const ModInt &r) noexcept {
val = val * r.val % mod;
return *this;
}
constexpr ModInt &operator/=(const ModInt &r) noexcept {
long long a = r.val, b = mod, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % mod;
if (val < 0)
val += mod;
return *this;
}
constexpr bool operator==(const ModInt &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const ModInt &r) const noexcept {
return this->val != r.val;
}
friend ostream &operator<<(ostream &os, const ModInt<mod> &x) noexcept {
return os << x.val;
}
friend istream &operator>>(istream &is, ModInt<mod> &x) noexcept {
return is >> x.val;
}
friend constexpr ModInt<mod> modpow(const ModInt<mod> &a,
long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
template <class T> struct nCk {
// けんちょんさん作二項係数ライブラリ
// 名前だけ変えた
// nCk<ModInt<MOD>> c(200000);
// ↑のような感じで初期化
vector<T> fact_, inv_, finv_;
constexpr nCk() {}
constexpr nCk(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
init(n);
}
constexpr void init(int n) noexcept {
fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
int MOD = fact_[0].getmod();
for (int i = 2; i < n; i++) {
fact_[i] = fact_[i - 1] * i;
inv_[i] = -inv_[MOD % i] * (MOD / i);
finv_[i] = finv_[i - 1] * inv_[i];
}
}
constexpr T com(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return fact_[n] * finv_[k] * finv_[n - k];
}
constexpr T fact(int n) const noexcept {
if (n < 0)
return 0;
return fact_[n];
}
constexpr T inv(int n) const noexcept {
if (n < 0)
return 0;
return inv_[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0)
return 0;
return finv_[n];
}
};
int dx[] = {0, 1, -1, 0, 1, -1, 1, -1}; // i<4:4way i<8:8way
int dy[] = {1, 0, 0, -1, 1, -1, -1, 1};
ll PowMod(ll n, ll k, ll mod) {
// 繰り返し2乗法
// n^kをmodで求める
ll r = 1;
for (; k > 0; k >>= 1) {
if (k & 1) {
r = (r * n) % mod;
}
n = (n * n) % mod;
}
return r;
}
ll Gcd(ll a, ll b) { // 最大公約数
return b != 0 ? Gcd(b, a % b) : a;
}
ll Lcm(ll a, ll b) { // 最小公倍数
return a / Gcd(a, b) * b;
}
vector<string> Split(string s, string t) {
// 文字列を文字列で分割する
vector<string> v;
int p = s.find(t);
if (p != s.npos) {
v.push_back(s.substr(0, p));
s = s.substr(p + t.size());
}
v.push_back(s);
return v;
}
vector<int> Lis(const vector<int> &a) {
// #define Index_of(as, x) distance(as.begin(), lower_bound(as.begin(),
// as.end(), x))
#define Index_of(as, x) \
distance(as.begin(), upper_bound(as.begin(), as.end(), x))
// upper_boundを使用すると、重複を許した最長増加部分列になる
//-1倍した値を入れれば、最長減少部分列になる
const int n = a.size();
vector<int> A(n, INF);
vector<int> id(n);
for (int i = 0; i < n; ++i) {
id[i] = Index_of(A, a[i]);
A[id[i]] = a[i];
}
int m = *max_element(id.begin(), id.end());
vector<int> b(m + 1);
for (int i = n - 1; i >= 0; --i)
if (id[i] == m)
b[m--] = a[i];
return b; // 最長部分列のどれか1つ
}
string ReplaceString(string s, string target, string replacestring) {
// 1: 置き換え対象
// 2: 検索対象
// 3: 置き換える内容
string::size_type Pos(s.find(target));
while (Pos != string::npos) {
s.replace(Pos, target.length(), replacestring);
Pos = s.find(target, Pos + replacestring.length());
}
return s;
}
string LcsAlphabeticalMinOrder(string a, string b) {
if (a.size() < b.size()) {
swap(a, b);
}
int n = a.size(), m = b.size();
vector<string> dp(m + 1);
for (int i = 0; i < n; i++) {
vector<string> to(m + 1);
for (int j = 0; j < m; j++) {
if (a[i] == b[j]) {
to[j + 1] = dp[j] + a[i];
} else {
if (to[j].size() > dp[j + 1].size()) {
to[j + 1] = to[j];
} else if (to[j].size() < dp[j + 1].size()) {
to[j + 1] = dp[j + 1];
} else if (to[j] < dp[j + 1]) {
to[j + 1] = to[j];
} else {
to[j + 1] = dp[j + 1];
}
}
}
dp.swap(to);
}
return dp[m];
}
string Lcs(const string &s, const string &t) {
int dp[3001][3001];
int n = s.size();
int m = t.size();
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (s[i - 1] == t[j - 1]) {
dp[i][j] = dp[i - 1][j - 1] + 1;
} else {
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
}
}
}
string ans = "";
int i = s.size(), j = t.size();
while (i > 0 && j > 0) {
if (s[i - 1] == t[j - 1]) {
ans += s[i - 1];
i--;
j--;
} else if (dp[i - 1][j] >= dp[i][j - 1])
i--;
else
j--;
}
reverse(ans.begin(), ans.end());
return ans;
}
vector<int> LcsInteger(const vector<int> &a, const vector<int> &b) {
#define index_of(as, x) \
distance(as.begin(), lower_bound(as.begin(), as.end(), x))
struct node {
int value;
node *next;
node(int value, node *next) : value(value), next(next) {}
};
const int n = a.size(), m = b.size();
map<int, vector<int>> M;
for (int j = m - 1; j >= 0; --j)
M[b[j]].push_back(j);
vector<int> xs(n + 1, INF);
xs[0] = -INF;
vector<node *> link(n + 1);
for (int i = 0; i < n; ++i) {
if (M.count(a[i])) {
vector<int> ys = M[a[i]];
for (int j = 0; j < (int)ys.size(); ++j) {
int k = index_of(xs, ys[j]);
xs[k] = ys[j];
link[k] = new node(b[ys[j]], link[k - 1]);
}
}
}
vector<int> c;
int l = index_of(xs, INF - 1) - 1;
for (node *p = link[l]; p; p = p->next)
c.push_back(p->value);
reverse(c.begin(), c.end());
return c;
}
bool IsPrime(ll n) {
// 素数かどうかを判定
// true 素数
if (n < 2)
return false;
for (ll i = 2; i * i <= n; i++)
if (!(n % i))
return false;
return true;
}
vector<bool> Eratosthenes(int n) {
// エラトステネスの篩
// 返り値はbool
// return res;として、返り値の型をvector<int>とすれば、
// 素数だけを取り出せる
vector<int> res;
vector<bool> Prime(n + 1, true);
Prime[0] = Prime[1] = false;
for (int i = 2; i * i <= n; i++) {
if (Prime[i]) {
for (int j = 2; i * j <= n; j++) {
Prime[i * j] = false;
}
}
}
for (int i = 2; i <= n; i++) {
if (Prime[i]) {
res.emplace_back(i);
}
}
return Prime;
}
ll MergeCount(vector<int> &a) {
// 反転数を数える
ll count = 0;
int n = a.size();
if (n > 1) {
vector<int> b(a.begin(), a.begin() + n / 2);
vector<int> c(a.begin() + n / 2, a.end());
count += MergeCount(b);
count += MergeCount(c);
for (int i = 0, j = 0, k = 0; i < n; ++i)
if (k == c.size())
a[i] = b[j++];
else if (j == b.size())
a[i] = c[k++];
else if (b[j] <= c[k])
a[i] = b[j++];
else {
a[i] = c[k++];
count += n / 2 - j;
}
}
return count;
}
bool WarshallFloyd(vector<vector<ll>> &c) {
// ワーシャルフロイド法
// 全ての頂点間の最短距離を求める
// falseの時、負の閉路検出
int V = c.size();
for (int i = 0; i < V; i++) {
c[i][i] = 0;
}
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
for (int k = 0; k < V; k++) {
if (c[j][k] > c[j][i] + c[i][k]) {
c[j][k] = c[j][i] + c[i][k];
}
}
}
}
for (int i = 0; i < V; i++) {
if (c[i][i] < 0) {
return false;
}
}
return true;
}
vector<ll> Dijkstra(int i, vector<vector<edge>> graph) {
// i:始点
// graph:重み付きグラフ
int n = graph.size();
vector<ll> d(n, LONGINF);
d[i] = 0;
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>
q;
q.push(make_pair(0, i)); // 第一引数:コスト 第二引数:頂点
while (!q.empty()) {
pair<ll, int> p = q.top();
q.pop();
int v = p.second;
if (d[v] < p.first) {
continue;
}
for (auto x : graph[v]) {
if (d[x.to] > d[v] + x.cost) {
d[x.to] = d[v] + x.cost;
q.push(make_pair(d[x.to], x.to));
}
}
}
return d;
}
bool BellmanFord(int start, int V, int E, vector<edge> Edge, vector<ll> &d) {
// 第一引数:start 始点
// 第二引数:V 頂点数
// 第三引数:E 辺の数
// 第四引数:Edge 辺の重み付きのグラフ
// 第五引数:d 各頂点への距離を入れる配列(答えが入る)
// 負の閉路検出でfalseが返り値
resize(d, V);
fill(d.begin(), d.end(), LONGINF);
d[start] = 0;
vector<bool> t(V, false);
for (int i = 0; i < V - 1; i++) {
for (int j = 0; j < E; j++) {
edge e = Edge[j];
if (d[e.from] == LONGINF) {
continue;
}
if (d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
}
}
}
for (int i = 0; i < V; i++) {
for (int j = 0; j < E; j++) {
edge e = Edge[j];
if (d[e.from] == LONGINF) {
continue;
}
if (d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
t[e.to] = true;
/*
if (i == V - 1) {//どこかに閉路があることを感知する
return false;
}
*/
}
if (t[e.from]) {
t[e.to] = true;
}
}
}
if (t[V - 1]) {
// V-1は頂点番号n-1で、始点からn-1までに負の閉路を検出したい場合には、
// コメントアウトを解除すること。
return false;
}
return true;
}
bool TopologicalSort(const vector<vector<edge>> &g, vector<int> &ans) {
// トポロジカルソート
// trueが帰る時、トポロジカルソートが成功し、その結果がansに渡される
// falseはトポロジカルソートの失敗
int n = g.size(), k = 0;
vector<int> ord(n), in(n);
for (auto &es : g) {
for (auto &e : es) {
in[e.to]++;
}
}
queue<int> q;
for (int i = 0; i < n; ++i) {
if (in[i] == 0)
q.push(i);
}
while (!q.empty()) {
int v = q.front();
q.pop();
ord[k++] = v;
for (auto &e : g[v]) {
if (--in[e.to] == 0)
q.push(e.to);
}
}
ans = ord;
if (*max_element(in.begin(), in.end()) == 0) {
return true;
}
return false;
}
vector<int> ArticulationNode(const vector<vector<edge>> &g) {
// グラフの関節点を列挙する
// 最後の2行で、erace
// uniqueをしない場合は、その分割によって何個のグラフに分かれるかを判定できる(要チェック)。
int n = g.size(), idx;
vector<int> low(n), ord(n), art;
function<void(int)> DFS = [&](int v) {
low[v] = ord[v] = ++idx;
for (auto &e : g[v]) {
int w = e.to;
if (ord[w] == 0) {
DFS(w);
low[v] = min(low[v], low[w]);
if ((ord[v] == 1 && ord[w] != 2) || (ord[v] != 1 && low[w] >= ord[v])) {
art.push_back(v);
}
} else {
low[v] = min(low[v], ord[w]);
}
}
};
for (int u = 0; u < n; u++) {
if (ord[u] == 0) {
idx = 0;
DFS(u);
}
}
sort(art.begin(), art.end()); // 与えられた関節点をソート
art.erase(unique(art.begin(), art.end()),
art.end()); // 同じ関節点が複数存在することがある,
return art;
}
vector<vector<edge>> ToRootTree(const vector<vector<edge>> &g, int r) {
// 根付き木へ変換する。
// 動作未確認。
int n = g.size();
vector<vector<edge>> G(n);
vector<int> ord(n, -1);
queue<int> q;
q.push(r);
int k = 0;
while (q.size()) {
int u = q.front();
q.pop();
for (auto &e : g[u]) {
int v = e.to;
if (ord[v] == -1) {
ord[v] = k;
k++;
q.push(v);
G[u].emplace_back(e);
}
}
}
return G;
}
edge TreeDiameter(const vector<vector<edge>> &g) {
// 重み付きグラフ(木)を受け取り、その木の直径を求める
// 返り値はfrom,to,costを持った構造体
int start = 0; // どの始点から始めても良いので、0から始める
static const auto bfs = [](const vector<vector<edge>> &g, int s,
queue<int> &q, vector<ll> &dist) {
while (!q.empty()) {
q.pop();
}
q.push(s);
int n = g.size();
dist.assign(n, LONGINF);
dist[s] = 0;
while (q.size()) {
int u = q.front();
q.pop();
for (auto &e : g[u]) {
int v = e.to;
if (dist[v] == LONGINF) {
dist[v] = dist[u] + e.cost;
q.push(v);
}
}
}
return dist;
};
vector<ll> dist;
queue<int> q;
bfs(g, start, q, dist);
int n = g.size(), u = -1, v = -1;
for (int i = 0; i < n; i++)
if (dist[i] != LONGINF && (u == -1 || dist[i] > dist[u]))
u = i;
bfs(g, u, q, dist);
for (int i = 0; i < n; i++)
if (dist[i] != LONGINF && (v == -1 || dist[i] > dist[v]))
v = i;
ll d = dist[v];
if (u > v)
swap(u, v); // 念のため辞書順
return edge(u, v, d);
}
void add_edge(vector<vector<edge>> &g, int a, int b, ll cost, ll cap) {
// graph(vector<vector<edge>>)に対して無向辺として辺を貼る関数
// graph以外には当然使えないので注意
g[a].emplace_back(a, b, cost, cap);
g[b].emplace_back(b, a, cost, cap);
}
pair<vector<int>, vector<edge>> bridge(const vector<vector<edge>> &g) {
// グラフの橋となる辺を列挙する
// 戻り値のfirst:二重辺連結成分分解の番号となる
// 戻り値のsecond:橋となる辺を列挙したもの
const int n = g.size();
int idx = 0, s = 0, t = 0, k = 0;
vector<int> ord(n, -1), onS(n), stk(n), roots(n), cmp(n);
vector<edge> brdg;
function<void(int, int)> dfs = [&](int v, int u) {
ord[v] = idx++;
stk[s++] = v;
onS[v] = true;
roots[t++] = v;
for (auto &e : g[v]) {
int w = e.to;
if (ord[w] == -1) {
dfs(w, v);
} else if (u != w && onS[w]) {
while (ord[roots[t - 1]] > ord[w]) {
--t;
}
}
}
if (v == roots[t - 1]) {
brdg.emplace_back(u, v, 0);
while (1) {
int w = stk[--s];
onS[w] = false;
cmp[w] = k;
if (v == w)
break;
}
--t;
++k;
}
};
for (int u = 0; u < n; u++) {
if (ord[u] == -1) {
dfs(u, n);
brdg.pop_back();
}
}
return make_pair(cmp, brdg);
}
class UnionFind {
// satanicさん作 UnionFind
// 追加機能:forest_num
// forestは、全体に含まれる木の数を表す
private:
std::vector<int> parent;
std::vector<int> height;
std::vector<int> m_size;
int forest_num;
public:
UnionFind(int size_) : parent(size_), height(size_, 0), m_size(size_, 1) {
forest_num = size_;
for (int i = 0; i < size_; ++i)
parent[i] = i;
}
void init(int size_) {
parent.resize(size_);
height.resize(size_, 0);
m_size.resize(size_, 1);
forest_num = size_;
for (int i = 0; i < size_; ++i)
parent[i] = i;
}
int find(int x) {
if (parent[x] == x)
return x;
return parent[x] = find(parent[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
int t = size(x) + size(y);
m_size[x] = m_size[y] = t;
if (height[x] < height[y])
parent[x] = y;
else
parent[y] = x;
if (height[x] == height[y])
++height[x];
forest_num--;
}
bool same(int x, int y) { return find(x) == find(y); }
int size(int x) {
if (parent[x] == x)
return m_size[x];
return size(parent[x] = find(parent[x]));
}
int forest() { return forest_num; }
};
class Dinic {
// 最大流を求める
#define FLOW int
private:
int n, s, t;
vector<int> level, prog, que;
vector<vector<FLOW>> cap, flow;
vector<vector<int>> g;
FLOW inf;
public:
Dinic(const vector<vector<edge>> &graph)
: n(graph.size()), cap(n, vector<FLOW>(n)), flow(n, vector<FLOW>(n)),
g(n, vector<int>()), inf(INF) {
for (int i = 0; i < n; i++) {
for (auto &e : graph[i]) {
int u = e.from, v = e.to;
ll c = e.capa;
cap[u][v] += c;
cap[v][u] += c;
flow[v][u] += c;
g[u].push_back(v);
g[v].push_back(u);
}
}
}
inline FLOW residue(int u, int v) { return cap[u][v] - flow[u][v]; }
FLOW solve(int s_, int t_) {
this->t = t_, this->s = s_;
que.resize(n + 1);
FLOW res = 0;
while (levelize()) {
prog.assign(n, 0);
res += augment(s, inf);
}
return res;
}
bool levelize() {
int l = 0, r = 0;
level.assign(n, -1);
level[s] = 0;
que[r++] = s;
while (l != r) {
int v = que[l++];
if (v == t)
break;
for (const int &d : g[v])
if (level[d] == -1 && residue(v, d) != 0) {
level[d] = level[v] + 1;
que[r++] = d;
}
}
return level[t] != -1;
}
FLOW augment(int v, FLOW lim) {
FLOW res = 0;
if (v == t)
return lim;
for (int &i = prog[v]; i < (int)g[v].size(); i++) {
const int &d = g[v][i];
if (residue(v, d) == 0 || level[v] >= level[d])
continue;
const FLOW aug = augment(d, min(lim, residue(v, d)));
flow[v][d] += aug;
flow[d][v] -= aug;
res += aug;
lim -= aug;
if (lim == 0)
break;
}
return res;
}
};
class MinimumCostFlow {
private:
using Flow = ll;
using Cost = ll;
struct Edge {
int d;
Flow c, f;
Cost w;
int r, is_r;
Edge(int d_, Flow c_, Flow f_, Cost w_, int r_, bool is_r_)
: d(d_), c(c_), f(f_), w(w_), r(r_), is_r(is_r_) {}
};
int n;
vector<vector<Edge>> g;
public:
MinimumCostFlow(int n_) : n(n_), g(vector<vector<Edge>>(n_)) {}
void add_edge(int src, int dst, Flow cap, Cost cost) { // 有向辺
int rsrc = g[dst].size();
int rdst = g[src].size();
g[src].emplace_back(dst, cap, 0, cost, rsrc, false);
g[dst].emplace_back(src, cap, cap, -cost, rdst, true);
}
Cost solve(int s, int t, Flow f) {
Cost res = 0;
vector<Cost> h(n + 10), dist(n);
vector<int> prevv(n + 10), preve(n + 10);
using pcv = pair<Cost, int>;
priority_queue<pcv, vector<pcv>, greater<pcv>> q;
fill(h.begin(), h.end(), 0);
while (f > 0) {
fill(dist.begin(), dist.end(), LONGINF);
dist[s] = 0;
q.emplace(0, s);
while (q.size()) {
Cost cd;
int v;
tie(cd, v) = q.top();
q.pop();
if (dist[v] < cd)
continue;
for (int i = 0; i < (int)(g[v].size()); ++i) {
Edge &e = g[v][i];
if (residue(e) == 0)
continue;
if (dist[e.d] + h[e.d] > cd + h[v] + e.w) {
dist[e.d] = dist[v] + e.w + h[v] - h[e.d];
prevv[e.d] = v;
preve[e.d] = i;
q.emplace(dist[e.d], e.d);
}
}
}
if (dist[t] == LONGINF)
return -1; // 経路が見つからなかった
// s-t 間を最短路に沿って目一杯流す
for (int i = 0; i < n; ++i)
h[i] += dist[i];
Flow d = f;
for (int v = t; v != s; v = prevv[v]) {
chmin(d, residue(g[prevv[v]][preve[v]]));
}
f -= d;
res += d * h[t];
for (int v = t; v != s; v = prevv[v]) {
Edge &e = g[prevv[v]][preve[v]];
e.f += d;
g[v][e.r].f -= d;
}
}
return res;
}
Flow residue(const Edge &e) { return e.c - e.f; }
// 流量を表示
void show() {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < (int)(g[i].size()); ++j) {
Edge &e = g[i][j];
if (e.is_r)
continue;
cout << i << "->" << e.d << "(flow:" << e.f << ")" << endl;
}
}
}
};
class BipartiteMatching {
private:
int V;
vector<int> match;
vector<bool> used;
vector<vector<int>> g;
vector<pair<int, int>> match_pair;
bool dfs(int v) {
used[v] = true;
for (int i = 0; i < (int)g[v].size(); i++) {
int u = g[v][i];
int w = match[u];
if (w < 0 || !used[w] && dfs(w)) {
match[v] = u;
match[u] = v;
match_pair.emplace_back(make_pair(u, v));
return true;
}
}
return false;
}
public:
BipartiteMatching(int n) {
V = n;
resize(match, n);
resize(used, n);
resize(g, n);
}
void add_edge(int u, int v) {
g[u].emplace_back(v);
g[v].emplace_back(u);
}
int MatchingSolve() {
int res = 0;
fill(match.begin(), match.end(), -1);
for (int v = 0; v < V; v++) {
if (match[v] < 0) {
fill(used.begin(), used.end(), false);
if (dfs(v)) {
res++;
}
}
}
return res;
}
vector<pair<int, int>> get_pair() {
for (auto x : match_pair) {
cout << x.first << " " << x.second << endl;
}
return match_pair;
}
};
class Lca {
private:
int n;
int log2_n;
vector<vector<int>> parent;
vector<int> depth;
void dfs(const vector<vector<edge>> &g, int v, int p, int d) {
parent[0][v] = p;
depth[v] = d;
for (auto &e : g[v]) {
if (e.to != p) {
dfs(g, e.to, v, d + 1);
}
}
}
public:
Lca(const vector<vector<edge>> &g, int root) {
n = g.size();
log2_n = (int)log2(n) + 1;
resize(parent, log2_n, n);
resize(depth, n);
dfs(g, root, -1, 0);
for (int k = 0; k + 1 < log2_n; k++) {
for (int v = 0; v < (int)g.size(); v++) {
if (parent[k][v] < 0) {
parent[k + 1][v] = -1;
} else {
parent[k + 1][v] = parent[k][parent[k][v]];
}
}
}
}
int get_lca(int u, int v) {
if (depth[u] > depth[v]) {
swap(u, v);
} // u≦v
for (int k = 0; k < log2_n; k++) {
if ((depth[v] - depth[u]) >> k & 1) {
v = parent[k][v];
}
}
if (u == v) {
return u;
}
for (int k = log2_n - 1; k >= 0; k--) {
if (parent[k][u] != parent[k][v]) {
u = parent[k][u];
v = parent[k][v];
}
}
return parent[0][u];
}
int get_depth(int v) { return depth[v]; }
};
class DAG {
// 有向グラフをゴニョゴニョするクラス
// 機能:longest_path 有向パスの最長経路(含まれる辺の数)を求める
private:
int n;
vector<vector<edge>> g;
vector<int> visited;
vector<int> dp;
vector<int> topological;
int dfs(int s) {
if ((int)g[s].size() == 0) {
return 1;
}
if (dp[s] > 0) {
return dp[s];
}
int mx = 1;
for (auto j : g[s]) {
if (visited[j.to] == 0) {
visited[j.to] = 1;
int l = 0;
l = dfs(j.to);
chmax(mx, l);
} else {
chmax(mx, dp[j.to]);
}
}
return dp[s] = mx + 1;
}
public:
DAG(const vector<vector<edge>> &f) {
g = f;
n = f.size();
resize(visited, n + 1);
fill(visited.begin(), visited.end(), 0);
resize(dp, n + 1);
fill(dp.begin(), dp.end(), -1);
resize(topological, n);
}
DAG(int x) {
n = x;
resize(g, n);
resize(visited, n + 1);
fill(visited.begin(), visited.end(), 0);
resize(dp, n + 1);
fill(dp.begin(), dp.end(), -1);
}
void add_edge(int a, int b) { g[a].emplace_back(a, b); }
void add_edge(int a, int b, ll c) { g[a].emplace_back(a, b, c); }
void add_edge(int a, int b, ll c, ll d) { g[a].emplace_back(a, b, c, d); }
int longest_path() {
int mx = -1;
for (int i = 0; i < n; i++) {
int h = 0;
if (visited[i] == 0) {
h = dfs(i);
chmax(mx, h);
}
}
return mx - 1;
}
bool TopologicalSort() {
// trueが帰る時、トポロジカルソートが成功
// falseはトポロジカルソートの失敗
int k = 0;
vector<int> ord(n), in(n);
for (auto &es : g) {
for (auto &e : es) {
in[e.to]++;
}
}
queue<int> q;
for (int i = 0; i < n; ++i) {
if (in[i] == 0)
q.push(i);
}
while (!q.empty()) {
int v = q.front();
q.pop();
ord[k++] = v;
for (auto &e : g[v]) {
if (--in[e.to] == 0) {
q.push(e.to);
}
}
}
topological = ord;
if (*max_element(in.begin(), in.end()) == 0) {
return true;
}
return false;
}
};
class RangeMinimumUpdateQuerySegmentTree {
// 区間最小値を求めることが出来るセグメント木
// query:指定した半開区間においての最小値を求める
// update:指定した半開区間の値を変更する
// RangeUpdateQueryも兼ねることが出来る(1つの要素の最小値はその要素のみ)
private:
int n;
ll inf = (1LL << 31) - 1; // 2^31-1
vector<ll> dat, lazy;
void eval(int len, int k) {
if (lazy[k] == inf)
return;
if (k * 2 + 1 < n * 2 - 1) {
lazy[2 * k + 1] = lazy[k];
lazy[2 * k + 2] = lazy[k];
}
dat[k] = lazy[k];
lazy[k] = inf;
}
public:
RangeMinimumUpdateQuerySegmentTree() {}
RangeMinimumUpdateQuerySegmentTree(int n_) {
n = 1;
while (n < n_)
n *= 2;
dat.assign(n * 2, inf);
lazy.assign(n * 2, inf);
}
// [a, b)
ll update(int a, int b, ll x, int k, int l, int r) {
eval(r - l, k);
if (b <= l || r <= a)
return dat[k];
if (a <= l && r <= b) {
lazy[k] = x;
return lazy[k];
}
return dat[k] = min(update(a, b, x, 2 * k + 1, l, (l + r) / 2),
update(a, b, x, 2 * k + 2, (l + r) / 2, r));
}
ll update(int a, int b, ll x) { return update(a, b, x, 0, 0, n); }
// [a, b)
ll query(int a, int b, int k, int l, int r) {
eval(r - l, k);
if (b <= l || r <= a)
return inf;
if (a <= l && r <= b)
return dat[k];
ll vl = query(a, b, 2 * k + 1, l, (l + r) / 2);
ll vr = query(a, b, 2 * k + 2, (l + r) / 2, r);
return min(vl, vr);
}
ll query(int a, int b) { return query(a, b, 0, 0, n); }
};
class RangeSumQuerySegmentTree {
// 区間和を求めることが出来るセグメント木
// update:指定した要素に加算
// query:指定した半開区間の合計を返す
// 0-indexed
// 半開区間
private:
struct Node {
Node *left, *right;
ll v;
Node() : left(nullptr), right(nullptr), v(0) {}
};
Node *root;
ll n, n0;
ll query(ll a, ll b, Node *n, ll l, ll r) {
if (a <= l && r <= b) {
return n->v;
}
if (r <= a || b <= l) {
return 0;
}
ll lv = n->left ? query(a, b, n->left, l, (l + r) >> 1) : 0;
ll rv = n->right ? query(a, b, n->right, (l + r) >> 1, r) : 0;
return (lv + rv) % MOD;
}
public:
RangeSumQuerySegmentTree(ll n) : n(n) {
n0 = 1;
while (n0 < n)
n0 <<= 1;
root = new Node();
}
~RangeSumQuerySegmentTree() {
delete root;
root = nullptr;
}
void update(ll k, ll x) {
Node *n = root;
ll l = 0, r = n0;
n->v = (n->v + x) % MOD;
while (r - l > 1) {
ll m = (l + r) >> 1;
if (k < m) {
if (!n->left)
n->left = new Node();
n = n->left;
r = m;
} else {
if (!n->right)
n->right = new Node();
n = n->right;
l = m;
}
n->v = (n->v + x) % MOD;
}
}
ll query(ll a, ll b) { return query(a, b, root, 0, n0); }
ll lquery(ll b) { return query(0, b, root, 0, n0); }
ll rquery(ll a) { return query(a, n0, root, 0, n0); }
};
class KDimensionalTree {
// 2Dの点がある区間内にあるかどうかを判定し、その点を列挙する
// makeKDTreeで前計算
// findが実際に探す部分
public:
struct Node {
int location;
int p, l, r;
Node() {}
};
struct Point {
int id, x, y;
Point() {}
Point(int i, int a, int b) {
id = i;
x = a;
y = b;
}
bool operator<(const Point &p) const { return id < p.id; }
void print() { cout << id << endl; }
};
static const ll NIL = -1;
static bool lessX(const Point &p1, const Point &p2) { return p1.x < p2.x; }
static bool lessY(const Point &p1, const Point &p2) { return p1.y < p2.y; }
int N;
vector<Point> P;
vector<Node> T;
int np;
KDimensionalTree() {}
KDimensionalTree(int N) { init(N); }
void init(int n) {
N = n;
P.clear();
T.clear();
resize(P, N);
resize(T, N);
np = 0;
}
int makeKDTree(int l, int r, int depth) {
if (l >= r) {
return NIL;
}
int mid = (l + r) / 2;
int t = np++;
if (depth & 1) {
sort(P.begin() + l, P.begin() + r, lessY);
} else {
sort(P.begin() + l, P.begin() + r, lessX);
}
T[t].location = mid;
T[t].l = makeKDTree(l, mid, depth + 1);
T[t].r = makeKDTree(mid + 1, r, depth + 1);
return t;
}
void find(int v, int sx, int tx, int sy, int ty, int depth,
vector<Point> &ans) {
int x = P[T[v].location].x;
int y = P[T[v].location].y;
if (sx <= x && x <= tx && sy <= y && y <= ty) {
ans.push_back(P[T[v].location]);
}
if (depth % 2 == 0) {
if (T[v].l != NIL) {
if (sx <= x)
find(T[v].l, sx, tx, sy, ty, depth + 1, ans);
}
if (T[v].r != NIL) {
if (x <= tx)
find(T[v].r, sx, tx, sy, ty, depth + 1, ans);
}
} else {
if (T[v].l != NIL) {
if (sy <= y)
find(T[v].l, sx, tx, sy, ty, depth + 1, ans);
}
if (T[v].r != NIL) {
if (y <= ty)
find(T[v].r, sx, tx, sy, ty, depth + 1, ans);
}
}
}
void add_point(int i, int x, int y) {
P[i].id = i;
P[i].x = x;
P[i].y = y;
T[i].l = T[i].r = T[i].p = NIL;
}
};
class RangeAddQuerySegmentTree {
// 区間に足し算をする機能と、ある要素を参照する機能があるセグメント木
private:
int n;
vector<ll> data;
public:
RangeAddQuerySegmentTree() {}
RangeAddQuerySegmentTree(int N) {
n = N;
resize(data, n + 1);
fill(data.begin(), data.end(), 0);
}
void add(int i, ll x) {
while (i) {
data[i] += x;
i -= (i & -i);
}
}
void add(int i, int j, ll x) {
add(j, x);
add(i - 1, -x);
}
ll get(int i) {
ll res = 0;
while (i <= n) {
res += data[i];
i += (i & -i);
}
return res;
}
};
class RangeSumAddQuerySegmentTree {
// update:ある区間に対して足し算を行う機能
// query:ある区間に対して合計値を求める機能
private:
vector<ll> bit0, bit1;
int n;
ll sum(const vector<ll> &b, int i) {
ll s = 0;
while (i > 0) {
s += b[i];
i -= (i & -i);
}
return s;
}
void add(vector<ll> &b, int i, ll v) {
while (i <= n) {
b[i] += v;
i += (i & -i);
}
}
public:
RangeSumAddQuerySegmentTree() {}
RangeSumAddQuerySegmentTree(int N) {
n = N;
resize(bit0, n + 1);
resize(bit1, n + 1);
fill(bit0.begin(), bit0.end(), 0);
fill(bit1.begin(), bit1.end(), 0);
}
void update(int l, int r, ll x) {
add(bit0, l, -x * (l - 1));
add(bit1, l, x);
add(bit0, r + 1, x * r);
add(bit1, r + 1, -x);
}
ll query(int l, int r) {
ll res = 0;
res += sum(bit0, r) + sum(bit1, r) * r;
res -= sum(bit0, l - 1) + sum(bit1, l - 1) * (l - 1);
return res;
}
};
int main() {
int n;
cin >> n;
string s;
cin >> s;
map<string, int> x;
for (int i = 0; i < n; i++) {
for (int j = i; j < n; j++) {
x[(s.substr(i, j - i + 1))] += 1;
}
}
int mx = 0;
for (auto i = x.begin(); i != x.end(); i++) {
if (i->second > 1 && i->first.size() <= (n >> 1)) {
mx = max(mx, (int)i->first.size());
}
}
cout << mx << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <type_traits>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using grid = vector<vector<char>>;
/*
メモ書き
cout << setw(5) << setfill('0') << 〇〇 << endl;
は5つ右寄せで0埋め出力
*/
constexpr ll MOD = 1000000007; // 良く出てくるMOD
constexpr ll INF = 1050000000; // intで使うでかい数
constexpr ll LONGINF = 1050000000000000000; // longlongで使うでかい数
struct all_init {
// 初期化のためだけの構造体
// コンストラクタが呼ばれ、cin,cout高速化がされる
// ついでに少数も出力できるようにしている
all_init() {
cout.tie(nullptr);
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
};
} ALL_INIT;
struct edge {
// 辺の重みを管理できるような構造体
// フローで使う容量を意味するcapaも追加
// コンストラクタによって簡単に値を入れられるようにしている
// operatorは辺の重みでソート出来るようにしている(主に最小全域木用)
int from, to;
ll cost;
ll capa;
edge(int s, int d) : from(s), to(d) {
cost = 0;
capa = 0;
}
edge(int s, int d, ll w) : from(s), to(d), cost(w) { capa = 0; }
edge(int s, int d, ll x, ll y) : from(s), to(d), cost(x), capa(y) {}
bool operator<(const edge &x) const { return cost < x.cost; }
};
using graph = vector<vector<edge>>;
#define CIN(vector_array_etc, n) \
for (int loop = 0; loop < n; loop++) { \
cin >> vector_array_etc[loop]; \
}
#define COUT(vector_array_etc, n) \
for (int LOOP = 0; LOOP < n; LOOP++) { \
cout << vector_array_etc[LOOP] << (LOOP == n - 1 ? '\n' : ' '); \
}
#define VC(Type_name) vector<Type_name> // 1次元ならあまり意味ないかも
#define SORT(vector_etc) sort(vector_etc.begin(), vector_etc.end())
#define ALL(vec_etc) vec_etc.begin(), vec_etc.end()
#define VCVC(Type_name) vector<vector<Type_name>> // 2次元配列定義怠過ぎ問題
#define WARSHALL vector<vector<ll>> g(n, vector<ll>(n, LONGINF))
#define endl '\n'
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl
#define no cout << "no" << endl
#define Tof(x) x ? Yes : No
#define TOF(x) x ? YES : NO
#define tof(x) x ? yes : no
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
} // aに最大値が入る
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
} // aに最小値が入る
template <typename T> istream &operator>>(istream &is, vector<T> &Vec) {
for (T &x : Vec) {
is >> x;
}
return is;
}
template <typename V, typename H> void resize(vector<V> &vec, const H head) {
vec.resize(head);
}
template <typename V, typename H, typename... T>
void resize(vector<V> &vec, const H &head, const T... tail) {
vec.resize(head);
for (auto &v : vec) {
resize(v, tail...);
}
}
template <ll mod> struct ModInt {
// けんちょんさん作modをとる整数
// 名前だけ変えた
// これがないと二項係数が動かないので注意
// 普通に計算するとmodがとれる
long long val;
constexpr ModInt(long long v = 0) noexcept : val(v % mod) {
if (val < 0)
v += mod;
}
constexpr int getmod() { return mod; }
constexpr ModInt operator-() const noexcept { return val ? mod - val : 0; }
constexpr ModInt operator+(const ModInt &r) const noexcept {
return ModInt(*this) += r;
}
constexpr ModInt operator-(const ModInt &r) const noexcept {
return ModInt(*this) -= r;
}
constexpr ModInt operator*(const ModInt &r) const noexcept {
return ModInt(*this) *= r;
}
constexpr ModInt operator/(const ModInt &r) const noexcept {
return ModInt(*this) /= r;
}
constexpr ModInt &operator+=(const ModInt &r) noexcept {
val += r.val;
if (val >= mod)
val -= mod;
return *this;
}
constexpr ModInt &operator-=(const ModInt &r) noexcept {
val -= r.val;
if (val < 0)
val += mod;
return *this;
}
constexpr ModInt &operator*=(const ModInt &r) noexcept {
val = val * r.val % mod;
return *this;
}
constexpr ModInt &operator/=(const ModInt &r) noexcept {
long long a = r.val, b = mod, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % mod;
if (val < 0)
val += mod;
return *this;
}
constexpr bool operator==(const ModInt &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const ModInt &r) const noexcept {
return this->val != r.val;
}
friend ostream &operator<<(ostream &os, const ModInt<mod> &x) noexcept {
return os << x.val;
}
friend istream &operator>>(istream &is, ModInt<mod> &x) noexcept {
return is >> x.val;
}
friend constexpr ModInt<mod> modpow(const ModInt<mod> &a,
long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
template <class T> struct nCk {
// けんちょんさん作二項係数ライブラリ
// 名前だけ変えた
// nCk<ModInt<MOD>> c(200000);
// ↑のような感じで初期化
vector<T> fact_, inv_, finv_;
constexpr nCk() {}
constexpr nCk(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
init(n);
}
constexpr void init(int n) noexcept {
fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
int MOD = fact_[0].getmod();
for (int i = 2; i < n; i++) {
fact_[i] = fact_[i - 1] * i;
inv_[i] = -inv_[MOD % i] * (MOD / i);
finv_[i] = finv_[i - 1] * inv_[i];
}
}
constexpr T com(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return fact_[n] * finv_[k] * finv_[n - k];
}
constexpr T fact(int n) const noexcept {
if (n < 0)
return 0;
return fact_[n];
}
constexpr T inv(int n) const noexcept {
if (n < 0)
return 0;
return inv_[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0)
return 0;
return finv_[n];
}
};
int dx[] = {0, 1, -1, 0, 1, -1, 1, -1}; // i<4:4way i<8:8way
int dy[] = {1, 0, 0, -1, 1, -1, -1, 1};
ll PowMod(ll n, ll k, ll mod) {
// 繰り返し2乗法
// n^kをmodで求める
ll r = 1;
for (; k > 0; k >>= 1) {
if (k & 1) {
r = (r * n) % mod;
}
n = (n * n) % mod;
}
return r;
}
ll Gcd(ll a, ll b) { // 最大公約数
return b != 0 ? Gcd(b, a % b) : a;
}
ll Lcm(ll a, ll b) { // 最小公倍数
return a / Gcd(a, b) * b;
}
vector<string> Split(string s, string t) {
// 文字列を文字列で分割する
vector<string> v;
int p = s.find(t);
if (p != s.npos) {
v.push_back(s.substr(0, p));
s = s.substr(p + t.size());
}
v.push_back(s);
return v;
}
vector<int> Lis(const vector<int> &a) {
// #define Index_of(as, x) distance(as.begin(), lower_bound(as.begin(),
// as.end(), x))
#define Index_of(as, x) \
distance(as.begin(), upper_bound(as.begin(), as.end(), x))
// upper_boundを使用すると、重複を許した最長増加部分列になる
//-1倍した値を入れれば、最長減少部分列になる
const int n = a.size();
vector<int> A(n, INF);
vector<int> id(n);
for (int i = 0; i < n; ++i) {
id[i] = Index_of(A, a[i]);
A[id[i]] = a[i];
}
int m = *max_element(id.begin(), id.end());
vector<int> b(m + 1);
for (int i = n - 1; i >= 0; --i)
if (id[i] == m)
b[m--] = a[i];
return b; // 最長部分列のどれか1つ
}
string ReplaceString(string s, string target, string replacestring) {
// 1: 置き換え対象
// 2: 検索対象
// 3: 置き換える内容
string::size_type Pos(s.find(target));
while (Pos != string::npos) {
s.replace(Pos, target.length(), replacestring);
Pos = s.find(target, Pos + replacestring.length());
}
return s;
}
string LcsAlphabeticalMinOrder(string a, string b) {
if (a.size() < b.size()) {
swap(a, b);
}
int n = a.size(), m = b.size();
vector<string> dp(m + 1);
for (int i = 0; i < n; i++) {
vector<string> to(m + 1);
for (int j = 0; j < m; j++) {
if (a[i] == b[j]) {
to[j + 1] = dp[j] + a[i];
} else {
if (to[j].size() > dp[j + 1].size()) {
to[j + 1] = to[j];
} else if (to[j].size() < dp[j + 1].size()) {
to[j + 1] = dp[j + 1];
} else if (to[j] < dp[j + 1]) {
to[j + 1] = to[j];
} else {
to[j + 1] = dp[j + 1];
}
}
}
dp.swap(to);
}
return dp[m];
}
string Lcs(const string &s, const string &t) {
int dp[3001][3001];
int n = s.size();
int m = t.size();
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (s[i - 1] == t[j - 1]) {
dp[i][j] = dp[i - 1][j - 1] + 1;
} else {
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]);
}
}
}
string ans = "";
int i = s.size(), j = t.size();
while (i > 0 && j > 0) {
if (s[i - 1] == t[j - 1]) {
ans += s[i - 1];
i--;
j--;
} else if (dp[i - 1][j] >= dp[i][j - 1])
i--;
else
j--;
}
reverse(ans.begin(), ans.end());
return ans;
}
vector<int> LcsInteger(const vector<int> &a, const vector<int> &b) {
#define index_of(as, x) \
distance(as.begin(), lower_bound(as.begin(), as.end(), x))
struct node {
int value;
node *next;
node(int value, node *next) : value(value), next(next) {}
};
const int n = a.size(), m = b.size();
map<int, vector<int>> M;
for (int j = m - 1; j >= 0; --j)
M[b[j]].push_back(j);
vector<int> xs(n + 1, INF);
xs[0] = -INF;
vector<node *> link(n + 1);
for (int i = 0; i < n; ++i) {
if (M.count(a[i])) {
vector<int> ys = M[a[i]];
for (int j = 0; j < (int)ys.size(); ++j) {
int k = index_of(xs, ys[j]);
xs[k] = ys[j];
link[k] = new node(b[ys[j]], link[k - 1]);
}
}
}
vector<int> c;
int l = index_of(xs, INF - 1) - 1;
for (node *p = link[l]; p; p = p->next)
c.push_back(p->value);
reverse(c.begin(), c.end());
return c;
}
bool IsPrime(ll n) {
// 素数かどうかを判定
// true 素数
if (n < 2)
return false;
for (ll i = 2; i * i <= n; i++)
if (!(n % i))
return false;
return true;
}
vector<bool> Eratosthenes(int n) {
// エラトステネスの篩
// 返り値はbool
// return res;として、返り値の型をvector<int>とすれば、
// 素数だけを取り出せる
vector<int> res;
vector<bool> Prime(n + 1, true);
Prime[0] = Prime[1] = false;
for (int i = 2; i * i <= n; i++) {
if (Prime[i]) {
for (int j = 2; i * j <= n; j++) {
Prime[i * j] = false;
}
}
}
for (int i = 2; i <= n; i++) {
if (Prime[i]) {
res.emplace_back(i);
}
}
return Prime;
}
ll MergeCount(vector<int> &a) {
// 反転数を数える
ll count = 0;
int n = a.size();
if (n > 1) {
vector<int> b(a.begin(), a.begin() + n / 2);
vector<int> c(a.begin() + n / 2, a.end());
count += MergeCount(b);
count += MergeCount(c);
for (int i = 0, j = 0, k = 0; i < n; ++i)
if (k == c.size())
a[i] = b[j++];
else if (j == b.size())
a[i] = c[k++];
else if (b[j] <= c[k])
a[i] = b[j++];
else {
a[i] = c[k++];
count += n / 2 - j;
}
}
return count;
}
bool WarshallFloyd(vector<vector<ll>> &c) {
// ワーシャルフロイド法
// 全ての頂点間の最短距離を求める
// falseの時、負の閉路検出
int V = c.size();
for (int i = 0; i < V; i++) {
c[i][i] = 0;
}
for (int i = 0; i < V; i++) {
for (int j = 0; j < V; j++) {
for (int k = 0; k < V; k++) {
if (c[j][k] > c[j][i] + c[i][k]) {
c[j][k] = c[j][i] + c[i][k];
}
}
}
}
for (int i = 0; i < V; i++) {
if (c[i][i] < 0) {
return false;
}
}
return true;
}
vector<ll> Dijkstra(int i, vector<vector<edge>> graph) {
// i:始点
// graph:重み付きグラフ
int n = graph.size();
vector<ll> d(n, LONGINF);
d[i] = 0;
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>
q;
q.push(make_pair(0, i)); // 第一引数:コスト 第二引数:頂点
while (!q.empty()) {
pair<ll, int> p = q.top();
q.pop();
int v = p.second;
if (d[v] < p.first) {
continue;
}
for (auto x : graph[v]) {
if (d[x.to] > d[v] + x.cost) {
d[x.to] = d[v] + x.cost;
q.push(make_pair(d[x.to], x.to));
}
}
}
return d;
}
bool BellmanFord(int start, int V, int E, vector<edge> Edge, vector<ll> &d) {
// 第一引数:start 始点
// 第二引数:V 頂点数
// 第三引数:E 辺の数
// 第四引数:Edge 辺の重み付きのグラフ
// 第五引数:d 各頂点への距離を入れる配列(答えが入る)
// 負の閉路検出でfalseが返り値
resize(d, V);
fill(d.begin(), d.end(), LONGINF);
d[start] = 0;
vector<bool> t(V, false);
for (int i = 0; i < V - 1; i++) {
for (int j = 0; j < E; j++) {
edge e = Edge[j];
if (d[e.from] == LONGINF) {
continue;
}
if (d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
}
}
}
for (int i = 0; i < V; i++) {
for (int j = 0; j < E; j++) {
edge e = Edge[j];
if (d[e.from] == LONGINF) {
continue;
}
if (d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
t[e.to] = true;
/*
if (i == V - 1) {//どこかに閉路があることを感知する
return false;
}
*/
}
if (t[e.from]) {
t[e.to] = true;
}
}
}
if (t[V - 1]) {
// V-1は頂点番号n-1で、始点からn-1までに負の閉路を検出したい場合には、
// コメントアウトを解除すること。
return false;
}
return true;
}
bool TopologicalSort(const vector<vector<edge>> &g, vector<int> &ans) {
// トポロジカルソート
// trueが帰る時、トポロジカルソートが成功し、その結果がansに渡される
// falseはトポロジカルソートの失敗
int n = g.size(), k = 0;
vector<int> ord(n), in(n);
for (auto &es : g) {
for (auto &e : es) {
in[e.to]++;
}
}
queue<int> q;
for (int i = 0; i < n; ++i) {
if (in[i] == 0)
q.push(i);
}
while (!q.empty()) {
int v = q.front();
q.pop();
ord[k++] = v;
for (auto &e : g[v]) {
if (--in[e.to] == 0)
q.push(e.to);
}
}
ans = ord;
if (*max_element(in.begin(), in.end()) == 0) {
return true;
}
return false;
}
vector<int> ArticulationNode(const vector<vector<edge>> &g) {
// グラフの関節点を列挙する
// 最後の2行で、erace
// uniqueをしない場合は、その分割によって何個のグラフに分かれるかを判定できる(要チェック)。
int n = g.size(), idx;
vector<int> low(n), ord(n), art;
function<void(int)> DFS = [&](int v) {
low[v] = ord[v] = ++idx;
for (auto &e : g[v]) {
int w = e.to;
if (ord[w] == 0) {
DFS(w);
low[v] = min(low[v], low[w]);
if ((ord[v] == 1 && ord[w] != 2) || (ord[v] != 1 && low[w] >= ord[v])) {
art.push_back(v);
}
} else {
low[v] = min(low[v], ord[w]);
}
}
};
for (int u = 0; u < n; u++) {
if (ord[u] == 0) {
idx = 0;
DFS(u);
}
}
sort(art.begin(), art.end()); // 与えられた関節点をソート
art.erase(unique(art.begin(), art.end()),
art.end()); // 同じ関節点が複数存在することがある,
return art;
}
vector<vector<edge>> ToRootTree(const vector<vector<edge>> &g, int r) {
// 根付き木へ変換する。
// 動作未確認。
int n = g.size();
vector<vector<edge>> G(n);
vector<int> ord(n, -1);
queue<int> q;
q.push(r);
int k = 0;
while (q.size()) {
int u = q.front();
q.pop();
for (auto &e : g[u]) {
int v = e.to;
if (ord[v] == -1) {
ord[v] = k;
k++;
q.push(v);
G[u].emplace_back(e);
}
}
}
return G;
}
edge TreeDiameter(const vector<vector<edge>> &g) {
// 重み付きグラフ(木)を受け取り、その木の直径を求める
// 返り値はfrom,to,costを持った構造体
int start = 0; // どの始点から始めても良いので、0から始める
static const auto bfs = [](const vector<vector<edge>> &g, int s,
queue<int> &q, vector<ll> &dist) {
while (!q.empty()) {
q.pop();
}
q.push(s);
int n = g.size();
dist.assign(n, LONGINF);
dist[s] = 0;
while (q.size()) {
int u = q.front();
q.pop();
for (auto &e : g[u]) {
int v = e.to;
if (dist[v] == LONGINF) {
dist[v] = dist[u] + e.cost;
q.push(v);
}
}
}
return dist;
};
vector<ll> dist;
queue<int> q;
bfs(g, start, q, dist);
int n = g.size(), u = -1, v = -1;
for (int i = 0; i < n; i++)
if (dist[i] != LONGINF && (u == -1 || dist[i] > dist[u]))
u = i;
bfs(g, u, q, dist);
for (int i = 0; i < n; i++)
if (dist[i] != LONGINF && (v == -1 || dist[i] > dist[v]))
v = i;
ll d = dist[v];
if (u > v)
swap(u, v); // 念のため辞書順
return edge(u, v, d);
}
void add_edge(vector<vector<edge>> &g, int a, int b, ll cost, ll cap) {
// graph(vector<vector<edge>>)に対して無向辺として辺を貼る関数
// graph以外には当然使えないので注意
g[a].emplace_back(a, b, cost, cap);
g[b].emplace_back(b, a, cost, cap);
}
pair<vector<int>, vector<edge>> bridge(const vector<vector<edge>> &g) {
// グラフの橋となる辺を列挙する
// 戻り値のfirst:二重辺連結成分分解の番号となる
// 戻り値のsecond:橋となる辺を列挙したもの
const int n = g.size();
int idx = 0, s = 0, t = 0, k = 0;
vector<int> ord(n, -1), onS(n), stk(n), roots(n), cmp(n);
vector<edge> brdg;
function<void(int, int)> dfs = [&](int v, int u) {
ord[v] = idx++;
stk[s++] = v;
onS[v] = true;
roots[t++] = v;
for (auto &e : g[v]) {
int w = e.to;
if (ord[w] == -1) {
dfs(w, v);
} else if (u != w && onS[w]) {
while (ord[roots[t - 1]] > ord[w]) {
--t;
}
}
}
if (v == roots[t - 1]) {
brdg.emplace_back(u, v, 0);
while (1) {
int w = stk[--s];
onS[w] = false;
cmp[w] = k;
if (v == w)
break;
}
--t;
++k;
}
};
for (int u = 0; u < n; u++) {
if (ord[u] == -1) {
dfs(u, n);
brdg.pop_back();
}
}
return make_pair(cmp, brdg);
}
class UnionFind {
// satanicさん作 UnionFind
// 追加機能:forest_num
// forestは、全体に含まれる木の数を表す
private:
std::vector<int> parent;
std::vector<int> height;
std::vector<int> m_size;
int forest_num;
public:
UnionFind(int size_) : parent(size_), height(size_, 0), m_size(size_, 1) {
forest_num = size_;
for (int i = 0; i < size_; ++i)
parent[i] = i;
}
void init(int size_) {
parent.resize(size_);
height.resize(size_, 0);
m_size.resize(size_, 1);
forest_num = size_;
for (int i = 0; i < size_; ++i)
parent[i] = i;
}
int find(int x) {
if (parent[x] == x)
return x;
return parent[x] = find(parent[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
int t = size(x) + size(y);
m_size[x] = m_size[y] = t;
if (height[x] < height[y])
parent[x] = y;
else
parent[y] = x;
if (height[x] == height[y])
++height[x];
forest_num--;
}
bool same(int x, int y) { return find(x) == find(y); }
int size(int x) {
if (parent[x] == x)
return m_size[x];
return size(parent[x] = find(parent[x]));
}
int forest() { return forest_num; }
};
class Dinic {
// 最大流を求める
#define FLOW int
private:
int n, s, t;
vector<int> level, prog, que;
vector<vector<FLOW>> cap, flow;
vector<vector<int>> g;
FLOW inf;
public:
Dinic(const vector<vector<edge>> &graph)
: n(graph.size()), cap(n, vector<FLOW>(n)), flow(n, vector<FLOW>(n)),
g(n, vector<int>()), inf(INF) {
for (int i = 0; i < n; i++) {
for (auto &e : graph[i]) {
int u = e.from, v = e.to;
ll c = e.capa;
cap[u][v] += c;
cap[v][u] += c;
flow[v][u] += c;
g[u].push_back(v);
g[v].push_back(u);
}
}
}
inline FLOW residue(int u, int v) { return cap[u][v] - flow[u][v]; }
FLOW solve(int s_, int t_) {
this->t = t_, this->s = s_;
que.resize(n + 1);
FLOW res = 0;
while (levelize()) {
prog.assign(n, 0);
res += augment(s, inf);
}
return res;
}
bool levelize() {
int l = 0, r = 0;
level.assign(n, -1);
level[s] = 0;
que[r++] = s;
while (l != r) {
int v = que[l++];
if (v == t)
break;
for (const int &d : g[v])
if (level[d] == -1 && residue(v, d) != 0) {
level[d] = level[v] + 1;
que[r++] = d;
}
}
return level[t] != -1;
}
FLOW augment(int v, FLOW lim) {
FLOW res = 0;
if (v == t)
return lim;
for (int &i = prog[v]; i < (int)g[v].size(); i++) {
const int &d = g[v][i];
if (residue(v, d) == 0 || level[v] >= level[d])
continue;
const FLOW aug = augment(d, min(lim, residue(v, d)));
flow[v][d] += aug;
flow[d][v] -= aug;
res += aug;
lim -= aug;
if (lim == 0)
break;
}
return res;
}
};
class MinimumCostFlow {
private:
using Flow = ll;
using Cost = ll;
struct Edge {
int d;
Flow c, f;
Cost w;
int r, is_r;
Edge(int d_, Flow c_, Flow f_, Cost w_, int r_, bool is_r_)
: d(d_), c(c_), f(f_), w(w_), r(r_), is_r(is_r_) {}
};
int n;
vector<vector<Edge>> g;
public:
MinimumCostFlow(int n_) : n(n_), g(vector<vector<Edge>>(n_)) {}
void add_edge(int src, int dst, Flow cap, Cost cost) { // 有向辺
int rsrc = g[dst].size();
int rdst = g[src].size();
g[src].emplace_back(dst, cap, 0, cost, rsrc, false);
g[dst].emplace_back(src, cap, cap, -cost, rdst, true);
}
Cost solve(int s, int t, Flow f) {
Cost res = 0;
vector<Cost> h(n + 10), dist(n);
vector<int> prevv(n + 10), preve(n + 10);
using pcv = pair<Cost, int>;
priority_queue<pcv, vector<pcv>, greater<pcv>> q;
fill(h.begin(), h.end(), 0);
while (f > 0) {
fill(dist.begin(), dist.end(), LONGINF);
dist[s] = 0;
q.emplace(0, s);
while (q.size()) {
Cost cd;
int v;
tie(cd, v) = q.top();
q.pop();
if (dist[v] < cd)
continue;
for (int i = 0; i < (int)(g[v].size()); ++i) {
Edge &e = g[v][i];
if (residue(e) == 0)
continue;
if (dist[e.d] + h[e.d] > cd + h[v] + e.w) {
dist[e.d] = dist[v] + e.w + h[v] - h[e.d];
prevv[e.d] = v;
preve[e.d] = i;
q.emplace(dist[e.d], e.d);
}
}
}
if (dist[t] == LONGINF)
return -1; // 経路が見つからなかった
// s-t 間を最短路に沿って目一杯流す
for (int i = 0; i < n; ++i)
h[i] += dist[i];
Flow d = f;
for (int v = t; v != s; v = prevv[v]) {
chmin(d, residue(g[prevv[v]][preve[v]]));
}
f -= d;
res += d * h[t];
for (int v = t; v != s; v = prevv[v]) {
Edge &e = g[prevv[v]][preve[v]];
e.f += d;
g[v][e.r].f -= d;
}
}
return res;
}
Flow residue(const Edge &e) { return e.c - e.f; }
// 流量を表示
void show() {
for (int i = 0; i < n; ++i) {
for (int j = 0; j < (int)(g[i].size()); ++j) {
Edge &e = g[i][j];
if (e.is_r)
continue;
cout << i << "->" << e.d << "(flow:" << e.f << ")" << endl;
}
}
}
};
class BipartiteMatching {
private:
int V;
vector<int> match;
vector<bool> used;
vector<vector<int>> g;
vector<pair<int, int>> match_pair;
bool dfs(int v) {
used[v] = true;
for (int i = 0; i < (int)g[v].size(); i++) {
int u = g[v][i];
int w = match[u];
if (w < 0 || !used[w] && dfs(w)) {
match[v] = u;
match[u] = v;
match_pair.emplace_back(make_pair(u, v));
return true;
}
}
return false;
}
public:
BipartiteMatching(int n) {
V = n;
resize(match, n);
resize(used, n);
resize(g, n);
}
void add_edge(int u, int v) {
g[u].emplace_back(v);
g[v].emplace_back(u);
}
int MatchingSolve() {
int res = 0;
fill(match.begin(), match.end(), -1);
for (int v = 0; v < V; v++) {
if (match[v] < 0) {
fill(used.begin(), used.end(), false);
if (dfs(v)) {
res++;
}
}
}
return res;
}
vector<pair<int, int>> get_pair() {
for (auto x : match_pair) {
cout << x.first << " " << x.second << endl;
}
return match_pair;
}
};
class Lca {
private:
int n;
int log2_n;
vector<vector<int>> parent;
vector<int> depth;
void dfs(const vector<vector<edge>> &g, int v, int p, int d) {
parent[0][v] = p;
depth[v] = d;
for (auto &e : g[v]) {
if (e.to != p) {
dfs(g, e.to, v, d + 1);
}
}
}
public:
Lca(const vector<vector<edge>> &g, int root) {
n = g.size();
log2_n = (int)log2(n) + 1;
resize(parent, log2_n, n);
resize(depth, n);
dfs(g, root, -1, 0);
for (int k = 0; k + 1 < log2_n; k++) {
for (int v = 0; v < (int)g.size(); v++) {
if (parent[k][v] < 0) {
parent[k + 1][v] = -1;
} else {
parent[k + 1][v] = parent[k][parent[k][v]];
}
}
}
}
int get_lca(int u, int v) {
if (depth[u] > depth[v]) {
swap(u, v);
} // u≦v
for (int k = 0; k < log2_n; k++) {
if ((depth[v] - depth[u]) >> k & 1) {
v = parent[k][v];
}
}
if (u == v) {
return u;
}
for (int k = log2_n - 1; k >= 0; k--) {
if (parent[k][u] != parent[k][v]) {
u = parent[k][u];
v = parent[k][v];
}
}
return parent[0][u];
}
int get_depth(int v) { return depth[v]; }
};
class DAG {
// 有向グラフをゴニョゴニョするクラス
// 機能:longest_path 有向パスの最長経路(含まれる辺の数)を求める
private:
int n;
vector<vector<edge>> g;
vector<int> visited;
vector<int> dp;
vector<int> topological;
int dfs(int s) {
if ((int)g[s].size() == 0) {
return 1;
}
if (dp[s] > 0) {
return dp[s];
}
int mx = 1;
for (auto j : g[s]) {
if (visited[j.to] == 0) {
visited[j.to] = 1;
int l = 0;
l = dfs(j.to);
chmax(mx, l);
} else {
chmax(mx, dp[j.to]);
}
}
return dp[s] = mx + 1;
}
public:
DAG(const vector<vector<edge>> &f) {
g = f;
n = f.size();
resize(visited, n + 1);
fill(visited.begin(), visited.end(), 0);
resize(dp, n + 1);
fill(dp.begin(), dp.end(), -1);
resize(topological, n);
}
DAG(int x) {
n = x;
resize(g, n);
resize(visited, n + 1);
fill(visited.begin(), visited.end(), 0);
resize(dp, n + 1);
fill(dp.begin(), dp.end(), -1);
}
void add_edge(int a, int b) { g[a].emplace_back(a, b); }
void add_edge(int a, int b, ll c) { g[a].emplace_back(a, b, c); }
void add_edge(int a, int b, ll c, ll d) { g[a].emplace_back(a, b, c, d); }
int longest_path() {
int mx = -1;
for (int i = 0; i < n; i++) {
int h = 0;
if (visited[i] == 0) {
h = dfs(i);
chmax(mx, h);
}
}
return mx - 1;
}
bool TopologicalSort() {
// trueが帰る時、トポロジカルソートが成功
// falseはトポロジカルソートの失敗
int k = 0;
vector<int> ord(n), in(n);
for (auto &es : g) {
for (auto &e : es) {
in[e.to]++;
}
}
queue<int> q;
for (int i = 0; i < n; ++i) {
if (in[i] == 0)
q.push(i);
}
while (!q.empty()) {
int v = q.front();
q.pop();
ord[k++] = v;
for (auto &e : g[v]) {
if (--in[e.to] == 0) {
q.push(e.to);
}
}
}
topological = ord;
if (*max_element(in.begin(), in.end()) == 0) {
return true;
}
return false;
}
};
class RangeMinimumUpdateQuerySegmentTree {
// 区間最小値を求めることが出来るセグメント木
// query:指定した半開区間においての最小値を求める
// update:指定した半開区間の値を変更する
// RangeUpdateQueryも兼ねることが出来る(1つの要素の最小値はその要素のみ)
private:
int n;
ll inf = (1LL << 31) - 1; // 2^31-1
vector<ll> dat, lazy;
void eval(int len, int k) {
if (lazy[k] == inf)
return;
if (k * 2 + 1 < n * 2 - 1) {
lazy[2 * k + 1] = lazy[k];
lazy[2 * k + 2] = lazy[k];
}
dat[k] = lazy[k];
lazy[k] = inf;
}
public:
RangeMinimumUpdateQuerySegmentTree() {}
RangeMinimumUpdateQuerySegmentTree(int n_) {
n = 1;
while (n < n_)
n *= 2;
dat.assign(n * 2, inf);
lazy.assign(n * 2, inf);
}
// [a, b)
ll update(int a, int b, ll x, int k, int l, int r) {
eval(r - l, k);
if (b <= l || r <= a)
return dat[k];
if (a <= l && r <= b) {
lazy[k] = x;
return lazy[k];
}
return dat[k] = min(update(a, b, x, 2 * k + 1, l, (l + r) / 2),
update(a, b, x, 2 * k + 2, (l + r) / 2, r));
}
ll update(int a, int b, ll x) { return update(a, b, x, 0, 0, n); }
// [a, b)
ll query(int a, int b, int k, int l, int r) {
eval(r - l, k);
if (b <= l || r <= a)
return inf;
if (a <= l && r <= b)
return dat[k];
ll vl = query(a, b, 2 * k + 1, l, (l + r) / 2);
ll vr = query(a, b, 2 * k + 2, (l + r) / 2, r);
return min(vl, vr);
}
ll query(int a, int b) { return query(a, b, 0, 0, n); }
};
class RangeSumQuerySegmentTree {
// 区間和を求めることが出来るセグメント木
// update:指定した要素に加算
// query:指定した半開区間の合計を返す
// 0-indexed
// 半開区間
private:
struct Node {
Node *left, *right;
ll v;
Node() : left(nullptr), right(nullptr), v(0) {}
};
Node *root;
ll n, n0;
ll query(ll a, ll b, Node *n, ll l, ll r) {
if (a <= l && r <= b) {
return n->v;
}
if (r <= a || b <= l) {
return 0;
}
ll lv = n->left ? query(a, b, n->left, l, (l + r) >> 1) : 0;
ll rv = n->right ? query(a, b, n->right, (l + r) >> 1, r) : 0;
return (lv + rv) % MOD;
}
public:
RangeSumQuerySegmentTree(ll n) : n(n) {
n0 = 1;
while (n0 < n)
n0 <<= 1;
root = new Node();
}
~RangeSumQuerySegmentTree() {
delete root;
root = nullptr;
}
void update(ll k, ll x) {
Node *n = root;
ll l = 0, r = n0;
n->v = (n->v + x) % MOD;
while (r - l > 1) {
ll m = (l + r) >> 1;
if (k < m) {
if (!n->left)
n->left = new Node();
n = n->left;
r = m;
} else {
if (!n->right)
n->right = new Node();
n = n->right;
l = m;
}
n->v = (n->v + x) % MOD;
}
}
ll query(ll a, ll b) { return query(a, b, root, 0, n0); }
ll lquery(ll b) { return query(0, b, root, 0, n0); }
ll rquery(ll a) { return query(a, n0, root, 0, n0); }
};
class KDimensionalTree {
// 2Dの点がある区間内にあるかどうかを判定し、その点を列挙する
// makeKDTreeで前計算
// findが実際に探す部分
public:
struct Node {
int location;
int p, l, r;
Node() {}
};
struct Point {
int id, x, y;
Point() {}
Point(int i, int a, int b) {
id = i;
x = a;
y = b;
}
bool operator<(const Point &p) const { return id < p.id; }
void print() { cout << id << endl; }
};
static const ll NIL = -1;
static bool lessX(const Point &p1, const Point &p2) { return p1.x < p2.x; }
static bool lessY(const Point &p1, const Point &p2) { return p1.y < p2.y; }
int N;
vector<Point> P;
vector<Node> T;
int np;
KDimensionalTree() {}
KDimensionalTree(int N) { init(N); }
void init(int n) {
N = n;
P.clear();
T.clear();
resize(P, N);
resize(T, N);
np = 0;
}
int makeKDTree(int l, int r, int depth) {
if (l >= r) {
return NIL;
}
int mid = (l + r) / 2;
int t = np++;
if (depth & 1) {
sort(P.begin() + l, P.begin() + r, lessY);
} else {
sort(P.begin() + l, P.begin() + r, lessX);
}
T[t].location = mid;
T[t].l = makeKDTree(l, mid, depth + 1);
T[t].r = makeKDTree(mid + 1, r, depth + 1);
return t;
}
void find(int v, int sx, int tx, int sy, int ty, int depth,
vector<Point> &ans) {
int x = P[T[v].location].x;
int y = P[T[v].location].y;
if (sx <= x && x <= tx && sy <= y && y <= ty) {
ans.push_back(P[T[v].location]);
}
if (depth % 2 == 0) {
if (T[v].l != NIL) {
if (sx <= x)
find(T[v].l, sx, tx, sy, ty, depth + 1, ans);
}
if (T[v].r != NIL) {
if (x <= tx)
find(T[v].r, sx, tx, sy, ty, depth + 1, ans);
}
} else {
if (T[v].l != NIL) {
if (sy <= y)
find(T[v].l, sx, tx, sy, ty, depth + 1, ans);
}
if (T[v].r != NIL) {
if (y <= ty)
find(T[v].r, sx, tx, sy, ty, depth + 1, ans);
}
}
}
void add_point(int i, int x, int y) {
P[i].id = i;
P[i].x = x;
P[i].y = y;
T[i].l = T[i].r = T[i].p = NIL;
}
};
class RangeAddQuerySegmentTree {
// 区間に足し算をする機能と、ある要素を参照する機能があるセグメント木
private:
int n;
vector<ll> data;
public:
RangeAddQuerySegmentTree() {}
RangeAddQuerySegmentTree(int N) {
n = N;
resize(data, n + 1);
fill(data.begin(), data.end(), 0);
}
void add(int i, ll x) {
while (i) {
data[i] += x;
i -= (i & -i);
}
}
void add(int i, int j, ll x) {
add(j, x);
add(i - 1, -x);
}
ll get(int i) {
ll res = 0;
while (i <= n) {
res += data[i];
i += (i & -i);
}
return res;
}
};
class RangeSumAddQuerySegmentTree {
// update:ある区間に対して足し算を行う機能
// query:ある区間に対して合計値を求める機能
private:
vector<ll> bit0, bit1;
int n;
ll sum(const vector<ll> &b, int i) {
ll s = 0;
while (i > 0) {
s += b[i];
i -= (i & -i);
}
return s;
}
void add(vector<ll> &b, int i, ll v) {
while (i <= n) {
b[i] += v;
i += (i & -i);
}
}
public:
RangeSumAddQuerySegmentTree() {}
RangeSumAddQuerySegmentTree(int N) {
n = N;
resize(bit0, n + 1);
resize(bit1, n + 1);
fill(bit0.begin(), bit0.end(), 0);
fill(bit1.begin(), bit1.end(), 0);
}
void update(int l, int r, ll x) {
add(bit0, l, -x * (l - 1));
add(bit1, l, x);
add(bit0, r + 1, x * r);
add(bit1, r + 1, -x);
}
ll query(int l, int r) {
ll res = 0;
res += sum(bit0, r) + sum(bit1, r) * r;
res -= sum(bit0, l - 1) + sum(bit1, l - 1) * (l - 1);
return res;
}
};
int main() {
int n;
cin >> n;
string s;
cin >> s;
int dp[5 * 1000][5 * 1000];
memset(dp, 0, sizeof(dp));
int ans = 0;
for (int i = n - 1; i >= 0; i--) {
for (int j = n - 1; j > i; j--) {
if (s[i] != s[j]) {
dp[i][j] = 0;
} else {
dp[i][j] = max(dp[i + 1][j + 1] + 1, dp[i][j]);
}
ans = max(ans, min(dp[i][j], j - i));
}
}
cout << ans << endl;
return 0;
}
| replace | 1,499 | 1,514 | 1,499 | 1,514 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define rt(i, n) (i == (ll)(n)-1 ? rt : sp)
#define len(x) ((ll)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define ifn(x) if (not(x))
#define elif else if
#define elifn else ifn
#define fi first
#define se second
using graph = vector<vector<ll>>;
template <class T> using wgraph = vector<vector<ll, T>>;
bool __DIRECTED__ = true;
istream &operator>>(istream &is, graph &g) {
ll a, b;
is >> a >> b;
g[a - 1].pb(b - 1);
if (__DIRECTED__ == false)
g[b - 1].pb(a - 1);
return is;
}
template <class T> istream &operator>>(istream &is, wgraph<T> &g) {
ll a, b;
T c;
is >> a >> b >> c;
g[a - 1].pb({b - 1, c});
if (__DIRECTED__ == false)
g[b - 1].pb({a - 1, c});
return is;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// Debug
#define debug(...) \
{ \
cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \
for (auto &&X : {__VA_ARGS__}) \
cerr << "[" << X << "] "; \
cerr << rt; \
}
#define dump(a, h, w) \
{ \
cerr << __LINE__ << ": " << #a << " = [" << rt; \
rep(_i, h) { \
rep(_j, w) { \
if (abs(a[_i][_j]) >= INF / 2 and a[_i][_j] <= -INF / 2) \
cerr << '-'; \
if (abs(a[_i][_j]) >= INF / 2) \
cerr << "∞" << sp; \
else \
cerr << a[_i][_j] << sp; \
} \
cerr << rt; \
} \
cerr << "]" << rt; \
}
#define vdump(a, n) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(_i, n) { \
if (_i) \
cerr << sp; \
if (abs(a[_i]) >= INF / 2 and a[_i] <= -INF / 2) \
cerr << '-'; \
if (abs(a[_i]) >= INF / 2) \
cerr << "∞" << sp; \
else \
cerr << a[_i]; \
} \
cerr << "]" << rt; \
}
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)
// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;
// Speed
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// Math
inline constexpr ll gcd(const ll a, const ll b) {
return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
inline constexpr ll modulo(const ll n, const ll m = MOD) {
ll k = n % m;
return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
n %= m;
return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
ll r = 1;
rep(i, 64) {
if (n & (1LL << i))
r *= a;
chmod(r, m);
a *= a;
chmod(a, m);
}
return r;
}
inline ll inv(const ll n, const ll m = MOD) {
ll a = n, b = m, x = 1, y = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
x -= t * y;
swap(x, y);
}
return modulo(x, m);
}
namespace rollinghash {
using u64 = uint_fast64_t;
using u128 = __uint128_t;
const u64 mo = (1LL << 61) - 1;
const u64 bases[64] = {257, 262, 266, 275, 276, 281, 285, 290, 296, 302, 306,
310, 311, 313, 323, 333, 344, 345, 350, 357, 367, 370,
373, 402, 423, 425, 431, 440, 442, 443, 454, 457, 458,
462, 471, 478, 481, 487, 489, 492, 499, 501, 502, 503,
506, 514, 524, 532, 535, 541, 550, 552, 557, 559, 562,
563, 567, 570, 571, 580, 592, 597, 604, 612};
random_device rd;
u64 base = bases[rd() & 63];
u64 add(u64 a, u64 b) {
u64 t = a + b;
return t >= mo ? t - mo : t;
}
u64 minus(u64 a) { return a == 0 ? 0 : mo - a; }
u64 mul(u64 a, u64 b) {
u128 t = u128(a) * u128(b);
t = (t >> 61) + (t & mo);
return t >= mo ? t - mo : t;
}
template <class T> vector<u64> cast(vector<T> v) {
return vector<u64>(v.begin(), v.end());
}
vector<u64> cast(string v) { return vector<u64>(v.begin(), v.end()); }
struct rhash {
vector<u64> data, hash_val, base_pow;
rhash(vector<u64> v) : data(v) {
u64 n = data.size();
hash_val.assign(n + 1, 0);
base_pow.assign(n + 1, 0);
base_pow[0] = 1;
for (u64 i = 0; i < n; i++) {
hash_val[i + 1] = add(mul(hash_val[i], base), v[i]);
base_pow[i + 1] = mul(base_pow[i], base);
}
}
u64 operator()(u64 l, u64 r) {
return add(hash_val[r], minus(mul(hash_val[l], base_pow[r - l])));
}
u64 hash_merge(u64 h1, u64 h2, u64 h2len) {
return add(mul(h1, base_pow[h2len]), h2);
}
void push_back(vector<u64> v) {
u64 n = hash_val.size() - 1, m = v.size();
hash_val.resize(n + m + 1);
base_pow.resize(n + m + 1);
for (u64 i = n; i < n + m; i++) {
hash_val[i + 1] = add(mul(hash_val[i], base), v[i - n]);
base_pow[i + 1] = mul(base_pow[i], base);
}
}
};
u64 LCP(rhash &a, rhash &b, u64 l1, u64 r1, u64 l2, u64 r2) {
u64 len = min(r1 - l1, r2 - l2);
u64 low = -1, high = len + 1;
while (high - low > 1) {
u64 mid = (low + high) / 2;
if (a(l1, l1 + mid) == b(l2, l2 + mid)) {
low = mid;
} else {
high = mid;
}
}
return low;
}
} // namespace rollinghash
signed main() {
ll N;
cin >> N;
string S;
cin >> S;
using namespace rollinghash;
rhash R(cast(S));
ll res = 0;
rep(i, N) {
rep(j, N) {
if (i >= j)
continue;
ll ok = 0, ng = j - i + 1;
while (ng - ok > 1) {
ll md = (ok + ng) / 2;
if (R(i, i + md) == R(j, j + md)) {
ok = md;
} else {
ng = md;
}
}
chmax(res, ok);
}
}
cout << res << rt;
} | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define rt(i, n) (i == (ll)(n)-1 ? rt : sp)
#define len(x) ((ll)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define ifn(x) if (not(x))
#define elif else if
#define elifn else ifn
#define fi first
#define se second
using graph = vector<vector<ll>>;
template <class T> using wgraph = vector<vector<ll, T>>;
bool __DIRECTED__ = true;
istream &operator>>(istream &is, graph &g) {
ll a, b;
is >> a >> b;
g[a - 1].pb(b - 1);
if (__DIRECTED__ == false)
g[b - 1].pb(a - 1);
return is;
}
template <class T> istream &operator>>(istream &is, wgraph<T> &g) {
ll a, b;
T c;
is >> a >> b >> c;
g[a - 1].pb({b - 1, c});
if (__DIRECTED__ == false)
g[b - 1].pb({a - 1, c});
return is;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// Debug
#define debug(...) \
{ \
cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \
for (auto &&X : {__VA_ARGS__}) \
cerr << "[" << X << "] "; \
cerr << rt; \
}
#define dump(a, h, w) \
{ \
cerr << __LINE__ << ": " << #a << " = [" << rt; \
rep(_i, h) { \
rep(_j, w) { \
if (abs(a[_i][_j]) >= INF / 2 and a[_i][_j] <= -INF / 2) \
cerr << '-'; \
if (abs(a[_i][_j]) >= INF / 2) \
cerr << "∞" << sp; \
else \
cerr << a[_i][_j] << sp; \
} \
cerr << rt; \
} \
cerr << "]" << rt; \
}
#define vdump(a, n) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(_i, n) { \
if (_i) \
cerr << sp; \
if (abs(a[_i]) >= INF / 2 and a[_i] <= -INF / 2) \
cerr << '-'; \
if (abs(a[_i]) >= INF / 2) \
cerr << "∞" << sp; \
else \
cerr << a[_i]; \
} \
cerr << "]" << rt; \
}
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)
// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;
// Speed
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// Math
inline constexpr ll gcd(const ll a, const ll b) {
return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
inline constexpr ll modulo(const ll n, const ll m = MOD) {
ll k = n % m;
return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
n %= m;
return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
ll r = 1;
rep(i, 64) {
if (n & (1LL << i))
r *= a;
chmod(r, m);
a *= a;
chmod(a, m);
}
return r;
}
inline ll inv(const ll n, const ll m = MOD) {
ll a = n, b = m, x = 1, y = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
x -= t * y;
swap(x, y);
}
return modulo(x, m);
}
namespace rollinghash {
using u64 = uint_fast64_t;
using u128 = __uint128_t;
const u64 mo = (1LL << 61) - 1;
const u64 bases[64] = {257, 262, 266, 275, 276, 281, 285, 290, 296, 302, 306,
310, 311, 313, 323, 333, 344, 345, 350, 357, 367, 370,
373, 402, 423, 425, 431, 440, 442, 443, 454, 457, 458,
462, 471, 478, 481, 487, 489, 492, 499, 501, 502, 503,
506, 514, 524, 532, 535, 541, 550, 552, 557, 559, 562,
563, 567, 570, 571, 580, 592, 597, 604, 612};
random_device rd;
u64 base = bases[rd() & 63];
u64 add(u64 a, u64 b) {
u64 t = a + b;
return t >= mo ? t - mo : t;
}
u64 minus(u64 a) { return a == 0 ? 0 : mo - a; }
u64 mul(u64 a, u64 b) {
u128 t = u128(a) * u128(b);
t = (t >> 61) + (t & mo);
return t >= mo ? t - mo : t;
}
template <class T> vector<u64> cast(vector<T> v) {
return vector<u64>(v.begin(), v.end());
}
vector<u64> cast(string v) { return vector<u64>(v.begin(), v.end()); }
struct rhash {
vector<u64> data, hash_val, base_pow;
rhash(vector<u64> v) : data(v) {
u64 n = data.size();
hash_val.assign(n + 1, 0);
base_pow.assign(n + 1, 0);
base_pow[0] = 1;
for (u64 i = 0; i < n; i++) {
hash_val[i + 1] = add(mul(hash_val[i], base), v[i]);
base_pow[i + 1] = mul(base_pow[i], base);
}
}
u64 operator()(u64 l, u64 r) {
return add(hash_val[r], minus(mul(hash_val[l], base_pow[r - l])));
}
u64 hash_merge(u64 h1, u64 h2, u64 h2len) {
return add(mul(h1, base_pow[h2len]), h2);
}
void push_back(vector<u64> v) {
u64 n = hash_val.size() - 1, m = v.size();
hash_val.resize(n + m + 1);
base_pow.resize(n + m + 1);
for (u64 i = n; i < n + m; i++) {
hash_val[i + 1] = add(mul(hash_val[i], base), v[i - n]);
base_pow[i + 1] = mul(base_pow[i], base);
}
}
};
u64 LCP(rhash &a, rhash &b, u64 l1, u64 r1, u64 l2, u64 r2) {
u64 len = min(r1 - l1, r2 - l2);
u64 low = -1, high = len + 1;
while (high - low > 1) {
u64 mid = (low + high) / 2;
if (a(l1, l1 + mid) == b(l2, l2 + mid)) {
low = mid;
} else {
high = mid;
}
}
return low;
}
} // namespace rollinghash
signed main() {
ll N;
cin >> N;
string S;
cin >> S;
using namespace rollinghash;
rhash R(cast(S));
ll res = 0;
rep(i, N) rep(j, N) if (i < j) chmax(res, (ll)LCP(R, R, i, j, j, N));
cout << res << rt;
} | replace | 245 | 261 | 245 | 247 | TLE | |
p02913 | C++ | Runtime Error | #include <bits/stdc++.h>
#define TYPE(c) remove_reference_t<decltype(c)>
#define REP(i, n) for (TYPE(n) i = 0; i < n; i++)
#define FOR(v, c) for (TYPE(c.begin()) v = c.begin(); v != c.end(); v++)
#define ALL(c) c.begin(), c.end()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(ALL(c), greater<TYPE(c)::value_type>())
#define UNIQUE(c) c.erase(unique(ALL(c)), c.end())
using namespace std;
using ll = long long;
constexpr int MOD = (int)1e9 + 7;
constexpr int INF = (int)1e9 + 1;
constexpr ll LINF = (ll)1e18 + 1;
template <typename T> constexpr bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
} else {
return false;
}
}
template <typename T> constexpr bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
} else {
return false;
}
}
template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
return os << "(" << p.first << "," << p.second << ")";
}
template <typename T>
auto operator<<(ostream &os, const T &t) ->
typename conditional<true, ostream &, decltype(*t.begin())>::type {
os << "[";
FOR(v, t) {
if (v != t.begin())
os << ",";
os << *v;
}
os << "]";
return os;
}
ostream &operator<<(ostream &os, const string &s) {
FOR(v, s) os << *v;
return os;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
std::cin >> N;
string S;
std::cin >> S;
string S_ori = S;
S = string("$", N) + S + string("$", N);
int max_num = 0;
REP(i, S.size() - N) {
int num = 0;
REP(j, S_ori.size()) {
if (S_ori[j] == S[i + j]) {
int tmp = 1;
while (j < S_ori.size()) {
j++;
if (S_ori[j] == S[i + j])
tmp++;
else
break;
}
chmax(num, tmp);
if (abs(N - (int)i) < num) {
num = abs(N - (int)i);
break;
}
}
}
chmax(max_num, num);
}
std::cout << max_num << std::endl;
return 0;
}
| #include <bits/stdc++.h>
#define TYPE(c) remove_reference_t<decltype(c)>
#define REP(i, n) for (TYPE(n) i = 0; i < n; i++)
#define FOR(v, c) for (TYPE(c.begin()) v = c.begin(); v != c.end(); v++)
#define ALL(c) c.begin(), c.end()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(ALL(c), greater<TYPE(c)::value_type>())
#define UNIQUE(c) c.erase(unique(ALL(c)), c.end())
using namespace std;
using ll = long long;
constexpr int MOD = (int)1e9 + 7;
constexpr int INF = (int)1e9 + 1;
constexpr ll LINF = (ll)1e18 + 1;
template <typename T> constexpr bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
} else {
return false;
}
}
template <typename T> constexpr bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
} else {
return false;
}
}
template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
return os << "(" << p.first << "," << p.second << ")";
}
template <typename T>
auto operator<<(ostream &os, const T &t) ->
typename conditional<true, ostream &, decltype(*t.begin())>::type {
os << "[";
FOR(v, t) {
if (v != t.begin())
os << ",";
os << *v;
}
os << "]";
return os;
}
ostream &operator<<(ostream &os, const string &s) {
FOR(v, s) os << *v;
return os;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
std::cin >> N;
string S;
std::cin >> S;
string S_ori = S;
S = string(N, '$') + S + string(N, '$');
int max_num = 0;
REP(i, S.size() - N) {
int num = 0;
REP(j, S_ori.size()) {
if (S_ori[j] == S[i + j]) {
int tmp = 1;
while (j < S_ori.size()) {
j++;
if (S_ori[j] == S[i + j])
tmp++;
else
break;
}
chmax(num, tmp);
if (abs(N - (int)i) < num) {
num = abs(N - (int)i);
break;
}
}
}
chmax(max_num, num);
}
std::cout << max_num << std::endl;
return 0;
}
| replace | 62 | 63 | 62 | 63 | 0 | |
p02913 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define REP(i, n) for (int _n = n, i = 0; i < _n; ++i)
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
using ull = uint64_t;
using ll = int64_t;
using PII = pair<int, int>;
using VI = vector<int>;
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
int N;
string s;
int dp[1005][1005];
int rec(int l, int r) {
if (s[l] != s[r])
return 0;
if (dp[l][r] != -1)
return dp[l][r];
return dp[l][r] = min({r - l, 1 + rec(l - 1, r - 1)});
}
int main() {
ios::sync_with_stdio(false), cin.tie(0);
cin >> N >> s;
memset(dp, -1, sizeof dp);
int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
ans = max(ans, rec(i, j));
}
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define REP(i, n) for (int _n = n, i = 0; i < _n; ++i)
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; ++i)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; --i)
using ull = uint64_t;
using ll = int64_t;
using PII = pair<int, int>;
using VI = vector<int>;
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B> string to_string(pair<A, B> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A> string to_string(A v) {
bool first = true;
string res = "{";
for (const auto &x : v) {
if (!first) {
res += ", ";
}
first = false;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cerr << " " << to_string(H);
debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
int N;
string s;
int dp[5005][5005];
int rec(int l, int r) {
if (s[l] != s[r])
return 0;
if (dp[l][r] != -1)
return dp[l][r];
return dp[l][r] = min({r - l, 1 + rec(l - 1, r - 1)});
}
int main() {
ios::sync_with_stdio(false), cin.tie(0);
cin >> N >> s;
memset(dp, -1, sizeof dp);
int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
ans = max(ans, rec(i, j));
}
}
cout << ans << "\n";
} | replace | 43 | 44 | 43 | 44 | 0 | |
p02913 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
typedef long long LL;
typedef long double LD;
void func() {
LL N, K;
cin >> N;
string S;
cin >> S;
LL counter_max = 0;
for (LL i = 0; i < N; ++i) { // 部分文字列1の先頭
for (LL j = i + counter_max + 1; j < N; ++j) { // 部分文字列2の先頭
LL counter = 0;
for (LL k = 0; k + j < N; ++k) { // 何文字目か
if (i + k < j) {
if (S[i + k] == S[j + k]) {
counter++;
} else {
break;
}
}
}
// cerr <<i<<" : "<<j <<" : " << counter << endl;
counter_max = max(counter, counter_max);
}
}
cout << counter_max;
}
int main() {
func();
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
typedef long long LL;
typedef long double LD;
void func() {
LL N, K;
cin >> N;
string S;
cin >> S;
LL counter_max = 0;
for (LL i = 0; i < N; ++i) { // 部分文字列1の先頭
for (LL j = i + counter_max + 1; j < N; ++j) { // 部分文字列2の先頭
if (i > 0 && S[i - 1] == S[j - 1]) {
continue;
}
LL counter = 0;
for (LL k = 0; k + j < N; ++k) { // 何文字目か
if (i + k < j) {
if (S[i + k] == S[j + k]) {
counter++;
} else {
break;
}
}
}
// cerr <<i<<" : "<<j <<" : " << counter << endl;
counter_max = max(counter, counter_max);
}
}
cout << counter_max;
}
int main() {
func();
return 0;
}
| insert | 16 | 16 | 16 | 19 | TLE | |
p02913 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#define MOD 1000000007
#define MOD2 998244353
#define INF 100000000
// #define MOD 922337203685419LL
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i > (b); i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n - 1, -1)
#define ALL(obj) (obj).begin(), (obj).end()
inline ll madd(ll a, ll b) {
a %= MOD;
b %= MOD;
return (a + b) % MOD;
}
inline ll msub(ll a, ll b) {
a %= MOD;
b %= MOD;
a += MOD;
return (a - b) % MOD;
}
inline ll mmul(ll a, ll b) {
a %= MOD;
b %= MOD;
return (a * b) % MOD;
}
inline ll mpow(ll a, ll r) {
long long res = 1;
while (r > 0) {
if (r & 1)
res = res * a % MOD;
a = a * a % MOD;
r >>= 1;
}
return res;
}
inline ll minv(ll a) {
a %= MOD;
ll b = MOD, u = 0, v = 1;
while (a) {
ll t = b / a;
b -= t * a;
swap(a, b);
u -= t * v;
swap(u, v);
}
if (u < 0)
u += MOD;
return u;
}
inline ll mdiv(ll a, ll b) {
a %= MOD;
a *= minv(b);
return a % MOD;
}
// ll fact[]
// inline ll combi(int a, int b) {
// return mmul(fact[a], mmul(fact_inv[b], fact_inv[a - b]));
// }
struct UnionFind {
vector<int> data;
UnionFind(int size) : data(size, -1) {}
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x != y) {
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
}
return x != y;
}
bool same(int x, int y) { return root(x) == root(y); }
int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
int size(int x) { return -data[root(x)]; }
};
struct edge {
ll to, cost;
};
int main() {
ll power[2501];
power[0] = 1;
REP(i, 2500) power[i + 1] = (power[i] * 29) % MOD;
ll power2[2501];
power2[0] = 1;
REP(i, 2500) power2[i + 1] = (power2[i] * 29) % MOD2;
int n;
cin >> n;
char s[5001];
scanf("%s", s);
vll hash_list;
ll ha = 0;
hash_list.push_back(0);
REP(i, n) {
ha *= 29;
ha += s[i] - 'a' + 2;
ha %= MOD;
hash_list.push_back(ha);
}
vll hash_list2;
ll ha2 = 0;
hash_list2.push_back(0);
REP(i, n) {
ha2 *= 29;
ha2 += s[i] - 'a' + 2;
ha2 %= MOD2;
hash_list2.push_back(ha2);
}
RFOR(j, n / 2, 0) {
map<ll, int> ma;
REP(i, n - j + 1) {
ll x = (hash_list[i] * power[j]) % MOD;
x = (hash_list[i + j] + MOD - x) % MOD;
if (ma.find(x) == ma.end())
ma[x] = i;
else if (i >= ma[x] + j) {
ll xx = (hash_list2[i] * power2[j]) % MOD2;
xx = (hash_list2[i + j] + MOD2 - xx) % MOD2;
ll xxx = (hash_list2[ma[x]] * power2[j]) % MOD2;
xxx = (hash_list2[ma[x] + j] + MOD2 - xxx) % MOD2;
if (xx == xxx) {
cout << j;
return 0;
}
}
}
}
cout << "0";
return 0;
}
| #define _CRT_SECURE_NO_WARNINGS
#define MOD 1000000007
#define MOD2 998244353
#define INF 100000000
// #define MOD 922337203685419LL
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i > (b); i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n - 1, -1)
#define ALL(obj) (obj).begin(), (obj).end()
inline ll madd(ll a, ll b) {
a %= MOD;
b %= MOD;
return (a + b) % MOD;
}
inline ll msub(ll a, ll b) {
a %= MOD;
b %= MOD;
a += MOD;
return (a - b) % MOD;
}
inline ll mmul(ll a, ll b) {
a %= MOD;
b %= MOD;
return (a * b) % MOD;
}
inline ll mpow(ll a, ll r) {
long long res = 1;
while (r > 0) {
if (r & 1)
res = res * a % MOD;
a = a * a % MOD;
r >>= 1;
}
return res;
}
inline ll minv(ll a) {
a %= MOD;
ll b = MOD, u = 0, v = 1;
while (a) {
ll t = b / a;
b -= t * a;
swap(a, b);
u -= t * v;
swap(u, v);
}
if (u < 0)
u += MOD;
return u;
}
inline ll mdiv(ll a, ll b) {
a %= MOD;
a *= minv(b);
return a % MOD;
}
// ll fact[]
// inline ll combi(int a, int b) {
// return mmul(fact[a], mmul(fact_inv[b], fact_inv[a - b]));
// }
struct UnionFind {
vector<int> data;
UnionFind(int size) : data(size, -1) {}
bool unite(int x, int y) {
x = root(x);
y = root(y);
if (x != y) {
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
}
return x != y;
}
bool same(int x, int y) { return root(x) == root(y); }
int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
int size(int x) { return -data[root(x)]; }
};
struct edge {
ll to, cost;
};
int main() {
ll power[2501];
power[0] = 1;
REP(i, 2500) power[i + 1] = (power[i] * 29) % MOD;
ll power2[2501];
power2[0] = 1;
REP(i, 2500) power2[i + 1] = (power2[i] * 29) % MOD2;
int n;
cin >> n;
char s[5001];
scanf("%s", s);
vll hash_list;
ll ha = 0;
hash_list.push_back(0);
REP(i, n) {
ha *= 29;
ha += s[i] - 'a' + 2;
ha %= MOD;
hash_list.push_back(ha);
}
vll hash_list2;
ll ha2 = 0;
hash_list2.push_back(0);
REP(i, n) {
ha2 *= 29;
ha2 += s[i] - 'a' + 2;
ha2 %= MOD2;
hash_list2.push_back(ha2);
}
RFOR(j, n / 2, 0) {
unordered_map<ll, int> ma;
REP(i, n - j + 1) {
ll x = (hash_list[i] * power[j]) % MOD;
x = (hash_list[i + j] + MOD - x) % MOD;
if (ma.find(x) == ma.end())
ma[x] = i;
else if (i >= ma[x] + j) {
ll xx = (hash_list2[i] * power2[j]) % MOD2;
xx = (hash_list2[i + j] + MOD2 - xx) % MOD2;
ll xxx = (hash_list2[ma[x]] * power2[j]) % MOD2;
xxx = (hash_list2[ma[x] + j] + MOD2 - xxx) % MOD2;
if (xx == xxx) {
cout << j;
return 0;
}
}
}
}
cout << "0";
return 0;
}
| replace | 150 | 151 | 150 | 151 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
#define bit(n) (1LL << (n))
#define sz(x) ((int)(x).size())
typedef long long ll;
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
typedef unsigned long long ull;
unsigned int BASE;
void init_RH() {
srand(time(NULL));
BASE = rand() % RAND_MAX + 129;
}
struct RollingHash {
const ull MASK30 = (1ULL << 30) - 1;
const ull MASK31 = (1ULL << 31) - 1;
const ull MODrh = (1ULL << 61) - 1;
const ull POSITIVIZER = MODrh * ((1ULL << 3) - 1);
unsigned int Base;
vector<ull> hash;
vector<ull> powMemo;
RollingHash(string s, unsigned int BASE) {
Base = BASE;
powMemo = vector<ull>(sz(s) + 1);
powMemo[0] = 1;
repp(i, 1, sz(powMemo) - 1) {
powMemo[i] = CalcMod(Mul(powMemo[i - 1], Base));
}
hash = vector<ull>(sz(s) + 1);
rep(i, sz(s)) { hash[i + 1] = CalcMod(Mul(hash[i], Base) + s[i]); }
}
ull Slice(int begin, int length) {
return CalcMod(hash[begin + length] + POSITIVIZER -
Mul(hash[begin], powMemo[length]));
}
ull Mul(ull l, ull r) {
ull lu = l >> 31;
ull ld = l & MASK31;
ull ru = r >> 31;
ull rd = r & MASK31;
ull middleBit = ld * ru + lu * rd;
return ((lu * ru) << 1) + ld * rd + ((middleBit & MASK30) << 31) +
(middleBit >> 30);
}
ull CalcMod(ull val) {
val = (val & MODrh) + (val >> 61);
if (val > MODrh)
val -= MODrh;
return val;
}
};
int main() {
init_RH();
int N;
cin >> N;
string S;
cin >> S;
RollingHash R(S, BASE);
int ans = 0;
repp(len, 1, N) {
map<ull, int> m;
rep(i, N - len + 1) {
ull hash = R.Slice(i, len);
if (m.find(hash) == m.end()) {
m[hash] = i;
} else {
if (i - m[hash] >= len)
ans = len;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repp(i, a, b) for (int i = a; i <= (b); ++i)
#define repr(i, a, b) for (int i = a; i >= (b); --i)
#define bit(n) (1LL << (n))
#define sz(x) ((int)(x).size())
typedef long long ll;
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
typedef unsigned long long ull;
unsigned int BASE;
void init_RH() {
srand(time(NULL));
BASE = rand() % RAND_MAX + 129;
}
struct RollingHash {
const ull MASK30 = (1ULL << 30) - 1;
const ull MASK31 = (1ULL << 31) - 1;
const ull MODrh = (1ULL << 61) - 1;
const ull POSITIVIZER = MODrh * ((1ULL << 3) - 1);
unsigned int Base;
vector<ull> hash;
vector<ull> powMemo;
RollingHash(string s, unsigned int BASE) {
Base = BASE;
powMemo = vector<ull>(sz(s) + 1);
powMemo[0] = 1;
repp(i, 1, sz(powMemo) - 1) {
powMemo[i] = CalcMod(Mul(powMemo[i - 1], Base));
}
hash = vector<ull>(sz(s) + 1);
rep(i, sz(s)) { hash[i + 1] = CalcMod(Mul(hash[i], Base) + s[i]); }
}
ull Slice(int begin, int length) {
return CalcMod(hash[begin + length] + POSITIVIZER -
Mul(hash[begin], powMemo[length]));
}
ull Mul(ull l, ull r) {
ull lu = l >> 31;
ull ld = l & MASK31;
ull ru = r >> 31;
ull rd = r & MASK31;
ull middleBit = ld * ru + lu * rd;
return ((lu * ru) << 1) + ld * rd + ((middleBit & MASK30) << 31) +
(middleBit >> 30);
}
ull CalcMod(ull val) {
val = (val & MODrh) + (val >> 61);
if (val > MODrh)
val -= MODrh;
return val;
}
};
int main() {
init_RH();
int N;
cin >> N;
string S;
cin >> S;
RollingHash R(S, BASE);
int ans = 0;
rep(i, N) {
repp(j, i, N - 1) {
while ((ans < j - i) && (j + ans < N) &&
R.Slice(i, ans + 1) == R.Slice(j, ans + 1))
ans++;
}
}
cout << ans << endl;
} | replace | 93 | 103 | 93 | 98 | TLE | |
p02913 | C++ | Runtime Error | // #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long
#define ll long long
auto start_time = system_clock::now();
//@formatter:off
#ifdef _DEBUG
// 区間削除は出来ない
template <class T> struct my_pbds_tree {
set<T> s;
auto begin() { return s.begin(); }
auto end() { return s.end(); }
auto rbegin() { return s.rbegin(); }
auto rend() { return s.rend(); }
auto empty() { return s.empty(); }
auto size() { return s.size(); }
void clear() { s.clear(); }
template <class U> void insert(U v) { s.insert(v); }
template <class U> void operator+=(U v) { insert(v); }
template <class F> auto erase(F v) { return s.erase(v); }
template <class U> auto find(U v) { return s.find(v); }
template <class U> auto lower_bound(U v) { return s.lower_bound(v); }
template <class U> auto upper_bound(U v) { return s.upper_bound(v); }
auto find_by_order(ll k) {
auto it = s.begin();
for (ll i = 0; i < k; i++)
it++;
return it;
}
auto order_of_key(ll v) {
auto it = s.begin();
ll i = 0;
for (; it != s.end() && *it < v; i++)
it++;
return i;
}
};
#define pbds(T) my_pbds_tree<T>
#else
#define unordered_map __gnu_pbds::gp_hash_table
// find_by_order(k) k番目のイテレーター
// order_of_key(k) k以上が前から何番目か
#define pbds(U) \
__gnu_pbds::tree<U, __gnu_pbds::null_type, less<U>, __gnu_pbds::rb_tree_tag, \
__gnu_pbds::tree_order_statistics_node_update>
#endif
struct xorshift {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
size_t operator()(std::pair<ll, ll> x) const {
ll v = ((x.first) << 32) | x.second;
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(v + FIXED_RANDOM);
}
};
template <class U, class L>
void operator+=(
__gnu_pbds::tree<U, __gnu_pbds::null_type, less<U>, __gnu_pbds::rb_tree_tag,
__gnu_pbds::tree_order_statistics_node_update> &s,
L v) {
s.insert(v);
}
// 衝突対策
#define ws wszzzz
template <class A, class B, class C> struct T2 {
A f;
B s;
C t;
T2() { f = 0, s = 0, t = 0; }
T2(A f, B s, C t) : f(f), s(s), t(t) {}
bool operator<(const T2 &r) const {
return f != r.f ? f < r.f
: s != r.s ? s < r.s
: t < r.t; /*return f != r.f ? f > r.f : s != r.s ?n s >
r.s : t > r.t; 大きい順 */
}
bool operator>(const T2 &r) const {
return f != r.f ? f > r.f
: s != r.s ? s > r.s
: t > r.t; /*return f != r.f ? f > r.f : s != r.s ? s >
r.s : t > r.t; 小さい順 */
}
bool operator==(const T2 &r) const {
return f == r.f && s == r.s && t == r.t;
}
bool operator!=(const T2 &r) const {
return f != r.f || s != r.s || t != r.t;
}
};
template <class A, class B, class C, class D> struct F2 {
A a;
B b;
C c;
D d;
F2() { a = 0, b = 0, c = 0, d = 0; }
F2(A a, B b, C c, D d) : a(a), b(b), c(c), d(d) {}
bool operator<(const F2 &r) const {
return a != r.a ? a < r.a
: b != r.b ? b < r.b
: c != r.c ? c < r.c
: d < r.d; /* return a != r.a ? a > r.a : b != r.b ? b
> r.b : c != r.c ? c > r.c : d > r.d;*/
}
bool operator>(const F2 &r) const {
return a != r.a ? a > r.a
: b != r.b ? b > r.b
: c != r.c ? c > r.c
: d > r.d; /* return a != r.a ? a < r.a : b != r.b
? b < r.b : c != r.c ? c < r.c : d < r.d;*/
}
bool operator==(const F2 &r) const {
return a == r.a && b == r.b && c == r.c && d == r.d;
}
bool operator!=(const F2 &r) const {
return a != r.a || b != r.b || c != r.c || d != r.d;
}
ll operator[](ll i) {
assert(i < 4);
return i == 0 ? a : i == 1 ? b : i == 2 ? c : d;
}
};
typedef T2<ll, ll, ll> T;
typedef F2<ll, ll, ll, ll> F;
T mt(ll a, ll b, ll c) { return T(a, b, c); }
//@マクロ省略系 型,構造
#define double long double
#define ull unsigned long long
using dou = double;
using itn = int;
using str = string;
using bo = bool;
#define au auto
using P = pair<ll, ll>;
#define fi first
#define se second
#define beg begin
#define rbeg rbegin
#define con continue
#define bre break
#define brk break
#define is ==
#define el else
#define elf else if
#define wh while
#define upd update
#define maxq 1
#define minq -1
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MALLOC(type, len) (type *)malloc((len) * sizeof(type))
#define lam(right) [&](ll &p) { return p right; }
// マクロ省略系 コンテナ
using vi = vector<ll>;
using vb = vector<bool>;
using vs = vector<string>;
using vd = vector<double>;
using vc = vector<char>;
using vp = vector<P>;
using vt = vector<T>;
#define vec vector
#define o_vvt(o1, o2, o3, o4, name, ...) name
#define vvt0(t) vec<vec<t>>
#define vvt1(t, a) vec<vec<t>> a
#define vvt2(t, a, b) vec<vec<t>> a(b)
#define vvt3(t, a, b, c) vec<vec<t>> a(b, vec<t>(c))
#define vvt4(t, a, b, c, d) vec<vec<t>> a(b, vec<t>(c, d))
#define vvi(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(ll, __VA_ARGS__)
#define vvb(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(bool, __VA_ARGS__)
#define vvs(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(string, __VA_ARGS__)
#define vvd(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(double, __VA_ARGS__)
#define vvc(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(char, __VA_ARGS__)
#define vvp(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(P, __VA_ARGS__)
#define vvt(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(T, __VA_ARGS__)
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
#define vni(name, ...) auto name = make_v<ll>(__VA_ARGS__)
#define vnb(name, ...) auto name = make_v<bool>(__VA_ARGS__)
#define vns(name, ...) auto name = make_v<string>(__VA_ARGS__)
#define vnd(name, ...) auto name = make_v<double>(__VA_ARGS__)
#define vnc(name, ...) auto name = make_v<char>(__VA_ARGS__)
#define vnp(name, ...) auto name = make_v<P>(__VA_ARGS__)
#define PQ priority_queue<ll, vector<ll>, greater<ll>>
#define tos to_string
using mapi = map<ll, ll>;
using mapp = map<P, ll>;
using mapd = map<dou, ll>;
using mapc = map<char, ll>;
using maps = map<str, ll>;
using seti = set<ll>;
using setd = set<dou>;
using setc = set<char>;
using sets = set<str>;
using qui = queue<ll>;
#define bset bitset
#define uset unordered_set
#define useti unordered_set<ll, ll, xorshift>
#define mset multiset
#define mseti multiset<ll>
#define umap unordered_map
#define umapi unordered_map<ll, ll, xorshift>
#define umapp unordered_map<P, ll, xorshift>
#define mmap multimap
template <class T> struct pq {
priority_queue<T, vector<T>, greater<T>> q; /*小さい順*/
T su = 0;
void clear() {
q = priority_queue<T, vector<T>, greater<T>>();
su = 0;
}
void operator+=(T v) {
su += v;
q.push(v);
}
T sum() { return su; }
T top() { return q.top(); }
void pop() {
su -= q.top();
q.pop();
}
T poll() {
T ret = q.top();
su -= ret;
q.pop();
return ret;
}
ll size() { return q.size(); }
};
template <class T> struct pqg {
priority_queue<T> q; /*大きい順*/
T su = 0;
void clear() {
q = priority_queue<T>();
su = 0;
}
void operator+=(T v) {
su += v;
q.push(v);
}
T sum() { return su; }
T top() { return q.top(); }
void pop() {
su -= q.top();
q.pop();
}
T poll() {
T ret = q.top();
su -= ret;
q.pop();
return ret;
}
ll size() { return q.size(); }
};
#define pqi pq<ll>
#define pqgi pqg<ll>
// マクロ 繰り返し
#define o_rep(o1, o2, o3, o4, name, ...) name
#define rep1(n) for (ll rep1i = 0, rep1lim = n; rep1i < rep1lim; ++rep1i)
#define rep2(i, n) for (ll i = 0, rep2lim = n; i < rep2lim; ++i)
#define rep3(i, m, n) for (ll i = m, rep3lim = n; i < rep3lim; ++i)
#define rep4(i, m, n, ad) for (ll i = m, rep4lim = n; i < rep4lim; i += ad)
#define rep(...) o_rep(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rer2(i, n) for (ll i = n; i >= 0; i--)
#define rer3(i, m, n) for (ll i = m, rer3lim = n; i >= rer3lim; i--)
#define rer4(i, m, n, dec) for (ll i = m, rer4lim = n; i >= rer4lim; i -= dec)
#define rer(...) o_rep(__VA_ARGS__, rer4, rer3, rer2, )(__VA_ARGS__)
#define reps2(i, j, n) \
for (ll i = 0, reps2lim = n; i < reps2lim; ++i) \
for (ll j = 0; j < reps2lim; ++j)
#define reps3(i, j, k, n) \
for (ll i = 0, reps3lim = n; i < reps3lim; ++i) \
for (ll j = 0; j < reps3lim; ++j) \
for (ll k = 0; k < reps3lim; ++k)
#define reps4(i, j, k, l, n) \
for (ll i = 0, reps4lim = n; i < reps4lim; ++i) \
for (ll j = 0; j < reps4lim; ++j) \
for (ll k = 0; k < reps4lim; ++k) \
for (ll l = 0; l < reps4lim; ++l)
#define o_reps(o1, o2, o3, o4, o5, name, ...) name
#define reps(...) o_reps(__VA_ARGS__, reps4, reps3, reps2, rep2, )(__VA_ARGS__)
#define repss(i, j, k, a, b, c) \
for (ll i = 0; i < a; ++i) \
for (ll j = 0; j < b; ++j) \
for (ll k = 0; k < c; ++k)
#define fora(a, b) for (auto &&a : b)
// インデックスを前後含めて走査
#define fori(i, s, len) \
for (int i = s, prev = (s == 0) ? len - 1 : s - 1, \
next = (s == len - 1) ? 0 : s + 1, cou = 0; \
cou < len; \
cou++, prev = i, i = next, next = (next == len - 1) ? 0 : next + 1)
#define form(st, l, r) \
for (auto &&it = st.lower_bound(l); it != st.end() && (*it).fi < r; ++it)
#define forit(st, l, r) \
for (auto &&it = st.lower_bound(l); it != st.end() && (*it) < r;)
// マクロ 定数
#define k3 1010
#define k4 10101
#define k5 101010
#define k6 1010101
#define k7 10101010
const ll inf = (ll)1e9 + 100;
const ll linf = (ll)1e18 + 100;
const char infc = '{';
const string infs = "{";
const double eps = 1e-9;
const double PI = 3.1415926535897932384626433832795029L;
ll ma = numeric_limits<ll>::min();
ll mi = numeric_limits<ll>::max();
// マクロ省略形 関数等
#define arsz(a) (sizeof(a) / sizeof(a[0]))
#define sz(a) ((ll)(a).size())
#define mp make_pair
#define pb pop_back
#define pf push_front
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
constexpr bool ev(ll a) { return !(a & 1); }
constexpr bool od(ll a) { return (a & 1); }
//@拡張系 こう出来るべきというもの
// 埋め込み 存在を意識せずに機能を増やされているもの
//@formatter:on
namespace std {
template <> class hash<std::pair<signed, signed>> {
public:
size_t operator()(const std::pair<signed, signed> &x) const {
return hash<ll>()(((ll)x.first << 32) | x.second);
}
};
template <> class hash<std::pair<ll, ll>> {
public
: /*大きいllが渡されると、<<32でオーバーフローするがとりあえず問題ないと判断*/
size_t operator()(const std::pair<ll, ll> &x) const {
return hash<ll>()(((ll)x.first << 32) | x.second);
}
};
} // namespace std
//@formatter:off
// stream まとめ
istream &operator>>(istream &iss, P &a) {
iss >> a.first >> a.second;
return iss;
}
template <typename T> istream &operator>>(istream &iss, vector<T> &vec) {
for (T &x : vec)
iss >> x;
return iss;
}
template <class T, class U> ostream &operator<<(ostream &os, pair<T, U> p) {
os << p.fi << " " << p.se << endl;
return os;
}
ostream &operator<<(ostream &os, T p) {
os << p.f << " " << p.s << " " << p.t;
return os;
}
ostream &operator<<(ostream &os, F p) {
os << p.a << " " << p.b << " " << p.c << " " << p.d;
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
for (ll i = 0; i < vec.size(); ++i)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<vector<T>> &vec) {
for (ll i = 0; i < vec.size(); ++i) {
for (ll j = 0; j < vec[i].size(); ++j) {
os << vec[i][j] << " ";
}
os << endl;
}
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &m) {
for (auto &&v : m)
os << v;
return os;
}
template <class T> ostream &operator<<(ostream &os, set<T> s) {
fora(v, s) { os << v << " "; }
return os;
}
template <class T> ostream &operator<<(ostream &os, deque<T> a) {
fora(v, a) os << v << " ";
return os;
}
template <typename W, typename H> void resize(vector<W> &vec, const H head) {
vec.resize(head);
}
template <typename W, typename H, typename... T>
void resize(vector<W> &vec, const H &head, const T... tail) {
vec.resize(head);
for (auto &v : vec)
resize(v, tail...);
}
template <typename T, typename F> bool all_of2(T &v, F f) { return f(v); }
template <typename T, typename F> bool all_of2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (!all_of2(v[i], f))
return false;
}
return true;
}
template <typename T, typename F> bool any_of2(T &v, F f) { return f(v); }
template <typename T, typename F> bool any_of2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (any_of2(v[i], f))
return true;
}
return false;
}
template <typename T, typename F> bool none_of2(T &v, F f) { return f(v); }
template <typename T, typename F> bool none_of2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (none_of2(v[i], f))
return false;
}
return true;
}
template <typename T, typename F> bool find_if2(T &v, F f) { return f(v); }
template <typename T, typename F> ll find_if2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (find_if2(v[i], f))
return i;
}
return sz(v);
}
template <typename T, typename F> bool rfind_if2(T &v, F f) { return f(v); }
template <typename T, typename F> ll rfind_if2(vector<T> &v, F f) {
rer(i, sz(v) - 1) {
if (rfind_if2(v[i], f))
return i;
}
return -1;
}
template <class T> bool contains(string &s, const T &v) {
return s.find(v) != string::npos;
}
template <typename T> bool contains(vector<T> &v, const T &val) {
return std::find(v.begin(), v.end(), val) != v.end();
}
template <typename T, typename F> bool contains_if2(vector<T> &v, F f) {
return find_if(v.begin(), v.end(), f) != v.end();
}
template <typename T, typename F> ll count_if2(T &v, F f) { return f(v); }
template <typename T, typename F> ll count_if2(vector<T> &vec, F f) {
ll ret = 0;
fora(v, vec) ret += count_if2(v, f);
return ret;
}
template <typename T, typename F> void for_each2(T &v, F f) { f(v); }
template <typename T, typename F> void for_each2(vector<T> &vec, F f) {
fora(v, vec) for_each2(v, f);
}
template <typename W> ll count_od(vector<W> &a) {
return count_if2(a, [](ll v) { return v & 1; });
}
template <typename W> ll count_ev(vector<W> &a) {
return count_if2(a, [](ll v) { return !(v & 1); });
}
#define all_of(a, right) all_of2(a, lam(right))
#define any_of(a, right) any_of2(a, lam(right))
#define none_of(a, right) none_of2(a, lam(right))
#define find_if(a, right) find_if2(a, lam(right))
#define rfind_if(a, right) rfind_if2(a, lam(right))
#define contains_if(a, right) contains_if2(a, lam(right))
#define count_if(a, right) count_if2(a, lam(right))
#define for_each(a, right) \
do { \
fora(v, a) { v right; } \
} while (0)
template <class T, class U> void replace(vector<T> &a, T key, U v) {
replace(a.begin(), a.end(), key, v);
}
void replace(str &a, char key, str v) {
if (v == "")
a.erase(remove(all(a), key), a.end());
}
void replace(str &a, char key, char v) { replace(all(a), key, v); }
// keyと同じかどうか01で置き換える
template <class T, class U> void replace(vector<T> &a, U k) {
rep(i, sz(a)) a[i] = a[i] == k;
}
template <class T, class U> void replace(vector<vector<T>> &a, U k) {
rep(i, sz(a)) rep(j, sz(a[0])) a[i][j] = a[i][j] == k;
}
template <class T> void replace(T &a) { replace(a, '#'); }
void replace(str &a, str key, str v) {
stringstream t;
ll kn = sz(key);
std::string::size_type Pos(a.find(key));
ll l = 0;
while (Pos != std::string::npos) {
t << a.substr(l, Pos - l);
t << v;
l = Pos + kn;
Pos = a.find(key, Pos + kn);
}
t << a.substr(l, sz(a) - l);
a = t.str();
}
template <class T> bool includes(vector<T> &a, vector<T> &b) {
vi c = a;
vi d = b;
sort(all(c));
sort(all(d));
return includes(all(c), all(d));
}
template <class T> bool is_permutation(vector<T> &a, vector<T> &b) {
return is_permutation(all(a), all(b));
}
template <class T> bool next_permutation(vector<T> &a) {
return next_permutation(all(a));
}
void iota(vector<ll> &ve, ll s, ll n) {
ve.resize(n);
iota(all(ve), s);
}
vi iota(ll s, ll len) {
vi ve(len);
iota(all(ve), s);
return ve;
}
template <class A, class B> auto vtop(vector<A> &a, vector<B> &b) {
assert(sz(a) == sz(b)); /*stringを0で初期化できない */
vector<pair<A, B>> res;
rep(i, sz(a)) res.eb(a[i], b[i]);
return res;
}
template <class A, class B>
void ptov(vector<pair<A, B>> &p, vector<A> &a, vector<B> &b) {
a.resize(sz(p)), b.resize(sz(p));
rep(i, sz(p)) a[i] = p[i].fi, b[i] = p[i].se;
}
template <class A, class B, class C>
auto vtot(vector<A> &a, vector<B> &b, vector<C> &c) {
assert(sz(a) == sz(b) && sz(b) == sz(c));
vector<T2<A, B, C>> res;
rep(i, sz(a)) res.eb(a[i], b[i], c[i]);
return res;
}
template <class A, class B, class C, class D>
auto vtof(vector<A> &a, vector<B> &b, vector<C> &c, vector<D> &d) {
assert(sz(a) == sz(b) && sz(b) == sz(c) && sz(c) == sz(d));
vector<F2<A, B, C, D>> res;
rep(i, sz(a)) res.eb(a[i], b[i], c[i], d[i]);
return res;
}
enum pcomparator { fisi, fisd, fdsi, fdsd, sifi, sifd, sdfi, sdfd };
enum tcomparator {
fisiti,
fisitd,
fisdti,
fisdtd,
fdsiti,
fdsitd,
fdsdti,
fdsdtd,
fitisi,
fitisd,
fitdsi,
fitdsd,
fdtisi,
fdtisd,
fdtdsi,
fdtdsd,
sifiti,
sifitd,
sifdti,
sifdtd,
sdfiti,
sdfitd,
sdfdti,
sdfdtd,
sitifi,
sitifd,
sitdfi,
sitdfd,
sdtifi,
sdtifd,
sdtdfi,
sdfdfd,
tifisi,
tifisd,
tifdsi,
tifdsd,
tdfisi,
tdfisd,
tdfdsi,
tdfdsd,
tisifi,
tisifd,
tisdfi,
tisdfd,
tdsifi,
tdsifd,
tdsdfi,
tdsdfd
};
template <class A, class B> void sort(vector<pair<A, B>> &a, pcomparator type) {
typedef pair<A, B> U;
if (type == fisi)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi < r.fi : l.se < r.se; });
else if (type == fisd)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi < r.fi : l.se > r.se; });
else if (type == fdsi)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi > r.fi : l.se < r.se; });
else if (type == fdsd)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi > r.fi : l.se > r.se; });
else if (type == sifi)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se < r.se : l.fi < r.fi; });
else if (type == sifd)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se < r.se : l.fi > r.fi; });
else if (type == sdfi)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se > r.se : l.fi < r.fi; });
else if (type == sdfd)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se > r.se : l.fi > r.fi; });
};
template <class U> void sort(vector<U> &a, pcomparator type) {
if (type == fisi)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f < r.f : l.s < r.s; });
else if (type == fisd)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f < r.f : l.s > r.s; });
else if (type == fdsi)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f > r.f : l.s < r.s; });
else if (type == fdsd)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f > r.f : l.s > r.s; });
else if (type == sifi)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s < r.s : l.f < r.f; });
else if (type == sifd)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s < r.s : l.f > r.f; });
else if (type == sdfi)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s > r.s : l.f < r.f; });
else if (type == sdfd)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s > r.s : l.f > r.f; });
};
template <class A, class B, class C, class D>
void sort(vector<F2<A, B, C, D>> &a, pcomparator type) {
typedef F2<A, B, C, D> U;
if (type == fisi)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a < r.a : l.b < r.b; });
else if (type == fisd)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a < r.a : l.b > r.b; });
else if (type == fdsi)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a > r.a : l.b < r.b; });
else if (type == fdsd)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a > r.a : l.b > r.b; });
else if (type == sifi)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b < r.b : l.a < r.a; });
else if (type == sifd)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b < r.b : l.a > r.a; });
else if (type == sdfi)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b > r.b : l.a < r.a; });
else if (type == sdfd)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b > r.b : l.a > r.a; });
};
template <class U> void sort(vector<U> &a, tcomparator type) {
if (type == 0)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s < r.s : l.t < r.t;
});
else if (type == 1)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s < r.s : l.t > r.t;
});
else if (type == 2)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s > r.s : l.t < r.t;
});
else if (type == 3)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s > r.s : l.t > r.t;
});
else if (type == 4)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s < r.s : l.t < r.t;
});
else if (type == 5)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s < r.s : l.t > r.t;
});
else if (type == 6)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s > r.s : l.t < r.t;
});
else if (type == 7)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s > r.s : l.t > r.t;
});
else if (type == 8)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t < r.t : l.s < r.s;
});
else if (type == 9)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t < r.t : l.s > r.s;
});
else if (type == 10)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t > r.t : l.s < r.s;
});
else if (type == 11)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t > r.t : l.s > r.s;
});
else if (type == 12)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t < r.t : l.s < r.s;
});
else if (type == 13)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t < r.t : l.s > r.s;
});
else if (type == 14)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t > r.t : l.s < r.s;
});
else if (type == 15)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t > r.t : l.s > r.s;
});
else if (type == 16)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f < r.f : l.t < r.t;
});
else if (type == 17)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f < r.f : l.t > r.t;
});
else if (type == 18)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f > r.f : l.t < r.t;
});
else if (type == 19)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f > r.f : l.t > r.t;
});
else if (type == 20)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f < r.f : l.t < r.t;
});
else if (type == 21)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f < r.f : l.t > r.t;
});
else if (type == 22)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f > r.f : l.t < r.t;
});
else if (type == 23)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f > r.f : l.t > r.t;
});
else if (type == 24)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t < r.t : l.f < r.f;
});
else if (type == 25)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t < r.t : l.f > r.f;
});
else if (type == 26)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t > r.t : l.f < r.f;
});
else if (type == 27)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t > r.t : l.f > r.f;
});
else if (type == 28)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t < r.t : l.f < r.f;
});
else if (type == 29)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t < r.t : l.f > r.f;
});
else if (type == 30)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t > r.t : l.f < r.f;
});
else if (type == 31)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t > r.t : l.f > r.f;
});
else if (type == 32)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f < r.f : l.s < r.s;
});
else if (type == 33)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f < r.f : l.s > r.s;
});
else if (type == 34)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f > r.f : l.s < r.s;
});
else if (type == 35)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f > r.f : l.s > r.s;
});
else if (type == 36)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f < r.f : l.s < r.s;
});
else if (type == 37)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f < r.f : l.s > r.s;
});
else if (type == 38)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f > r.f : l.s < r.s;
});
else if (type == 39)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f > r.f : l.s > r.s;
});
else if (type == 40)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s < r.s : l.f < r.f;
});
else if (type == 41)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s < r.s : l.f > r.f;
});
else if (type == 42)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s > r.s : l.f < r.f;
});
else if (type == 43)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s > r.s : l.f > r.f;
});
else if (type == 44)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s < r.s : l.f < r.f;
});
else if (type == 45)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s < r.s : l.f > r.f;
});
else if (type == 46)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s > r.s : l.f < r.f;
});
else if (type == 47)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s > r.s : l.f > r.f;
});
}
template <class A, class B, class C, class D>
void sort(vector<F2<A, B, C, D>> &a, tcomparator type) {
typedef F2<A, B, C, D> U;
if (type == 0)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b < r.b : l.c < r.c;
});
else if (type == 1)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b < r.b : l.c > r.c;
});
else if (type == 2)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b > r.b : l.c < r.c;
});
else if (type == 3)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b > r.b : l.c > r.c;
});
else if (type == 4)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b < r.b : l.c < r.c;
});
else if (type == 5)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b < r.b : l.c > r.c;
});
else if (type == 6)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b > r.b : l.c < r.c;
});
else if (type == 7)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b > r.b : l.c > r.c;
});
else if (type == 8)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c < r.c : l.b < r.b;
});
else if (type == 9)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c < r.c : l.b > r.b;
});
else if (type == 10)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c > r.c : l.b < r.b;
});
else if (type == 11)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c > r.c : l.b > r.b;
});
else if (type == 12)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c < r.c : l.b < r.b;
});
else if (type == 13)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c < r.c : l.b > r.b;
});
else if (type == 14)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c > r.c : l.b < r.b;
});
else if (type == 15)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c > r.c : l.b > r.b;
});
else if (type == 16)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a < r.a : l.c < r.c;
});
else if (type == 17)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a < r.a : l.c > r.c;
});
else if (type == 18)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a > r.a : l.c < r.c;
});
else if (type == 19)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a > r.a : l.c > r.c;
});
else if (type == 20)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a < r.a : l.c < r.c;
});
else if (type == 21)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a < r.a : l.c > r.c;
});
else if (type == 22)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a > r.a : l.c < r.c;
});
else if (type == 23)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a > r.a : l.c > r.c;
});
else if (type == 24)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c < r.c : l.a < r.a;
});
else if (type == 25)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c < r.c : l.a > r.a;
});
else if (type == 26)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c > r.c : l.a < r.a;
});
else if (type == 27)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c > r.c : l.a > r.a;
});
else if (type == 28)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c < r.c : l.a < r.a;
});
else if (type == 29)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c < r.c : l.a > r.a;
});
else if (type == 30)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c > r.c : l.a < r.a;
});
else if (type == 31)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c > r.c : l.a > r.a;
});
else if (type == 32)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a < r.a : l.b < r.b;
});
else if (type == 33)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a < r.a : l.b > r.b;
});
else if (type == 34)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a > r.a : l.b < r.b;
});
else if (type == 35)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a > r.a : l.b > r.b;
});
else if (type == 36)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a < r.a : l.b < r.b;
});
else if (type == 37)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a < r.a : l.b > r.b;
});
else if (type == 38)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a > r.a : l.b < r.b;
});
else if (type == 39)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a > r.a : l.b > r.b;
});
else if (type == 40)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b < r.b : l.a < r.a;
});
else if (type == 41)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b < r.b : l.a > r.a;
});
else if (type == 42)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b > r.b : l.a < r.a;
});
else if (type == 43)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b > r.b : l.a > r.a;
});
else if (type == 44)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b < r.b : l.a < r.a;
});
else if (type == 45)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b < r.b : l.a > r.a;
});
else if (type == 46)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b > r.b : l.a < r.a;
});
else if (type == 47)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b > r.b : l.a > r.a;
});
}
void sort(string &a) { sort(all(a)); }
template <class T> void sort(vector<T> &a) { sort(all(a)); }
// P l, P rで f(P) の形で渡す
template <class U, class F> void sort(vector<U> &a, F f) {
sort(all(a), [&](U l, U r) { return f(l) < f(r); });
};
template <class T> void rsort(vector<T> &a) { sort(all(a), greater<T>()); };
template <class U, class F> void rsort(vector<U> &a, F f) {
sort(all(a), [&](U l, U r) { return f(l) > f(r); });
};
// F = T<T>
// 例えばreturn p.fi + p.se;
template <class A, class B> void sortp(vector<A> &a, vector<B> &b) {
auto c = vtop(a, b);
sort(c);
rep(i, sz(a)) a[i] = c[i].fi, b[i] = c[i].se;
}
template <class A, class B, class F>
void sortp(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
sort(c, f);
rep(i, sz(a)) a[i] = c[i].fi, b[i] = c[i].se;
}
template <class A, class B> void rsortp(vector<A> &a, vector<B> &b) {
auto c = vtop(a, b);
rsort(c);
rep(i, sz(a)) a[i] = c[i].first, b[i] = c[i].second;
}
template <class A, class B, class F>
void rsortp(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
rsort(c, f);
rep(i, sz(a)) a[i] = c[i].first, b[i] = c[i].second;
}
template <class A, class B, class C>
void sortt(vector<A> &a, vector<B> &b, vector<C> &c) {
auto d = vtot(a, b, c);
sort(d);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C, class F>
void sortt(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
sort(d, f);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C>
void rsortt(vector<A> &a, vector<B> &b, vector<C> &c) {
auto d = vtot(a, b, c);
rsort(d);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C, class F>
void rsortt(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
rsort(d, f);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C, class D>
void sortf(vector<A> &a, vector<B> &b, vector<C> &c, vector<D> &d) {
auto e = vtof(a, b, c, d);
sort(e);
rep(i, sz(a)) a[i] = e[i].a, b[i] = e[i].b, c[i] = e[i].c, d[i] = e[i].d;
}
template <class A, class B, class C, class D>
void rsortf(vector<A> &a, vector<B> &b, vector<C> &c, vector<D> &d) {
auto e = vtof(a, b, c, d);
rsort(e);
rep(i, sz(a)) a[i] = e[i].a, b[i] = e[i].b, c[i] = e[i].c, d[i] = e[i].d;
}
// sortindex 元のvectorはソートしない
template <class T> vi sorti(vector<T> &a) {
auto b = a;
vi ind = iota(0, sz(a));
sortp(b, ind);
return ind;
} /*indexの分で型が変わるためpcomparatorが必要*/
template <class T> vi sorti(vector<T> &a, pcomparator f) {
auto b = a;
vi ind = iota(0, sz(a));
sortp(b, ind, f);
return ind;
}
template <class T, class F> vi sorti(vector<T> &a, F f) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(a[x]) < f(a[y]); });
return ind;
}
template <class T> vi rsorti(vector<T> &a) {
auto b = a;
vi ind = iota(0, sz(a));
rsortp(b, ind);
return ind;
}
template <class T, class F> vi rsorti(vector<T> &a, F f) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(a[x]) > f(a[y]); });
return ind;
}
template <class A, class B, class F>
vi sortpi(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(c[x]) < f(c[y]); });
return ind;
}
template <class A, class B>
vi sortpi(vector<A> &a, vector<B> &b, pcomparator f) {
vi ind = iota(0, sz(a));
auto c = a;
auto d = b;
sortt(c, d, ind, f);
return ind;
}
template <class A, class B> vi sortpi(vector<A> &a, vector<B> &b) {
return sortpi(a, b, fisi);
};
template <class A, class B, class F>
vi rsortpi(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(c[x]) > f(c[y]); });
return ind;
}
template <class A, class B> vi rsortpi(vector<A> &a, vector<B> &b) {
return sortpi(a, b, fdsd);
};
template <class A, class B, class C, class F>
vi sortti(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(d[x]) < f(d[y]); });
return ind;
}
template <class A, class B, class C>
vi sortti(vector<A> &a, vector<B> &b, vector<C> &c, pcomparator f) {
vi ind = iota(0, sz(a));
auto d = vtof(a, b, c, ind);
sort(d, f);
rep(i, sz(a)) ind[i] = d[i].d;
return ind;
}
template <class A, class B, class C>
vi sortti(vector<A> &a, vector<B> &b, vector<C> &c) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) {
if (a[x] == a[y]) {
if (b[x] == b[y])
return c[x] < c[y];
else
return b[x] < b[y];
} else {
return a[x] < a[y];
}
});
return ind;
}
template <class A, class B, class C, class F>
vi rsortti(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(d[x]) > f(d[y]); });
return ind;
}
template <class A, class B, class C>
vi rsortti(vector<A> &a, vector<B> &b, vector<C> &c) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) {
if (a[x] == a[y]) {
if (b[x] == b[y])
return c[x] > c[y];
else
return b[x] > b[y];
} else {
return a[x] > a[y];
}
});
return ind;
}
template <class T> void sort2(vector<vector<T>> &a) {
for (ll i = 0, n = a.size(); i < n; ++i)
sort(a[i]);
}
template <class T> void rsort2(vector<vector<T>> &a) {
for (ll i = 0, n = a.size(); i < n; ++i)
rsort(a[i]);
}
template <typename A, size_t N, typename T> void fill(A (&a)[N], const T &v) {
rep(i, N) a[i] = v;
}
template <typename A, size_t N, size_t O, typename T>
void fill(A (&a)[N][O], const T &v) {
rep(i, N) rep(j, O) a[i][j] = v;
}
template <typename A, size_t N, size_t O, size_t P, typename T>
void fill(A (&a)[N][O][P], const T &v) {
rep(i, N) rep(j, O) rep(k, P) a[i][j][k] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, typename T>
void fill(A (&a)[N][O][P][Q], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) a[i][j][k][l] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
typename T>
void fill(A (&a)[N][O][P][Q][R], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) a[i][j][k][l][m] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S, typename T>
void fill(A (&a)[N][O][P][Q][R][S], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) rep(n, S)
a[i][j][k][l][m][n] = v;
}
template <typename W, typename T> void fill(W &xx, const T vall) { xx = vall; }
template <typename W, typename T> void fill(vector<W> &vecc, const T vall) {
for (auto &&vx : vecc)
fill(vx, vall);
}
template <typename W, typename T> void fill(vector<W> &xx, const T v, ll len) {
rep(i, len) xx[i] = v;
}
template <typename W, typename T>
void fill(vector<vector<W>> &xx, const T v, ll lh, ll lw) {
rep(i, lh) rep(j, lw) xx[i][j] = v;
}
template <class T, class U> void fill(vector<T> &a, U val, vi &ind) {
fora(v, ind) a[v] = val;
}
template <typename A, size_t N> A sum(A (&a)[N]) {
A res = 0;
rep(i, N) res += a[i];
return res;
}
template <typename A, size_t N, size_t O> A sum(A (&a)[N][O]) {
A res = 0;
rep(i, N) rep(j, O) res += a[i][j];
return res;
}
template <typename A, size_t N, size_t O, size_t P> A sum(A (&a)[N][O][P]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) res += a[i][j][k];
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q>
A sum(A (&a)[N][O][P][Q]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) res += a[i][j][k][l];
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R>
A sum(A (&a)[N][O][P][Q][R]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) res += a[i][j][k][l][m];
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S>
A sum(A (&a)[N][O][P][Q][R][S]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) rep(n, S) res +=
a[i][j][k][l][m][n];
return res;
}
//@汎用便利関数 入力
ll in() {
ll ret;
cin >> ret;
return ret;
}
string sin() {
string ret;
cin >> ret;
return ret;
}
template <class T> void in(T &head) { cin >> head; }
template <class T, class... U> void in(T &head, U &...tail) {
cin >> head;
in(tail...);
}
#define o_din(o1, o2, o3, o4, o5, o6, name, ...) name
#define din1(a) \
ll a; \
cin >> a
#define din2(a, b) \
ll a, b; \
cin >> a >> b
#define din3(a, b, c) \
ll a, b, c; \
cin >> a >> b >> c
#define din4(a, b, c, d) \
ll a, b, c, d; \
cin >> a >> b >> c >> d
#define din5(a, b, c, d, e) \
ll a, b, c, d, e; \
cin >> a >> b >> c >> d >> e
#define din6(a, b, c, d, e, f) \
ll a, b, c, d, e, f; \
cin >> a >> b >> c >> d >> e >> f
#define din(...) \
o_din(__VA_ARGS__, din6, din5, din4, din3, din2, din1)(__VA_ARGS__)
#define o_dind(o1, o2, o3, o4, name, ...) name
#define din1d(a) \
din1(a); \
a--
#define din2d(a, b) \
din2(a, b); \
a--, b--
#define din3d(a, b, c) \
din3(a, b, c); \
a--, b--, c--
#define din4d(a, b, c, d) \
din4(a, b, c, d); \
a--, b--, c--, d--
#define dind(...) o_dind(__VA_ARGS__, din4d, din3d, din2d, din1d)(__VA_ARGS__)
template <class T> void out2(T &&head) { cout << head; }
template <class T, class... U> void out2(T &&head, U &&...tail) {
cout << head << " ";
out2(tail...);
}
template <class T, class... U> void out(T &&head, U &&...tail) {
cout << head << " ";
out2(tail...);
cout << "" << endl;
}
template <class T> void out(T &&head) { cout << head << endl; }
void out() { cout << "" << endl; }
#ifdef _DEBUG
template <class T> string out_m(vector<T> &a, ll W = inf) {
stringstream ss;
if (W == inf)
W = min(sz(a), 12ll);
if (sz(a) == 0)
return ss.str();
rep(i, W) { ss << a[i] << " "; }
ss << "" << endl;
return ss.str();
}
template <class T>
string out_m(vector<vector<T>> &a, ll H = inf, ll W = inf, int key = -1) {
H = min({H, sz(a), 12ll});
W = min({W, sz(a[0]), 12ll});
stringstream ss;
ss << endl;
if (key == -1)
ss << " *|";
else
ss << " " << key << "|";
rep(w, W) ss << std::right << std::setw(4) << w;
ss << "" << endl;
rep(w, W * 4 + 3) ss << "_";
ss << "" << endl;
rep(h, H) {
ss << std::right << std::setw(2) << h << "|";
rep(w, min(sz(a[h]), 12ll)) {
if (a[h][w] == linf)
ss << " e"
<< " ";
else
ss << std::right << std::setw(4) << a[h][w];
}
ss << "" << endl;
}
ss << endl;
return ss.str();
}
/*@formatter:off*/
template <class T>
string out_m(vector<vector<vector<T>>> &a, ll H = inf, ll W = inf, ll U = inf) {
stringstream ss;
if (H == inf)
H = 5;
H = min(H, sz(a));
rep(i, H) {
ss << endl;
ss << out_m(a[i], W, U, i);
}
ss << endl;
return ss.str();
}
string out_m(int a) {
stringstream ss;
ss << a << endl;
return ss.str();
}
template <class T> string out_m(T &a) {
stringstream ss;
ss << a << endl;
return ss.str();
}
template <class T> void outv(vector<T> &a, ll W = inf) {
cout << out_m(a, W) << endl;
}
template <class T>
void outv(vector<vector<T>> &a, ll H = linf, ll W = linf, int key = -1) {
cout << out_m(a, H, W, key) << endl;
}
template <class T>
void outv(vector<vector<vector<T>>> &a, ll H = linf, ll W = linf, ll U = linf) {
cout << out_m(a, H, W, U) << endl;
}
#else
template <class T> void outv(vector<T> &a, ll W = inf) {
rep(i, min(W, sz(a))) { cout << a[i] << " "; }
cout << "" << endl;
}
template <class T>
void outv(vector<vector<T>> &a, ll H = linf, ll W = linf, int key = -1) {
rep(i, min(H, sz(a))) { outv(a[i], W); }
}
template <class T>
void outv(vector<vector<vector<T>>> &a, ll H = linf, ll W = linf, ll U = linf) {
;
}
#endif
template <class T> void outl(vector<T> &a, int n = inf) {
rep(i, min(n, sz(a))) cout << a[i] << endl;
}
template <class T> void na(vector<T> &a, ll n) {
a.resize(n);
rep(i, n) cin >> a[i];
}
#define dna(a, n) \
vi a(n); \
rep(dnai, n) cin >> a[dnai];
template <class T> void nao(vector<T> &a, ll n) {
a.resize(n + 1);
a[0] = 0;
rep(i, n) cin >> a[i + 1];
}
template <class T> void naod(vector<T> &a, ll n) {
a.resize(n + 1);
a[0] = 0;
rep(i, n) cin >> a[i + 1], a[i + 1]--;
}
template <class T> void nad(vector<T> &a, ll n) {
a.resize(n);
rep(i, n) cin >> a[i], a[i]--;
}
template <class T, class U> void na2(vector<T> &a, vector<U> &b, ll n) {
a.resize(n);
b.resize(n);
rep(i, n) cin >> a[i] >> b[i];
}
#define dna2(a, b, n) \
vi a(n), b(n); \
rep(dna2i, n) cin >> a[dna2i] >> b[dna2i];
template <class T, class U> void nao2(vector<T> &a, vector<U> &b, ll n) {
a.resize(n + 1);
b.resize(n + 1);
a[0] = b[0] = 0;
rep(i, n) cin >> a[i + 1] >> b[i + 1];
}
#define dna2d(a, b, n) \
vi a(n), b(n); \
rep(dna2di, n) { \
cin >> a[dna2di] >> b[dna2di]; \
a[dna2di]--, b[dna2di]--; \
}
template <class T, class U> void na2d(vector<T> &a, vector<U> &b, ll n) {
a.resize(n);
b.resize(n);
rep(i, n) cin >> a[i] >> b[i], a[i]--, b[i]--;
}
template <class T, class U, class W>
void na3(vector<T> &a, vector<U> &b, vector<W> &c, ll n) {
a.resize(n);
b.resize(n);
c.resize(n);
rep(i, n) cin >> a[i] >> b[i] >> c[i];
}
#define dna3(a, b, c, n) \
vi a(n), b(n), c(n); \
rep(dna3i, n) cin >> a[dna3i] >> b[dna3i] >> c[dna3i];
template <class T, class U, class W>
void na3d(vector<T> &a, vector<U> &b, vector<W> &c, ll n) {
a.resize(n);
b.resize(n);
c.resize(n);
rep(i, n) cin >> a[i] >> b[i] >> c[i], a[i]--, b[i]--, c[i]--;
}
#define dna3d(a, b, c, n) \
vi a(n), b(n), c(n); \
rep(dna3di, n) { \
cin >> a[dna3di] >> b[dna3di] >> c[dna3di]; \
a[dna3di]--, b[dna3di]--, c[dna3di]--; \
}
template <class T, class U, class W, class X>
void na4(vector<T> &a, vector<U> &b, vector<W> &c, vector<X> &d, ll n) {
a.resize(n);
b.resize(n);
c.resize(n);
d.resize(n);
rep(i, n) cin >> a[i] >> b[i] >> c[i] >> d[i];
}
#define dna4(a, b, c, d, n) \
vi a(n), b(n), c(n), d(n); \
rep(dna4i, n) cin >> a[dna4i] >> b[dna4i] >> c[dna4i] >> d[dna4i];
#define dna4d(a, b, c, d, n) \
vi a(n), b(n), c(n), d(n); \
rep(dna4i, n) cin >> a[dna4i] >> b[dna4i] >> c[dna4i] >> d[dna4i], \
--a[dna4i], --b[dna4i], --c[dna4i], --d[dna4i];
#define nt(a, h, w) \
resize(a, h, w); \
rep(nthi, h) rep(ntwi, w) cin >> a[nthi][ntwi];
#define ntd(a, h, w) \
resize(a, h, w); \
rep(ntdhi, h) rep(ntdwi, w) cin >> a[ntdhi][ntdwi], a[ntdhi][ntdwi]--;
#define ntp(a, h, w) \
resize(a, h + 2, w + 2); \
fill(a, '#'); \
rep(ntphi, 1, h + 1) rep(ntpwi, 1, w + 1) cin >> a[ntphi][ntpwi];
// デバッグ
#define sp << " " <<
#define debugName(VariableName) #VariableName
#define deb1(x) debugName(x) << " = " << out_m(x)
#define deb2(x, ...) deb1(x) << ", " << deb1(__VA_ARGS__)
#define deb3(x, ...) deb1(x) << ", " << deb2(__VA_ARGS__)
#define deb4(x, ...) deb1(x) << ", " << deb3(__VA_ARGS__)
#define deb5(x, ...) deb1(x) << ", " << deb4(__VA_ARGS__)
#define deb6(x, ...) deb1(x) << ", " << deb5(__VA_ARGS__)
#define deb7(x, ...) deb1(x) << ", " << deb6(__VA_ARGS__)
#define deb8(x, ...) deb1(x) << ", " << deb7(__VA_ARGS__)
#define deb9(x, ...) deb1(x) << ", " << deb8(__VA_ARGS__)
#define deb10(x, ...) deb1(x) << ", " << deb9(__VA_ARGS__)
#define o_ebug(o1, o2, o3, o4, o5, o6, o7, o8, o9, o10, name, ...) name
#ifdef _DEBUG
#define deb(...) \
cerr << o_ebug(__VA_ARGS__, deb10, deb9, deb8, deb7, deb6, deb5, deb4, deb3, \
deb2, deb1)(__VA_ARGS__) \
<< endl
#else
#define deb(...) ;
#endif
#define debugline(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n'
//@formatter:off
// よく使うクラス、構造体
struct unionfind {
vector<ll> par;
vector<ll> siz;
vector<ll> es;
ll n, trees; // 連結グループの数(親の種類)
unionfind(ll n) : n(n), trees(n) {
par.resize(n);
siz.resize(n);
es.resize(n);
for (ll i = 0; i < n; i++) {
par[i] = i;
siz[i] = 1;
}
}
ll root(ll x) {
if (par[x] == x) {
return x;
} else {
return par[x] = root(par[x]);
}
}
bool unite(ll x, ll y) {
x = root(x);
y = root(y);
es[x]++;
if (x == y)
return false;
if (siz[x] > siz[y])
swap(x, y);
trees--;
par[x] = y;
siz[y] += siz[x];
es[y] += es[x];
return true;
}
bool same(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return siz[root(x)]; }
ll esize(ll x) { return es[root(x)]; }
vi sizes() {
vi cou(n);
vi ret;
ret.reserve(n);
rep(i, n) { cou[root(i)]++; }
rep(i, n) {
if (cou[i])
ret.push_back(cou[i]);
}
return ret;
}
// つながりを無向グラフと見なし、xが閉路に含まれるか判定
bool close(ll x) { return esize(x) >= size(x); }
vec<vi> sets() {
vi ind(n, -1);
ll i = 0;
vvi(res, trees);
rep(j, n) {
ll r = root(j);
if (ind[r] == -1)
ind[r] = i++;
res[ind[r]].push_back(j);
}
rep(i, trees) {
ll r = root(res[i][0]);
if (res[i][0] == r)
continue;
rep(j, 1, sz(res[i])) {
if (res[i][j] == r) {
swap(res[i][0], res[i][j]);
break;
}
}
}
return res;
}
}; //@formatter:off
using bll = __int128;
using u32 = unsigned;
using u64 = unsigned long long;
using u128 = __uint128_t;
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
std::ostream::sentry s(dest);
if (s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while (tmp != 0);
if (value < 0) {
--d;
*d = '-';
}
ll len = std::end(buffer) - d;
if (dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
//__int128 toi128(string &s) { __int128 ret = 0; for (ll i = 0; i <
//s.length(); ++i) if ('0' <= s[i] && s[i] <= '9') ret = 10 *
//ret + s[i] - '0'; return ret;}
// エラー
void ole() {
#ifdef _DEBUG
debugline("ole");
exit(0);
#endif
string a = "a";
rep(i, 30) a += a;
rep(i, 1 << 17) cout << a << endl;
cout << "OLE 出力長制限超過" << endl;
exit(0);
}
void re() {
assert(0 == 1);
exit(0);
}
void tle() {
while (inf)
cout << inf << endl;
}
// 便利関数
// テスト用
char ranc() { return (char)('a' + rand() % 26); }
ll rand(ll min, ll max) {
assert(min <= max);
if (min >= 0 && max >= 0) {
return rand() % (max + 1 - min) + min;
} else if (max < 0) {
return -rand(-max, -min);
} else {
if (rand() % 2) {
return rand(0, max);
} else {
return -rand(0, -min);
}
}
}
vi ranv(ll n, ll min, ll max) {
vi v(n);
rep(i, n) v[i] = rand(min, max);
return v;
}
str ransu(ll n) {
str s;
rep(i, n) s += (char)rand('A', 'Z');
return s;
}
str ransl(ll n) {
str s;
rep(i, n) s += (char)rand('a', 'z');
return s;
}
// 単調増加
vi ranvinc(ll n, ll min, ll max) {
vi v(n);
bool bad = 1;
while (bad) {
bad = 0;
v.resize(n);
rep(i, n) {
if (i && min > max - v[i - 1]) {
bad = 1;
break;
}
if (i)
v[i] = v[i - 1] + rand(min, max - v[i - 1]);
else
v[i] = rand(min, max);
}
}
return v;
}
// 便利 汎用
void ranvlr(ll n, ll min, ll max, vi &l, vi &r) {
l.resize(n);
r.resize(n);
rep(i, n) {
l[i] = rand(min, max);
r[i] = l[i] + rand(0, max - l[i]);
}
}
vp run_length(vi &a) {
vp ret;
ret.eb(a[0], 1);
rep(i, 1, sz(a)) {
if (ret.back().fi == a[i]) {
ret.back().se++;
} else {
ret.eb(a[i], 1);
}
}
return ret;
}
vector<pair<char, ll>> run_length(string &a) {
vector<pair<char, ll>> ret;
ret.eb(a[0], 1);
rep(i, 1, sz(a)) {
if (ret.back().fi == a[i]) {
ret.back().se++;
} else {
ret.eb(a[i], 1);
}
}
return ret;
}
template <class F> ll mgr(ll ok, ll ng, F f) {
if (ok < ng)
while (ng - ok > 1) {
ll mid = (ok + ng) / 2;
if (f(mid))
ok = mid;
else
ng = mid;
}
else
while (ok - ng > 1) {
ll mid = (ok + ng) / 2;
if (f(mid))
ok = mid;
else
ng = mid;
}
return ok;
}
// strを整数として比較
string smax(str &a, str b) {
if (sz(a) < sz(b)) {
return b;
} else if (sz(a) > sz(b)) {
return a;
} else if (a < b)
return b;
else
return a;
}
// strを整数として比較
string smin(str &a, str b) {
if (sz(a) > sz(b)) {
return b;
} else if (sz(a) < sz(b)) {
return a;
} else if (a > b)
return b;
else
return a;
}
template <typename W, typename T> ll find(vector<W> &a, const T key) {
rep(i, sz(a)) if (a[i] == key) return i;
return -1;
}
template <typename W, typename T> P find(vector<vector<W>> &a, const T key) {
rep(i, sz(a)) rep(j, sz(a[0])) if (a[i][j] == key) return mp(i, j);
return mp(-1, -1);
}
template <typename W, typename U>
T find(vector<vector<vector<W>>> &a, const U key) {
rep(i, sz(a)) rep(j, sz(a[0]))
rep(k, sz(a[0][0])) if (a[i][j][k] == key) return mt(i, j, k);
return mt(-1, -1, -1);
}
template <typename W, typename T> ll count2(W &a, const T k) { return a == k; }
template <typename W, typename T> ll count2(vector<W> &a, const T k) {
ll ret = 0;
fora(v, a) ret += count2(v, k);
return ret;
}
template <typename W, typename T> ll count(vector<W> &a, const T k) {
ll ret = 0;
fora(v, a) ret += count2(v, k);
return ret;
}
ll count(str &a, str k) {
ll ret = 0, len = k.length();
auto pos = a.find(k);
while (pos != string::npos)
pos = a.find(k, pos + len), ++ret;
return ret;
}
vi count(str &a) {
vi cou(26);
char c = 'a';
if ('A' <= a[0] && a[0] <= 'Z')
c = 'A';
rep(i, sz(a))++ cou[a[i] - c];
return cou;
}
#define couif count_if
// algorythm
ll rev(ll a) {
ll res = 0;
while (a) {
res *= 10;
res += a % 10;
a /= 10;
}
return res;
}
template <class T> void rev(vector<T> &a) { reverse(all(a)); }
template <class U> void rev(vector<vector<U>> &a) {
vector<vector<U>> b(sz(a[0]), vector<U>(sz(a)));
rep(h, sz(a)) rep(w, sz(a[0])) b[w][h] = a[h][w];
a = b;
}
void rev(string &a) { reverse(all(a)); }
constexpr ll p10[] = {1,
10,
100,
1000,
10000,
100000,
1000000,
10000000,
100000000,
1000000000,
10000000000ll,
100000000000ll,
1000000000000ll,
10000000000000ll,
100000000000000ll,
1000000000000000ll,
10000000000000000ll,
100000000000000000ll,
1000000000000000000ll};
ll get(ll a, ll keta) { return (a / (ll)pow(10, keta)) % 10; }
ll keta(ll v) {
if (v < p10[9]) {
if (v < p10[4]) {
if (v < p10[2]) {
if (v < p10[1])
return 1;
else
return 2;
} else {
if (v < p10[3])
return 3;
else
return 4;
}
} else {
if (v < p10[7]) {
if (v < p10[5])
return 5;
else if (v < p10[6])
return 6;
else
return 7;
} else {
if (v < p10[8])
return 8;
else
return 9;
}
}
} else {
if (v < p10[13]) {
if (v < p10[11]) {
if (v < p10[10])
return 10;
else
return 11;
} else {
if (v < p10[12])
return 12;
else
return 13;
}
} else {
if (v < p10[15]) {
if (v < p10[14])
return 14;
else if (v < p10[15])
return 15;
else
return 16;
} else {
if (v < p10[17])
return 17;
else
return 18;
}
}
}
}
ll dsum(ll v, ll sin = 10) {
ll ret = 0;
for (; v; v /= sin)
ret += v % sin;
return ret;
}
struct sint {
ll v;
sint(ll v) : v(v) {}
operator ll() { return v; }
// 下からi番目
ll operator[](ll i) { return (v / p10[i]) % 10; }
ll back(ll i) { return operator[](i); }
// 上からi番目
ll top(ll i) {
ll len = keta(v);
return operator[](len - 1 - i);
}
// 先頭からi番目にセット
ll settop(ll i, ll k) {
ll len = keta(v);
return set(len - 1 - i, k);
}
ll set(ll i, ll k) {
if (i < 0)
return settop(abs(i) - 1, k);
return v += p10[i] * (k - (v / p10[i]) % 10);
}
ll add(ll i, ll k = 1) { return v += p10[i] * k; }
ll addtop(ll i, ll k = 1) { return v += p10[keta(v) - i - 1] * k; }
ll dec(ll i, ll k = 1) { return v -= p10[i] * k; }
ll dectop(ll i, ll k = 1) { return v -= p10[keta(v) - i - 1] * k; }
#define op(t, o) \
template <class T> t operator o(T r) { return v o r; }
op(ll, +=);
op(ll, -=);
op(ll, *=);
op(ll, /=);
op(ll, %=);
op(ll, +);
op(ll, -);
op(ll, *);
op(ll, /);
op(ll, %);
op(bool, ==);
op(bool, !=);
op(bool, <);
op(bool, <=);
op(bool, >);
op(bool, >=);
#undef op
template <class T> ll operator<<=(T r) { return v *= p10[r]; }
template <class T> ll operator<<(T r) { return v * p10[r]; }
template <class T> ll operator>>=(T r) { return v /= p10[r]; }
template <class T> ll operator>>(T r) { return v / p10[r]; }
};
ll mask10(ll v) { return p10[v] - 1; }
// 変換系
template <class T> auto keys(T &a) {
vector<decltype((a.begin())->fi)> res;
for (auto &&k : a)
res.push_back(k.fi);
return res;
}
template <class T> auto values(T &a) {
vector<decltype((a.begin())->se)> res;
for (auto &&k : a)
res.push_back(k.se);
return res;
}
template <class T, class U> bool chma(T &a, const U &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class U> bool chma(const U &b) { return chma(ma, b); }
template <class T, class U> bool chmi(T &a, const U &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class U> bool chmi(const U &b) { return chmi(mi, b); }
template <class T> T min(T a, signed b) { return a < b ? a : b; }
template <class T> T max(T a, signed b) { return a < b ? b : a; }
template <class T> T min(T a, T b, T c) {
return a >= b ? b >= c ? c : b : a >= c ? c : a;
}
template <class T> T max(T a, T b, T c) {
return a <= b ? b <= c ? c : b : a <= c ? c : a;
}
template <class T> T min(vector<T> &a) { return *min_element(all(a)); }
template <class T> T mini(vector<T> &a) {
return min_element(all(a)) - a.begin();
}
template <class T> T min(vector<T> &a, ll n) {
return *min_element(a.begin(), a.begin() + min(n, sz(a)));
}
template <class T> T min(vector<T> &a, ll s, ll n) {
return *min_element(a.begin() + s, a.begin() + min(n, sz(a)));
}
template <class T> T max(vector<T> &a) { return *max_element(all(a)); }
template <class T, class U> T max(vector<T> &a, vector<U> &b) {
return max(*max_element(all(a)), *max_element(all(b)));
}
template <class T> T maxi(vector<T> &a) {
return max_element(all(a)) - a.begin();
}
template <class T> T max(vector<T> &a, ll n) {
return *max_element(a.begin(), a.begin() + min(n, sz(a)));
}
template <class T> T max(vector<T> &a, ll s, ll n) {
return *max_element(a.begin() + s, a.begin() + min(n, sz(a)));
}
template <typename A, size_t N> A max(A (&a)[N]) {
A res = a[0];
rep(i, N) res = max(res, a[i]);
return res;
}
template <typename A, size_t N, size_t O> A max(A (&a)[N][O]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P> A max(A (&a)[N][O][P]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q>
A max(A (&a)[N][O][P][Q], const T &v) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R>
A max(A (&a)[N][O][P][Q][R]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S>
A max(A (&a)[N][O][P][Q][R][S]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N> A min(A (&a)[N]) {
A res = a[0];
rep(i, N) res = min(res, a[i]);
return res;
}
template <typename A, size_t N, size_t O> A min(A (&a)[N][O]) {
A res = min(a[0]);
rep(i, N) res = min(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P> A min(A (&a)[N][O][P]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q>
A min(A (&a)[N][O][P][Q], const T &v) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R>
A min(A (&a)[N][O][P][Q][R]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S>
A min(A (&a)[N][O][P][Q][R][S]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <class T> T sum(vector<T> &v, ll s, ll t) {
T ret = 0;
rep(i, s, min(sz(v), t)) ret += v[i];
return ret;
}
template <class T> T sum(vector<T> &v, ll t = inf) { return sum(v, 0, t); }
template <class T> T sum(vector<vector<T>> &v) {
T ret = 0;
rep(i, sz(v)) ret += sum(v[i]);
return ret;
}
template <class T> T sum(vector<vector<vector<T>>> &v) {
T ret = 0;
rep(i, sz(v)) ret += sum(v[i]);
return ret;
}
template <class T> T sum(vector<vector<vector<vector<T>>>> &v) {
T ret = 0;
rep(i, sz(v)) ret += sum(v[i]);
return ret;
}
template <class T> T sum(vector<vector<vector<vector<vector<T>>>>> &v) {
T ret = 0;
rep(i, sz(v)) ret += sum(v[i]);
return ret;
}
template <class T> auto sum(priority_queue<T, vector<T>, greater<T>> &r) {
auto q = r;
T ret = 0;
while (sz(q)) {
ret += q.top();
q.pop();
}
return ret;
}
template <class T> auto sum(priority_queue<T> &r) {
auto q = r;
T ret = 0;
while (sz(q)) {
ret += q.top();
q.pop();
}
return ret;
}
// template<class T, class U, class... W> auto sumn(vector<T> &v, U head, W...
// tail) { auto ret = sum(v[0], tail...); rep(i, 1, min(sz(v), head))ret
// += sum(v[i], tail...); return ret;}
void clear(PQ &q) { q = PQ(); }
template <class T> void clear(queue<T> &q) {
while (q.size())
q.pop();
}
template <class T> T *negarr(ll size) {
T *body = (T *)malloc((size * 2 + 1) * sizeof(T));
return body + size;
}
template <class T> T *negarr2(ll h, ll w) {
double **dummy1 = new double *[2 * h + 1];
double *dummy2 = new double[(2 * h + 1) * (2 * w + 1)];
dummy1[0] = dummy2 + w;
for (ll i = 1; i <= 2 * h + 1; ++i) {
dummy1[i] = dummy1[i - 1] + 2 * w + 1;
}
double **a = dummy1 + h;
return a;
}
// imoは0-indexed
// ruiは1-indexed
template <class T> vector<T> imo(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) ret[i + 1] += ret[i];
return ret;
}
// kと同じものの数
template <class T, class U> vi imo(vector<T> &a, U k) {
vector<T> ret = a;
rep(i, sz(ret)) ret[i] = a[i] == k;
rep(i, sz(ret) - 1) ret[i + 1] += ret[i];
return ret;
}
template <class T> vector<T> imox(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) ret[i + 1] ^= ret[i];
return ret;
}
// 漸化的に最小を持つ
template <class T> vector<T> imi(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) chmi(ret[i + 1], ret[i]);
return ret;
}
template <class T> struct ruiC {
const vector<T> rui;
ruiC(vector<T> &ru) : rui(ru) {}
T operator()(ll l, ll r) {
if (l > r) {
cerr << "ruic ";
deb(l, r);
assert(0);
}
return rui[r] - rui[l];
}
T operator[](ll i) { return rui[i]; }
T back() { return rui.back(); }
ll size() { return rui.size(); }
};
template <class T> struct rruic {
const T *rrui;
rruic(T *ru) : rrui(ru) {}
T operator()(ll l, ll r) {
assert(l >= r);
return rrui[r] - rrui[l];
}
T operator[](ll i) { return rrui[i]; }
};
template <class T> ostream &operator<<(ostream &os, ruiC<T> a) {
fora(v, a.rui) os << v << " ";
return os;
}
template <class T> vector<T> ruiv(vector<T> &a) {
vector<T> ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] + a[i];
return ret;
}
template <class T> ruiC<T> ruic(vector<T> &a) {
vector<T> ret = ruiv(a);
return ruiC<T>(ret);
}
vector<ll> ruiv(string &a) {
if (sz(a) == 0)
return vi(1);
ll dec = ('0' <= a[0] && a[0] <= '9') ? '0' : 0;
vector<ll> ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] + a[i] - dec;
return ret;
}
ruiC<ll> ruic(string &a) {
vector<ll> ret = ruiv(a);
return ruiC<ll>(ret);
}
// kと同じものの数
template <class T, class U> vi ruiv(T &a, U k) {
vi ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] + (a[i] == k);
return ret;
}
template <class T, class U> ruiC<ll> ruic(T &a, U k) {
vi ret = ruiv(a, k);
return ruiC<ll>(ret);
}
// xor
template <class T> struct ruixC {
const vector<T> rui;
ruixC(vector<T> &ru) : rui(ru) {}
T operator()(ll l, ll r) {
if (l > r) {
cerr << "ruiXc ";
deb(l, r);
assert(0);
}
return rui[r] ^ rui[l];
}
T operator[](ll i) { return rui[i]; }
T back() { return rui.back(); }
ll size() { return rui.size(); }
};
template <class T> vector<T> ruix(vector<T> &a) {
vector<T> ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] ^ a[i];
return ret;
}
template <class T> ruixC<ll> ruixc(vector<T> &a) {
vi ret = ruix(a);
return ruixC<ll>(ret);
}
template <class T> vector<T> ruim(vector<T> &a) {
vector<T> res(a.size() + 1, 1);
rep(i, a.size()) res[i + 1] = res[i] * a[i];
return res;
}
// 漸化的に最小を1indexで持つ
template <class T> vector<T> ruimi(vector<T> &a) {
ll n = sz(a);
vector<T> ret(n + 1);
rep(i, 1, n) {
ret[i] = a[i - 1];
chmi(ret[i + 1], ret[i]);
}
return ret;
}
// template<class T> T *rrui(vector<T> &a) {
// 右から左にかけての半開区間 (-1 n-1]
template <class T> rruic<T> rrui(vector<T> &a) {
ll len = a.size();
T *body = (T *)malloc((len + 1) * sizeof(T));
T *res = body + 1;
rer(i, len - 1) res[i - 1] = res[i] + a[i];
return rruic<T>(res);
}
// 掛け算
template <class T> T *rruim(vector<T> &a) {
ll len = a.size();
T *body = (T *)malloc((len + 1) * sizeof(T));
T *res = body + 1;
res[len - 1] = 1;
rer(i, len - 1) res[i - 1] = res[i] * a[i];
return res;
}
template <class T, class U> void inc(T &a, U v = 1) { a += v; }
template <class T, class U> void inc(vector<T> &a, U v = 1) {
for (auto &u : a)
inc(u, v);
}
template <class T, class U> void dec(T &a, U v = 1) { a -= v; }
template <class T, class U> void dec(vector<T> &a, U v = 1) {
for (auto &u : a)
dec(u, v);
}
template <class U> void dec(string &a, U v = 1) {
for (auto &u : a)
dec(u, v);
}
template <class T> void dec(vector<T> &a) {
for (auto &u : a)
dec(u, 1);
}
template <class T, class U> void dec(vector<T> &a, vector<U> &b) {
for (auto &u : a)
dec(u, 1);
for (auto &u : b)
dec(u, 1);
}
template <class T, class U, class W>
void dec(vector<T> &a, vector<U> &b, vector<W> &c) {
for (auto &u : a)
dec(u, 1);
for (auto &u : b)
dec(u, 1);
for (auto &u : c)
dec(u, 1);
}
bool ins(ll h, ll w, ll H, ll W) { return h >= 0 && w >= 0 && h < H && w < W; }
bool ins(ll l, ll v, ll r) { return l <= v && v < r; }
template <class T> bool ins(vector<T> &a, ll i, ll j = 0) {
return ins(0, i, sz(a)) && ins(0, j, sz(a));
}
ll u(ll a) { return a < 0 ? 0 : a; }
template <class T> vector<T> u(const vector<T> &a) {
vector<T> ret = a;
fora(v, ret) v = u(v);
return ret;
}
#define MIN(a) numeric_limits<a>::min()
#define MAX(a) numeric_limits<a>::max()
// 添え字を返す
template <class F> ll goldd_l(ll left, ll right, F calc) {
double GRATIO = 1.6180339887498948482045868343656;
ll lm = left + (ll)((right - left) / (GRATIO + 1.0));
ll rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
ll fl = calc(lm);
ll fr = calc(rm);
while (right - left > 10) {
if (fl < fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + (ll)((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
ll minScore = MAX(ll);
ll resIndex = left;
for (ll i = left; i < right + 1; ++i) {
ll score = calc(i);
if (minScore > score) {
minScore = score;
resIndex = i;
}
}
return resIndex;
}
template <class F> ll goldt_l(ll left, ll right, F calc) {
double GRATIO = 1.6180339887498948482045868343656;
ll lm = left + (ll)((right - left) / (GRATIO + 1.0));
ll rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
ll fl = calc(lm);
ll fr = calc(rm);
while (right - left > 10) {
if (fl > fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + (ll)((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
if (left > right) {
ll l = left;
left = right;
right = l;
}
ll maxScore = MIN(ll);
ll resIndex = left;
for (ll i = left; i < right + 1; ++i) {
ll score = calc(i);
if (maxScore < score) {
maxScore = score;
resIndex = i;
}
}
return resIndex;
}
/*loopは200にすればおそらく大丈夫 余裕なら300に*/
template <class F> dou goldd_d(dou left, dou right, F calc, ll loop = 200) {
dou GRATIO = 1.6180339887498948482045868343656;
dou lm = left + ((right - left) / (GRATIO + 1.0));
dou rm = lm + ((right - lm) / (GRATIO + 1.0));
dou fl = calc(lm);
dou fr = calc(rm); /*200にすればおそらく大丈夫*/ /*余裕なら300に*/
ll k = 141;
loop++;
while (--loop) {
if (fl < fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + ((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + ((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
return left;
}
template <class F> dou goldt_d(dou left, dou right, F calc, ll loop = 200) {
double GRATIO = 1.6180339887498948482045868343656;
dou lm = left + ((right - left) / (GRATIO + 1.0));
dou rm = lm + ((right - lm) / (GRATIO + 1.0));
dou fl = calc(lm);
dou fr = calc(rm);
loop++;
while (--loop) {
if (fl > fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + ((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + ((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
return left;
}
// l ~ rを複数の区間に分割し、極致を与えるiを返す time-20 msまで探索
template <class F> ll goldd_ls(ll l, ll r, F calc, ll time = 2000) {
auto lim = milliseconds(time - 20);
ll mini = 0, minv = MAX(ll); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
ll haba = (r - l + k) / k; /*((r-l+1) + k-1) /k*/
ll nl = l;
ll nr = l + haba;
rep(i, k) {
ll ni = goldd_l(nl, nr, calc);
if (chmi(minv, calc(ni)))
mini = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return mini;
}
template <class F> ll goldt_ls(ll l, ll r, F calc, ll time = 2000) {
auto lim = milliseconds(time - 20);
ll maxi = 0, maxv = MIN(ll); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
ll haba = (r - l + k) / k; /*((r-l+1) + k-1) /k*/
ll nl = l;
ll nr = l + haba;
rep(i, k) {
ll ni = goldt_l(nl, nr, calc);
if (chma(maxv, calc(ni)))
maxi = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return maxi;
}
template <class F>
dou goldd_d_s(dou l, dou r, F calc, ll time = 2000) { /*20ms余裕を持つ*/
auto lim = milliseconds(time - 20);
dou mini = 0, minv = MAX(dou); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
dou haba = (r - l) / k;
dou nl = l;
dou nr = l + haba;
rep(i, k) {
dou ni = goldd_d(nl, nr, calc);
if (chmi(minv, calc(ni)))
mini = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return mini;
}
template <class F>
dou goldt_d_s(dou l, dou r, F calc, ll time = 2000) { /*20ms余裕を残している*/
auto lim = milliseconds(time - 20);
dou maxi = 0, maxv = MIN(dou); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
dou haba = (r - l) / k;
dou nl = l;
dou nr = l + haba;
rep(i, k) {
dou ni = goldt_d(nl, nr, calc);
if (chma(maxv, calc(ni)))
maxi = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return maxi;
}
template <class T> T min(vector<vector<T>> &a) {
T res = MAX(T);
rep(i, a.size()) chmi(res, *min_element(all(a[i])));
return res;
}
template <class T> T max(vector<vector<T>> &a) {
T res = MIN(T);
rep(i, a.size()) chma(res, *max_element(all(a[i])));
return res;
}
constexpr bool bget(ll m, ll keta) { return (m >> keta) & 1; }
ll bget(ll m, ll keta, ll sinsuu) {
m /= (ll)pow(sinsuu, keta);
return m % sinsuu;
}
ll bit(ll n) { return (1LL << (n)); }
ll bit(ll n, ll sinsuu) { return (ll)pow(sinsuu, n); }
ll mask(ll n) { return (1ll << n) - 1; }
#define bcou __builtin_popcountll
// 最下位ビット
ll lbit(ll n) { return n & -n; }
// 最上位ビット
ll hbit(ll n) {
n |= (n >> 1);
n |= (n >> 2);
n |= (n >> 4);
n |= (n >> 8);
n |= (n >> 16);
n |= (n >> 32);
return n - (n >> 1);
}
ll hbitk(ll n) {
ll k = 0;
rer(i, 5) {
ll a = k + (1ll << i);
ll b = 1ll << a;
if (b <= n)
k += 1ll << i;
}
return k;
}
// 初期化は0を渡す
ll nextComb(ll &mask, ll n, ll r) {
if (!mask)
return mask = (1LL << r) - 1;
ll x = mask & -mask; /*最下位の1*/
ll y = mask + x; /*連続した下の1を繰り上がらせる*/
ll res = ((mask & ~y) / x >> 1) | y;
if (bget(res, n))
return mask = 0;
else
return mask = res;
}
// n桁以下でビットがr個立っているもののvectorを返す
vi bitCombList(ll n, ll r) {
vi res;
ll m = 0;
while (nextComb(m, n, r)) {
res.push_back(m);
}
return res;
}
// masの立ってるindexを見る
#define forbit(i, mas) \
for (int forbitj = lbit(mas), forbitm = mas, i = log2(forbitj); forbitm; \
forbitm = forbitj ? forbitm ^ forbitj : 0, forbitj = lbit(forbitm), \
i = log2(forbitj))
char itoal(ll i) { return 'a' + i; }
char itoaL(ll i) { return 'A' + i; }
ll altoi(char c) {
if ('A' <= c && c <= 'Z')
return c - 'A';
return c - 'a';
}
ll ctoi(char c) { return c - '0'; }
char itoc(ll i) { return i + '0'; }
ll vtoi(vi &v) {
ll res = 0;
if (sz(v) > 18) {
debugline("vtoi");
deb(sz(v));
ole();
}
rep(i, sz(v)) {
res *= 10;
res += v[i];
}
return res;
}
vi itov(ll i) {
vi res;
while (i) {
res.push_back(i % 10);
i /= 10;
}
rev(res);
return res;
}
vi stov(string &a) {
ll n = sz(a);
vi ret(n);
rep(i, n) { ret[i] = a[i] - '0'; }
return ret;
}
// 基準を満たさないものは0になる
vi stov(string &a, char one) {
ll n = sz(a);
vi ret(n);
rep(i, n) ret[i] = a[i] == one;
return ret;
}
vector<vector<ll>> ctoi(vector<vector<char>> s, char c) {
ll n = sz(s), m = sz(s[0]);
vector<vector<ll>> res(n, vector<ll>(m));
rep(i, n) rep(j, m) res[i][j] = s[i][j] == c;
return res;
}
#define unique(v) v.erase(unique(v.begin(), v.end()), v.end());
//[i] := i番として圧縮されたものを返す
vi compress(vi &a) {
vi b;
ll len = a.size();
for (ll i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
unique(b);
for (ll i = 0; i < len; ++i) {
a[i] = lower_bound(all(b), a[i]) - b.begin();
}
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vi &a, umap<ll, ll> &map) {
vi b;
ll len = a.size();
for (ll i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
unique(b);
for (ll i = 0; i < len; ++i) {
ll v = a[i];
a[i] = lower_bound(all(b), a[i]) - b.begin();
map[v] = a[i];
}
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vi &a, vi &r) {
vi b;
ll len = a.size();
fora(v, a) b.push_back(v);
fora(v, r) b.push_back(v);
sort(b);
unique(b);
for (ll i = 0; i < len; ++i)
a[i] = lower_bound(all(b), a[i]) - b.begin();
for (ll i = 0; i < sz(r); ++i)
r[i] = lower_bound(all(b), r[i]) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vi &a, vi &r, vi &s) {
vi b;
ll len = a.size();
fora(v, a) b.push_back(v);
fora(v, r) b.push_back(v);
fora(v, s) b.push_back(v);
sort(b);
unique(b);
for (ll i = 0; i < len; ++i)
a[i] = lower_bound(all(b), a[i]) - b.begin();
for (ll i = 0; i < sz(r); ++i)
r[i] = lower_bound(all(b), r[i]) - b.begin();
for (ll i = 0; i < sz(s); ++i)
r[i] = lower_bound(all(b), s[i]) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vector<vi> &a) {
vi b;
fora(vv, a) fora(v, vv) b.push_back(v);
sort(b);
unique(b);
fora(vv, a) fora(v, vv) v = lower_bound(all(b), v) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vector<vector<vi>> &a) {
vi b;
fora(vvv, a) fora(vv, vvv) fora(v, vv) b.push_back(v);
sort(b);
unique(b);
fora(vvv, a) fora(vv, vvv) fora(v, vv) v = lower_bound(all(b), v) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
void compress(ll a[], ll len) {
vi b;
for (ll i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
unique(b);
for (ll i = 0; i < len; ++i) {
a[i] = lower_bound(all(b), a[i]) - b.begin();
}
}
// 要素が見つからなかったときに困る
#define binarySearch(a, v) (binary_search(all(a), v))
#define lowerIndex(a, v) (lower_bound(all(a), v) - a.begin())
#define lowerBound(a, v) (*lower_bound(all(a), v))
#define upperIndex(a, v) (upper_bound(all(a), v) - a.begin())
#define upperBound(a, v) (*upper_bound(all(a), v))
#define rlowerIndex(a, v) (upper_bound(all(a), v) - a.begin() - 1)
#define rlowerBound(a, v) *(--(upper_bound(all(a), v)))
#define rupperIndex(a, v) (lower_bound(all(a), v) - a.begin() - 1)
#define rupperBound(a, v) *(--(lower_bound(all(a), v)))
#define next2(a) next(next(a))
#define prev2(a) prev(prev(a))
// 狭義の単調増加列 長さを返す
template <class T> int lis(vector<T> &a) {
int n = sz(a);
vi tail(n + 1, MAX(T));
rep(i, n) {
int id = lowerIndex(tail, a[i]); /**/
tail[id] = a[i];
}
return lowerIndex(tail, MAX(T));
}
template <class T> int lis_eq(vector<T> &a) {
int n = sz(a);
vi tail(n + 1, MAX(T));
rep(i, n) {
int id = upperIndex(tail, a[i]); /**/
tail[id] = a[i];
}
return lowerIndex(tail, MAX(T));
}
// iteratorを返す
// valueが1以上の物を返す 0は見つけ次第削除
// vを減らす場合 (*it).se--でいい
template <class T, class U, class V> auto lower_map(map<T, U> &m, V k) {
auto ret = m.lower_bound(k);
while (ret != m.end() && (*ret).second == 0) {
ret = m.erase(ret);
}
return ret;
}
template <class T, class U, class V> auto upper_map(map<T, U> &m, V k) {
auto ret = m.upper_bound(k);
while (ret != m.end() && (*ret).second == 0) {
ret = m.erase(ret);
}
return ret;
}
// 存在しなければエラー
template <class T, class U, class V> auto rlower_map(map<T, U> &m, V k) {
auto ret = upper_map(m, k);
assert(ret != m.begin());
ret--;
while (1) {
if ((*ret).second != 0)
break;
assert(ret != m.begin());
auto next = ret;
--next;
m.erase(ret);
ret = next;
}
return ret;
}
template <class T, class U, class V> auto rupper_map(map<T, U> &m, V k) {
auto ret = lower_map(m, k);
assert(ret != m.begin());
ret--;
while (1) {
if ((*ret).second != 0)
break;
assert(ret != m.begin());
auto next = ret;
--next;
m.erase(ret);
ret = next;
}
return ret;
}
template <class T> void fin(T s) { cout << s << endl, exit(0); }
// 便利 数学 math
ll mod(ll a, ll m) { return (a % m + m) % m; }
ll pow(ll a) { return a * a; };
ll fact(ll v) { return v <= 1 ? 1 : v * fact(v - 1); }
dou factd(int v) {
static vd fact(2, 1);
if (sz(fact) <= v) {
rep(i, sz(fact), v + 1) { fact.push_back(fact.back() * i); }
}
return fact[v];
}
ll comi(ll n, ll r) {
assert(n < 100);
static vvi(pas, 100, 100);
if (pas[0][0])
return pas[n][r];
pas[0][0] = 1;
rep(i, 1, 100) {
pas[i][0] = 1;
rep(j, 1, i + 1) pas[i][j] = pas[i - 1][j - 1] + pas[i - 1][j];
}
return pas[n][r];
}
double comd2(ll n, ll r) {
static vvd(comb, 2020, 2020);
if (comb[0][0] == 0) {
comb[0][0] = 1;
rep(i, 2000) {
comb[i + 1][0] = 1;
rep(j, 1, i + 2) { comb[i + 1][j] = comb[i][j] + comb[i][j - 1]; }
}
}
return comb[n][r];
}
double comd(int n, int r) {
if (r < 0 || r > n)
return 0;
if (n < 2020)
return comd2(n, r);
static vd fact(2, 1);
if (sz(fact) <= n) {
rep(i, sz(fact), n + 1) { fact.push_back(fact.back() * i); }
}
return fact[n] / fact[n - r] / fact[r];
}
ll gcd(ll a, ll b) {
while (b)
a %= b, swap(a, b);
return abs(a);
}
ll gcd(vi b) {
ll res = b[0];
rep(i, 1, sz(b)) res = gcd(b[i], res);
return res;
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll lcm(vi a) {
ll res = a[0];
rep(i, 1, sz(a)) res = lcm(a[i], res);
return res;
}
ll ceil(ll a, ll b) {
if (b == 0) {
debugline("ceil");
deb(a, b);
ole();
return -1;
} else if (a < 0) {
return 0;
} else {
return (a + b - 1) / b;
}
}
ll lower_remi__bx_a(ll kei, ll rem, ll x) {
if (rem >= x)
return 0;
return (x - rem + kei - 1) / kei;
}
ll lower_remv__bx_a(ll kei, ll rem, ll x) {
if (rem >= x)
return rem;
return (x - rem + kei - 1) / kei * kei + rem;
}
ll upper_remi__bx_a(ll kei, ll rem, ll x) {
if (rem > x)
return 0;
return (x - rem + kei) / kei;
}
ll upper_remv__bx_a(ll kei, ll rem, ll x) {
if (rem > x)
return rem;
return (x - rem + kei) / kei * kei + rem;
}
// v * v >= aとなる最小のvを返す
ll sqrt(ll a) {
if (a < 0) {
debugline("sqrt");
deb(a);
ole();
}
ll res = (ll)std::sqrt(a);
while (res * res < a)
++res;
return res;
}
double log(double e, double x) { return log(x) / log(e); }
ll sig(ll t) { return ((1 + t) * t) >> 1; }
ll sig(ll s, ll t) { return ((s + t) * (t - s + 1)) >> 1; }
// 機能拡張
template <class T, class U> void operator+=(pair<T, U> &a, pair<T, U> &b) {
a.fi += b.fi;
a.se += b.se;
}
template <class T, class U> pair<T, U> operator+(pair<T, U> &a, pair<T, U> &b) {
return pair<T, U>(a.fi + b.fi, a.se + b.se);
}
template <typename CharT, typename Traits, typename Alloc>
basic_string<CharT, Traits, Alloc>
operator+(const basic_string<CharT, Traits, Alloc> &lhs, const int rv) {
basic_string<CharT, Traits, Alloc> str(lhs);
str.append(to_string(rv));
return str;
}
template <typename CharT, typename Traits, typename Alloc>
void operator+=(basic_string<CharT, Traits, Alloc> &lhs, const int rv) {
lhs += to_string(rv);
}
template <typename CharT, typename Traits, typename Alloc>
basic_string<CharT, Traits, Alloc>
operator+(const basic_string<CharT, Traits, Alloc> &lhs, const signed rv) {
basic_string<CharT, Traits, Alloc> str(lhs);
str.append(to_string(rv));
return str;
}
template <typename CharT, typename Traits, typename Alloc>
void operator+=(basic_string<CharT, Traits, Alloc> &lhs, const signed rv) {
lhs += to_string(rv);
}
template <class T, class U> void operator+=(queue<T> &a, U v) { a.push(v); }
template <class T, class U> void operator+=(deque<T> &a, U v) {
a.push_back(v);
}
template <class T>
priority_queue<T, vector<T>, greater<T>> &
operator+=(priority_queue<T, vector<T>, greater<T>> &a, vector<T> &v) {
fora(d, v) a.push(d);
return a;
}
template <class T, class U>
priority_queue<T, vector<T>, greater<T>> &
operator+=(priority_queue<T, vector<T>, greater<T>> &a, U v) {
a.push(v);
return a;
}
template <class T, class U>
priority_queue<T> &operator+=(priority_queue<T> &a, U v) {
a.push(v);
return a;
}
template <class T> set<T> &operator+=(set<T> &a, vector<T> v) {
fora(d, v) a.insert(d);
return a;
}
template <class T, class U> auto operator+=(set<T> &a, U v) {
return a.insert(v);
}
template <class T, class U> auto operator-=(set<T> &a, U v) {
return a.erase(v);
}
template <class T, class U> auto operator+=(mset<T> &a, U v) {
return a.insert(v);
}
template <class T, class U>
set<T, greater<T>> &operator+=(set<T, greater<T>> &a, U v) {
a.insert(v);
return a;
}
template <class T, class U> vector<T> &operator+=(vector<T> &a, U v) {
a.push_back(v);
return a;
}
template <class T, class U> vector<T> operator+(const vector<T> &a, U v) {
vector<T> ret = a;
ret += v;
return ret;
}
template <class T, class U> vector<T> operator+(U v, const vector<T> &a) {
vector<T> ret = a;
ret.insert(ret.begin(), v);
return ret;
}
template <class T> vector<T> operator+(vector<T> a, vector<T> b) {
vector<T> ret;
ret = a;
fora(v, b) ret += v;
return ret;
}
template <class T> vector<T> &operator+=(vector<T> &a, vector<T> &b) {
fora(v, b) a += v;
return a;
}
template <class T> vector<T> &operator-=(vector<T> &a, vector<T> &b) {
if (sz(a) != sz(b)) {
debugline("vector<T> operator-=");
deb(a);
deb(b);
exit(0);
}
rep(i, sz(a)) a[i] -= b[i];
return a;
}
template <class T> vector<T> operator-(vector<T> &a, vector<T> &b) {
if (sz(a) != sz(b)) {
debugline("vector<T> operator-");
deb(a);
deb(b);
ole();
}
vector<T> res(sz(a));
rep(i, sz(a)) res[i] = a[i] - b[i];
return res;
}
template <class T, class U> vector<T> operator*(vector<T> &a, U b) {
vector<T> ret;
fora(v, a) ret += v * b;
return ret;
}
template <class T, class U> vector<T> operator/(vector<T> &a, U b) {
vector<T> ret;
fora(v, a) ret += v / b;
return ret;
}
template <class T, class U> vector<T> operator*=(vector<T> &a, U b) {
fora(v, a) v *= b;
return a;
}
template <class T, class U> vector<T> operator/=(vector<T> &a, U b) {
fora(v, a) v /= b;
return a;
}
template <typename T> void erase(vector<T> &v, unsigned ll i) {
v.erase(v.begin() + i);
}
template <typename T> void erase(vector<T> &v, unsigned ll s, unsigned ll e) {
v.erase(v.begin() + s, v.begin() + e);
}
template <class T, class U> void erase(map<T, U> &m, ll okl, ll ngr) {
m.erase(m.lower_bound(okl), m.lower_bound(ngr));
}
template <class T> void erase(set<T> &m, ll okl, ll ngr) {
m.erase(m.lower_bound(okl), m.lower_bound(ngr));
}
template <typename T> void erasen(vector<T> &v, unsigned ll s, unsigned ll n) {
v.erase(v.begin() + s, v.begin() + s + n);
}
template <typename T, typename U>
void insert(vector<T> &v, unsigned ll i, U t) {
v.insert(v.begin() + i, t);
}
template <typename T, typename U> void push_front(vector<T> &v, U t) {
v.insert(v.begin(), t);
}
template <typename T, typename U>
void insert(vector<T> &v, unsigned ll i, vector<T> list) {
for (auto &&va : list)
v.insert(v.begin() + i++, va);
}
template <typename T> void insert(set<T> &v, vector<T> list) {
for (auto &&va : list)
v.insert(va);
}
vector<string> split(const string a, const char deli) {
string b = a + deli;
ll l = 0, r = 0, n = b.size();
vector<string> res;
rep(i, n) {
if (b[i] == deli) {
r = i;
if (l < r)
res.push_back(b.substr(l, r - l));
l = i + 1;
}
}
return res;
}
vector<string> split(const string a, const string deli) {
vector<string> res;
ll kn = sz(deli);
std::string::size_type Pos(a.find(deli));
ll l = 0;
while (Pos != std::string::npos) {
if (Pos - l)
res.push_back(a.substr(l, Pos - l));
l = Pos + kn;
Pos = a.find(deli, Pos + kn);
}
if (sz(a) - l)
res.push_back(a.substr(l, sz(a) - l));
return res;
}
void yn(bool a) {
if (a)
cout << "yes" << endl;
else
cout << "no" << endl;
}
void Yn(bool a) {
if (a)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void YN(bool a) {
if (a)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void fyn(bool a) {
if (a)
cout << "yes" << endl;
else
cout << "no" << endl;
exit(0);
}
void fYn(bool a) {
if (a)
cout << "Yes" << endl;
else
cout << "No" << endl;
exit(0);
}
void fYN(bool a) {
if (a)
cout << "YES" << endl;
else
cout << "NO" << endl;
exit(0);
}
void Possible(bool a) {
if (a)
cout << "Possible" << endl;
else
cout << "Impossible" << endl;
exit(0);
}
void POSSIBLE(bool a) {
if (a)
cout << "POSSIBLE" << endl;
else
cout << "IMPOSSIBLE" << endl;
exit(0);
}
template <typename T> class fixed_point : T {
public:
explicit constexpr fixed_point(T &&t) noexcept : T(std::forward<T>(t)) {}
template <typename... Args>
constexpr decltype(auto) operator()(Args &&...args) const {
return T::operator()(*this, std::forward<Args>(args)...);
}
};
template <typename T>
static inline constexpr decltype(auto) fix(T &&t) noexcept {
return fixed_point<T>{std::forward<T>(t)};
}
//@formatter:off
template <typename T> T minv(T a, T m);
template <typename T> T minv(T a);
template <typename T> class Modular {
public:
using Type = typename decay<decltype(T::value)>::type;
constexpr Modular() : value() {}
template <typename U> Modular(const U &x) { value = normalize(x); }
template <typename U> static Type normalize(const U &x) {
Type v;
if (-mod() <= x && x < mod())
v = static_cast<Type>(x);
else
v = static_cast<Type>(x % mod());
if (v < 0)
v += mod();
return v;
}
const Type &operator()() const { return value; }
template <typename U> explicit operator U() const {
return static_cast<U>(value);
}
constexpr static Type mod() { return T::value; }
Modular &operator+=(const Modular &other) {
if ((value += other.value) >= mod())
value -= mod();
return *this;
}
Modular &operator-=(const Modular &other) {
if ((value -= other.value) < 0)
value += mod();
return *this;
}
template <typename U> Modular &operator+=(const U &other) {
return *this += Modular(other);
}
template <typename U> Modular &operator-=(const U &other) {
return *this -= Modular(other);
}
Modular &operator++() { return *this += 1; }
Modular &operator--() { return *this -= 1; }
Modular operator++(signed) {
Modular result(*this);
*this += 1;
return result;
}
Modular operator--(signed) {
Modular result(*this);
*this -= 1;
return result;
}
Modular operator-() const { return Modular(-value); }
template <typename U = T>
typename enable_if<is_same<typename Modular<U>::Type, signed>::value,
Modular>::type &
operator*=(const Modular &rhs) {
#ifdef _WIN32
uint64_t x = static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value);
uint32_t xh = static_cast<uint32_t>(x >> 32), xl = static_cast<uint32_t>(x),
d, m;
asm("divl %4; \n\t" : "=a"(d), "=d"(m) : "d"(xh), "a"(xl), "r"(mod()));
value = m;
#else
value = normalize(static_cast<int64_t>(value) *
static_cast<int64_t>(rhs.value));
#endif
return *this;
}
template <typename U = T>
typename enable_if<is_same<typename Modular<U>::Type, int64_t>::value,
Modular>::type &
operator*=(const Modular &rhs) {
int64_t q =
static_cast<int64_t>(static_cast<double>(value) * rhs.value / mod());
value = normalize(value * rhs.value - q * mod());
return *this;
}
template <typename U = T>
typename enable_if<!is_integral<typename Modular<U>::Type>::value,
Modular>::type &
operator*=(const Modular &rhs) {
value = normalize(value * rhs.value);
return *this;
}
Modular &operator/=(const Modular &other) {
return *this *= Modular(minv(other.value));
}
template <typename U>
friend bool operator==(const Modular<U> &lhs, const Modular<U> &rhs);
template <typename U>
friend bool operator<(const Modular<U> &lhs, const Modular<U> &rhs);
template <typename U>
friend std::istream &operator>>(std::istream &stream, Modular<U> &number);
operator int() { return value; }
private:
Type value;
};
template <typename T>
bool operator==(const Modular<T> &lhs, const Modular<T> &rhs) {
return lhs.value == rhs.value;
}
template <typename T, typename U>
bool operator==(const Modular<T> &lhs, U rhs) {
return lhs == Modular<T>(rhs);
}
template <typename T, typename U>
bool operator==(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) == rhs;
}
template <typename T>
bool operator!=(const Modular<T> &lhs, const Modular<T> &rhs) {
return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(const Modular<T> &lhs, U rhs) {
return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(U lhs, const Modular<T> &rhs) {
return !(lhs == rhs);
}
template <typename T>
bool operator<(const Modular<T> &lhs, const Modular<T> &rhs) {
return lhs.value < rhs.value;
}
template <typename T>
Modular<T> operator+(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T, typename U>
Modular<T> operator+(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T, typename U>
Modular<T> operator+(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T>
Modular<T> operator-(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
Modular<T> operator-(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
Modular<T> operator-(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T>
Modular<T> operator*(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
Modular<T> operator*(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
Modular<T> operator*(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T>
Modular<T> operator/(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> operator/(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> operator/(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) /= rhs;
}
constexpr signed MOD =
// 998244353;
1e9 + 7; // MOD
using mint = Modular<std::integral_constant<decay<decltype(MOD)>::type, MOD>>;
constexpr int mint_len = 1400001;
vi fac, finv, inv;
vi p2;
mint com(int n, int r) {
if (r < 0 || r > n)
return 0;
return mint(finv[r] * fac[n] % MOD * finv[n - r]);
}
mint pom(int n, int r) { /* if (!sz(fac)) com(0, -1);*/
if (r < 0 || r > n)
return 0;
return mint(fac[n] * finv[n - 1]);
}
mint npr(int n, int r) { /* if (!sz(fac)) com(0, -1);*/
if (r < 0 || r > n)
return 0;
return mint(fac[n] * finv[n - r]);
}
int nprin(int n, int r) { /* if (!sz(fac)) com(0, -1);*/
if (r < 0 || r > n)
return 0;
return fac[n] * finv[n - r] % MOD;
}
int icom(int n, int r) {
const int NUM_ = 1400001;
static ll fac[NUM_ + 1], finv[NUM_ + 1], inv[NUM_ + 1];
if (fac[0] == 0) {
inv[1] = fac[0] = finv[0] = 1;
for (int i = 2; i <= NUM_; ++i)
inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
for (int i = 1; i <= NUM_; ++i)
fac[i] = fac[i - 1] * i % MOD, finv[i] = finv[i - 1] * inv[i] % MOD;
}
if (r < 0 || r > n)
return 0;
return ((finv[r] * fac[n] % MOD) * finv[n - r]) % MOD;
}
#define ncr com
#define ncri icom
// n個の場所にr個の物を置く
mint nhr(int n, int r) { return com(n + r - 1, r); }
mint hom(int n, int r) { return com(n + r - 1, r); }
int nhri(int n, int r) { return icom(n + r - 1, r); }
template <typename T> T minv(T a, T m) {
T u = 0, v = 1;
while (a != 0) {
T t = m / a;
m -= t * a;
swap(a, m);
u -= t * v;
swap(u, v);
}
assert(m == 1);
return u;
}
template <typename T> T minv(T a) {
if (a < mint_len)
return inv[a];
T u = 0, v = 1;
T m = MOD;
while (a != 0) {
T t = m / a;
m -= t * a;
swap(a, m);
u -= t * v;
swap(u, v);
}
assert(m == 1);
return u;
}
template <typename T, typename U>
Modular<T> mpow(const Modular<T> &a, const U &b) {
assert(b >= 0);
int x = a(), res = 1;
U p = b;
while (p > 0) {
if (p & 1)
(res *= x) %= MOD;
(x *= x) %= MOD;
p >>= 1;
}
return res;
}
template <typename T, typename U, typename V>
mint mpow(const T a, const U b, const V m = MOD) {
assert(b >= 0);
int x = a, res = 1;
U p = b;
while (p > 0) {
if (p & 1)
(res *= x) %= m;
(x *= x) %= m;
p >>= 1;
}
return res;
}
template <typename T, typename U> mint mpow(const T a, const U b) {
assert(b >= 0);
int x = a, res = 1;
U p = b;
while (p > 0) {
if (p & 1)
(res *= x) %= MOD;
(x *= x) %= MOD;
p >>= 1;
}
return res;
}
template <typename T, typename U, typename V>
int mpowi(const T &a, const U &b, const V &m = MOD) {
assert(b >= 0);
int x = a, res = 1;
U p = b;
while (p > 0) {
if (p & 1)
(res *= x) %= m;
(x *= x) %= m;
p >>= 1;
}
return res;
}
template <typename T> string to_string(const Modular<T> &number) {
return to_string(number());
}
string yuri(const mint &a) {
stringstream st;
rep(i, 300) {
rep(j, 300) {
if ((mint)i / j == a) {
st << i << " / " << j;
return st.str();
}
}
}
rep(i, 1000) {
rep(j, 1000) {
if ((mint)i / j == a) {
st << i << " / " << j;
return st.str();
}
}
}
return st.str();
}
template <typename T>
std::ostream &operator<<(std::ostream &stream, const Modular<T> &number) {
stream << number();
#ifdef _DEBUG
// stream << " -> " << yuri(number);
#endif
return stream;
}
//@formatter:off
template <typename T>
std::istream &operator>>(std::istream &stream, Modular<T> &number) {
typename common_type<typename Modular<T>::Type, int64_t>::type x;
stream >> x;
number.value = Modular<T>::normalize(x);
return stream;
}
using PM = pair<mint, mint>;
using vm = vector<mint>;
using mapm = map<int, mint>;
using umapm = umap<int, mint>;
#define vvm(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(mint, __VA_ARGS__)
#define vnm(name, ...) auto name = make_v<mint>(__VA_ARGS__)
struct setmod {
setmod() {
// p2.resize(mint_len);p2[0] = 1; for (int i = 1; i < mint_len; ++i)
// p2[i] = p2[i - 1] * 2 % MOD;
fac.resize(mint_len);
finv.resize(mint_len);
inv.resize(mint_len);
inv[1] = fac[0] = finv[0] = 1;
for (int i = 2; i < mint_len; ++i)
inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
for (int i = 1; i < mint_len; ++i)
fac[i] = fac[i - 1] * i % MOD, finv[i] = finv[i - 1] * inv[i] % MOD;
}
} setmodv;
//@formatter:on
// nhr n個の場所にr個の物を分ける
//@起動時
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(16);
srand((unsigned)clock() + (unsigned)time(NULL));
};
} initonv; //@formatter:on
// gra mll pr
// 上下左右
const string udlr = "udlr";
string UDLR = "UDLR"; // x4と連動 UDLR.find('U') := x4[0]
// 右、上が正
constexpr ll y4[] = {1, -1, 0, 0};
constexpr ll x4[] = {0, 0, -1, 1};
constexpr ll y8[] = {0, 1, 0, -1, -1, 1, 1, -1};
constexpr ll x8[] = {1, 0, -1, 0, 1, -1, 1, -1};
ll n, m, k, K, d, H, W, x, y, z, q, Q;
ll cou;
vi a, b, c;
// vvi (s, 0, 0);
vvc(ba, 0, 0);
vp p;
str s;
void solve() {
in(n);
in(s);
// vvi(dp, 5050, 5050);
vvi(dp, 50, 50);
rer(i, n - 1) {
rer(j, n - 1, i + 1) {
if (s[i] == s[j]) {
chma(dp[i][j], dp[i + 1][j + 1] + 1);
chmi(dp[i][j], j - i);
}
}
}
deb(dp);
cout << max(dp) << endl;
}
auto my(ll n, vi &a) { return 0; }
auto sister(ll n, vi &a) {
ll ret = 0;
return ret;
}
signed main() {
solve();
#define arg n, a
#ifdef _DEBUG
bool bad = 0;
for (ll i = 0, ok = 1; i < k5 && ok; ++i) {
ll n = rand(1, 8);
vi a = ranv(n, 1, 10);
auto myres = my(arg);
auto res = sister(arg);
ok = myres == res;
if (!ok) {
out(arg);
cerr << "AC : " << res << endl;
cerr << "MY : " << myres << endl;
bad = 1;
break;
}
}
if (!bad) {
// cout << "完璧 : solveを書き直そう" << endl;
// cout << " : そして、solve()を呼び出すのだ" << endl;
// cout << " : cin>>n; na(a,n);も忘れるな" << endl;
}
#endif
return 0;
};
| // #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long
#define ll long long
auto start_time = system_clock::now();
//@formatter:off
#ifdef _DEBUG
// 区間削除は出来ない
template <class T> struct my_pbds_tree {
set<T> s;
auto begin() { return s.begin(); }
auto end() { return s.end(); }
auto rbegin() { return s.rbegin(); }
auto rend() { return s.rend(); }
auto empty() { return s.empty(); }
auto size() { return s.size(); }
void clear() { s.clear(); }
template <class U> void insert(U v) { s.insert(v); }
template <class U> void operator+=(U v) { insert(v); }
template <class F> auto erase(F v) { return s.erase(v); }
template <class U> auto find(U v) { return s.find(v); }
template <class U> auto lower_bound(U v) { return s.lower_bound(v); }
template <class U> auto upper_bound(U v) { return s.upper_bound(v); }
auto find_by_order(ll k) {
auto it = s.begin();
for (ll i = 0; i < k; i++)
it++;
return it;
}
auto order_of_key(ll v) {
auto it = s.begin();
ll i = 0;
for (; it != s.end() && *it < v; i++)
it++;
return i;
}
};
#define pbds(T) my_pbds_tree<T>
#else
#define unordered_map __gnu_pbds::gp_hash_table
// find_by_order(k) k番目のイテレーター
// order_of_key(k) k以上が前から何番目か
#define pbds(U) \
__gnu_pbds::tree<U, __gnu_pbds::null_type, less<U>, __gnu_pbds::rb_tree_tag, \
__gnu_pbds::tree_order_statistics_node_update>
#endif
struct xorshift {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
size_t operator()(std::pair<ll, ll> x) const {
ll v = ((x.first) << 32) | x.second;
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(v + FIXED_RANDOM);
}
};
template <class U, class L>
void operator+=(
__gnu_pbds::tree<U, __gnu_pbds::null_type, less<U>, __gnu_pbds::rb_tree_tag,
__gnu_pbds::tree_order_statistics_node_update> &s,
L v) {
s.insert(v);
}
// 衝突対策
#define ws wszzzz
template <class A, class B, class C> struct T2 {
A f;
B s;
C t;
T2() { f = 0, s = 0, t = 0; }
T2(A f, B s, C t) : f(f), s(s), t(t) {}
bool operator<(const T2 &r) const {
return f != r.f ? f < r.f
: s != r.s ? s < r.s
: t < r.t; /*return f != r.f ? f > r.f : s != r.s ?n s >
r.s : t > r.t; 大きい順 */
}
bool operator>(const T2 &r) const {
return f != r.f ? f > r.f
: s != r.s ? s > r.s
: t > r.t; /*return f != r.f ? f > r.f : s != r.s ? s >
r.s : t > r.t; 小さい順 */
}
bool operator==(const T2 &r) const {
return f == r.f && s == r.s && t == r.t;
}
bool operator!=(const T2 &r) const {
return f != r.f || s != r.s || t != r.t;
}
};
template <class A, class B, class C, class D> struct F2 {
A a;
B b;
C c;
D d;
F2() { a = 0, b = 0, c = 0, d = 0; }
F2(A a, B b, C c, D d) : a(a), b(b), c(c), d(d) {}
bool operator<(const F2 &r) const {
return a != r.a ? a < r.a
: b != r.b ? b < r.b
: c != r.c ? c < r.c
: d < r.d; /* return a != r.a ? a > r.a : b != r.b ? b
> r.b : c != r.c ? c > r.c : d > r.d;*/
}
bool operator>(const F2 &r) const {
return a != r.a ? a > r.a
: b != r.b ? b > r.b
: c != r.c ? c > r.c
: d > r.d; /* return a != r.a ? a < r.a : b != r.b
? b < r.b : c != r.c ? c < r.c : d < r.d;*/
}
bool operator==(const F2 &r) const {
return a == r.a && b == r.b && c == r.c && d == r.d;
}
bool operator!=(const F2 &r) const {
return a != r.a || b != r.b || c != r.c || d != r.d;
}
ll operator[](ll i) {
assert(i < 4);
return i == 0 ? a : i == 1 ? b : i == 2 ? c : d;
}
};
typedef T2<ll, ll, ll> T;
typedef F2<ll, ll, ll, ll> F;
T mt(ll a, ll b, ll c) { return T(a, b, c); }
//@マクロ省略系 型,構造
#define double long double
#define ull unsigned long long
using dou = double;
using itn = int;
using str = string;
using bo = bool;
#define au auto
using P = pair<ll, ll>;
#define fi first
#define se second
#define beg begin
#define rbeg rbegin
#define con continue
#define bre break
#define brk break
#define is ==
#define el else
#define elf else if
#define wh while
#define upd update
#define maxq 1
#define minq -1
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MALLOC(type, len) (type *)malloc((len) * sizeof(type))
#define lam(right) [&](ll &p) { return p right; }
// マクロ省略系 コンテナ
using vi = vector<ll>;
using vb = vector<bool>;
using vs = vector<string>;
using vd = vector<double>;
using vc = vector<char>;
using vp = vector<P>;
using vt = vector<T>;
#define vec vector
#define o_vvt(o1, o2, o3, o4, name, ...) name
#define vvt0(t) vec<vec<t>>
#define vvt1(t, a) vec<vec<t>> a
#define vvt2(t, a, b) vec<vec<t>> a(b)
#define vvt3(t, a, b, c) vec<vec<t>> a(b, vec<t>(c))
#define vvt4(t, a, b, c, d) vec<vec<t>> a(b, vec<t>(c, d))
#define vvi(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(ll, __VA_ARGS__)
#define vvb(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(bool, __VA_ARGS__)
#define vvs(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(string, __VA_ARGS__)
#define vvd(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(double, __VA_ARGS__)
#define vvc(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(char, __VA_ARGS__)
#define vvp(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(P, __VA_ARGS__)
#define vvt(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(T, __VA_ARGS__)
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
#define vni(name, ...) auto name = make_v<ll>(__VA_ARGS__)
#define vnb(name, ...) auto name = make_v<bool>(__VA_ARGS__)
#define vns(name, ...) auto name = make_v<string>(__VA_ARGS__)
#define vnd(name, ...) auto name = make_v<double>(__VA_ARGS__)
#define vnc(name, ...) auto name = make_v<char>(__VA_ARGS__)
#define vnp(name, ...) auto name = make_v<P>(__VA_ARGS__)
#define PQ priority_queue<ll, vector<ll>, greater<ll>>
#define tos to_string
using mapi = map<ll, ll>;
using mapp = map<P, ll>;
using mapd = map<dou, ll>;
using mapc = map<char, ll>;
using maps = map<str, ll>;
using seti = set<ll>;
using setd = set<dou>;
using setc = set<char>;
using sets = set<str>;
using qui = queue<ll>;
#define bset bitset
#define uset unordered_set
#define useti unordered_set<ll, ll, xorshift>
#define mset multiset
#define mseti multiset<ll>
#define umap unordered_map
#define umapi unordered_map<ll, ll, xorshift>
#define umapp unordered_map<P, ll, xorshift>
#define mmap multimap
template <class T> struct pq {
priority_queue<T, vector<T>, greater<T>> q; /*小さい順*/
T su = 0;
void clear() {
q = priority_queue<T, vector<T>, greater<T>>();
su = 0;
}
void operator+=(T v) {
su += v;
q.push(v);
}
T sum() { return su; }
T top() { return q.top(); }
void pop() {
su -= q.top();
q.pop();
}
T poll() {
T ret = q.top();
su -= ret;
q.pop();
return ret;
}
ll size() { return q.size(); }
};
template <class T> struct pqg {
priority_queue<T> q; /*大きい順*/
T su = 0;
void clear() {
q = priority_queue<T>();
su = 0;
}
void operator+=(T v) {
su += v;
q.push(v);
}
T sum() { return su; }
T top() { return q.top(); }
void pop() {
su -= q.top();
q.pop();
}
T poll() {
T ret = q.top();
su -= ret;
q.pop();
return ret;
}
ll size() { return q.size(); }
};
#define pqi pq<ll>
#define pqgi pqg<ll>
// マクロ 繰り返し
#define o_rep(o1, o2, o3, o4, name, ...) name
#define rep1(n) for (ll rep1i = 0, rep1lim = n; rep1i < rep1lim; ++rep1i)
#define rep2(i, n) for (ll i = 0, rep2lim = n; i < rep2lim; ++i)
#define rep3(i, m, n) for (ll i = m, rep3lim = n; i < rep3lim; ++i)
#define rep4(i, m, n, ad) for (ll i = m, rep4lim = n; i < rep4lim; i += ad)
#define rep(...) o_rep(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rer2(i, n) for (ll i = n; i >= 0; i--)
#define rer3(i, m, n) for (ll i = m, rer3lim = n; i >= rer3lim; i--)
#define rer4(i, m, n, dec) for (ll i = m, rer4lim = n; i >= rer4lim; i -= dec)
#define rer(...) o_rep(__VA_ARGS__, rer4, rer3, rer2, )(__VA_ARGS__)
#define reps2(i, j, n) \
for (ll i = 0, reps2lim = n; i < reps2lim; ++i) \
for (ll j = 0; j < reps2lim; ++j)
#define reps3(i, j, k, n) \
for (ll i = 0, reps3lim = n; i < reps3lim; ++i) \
for (ll j = 0; j < reps3lim; ++j) \
for (ll k = 0; k < reps3lim; ++k)
#define reps4(i, j, k, l, n) \
for (ll i = 0, reps4lim = n; i < reps4lim; ++i) \
for (ll j = 0; j < reps4lim; ++j) \
for (ll k = 0; k < reps4lim; ++k) \
for (ll l = 0; l < reps4lim; ++l)
#define o_reps(o1, o2, o3, o4, o5, name, ...) name
#define reps(...) o_reps(__VA_ARGS__, reps4, reps3, reps2, rep2, )(__VA_ARGS__)
#define repss(i, j, k, a, b, c) \
for (ll i = 0; i < a; ++i) \
for (ll j = 0; j < b; ++j) \
for (ll k = 0; k < c; ++k)
#define fora(a, b) for (auto &&a : b)
// インデックスを前後含めて走査
#define fori(i, s, len) \
for (int i = s, prev = (s == 0) ? len - 1 : s - 1, \
next = (s == len - 1) ? 0 : s + 1, cou = 0; \
cou < len; \
cou++, prev = i, i = next, next = (next == len - 1) ? 0 : next + 1)
#define form(st, l, r) \
for (auto &&it = st.lower_bound(l); it != st.end() && (*it).fi < r; ++it)
#define forit(st, l, r) \
for (auto &&it = st.lower_bound(l); it != st.end() && (*it) < r;)
// マクロ 定数
#define k3 1010
#define k4 10101
#define k5 101010
#define k6 1010101
#define k7 10101010
const ll inf = (ll)1e9 + 100;
const ll linf = (ll)1e18 + 100;
const char infc = '{';
const string infs = "{";
const double eps = 1e-9;
const double PI = 3.1415926535897932384626433832795029L;
ll ma = numeric_limits<ll>::min();
ll mi = numeric_limits<ll>::max();
// マクロ省略形 関数等
#define arsz(a) (sizeof(a) / sizeof(a[0]))
#define sz(a) ((ll)(a).size())
#define mp make_pair
#define pb pop_back
#define pf push_front
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
constexpr bool ev(ll a) { return !(a & 1); }
constexpr bool od(ll a) { return (a & 1); }
//@拡張系 こう出来るべきというもの
// 埋め込み 存在を意識せずに機能を増やされているもの
//@formatter:on
namespace std {
template <> class hash<std::pair<signed, signed>> {
public:
size_t operator()(const std::pair<signed, signed> &x) const {
return hash<ll>()(((ll)x.first << 32) | x.second);
}
};
template <> class hash<std::pair<ll, ll>> {
public
: /*大きいllが渡されると、<<32でオーバーフローするがとりあえず問題ないと判断*/
size_t operator()(const std::pair<ll, ll> &x) const {
return hash<ll>()(((ll)x.first << 32) | x.second);
}
};
} // namespace std
//@formatter:off
// stream まとめ
istream &operator>>(istream &iss, P &a) {
iss >> a.first >> a.second;
return iss;
}
template <typename T> istream &operator>>(istream &iss, vector<T> &vec) {
for (T &x : vec)
iss >> x;
return iss;
}
template <class T, class U> ostream &operator<<(ostream &os, pair<T, U> p) {
os << p.fi << " " << p.se << endl;
return os;
}
ostream &operator<<(ostream &os, T p) {
os << p.f << " " << p.s << " " << p.t;
return os;
}
ostream &operator<<(ostream &os, F p) {
os << p.a << " " << p.b << " " << p.c << " " << p.d;
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
for (ll i = 0; i < vec.size(); ++i)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<vector<T>> &vec) {
for (ll i = 0; i < vec.size(); ++i) {
for (ll j = 0; j < vec[i].size(); ++j) {
os << vec[i][j] << " ";
}
os << endl;
}
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &m) {
for (auto &&v : m)
os << v;
return os;
}
template <class T> ostream &operator<<(ostream &os, set<T> s) {
fora(v, s) { os << v << " "; }
return os;
}
template <class T> ostream &operator<<(ostream &os, deque<T> a) {
fora(v, a) os << v << " ";
return os;
}
template <typename W, typename H> void resize(vector<W> &vec, const H head) {
vec.resize(head);
}
template <typename W, typename H, typename... T>
void resize(vector<W> &vec, const H &head, const T... tail) {
vec.resize(head);
for (auto &v : vec)
resize(v, tail...);
}
template <typename T, typename F> bool all_of2(T &v, F f) { return f(v); }
template <typename T, typename F> bool all_of2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (!all_of2(v[i], f))
return false;
}
return true;
}
template <typename T, typename F> bool any_of2(T &v, F f) { return f(v); }
template <typename T, typename F> bool any_of2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (any_of2(v[i], f))
return true;
}
return false;
}
template <typename T, typename F> bool none_of2(T &v, F f) { return f(v); }
template <typename T, typename F> bool none_of2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (none_of2(v[i], f))
return false;
}
return true;
}
template <typename T, typename F> bool find_if2(T &v, F f) { return f(v); }
template <typename T, typename F> ll find_if2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (find_if2(v[i], f))
return i;
}
return sz(v);
}
template <typename T, typename F> bool rfind_if2(T &v, F f) { return f(v); }
template <typename T, typename F> ll rfind_if2(vector<T> &v, F f) {
rer(i, sz(v) - 1) {
if (rfind_if2(v[i], f))
return i;
}
return -1;
}
template <class T> bool contains(string &s, const T &v) {
return s.find(v) != string::npos;
}
template <typename T> bool contains(vector<T> &v, const T &val) {
return std::find(v.begin(), v.end(), val) != v.end();
}
template <typename T, typename F> bool contains_if2(vector<T> &v, F f) {
return find_if(v.begin(), v.end(), f) != v.end();
}
template <typename T, typename F> ll count_if2(T &v, F f) { return f(v); }
template <typename T, typename F> ll count_if2(vector<T> &vec, F f) {
ll ret = 0;
fora(v, vec) ret += count_if2(v, f);
return ret;
}
template <typename T, typename F> void for_each2(T &v, F f) { f(v); }
template <typename T, typename F> void for_each2(vector<T> &vec, F f) {
fora(v, vec) for_each2(v, f);
}
template <typename W> ll count_od(vector<W> &a) {
return count_if2(a, [](ll v) { return v & 1; });
}
template <typename W> ll count_ev(vector<W> &a) {
return count_if2(a, [](ll v) { return !(v & 1); });
}
#define all_of(a, right) all_of2(a, lam(right))
#define any_of(a, right) any_of2(a, lam(right))
#define none_of(a, right) none_of2(a, lam(right))
#define find_if(a, right) find_if2(a, lam(right))
#define rfind_if(a, right) rfind_if2(a, lam(right))
#define contains_if(a, right) contains_if2(a, lam(right))
#define count_if(a, right) count_if2(a, lam(right))
#define for_each(a, right) \
do { \
fora(v, a) { v right; } \
} while (0)
template <class T, class U> void replace(vector<T> &a, T key, U v) {
replace(a.begin(), a.end(), key, v);
}
void replace(str &a, char key, str v) {
if (v == "")
a.erase(remove(all(a), key), a.end());
}
void replace(str &a, char key, char v) { replace(all(a), key, v); }
// keyと同じかどうか01で置き換える
template <class T, class U> void replace(vector<T> &a, U k) {
rep(i, sz(a)) a[i] = a[i] == k;
}
template <class T, class U> void replace(vector<vector<T>> &a, U k) {
rep(i, sz(a)) rep(j, sz(a[0])) a[i][j] = a[i][j] == k;
}
template <class T> void replace(T &a) { replace(a, '#'); }
void replace(str &a, str key, str v) {
stringstream t;
ll kn = sz(key);
std::string::size_type Pos(a.find(key));
ll l = 0;
while (Pos != std::string::npos) {
t << a.substr(l, Pos - l);
t << v;
l = Pos + kn;
Pos = a.find(key, Pos + kn);
}
t << a.substr(l, sz(a) - l);
a = t.str();
}
template <class T> bool includes(vector<T> &a, vector<T> &b) {
vi c = a;
vi d = b;
sort(all(c));
sort(all(d));
return includes(all(c), all(d));
}
template <class T> bool is_permutation(vector<T> &a, vector<T> &b) {
return is_permutation(all(a), all(b));
}
template <class T> bool next_permutation(vector<T> &a) {
return next_permutation(all(a));
}
void iota(vector<ll> &ve, ll s, ll n) {
ve.resize(n);
iota(all(ve), s);
}
vi iota(ll s, ll len) {
vi ve(len);
iota(all(ve), s);
return ve;
}
template <class A, class B> auto vtop(vector<A> &a, vector<B> &b) {
assert(sz(a) == sz(b)); /*stringを0で初期化できない */
vector<pair<A, B>> res;
rep(i, sz(a)) res.eb(a[i], b[i]);
return res;
}
template <class A, class B>
void ptov(vector<pair<A, B>> &p, vector<A> &a, vector<B> &b) {
a.resize(sz(p)), b.resize(sz(p));
rep(i, sz(p)) a[i] = p[i].fi, b[i] = p[i].se;
}
template <class A, class B, class C>
auto vtot(vector<A> &a, vector<B> &b, vector<C> &c) {
assert(sz(a) == sz(b) && sz(b) == sz(c));
vector<T2<A, B, C>> res;
rep(i, sz(a)) res.eb(a[i], b[i], c[i]);
return res;
}
template <class A, class B, class C, class D>
auto vtof(vector<A> &a, vector<B> &b, vector<C> &c, vector<D> &d) {
assert(sz(a) == sz(b) && sz(b) == sz(c) && sz(c) == sz(d));
vector<F2<A, B, C, D>> res;
rep(i, sz(a)) res.eb(a[i], b[i], c[i], d[i]);
return res;
}
enum pcomparator { fisi, fisd, fdsi, fdsd, sifi, sifd, sdfi, sdfd };
enum tcomparator {
fisiti,
fisitd,
fisdti,
fisdtd,
fdsiti,
fdsitd,
fdsdti,
fdsdtd,
fitisi,
fitisd,
fitdsi,
fitdsd,
fdtisi,
fdtisd,
fdtdsi,
fdtdsd,
sifiti,
sifitd,
sifdti,
sifdtd,
sdfiti,
sdfitd,
sdfdti,
sdfdtd,
sitifi,
sitifd,
sitdfi,
sitdfd,
sdtifi,
sdtifd,
sdtdfi,
sdfdfd,
tifisi,
tifisd,
tifdsi,
tifdsd,
tdfisi,
tdfisd,
tdfdsi,
tdfdsd,
tisifi,
tisifd,
tisdfi,
tisdfd,
tdsifi,
tdsifd,
tdsdfi,
tdsdfd
};
template <class A, class B> void sort(vector<pair<A, B>> &a, pcomparator type) {
typedef pair<A, B> U;
if (type == fisi)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi < r.fi : l.se < r.se; });
else if (type == fisd)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi < r.fi : l.se > r.se; });
else if (type == fdsi)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi > r.fi : l.se < r.se; });
else if (type == fdsd)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi > r.fi : l.se > r.se; });
else if (type == sifi)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se < r.se : l.fi < r.fi; });
else if (type == sifd)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se < r.se : l.fi > r.fi; });
else if (type == sdfi)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se > r.se : l.fi < r.fi; });
else if (type == sdfd)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se > r.se : l.fi > r.fi; });
};
template <class U> void sort(vector<U> &a, pcomparator type) {
if (type == fisi)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f < r.f : l.s < r.s; });
else if (type == fisd)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f < r.f : l.s > r.s; });
else if (type == fdsi)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f > r.f : l.s < r.s; });
else if (type == fdsd)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f > r.f : l.s > r.s; });
else if (type == sifi)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s < r.s : l.f < r.f; });
else if (type == sifd)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s < r.s : l.f > r.f; });
else if (type == sdfi)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s > r.s : l.f < r.f; });
else if (type == sdfd)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s > r.s : l.f > r.f; });
};
template <class A, class B, class C, class D>
void sort(vector<F2<A, B, C, D>> &a, pcomparator type) {
typedef F2<A, B, C, D> U;
if (type == fisi)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a < r.a : l.b < r.b; });
else if (type == fisd)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a < r.a : l.b > r.b; });
else if (type == fdsi)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a > r.a : l.b < r.b; });
else if (type == fdsd)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a > r.a : l.b > r.b; });
else if (type == sifi)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b < r.b : l.a < r.a; });
else if (type == sifd)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b < r.b : l.a > r.a; });
else if (type == sdfi)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b > r.b : l.a < r.a; });
else if (type == sdfd)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b > r.b : l.a > r.a; });
};
template <class U> void sort(vector<U> &a, tcomparator type) {
if (type == 0)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s < r.s : l.t < r.t;
});
else if (type == 1)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s < r.s : l.t > r.t;
});
else if (type == 2)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s > r.s : l.t < r.t;
});
else if (type == 3)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s > r.s : l.t > r.t;
});
else if (type == 4)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s < r.s : l.t < r.t;
});
else if (type == 5)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s < r.s : l.t > r.t;
});
else if (type == 6)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s > r.s : l.t < r.t;
});
else if (type == 7)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s > r.s : l.t > r.t;
});
else if (type == 8)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t < r.t : l.s < r.s;
});
else if (type == 9)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t < r.t : l.s > r.s;
});
else if (type == 10)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t > r.t : l.s < r.s;
});
else if (type == 11)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t > r.t : l.s > r.s;
});
else if (type == 12)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t < r.t : l.s < r.s;
});
else if (type == 13)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t < r.t : l.s > r.s;
});
else if (type == 14)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t > r.t : l.s < r.s;
});
else if (type == 15)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t > r.t : l.s > r.s;
});
else if (type == 16)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f < r.f : l.t < r.t;
});
else if (type == 17)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f < r.f : l.t > r.t;
});
else if (type == 18)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f > r.f : l.t < r.t;
});
else if (type == 19)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f > r.f : l.t > r.t;
});
else if (type == 20)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f < r.f : l.t < r.t;
});
else if (type == 21)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f < r.f : l.t > r.t;
});
else if (type == 22)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f > r.f : l.t < r.t;
});
else if (type == 23)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f > r.f : l.t > r.t;
});
else if (type == 24)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t < r.t : l.f < r.f;
});
else if (type == 25)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t < r.t : l.f > r.f;
});
else if (type == 26)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t > r.t : l.f < r.f;
});
else if (type == 27)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t > r.t : l.f > r.f;
});
else if (type == 28)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t < r.t : l.f < r.f;
});
else if (type == 29)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t < r.t : l.f > r.f;
});
else if (type == 30)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t > r.t : l.f < r.f;
});
else if (type == 31)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t > r.t : l.f > r.f;
});
else if (type == 32)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f < r.f : l.s < r.s;
});
else if (type == 33)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f < r.f : l.s > r.s;
});
else if (type == 34)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f > r.f : l.s < r.s;
});
else if (type == 35)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f > r.f : l.s > r.s;
});
else if (type == 36)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f < r.f : l.s < r.s;
});
else if (type == 37)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f < r.f : l.s > r.s;
});
else if (type == 38)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f > r.f : l.s < r.s;
});
else if (type == 39)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f > r.f : l.s > r.s;
});
else if (type == 40)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s < r.s : l.f < r.f;
});
else if (type == 41)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s < r.s : l.f > r.f;
});
else if (type == 42)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s > r.s : l.f < r.f;
});
else if (type == 43)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s > r.s : l.f > r.f;
});
else if (type == 44)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s < r.s : l.f < r.f;
});
else if (type == 45)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s < r.s : l.f > r.f;
});
else if (type == 46)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s > r.s : l.f < r.f;
});
else if (type == 47)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s > r.s : l.f > r.f;
});
}
template <class A, class B, class C, class D>
void sort(vector<F2<A, B, C, D>> &a, tcomparator type) {
typedef F2<A, B, C, D> U;
if (type == 0)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b < r.b : l.c < r.c;
});
else if (type == 1)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b < r.b : l.c > r.c;
});
else if (type == 2)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b > r.b : l.c < r.c;
});
else if (type == 3)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b > r.b : l.c > r.c;
});
else if (type == 4)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b < r.b : l.c < r.c;
});
else if (type == 5)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b < r.b : l.c > r.c;
});
else if (type == 6)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b > r.b : l.c < r.c;
});
else if (type == 7)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b > r.b : l.c > r.c;
});
else if (type == 8)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c < r.c : l.b < r.b;
});
else if (type == 9)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c < r.c : l.b > r.b;
});
else if (type == 10)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c > r.c : l.b < r.b;
});
else if (type == 11)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c > r.c : l.b > r.b;
});
else if (type == 12)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c < r.c : l.b < r.b;
});
else if (type == 13)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c < r.c : l.b > r.b;
});
else if (type == 14)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c > r.c : l.b < r.b;
});
else if (type == 15)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c > r.c : l.b > r.b;
});
else if (type == 16)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a < r.a : l.c < r.c;
});
else if (type == 17)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a < r.a : l.c > r.c;
});
else if (type == 18)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a > r.a : l.c < r.c;
});
else if (type == 19)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a > r.a : l.c > r.c;
});
else if (type == 20)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a < r.a : l.c < r.c;
});
else if (type == 21)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a < r.a : l.c > r.c;
});
else if (type == 22)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a > r.a : l.c < r.c;
});
else if (type == 23)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a > r.a : l.c > r.c;
});
else if (type == 24)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c < r.c : l.a < r.a;
});
else if (type == 25)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c < r.c : l.a > r.a;
});
else if (type == 26)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c > r.c : l.a < r.a;
});
else if (type == 27)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c > r.c : l.a > r.a;
});
else if (type == 28)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c < r.c : l.a < r.a;
});
else if (type == 29)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c < r.c : l.a > r.a;
});
else if (type == 30)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c > r.c : l.a < r.a;
});
else if (type == 31)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c > r.c : l.a > r.a;
});
else if (type == 32)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a < r.a : l.b < r.b;
});
else if (type == 33)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a < r.a : l.b > r.b;
});
else if (type == 34)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a > r.a : l.b < r.b;
});
else if (type == 35)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a > r.a : l.b > r.b;
});
else if (type == 36)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a < r.a : l.b < r.b;
});
else if (type == 37)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a < r.a : l.b > r.b;
});
else if (type == 38)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a > r.a : l.b < r.b;
});
else if (type == 39)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a > r.a : l.b > r.b;
});
else if (type == 40)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b < r.b : l.a < r.a;
});
else if (type == 41)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b < r.b : l.a > r.a;
});
else if (type == 42)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b > r.b : l.a < r.a;
});
else if (type == 43)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b > r.b : l.a > r.a;
});
else if (type == 44)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b < r.b : l.a < r.a;
});
else if (type == 45)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b < r.b : l.a > r.a;
});
else if (type == 46)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b > r.b : l.a < r.a;
});
else if (type == 47)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b > r.b : l.a > r.a;
});
}
void sort(string &a) { sort(all(a)); }
template <class T> void sort(vector<T> &a) { sort(all(a)); }
// P l, P rで f(P) の形で渡す
template <class U, class F> void sort(vector<U> &a, F f) {
sort(all(a), [&](U l, U r) { return f(l) < f(r); });
};
template <class T> void rsort(vector<T> &a) { sort(all(a), greater<T>()); };
template <class U, class F> void rsort(vector<U> &a, F f) {
sort(all(a), [&](U l, U r) { return f(l) > f(r); });
};
// F = T<T>
// 例えばreturn p.fi + p.se;
template <class A, class B> void sortp(vector<A> &a, vector<B> &b) {
auto c = vtop(a, b);
sort(c);
rep(i, sz(a)) a[i] = c[i].fi, b[i] = c[i].se;
}
template <class A, class B, class F>
void sortp(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
sort(c, f);
rep(i, sz(a)) a[i] = c[i].fi, b[i] = c[i].se;
}
template <class A, class B> void rsortp(vector<A> &a, vector<B> &b) {
auto c = vtop(a, b);
rsort(c);
rep(i, sz(a)) a[i] = c[i].first, b[i] = c[i].second;
}
template <class A, class B, class F>
void rsortp(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
rsort(c, f);
rep(i, sz(a)) a[i] = c[i].first, b[i] = c[i].second;
}
template <class A, class B, class C>
void sortt(vector<A> &a, vector<B> &b, vector<C> &c) {
auto d = vtot(a, b, c);
sort(d);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C, class F>
void sortt(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
sort(d, f);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C>
void rsortt(vector<A> &a, vector<B> &b, vector<C> &c) {
auto d = vtot(a, b, c);
rsort(d);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C, class F>
void rsortt(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
rsort(d, f);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C, class D>
void sortf(vector<A> &a, vector<B> &b, vector<C> &c, vector<D> &d) {
auto e = vtof(a, b, c, d);
sort(e);
rep(i, sz(a)) a[i] = e[i].a, b[i] = e[i].b, c[i] = e[i].c, d[i] = e[i].d;
}
template <class A, class B, class C, class D>
void rsortf(vector<A> &a, vector<B> &b, vector<C> &c, vector<D> &d) {
auto e = vtof(a, b, c, d);
rsort(e);
rep(i, sz(a)) a[i] = e[i].a, b[i] = e[i].b, c[i] = e[i].c, d[i] = e[i].d;
}
// sortindex 元のvectorはソートしない
template <class T> vi sorti(vector<T> &a) {
auto b = a;
vi ind = iota(0, sz(a));
sortp(b, ind);
return ind;
} /*indexの分で型が変わるためpcomparatorが必要*/
template <class T> vi sorti(vector<T> &a, pcomparator f) {
auto b = a;
vi ind = iota(0, sz(a));
sortp(b, ind, f);
return ind;
}
template <class T, class F> vi sorti(vector<T> &a, F f) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(a[x]) < f(a[y]); });
return ind;
}
template <class T> vi rsorti(vector<T> &a) {
auto b = a;
vi ind = iota(0, sz(a));
rsortp(b, ind);
return ind;
}
template <class T, class F> vi rsorti(vector<T> &a, F f) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(a[x]) > f(a[y]); });
return ind;
}
template <class A, class B, class F>
vi sortpi(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(c[x]) < f(c[y]); });
return ind;
}
template <class A, class B>
vi sortpi(vector<A> &a, vector<B> &b, pcomparator f) {
vi ind = iota(0, sz(a));
auto c = a;
auto d = b;
sortt(c, d, ind, f);
return ind;
}
template <class A, class B> vi sortpi(vector<A> &a, vector<B> &b) {
return sortpi(a, b, fisi);
};
template <class A, class B, class F>
vi rsortpi(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(c[x]) > f(c[y]); });
return ind;
}
template <class A, class B> vi rsortpi(vector<A> &a, vector<B> &b) {
return sortpi(a, b, fdsd);
};
template <class A, class B, class C, class F>
vi sortti(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(d[x]) < f(d[y]); });
return ind;
}
template <class A, class B, class C>
vi sortti(vector<A> &a, vector<B> &b, vector<C> &c, pcomparator f) {
vi ind = iota(0, sz(a));
auto d = vtof(a, b, c, ind);
sort(d, f);
rep(i, sz(a)) ind[i] = d[i].d;
return ind;
}
template <class A, class B, class C>
vi sortti(vector<A> &a, vector<B> &b, vector<C> &c) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) {
if (a[x] == a[y]) {
if (b[x] == b[y])
return c[x] < c[y];
else
return b[x] < b[y];
} else {
return a[x] < a[y];
}
});
return ind;
}
template <class A, class B, class C, class F>
vi rsortti(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(d[x]) > f(d[y]); });
return ind;
}
template <class A, class B, class C>
vi rsortti(vector<A> &a, vector<B> &b, vector<C> &c) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) {
if (a[x] == a[y]) {
if (b[x] == b[y])
return c[x] > c[y];
else
return b[x] > b[y];
} else {
return a[x] > a[y];
}
});
return ind;
}
template <class T> void sort2(vector<vector<T>> &a) {
for (ll i = 0, n = a.size(); i < n; ++i)
sort(a[i]);
}
template <class T> void rsort2(vector<vector<T>> &a) {
for (ll i = 0, n = a.size(); i < n; ++i)
rsort(a[i]);
}
template <typename A, size_t N, typename T> void fill(A (&a)[N], const T &v) {
rep(i, N) a[i] = v;
}
template <typename A, size_t N, size_t O, typename T>
void fill(A (&a)[N][O], const T &v) {
rep(i, N) rep(j, O) a[i][j] = v;
}
template <typename A, size_t N, size_t O, size_t P, typename T>
void fill(A (&a)[N][O][P], const T &v) {
rep(i, N) rep(j, O) rep(k, P) a[i][j][k] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, typename T>
void fill(A (&a)[N][O][P][Q], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) a[i][j][k][l] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
typename T>
void fill(A (&a)[N][O][P][Q][R], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) a[i][j][k][l][m] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S, typename T>
void fill(A (&a)[N][O][P][Q][R][S], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) rep(n, S)
a[i][j][k][l][m][n] = v;
}
template <typename W, typename T> void fill(W &xx, const T vall) { xx = vall; }
template <typename W, typename T> void fill(vector<W> &vecc, const T vall) {
for (auto &&vx : vecc)
fill(vx, vall);
}
template <typename W, typename T> void fill(vector<W> &xx, const T v, ll len) {
rep(i, len) xx[i] = v;
}
template <typename W, typename T>
void fill(vector<vector<W>> &xx, const T v, ll lh, ll lw) {
rep(i, lh) rep(j, lw) xx[i][j] = v;
}
template <class T, class U> void fill(vector<T> &a, U val, vi &ind) {
fora(v, ind) a[v] = val;
}
template <typename A, size_t N> A sum(A (&a)[N]) {
A res = 0;
rep(i, N) res += a[i];
return res;
}
template <typename A, size_t N, size_t O> A sum(A (&a)[N][O]) {
A res = 0;
rep(i, N) rep(j, O) res += a[i][j];
return res;
}
template <typename A, size_t N, size_t O, size_t P> A sum(A (&a)[N][O][P]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) res += a[i][j][k];
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q>
A sum(A (&a)[N][O][P][Q]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) res += a[i][j][k][l];
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R>
A sum(A (&a)[N][O][P][Q][R]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) res += a[i][j][k][l][m];
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S>
A sum(A (&a)[N][O][P][Q][R][S]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) rep(n, S) res +=
a[i][j][k][l][m][n];
return res;
}
//@汎用便利関数 入力
ll in() {
ll ret;
cin >> ret;
return ret;
}
string sin() {
string ret;
cin >> ret;
return ret;
}
template <class T> void in(T &head) { cin >> head; }
template <class T, class... U> void in(T &head, U &...tail) {
cin >> head;
in(tail...);
}
#define o_din(o1, o2, o3, o4, o5, o6, name, ...) name
#define din1(a) \
ll a; \
cin >> a
#define din2(a, b) \
ll a, b; \
cin >> a >> b
#define din3(a, b, c) \
ll a, b, c; \
cin >> a >> b >> c
#define din4(a, b, c, d) \
ll a, b, c, d; \
cin >> a >> b >> c >> d
#define din5(a, b, c, d, e) \
ll a, b, c, d, e; \
cin >> a >> b >> c >> d >> e
#define din6(a, b, c, d, e, f) \
ll a, b, c, d, e, f; \
cin >> a >> b >> c >> d >> e >> f
#define din(...) \
o_din(__VA_ARGS__, din6, din5, din4, din3, din2, din1)(__VA_ARGS__)
#define o_dind(o1, o2, o3, o4, name, ...) name
#define din1d(a) \
din1(a); \
a--
#define din2d(a, b) \
din2(a, b); \
a--, b--
#define din3d(a, b, c) \
din3(a, b, c); \
a--, b--, c--
#define din4d(a, b, c, d) \
din4(a, b, c, d); \
a--, b--, c--, d--
#define dind(...) o_dind(__VA_ARGS__, din4d, din3d, din2d, din1d)(__VA_ARGS__)
template <class T> void out2(T &&head) { cout << head; }
template <class T, class... U> void out2(T &&head, U &&...tail) {
cout << head << " ";
out2(tail...);
}
template <class T, class... U> void out(T &&head, U &&...tail) {
cout << head << " ";
out2(tail...);
cout << "" << endl;
}
template <class T> void out(T &&head) { cout << head << endl; }
void out() { cout << "" << endl; }
#ifdef _DEBUG
template <class T> string out_m(vector<T> &a, ll W = inf) {
stringstream ss;
if (W == inf)
W = min(sz(a), 12ll);
if (sz(a) == 0)
return ss.str();
rep(i, W) { ss << a[i] << " "; }
ss << "" << endl;
return ss.str();
}
template <class T>
string out_m(vector<vector<T>> &a, ll H = inf, ll W = inf, int key = -1) {
H = min({H, sz(a), 12ll});
W = min({W, sz(a[0]), 12ll});
stringstream ss;
ss << endl;
if (key == -1)
ss << " *|";
else
ss << " " << key << "|";
rep(w, W) ss << std::right << std::setw(4) << w;
ss << "" << endl;
rep(w, W * 4 + 3) ss << "_";
ss << "" << endl;
rep(h, H) {
ss << std::right << std::setw(2) << h << "|";
rep(w, min(sz(a[h]), 12ll)) {
if (a[h][w] == linf)
ss << " e"
<< " ";
else
ss << std::right << std::setw(4) << a[h][w];
}
ss << "" << endl;
}
ss << endl;
return ss.str();
}
/*@formatter:off*/
template <class T>
string out_m(vector<vector<vector<T>>> &a, ll H = inf, ll W = inf, ll U = inf) {
stringstream ss;
if (H == inf)
H = 5;
H = min(H, sz(a));
rep(i, H) {
ss << endl;
ss << out_m(a[i], W, U, i);
}
ss << endl;
return ss.str();
}
string out_m(int a) {
stringstream ss;
ss << a << endl;
return ss.str();
}
template <class T> string out_m(T &a) {
stringstream ss;
ss << a << endl;
return ss.str();
}
template <class T> void outv(vector<T> &a, ll W = inf) {
cout << out_m(a, W) << endl;
}
template <class T>
void outv(vector<vector<T>> &a, ll H = linf, ll W = linf, int key = -1) {
cout << out_m(a, H, W, key) << endl;
}
template <class T>
void outv(vector<vector<vector<T>>> &a, ll H = linf, ll W = linf, ll U = linf) {
cout << out_m(a, H, W, U) << endl;
}
#else
template <class T> void outv(vector<T> &a, ll W = inf) {
rep(i, min(W, sz(a))) { cout << a[i] << " "; }
cout << "" << endl;
}
template <class T>
void outv(vector<vector<T>> &a, ll H = linf, ll W = linf, int key = -1) {
rep(i, min(H, sz(a))) { outv(a[i], W); }
}
template <class T>
void outv(vector<vector<vector<T>>> &a, ll H = linf, ll W = linf, ll U = linf) {
;
}
#endif
template <class T> void outl(vector<T> &a, int n = inf) {
rep(i, min(n, sz(a))) cout << a[i] << endl;
}
template <class T> void na(vector<T> &a, ll n) {
a.resize(n);
rep(i, n) cin >> a[i];
}
#define dna(a, n) \
vi a(n); \
rep(dnai, n) cin >> a[dnai];
template <class T> void nao(vector<T> &a, ll n) {
a.resize(n + 1);
a[0] = 0;
rep(i, n) cin >> a[i + 1];
}
template <class T> void naod(vector<T> &a, ll n) {
a.resize(n + 1);
a[0] = 0;
rep(i, n) cin >> a[i + 1], a[i + 1]--;
}
template <class T> void nad(vector<T> &a, ll n) {
a.resize(n);
rep(i, n) cin >> a[i], a[i]--;
}
template <class T, class U> void na2(vector<T> &a, vector<U> &b, ll n) {
a.resize(n);
b.resize(n);
rep(i, n) cin >> a[i] >> b[i];
}
#define dna2(a, b, n) \
vi a(n), b(n); \
rep(dna2i, n) cin >> a[dna2i] >> b[dna2i];
template <class T, class U> void nao2(vector<T> &a, vector<U> &b, ll n) {
a.resize(n + 1);
b.resize(n + 1);
a[0] = b[0] = 0;
rep(i, n) cin >> a[i + 1] >> b[i + 1];
}
#define dna2d(a, b, n) \
vi a(n), b(n); \
rep(dna2di, n) { \
cin >> a[dna2di] >> b[dna2di]; \
a[dna2di]--, b[dna2di]--; \
}
template <class T, class U> void na2d(vector<T> &a, vector<U> &b, ll n) {
a.resize(n);
b.resize(n);
rep(i, n) cin >> a[i] >> b[i], a[i]--, b[i]--;
}
template <class T, class U, class W>
void na3(vector<T> &a, vector<U> &b, vector<W> &c, ll n) {
a.resize(n);
b.resize(n);
c.resize(n);
rep(i, n) cin >> a[i] >> b[i] >> c[i];
}
#define dna3(a, b, c, n) \
vi a(n), b(n), c(n); \
rep(dna3i, n) cin >> a[dna3i] >> b[dna3i] >> c[dna3i];
template <class T, class U, class W>
void na3d(vector<T> &a, vector<U> &b, vector<W> &c, ll n) {
a.resize(n);
b.resize(n);
c.resize(n);
rep(i, n) cin >> a[i] >> b[i] >> c[i], a[i]--, b[i]--, c[i]--;
}
#define dna3d(a, b, c, n) \
vi a(n), b(n), c(n); \
rep(dna3di, n) { \
cin >> a[dna3di] >> b[dna3di] >> c[dna3di]; \
a[dna3di]--, b[dna3di]--, c[dna3di]--; \
}
template <class T, class U, class W, class X>
void na4(vector<T> &a, vector<U> &b, vector<W> &c, vector<X> &d, ll n) {
a.resize(n);
b.resize(n);
c.resize(n);
d.resize(n);
rep(i, n) cin >> a[i] >> b[i] >> c[i] >> d[i];
}
#define dna4(a, b, c, d, n) \
vi a(n), b(n), c(n), d(n); \
rep(dna4i, n) cin >> a[dna4i] >> b[dna4i] >> c[dna4i] >> d[dna4i];
#define dna4d(a, b, c, d, n) \
vi a(n), b(n), c(n), d(n); \
rep(dna4i, n) cin >> a[dna4i] >> b[dna4i] >> c[dna4i] >> d[dna4i], \
--a[dna4i], --b[dna4i], --c[dna4i], --d[dna4i];
#define nt(a, h, w) \
resize(a, h, w); \
rep(nthi, h) rep(ntwi, w) cin >> a[nthi][ntwi];
#define ntd(a, h, w) \
resize(a, h, w); \
rep(ntdhi, h) rep(ntdwi, w) cin >> a[ntdhi][ntdwi], a[ntdhi][ntdwi]--;
#define ntp(a, h, w) \
resize(a, h + 2, w + 2); \
fill(a, '#'); \
rep(ntphi, 1, h + 1) rep(ntpwi, 1, w + 1) cin >> a[ntphi][ntpwi];
// デバッグ
#define sp << " " <<
#define debugName(VariableName) #VariableName
#define deb1(x) debugName(x) << " = " << out_m(x)
#define deb2(x, ...) deb1(x) << ", " << deb1(__VA_ARGS__)
#define deb3(x, ...) deb1(x) << ", " << deb2(__VA_ARGS__)
#define deb4(x, ...) deb1(x) << ", " << deb3(__VA_ARGS__)
#define deb5(x, ...) deb1(x) << ", " << deb4(__VA_ARGS__)
#define deb6(x, ...) deb1(x) << ", " << deb5(__VA_ARGS__)
#define deb7(x, ...) deb1(x) << ", " << deb6(__VA_ARGS__)
#define deb8(x, ...) deb1(x) << ", " << deb7(__VA_ARGS__)
#define deb9(x, ...) deb1(x) << ", " << deb8(__VA_ARGS__)
#define deb10(x, ...) deb1(x) << ", " << deb9(__VA_ARGS__)
#define o_ebug(o1, o2, o3, o4, o5, o6, o7, o8, o9, o10, name, ...) name
#ifdef _DEBUG
#define deb(...) \
cerr << o_ebug(__VA_ARGS__, deb10, deb9, deb8, deb7, deb6, deb5, deb4, deb3, \
deb2, deb1)(__VA_ARGS__) \
<< endl
#else
#define deb(...) ;
#endif
#define debugline(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n'
//@formatter:off
// よく使うクラス、構造体
struct unionfind {
vector<ll> par;
vector<ll> siz;
vector<ll> es;
ll n, trees; // 連結グループの数(親の種類)
unionfind(ll n) : n(n), trees(n) {
par.resize(n);
siz.resize(n);
es.resize(n);
for (ll i = 0; i < n; i++) {
par[i] = i;
siz[i] = 1;
}
}
ll root(ll x) {
if (par[x] == x) {
return x;
} else {
return par[x] = root(par[x]);
}
}
bool unite(ll x, ll y) {
x = root(x);
y = root(y);
es[x]++;
if (x == y)
return false;
if (siz[x] > siz[y])
swap(x, y);
trees--;
par[x] = y;
siz[y] += siz[x];
es[y] += es[x];
return true;
}
bool same(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return siz[root(x)]; }
ll esize(ll x) { return es[root(x)]; }
vi sizes() {
vi cou(n);
vi ret;
ret.reserve(n);
rep(i, n) { cou[root(i)]++; }
rep(i, n) {
if (cou[i])
ret.push_back(cou[i]);
}
return ret;
}
// つながりを無向グラフと見なし、xが閉路に含まれるか判定
bool close(ll x) { return esize(x) >= size(x); }
vec<vi> sets() {
vi ind(n, -1);
ll i = 0;
vvi(res, trees);
rep(j, n) {
ll r = root(j);
if (ind[r] == -1)
ind[r] = i++;
res[ind[r]].push_back(j);
}
rep(i, trees) {
ll r = root(res[i][0]);
if (res[i][0] == r)
continue;
rep(j, 1, sz(res[i])) {
if (res[i][j] == r) {
swap(res[i][0], res[i][j]);
break;
}
}
}
return res;
}
}; //@formatter:off
using bll = __int128;
using u32 = unsigned;
using u64 = unsigned long long;
using u128 = __uint128_t;
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
std::ostream::sentry s(dest);
if (s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while (tmp != 0);
if (value < 0) {
--d;
*d = '-';
}
ll len = std::end(buffer) - d;
if (dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
//__int128 toi128(string &s) { __int128 ret = 0; for (ll i = 0; i <
//s.length(); ++i) if ('0' <= s[i] && s[i] <= '9') ret = 10 *
//ret + s[i] - '0'; return ret;}
// エラー
void ole() {
#ifdef _DEBUG
debugline("ole");
exit(0);
#endif
string a = "a";
rep(i, 30) a += a;
rep(i, 1 << 17) cout << a << endl;
cout << "OLE 出力長制限超過" << endl;
exit(0);
}
void re() {
assert(0 == 1);
exit(0);
}
void tle() {
while (inf)
cout << inf << endl;
}
// 便利関数
// テスト用
char ranc() { return (char)('a' + rand() % 26); }
ll rand(ll min, ll max) {
assert(min <= max);
if (min >= 0 && max >= 0) {
return rand() % (max + 1 - min) + min;
} else if (max < 0) {
return -rand(-max, -min);
} else {
if (rand() % 2) {
return rand(0, max);
} else {
return -rand(0, -min);
}
}
}
vi ranv(ll n, ll min, ll max) {
vi v(n);
rep(i, n) v[i] = rand(min, max);
return v;
}
str ransu(ll n) {
str s;
rep(i, n) s += (char)rand('A', 'Z');
return s;
}
str ransl(ll n) {
str s;
rep(i, n) s += (char)rand('a', 'z');
return s;
}
// 単調増加
vi ranvinc(ll n, ll min, ll max) {
vi v(n);
bool bad = 1;
while (bad) {
bad = 0;
v.resize(n);
rep(i, n) {
if (i && min > max - v[i - 1]) {
bad = 1;
break;
}
if (i)
v[i] = v[i - 1] + rand(min, max - v[i - 1]);
else
v[i] = rand(min, max);
}
}
return v;
}
// 便利 汎用
void ranvlr(ll n, ll min, ll max, vi &l, vi &r) {
l.resize(n);
r.resize(n);
rep(i, n) {
l[i] = rand(min, max);
r[i] = l[i] + rand(0, max - l[i]);
}
}
vp run_length(vi &a) {
vp ret;
ret.eb(a[0], 1);
rep(i, 1, sz(a)) {
if (ret.back().fi == a[i]) {
ret.back().se++;
} else {
ret.eb(a[i], 1);
}
}
return ret;
}
vector<pair<char, ll>> run_length(string &a) {
vector<pair<char, ll>> ret;
ret.eb(a[0], 1);
rep(i, 1, sz(a)) {
if (ret.back().fi == a[i]) {
ret.back().se++;
} else {
ret.eb(a[i], 1);
}
}
return ret;
}
template <class F> ll mgr(ll ok, ll ng, F f) {
if (ok < ng)
while (ng - ok > 1) {
ll mid = (ok + ng) / 2;
if (f(mid))
ok = mid;
else
ng = mid;
}
else
while (ok - ng > 1) {
ll mid = (ok + ng) / 2;
if (f(mid))
ok = mid;
else
ng = mid;
}
return ok;
}
// strを整数として比較
string smax(str &a, str b) {
if (sz(a) < sz(b)) {
return b;
} else if (sz(a) > sz(b)) {
return a;
} else if (a < b)
return b;
else
return a;
}
// strを整数として比較
string smin(str &a, str b) {
if (sz(a) > sz(b)) {
return b;
} else if (sz(a) < sz(b)) {
return a;
} else if (a > b)
return b;
else
return a;
}
template <typename W, typename T> ll find(vector<W> &a, const T key) {
rep(i, sz(a)) if (a[i] == key) return i;
return -1;
}
template <typename W, typename T> P find(vector<vector<W>> &a, const T key) {
rep(i, sz(a)) rep(j, sz(a[0])) if (a[i][j] == key) return mp(i, j);
return mp(-1, -1);
}
template <typename W, typename U>
T find(vector<vector<vector<W>>> &a, const U key) {
rep(i, sz(a)) rep(j, sz(a[0]))
rep(k, sz(a[0][0])) if (a[i][j][k] == key) return mt(i, j, k);
return mt(-1, -1, -1);
}
template <typename W, typename T> ll count2(W &a, const T k) { return a == k; }
template <typename W, typename T> ll count2(vector<W> &a, const T k) {
ll ret = 0;
fora(v, a) ret += count2(v, k);
return ret;
}
template <typename W, typename T> ll count(vector<W> &a, const T k) {
ll ret = 0;
fora(v, a) ret += count2(v, k);
return ret;
}
ll count(str &a, str k) {
ll ret = 0, len = k.length();
auto pos = a.find(k);
while (pos != string::npos)
pos = a.find(k, pos + len), ++ret;
return ret;
}
vi count(str &a) {
vi cou(26);
char c = 'a';
if ('A' <= a[0] && a[0] <= 'Z')
c = 'A';
rep(i, sz(a))++ cou[a[i] - c];
return cou;
}
#define couif count_if
// algorythm
ll rev(ll a) {
ll res = 0;
while (a) {
res *= 10;
res += a % 10;
a /= 10;
}
return res;
}
template <class T> void rev(vector<T> &a) { reverse(all(a)); }
template <class U> void rev(vector<vector<U>> &a) {
vector<vector<U>> b(sz(a[0]), vector<U>(sz(a)));
rep(h, sz(a)) rep(w, sz(a[0])) b[w][h] = a[h][w];
a = b;
}
void rev(string &a) { reverse(all(a)); }
constexpr ll p10[] = {1,
10,
100,
1000,
10000,
100000,
1000000,
10000000,
100000000,
1000000000,
10000000000ll,
100000000000ll,
1000000000000ll,
10000000000000ll,
100000000000000ll,
1000000000000000ll,
10000000000000000ll,
100000000000000000ll,
1000000000000000000ll};
ll get(ll a, ll keta) { return (a / (ll)pow(10, keta)) % 10; }
ll keta(ll v) {
if (v < p10[9]) {
if (v < p10[4]) {
if (v < p10[2]) {
if (v < p10[1])
return 1;
else
return 2;
} else {
if (v < p10[3])
return 3;
else
return 4;
}
} else {
if (v < p10[7]) {
if (v < p10[5])
return 5;
else if (v < p10[6])
return 6;
else
return 7;
} else {
if (v < p10[8])
return 8;
else
return 9;
}
}
} else {
if (v < p10[13]) {
if (v < p10[11]) {
if (v < p10[10])
return 10;
else
return 11;
} else {
if (v < p10[12])
return 12;
else
return 13;
}
} else {
if (v < p10[15]) {
if (v < p10[14])
return 14;
else if (v < p10[15])
return 15;
else
return 16;
} else {
if (v < p10[17])
return 17;
else
return 18;
}
}
}
}
ll dsum(ll v, ll sin = 10) {
ll ret = 0;
for (; v; v /= sin)
ret += v % sin;
return ret;
}
struct sint {
ll v;
sint(ll v) : v(v) {}
operator ll() { return v; }
// 下からi番目
ll operator[](ll i) { return (v / p10[i]) % 10; }
ll back(ll i) { return operator[](i); }
// 上からi番目
ll top(ll i) {
ll len = keta(v);
return operator[](len - 1 - i);
}
// 先頭からi番目にセット
ll settop(ll i, ll k) {
ll len = keta(v);
return set(len - 1 - i, k);
}
ll set(ll i, ll k) {
if (i < 0)
return settop(abs(i) - 1, k);
return v += p10[i] * (k - (v / p10[i]) % 10);
}
ll add(ll i, ll k = 1) { return v += p10[i] * k; }
ll addtop(ll i, ll k = 1) { return v += p10[keta(v) - i - 1] * k; }
ll dec(ll i, ll k = 1) { return v -= p10[i] * k; }
ll dectop(ll i, ll k = 1) { return v -= p10[keta(v) - i - 1] * k; }
#define op(t, o) \
template <class T> t operator o(T r) { return v o r; }
op(ll, +=);
op(ll, -=);
op(ll, *=);
op(ll, /=);
op(ll, %=);
op(ll, +);
op(ll, -);
op(ll, *);
op(ll, /);
op(ll, %);
op(bool, ==);
op(bool, !=);
op(bool, <);
op(bool, <=);
op(bool, >);
op(bool, >=);
#undef op
template <class T> ll operator<<=(T r) { return v *= p10[r]; }
template <class T> ll operator<<(T r) { return v * p10[r]; }
template <class T> ll operator>>=(T r) { return v /= p10[r]; }
template <class T> ll operator>>(T r) { return v / p10[r]; }
};
ll mask10(ll v) { return p10[v] - 1; }
// 変換系
template <class T> auto keys(T &a) {
vector<decltype((a.begin())->fi)> res;
for (auto &&k : a)
res.push_back(k.fi);
return res;
}
template <class T> auto values(T &a) {
vector<decltype((a.begin())->se)> res;
for (auto &&k : a)
res.push_back(k.se);
return res;
}
template <class T, class U> bool chma(T &a, const U &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class U> bool chma(const U &b) { return chma(ma, b); }
template <class T, class U> bool chmi(T &a, const U &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class U> bool chmi(const U &b) { return chmi(mi, b); }
template <class T> T min(T a, signed b) { return a < b ? a : b; }
template <class T> T max(T a, signed b) { return a < b ? b : a; }
template <class T> T min(T a, T b, T c) {
return a >= b ? b >= c ? c : b : a >= c ? c : a;
}
template <class T> T max(T a, T b, T c) {
return a <= b ? b <= c ? c : b : a <= c ? c : a;
}
template <class T> T min(vector<T> &a) { return *min_element(all(a)); }
template <class T> T mini(vector<T> &a) {
return min_element(all(a)) - a.begin();
}
template <class T> T min(vector<T> &a, ll n) {
return *min_element(a.begin(), a.begin() + min(n, sz(a)));
}
template <class T> T min(vector<T> &a, ll s, ll n) {
return *min_element(a.begin() + s, a.begin() + min(n, sz(a)));
}
template <class T> T max(vector<T> &a) { return *max_element(all(a)); }
template <class T, class U> T max(vector<T> &a, vector<U> &b) {
return max(*max_element(all(a)), *max_element(all(b)));
}
template <class T> T maxi(vector<T> &a) {
return max_element(all(a)) - a.begin();
}
template <class T> T max(vector<T> &a, ll n) {
return *max_element(a.begin(), a.begin() + min(n, sz(a)));
}
template <class T> T max(vector<T> &a, ll s, ll n) {
return *max_element(a.begin() + s, a.begin() + min(n, sz(a)));
}
template <typename A, size_t N> A max(A (&a)[N]) {
A res = a[0];
rep(i, N) res = max(res, a[i]);
return res;
}
template <typename A, size_t N, size_t O> A max(A (&a)[N][O]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P> A max(A (&a)[N][O][P]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q>
A max(A (&a)[N][O][P][Q], const T &v) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R>
A max(A (&a)[N][O][P][Q][R]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S>
A max(A (&a)[N][O][P][Q][R][S]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N> A min(A (&a)[N]) {
A res = a[0];
rep(i, N) res = min(res, a[i]);
return res;
}
template <typename A, size_t N, size_t O> A min(A (&a)[N][O]) {
A res = min(a[0]);
rep(i, N) res = min(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P> A min(A (&a)[N][O][P]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q>
A min(A (&a)[N][O][P][Q], const T &v) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R>
A min(A (&a)[N][O][P][Q][R]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S>
A min(A (&a)[N][O][P][Q][R][S]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <class T> T sum(vector<T> &v, ll s, ll t) {
T ret = 0;
rep(i, s, min(sz(v), t)) ret += v[i];
return ret;
}
template <class T> T sum(vector<T> &v, ll t = inf) { return sum(v, 0, t); }
template <class T> T sum(vector<vector<T>> &v) {
T ret = 0;
rep(i, sz(v)) ret += sum(v[i]);
return ret;
}
template <class T> T sum(vector<vector<vector<T>>> &v) {
T ret = 0;
rep(i, sz(v)) ret += sum(v[i]);
return ret;
}
template <class T> T sum(vector<vector<vector<vector<T>>>> &v) {
T ret = 0;
rep(i, sz(v)) ret += sum(v[i]);
return ret;
}
template <class T> T sum(vector<vector<vector<vector<vector<T>>>>> &v) {
T ret = 0;
rep(i, sz(v)) ret += sum(v[i]);
return ret;
}
template <class T> auto sum(priority_queue<T, vector<T>, greater<T>> &r) {
auto q = r;
T ret = 0;
while (sz(q)) {
ret += q.top();
q.pop();
}
return ret;
}
template <class T> auto sum(priority_queue<T> &r) {
auto q = r;
T ret = 0;
while (sz(q)) {
ret += q.top();
q.pop();
}
return ret;
}
// template<class T, class U, class... W> auto sumn(vector<T> &v, U head, W...
// tail) { auto ret = sum(v[0], tail...); rep(i, 1, min(sz(v), head))ret
// += sum(v[i], tail...); return ret;}
void clear(PQ &q) { q = PQ(); }
template <class T> void clear(queue<T> &q) {
while (q.size())
q.pop();
}
template <class T> T *negarr(ll size) {
T *body = (T *)malloc((size * 2 + 1) * sizeof(T));
return body + size;
}
template <class T> T *negarr2(ll h, ll w) {
double **dummy1 = new double *[2 * h + 1];
double *dummy2 = new double[(2 * h + 1) * (2 * w + 1)];
dummy1[0] = dummy2 + w;
for (ll i = 1; i <= 2 * h + 1; ++i) {
dummy1[i] = dummy1[i - 1] + 2 * w + 1;
}
double **a = dummy1 + h;
return a;
}
// imoは0-indexed
// ruiは1-indexed
template <class T> vector<T> imo(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) ret[i + 1] += ret[i];
return ret;
}
// kと同じものの数
template <class T, class U> vi imo(vector<T> &a, U k) {
vector<T> ret = a;
rep(i, sz(ret)) ret[i] = a[i] == k;
rep(i, sz(ret) - 1) ret[i + 1] += ret[i];
return ret;
}
template <class T> vector<T> imox(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) ret[i + 1] ^= ret[i];
return ret;
}
// 漸化的に最小を持つ
template <class T> vector<T> imi(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) chmi(ret[i + 1], ret[i]);
return ret;
}
template <class T> struct ruiC {
const vector<T> rui;
ruiC(vector<T> &ru) : rui(ru) {}
T operator()(ll l, ll r) {
if (l > r) {
cerr << "ruic ";
deb(l, r);
assert(0);
}
return rui[r] - rui[l];
}
T operator[](ll i) { return rui[i]; }
T back() { return rui.back(); }
ll size() { return rui.size(); }
};
template <class T> struct rruic {
const T *rrui;
rruic(T *ru) : rrui(ru) {}
T operator()(ll l, ll r) {
assert(l >= r);
return rrui[r] - rrui[l];
}
T operator[](ll i) { return rrui[i]; }
};
template <class T> ostream &operator<<(ostream &os, ruiC<T> a) {
fora(v, a.rui) os << v << " ";
return os;
}
template <class T> vector<T> ruiv(vector<T> &a) {
vector<T> ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] + a[i];
return ret;
}
template <class T> ruiC<T> ruic(vector<T> &a) {
vector<T> ret = ruiv(a);
return ruiC<T>(ret);
}
vector<ll> ruiv(string &a) {
if (sz(a) == 0)
return vi(1);
ll dec = ('0' <= a[0] && a[0] <= '9') ? '0' : 0;
vector<ll> ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] + a[i] - dec;
return ret;
}
ruiC<ll> ruic(string &a) {
vector<ll> ret = ruiv(a);
return ruiC<ll>(ret);
}
// kと同じものの数
template <class T, class U> vi ruiv(T &a, U k) {
vi ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] + (a[i] == k);
return ret;
}
template <class T, class U> ruiC<ll> ruic(T &a, U k) {
vi ret = ruiv(a, k);
return ruiC<ll>(ret);
}
// xor
template <class T> struct ruixC {
const vector<T> rui;
ruixC(vector<T> &ru) : rui(ru) {}
T operator()(ll l, ll r) {
if (l > r) {
cerr << "ruiXc ";
deb(l, r);
assert(0);
}
return rui[r] ^ rui[l];
}
T operator[](ll i) { return rui[i]; }
T back() { return rui.back(); }
ll size() { return rui.size(); }
};
template <class T> vector<T> ruix(vector<T> &a) {
vector<T> ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] ^ a[i];
return ret;
}
template <class T> ruixC<ll> ruixc(vector<T> &a) {
vi ret = ruix(a);
return ruixC<ll>(ret);
}
template <class T> vector<T> ruim(vector<T> &a) {
vector<T> res(a.size() + 1, 1);
rep(i, a.size()) res[i + 1] = res[i] * a[i];
return res;
}
// 漸化的に最小を1indexで持つ
template <class T> vector<T> ruimi(vector<T> &a) {
ll n = sz(a);
vector<T> ret(n + 1);
rep(i, 1, n) {
ret[i] = a[i - 1];
chmi(ret[i + 1], ret[i]);
}
return ret;
}
// template<class T> T *rrui(vector<T> &a) {
// 右から左にかけての半開区間 (-1 n-1]
template <class T> rruic<T> rrui(vector<T> &a) {
ll len = a.size();
T *body = (T *)malloc((len + 1) * sizeof(T));
T *res = body + 1;
rer(i, len - 1) res[i - 1] = res[i] + a[i];
return rruic<T>(res);
}
// 掛け算
template <class T> T *rruim(vector<T> &a) {
ll len = a.size();
T *body = (T *)malloc((len + 1) * sizeof(T));
T *res = body + 1;
res[len - 1] = 1;
rer(i, len - 1) res[i - 1] = res[i] * a[i];
return res;
}
template <class T, class U> void inc(T &a, U v = 1) { a += v; }
template <class T, class U> void inc(vector<T> &a, U v = 1) {
for (auto &u : a)
inc(u, v);
}
template <class T, class U> void dec(T &a, U v = 1) { a -= v; }
template <class T, class U> void dec(vector<T> &a, U v = 1) {
for (auto &u : a)
dec(u, v);
}
template <class U> void dec(string &a, U v = 1) {
for (auto &u : a)
dec(u, v);
}
template <class T> void dec(vector<T> &a) {
for (auto &u : a)
dec(u, 1);
}
template <class T, class U> void dec(vector<T> &a, vector<U> &b) {
for (auto &u : a)
dec(u, 1);
for (auto &u : b)
dec(u, 1);
}
template <class T, class U, class W>
void dec(vector<T> &a, vector<U> &b, vector<W> &c) {
for (auto &u : a)
dec(u, 1);
for (auto &u : b)
dec(u, 1);
for (auto &u : c)
dec(u, 1);
}
bool ins(ll h, ll w, ll H, ll W) { return h >= 0 && w >= 0 && h < H && w < W; }
bool ins(ll l, ll v, ll r) { return l <= v && v < r; }
template <class T> bool ins(vector<T> &a, ll i, ll j = 0) {
return ins(0, i, sz(a)) && ins(0, j, sz(a));
}
ll u(ll a) { return a < 0 ? 0 : a; }
template <class T> vector<T> u(const vector<T> &a) {
vector<T> ret = a;
fora(v, ret) v = u(v);
return ret;
}
#define MIN(a) numeric_limits<a>::min()
#define MAX(a) numeric_limits<a>::max()
// 添え字を返す
template <class F> ll goldd_l(ll left, ll right, F calc) {
double GRATIO = 1.6180339887498948482045868343656;
ll lm = left + (ll)((right - left) / (GRATIO + 1.0));
ll rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
ll fl = calc(lm);
ll fr = calc(rm);
while (right - left > 10) {
if (fl < fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + (ll)((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
ll minScore = MAX(ll);
ll resIndex = left;
for (ll i = left; i < right + 1; ++i) {
ll score = calc(i);
if (minScore > score) {
minScore = score;
resIndex = i;
}
}
return resIndex;
}
template <class F> ll goldt_l(ll left, ll right, F calc) {
double GRATIO = 1.6180339887498948482045868343656;
ll lm = left + (ll)((right - left) / (GRATIO + 1.0));
ll rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
ll fl = calc(lm);
ll fr = calc(rm);
while (right - left > 10) {
if (fl > fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + (ll)((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
if (left > right) {
ll l = left;
left = right;
right = l;
}
ll maxScore = MIN(ll);
ll resIndex = left;
for (ll i = left; i < right + 1; ++i) {
ll score = calc(i);
if (maxScore < score) {
maxScore = score;
resIndex = i;
}
}
return resIndex;
}
/*loopは200にすればおそらく大丈夫 余裕なら300に*/
template <class F> dou goldd_d(dou left, dou right, F calc, ll loop = 200) {
dou GRATIO = 1.6180339887498948482045868343656;
dou lm = left + ((right - left) / (GRATIO + 1.0));
dou rm = lm + ((right - lm) / (GRATIO + 1.0));
dou fl = calc(lm);
dou fr = calc(rm); /*200にすればおそらく大丈夫*/ /*余裕なら300に*/
ll k = 141;
loop++;
while (--loop) {
if (fl < fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + ((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + ((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
return left;
}
template <class F> dou goldt_d(dou left, dou right, F calc, ll loop = 200) {
double GRATIO = 1.6180339887498948482045868343656;
dou lm = left + ((right - left) / (GRATIO + 1.0));
dou rm = lm + ((right - lm) / (GRATIO + 1.0));
dou fl = calc(lm);
dou fr = calc(rm);
loop++;
while (--loop) {
if (fl > fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + ((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + ((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
return left;
}
// l ~ rを複数の区間に分割し、極致を与えるiを返す time-20 msまで探索
template <class F> ll goldd_ls(ll l, ll r, F calc, ll time = 2000) {
auto lim = milliseconds(time - 20);
ll mini = 0, minv = MAX(ll); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
ll haba = (r - l + k) / k; /*((r-l+1) + k-1) /k*/
ll nl = l;
ll nr = l + haba;
rep(i, k) {
ll ni = goldd_l(nl, nr, calc);
if (chmi(minv, calc(ni)))
mini = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return mini;
}
template <class F> ll goldt_ls(ll l, ll r, F calc, ll time = 2000) {
auto lim = milliseconds(time - 20);
ll maxi = 0, maxv = MIN(ll); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
ll haba = (r - l + k) / k; /*((r-l+1) + k-1) /k*/
ll nl = l;
ll nr = l + haba;
rep(i, k) {
ll ni = goldt_l(nl, nr, calc);
if (chma(maxv, calc(ni)))
maxi = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return maxi;
}
template <class F>
dou goldd_d_s(dou l, dou r, F calc, ll time = 2000) { /*20ms余裕を持つ*/
auto lim = milliseconds(time - 20);
dou mini = 0, minv = MAX(dou); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
dou haba = (r - l) / k;
dou nl = l;
dou nr = l + haba;
rep(i, k) {
dou ni = goldd_d(nl, nr, calc);
if (chmi(minv, calc(ni)))
mini = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return mini;
}
template <class F>
dou goldt_d_s(dou l, dou r, F calc, ll time = 2000) { /*20ms余裕を残している*/
auto lim = milliseconds(time - 20);
dou maxi = 0, maxv = MIN(dou); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
dou haba = (r - l) / k;
dou nl = l;
dou nr = l + haba;
rep(i, k) {
dou ni = goldt_d(nl, nr, calc);
if (chma(maxv, calc(ni)))
maxi = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return maxi;
}
template <class T> T min(vector<vector<T>> &a) {
T res = MAX(T);
rep(i, a.size()) chmi(res, *min_element(all(a[i])));
return res;
}
template <class T> T max(vector<vector<T>> &a) {
T res = MIN(T);
rep(i, a.size()) chma(res, *max_element(all(a[i])));
return res;
}
constexpr bool bget(ll m, ll keta) { return (m >> keta) & 1; }
ll bget(ll m, ll keta, ll sinsuu) {
m /= (ll)pow(sinsuu, keta);
return m % sinsuu;
}
ll bit(ll n) { return (1LL << (n)); }
ll bit(ll n, ll sinsuu) { return (ll)pow(sinsuu, n); }
ll mask(ll n) { return (1ll << n) - 1; }
#define bcou __builtin_popcountll
// 最下位ビット
ll lbit(ll n) { return n & -n; }
// 最上位ビット
ll hbit(ll n) {
n |= (n >> 1);
n |= (n >> 2);
n |= (n >> 4);
n |= (n >> 8);
n |= (n >> 16);
n |= (n >> 32);
return n - (n >> 1);
}
ll hbitk(ll n) {
ll k = 0;
rer(i, 5) {
ll a = k + (1ll << i);
ll b = 1ll << a;
if (b <= n)
k += 1ll << i;
}
return k;
}
// 初期化は0を渡す
ll nextComb(ll &mask, ll n, ll r) {
if (!mask)
return mask = (1LL << r) - 1;
ll x = mask & -mask; /*最下位の1*/
ll y = mask + x; /*連続した下の1を繰り上がらせる*/
ll res = ((mask & ~y) / x >> 1) | y;
if (bget(res, n))
return mask = 0;
else
return mask = res;
}
// n桁以下でビットがr個立っているもののvectorを返す
vi bitCombList(ll n, ll r) {
vi res;
ll m = 0;
while (nextComb(m, n, r)) {
res.push_back(m);
}
return res;
}
// masの立ってるindexを見る
#define forbit(i, mas) \
for (int forbitj = lbit(mas), forbitm = mas, i = log2(forbitj); forbitm; \
forbitm = forbitj ? forbitm ^ forbitj : 0, forbitj = lbit(forbitm), \
i = log2(forbitj))
char itoal(ll i) { return 'a' + i; }
char itoaL(ll i) { return 'A' + i; }
ll altoi(char c) {
if ('A' <= c && c <= 'Z')
return c - 'A';
return c - 'a';
}
ll ctoi(char c) { return c - '0'; }
char itoc(ll i) { return i + '0'; }
ll vtoi(vi &v) {
ll res = 0;
if (sz(v) > 18) {
debugline("vtoi");
deb(sz(v));
ole();
}
rep(i, sz(v)) {
res *= 10;
res += v[i];
}
return res;
}
vi itov(ll i) {
vi res;
while (i) {
res.push_back(i % 10);
i /= 10;
}
rev(res);
return res;
}
vi stov(string &a) {
ll n = sz(a);
vi ret(n);
rep(i, n) { ret[i] = a[i] - '0'; }
return ret;
}
// 基準を満たさないものは0になる
vi stov(string &a, char one) {
ll n = sz(a);
vi ret(n);
rep(i, n) ret[i] = a[i] == one;
return ret;
}
vector<vector<ll>> ctoi(vector<vector<char>> s, char c) {
ll n = sz(s), m = sz(s[0]);
vector<vector<ll>> res(n, vector<ll>(m));
rep(i, n) rep(j, m) res[i][j] = s[i][j] == c;
return res;
}
#define unique(v) v.erase(unique(v.begin(), v.end()), v.end());
//[i] := i番として圧縮されたものを返す
vi compress(vi &a) {
vi b;
ll len = a.size();
for (ll i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
unique(b);
for (ll i = 0; i < len; ++i) {
a[i] = lower_bound(all(b), a[i]) - b.begin();
}
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vi &a, umap<ll, ll> &map) {
vi b;
ll len = a.size();
for (ll i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
unique(b);
for (ll i = 0; i < len; ++i) {
ll v = a[i];
a[i] = lower_bound(all(b), a[i]) - b.begin();
map[v] = a[i];
}
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vi &a, vi &r) {
vi b;
ll len = a.size();
fora(v, a) b.push_back(v);
fora(v, r) b.push_back(v);
sort(b);
unique(b);
for (ll i = 0; i < len; ++i)
a[i] = lower_bound(all(b), a[i]) - b.begin();
for (ll i = 0; i < sz(r); ++i)
r[i] = lower_bound(all(b), r[i]) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vi &a, vi &r, vi &s) {
vi b;
ll len = a.size();
fora(v, a) b.push_back(v);
fora(v, r) b.push_back(v);
fora(v, s) b.push_back(v);
sort(b);
unique(b);
for (ll i = 0; i < len; ++i)
a[i] = lower_bound(all(b), a[i]) - b.begin();
for (ll i = 0; i < sz(r); ++i)
r[i] = lower_bound(all(b), r[i]) - b.begin();
for (ll i = 0; i < sz(s); ++i)
r[i] = lower_bound(all(b), s[i]) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vector<vi> &a) {
vi b;
fora(vv, a) fora(v, vv) b.push_back(v);
sort(b);
unique(b);
fora(vv, a) fora(v, vv) v = lower_bound(all(b), v) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vector<vector<vi>> &a) {
vi b;
fora(vvv, a) fora(vv, vvv) fora(v, vv) b.push_back(v);
sort(b);
unique(b);
fora(vvv, a) fora(vv, vvv) fora(v, vv) v = lower_bound(all(b), v) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
void compress(ll a[], ll len) {
vi b;
for (ll i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
unique(b);
for (ll i = 0; i < len; ++i) {
a[i] = lower_bound(all(b), a[i]) - b.begin();
}
}
// 要素が見つからなかったときに困る
#define binarySearch(a, v) (binary_search(all(a), v))
#define lowerIndex(a, v) (lower_bound(all(a), v) - a.begin())
#define lowerBound(a, v) (*lower_bound(all(a), v))
#define upperIndex(a, v) (upper_bound(all(a), v) - a.begin())
#define upperBound(a, v) (*upper_bound(all(a), v))
#define rlowerIndex(a, v) (upper_bound(all(a), v) - a.begin() - 1)
#define rlowerBound(a, v) *(--(upper_bound(all(a), v)))
#define rupperIndex(a, v) (lower_bound(all(a), v) - a.begin() - 1)
#define rupperBound(a, v) *(--(lower_bound(all(a), v)))
#define next2(a) next(next(a))
#define prev2(a) prev(prev(a))
// 狭義の単調増加列 長さを返す
template <class T> int lis(vector<T> &a) {
int n = sz(a);
vi tail(n + 1, MAX(T));
rep(i, n) {
int id = lowerIndex(tail, a[i]); /**/
tail[id] = a[i];
}
return lowerIndex(tail, MAX(T));
}
template <class T> int lis_eq(vector<T> &a) {
int n = sz(a);
vi tail(n + 1, MAX(T));
rep(i, n) {
int id = upperIndex(tail, a[i]); /**/
tail[id] = a[i];
}
return lowerIndex(tail, MAX(T));
}
// iteratorを返す
// valueが1以上の物を返す 0は見つけ次第削除
// vを減らす場合 (*it).se--でいい
template <class T, class U, class V> auto lower_map(map<T, U> &m, V k) {
auto ret = m.lower_bound(k);
while (ret != m.end() && (*ret).second == 0) {
ret = m.erase(ret);
}
return ret;
}
template <class T, class U, class V> auto upper_map(map<T, U> &m, V k) {
auto ret = m.upper_bound(k);
while (ret != m.end() && (*ret).second == 0) {
ret = m.erase(ret);
}
return ret;
}
// 存在しなければエラー
template <class T, class U, class V> auto rlower_map(map<T, U> &m, V k) {
auto ret = upper_map(m, k);
assert(ret != m.begin());
ret--;
while (1) {
if ((*ret).second != 0)
break;
assert(ret != m.begin());
auto next = ret;
--next;
m.erase(ret);
ret = next;
}
return ret;
}
template <class T, class U, class V> auto rupper_map(map<T, U> &m, V k) {
auto ret = lower_map(m, k);
assert(ret != m.begin());
ret--;
while (1) {
if ((*ret).second != 0)
break;
assert(ret != m.begin());
auto next = ret;
--next;
m.erase(ret);
ret = next;
}
return ret;
}
template <class T> void fin(T s) { cout << s << endl, exit(0); }
// 便利 数学 math
ll mod(ll a, ll m) { return (a % m + m) % m; }
ll pow(ll a) { return a * a; };
ll fact(ll v) { return v <= 1 ? 1 : v * fact(v - 1); }
dou factd(int v) {
static vd fact(2, 1);
if (sz(fact) <= v) {
rep(i, sz(fact), v + 1) { fact.push_back(fact.back() * i); }
}
return fact[v];
}
ll comi(ll n, ll r) {
assert(n < 100);
static vvi(pas, 100, 100);
if (pas[0][0])
return pas[n][r];
pas[0][0] = 1;
rep(i, 1, 100) {
pas[i][0] = 1;
rep(j, 1, i + 1) pas[i][j] = pas[i - 1][j - 1] + pas[i - 1][j];
}
return pas[n][r];
}
double comd2(ll n, ll r) {
static vvd(comb, 2020, 2020);
if (comb[0][0] == 0) {
comb[0][0] = 1;
rep(i, 2000) {
comb[i + 1][0] = 1;
rep(j, 1, i + 2) { comb[i + 1][j] = comb[i][j] + comb[i][j - 1]; }
}
}
return comb[n][r];
}
double comd(int n, int r) {
if (r < 0 || r > n)
return 0;
if (n < 2020)
return comd2(n, r);
static vd fact(2, 1);
if (sz(fact) <= n) {
rep(i, sz(fact), n + 1) { fact.push_back(fact.back() * i); }
}
return fact[n] / fact[n - r] / fact[r];
}
ll gcd(ll a, ll b) {
while (b)
a %= b, swap(a, b);
return abs(a);
}
ll gcd(vi b) {
ll res = b[0];
rep(i, 1, sz(b)) res = gcd(b[i], res);
return res;
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll lcm(vi a) {
ll res = a[0];
rep(i, 1, sz(a)) res = lcm(a[i], res);
return res;
}
ll ceil(ll a, ll b) {
if (b == 0) {
debugline("ceil");
deb(a, b);
ole();
return -1;
} else if (a < 0) {
return 0;
} else {
return (a + b - 1) / b;
}
}
ll lower_remi__bx_a(ll kei, ll rem, ll x) {
if (rem >= x)
return 0;
return (x - rem + kei - 1) / kei;
}
ll lower_remv__bx_a(ll kei, ll rem, ll x) {
if (rem >= x)
return rem;
return (x - rem + kei - 1) / kei * kei + rem;
}
ll upper_remi__bx_a(ll kei, ll rem, ll x) {
if (rem > x)
return 0;
return (x - rem + kei) / kei;
}
ll upper_remv__bx_a(ll kei, ll rem, ll x) {
if (rem > x)
return rem;
return (x - rem + kei) / kei * kei + rem;
}
// v * v >= aとなる最小のvを返す
ll sqrt(ll a) {
if (a < 0) {
debugline("sqrt");
deb(a);
ole();
}
ll res = (ll)std::sqrt(a);
while (res * res < a)
++res;
return res;
}
double log(double e, double x) { return log(x) / log(e); }
ll sig(ll t) { return ((1 + t) * t) >> 1; }
ll sig(ll s, ll t) { return ((s + t) * (t - s + 1)) >> 1; }
// 機能拡張
template <class T, class U> void operator+=(pair<T, U> &a, pair<T, U> &b) {
a.fi += b.fi;
a.se += b.se;
}
template <class T, class U> pair<T, U> operator+(pair<T, U> &a, pair<T, U> &b) {
return pair<T, U>(a.fi + b.fi, a.se + b.se);
}
template <typename CharT, typename Traits, typename Alloc>
basic_string<CharT, Traits, Alloc>
operator+(const basic_string<CharT, Traits, Alloc> &lhs, const int rv) {
basic_string<CharT, Traits, Alloc> str(lhs);
str.append(to_string(rv));
return str;
}
template <typename CharT, typename Traits, typename Alloc>
void operator+=(basic_string<CharT, Traits, Alloc> &lhs, const int rv) {
lhs += to_string(rv);
}
template <typename CharT, typename Traits, typename Alloc>
basic_string<CharT, Traits, Alloc>
operator+(const basic_string<CharT, Traits, Alloc> &lhs, const signed rv) {
basic_string<CharT, Traits, Alloc> str(lhs);
str.append(to_string(rv));
return str;
}
template <typename CharT, typename Traits, typename Alloc>
void operator+=(basic_string<CharT, Traits, Alloc> &lhs, const signed rv) {
lhs += to_string(rv);
}
template <class T, class U> void operator+=(queue<T> &a, U v) { a.push(v); }
template <class T, class U> void operator+=(deque<T> &a, U v) {
a.push_back(v);
}
template <class T>
priority_queue<T, vector<T>, greater<T>> &
operator+=(priority_queue<T, vector<T>, greater<T>> &a, vector<T> &v) {
fora(d, v) a.push(d);
return a;
}
template <class T, class U>
priority_queue<T, vector<T>, greater<T>> &
operator+=(priority_queue<T, vector<T>, greater<T>> &a, U v) {
a.push(v);
return a;
}
template <class T, class U>
priority_queue<T> &operator+=(priority_queue<T> &a, U v) {
a.push(v);
return a;
}
template <class T> set<T> &operator+=(set<T> &a, vector<T> v) {
fora(d, v) a.insert(d);
return a;
}
template <class T, class U> auto operator+=(set<T> &a, U v) {
return a.insert(v);
}
template <class T, class U> auto operator-=(set<T> &a, U v) {
return a.erase(v);
}
template <class T, class U> auto operator+=(mset<T> &a, U v) {
return a.insert(v);
}
template <class T, class U>
set<T, greater<T>> &operator+=(set<T, greater<T>> &a, U v) {
a.insert(v);
return a;
}
template <class T, class U> vector<T> &operator+=(vector<T> &a, U v) {
a.push_back(v);
return a;
}
template <class T, class U> vector<T> operator+(const vector<T> &a, U v) {
vector<T> ret = a;
ret += v;
return ret;
}
template <class T, class U> vector<T> operator+(U v, const vector<T> &a) {
vector<T> ret = a;
ret.insert(ret.begin(), v);
return ret;
}
template <class T> vector<T> operator+(vector<T> a, vector<T> b) {
vector<T> ret;
ret = a;
fora(v, b) ret += v;
return ret;
}
template <class T> vector<T> &operator+=(vector<T> &a, vector<T> &b) {
fora(v, b) a += v;
return a;
}
template <class T> vector<T> &operator-=(vector<T> &a, vector<T> &b) {
if (sz(a) != sz(b)) {
debugline("vector<T> operator-=");
deb(a);
deb(b);
exit(0);
}
rep(i, sz(a)) a[i] -= b[i];
return a;
}
template <class T> vector<T> operator-(vector<T> &a, vector<T> &b) {
if (sz(a) != sz(b)) {
debugline("vector<T> operator-");
deb(a);
deb(b);
ole();
}
vector<T> res(sz(a));
rep(i, sz(a)) res[i] = a[i] - b[i];
return res;
}
template <class T, class U> vector<T> operator*(vector<T> &a, U b) {
vector<T> ret;
fora(v, a) ret += v * b;
return ret;
}
template <class T, class U> vector<T> operator/(vector<T> &a, U b) {
vector<T> ret;
fora(v, a) ret += v / b;
return ret;
}
template <class T, class U> vector<T> operator*=(vector<T> &a, U b) {
fora(v, a) v *= b;
return a;
}
template <class T, class U> vector<T> operator/=(vector<T> &a, U b) {
fora(v, a) v /= b;
return a;
}
template <typename T> void erase(vector<T> &v, unsigned ll i) {
v.erase(v.begin() + i);
}
template <typename T> void erase(vector<T> &v, unsigned ll s, unsigned ll e) {
v.erase(v.begin() + s, v.begin() + e);
}
template <class T, class U> void erase(map<T, U> &m, ll okl, ll ngr) {
m.erase(m.lower_bound(okl), m.lower_bound(ngr));
}
template <class T> void erase(set<T> &m, ll okl, ll ngr) {
m.erase(m.lower_bound(okl), m.lower_bound(ngr));
}
template <typename T> void erasen(vector<T> &v, unsigned ll s, unsigned ll n) {
v.erase(v.begin() + s, v.begin() + s + n);
}
template <typename T, typename U>
void insert(vector<T> &v, unsigned ll i, U t) {
v.insert(v.begin() + i, t);
}
template <typename T, typename U> void push_front(vector<T> &v, U t) {
v.insert(v.begin(), t);
}
template <typename T, typename U>
void insert(vector<T> &v, unsigned ll i, vector<T> list) {
for (auto &&va : list)
v.insert(v.begin() + i++, va);
}
template <typename T> void insert(set<T> &v, vector<T> list) {
for (auto &&va : list)
v.insert(va);
}
vector<string> split(const string a, const char deli) {
string b = a + deli;
ll l = 0, r = 0, n = b.size();
vector<string> res;
rep(i, n) {
if (b[i] == deli) {
r = i;
if (l < r)
res.push_back(b.substr(l, r - l));
l = i + 1;
}
}
return res;
}
vector<string> split(const string a, const string deli) {
vector<string> res;
ll kn = sz(deli);
std::string::size_type Pos(a.find(deli));
ll l = 0;
while (Pos != std::string::npos) {
if (Pos - l)
res.push_back(a.substr(l, Pos - l));
l = Pos + kn;
Pos = a.find(deli, Pos + kn);
}
if (sz(a) - l)
res.push_back(a.substr(l, sz(a) - l));
return res;
}
void yn(bool a) {
if (a)
cout << "yes" << endl;
else
cout << "no" << endl;
}
void Yn(bool a) {
if (a)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void YN(bool a) {
if (a)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void fyn(bool a) {
if (a)
cout << "yes" << endl;
else
cout << "no" << endl;
exit(0);
}
void fYn(bool a) {
if (a)
cout << "Yes" << endl;
else
cout << "No" << endl;
exit(0);
}
void fYN(bool a) {
if (a)
cout << "YES" << endl;
else
cout << "NO" << endl;
exit(0);
}
void Possible(bool a) {
if (a)
cout << "Possible" << endl;
else
cout << "Impossible" << endl;
exit(0);
}
void POSSIBLE(bool a) {
if (a)
cout << "POSSIBLE" << endl;
else
cout << "IMPOSSIBLE" << endl;
exit(0);
}
template <typename T> class fixed_point : T {
public:
explicit constexpr fixed_point(T &&t) noexcept : T(std::forward<T>(t)) {}
template <typename... Args>
constexpr decltype(auto) operator()(Args &&...args) const {
return T::operator()(*this, std::forward<Args>(args)...);
}
};
template <typename T>
static inline constexpr decltype(auto) fix(T &&t) noexcept {
return fixed_point<T>{std::forward<T>(t)};
}
//@formatter:off
template <typename T> T minv(T a, T m);
template <typename T> T minv(T a);
template <typename T> class Modular {
public:
using Type = typename decay<decltype(T::value)>::type;
constexpr Modular() : value() {}
template <typename U> Modular(const U &x) { value = normalize(x); }
template <typename U> static Type normalize(const U &x) {
Type v;
if (-mod() <= x && x < mod())
v = static_cast<Type>(x);
else
v = static_cast<Type>(x % mod());
if (v < 0)
v += mod();
return v;
}
const Type &operator()() const { return value; }
template <typename U> explicit operator U() const {
return static_cast<U>(value);
}
constexpr static Type mod() { return T::value; }
Modular &operator+=(const Modular &other) {
if ((value += other.value) >= mod())
value -= mod();
return *this;
}
Modular &operator-=(const Modular &other) {
if ((value -= other.value) < 0)
value += mod();
return *this;
}
template <typename U> Modular &operator+=(const U &other) {
return *this += Modular(other);
}
template <typename U> Modular &operator-=(const U &other) {
return *this -= Modular(other);
}
Modular &operator++() { return *this += 1; }
Modular &operator--() { return *this -= 1; }
Modular operator++(signed) {
Modular result(*this);
*this += 1;
return result;
}
Modular operator--(signed) {
Modular result(*this);
*this -= 1;
return result;
}
Modular operator-() const { return Modular(-value); }
template <typename U = T>
typename enable_if<is_same<typename Modular<U>::Type, signed>::value,
Modular>::type &
operator*=(const Modular &rhs) {
#ifdef _WIN32
uint64_t x = static_cast<int64_t>(value) * static_cast<int64_t>(rhs.value);
uint32_t xh = static_cast<uint32_t>(x >> 32), xl = static_cast<uint32_t>(x),
d, m;
asm("divl %4; \n\t" : "=a"(d), "=d"(m) : "d"(xh), "a"(xl), "r"(mod()));
value = m;
#else
value = normalize(static_cast<int64_t>(value) *
static_cast<int64_t>(rhs.value));
#endif
return *this;
}
template <typename U = T>
typename enable_if<is_same<typename Modular<U>::Type, int64_t>::value,
Modular>::type &
operator*=(const Modular &rhs) {
int64_t q =
static_cast<int64_t>(static_cast<double>(value) * rhs.value / mod());
value = normalize(value * rhs.value - q * mod());
return *this;
}
template <typename U = T>
typename enable_if<!is_integral<typename Modular<U>::Type>::value,
Modular>::type &
operator*=(const Modular &rhs) {
value = normalize(value * rhs.value);
return *this;
}
Modular &operator/=(const Modular &other) {
return *this *= Modular(minv(other.value));
}
template <typename U>
friend bool operator==(const Modular<U> &lhs, const Modular<U> &rhs);
template <typename U>
friend bool operator<(const Modular<U> &lhs, const Modular<U> &rhs);
template <typename U>
friend std::istream &operator>>(std::istream &stream, Modular<U> &number);
operator int() { return value; }
private:
Type value;
};
template <typename T>
bool operator==(const Modular<T> &lhs, const Modular<T> &rhs) {
return lhs.value == rhs.value;
}
template <typename T, typename U>
bool operator==(const Modular<T> &lhs, U rhs) {
return lhs == Modular<T>(rhs);
}
template <typename T, typename U>
bool operator==(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) == rhs;
}
template <typename T>
bool operator!=(const Modular<T> &lhs, const Modular<T> &rhs) {
return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(const Modular<T> &lhs, U rhs) {
return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(U lhs, const Modular<T> &rhs) {
return !(lhs == rhs);
}
template <typename T>
bool operator<(const Modular<T> &lhs, const Modular<T> &rhs) {
return lhs.value < rhs.value;
}
template <typename T>
Modular<T> operator+(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T, typename U>
Modular<T> operator+(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T, typename U>
Modular<T> operator+(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T>
Modular<T> operator-(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
Modular<T> operator-(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
Modular<T> operator-(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T>
Modular<T> operator*(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
Modular<T> operator*(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
Modular<T> operator*(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T>
Modular<T> operator/(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> operator/(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> operator/(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) /= rhs;
}
constexpr signed MOD =
// 998244353;
1e9 + 7; // MOD
using mint = Modular<std::integral_constant<decay<decltype(MOD)>::type, MOD>>;
constexpr int mint_len = 1400001;
vi fac, finv, inv;
vi p2;
mint com(int n, int r) {
if (r < 0 || r > n)
return 0;
return mint(finv[r] * fac[n] % MOD * finv[n - r]);
}
mint pom(int n, int r) { /* if (!sz(fac)) com(0, -1);*/
if (r < 0 || r > n)
return 0;
return mint(fac[n] * finv[n - 1]);
}
mint npr(int n, int r) { /* if (!sz(fac)) com(0, -1);*/
if (r < 0 || r > n)
return 0;
return mint(fac[n] * finv[n - r]);
}
int nprin(int n, int r) { /* if (!sz(fac)) com(0, -1);*/
if (r < 0 || r > n)
return 0;
return fac[n] * finv[n - r] % MOD;
}
int icom(int n, int r) {
const int NUM_ = 1400001;
static ll fac[NUM_ + 1], finv[NUM_ + 1], inv[NUM_ + 1];
if (fac[0] == 0) {
inv[1] = fac[0] = finv[0] = 1;
for (int i = 2; i <= NUM_; ++i)
inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
for (int i = 1; i <= NUM_; ++i)
fac[i] = fac[i - 1] * i % MOD, finv[i] = finv[i - 1] * inv[i] % MOD;
}
if (r < 0 || r > n)
return 0;
return ((finv[r] * fac[n] % MOD) * finv[n - r]) % MOD;
}
#define ncr com
#define ncri icom
// n個の場所にr個の物を置く
mint nhr(int n, int r) { return com(n + r - 1, r); }
mint hom(int n, int r) { return com(n + r - 1, r); }
int nhri(int n, int r) { return icom(n + r - 1, r); }
template <typename T> T minv(T a, T m) {
T u = 0, v = 1;
while (a != 0) {
T t = m / a;
m -= t * a;
swap(a, m);
u -= t * v;
swap(u, v);
}
assert(m == 1);
return u;
}
template <typename T> T minv(T a) {
if (a < mint_len)
return inv[a];
T u = 0, v = 1;
T m = MOD;
while (a != 0) {
T t = m / a;
m -= t * a;
swap(a, m);
u -= t * v;
swap(u, v);
}
assert(m == 1);
return u;
}
template <typename T, typename U>
Modular<T> mpow(const Modular<T> &a, const U &b) {
assert(b >= 0);
int x = a(), res = 1;
U p = b;
while (p > 0) {
if (p & 1)
(res *= x) %= MOD;
(x *= x) %= MOD;
p >>= 1;
}
return res;
}
template <typename T, typename U, typename V>
mint mpow(const T a, const U b, const V m = MOD) {
assert(b >= 0);
int x = a, res = 1;
U p = b;
while (p > 0) {
if (p & 1)
(res *= x) %= m;
(x *= x) %= m;
p >>= 1;
}
return res;
}
template <typename T, typename U> mint mpow(const T a, const U b) {
assert(b >= 0);
int x = a, res = 1;
U p = b;
while (p > 0) {
if (p & 1)
(res *= x) %= MOD;
(x *= x) %= MOD;
p >>= 1;
}
return res;
}
template <typename T, typename U, typename V>
int mpowi(const T &a, const U &b, const V &m = MOD) {
assert(b >= 0);
int x = a, res = 1;
U p = b;
while (p > 0) {
if (p & 1)
(res *= x) %= m;
(x *= x) %= m;
p >>= 1;
}
return res;
}
template <typename T> string to_string(const Modular<T> &number) {
return to_string(number());
}
string yuri(const mint &a) {
stringstream st;
rep(i, 300) {
rep(j, 300) {
if ((mint)i / j == a) {
st << i << " / " << j;
return st.str();
}
}
}
rep(i, 1000) {
rep(j, 1000) {
if ((mint)i / j == a) {
st << i << " / " << j;
return st.str();
}
}
}
return st.str();
}
template <typename T>
std::ostream &operator<<(std::ostream &stream, const Modular<T> &number) {
stream << number();
#ifdef _DEBUG
// stream << " -> " << yuri(number);
#endif
return stream;
}
//@formatter:off
template <typename T>
std::istream &operator>>(std::istream &stream, Modular<T> &number) {
typename common_type<typename Modular<T>::Type, int64_t>::type x;
stream >> x;
number.value = Modular<T>::normalize(x);
return stream;
}
using PM = pair<mint, mint>;
using vm = vector<mint>;
using mapm = map<int, mint>;
using umapm = umap<int, mint>;
#define vvm(...) \
o_vvt(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(mint, __VA_ARGS__)
#define vnm(name, ...) auto name = make_v<mint>(__VA_ARGS__)
struct setmod {
setmod() {
// p2.resize(mint_len);p2[0] = 1; for (int i = 1; i < mint_len; ++i)
// p2[i] = p2[i - 1] * 2 % MOD;
fac.resize(mint_len);
finv.resize(mint_len);
inv.resize(mint_len);
inv[1] = fac[0] = finv[0] = 1;
for (int i = 2; i < mint_len; ++i)
inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
for (int i = 1; i < mint_len; ++i)
fac[i] = fac[i - 1] * i % MOD, finv[i] = finv[i - 1] * inv[i] % MOD;
}
} setmodv;
//@formatter:on
// nhr n個の場所にr個の物を分ける
//@起動時
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(16);
srand((unsigned)clock() + (unsigned)time(NULL));
};
} initonv; //@formatter:on
// gra mll pr
// 上下左右
const string udlr = "udlr";
string UDLR = "UDLR"; // x4と連動 UDLR.find('U') := x4[0]
// 右、上が正
constexpr ll y4[] = {1, -1, 0, 0};
constexpr ll x4[] = {0, 0, -1, 1};
constexpr ll y8[] = {0, 1, 0, -1, -1, 1, 1, -1};
constexpr ll x8[] = {1, 0, -1, 0, 1, -1, 1, -1};
ll n, m, k, K, d, H, W, x, y, z, q, Q;
ll cou;
vi a, b, c;
// vvi (s, 0, 0);
vvc(ba, 0, 0);
vp p;
str s;
void solve() {
in(n);
in(s);
vvi(dp, 5050, 5050);
// vvi(dp, 50, 50);
rer(i, n - 1) {
rer(j, n - 1, i + 1) {
if (s[i] == s[j]) {
chma(dp[i][j], dp[i + 1][j + 1] + 1);
chmi(dp[i][j], j - i);
}
}
}
deb(dp);
cout << max(dp) << endl;
}
auto my(ll n, vi &a) { return 0; }
auto sister(ll n, vi &a) {
ll ret = 0;
return ret;
}
signed main() {
solve();
#define arg n, a
#ifdef _DEBUG
bool bad = 0;
for (ll i = 0, ok = 1; i < k5 && ok; ++i) {
ll n = rand(1, 8);
vi a = ranv(n, 1, 10);
auto myres = my(arg);
auto res = sister(arg);
ok = myres == res;
if (!ok) {
out(arg);
cerr << "AC : " << res << endl;
cerr << "MY : " << myres << endl;
bad = 1;
break;
}
}
if (!bad) {
// cout << "完璧 : solveを書き直そう" << endl;
// cout << " : そして、solve()を呼び出すのだ" << endl;
// cout << " : cin>>n; na(a,n);も忘れるな" << endl;
}
#endif
return 0;
};
| replace | 3,778 | 3,780 | 3,778 | 3,780 | 0 | |
p02913 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define mod 1000000007
using ll = long long;
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int left = 0;
int right = 1;
int ans = 0;
while (1) {
string a = S.substr(left, right - left);
string b = S.substr(right);
// cout << a << " " << b << " " << left << " " << right << endl;
if (b.find(a) != string::npos) {
ans = max(ans, (int)a.size());
right = min(right + 1, N - 1);
if (left == N - 1)
break;
} else {
left++;
if (right == left)
right = min(right + 1, N - 1);
if (left == N - 1)
break;
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define mod 1000000007
using ll = long long;
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int left = 0;
int right = 1;
int ans = 0;
while (1) {
if (N - left < ans + 2)
break;
string a = S.substr(left, right - left);
string b = S.substr(right);
// cout << a << " " << b << " " << left << " " << right << endl;
if (b.find(a) != string::npos) {
ans = max(ans, (int)a.size());
right = min(right + 1, N - 1);
if (left == N - 1)
break;
} else {
left++;
if (right == left)
right = min(right + 1, N - 1);
if (left == N - 1)
break;
}
}
cout << ans << endl;
return 0;
}
| insert | 29 | 29 | 29 | 31 | TLE | |
p02913 | C++ | Runtime Error | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvb = vector<vb>;
constexpr int MOD = 1000000007;
// O(n^2)
bool check(const string &s, int x) {
int n = s.size();
int cnt;
rep(diff, x, n - x + 1) {
cnt = 0;
rep(i, 0, n - x) {
// (i, i + diff)
if (s[i] == s[i + diff]) {
++cnt;
if (cnt == x) {
return true;
}
} else {
cnt = 0;
}
}
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
string s;
cin >> s;
int ok = 0, ng = n / 2 + 1;
while (ok + 1 != ng) {
int mid = (ok + ng) / 2;
if (check(s, mid)) {
ok = mid;
} else {
ng = mid;
}
}
cout << ok << endl;
return 0;
} | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
#define all(a) a.begin(), a.end()
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = vector<vi>;
using vvb = vector<vb>;
constexpr int MOD = 1000000007;
// O(n^2)
bool check(const string &s, int x) {
int n = s.size();
int cnt;
rep(diff, x, n - x + 1) {
cnt = 0;
rep(i, 0, n - diff) {
// (i, i + diff)
if (s[i] == s[i + diff]) {
++cnt;
if (cnt == x) {
return true;
}
} else {
cnt = 0;
}
}
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
string s;
cin >> s;
int ok = 0, ng = n / 2 + 1;
while (ok + 1 != ng) {
int mid = (ok + ng) / 2;
if (check(s, mid)) {
ok = mid;
} else {
ng = mid;
}
}
cout << ok << endl;
return 0;
} | replace | 25 | 26 | 25 | 26 | 0 | |
p02913 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
vector<vector<int>> cnt(26);
int main() {
int n, f, a, b, t;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
cnt[s[i] - 'a'].push_back(i);
}
int ans = 0;
for (int i = 0; i < 26; i++) {
f = cnt[i].size();
for (int j = 0; j < f; j++) {
a = cnt[i][j];
for (int k = f - 1; k > j && cnt[i][k] - a > ans; k--) {
b = cnt[i][k];
t = 0;
for (int m = 0; a + m < b; m++) {
if (s[a + m] == s[b + m])
t++;
else
break;
}
if (t > ans)
ans = t;
}
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
vector<vector<int>> cnt(26);
int main() {
int n, f, a, b, t;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
cnt[s[i] - 'a'].push_back(i);
}
int ans = 0;
for (int i = 0; i < 26; i++) {
f = cnt[i].size();
for (int j = 0; j < f; j++) {
a = cnt[i][j];
for (int k = f - 1; k > j && cnt[i][k] - a > ans; k--) {
b = cnt[i][k];
if (n - b <= ans)
continue;
t = 0;
for (int m = 0; a + m < b; m++) {
if (s[a + m] == s[b + m])
t++;
else
break;
}
if (t > ans)
ans = t;
}
}
}
cout << ans << endl;
}
| insert | 24 | 24 | 24 | 26 | TLE | |
p02913 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define MAXN 9300000
int p[MAXN][26], minn[MAXN];
int n, top, i, j, k, c, best, x;
string s;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> s;
best = 0;
top = 0;
for (i = 0; i < n; i++) {
x = 0;
for (j = 0; (i + j < n) && (j < n / 2); j++) {
c = s[i + j] - 'a';
if (p[x][c] == 0)
p[x][c] = ++top;
x = p[x][c];
if (minn[x] == 0)
minn[x] = i + 1;
else {
if (i + 1 - minn[x] >= j + 1)
best = max(best, j + 1);
}
}
}
cout << best << "\n";
return 0;
}
| #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define MAXN 9500000
int p[MAXN][26], minn[MAXN];
int n, top, i, j, k, c, best, x;
string s;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> s;
best = 0;
top = 0;
for (i = 0; i < n; i++) {
x = 0;
for (j = 0; (i + j < n) && (j < n / 2); j++) {
c = s[i + j] - 'a';
if (p[x][c] == 0)
p[x][c] = ++top;
x = p[x][c];
if (minn[x] == 0)
minn[x] = i + 1;
else {
if (i + 1 - minn[x] >= j + 1)
best = max(best, j + 1);
}
}
}
cout << best << "\n";
return 0;
}
| replace | 20 | 21 | 20 | 21 | -11 | |
p02913 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
typedef vector<int> vi;
const ll M = 1e9 + 7;
template <typename T> vi z_algorithm(T &s, ll n) {
vi res(n);
res[0] = n;
ll i1 = 1, i2 = 0;
while (i1 < n) {
while (i1 + i2 < n && s[i2] == s[i1 + i2])
++i2;
res[i1] = i2;
if (i2 == 0) {
++i1;
continue;
}
ll i3 = 1;
while (i1 + i3 < n && i3 + res[i3] < i2) {
res[i1 + i3] = res[i3];
++i3;
}
i1 += i3, i2 -= i3;
}
return res;
}
int main(void) {
int n, ans = 0;
string s;
cin >> n >> s;
rep(i, n) {
string ss = s.substr(i, n - i);
vi res = z_algorithm(ss, n);
rep(j, n - i) ans = max(ans, min(j, res[j]));
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
typedef long long ll;
typedef vector<int> vi;
const ll M = 1e9 + 7;
template <typename T> vi z_algorithm(T &s, ll n) {
vi res(n);
res[0] = n;
ll i1 = 1, i2 = 0;
while (i1 < n) {
while (i1 + i2 < n && s[i2] == s[i1 + i2])
++i2;
res[i1] = i2;
if (i2 == 0) {
++i1;
continue;
}
ll i3 = 1;
while (i1 + i3 < n && i3 + res[i3] < i2) {
res[i1 + i3] = res[i3];
++i3;
}
i1 += i3, i2 -= i3;
}
return res;
}
int main(void) {
int n, ans = 0;
string s;
cin >> n >> s;
rep(i, n) {
string ss = s.substr(i, n - i);
vi res = z_algorithm(ss, n - i);
rep(j, n - i) ans = max(ans, min(j, res[j]));
}
cout << ans << endl;
return 0;
}
| replace | 38 | 39 | 38 | 39 | 0 | |
p02913 | C++ | Time Limit Exceeded | #include <cstdio>
#include <queue>
using namespace std;
char S[6000];
int main() {
int N;
int ret = 0;
scanf("%d%s", &N, &S);
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
for (int k = 0; k < j - i && j + k < N && S[i + k] == S[j + k]; ++k) {
if (ret < k + 1) {
ret = k + 1;
}
}
}
}
printf("%d\n", ret);
return 0;
}
| #include <cstdio>
#include <queue>
using namespace std;
char S[6000];
int main() {
int N;
int ret = 0;
scanf("%d%s", &N, &S);
for (int i = 0; i < N; ++i) {
for (int j = i + ret + 1; j + ret < N; ++j) {
if (i + ret < j && S[i + ret] == S[j + ret]) {
int k;
for (k = 0; k < ret && S[i + k] == S[j + k]; ++k)
;
if (k == ret) {
for (; ret < j - i && j + ret < N && S[i + ret] == S[j + ret]; ++ret)
;
}
}
}
}
printf("%d\n", ret);
return 0;
}
| replace | 12 | 16 | 12 | 20 | TLE | |
p02913 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
const int M = 3005;
char s[M];
int nxt[M];
int get_nxt(char p[], int m, int nxt[]) {
nxt[0] = m;
int j = -1, a, l;
int ans = 0;
for (int i = 1; i < m; i++, j--) {
if (j == -1 || i + nxt[i - a] >= l) {
if (j == -1)
j = 0, l = i;
for (; l < m && j < m && p[l] == p[j]; l++, j++)
;
nxt[i] = j;
a = i;
} else
nxt[i] = nxt[i - a];
// cout<<i<<" "<<nxt[i]<<endl;
ans = max(ans, min(nxt[i], i));
}
return ans;
}
int main() {
int n;
scanf("%d%s", &n, s);
int ans = 0;
for (int i = 0; i < n; i++) {
// cout<<i<<" : "<<endl;
ans = max(ans, get_nxt(s + i, n - i, nxt));
}
printf("%d\n", ans);
return 0;
} | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
const int M = 5005;
char s[M];
int nxt[M];
int get_nxt(char p[], int m, int nxt[]) {
nxt[0] = m;
int j = -1, a, l;
int ans = 0;
for (int i = 1; i < m; i++, j--) {
if (j == -1 || i + nxt[i - a] >= l) {
if (j == -1)
j = 0, l = i;
for (; l < m && j < m && p[l] == p[j]; l++, j++)
;
nxt[i] = j;
a = i;
} else
nxt[i] = nxt[i - a];
// cout<<i<<" "<<nxt[i]<<endl;
ans = max(ans, min(nxt[i], i));
}
return ans;
}
int main() {
int n;
scanf("%d%s", &n, s);
int ans = 0;
for (int i = 0; i < n; i++) {
// cout<<i<<" : "<<endl;
ans = max(ans, get_nxt(s + i, n - i, nxt));
}
printf("%d\n", ans);
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define for0(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int n, ans;
string s;
int main() {
cin >> n >> s;
for0(i, n) for0(j, i) {
if (i - j < ans)
continue;
int p = j, q = i;
while (s[p] == s[q]) {
p++;
q++;
if (p == i)
break;
if (q == n)
break;
}
ans = max(ans, p - j);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define for0(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int n, ans;
string s;
int main() {
cin >> n >> s;
for0(i, n) for0(j, i) {
if (i - j < ans)
continue;
if (j > 0 && s[i - 1] == s[j - 1])
continue;
int p = j, q = i;
while (s[p] == s[q]) {
p++;
q++;
if (p == i)
break;
if (q == n)
break;
}
ans = max(ans, p - j);
}
cout << ans << endl;
} | insert | 9 | 9 | 9 | 11 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P std::pair<int, int>
#define PiP std::pair<int, std::pair<int, int>>
#define all(v) v.begin(), v.end()
#define mkp std::make_pair
#define prique(T) std::priority_queue<T, vector<T>, greater<T>>
using namespace std;
template <class T> inline void chmax(T &a, T b) { a = std::max(a, b); }
template <class T> inline void chmin(T &a, T b) { a = std::min(a, b); }
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return x != 1;
}
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= i;
res %= mod;
}
return res;
}
int mod_pow(int x, int y, int m = mod) {
int res = 1;
x %= m;
while (y > 0) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
int comb(int x, int y) {
if (y > x)
return 0;
return kai(x, y) * mod_pow(kai(y, y), mod - 2, mod) % mod;
}
int get_rand(int MIN, int MAX) {
std::random_device rnd;
std::mt19937 mt32(rnd());
std::uniform_int_distribution<int> engine(MIN, MAX);
return engine(mt32);
}
struct BIT {
vector<int> bit;
int n;
BIT(int x) {
bit.resize(x, 0);
n = x;
}
void add(int x, int y) {
while (x <= n) {
bit[x] += y;
x += x & -x;
}
}
int sum(int x) {
int res = 0;
while (x > 0) {
res += bit[x];
x -= x & -x;
}
return res;
}
};
struct UnionFind {
vector<int> par, size;
UnionFind(int x) {
par.resize(x);
size.resize(x, 1);
rep(i, x) par[i] = i;
}
int find(int x) {
if (par[x] == x)
return x;
return par[x] = find(par[x]);
}
bool same(int x, int y) { return find(x) == find(y); }
int consize(int x) { return size[find(x)]; }
void unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return;
if (size[x] < size[y]) {
par[x] = y;
size[y] += size[x];
} else {
par[y] = x;
size[x] += size[y];
}
}
};
struct Tree {
int size;
vector<int> par, depth;
vector<int> doubling[30];
vector<vector<int>> G;
int root = 0;
Tree(int x) {
par.resize(x);
depth.resize(x);
rep(i, 30) { doubling[i].resize(x, -1); }
G.resize(x);
size = x;
}
void add_edge(int x, int y) {
G[x].push_back(y);
G[y].push_back(x);
}
void dfs(int x) {
for (int i : G[x]) {
if (depth[i] == -1) {
depth[i] = depth[x] + 1;
doubling[0][i] = x;
dfs(i);
}
}
}
void init() {
rep(i, size) depth[i] = -1;
depth[root] = 0;
dfs(root);
rep(i, 29) {
rep(j, size) {
if (doubling[i][j] == -1)
doubling[i + 1][j] = -1;
else
doubling[i + 1][j] = doubling[i][doubling[i][j]];
}
}
}
int lca(int x, int y) {
if (depth[x] > depth[y])
swap(x, y);
for (int i = 29; i >= 0; i--) {
if ((depth[y] - depth[x]) >> i & 1) {
y = doubling[i][y];
}
}
if (x == y)
return x;
for (int i = 29; i >= 0; i--) {
if (doubling[i][x] != doubling[i][y]) {
x = doubling[i][x];
y = doubling[i][y];
}
}
return doubling[0][x];
}
};
/*--------Library Zone!--------*/
struct RollingHash {
int Base = 283;
const int MASK30 = (1ll << 30) - 1;
const int MASK31 = (1ll << 31) - 1;
const int MOD = (1ll << 61) - 1;
vector<int> hash, power;
int calcmod(int val) {
val = (val & MOD) + (val >> 61);
if (val > MOD)
val -= MOD;
return val;
}
int mul(int x, int y) {
int xu = x >> 31;
int xd = x & MASK31;
int yu = y >> 31;
int yd = y & MASK31;
int mid = xd * yu + xu * yd;
int midu = mid >> 30;
int midd = mid & MASK30;
return calcmod(xu * yu * 2 + midu + (midd << 31) + xd * yd);
}
RollingHash(string s) {
// Base=get_rand(1<<7,1<<8);
int sz = s.size();
hash.resize(sz + 1, 0);
power.resize(sz + 1, 1);
rep(i, sz) {
hash[i + 1] = (mul(hash[i], Base) + s[i]) % MOD;
power[i + 1] = mul(power[i], Base) % MOD;
}
}
int get(int l, int r) {
int res = (hash[r] - mul(hash[l], power[r - l]) + MOD) % MOD;
return res;
}
int lcp(int x, int y) {
int len = min(hash.size() - y, hash.size() - x);
int ok = 0, ng = len + 1;
while (ng - ok > 1) {
int mid = (ok + ng) / 2;
if (get(x, x + mid) == get(y, y + mid))
ok = mid;
else
ng = mid;
}
return ok;
}
};
signed main() {
int n;
string s;
cin >> n >> s;
RollingHash rhs(s);
int ans = 0;
rep(i, s.size()) {
for (int j = i + 1; j < s.size(); j++) {
chmax(ans, min(j - i, rhs.lcp(i, j)));
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define int long long
#define mod (int)(1e9 + 7)
#define inf (int)(3e18)
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define P std::pair<int, int>
#define PiP std::pair<int, std::pair<int, int>>
#define all(v) v.begin(), v.end()
#define mkp std::make_pair
#define prique(T) std::priority_queue<T, vector<T>, greater<T>>
using namespace std;
template <class T> inline void chmax(T &a, T b) { a = std::max(a, b); }
template <class T> inline void chmin(T &a, T b) { a = std::min(a, b); }
bool prime(int x) {
for (int i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return x != 1;
}
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= i;
res %= mod;
}
return res;
}
int mod_pow(int x, int y, int m = mod) {
int res = 1;
x %= m;
while (y > 0) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
int comb(int x, int y) {
if (y > x)
return 0;
return kai(x, y) * mod_pow(kai(y, y), mod - 2, mod) % mod;
}
int get_rand(int MIN, int MAX) {
std::random_device rnd;
std::mt19937 mt32(rnd());
std::uniform_int_distribution<int> engine(MIN, MAX);
return engine(mt32);
}
struct BIT {
vector<int> bit;
int n;
BIT(int x) {
bit.resize(x, 0);
n = x;
}
void add(int x, int y) {
while (x <= n) {
bit[x] += y;
x += x & -x;
}
}
int sum(int x) {
int res = 0;
while (x > 0) {
res += bit[x];
x -= x & -x;
}
return res;
}
};
struct UnionFind {
vector<int> par, size;
UnionFind(int x) {
par.resize(x);
size.resize(x, 1);
rep(i, x) par[i] = i;
}
int find(int x) {
if (par[x] == x)
return x;
return par[x] = find(par[x]);
}
bool same(int x, int y) { return find(x) == find(y); }
int consize(int x) { return size[find(x)]; }
void unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return;
if (size[x] < size[y]) {
par[x] = y;
size[y] += size[x];
} else {
par[y] = x;
size[x] += size[y];
}
}
};
struct Tree {
int size;
vector<int> par, depth;
vector<int> doubling[30];
vector<vector<int>> G;
int root = 0;
Tree(int x) {
par.resize(x);
depth.resize(x);
rep(i, 30) { doubling[i].resize(x, -1); }
G.resize(x);
size = x;
}
void add_edge(int x, int y) {
G[x].push_back(y);
G[y].push_back(x);
}
void dfs(int x) {
for (int i : G[x]) {
if (depth[i] == -1) {
depth[i] = depth[x] + 1;
doubling[0][i] = x;
dfs(i);
}
}
}
void init() {
rep(i, size) depth[i] = -1;
depth[root] = 0;
dfs(root);
rep(i, 29) {
rep(j, size) {
if (doubling[i][j] == -1)
doubling[i + 1][j] = -1;
else
doubling[i + 1][j] = doubling[i][doubling[i][j]];
}
}
}
int lca(int x, int y) {
if (depth[x] > depth[y])
swap(x, y);
for (int i = 29; i >= 0; i--) {
if ((depth[y] - depth[x]) >> i & 1) {
y = doubling[i][y];
}
}
if (x == y)
return x;
for (int i = 29; i >= 0; i--) {
if (doubling[i][x] != doubling[i][y]) {
x = doubling[i][x];
y = doubling[i][y];
}
}
return doubling[0][x];
}
};
/*--------Library Zone!--------*/
struct RollingHash {
int Base = 283;
const int MASK30 = (1ll << 30) - 1;
const int MASK31 = (1ll << 31) - 1;
const int MOD = (1ll << 61) - 1;
vector<int> hash, power;
int calcmod(int val) {
val = (val & MOD) + (val >> 61);
if (val > MOD)
val -= MOD;
return val;
}
int mul(int x, int y) {
int xu = x >> 31;
int xd = x & MASK31;
int yu = y >> 31;
int yd = y & MASK31;
int mid = xd * yu + xu * yd;
int midu = mid >> 30;
int midd = mid & MASK30;
return calcmod(xu * yu * 2 + midu + (midd << 31) + xd * yd);
}
RollingHash(string s) {
// Base=get_rand(1<<7,1<<8);
int sz = s.size();
hash.resize(sz + 1, 0);
power.resize(sz + 1, 1);
rep(i, sz) {
hash[i + 1] = (mul(hash[i], Base) + s[i]) % MOD;
power[i + 1] = mul(power[i], Base) % MOD;
}
}
int get(int l, int r) {
int res = (hash[r] - mul(hash[l], power[r - l]) + MOD) % MOD;
return res;
}
int lcp(int x, int y) {
int len = min(hash.size() - y, hash.size() - x);
int ok = 0, ng = len + 1;
while (ng - ok > 1) {
int mid = (ok + ng) / 2;
if (get(x, x + mid) == get(y, y + mid))
ok = mid;
else
ng = mid;
}
return ok;
}
};
signed main() {
int n;
string s;
cin >> n >> s;
RollingHash rhs(s);
int ok = 0, ng = s.size() / 2 + 1;
while (ng - ok > 1) {
int mid = (ok + ng) / 2;
int ans[5005];
set<int> st;
rep(i, s.size() - mid + 1) {
ans[i] = rhs.get(i, i + mid);
if (i - mid >= 0)
st.insert(ans[i - mid]);
if (st.find(ans[i]) != st.end()) {
ok = mid;
goto ok;
}
}
ng = mid;
ok:;
}
cout << ok << endl;
}
| replace | 224 | 232 | 224 | 243 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
struct RollingHash {
ll base1 = 1009;
ll base2 = 2009;
ll mod1 = 1000000007;
ll mod2 = 1000000009;
vector<ll> hash1, hash2, pow1, pow2;
RollingHash(const string &S) {
int n = (int)S.size();
hash1.assign(n + 1, 0);
hash2.assign(n + 1, 0);
pow1.assign(n + 1, 1);
pow2.assign(n + 1, 1);
for (int i = 0; i < n; ++i) {
hash1[i + 1] = (hash1[i] * base1 + S[i]) % mod1;
hash2[i + 1] = (hash2[i] * base2 + S[i]) % mod2;
pow1[i + 1] = (pow1[i] * base1) % mod1;
pow2[i + 1] = (pow2[i] * base2) % mod2;
}
}
inline pair<ll, ll> get(int l, int r) const {
ll res1 = hash1[r] - hash1[l] * pow1[r - l] % mod1;
if (res1 < 0)
res1 += mod1;
ll res2 = hash2[r] - hash2[l] * pow2[r - l] % mod2;
if (res2 < 0)
res2 += mod2;
return {res1, res2};
}
inline int getLCP(int a, int b) const {
int len = min((int)hash1.size() - a, (int)hash1.size() - b);
int low = 0, high = len;
while (high - low > 1) {
int mid = (low + high) >> 1;
if (get(a, a + mid) != get(b, b + mid))
high = mid;
else
low = mid;
}
return low;
}
};
int main() {
int N;
string S;
cin >> N >> S;
RollingHash rollingHash(S);
int res = 0;
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
int lcp = rollingHash.getLCP(i, j);
lcp = min(lcp, j - i);
res = max(res, lcp);
}
}
cout << res << endl;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
struct RollingHash {
static const ll base1 = 1009;
static const ll base2 = 2009;
static const ll mod1 = 1000000007;
static const ll mod2 = 1000000009;
vector<ll> hash1, hash2, pow1, pow2;
RollingHash(const string &S) {
int n = (int)S.size();
hash1.assign(n + 1, 0);
hash2.assign(n + 1, 0);
pow1.assign(n + 1, 1);
pow2.assign(n + 1, 1);
for (int i = 0; i < n; ++i) {
hash1[i + 1] = (hash1[i] * base1 + S[i]) % mod1;
hash2[i + 1] = (hash2[i] * base2 + S[i]) % mod2;
pow1[i + 1] = (pow1[i] * base1) % mod1;
pow2[i + 1] = (pow2[i] * base2) % mod2;
}
}
inline pair<ll, ll> get(int l, int r) const {
ll res1 = hash1[r] - hash1[l] * pow1[r - l] % mod1;
if (res1 < 0)
res1 += mod1;
ll res2 = hash2[r] - hash2[l] * pow2[r - l] % mod2;
if (res2 < 0)
res2 += mod2;
return {res1, res2};
}
inline int getLCP(int a, int b) const {
int len = min((int)hash1.size() - a, (int)hash1.size() - b);
int low = 0, high = len;
while (high - low > 1) {
int mid = (low + high) >> 1;
if (get(a, a + mid) != get(b, b + mid))
high = mid;
else
low = mid;
}
return low;
}
};
int main() {
int N;
string S;
cin >> N >> S;
RollingHash rollingHash(S);
int res = 0;
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
int lcp = rollingHash.getLCP(i, j);
lcp = min(lcp, j - i);
res = max(res, lcp);
}
}
cout << res << endl;
}
| replace | 9 | 13 | 9 | 13 | TLE | |
p02913 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define all(a) a.begin(), a.end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pb push_back
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef complex<ld> com;
constexpr int inf = 1000000000;
constexpr ll INF = 1000000000000000000;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.141592653589793238;
template <class T, class U> inline bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> class rollinghash {
const ull mask30 = (1LL << 30) - 1;
const ull mask31 = (1LL << 31) - 1;
const ull mod61 = (1LL << 61) - 1;
vector<ull> base;
vector<vector<ull>> hashvalue, basepower;
int length;
ull multiply(ull a, ull b) {
ull au = a >> 31;
ull ad = a & mask31;
ull bu = b >> 31;
ull bd = b & mask31;
ull mid = ad * bu + au * bd;
ull midu = mid >> 30;
ull midd = mid & mask30;
return au * bu * 2 + midu + (midd << 31) + ad * bd;
}
ull modulo(ull a) {
ull au = a >> 61;
ull ad = a & mod61;
ull res = au + ad;
if (res >= mod61)
res -= mod61;
return res;
}
public:
rollinghash(T s) {
length = s.size();
base = {200004};
hashvalue = vector<vector<ull>>(length + 1, vector<ull>(1));
for (int j = 0; j < 1; j++) {
for (int i = 0; i < length; i++) {
hashvalue[i + 1][j] = modulo(multiply(hashvalue[i][j], base[j]) + s[i]);
}
}
basepower = vector<vector<ull>>(length + 1, vector<ull>(1));
for (int j = 0; j < 1; j++) {
basepower[0][j] = 1;
for (int i = 1; i <= length; i++) {
basepower[i][j] = modulo(multiply(basepower[i - 1][j], base[j]));
}
}
}
ull hash(ll l, ll r, ll i) {
assert(l < r && 0 <= l && l < length && 0 < r && r <= length);
return modulo(hashvalue[r][i] + mod61 * 3 -
multiply(hashvalue[l][i], basepower[r - l][i]));
}
};
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int n;
cin >> n;
string s;
cin >> s;
rollinghash<string> rol(s);
int ans = 0;
rep(i, n) {
for (int j = i + 1; j < n; j++) {
if (ans != 0 && rol.hash(i, i + ans, 0) != rol.hash(j, j + ans, 0))
continue;
int ok = ans, ng = j - i + 1;
while (ng - ok > 1) {
int mid = (ok + ng) / 2;
bool flag = true;
rep(k, 1) {
if (j + mid > n || rol.hash(i, i + mid, k) != rol.hash(j, j + mid, k))
flag = false;
}
if (flag)
ok = mid;
else
ng = mid;
}
chmax(ans, ok);
}
}
cout << ans << '\n';
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <time.h>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define all(a) a.begin(), a.end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pb push_back
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef complex<ld> com;
constexpr int inf = 1000000000;
constexpr ll INF = 1000000000000000000;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.141592653589793238;
template <class T, class U> inline bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> class rollinghash {
const ull mask30 = (1LL << 30) - 1;
const ull mask31 = (1LL << 31) - 1;
const ull mod61 = (1LL << 61) - 1;
vector<ull> base;
vector<vector<ull>> hashvalue, basepower;
int length;
ull multiply(ull a, ull b) {
ull au = a >> 31;
ull ad = a & mask31;
ull bu = b >> 31;
ull bd = b & mask31;
ull mid = ad * bu + au * bd;
ull midu = mid >> 30;
ull midd = mid & mask30;
return au * bu * 2 + midu + (midd << 31) + ad * bd;
}
ull modulo(ull a) {
ull au = a >> 61;
ull ad = a & mod61;
ull res = au + ad;
if (res >= mod61)
res -= mod61;
return res;
}
public:
rollinghash(T s) {
length = s.size();
base = {200004};
hashvalue = vector<vector<ull>>(length + 1, vector<ull>(1));
for (int j = 0; j < 1; j++) {
for (int i = 0; i < length; i++) {
hashvalue[i + 1][j] = modulo(multiply(hashvalue[i][j], base[j]) + s[i]);
}
}
basepower = vector<vector<ull>>(length + 1, vector<ull>(1));
for (int j = 0; j < 1; j++) {
basepower[0][j] = 1;
for (int i = 1; i <= length; i++) {
basepower[i][j] = modulo(multiply(basepower[i - 1][j], base[j]));
}
}
}
ull hash(ll l, ll r, ll i) {
assert(l < r && 0 <= l && l < length && 0 < r && r <= length);
return modulo(hashvalue[r][i] + mod61 * 3 -
multiply(hashvalue[l][i], basepower[r - l][i]));
}
};
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int n;
cin >> n;
string s;
cin >> s;
rollinghash<string> rol(s);
int ans = 0;
rep(i, n) {
for (int j = i + 1; j < n; j++) {
if (j + ans > n ||
ans != 0 && rol.hash(i, i + ans, 0) != rol.hash(j, j + ans, 0))
continue;
int ok = ans, ng = j - i + 1;
while (ng - ok > 1) {
int mid = (ok + ng) / 2;
bool flag = true;
rep(k, 1) {
if (j + mid > n || rol.hash(i, i + mid, k) != rol.hash(j, j + mid, k))
flag = false;
}
if (flag)
ok = mid;
else
ng = mid;
}
chmax(ans, ok);
}
}
cout << ans << '\n';
} | replace | 116 | 117 | 116 | 118 | -6 | f08cf1f9-5e18-4e8d-b79e-8e021f779f58.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02913/C++/s286766008.cpp:79: ull rollinghash<T>::hash(ll, ll, ll) [with T = std::__cxx11::basic_string<char>; ull = long long unsigned int; ll = long long int]: Assertion `l < r && 0 <= l && l < length && 0 < r && r <= length' failed.
|
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// typedef
//-------------------------#include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
template <typename T = int> inline T readT() {
char c = getchar_unlocked();
bool neg = (c == '-');
T res = neg ? 0 : c - '0';
while (isdigit(c = getchar_unlocked()))
res = res * 10 + c - '0';
return neg ? -res : res;
}
template <typename T = int> inline void writeT(T x, char c = '\n') {
int d[20], i = 0;
if (x < 0)
putchar_unlocked('-'), x *= -1;
do {
d[i++] = x % 10;
} while (x /= 10);
while (i--)
putchar_unlocked('0' + d[i]);
putchar_unlocked(c);
}
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define MOD 1000000007
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const double EPS = 1E-8;
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
class UnionFind {
public:
vector<int> par;
vector<int> siz;
UnionFind(int sz_) : par(sz_), siz(sz_, 1) {
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
void init(int sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
int root(int x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(int x, int y) { return root(x) == root(y); }
int size(int x) { return siz[root(x)]; }
};
ll modPow(ll x, ll n, ll mod = MOD) {
ll res = 1;
while (n) {
if (n & 1)
res = (res * x) % mod;
res %= mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
#define SIEVE_SIZE 5000000 + 10
bool sieve[SIEVE_SIZE];
void makeSieve() {
for (int i = 0; i < SIEVE_SIZE; ++i)
sieve[i] = true;
sieve[0] = sieve[1] = false;
for (int i = 2; i * i < SIEVE_SIZE; ++i)
if (sieve[i])
for (int j = 2; i * j < SIEVE_SIZE; ++j)
sieve[i * j] = false;
}
bool isprime(ll n) {
if (n == 0 || n == 1)
return false;
for (ll i = 2; i * i <= n; ++i)
if (n % i == 0)
return false;
return true;
}
const int MAX = 2000010;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
// 負の数にも対応した mod (a = -11 とかでも OK)
inline long long mod(long long a, long long m) { return (a % m + m) % m; }
// 逆元計算 (ここでは a と m が互いに素であることが必要)
long long modinv(long long a, long long m) {
long long x, y;
extGCD(a, m, x, y);
return mod(x, m); // 気持ち的には x % m だが、x が負かもしれないので
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
typedef vector<ll> vec;
typedef vector<vec> mat;
mat mul(mat &A, mat &B) {
mat C(A.size(), vec((int)B[0].size()));
for (int i = 0; i < A.size(); ++i) {
for (int k = 0; k < B.size(); ++k) {
for (int j = 0; j < B[0].size(); ++j) {
C[i][j] = (C[i][j] + A[i][k] * B[k][j] % MOD) % MOD;
}
}
}
return C;
}
mat matPow(mat A, ll n) {
mat B(A.size(), vec((int)A.size()));
for (int i = 0; i < A.size(); ++i) {
B[i][i] = 1;
}
while (n > 0) {
if (n & 1)
B = mul(B, A);
A = mul(A, A);
n >>= 1;
}
return B;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
using ld = long double;
template <typename T = int> struct BIT {
vector<T> node;
int N;
BIT(int n) {
N = n;
node.resize(N + 1);
}
void add(int i, T x) {
i++;
while (i <= N) {
node[i] += x;
i += (i & -i);
}
}
T sum(int i) {
T res = 0;
while (i > 0) {
res += node[i];
i -= (i & -i);
}
return res;
}
};
struct RollingHash {
using ull = unsigned long long;
const ull mod = (1UL << 61) - 1;
const ull MASK30 = (1UL << 30) - 1;
const ull MASK31 = (1UL << 31) - 1;
const ull MASK61 = mod;
ull base;
int n;
vector<ull> hash, pow;
RollingHash(string s) {
random_device rnd;
mt19937_64 mt(rnd());
base = calc_mod(mt()) % 100000 + 1000;
n = (int)s.size();
hash.assign(n + 1, 0);
pow.assign(n + 1, 1);
for (int i = 0; i < n; i++) {
hash[i + 1] = calc_mod(mul(hash[i], base) + s[i]);
pow[i + 1] = calc_mod(mul(pow[i], base));
}
}
ull calc_mod(ull x) {
ull xu = x >> 61;
ull xd = x & MASK61;
ull res = xu + xd;
if (res >= mod)
res -= mod;
return res;
}
ull mul(ull a, ull b) {
ull au = a >> 31;
ull ad = a & MASK31;
ull bu = b >> 31;
ull bd = b & MASK31;
ull mid = ad * bu + au * bd;
ull midu = mid >> 30;
ull midd = mid & MASK30;
return calc_mod(au * bu * 2 + midu + (midd << 31) + ad * bd);
}
//[l,r)のハッシュ値
inline ull get(int l, int r) {
ull res = calc_mod(hash[r] + mod * 4 - mul(hash[l], pow[r - l]));
return res;
}
// string tのハッシュ値
inline ull get(string t) {
ull res = 0;
for (int i = 0; i < t.size(); i++) {
res = calc_mod(mul(res, base) + t[i]);
}
return res;
}
// string s中のtの数をcount
inline int count(string t) {
if (t.size() > n)
return 0;
auto hs = get(t);
int res = 0;
for (int i = 0; i < n - t.size() + 1; i++) {
if (get(i, i + t.size()) == hs)
res++;
}
return res;
}
// LCPを求める S[a:] T[b:]
inline int LCP(int a, int b) {
int len = min((int)hash.size() - a, (int)hash.size() - b);
int lb = -1, ub = len + 1;
while (ub - lb > 1) {
int mid = (lb + ub) / 2;
if (get(a, a + mid) == get(b, b + mid))
lb = mid;
else
ub = mid;
}
return lb;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(5);
int N;
string s;
cin >> N >> s;
RollingHash rh(s);
int ans = 0;
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
ans = max(ans, min(rh.LCP(i, j), j - i));
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
// typedef
//-------------------------#include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
template <typename T = int> inline T readT() {
char c = getchar_unlocked();
bool neg = (c == '-');
T res = neg ? 0 : c - '0';
while (isdigit(c = getchar_unlocked()))
res = res * 10 + c - '0';
return neg ? -res : res;
}
template <typename T = int> inline void writeT(T x, char c = '\n') {
int d[20], i = 0;
if (x < 0)
putchar_unlocked('-'), x *= -1;
do {
d[i++] = x % 10;
} while (x /= 10);
while (i--)
putchar_unlocked('0' + d[i]);
putchar_unlocked(c);
}
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define MOD 1000000007
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const double EPS = 1E-8;
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
class UnionFind {
public:
vector<int> par;
vector<int> siz;
UnionFind(int sz_) : par(sz_), siz(sz_, 1) {
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
void init(int sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
int root(int x) {
while (par[x] != x) {
x = par[x] = par[par[x]];
}
return x;
}
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(int x, int y) { return root(x) == root(y); }
int size(int x) { return siz[root(x)]; }
};
ll modPow(ll x, ll n, ll mod = MOD) {
ll res = 1;
while (n) {
if (n & 1)
res = (res * x) % mod;
res %= mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
#define SIEVE_SIZE 5000000 + 10
bool sieve[SIEVE_SIZE];
void makeSieve() {
for (int i = 0; i < SIEVE_SIZE; ++i)
sieve[i] = true;
sieve[0] = sieve[1] = false;
for (int i = 2; i * i < SIEVE_SIZE; ++i)
if (sieve[i])
for (int j = 2; i * j < SIEVE_SIZE; ++j)
sieve[i * j] = false;
}
bool isprime(ll n) {
if (n == 0 || n == 1)
return false;
for (ll i = 2; i * i <= n; ++i)
if (n % i == 0)
return false;
return true;
}
const int MAX = 2000010;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
// 負の数にも対応した mod (a = -11 とかでも OK)
inline long long mod(long long a, long long m) { return (a % m + m) % m; }
// 逆元計算 (ここでは a と m が互いに素であることが必要)
long long modinv(long long a, long long m) {
long long x, y;
extGCD(a, m, x, y);
return mod(x, m); // 気持ち的には x % m だが、x が負かもしれないので
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
typedef vector<ll> vec;
typedef vector<vec> mat;
mat mul(mat &A, mat &B) {
mat C(A.size(), vec((int)B[0].size()));
for (int i = 0; i < A.size(); ++i) {
for (int k = 0; k < B.size(); ++k) {
for (int j = 0; j < B[0].size(); ++j) {
C[i][j] = (C[i][j] + A[i][k] * B[k][j] % MOD) % MOD;
}
}
}
return C;
}
mat matPow(mat A, ll n) {
mat B(A.size(), vec((int)A.size()));
for (int i = 0; i < A.size(); ++i) {
B[i][i] = 1;
}
while (n > 0) {
if (n & 1)
B = mul(B, A);
A = mul(A, A);
n >>= 1;
}
return B;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
using ld = long double;
template <typename T = int> struct BIT {
vector<T> node;
int N;
BIT(int n) {
N = n;
node.resize(N + 1);
}
void add(int i, T x) {
i++;
while (i <= N) {
node[i] += x;
i += (i & -i);
}
}
T sum(int i) {
T res = 0;
while (i > 0) {
res += node[i];
i -= (i & -i);
}
return res;
}
};
struct RollingHash {
using ull = unsigned long long;
const ull mod = (1UL << 61) - 1;
const ull MASK30 = (1UL << 30) - 1;
const ull MASK31 = (1UL << 31) - 1;
const ull MASK61 = mod;
ull base;
int n;
vector<ull> hash, pow;
RollingHash(string s) {
random_device rnd;
mt19937_64 mt(rnd());
base = calc_mod(mt()) % 100000 + 1000;
n = (int)s.size();
hash.assign(n + 1, 0);
pow.assign(n + 1, 1);
for (int i = 0; i < n; i++) {
hash[i + 1] = calc_mod(mul(hash[i], base) + s[i]);
pow[i + 1] = calc_mod(mul(pow[i], base));
}
}
ull calc_mod(ull x) {
ull xu = x >> 61;
ull xd = x & MASK61;
ull res = xu + xd;
if (res >= mod)
res -= mod;
return res;
}
ull mul(ull a, ull b) {
ull au = a >> 31;
ull ad = a & MASK31;
ull bu = b >> 31;
ull bd = b & MASK31;
ull mid = ad * bu + au * bd;
ull midu = mid >> 30;
ull midd = mid & MASK30;
return calc_mod(au * bu * 2 + midu + (midd << 31) + ad * bd);
}
//[l,r)のハッシュ値
inline ull get(int l, int r) {
ull res = calc_mod(hash[r] + mod * 4 - mul(hash[l], pow[r - l]));
return res;
}
// string tのハッシュ値
inline ull get(string t) {
ull res = 0;
for (int i = 0; i < t.size(); i++) {
res = calc_mod(mul(res, base) + t[i]);
}
return res;
}
// string s中のtの数をcount
inline int count(string t) {
if (t.size() > n)
return 0;
auto hs = get(t);
int res = 0;
for (int i = 0; i < n - t.size() + 1; i++) {
if (get(i, i + t.size()) == hs)
res++;
}
return res;
}
// LCPを求める S[a:] T[b:]
inline int LCP(int a, int b) {
int len = min((int)hash.size() - a, (int)hash.size() - b);
int lb = -1, ub = len + 1;
while (ub - lb > 1) {
int mid = (lb + ub) / 2;
if (get(a, a + mid) == get(b, b + mid))
lb = mid;
else
ub = mid;
}
return lb;
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(5);
int N;
string s;
cin >> N >> s;
RollingHash rh(s);
auto check = [&](int d) -> bool {
map<unsigned long long, unsigned long long> prev;
for (int i = 0; i + d <= N; i++) {
auto aba = rh.get(i, i + d);
if (prev.count(aba)) {
if (i - prev[aba] >= d)
return true;
} else
prev[aba] = i;
}
return false;
};
int lb = 0, ub = N / 2 + 1;
while (ub - lb > 1) {
int mid = (lb + ub) >> 1;
if (check(mid))
lb = mid;
else
ub = mid;
}
cout << lb << endl;
return 0;
}
| replace | 372 | 382 | 372 | 394 | TLE | |
p02913 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define REPO(i, n) for (ll i = 1; i <= n; i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(), n.end()
#define MOD (ll)1000000007
#define P pair<ll, ll>
ll n, dp[5000][5000];
string s;
int main() {
cin >> n >> s;
REP(i, n) {
REP(j, n) {
if (s[i] == s[j] and dp[i][j] + 1 <= j - i)
dp[i + 1][j + 1] = max(dp[i][j] + 1, dp[i + 1][j + 1]);
}
}
ll ans = 0;
REP(i, n + 1) {
REP(j, n + 1) { ans = max(ans, dp[i][j]); }
}
cout << ans << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define REPO(i, n) for (ll i = 1; i <= n; i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(), n.end()
#define MOD (ll)1000000007
#define P pair<ll, ll>
ll n, dp[5100][5100];
string s;
int main() {
cin >> n >> s;
REP(i, n) {
REP(j, n) {
if (s[i] == s[j] and dp[i][j] + 1 <= j - i)
dp[i + 1][j + 1] = max(dp[i][j] + 1, dp[i + 1][j + 1]);
}
}
ll ans = 0;
REP(i, n + 1) {
REP(j, n + 1) { ans = max(ans, dp[i][j]); }
}
cout << ans << endl;
}
| replace | 27 | 28 | 27 | 28 | -11 | |
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rrep(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rbegin(), (x).rend()
#define ITR(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
constexpr ll mod = 1e9 + 7;
constexpr double eps = 1e-9;
const double PI = acos(-1);
void solve();
P bisearch(ll l, ll r, function<bool(ll)> f) {
while ((l + 1) < r) {
ll m = (l + r) / 2;
if (f(m))
r = m;
else
l = m;
}
return P(l, r);
}
ll SQRT(ll n) {
if (n == 1)
return 1;
return bisearch(0, n, [n](ll x) { return x > n / x; }).first;
}
ll roundup(ll n, ll div) {
if (n > 0)
return (n - 1) / div + 1;
else
return n / div;
}
bool square(ll a) {
ll n = SQRT(a);
return a == n * n;
}
ll npow(ll x, ll n) {
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x;
x = x * x;
n = n >> 1;
}
return ans;
}
ll mpow(ll x,
ll n) { // x^n(mod) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
// 2分累乗法だから早い
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % mod;
x = x * x % mod;
n = n >> 1;
}
return ans;
}
ll inv_mod(ll a) { return mpow(a, mod - 2); }
int digitsum(ll N, int a) {
if (N == 0)
return 0;
int ret = 0;
ret += digitsum(N / a, a) + N % a;
return ret;
}
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }; // xとyの最大公約数
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; } // xとyの最小公倍数
void YN(bool flg) { std::cout << (flg ? "YES" : "NO") << endl; }
void Yn(bool flg) { std::cout << (flg ? "Yes" : "No") << endl; }
void yn(bool flg) { std::cout << (flg ? "yes" : "no") << endl; }
P splitint(string n, int a) {
int Len = n.length();
if (a < 0 || Len < a)
return {-1, -1};
string left, right;
if (a != 0)
left = n.substr(0, a);
if (a != Len)
right = n.substr(a);
return P(stoll(left), stoll(right));
}
ll manhattan(const P &a, const P &b) {
return llabs(a.first - b.first) + llabs(a.second - b.second);
}
bool kaibun(string s) { // O(|S|)
string sdash = s;
reverse(All(s));
return s == sdash;
}
class Ruiseki {
private:
vector<ll> LEFT, RIGHT;
function<ll(ll, ll)> F;
int N;
public:
Ruiseki(ll INI, const vector<ll> &a, function<ll(ll, ll)> f) {
N = a.size();
F = f;
LEFT.resize(N + 1);
RIGHT.resize(N + 1);
LEFT[0] = RIGHT[0] = INI;
REP(i, N) {
LEFT[i + 1] = F(LEFT[i], a[i]);
RIGHT[i + 1] = F(RIGHT[i], a[N - i - 1]);
}
}
ll out(int l, int r) { //[l,r)の外の累積
return F(LEFT[l], RIGHT[N - r]);
}
};
class mint {
private:
ll _num, _mod;
mint set(ll num) {
_num = num;
if (_num >= 0)
_num %= _mod;
else
_num += (1 - (_num + 1) / _mod) * _mod;
return *this;
}
ll _mpow(ll x,
ll n) { // x^n(mod) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
// 2分累乗法だから早い
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % _mod;
x = x * x % _mod;
n = n >> 1;
}
return ans;
}
ll imod(ll n) { return _mpow(n, _mod - 2); }
public:
mint() {
_num = 0;
_mod = mod;
}
mint(ll num) {
_mod = mod;
_num = (num + (1LL << 25) * mod) % mod;
}
mint(ll num, ll M) {
_mod = M;
_num = (num + (1LL << 25) * mod) % _mod;
}
mint(const mint &cp) {
_num = cp._num;
_mod = cp._mod;
}
mint operator=(const ll x) { return set(x); }
mint operator+(const ll x) { return mint(_num + (x % _mod), _mod); }
mint operator-(const ll x) { return mint(_num - (x % _mod), _mod); }
mint operator*(const ll x) { return mint(_num * (x % _mod), _mod); }
mint operator/(ll x) { return mint(_num * imod(x), _mod); }
mint operator+=(const ll x) { return set(_num + (x % _mod)); }
mint operator-=(const ll x) { return set(_num - (x % _mod)); }
mint operator*=(const ll x) { return set(_num * (x % _mod)); }
mint operator/=(ll x) { return set(_num * imod(x)); }
mint operator+(const mint &x) { return mint(_num + x._num, _mod); }
mint operator-(const mint &x) { return mint(_num - x._num, _mod); }
mint operator*(const mint &x) { return mint(_num * x._num, _mod); }
mint operator/(mint x) { return mint(_num * imod(x._num), _mod); }
mint operator+=(const mint &x) { return set(_num + x._num); }
mint operator-=(const mint &x) { return set(_num - x._num); }
mint operator*=(const mint &x) { return set(_num * x._num); }
mint operator/=(mint x) { return set(_num * imod(x._num)); }
bool operator<(const mint &x) const { return _num < x._num; }
bool operator==(const mint &x) const { return _num == x._num; }
bool operator>(const mint &x) const { return _num > x._num; }
friend mint operator+(ll x, const mint &m) {
return mint(m._num + (x % m._mod), m._mod);
}
friend mint operator-(ll x, const mint &m) {
return mint((x % m._mod) - m._num, m._mod);
}
friend mint operator*(ll x, const mint &m) {
return mint(m._num * (x % m._mod), m._mod);
}
friend mint operator/(ll x, mint m) {
return mint(m.imod(m._num) * x, m._mod);
}
explicit operator ll() { return _num; }
explicit operator int() { return (int)_num; }
friend ostream &operator<<(ostream &os, const mint &x) {
os << x._num;
return os;
}
friend istream &operator>>(istream &is, mint &x) {
ll val;
is >> val;
x.set(val);
return is;
}
};
template <typename T> class MAT {
private:
int row, col;
vector<vector<T>> _A;
MAT set(vector<vector<T>> A) {
_A = A;
return *this;
}
public:
MAT() {}
MAT(int n, int m) {
if (n < 1 || m < 0) {
cout << "err Matrix::Matrix" << endl;
exit(1);
}
row = n;
col = m ? m : n; // m=0のとき単位行列を作る
REP(i, row) {
vector<T> a(col, 0.0);
_A.push_back(a);
}
// 値の初期化
if (m == 0)
REP(i, n) _A[i][i] = 1.0;
}
MAT(const MAT &cp) {
_A = cp._A;
row = cp.row;
col = cp.col;
}
T *operator[](int i) { return _A[i].data(); }
MAT operator=(vector<vector<T>> x) { return set(x); }
MAT operator+(MAT x) {
if (row != x.row || col != x.col) {
cout << "err Matrix::operator+" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] + x[i][j];
return r;
}
MAT operator-(MAT x) {
if (row != x.row || col != x.col) {
cout << "err Matrix::operator-" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] - x[i][j];
return r;
}
MAT operator*(MAT x) {
if (col != x.row) {
cout << "err Matrix::operator*" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, x.col);
REP(i, row) REP(j, x.col) REP(k, col) r[i][j] += _A[i][k] * x[k][j];
return r;
}
MAT operator/(T a) {
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] / a;
return r;
}
MAT operator^(ll n) {
if (row != col) {
cout << "err Matrix::operator^" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, 0), A = *this;
while (n) {
if (n & 1)
r *= A;
A *= A;
n >>= 1;
}
return r;
}
MAT operator+=(MAT x) {
if (row != x.row || col != x.col) {
cout << "err Matrix::operator+=" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] + x[i][j];
return set(r._A);
}
MAT operator-=(MAT x) {
if (row != x.row || col != x.col) {
cout << "err Matrix::operator-=" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] - x[i][j];
return set(r._A);
}
MAT operator*=(MAT x) {
if (col != x.row) {
cout << "err Matrix::operator*" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, x.col);
REP(i, row) REP(j, x.col) REP(k, col) r[i][j] += _A[i][k] * x[k][j];
return set(r._A);
}
MAT operator/=(T a) {
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] / a;
return r;
}
friend MAT operator*(T n, MAT x) {
MAT r(x.row, x.col);
REP(i, x.row) REP(j, x.col) r[i][j] = n * x[i][j];
return r;
}
friend MAT operator*(MAT x, T n) {
MAT r(x.row, x.col);
REP(i, x.row) REP(j, x.col) r[i][j] = n * x[i][j];
return r;
}
explicit operator vector<vector<T>>() { return _A; }
friend ostream &operator<<(ostream &os, const MAT &x) {
REP(i, x.row) REP(j, x.col) os << x._A[i][j] << " \n"[j == x.col - 1];
return os;
}
friend istream &operator>>(istream &is, MAT &x) {
REP(i, x.row) REP(j, x.col) is >> x._A[i][j];
return is;
}
int size_row() { return row; }
int size_col() { return col; }
MAT transpose() {
MAT r(col, row);
REP(i, col) REP(j, row) r[i][j] = _A[j][i];
return r;
}
MAT inverse() {
T buf;
MAT<T> inv_a(row, 0);
vector<vector<T>> a = _A;
// 掃き出し法
REP(i, row) {
buf = 1 / a[i][i];
REP(j, row) {
a[i][j] *= buf;
inv_a[i][j] *= buf;
}
REP(j, row) {
if (i != j) {
buf = a[j][i];
REP(k, row) {
a[j][k] -= a[i][k] * buf;
inv_a[j][k] -= inv_a[i][k] * buf;
}
}
}
}
return inv_a;
}
// O( n^3 ).
int rank() {
vector<vector<T>> A = _A;
const int n = row, m = col;
int r = 0;
for (int i = 0; r < n && i < m; ++i) {
int pivot = r;
for (int j = r + 1; j < n; ++j)
if (fabs(A[j][i]) > fabs(A[pivot][i]))
pivot = j;
swap(A[pivot], A[r]);
if (fabs(A[r][i]) < eps)
continue;
for (int k = m - 1; k >= i; --k)
A[r][k] /= A[r][i];
rep(j, r + 1, n) rep(k, i, m) A[j][k] -= A[r][k] * A[j][i];
++r;
}
return r;
}
};
class UnionFind { // UnionFind木
private:
vector<int> Parent, es;
vector<ll> diff_weight;
public:
UnionFind(int N) {
es.resize(N, 0);
Parent.resize(N, -1);
diff_weight.resize(N, 0LL);
}
int root(int A) {
if (Parent[A] < 0)
return A;
else {
int r = root(Parent[A]);
diff_weight[A] += diff_weight[Parent[A]]; // 累積和をとる
return Parent[A] = r;
}
}
bool issame(int A, int B) { return root(A) == root(B); }
ll weight(int x) {
root(x); // 経路圧縮
return diff_weight[x];
}
ll diff(int x, int y) { return weight(y) - weight(x); }
int size(int A) { return -Parent[root(A)]; }
int eize(int A) { return es[root(A)]; }
bool connect(int A, int B) {
A = root(A);
B = root(B);
if (A == B)
return false;
if (size(A) < size(B))
swap(A, B);
Parent[A] += Parent[B];
es[A] += es[B] + 1;
Parent[B] = A;
return true;
}
void unite(int A, int B) {
A = root(A);
B = root(B);
if (A == B) {
es[A]++;
return;
}
if (size(A) < size(B))
swap(A, B);
Parent[A] += Parent[B];
es[A] += es[B] + 1;
Parent[B] = A;
return;
}
bool merge(int A, int B, ll w) {
// x と y それぞれについて、 root との重み差分を補正
w += weight(A);
w -= weight(B);
A = root(A);
B = root(B);
if (A == B)
return false;
if (size(A) < size(B))
swap(A, B), w = -w;
Parent[A] += Parent[B];
Parent[B] = A;
// x が y の親になるので、x と y の差分を diff_weight[y] に記録
diff_weight[B] = w;
return true;
}
};
class Factorial { // 階乗とその逆元を求めて計算に利用するクラス
private:
vector<ll> fac;
vector<ll> ifac;
public:
Factorial(ll N) {
fac.push_back(1);
REP(i, N) fac.push_back(fac[i] * (i + 1) % mod);
ifac.resize(N + 1);
ifac[N] = inv_mod(fac[N]);
REP(i, N) ifac[N - 1 - i] = (ifac[N - i] * (N - i)) % mod;
}
ll fact(ll a) { return fac[a]; }
ll ifact(ll a) { return ifac[a]; }
ll cmb(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0 || b < 0)
return 0;
ll tmp = ifact(a - b) * ifact(b) % mod;
return tmp * fac[a] % mod;
}
ll per(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0 || b < 0)
return 0;
return fac[a] * ifac[a - b] % mod;
}
};
class SOSU {
private:
vector<int> Prime_Number;
vector<bool> isp;
public:
SOSU(int N) {
isp.resize(N + 1, true);
isp[0] = isp[1] = false;
rep(i, 2, N + 1) if (isp[i]) {
Prime_Number.push_back(i);
for (int j = 2 * i; j <= N; j += i)
isp[j] = false;
}
}
int operator[](int i) { return Prime_Number[i]; }
int size() { return Prime_Number.size(); }
int back() { return Prime_Number.back(); }
bool isPrime(int q) { return isp[q]; }
};
class
Divisor { // 素因数分解をしてから約数列挙、分解結果はＰ(底,指数)でpfacにまとめている
private:
vector<ll> F;
vector<P> pfactorize;
public:
Divisor(ll N) {
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
F.push_back(i);
if (i * i != N)
F.push_back(N / i);
}
}
sort(begin(F), end(F));
SOSU p(SQRT(N) + 1);
REP(i, p.size()) {
pfactorize.push_back(P(p[i], 0));
while (N % p[i] == 0) {
N /= p[i];
pfactorize.back().second++;
}
if (pfactorize.size() == 0)
pfactorize.pop_back();
}
if (N > 1)
pfactorize.push_back(P(N, 1));
}
int size() { return F.size(); }
vector<P> pfac() { return pfactorize; }
ll operator[](int k) { return F[k]; }
};
struct Solutions {
ll napsack(int kinds, int MAX_W, const vl &weight, const vl &cost) {
vector<vector<ll>> dp(kinds + 1, vector<ll>(MAX_W + 1, 0));
REP(i, kinds) REP(j, MAX_W + 1) {
if (j < weight[i])
dp[i + 1][j] = dp[i][j];
else
dp[i + 1][j] = max(dp[i][j], dp[i][j - weight[i]] + cost[i]);
}
return dp[kinds][MAX_W];
}
ll cost_based_napsack(int kinds, int MAX_W, const vl &weight,
const vl &cost) {
int MAX_V = 0;
REP(i, kinds) MAX_V = max(MAX_V, (int)cost[i]);
vvl dp(kinds + 1, vl(kinds * MAX_V + 1, 1LL << 58));
dp[0][0] = 0;
REP(i, kinds) REP(j, kinds * MAX_V + 1) {
if (j < cost[i])
dp[i + 1][j] = dp[i][j];
else
dp[i + 1][j] = min(dp[i][j], dp[i][j - cost[i]] + weight[i]);
}
int res = 0;
REP(i, kinds * MAX_V + 1) if (dp[kinds][i] <= MAX_W) res = i;
return res;
}
ll unlimited_napsack(int kinds, int MAX_W, const vl &weight, const vl &cost) {
vector<vector<ll>> dp(kinds + 1, vector<ll>(MAX_W + 1, 0));
REP(i, kinds) REP(j, MAX_W + 1) {
if (j < weight[i])
dp[i + 1][j] = dp[i][j];
else
dp[i + 1][j] = max(dp[i][j], dp[i + 1][j - weight[i]] + cost[i]);
}
return dp[kinds][MAX_W];
}
ll huge_napsack(int kinds, ll MAX_W, const vl &weight, const vl &cost) {
int n2 = kinds / 2;
vector<P> ps(1 << (kinds / 2));
REP(i, 1 << n2) {
ll sw = 0, sv = 0;
REP(j, n2) {
if (i >> j & 1) {
sw += weight[j];
sv += cost[j];
}
}
ps[i] = P(sw, sv);
}
sort(ps.begin(), ps.begin() + (1 << n2));
int m = 1;
rep(i, 1, 1 << n2) {
if (ps[m - 1].second < ps[i].second)
ps[m++] = ps[i];
}
ll res = 0;
REP(i, 1 << (kinds - n2)) {
ll sw = 0, sv = 0;
REP(j, kinds - n2) {
if ((i >> j) & 1) {
sw += weight[n2 + j];
sv += cost[n2 + j];
}
}
if (sw <= MAX_W) {
ll tv =
(lower_bound(ps.begin(), ps.begin() + m, P(MAX_W - sw, LLONG_MAX)) -
1)
->second;
res = max(res, sv + tv);
}
}
return res;
}
ll choose_MonN(int N, int M, const vl &cost) {
vvl dp(N + 1, vl(M + 1, -1LL << 58));
REP(i, N + 1) dp[i][0] = 0;
REP(i, N) REP(j, M) {
if (j > i)
break;
dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i][j] + cost[i]);
}
return dp[N][M];
}
ll Partition_Func(int n, int k) {
vector<vector<ll>> dp(k + 1, vector<ll>(n + 1, 0));
dp[0][0] = 1;
rep(i, 1, k + 1) REP(j, n + 1) {
if (j - i >= 0)
dp[i][j] = (dp[i][j - i] + dp[i - 1][j]);
else
dp[i][j] = dp[i - 1][j];
}
return dp[k][n];
}
int LCS(string s, string t) {
int n = s.length(), m = s.length();
vector<vector<int>> dp(n + 1, vector<int>(m + 1));
REP(i, n) REP(j, m) {
if (s[i] == t[j])
dp[i + 1][j + 1] = dp[i][j] + 1;
else
dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);
}
return dp[n][m];
}
int LIS(const vector<ll> a) {
int n = a.size();
ll INF = 1LL << 50;
vector<ll> dp(n + 1, INF);
REP(i, n) * lower_bound(All(dp), a[i]) = a[i];
int k = lower_bound(All(dp), INF) - dp.begin();
return k;
}
int max_flow(int s, int t, const vector<vector<P>> &g) {
struct edge_ {
int to, cap, rev;
};
vector<bool> used(g.size(), false);
vector<vector<edge_>> G(g.size());
REP(i, g.size()) REP(j, g[i].size()) {
int from = i, to = g[i][j].second;
int cap = g[i][j].first;
G[from].push_back((edge_){to, cap, (int)G[to].size()});
G[to].push_back((edge_){from, 0, (int)G[from].size() - 1});
}
auto dfs = [&](auto &&f, int v, int t, int fl) -> int {
if (v == t)
return fl;
used[v] = true;
REP(i, G[v].size()) {
edge_ &e = G[v][i];
if (!used[e.to] && e.cap > 0) {
int d = f(f, e.to, t, min(fl, e.cap));
if (d > 0) {
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
};
int flow = 0;
while (1) {
used.assign(used.size(), false);
int f = dfs(dfs, s, t, INT_MAX);
if (f == 0)
return flow;
flow += f;
}
}
int bipartite_matching_calculate(const Graph &g) {
int V = g.size();
vi match(V, -1);
vector<bool> used(V, false);
auto dfs = [&](auto &&f, int v) -> bool {
used[v] = true;
REP(i, g[v].size()) {
int u = g[v][i], w = match[u];
if (w < 0 || !used[w] && f(f, w)) {
match[v] = u;
match[u] = v;
return true;
}
}
return false;
};
int res = 0;
REP(v, V) {
if (match[v] < 0) {
used.assign(V, false);
if (dfs(dfs, v))
res++;
}
}
return res;
}
int bipartite_matching(int l, int r, function<bool(int, int)> F) {
int V = l + r;
Graph G(V);
REP(i, l) REP(j, r) if (F(i, j)) {
G[i].push_back(l + j);
G[l + j].push_back(i);
}
return bipartite_matching_calculate(G);
}
};
struct compress {
map<ll, int> zip;
vector<ll> unzip;
compress(vector<ll> x) {
unzip = x;
sort(All(x));
x.erase(unique(All(x)), x.end());
REP(i, x.size()) { zip[x[i]] = i; }
}
int operator[](int k) { return zip[unzip[k]]; }
};
struct edge {
int from;
int to;
ll cost;
void push(int a, int b, int c) {
from = a;
to = b;
cost = c;
}
bool operator<(const edge &y) const {
if (cost != y.cost)
return cost < y.cost;
else if (to != y.to)
return to < y.to;
else
return from < y.from;
}
bool operator>(const edge &y) const {
if (cost != y.cost)
return cost > y.cost;
else if (to != y.to)
return to > y.to;
else
return from > y.from;
}
bool operator==(const edge &y) const { return *this == y; }
};
class lca {
public:
const int n = 0;
const int log2_n = 0;
std::vector<std::vector<int>> parent;
std::vector<int> depth;
lca() {}
lca(const Graph &g, int root)
: n(g.size()), log2_n(log2(n) + 1), parent(log2_n, std::vector<int>(n)),
depth(n) {
dfs(g, root, -1, 0);
for (int k = 0; k + 1 < log2_n; k++) {
for (int v = 0; v < (int)g.size(); v++) {
if (parent[k][v] < 0)
parent[k + 1][v] = -1;
else
parent[k + 1][v] = parent[k][parent[k][v]];
}
}
}
void dfs(const Graph &g, int v, int p, int d) {
parent[0][v] = p;
depth[v] = d;
REP(j, g[v].size()) {
if (g[v][j] != p)
dfs(g, g[v][j], v, d + 1);
}
}
int get(int u, int v) {
if (depth[u] > depth[v])
std::swap(u, v);
for (int k = 0; k < log2_n; k++) {
if ((depth[v] - depth[u]) >> k & 1) {
v = parent[k][v];
}
}
if (u == v)
return u;
for (int k = log2_n - 1; k >= 0; k--) {
if (parent[k][u] != parent[k][v]) {
u = parent[k][u];
v = parent[k][v];
}
}
return parent[0][u];
}
};
template <typename T, typename E> // SegmentTree((要素数) int n_,(演算) F
// f,(更新) G g,(初期値) T d1)
struct SegmentTree {
typedef function<T(T, T)> F;
typedef function<T(T, E)> G;
int n;
F f;
G g;
T d1;
E d0;
vector<T> dat;
SegmentTree(){};
SegmentTree(int n_, F f, G g, T d1, vector<T> v = vector<T>())
: f(f), g(g), d1(d1) {
init(n_);
if (n_ == (int)v.size())
build(n_, v);
}
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
dat.clear();
dat.resize(2 * n - 1, d1);
}
void build(int n_, vector<T> v) {
for (int i = 0; i < n_; i++)
dat[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
dat[i] = f(dat[i * 2 + 1], dat[i * 2 + 2]);
}
void update(int k, E a) {
k += n - 1;
dat[k] = g(dat[k], a);
while (k > 0) {
k = (k - 1) / 2;
dat[k] = f(dat[k * 2 + 1], dat[k * 2 + 2]);
}
}
inline T query(int a, int b) {
T vl = d1, vr = d1;
for (int l = a + n, r = b + n; l < r; l >>= 1, r >>= 1) {
if (l & 1)
vl = f(vl, dat[(l++) - 1]);
if (r & 1)
vr = f(dat[(--r) - 1], vr);
}
return f(vl, vr);
}
};
struct GP {
double x, y;
GP(double X = 0, double Y = 0) : x(X), y(Y) {}
GP(const GP &cp) {
x = cp.x;
y = cp.y;
}
GP &set(double X, double Y) {
x = X;
y = Y;
return *this;
}
GP &operator=(const GP &p) { return set(p.x, p.y); }
GP operator+(const GP &p) const { return GP(x + p.x, y + p.y); }
GP operator-(const GP &p) const { return GP(x - p.x, y - p.y); }
GP operator*(double s) const { return GP(x * s, y * s); }
GP operator/(double s) const { return GP(x / s, y / s); }
friend GP operator*(double s, const GP &r) { return GP(r.x * s, r.y * s); }
friend GP operator/(double s, const GP &r) { return GP(r.x / s, r.y / s); }
double operator*(GP p) const { return dot(p); }
double operator^(GP p) const { return cross(p); }
GP &operator+=(const GP &p) { return set(x + p.x, y + p.y); }
GP &operator-=(const GP &p) { return set(x - p.x, y - p.y); }
GP &operator*=(double s) { return set(x * s, y * s); }
GP &operator/=(double s) { return set(x / s, y / s); }
double dot(const GP &p) const { return x * p.x + y * p.y; }
double cross(const GP &p) const { return x * p.y - p.x * y; }
int ort() const {
if (fabs(x) < eps && fabs(y) < eps)
return 0;
if (y > 0)
return (x > 0) ? 1 : 2;
else
return (x <= 0) ? 3 : 4;
}
bool operator<(const GP &p) const {
int o = ort(), po = p.ort();
if (o != po)
return o < po;
else {
double cr = cross(p);
if (cr == 0) {
double d = norm(), pd = p.norm();
return d < pd;
}
return cr > 0;
}
}
friend istream &operator>>(istream &is, GP &x) {
double valX, valY;
is >> valX >> valY;
x.set(valX, valY);
return is;
}
friend ostream &operator<<(ostream &os, const GP &v) {
os << v.x << " " << v.y << endl;
return os;
}
double norm2() const { return x * x + y * y; }
double norm() const { return sqrt(norm2()); }
double rad() const {
if (x == 0) {
if (y > 0)
return PI / 2.0;
if (y == 0)
return -1.0;
if (y < 0)
return -PI / 2.0;
} else {
if (y == 0) {
if (x < 0)
return PI;
if (x > 0)
return 0.0;
} else
return atan2(y, x);
}
}
void rotate(double theta) {
double X = x, Y = y;
x = cos(theta) * X - sin(theta) * Y;
y = sin(theta) * X + cos(theta) * Y;
}
};
struct Line {
GP A, B;
Line(GP p1 = GP(0, 0), GP p2 = GP(1, 1)) : A(p1), B(p2) {}
double len() const { return (B - A).norm(); }
GP shortest_point(const GP &x) const {
double a = B.x - A.x, b = B.y - A.y;
double t = -(a * (A.x - x.x) + b * (A.y - x.y)) / (a * a + b * b);
return GP(a * t + A.x, b * t + A.y);
}
double dist(const GP &x) const { return (x - shortest_point(x)).norm(); }
bool online(const GP &x) const {
return ((B - A) ^ (x - A)) == 0 && (x - A).norm() <= len() &&
(x - B).norm() <= len();
}
friend istream &operator>>(istream &is, Line &x) {
GP X, Y;
is >> X >> Y;
x.A = X;
x.B = Y;
return is;
}
friend ostream &operator<<(ostream &os, const Line &x) {
os << x.A << x.B;
return os;
}
};
struct Triangle {
GP a, b, c;
Triangle(GP p1 = GP(0, 0), GP p2 = GP(1, 0), GP p3 = (0, 1))
: a(p1), b(p2), c(p3) {}
double A() const {
double res = fabs((b - a).rad() - (c - a).rad());
if (res >= PI)
res -= PI;
return res;
}
double B() const {
double res = fabs((a - b).rad() - (c - b).rad());
if (res >= PI)
res -= PI;
return res;
}
double C() const {
double res = fabs((a - c).rad() - (b - c).rad());
if (res >= PI)
res -= PI;
return res;
}
Line AB() const { return Line(a, b); }
Line BC() const { return Line(b, c); }
Line CA() const { return Line(c, a); }
GP G() const { return (a + b + c) / 3; }
GP O() const {
return (sin(2 * A()) * a + sin(2 * B()) * b + sin(2 * C()) * c) /
(sin(2 * A()) + sin(2 * B()) + sin(2 * C()));
}
double R() const { return a.norm() / (2 * sin(A())); }
GP I() const {
return (a.norm() * a + b.norm() * b + c.norm() * c) /
(a.norm() + b.norm() + c.norm());
}
double r() const {
return 2 * area() / ((a - b).norm() + (b - c).norm() + (c - a).norm());
}
GP H() const {
return (tan(A()) * a + tan(B()) * b + tan(C()) * c) /
(tan(A()) + tan(B()) + tan(C()));
}
double AH() const { return 2 * R() * cos(A()); }
double BH() const { return 2 * R() * cos(B()); }
double CH() const { return 2 * R() * cos(C()); }
double area() const { return ((b - a) ^ (c - a)) / 2; }
bool inside(const GP &x) const {
return ((b - a) ^ (x - a)) * ((c - a) ^ (x - a)) < 0 &&
((a - b) ^ (x - b)) * ((c - b) ^ (x - b)) < 0 &&
((a - c) ^ (x - c)) * ((b - c) ^ (x - c)) < 0;
}
bool online(const GP &x) const {
return AB().online(x) || BC().online(x) || CA().online(x);
}
bool outside(const GP &x) const { return (!inside(x) && !online(x)); }
friend istream &operator>>(istream &is, Triangle &x) {
GP X, Y, Z;
is >> X >> Y >> Z;
x.a = X;
x.b = Y;
x.c = Z;
return is;
}
friend ostream &operator<<(ostream &os, const Triangle &v) {
os << v.a << v.b;
return os;
}
};
struct rational {
ll p, q;
void normalize() { // keep q positive
if (q < 0)
p *= -1, q *= -1;
ll d = gcd(p < 0 ? -p : p, q);
if (d == 0)
p = 0, q = 1;
else
p /= d, q /= d;
}
rational(ll p, ll q = 1) : p(p), q(q) { normalize(); }
rational &operator+=(const rational &a) {
p = a.q * p + a.p * q;
q = a.q * q;
normalize();
return *this;
}
rational &operator-=(const rational &a) {
p = a.q * p - a.p * q;
q = a.q * q;
normalize();
return *this;
}
rational &operator*=(const rational &a) {
p *= a.p;
q *= a.q;
normalize();
return *this;
}
rational &operator/=(const rational &a) {
p *= a.q;
q *= a.p;
normalize();
return *this;
}
rational &operator-() {
p *= -1;
return *this;
}
friend rational operator+(const rational &a, const rational &b) {
return rational(a) += b;
}
friend rational operator*(const rational &a, const rational &b) {
return rational(a) *= b;
}
friend rational operator-(const rational &a, const rational &b) {
return rational(a) -= b;
}
friend rational operator/(const rational &a, const rational &b) {
return rational(a) /= b;
}
friend bool operator<(const rational &a,
const rational &b) { // avoid overflow
return (long double)a.p * b.q < (long double)a.q * b.p;
}
friend bool operator<=(const rational &a, const rational &b) {
return !(b < a);
}
friend bool operator>(const rational &a, const rational &b) { return b < a; }
friend bool operator>=(const rational &a, const rational &b) {
return !(a < b);
}
friend bool operator==(const rational &a, const rational &b) {
return !(a < b) && !(b < a);
}
friend bool operator!=(const rational &a, const rational &b) {
return (a < b) || (b < a);
}
friend ostream &operator<<(ostream &os, const rational &x) {
printf("%.16f", (double)x.p / (double)x.q);
return os;
}
friend istream &operator>>(istream &is, rational &x) {
is >> x.p >> x.q;
x.normalize();
return is;
}
};
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
solve();
return 0;
}
void solve() {
int N;
cin >> N;
string S;
cin >> S;
int l = 0, r = N;
while (l + 1 < r) {
int m = (l + r) / 2;
bool ok = false;
REP(i, N - m) rep(j, i + m, N - m + 1) {
if (S.substr(i, m) == S.substr(j, m))
ok = true;
}
if (ok)
l = m;
else
r = m;
}
cout << l << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rrep(i, a, b) for (int i = int(a) - 1; i >= int(b); --i)
#define All(x) (x).begin(), (x).end()
#define rAll(x) (x).rbegin(), (x).rend()
#define ITR(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
constexpr ll mod = 1e9 + 7;
constexpr double eps = 1e-9;
const double PI = acos(-1);
void solve();
P bisearch(ll l, ll r, function<bool(ll)> f) {
while ((l + 1) < r) {
ll m = (l + r) / 2;
if (f(m))
r = m;
else
l = m;
}
return P(l, r);
}
ll SQRT(ll n) {
if (n == 1)
return 1;
return bisearch(0, n, [n](ll x) { return x > n / x; }).first;
}
ll roundup(ll n, ll div) {
if (n > 0)
return (n - 1) / div + 1;
else
return n / div;
}
bool square(ll a) {
ll n = SQRT(a);
return a == n * n;
}
ll npow(ll x, ll n) {
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x;
x = x * x;
n = n >> 1;
}
return ans;
}
ll mpow(ll x,
ll n) { // x^n(mod) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
// 2分累乗法だから早い
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % mod;
x = x * x % mod;
n = n >> 1;
}
return ans;
}
ll inv_mod(ll a) { return mpow(a, mod - 2); }
int digitsum(ll N, int a) {
if (N == 0)
return 0;
int ret = 0;
ret += digitsum(N / a, a) + N % a;
return ret;
}
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }; // xとyの最大公約数
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; } // xとyの最小公倍数
void YN(bool flg) { std::cout << (flg ? "YES" : "NO") << endl; }
void Yn(bool flg) { std::cout << (flg ? "Yes" : "No") << endl; }
void yn(bool flg) { std::cout << (flg ? "yes" : "no") << endl; }
P splitint(string n, int a) {
int Len = n.length();
if (a < 0 || Len < a)
return {-1, -1};
string left, right;
if (a != 0)
left = n.substr(0, a);
if (a != Len)
right = n.substr(a);
return P(stoll(left), stoll(right));
}
ll manhattan(const P &a, const P &b) {
return llabs(a.first - b.first) + llabs(a.second - b.second);
}
bool kaibun(string s) { // O(|S|)
string sdash = s;
reverse(All(s));
return s == sdash;
}
class Ruiseki {
private:
vector<ll> LEFT, RIGHT;
function<ll(ll, ll)> F;
int N;
public:
Ruiseki(ll INI, const vector<ll> &a, function<ll(ll, ll)> f) {
N = a.size();
F = f;
LEFT.resize(N + 1);
RIGHT.resize(N + 1);
LEFT[0] = RIGHT[0] = INI;
REP(i, N) {
LEFT[i + 1] = F(LEFT[i], a[i]);
RIGHT[i + 1] = F(RIGHT[i], a[N - i - 1]);
}
}
ll out(int l, int r) { //[l,r)の外の累積
return F(LEFT[l], RIGHT[N - r]);
}
};
class mint {
private:
ll _num, _mod;
mint set(ll num) {
_num = num;
if (_num >= 0)
_num %= _mod;
else
_num += (1 - (_num + 1) / _mod) * _mod;
return *this;
}
ll _mpow(ll x,
ll n) { // x^n(mod) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
// 2分累乗法だから早い
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % _mod;
x = x * x % _mod;
n = n >> 1;
}
return ans;
}
ll imod(ll n) { return _mpow(n, _mod - 2); }
public:
mint() {
_num = 0;
_mod = mod;
}
mint(ll num) {
_mod = mod;
_num = (num + (1LL << 25) * mod) % mod;
}
mint(ll num, ll M) {
_mod = M;
_num = (num + (1LL << 25) * mod) % _mod;
}
mint(const mint &cp) {
_num = cp._num;
_mod = cp._mod;
}
mint operator=(const ll x) { return set(x); }
mint operator+(const ll x) { return mint(_num + (x % _mod), _mod); }
mint operator-(const ll x) { return mint(_num - (x % _mod), _mod); }
mint operator*(const ll x) { return mint(_num * (x % _mod), _mod); }
mint operator/(ll x) { return mint(_num * imod(x), _mod); }
mint operator+=(const ll x) { return set(_num + (x % _mod)); }
mint operator-=(const ll x) { return set(_num - (x % _mod)); }
mint operator*=(const ll x) { return set(_num * (x % _mod)); }
mint operator/=(ll x) { return set(_num * imod(x)); }
mint operator+(const mint &x) { return mint(_num + x._num, _mod); }
mint operator-(const mint &x) { return mint(_num - x._num, _mod); }
mint operator*(const mint &x) { return mint(_num * x._num, _mod); }
mint operator/(mint x) { return mint(_num * imod(x._num), _mod); }
mint operator+=(const mint &x) { return set(_num + x._num); }
mint operator-=(const mint &x) { return set(_num - x._num); }
mint operator*=(const mint &x) { return set(_num * x._num); }
mint operator/=(mint x) { return set(_num * imod(x._num)); }
bool operator<(const mint &x) const { return _num < x._num; }
bool operator==(const mint &x) const { return _num == x._num; }
bool operator>(const mint &x) const { return _num > x._num; }
friend mint operator+(ll x, const mint &m) {
return mint(m._num + (x % m._mod), m._mod);
}
friend mint operator-(ll x, const mint &m) {
return mint((x % m._mod) - m._num, m._mod);
}
friend mint operator*(ll x, const mint &m) {
return mint(m._num * (x % m._mod), m._mod);
}
friend mint operator/(ll x, mint m) {
return mint(m.imod(m._num) * x, m._mod);
}
explicit operator ll() { return _num; }
explicit operator int() { return (int)_num; }
friend ostream &operator<<(ostream &os, const mint &x) {
os << x._num;
return os;
}
friend istream &operator>>(istream &is, mint &x) {
ll val;
is >> val;
x.set(val);
return is;
}
};
template <typename T> class MAT {
private:
int row, col;
vector<vector<T>> _A;
MAT set(vector<vector<T>> A) {
_A = A;
return *this;
}
public:
MAT() {}
MAT(int n, int m) {
if (n < 1 || m < 0) {
cout << "err Matrix::Matrix" << endl;
exit(1);
}
row = n;
col = m ? m : n; // m=0のとき単位行列を作る
REP(i, row) {
vector<T> a(col, 0.0);
_A.push_back(a);
}
// 値の初期化
if (m == 0)
REP(i, n) _A[i][i] = 1.0;
}
MAT(const MAT &cp) {
_A = cp._A;
row = cp.row;
col = cp.col;
}
T *operator[](int i) { return _A[i].data(); }
MAT operator=(vector<vector<T>> x) { return set(x); }
MAT operator+(MAT x) {
if (row != x.row || col != x.col) {
cout << "err Matrix::operator+" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] + x[i][j];
return r;
}
MAT operator-(MAT x) {
if (row != x.row || col != x.col) {
cout << "err Matrix::operator-" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] - x[i][j];
return r;
}
MAT operator*(MAT x) {
if (col != x.row) {
cout << "err Matrix::operator*" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, x.col);
REP(i, row) REP(j, x.col) REP(k, col) r[i][j] += _A[i][k] * x[k][j];
return r;
}
MAT operator/(T a) {
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] / a;
return r;
}
MAT operator^(ll n) {
if (row != col) {
cout << "err Matrix::operator^" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, 0), A = *this;
while (n) {
if (n & 1)
r *= A;
A *= A;
n >>= 1;
}
return r;
}
MAT operator+=(MAT x) {
if (row != x.row || col != x.col) {
cout << "err Matrix::operator+=" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] + x[i][j];
return set(r._A);
}
MAT operator-=(MAT x) {
if (row != x.row || col != x.col) {
cout << "err Matrix::operator-=" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] - x[i][j];
return set(r._A);
}
MAT operator*=(MAT x) {
if (col != x.row) {
cout << "err Matrix::operator*" << endl;
cout << " not equal matrix size" << endl;
exit(0);
}
MAT r(row, x.col);
REP(i, row) REP(j, x.col) REP(k, col) r[i][j] += _A[i][k] * x[k][j];
return set(r._A);
}
MAT operator/=(T a) {
MAT r(row, col);
REP(i, row) REP(j, col) r[i][j] = _A[i][j] / a;
return r;
}
friend MAT operator*(T n, MAT x) {
MAT r(x.row, x.col);
REP(i, x.row) REP(j, x.col) r[i][j] = n * x[i][j];
return r;
}
friend MAT operator*(MAT x, T n) {
MAT r(x.row, x.col);
REP(i, x.row) REP(j, x.col) r[i][j] = n * x[i][j];
return r;
}
explicit operator vector<vector<T>>() { return _A; }
friend ostream &operator<<(ostream &os, const MAT &x) {
REP(i, x.row) REP(j, x.col) os << x._A[i][j] << " \n"[j == x.col - 1];
return os;
}
friend istream &operator>>(istream &is, MAT &x) {
REP(i, x.row) REP(j, x.col) is >> x._A[i][j];
return is;
}
int size_row() { return row; }
int size_col() { return col; }
MAT transpose() {
MAT r(col, row);
REP(i, col) REP(j, row) r[i][j] = _A[j][i];
return r;
}
MAT inverse() {
T buf;
MAT<T> inv_a(row, 0);
vector<vector<T>> a = _A;
// 掃き出し法
REP(i, row) {
buf = 1 / a[i][i];
REP(j, row) {
a[i][j] *= buf;
inv_a[i][j] *= buf;
}
REP(j, row) {
if (i != j) {
buf = a[j][i];
REP(k, row) {
a[j][k] -= a[i][k] * buf;
inv_a[j][k] -= inv_a[i][k] * buf;
}
}
}
}
return inv_a;
}
// O( n^3 ).
int rank() {
vector<vector<T>> A = _A;
const int n = row, m = col;
int r = 0;
for (int i = 0; r < n && i < m; ++i) {
int pivot = r;
for (int j = r + 1; j < n; ++j)
if (fabs(A[j][i]) > fabs(A[pivot][i]))
pivot = j;
swap(A[pivot], A[r]);
if (fabs(A[r][i]) < eps)
continue;
for (int k = m - 1; k >= i; --k)
A[r][k] /= A[r][i];
rep(j, r + 1, n) rep(k, i, m) A[j][k] -= A[r][k] * A[j][i];
++r;
}
return r;
}
};
class UnionFind { // UnionFind木
private:
vector<int> Parent, es;
vector<ll> diff_weight;
public:
UnionFind(int N) {
es.resize(N, 0);
Parent.resize(N, -1);
diff_weight.resize(N, 0LL);
}
int root(int A) {
if (Parent[A] < 0)
return A;
else {
int r = root(Parent[A]);
diff_weight[A] += diff_weight[Parent[A]]; // 累積和をとる
return Parent[A] = r;
}
}
bool issame(int A, int B) { return root(A) == root(B); }
ll weight(int x) {
root(x); // 経路圧縮
return diff_weight[x];
}
ll diff(int x, int y) { return weight(y) - weight(x); }
int size(int A) { return -Parent[root(A)]; }
int eize(int A) { return es[root(A)]; }
bool connect(int A, int B) {
A = root(A);
B = root(B);
if (A == B)
return false;
if (size(A) < size(B))
swap(A, B);
Parent[A] += Parent[B];
es[A] += es[B] + 1;
Parent[B] = A;
return true;
}
void unite(int A, int B) {
A = root(A);
B = root(B);
if (A == B) {
es[A]++;
return;
}
if (size(A) < size(B))
swap(A, B);
Parent[A] += Parent[B];
es[A] += es[B] + 1;
Parent[B] = A;
return;
}
bool merge(int A, int B, ll w) {
// x と y それぞれについて、 root との重み差分を補正
w += weight(A);
w -= weight(B);
A = root(A);
B = root(B);
if (A == B)
return false;
if (size(A) < size(B))
swap(A, B), w = -w;
Parent[A] += Parent[B];
Parent[B] = A;
// x が y の親になるので、x と y の差分を diff_weight[y] に記録
diff_weight[B] = w;
return true;
}
};
class Factorial { // 階乗とその逆元を求めて計算に利用するクラス
private:
vector<ll> fac;
vector<ll> ifac;
public:
Factorial(ll N) {
fac.push_back(1);
REP(i, N) fac.push_back(fac[i] * (i + 1) % mod);
ifac.resize(N + 1);
ifac[N] = inv_mod(fac[N]);
REP(i, N) ifac[N - 1 - i] = (ifac[N - i] * (N - i)) % mod;
}
ll fact(ll a) { return fac[a]; }
ll ifact(ll a) { return ifac[a]; }
ll cmb(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0 || b < 0)
return 0;
ll tmp = ifact(a - b) * ifact(b) % mod;
return tmp * fac[a] % mod;
}
ll per(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0 || b < 0)
return 0;
return fac[a] * ifac[a - b] % mod;
}
};
class SOSU {
private:
vector<int> Prime_Number;
vector<bool> isp;
public:
SOSU(int N) {
isp.resize(N + 1, true);
isp[0] = isp[1] = false;
rep(i, 2, N + 1) if (isp[i]) {
Prime_Number.push_back(i);
for (int j = 2 * i; j <= N; j += i)
isp[j] = false;
}
}
int operator[](int i) { return Prime_Number[i]; }
int size() { return Prime_Number.size(); }
int back() { return Prime_Number.back(); }
bool isPrime(int q) { return isp[q]; }
};
class
Divisor { // 素因数分解をしてから約数列挙、分解結果はＰ(底,指数)でpfacにまとめている
private:
vector<ll> F;
vector<P> pfactorize;
public:
Divisor(ll N) {
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
F.push_back(i);
if (i * i != N)
F.push_back(N / i);
}
}
sort(begin(F), end(F));
SOSU p(SQRT(N) + 1);
REP(i, p.size()) {
pfactorize.push_back(P(p[i], 0));
while (N % p[i] == 0) {
N /= p[i];
pfactorize.back().second++;
}
if (pfactorize.size() == 0)
pfactorize.pop_back();
}
if (N > 1)
pfactorize.push_back(P(N, 1));
}
int size() { return F.size(); }
vector<P> pfac() { return pfactorize; }
ll operator[](int k) { return F[k]; }
};
struct Solutions {
ll napsack(int kinds, int MAX_W, const vl &weight, const vl &cost) {
vector<vector<ll>> dp(kinds + 1, vector<ll>(MAX_W + 1, 0));
REP(i, kinds) REP(j, MAX_W + 1) {
if (j < weight[i])
dp[i + 1][j] = dp[i][j];
else
dp[i + 1][j] = max(dp[i][j], dp[i][j - weight[i]] + cost[i]);
}
return dp[kinds][MAX_W];
}
ll cost_based_napsack(int kinds, int MAX_W, const vl &weight,
const vl &cost) {
int MAX_V = 0;
REP(i, kinds) MAX_V = max(MAX_V, (int)cost[i]);
vvl dp(kinds + 1, vl(kinds * MAX_V + 1, 1LL << 58));
dp[0][0] = 0;
REP(i, kinds) REP(j, kinds * MAX_V + 1) {
if (j < cost[i])
dp[i + 1][j] = dp[i][j];
else
dp[i + 1][j] = min(dp[i][j], dp[i][j - cost[i]] + weight[i]);
}
int res = 0;
REP(i, kinds * MAX_V + 1) if (dp[kinds][i] <= MAX_W) res = i;
return res;
}
ll unlimited_napsack(int kinds, int MAX_W, const vl &weight, const vl &cost) {
vector<vector<ll>> dp(kinds + 1, vector<ll>(MAX_W + 1, 0));
REP(i, kinds) REP(j, MAX_W + 1) {
if (j < weight[i])
dp[i + 1][j] = dp[i][j];
else
dp[i + 1][j] = max(dp[i][j], dp[i + 1][j - weight[i]] + cost[i]);
}
return dp[kinds][MAX_W];
}
ll huge_napsack(int kinds, ll MAX_W, const vl &weight, const vl &cost) {
int n2 = kinds / 2;
vector<P> ps(1 << (kinds / 2));
REP(i, 1 << n2) {
ll sw = 0, sv = 0;
REP(j, n2) {
if (i >> j & 1) {
sw += weight[j];
sv += cost[j];
}
}
ps[i] = P(sw, sv);
}
sort(ps.begin(), ps.begin() + (1 << n2));
int m = 1;
rep(i, 1, 1 << n2) {
if (ps[m - 1].second < ps[i].second)
ps[m++] = ps[i];
}
ll res = 0;
REP(i, 1 << (kinds - n2)) {
ll sw = 0, sv = 0;
REP(j, kinds - n2) {
if ((i >> j) & 1) {
sw += weight[n2 + j];
sv += cost[n2 + j];
}
}
if (sw <= MAX_W) {
ll tv =
(lower_bound(ps.begin(), ps.begin() + m, P(MAX_W - sw, LLONG_MAX)) -
1)
->second;
res = max(res, sv + tv);
}
}
return res;
}
ll choose_MonN(int N, int M, const vl &cost) {
vvl dp(N + 1, vl(M + 1, -1LL << 58));
REP(i, N + 1) dp[i][0] = 0;
REP(i, N) REP(j, M) {
if (j > i)
break;
dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i][j] + cost[i]);
}
return dp[N][M];
}
ll Partition_Func(int n, int k) {
vector<vector<ll>> dp(k + 1, vector<ll>(n + 1, 0));
dp[0][0] = 1;
rep(i, 1, k + 1) REP(j, n + 1) {
if (j - i >= 0)
dp[i][j] = (dp[i][j - i] + dp[i - 1][j]);
else
dp[i][j] = dp[i - 1][j];
}
return dp[k][n];
}
int LCS(string s, string t) {
int n = s.length(), m = s.length();
vector<vector<int>> dp(n + 1, vector<int>(m + 1));
REP(i, n) REP(j, m) {
if (s[i] == t[j])
dp[i + 1][j + 1] = dp[i][j] + 1;
else
dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);
}
return dp[n][m];
}
int LIS(const vector<ll> a) {
int n = a.size();
ll INF = 1LL << 50;
vector<ll> dp(n + 1, INF);
REP(i, n) * lower_bound(All(dp), a[i]) = a[i];
int k = lower_bound(All(dp), INF) - dp.begin();
return k;
}
int max_flow(int s, int t, const vector<vector<P>> &g) {
struct edge_ {
int to, cap, rev;
};
vector<bool> used(g.size(), false);
vector<vector<edge_>> G(g.size());
REP(i, g.size()) REP(j, g[i].size()) {
int from = i, to = g[i][j].second;
int cap = g[i][j].first;
G[from].push_back((edge_){to, cap, (int)G[to].size()});
G[to].push_back((edge_){from, 0, (int)G[from].size() - 1});
}
auto dfs = [&](auto &&f, int v, int t, int fl) -> int {
if (v == t)
return fl;
used[v] = true;
REP(i, G[v].size()) {
edge_ &e = G[v][i];
if (!used[e.to] && e.cap > 0) {
int d = f(f, e.to, t, min(fl, e.cap));
if (d > 0) {
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
};
int flow = 0;
while (1) {
used.assign(used.size(), false);
int f = dfs(dfs, s, t, INT_MAX);
if (f == 0)
return flow;
flow += f;
}
}
int bipartite_matching_calculate(const Graph &g) {
int V = g.size();
vi match(V, -1);
vector<bool> used(V, false);
auto dfs = [&](auto &&f, int v) -> bool {
used[v] = true;
REP(i, g[v].size()) {
int u = g[v][i], w = match[u];
if (w < 0 || !used[w] && f(f, w)) {
match[v] = u;
match[u] = v;
return true;
}
}
return false;
};
int res = 0;
REP(v, V) {
if (match[v] < 0) {
used.assign(V, false);
if (dfs(dfs, v))
res++;
}
}
return res;
}
int bipartite_matching(int l, int r, function<bool(int, int)> F) {
int V = l + r;
Graph G(V);
REP(i, l) REP(j, r) if (F(i, j)) {
G[i].push_back(l + j);
G[l + j].push_back(i);
}
return bipartite_matching_calculate(G);
}
};
struct compress {
map<ll, int> zip;
vector<ll> unzip;
compress(vector<ll> x) {
unzip = x;
sort(All(x));
x.erase(unique(All(x)), x.end());
REP(i, x.size()) { zip[x[i]] = i; }
}
int operator[](int k) { return zip[unzip[k]]; }
};
struct edge {
int from;
int to;
ll cost;
void push(int a, int b, int c) {
from = a;
to = b;
cost = c;
}
bool operator<(const edge &y) const {
if (cost != y.cost)
return cost < y.cost;
else if (to != y.to)
return to < y.to;
else
return from < y.from;
}
bool operator>(const edge &y) const {
if (cost != y.cost)
return cost > y.cost;
else if (to != y.to)
return to > y.to;
else
return from > y.from;
}
bool operator==(const edge &y) const { return *this == y; }
};
class lca {
public:
const int n = 0;
const int log2_n = 0;
std::vector<std::vector<int>> parent;
std::vector<int> depth;
lca() {}
lca(const Graph &g, int root)
: n(g.size()), log2_n(log2(n) + 1), parent(log2_n, std::vector<int>(n)),
depth(n) {
dfs(g, root, -1, 0);
for (int k = 0; k + 1 < log2_n; k++) {
for (int v = 0; v < (int)g.size(); v++) {
if (parent[k][v] < 0)
parent[k + 1][v] = -1;
else
parent[k + 1][v] = parent[k][parent[k][v]];
}
}
}
void dfs(const Graph &g, int v, int p, int d) {
parent[0][v] = p;
depth[v] = d;
REP(j, g[v].size()) {
if (g[v][j] != p)
dfs(g, g[v][j], v, d + 1);
}
}
int get(int u, int v) {
if (depth[u] > depth[v])
std::swap(u, v);
for (int k = 0; k < log2_n; k++) {
if ((depth[v] - depth[u]) >> k & 1) {
v = parent[k][v];
}
}
if (u == v)
return u;
for (int k = log2_n - 1; k >= 0; k--) {
if (parent[k][u] != parent[k][v]) {
u = parent[k][u];
v = parent[k][v];
}
}
return parent[0][u];
}
};
template <typename T, typename E> // SegmentTree((要素数) int n_,(演算) F
// f,(更新) G g,(初期値) T d1)
struct SegmentTree {
typedef function<T(T, T)> F;
typedef function<T(T, E)> G;
int n;
F f;
G g;
T d1;
E d0;
vector<T> dat;
SegmentTree(){};
SegmentTree(int n_, F f, G g, T d1, vector<T> v = vector<T>())
: f(f), g(g), d1(d1) {
init(n_);
if (n_ == (int)v.size())
build(n_, v);
}
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
dat.clear();
dat.resize(2 * n - 1, d1);
}
void build(int n_, vector<T> v) {
for (int i = 0; i < n_; i++)
dat[i + n - 1] = v[i];
for (int i = n - 2; i >= 0; i--)
dat[i] = f(dat[i * 2 + 1], dat[i * 2 + 2]);
}
void update(int k, E a) {
k += n - 1;
dat[k] = g(dat[k], a);
while (k > 0) {
k = (k - 1) / 2;
dat[k] = f(dat[k * 2 + 1], dat[k * 2 + 2]);
}
}
inline T query(int a, int b) {
T vl = d1, vr = d1;
for (int l = a + n, r = b + n; l < r; l >>= 1, r >>= 1) {
if (l & 1)
vl = f(vl, dat[(l++) - 1]);
if (r & 1)
vr = f(dat[(--r) - 1], vr);
}
return f(vl, vr);
}
};
struct GP {
double x, y;
GP(double X = 0, double Y = 0) : x(X), y(Y) {}
GP(const GP &cp) {
x = cp.x;
y = cp.y;
}
GP &set(double X, double Y) {
x = X;
y = Y;
return *this;
}
GP &operator=(const GP &p) { return set(p.x, p.y); }
GP operator+(const GP &p) const { return GP(x + p.x, y + p.y); }
GP operator-(const GP &p) const { return GP(x - p.x, y - p.y); }
GP operator*(double s) const { return GP(x * s, y * s); }
GP operator/(double s) const { return GP(x / s, y / s); }
friend GP operator*(double s, const GP &r) { return GP(r.x * s, r.y * s); }
friend GP operator/(double s, const GP &r) { return GP(r.x / s, r.y / s); }
double operator*(GP p) const { return dot(p); }
double operator^(GP p) const { return cross(p); }
GP &operator+=(const GP &p) { return set(x + p.x, y + p.y); }
GP &operator-=(const GP &p) { return set(x - p.x, y - p.y); }
GP &operator*=(double s) { return set(x * s, y * s); }
GP &operator/=(double s) { return set(x / s, y / s); }
double dot(const GP &p) const { return x * p.x + y * p.y; }
double cross(const GP &p) const { return x * p.y - p.x * y; }
int ort() const {
if (fabs(x) < eps && fabs(y) < eps)
return 0;
if (y > 0)
return (x > 0) ? 1 : 2;
else
return (x <= 0) ? 3 : 4;
}
bool operator<(const GP &p) const {
int o = ort(), po = p.ort();
if (o != po)
return o < po;
else {
double cr = cross(p);
if (cr == 0) {
double d = norm(), pd = p.norm();
return d < pd;
}
return cr > 0;
}
}
friend istream &operator>>(istream &is, GP &x) {
double valX, valY;
is >> valX >> valY;
x.set(valX, valY);
return is;
}
friend ostream &operator<<(ostream &os, const GP &v) {
os << v.x << " " << v.y << endl;
return os;
}
double norm2() const { return x * x + y * y; }
double norm() const { return sqrt(norm2()); }
double rad() const {
if (x == 0) {
if (y > 0)
return PI / 2.0;
if (y == 0)
return -1.0;
if (y < 0)
return -PI / 2.0;
} else {
if (y == 0) {
if (x < 0)
return PI;
if (x > 0)
return 0.0;
} else
return atan2(y, x);
}
}
void rotate(double theta) {
double X = x, Y = y;
x = cos(theta) * X - sin(theta) * Y;
y = sin(theta) * X + cos(theta) * Y;
}
};
struct Line {
GP A, B;
Line(GP p1 = GP(0, 0), GP p2 = GP(1, 1)) : A(p1), B(p2) {}
double len() const { return (B - A).norm(); }
GP shortest_point(const GP &x) const {
double a = B.x - A.x, b = B.y - A.y;
double t = -(a * (A.x - x.x) + b * (A.y - x.y)) / (a * a + b * b);
return GP(a * t + A.x, b * t + A.y);
}
double dist(const GP &x) const { return (x - shortest_point(x)).norm(); }
bool online(const GP &x) const {
return ((B - A) ^ (x - A)) == 0 && (x - A).norm() <= len() &&
(x - B).norm() <= len();
}
friend istream &operator>>(istream &is, Line &x) {
GP X, Y;
is >> X >> Y;
x.A = X;
x.B = Y;
return is;
}
friend ostream &operator<<(ostream &os, const Line &x) {
os << x.A << x.B;
return os;
}
};
struct Triangle {
GP a, b, c;
Triangle(GP p1 = GP(0, 0), GP p2 = GP(1, 0), GP p3 = (0, 1))
: a(p1), b(p2), c(p3) {}
double A() const {
double res = fabs((b - a).rad() - (c - a).rad());
if (res >= PI)
res -= PI;
return res;
}
double B() const {
double res = fabs((a - b).rad() - (c - b).rad());
if (res >= PI)
res -= PI;
return res;
}
double C() const {
double res = fabs((a - c).rad() - (b - c).rad());
if (res >= PI)
res -= PI;
return res;
}
Line AB() const { return Line(a, b); }
Line BC() const { return Line(b, c); }
Line CA() const { return Line(c, a); }
GP G() const { return (a + b + c) / 3; }
GP O() const {
return (sin(2 * A()) * a + sin(2 * B()) * b + sin(2 * C()) * c) /
(sin(2 * A()) + sin(2 * B()) + sin(2 * C()));
}
double R() const { return a.norm() / (2 * sin(A())); }
GP I() const {
return (a.norm() * a + b.norm() * b + c.norm() * c) /
(a.norm() + b.norm() + c.norm());
}
double r() const {
return 2 * area() / ((a - b).norm() + (b - c).norm() + (c - a).norm());
}
GP H() const {
return (tan(A()) * a + tan(B()) * b + tan(C()) * c) /
(tan(A()) + tan(B()) + tan(C()));
}
double AH() const { return 2 * R() * cos(A()); }
double BH() const { return 2 * R() * cos(B()); }
double CH() const { return 2 * R() * cos(C()); }
double area() const { return ((b - a) ^ (c - a)) / 2; }
bool inside(const GP &x) const {
return ((b - a) ^ (x - a)) * ((c - a) ^ (x - a)) < 0 &&
((a - b) ^ (x - b)) * ((c - b) ^ (x - b)) < 0 &&
((a - c) ^ (x - c)) * ((b - c) ^ (x - c)) < 0;
}
bool online(const GP &x) const {
return AB().online(x) || BC().online(x) || CA().online(x);
}
bool outside(const GP &x) const { return (!inside(x) && !online(x)); }
friend istream &operator>>(istream &is, Triangle &x) {
GP X, Y, Z;
is >> X >> Y >> Z;
x.a = X;
x.b = Y;
x.c = Z;
return is;
}
friend ostream &operator<<(ostream &os, const Triangle &v) {
os << v.a << v.b;
return os;
}
};
struct rational {
ll p, q;
void normalize() { // keep q positive
if (q < 0)
p *= -1, q *= -1;
ll d = gcd(p < 0 ? -p : p, q);
if (d == 0)
p = 0, q = 1;
else
p /= d, q /= d;
}
rational(ll p, ll q = 1) : p(p), q(q) { normalize(); }
rational &operator+=(const rational &a) {
p = a.q * p + a.p * q;
q = a.q * q;
normalize();
return *this;
}
rational &operator-=(const rational &a) {
p = a.q * p - a.p * q;
q = a.q * q;
normalize();
return *this;
}
rational &operator*=(const rational &a) {
p *= a.p;
q *= a.q;
normalize();
return *this;
}
rational &operator/=(const rational &a) {
p *= a.q;
q *= a.p;
normalize();
return *this;
}
rational &operator-() {
p *= -1;
return *this;
}
friend rational operator+(const rational &a, const rational &b) {
return rational(a) += b;
}
friend rational operator*(const rational &a, const rational &b) {
return rational(a) *= b;
}
friend rational operator-(const rational &a, const rational &b) {
return rational(a) -= b;
}
friend rational operator/(const rational &a, const rational &b) {
return rational(a) /= b;
}
friend bool operator<(const rational &a,
const rational &b) { // avoid overflow
return (long double)a.p * b.q < (long double)a.q * b.p;
}
friend bool operator<=(const rational &a, const rational &b) {
return !(b < a);
}
friend bool operator>(const rational &a, const rational &b) { return b < a; }
friend bool operator>=(const rational &a, const rational &b) {
return !(a < b);
}
friend bool operator==(const rational &a, const rational &b) {
return !(a < b) && !(b < a);
}
friend bool operator!=(const rational &a, const rational &b) {
return (a < b) || (b < a);
}
friend ostream &operator<<(ostream &os, const rational &x) {
printf("%.16f", (double)x.p / (double)x.q);
return os;
}
friend istream &operator>>(istream &is, rational &x) {
is >> x.p >> x.q;
x.normalize();
return is;
}
};
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
solve();
return 0;
}
void solve() {
int N;
cin >> N;
string S;
cin >> S;
int l = 0, r = N;
while (l + 1 < r) {
int m = (l + r) / 2;
bool ok = false;
REP(i, N) {
string t = S.substr(i, m);
if (S.find(t, i + m) != -1)
ok = true;
}
if (ok)
l = m;
else
r = m;
}
cout << l << endl;
} | replace | 1,168 | 1,170 | 1,168 | 1,171 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007; // 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
/*-------------------------------------------------*/
template <typename T = string> struct RollingHash {
T str;
RollingHash(const T &s, int base = 10007, int mod = 1000000007)
: str(s), base(base), mod(mod) {
int n = str.size();
hash_val.resize(n + 1);
hash_val[0] = 0;
power.resize(n + 1);
power[0] = 1;
REP(i, n) {
hash_val[i + 1] = (hash_val[i] * base % mod + str[i]) % mod;
power[i + 1] = power[i] * base % mod;
}
}
long long get(int left, int right) {
long long res =
hash_val[right] - hash_val[left] * power[right - left] % mod;
if (res < 0)
res += mod;
return res;
}
void add(const T &t) {
for (auto c : t) {
hash_val.emplace_back((hash_val.back() * base % mod + c) % mod);
power.emplace_back(power.back() * base % mod);
}
}
int lcp(int i, int j) {
int n = str.size(), lb = 0, ub = n + 1 - max(i, j);
while (ub - lb > 1) {
int mid = (lb + ub) >> 1;
(get(i, i + mid) == get(j, j + mid) ? lb : ub) = mid;
}
return lb;
}
template <typename U> int lcp(const RollingHash<U> &t, int i, int j) {
int lb = 0, ub = min(static_cast<int>(str.size()) - i,
static_cast<int>(t.str.size()) - j) +
1;
while (ub - lb > 1) {
int mid = (lb + ub) >> 1;
(get(i, i + mid) == t.get(j, j + mid) ? lb : ub) = mid;
}
return lb;
}
private:
int base, mod;
vector<long long> hash_val, power;
};
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
// freopen("input.txt", "r", stdin);
int n;
cin >> n;
string s;
cin >> s;
RollingHash<> rh(s);
int ans = 0;
REP(i, n) FOR(j, i + 1, n) ans = max(ans, min(rh.lcp(i, j), j - i));
cout << ans << '\n';
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007; // 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
/*-------------------------------------------------*/
template <typename T = string> struct RollingHash {
T str;
RollingHash(const T &s, int base = 10007, int mod = 1000000007)
: str(s), base(base), mod(mod) {
int n = str.size();
hash_val.resize(n + 1);
hash_val[0] = 0;
power.resize(n + 1);
power[0] = 1;
REP(i, n) {
hash_val[i + 1] = (hash_val[i] * base % mod + str[i]) % mod;
power[i + 1] = power[i] * base % mod;
}
}
long long get(int left, int right) {
long long res =
hash_val[right] - hash_val[left] * power[right - left] % mod;
if (res < 0)
res += mod;
return res;
}
void add(const T &t) {
for (auto c : t) {
hash_val.emplace_back((hash_val.back() * base % mod + c) % mod);
power.emplace_back(power.back() * base % mod);
}
}
int lcp(int i, int j) {
int n = str.size(), lb = 0, ub = n + 1 - max(i, j);
while (ub - lb > 1) {
int mid = (lb + ub) >> 1;
(get(i, i + mid) == get(j, j + mid) ? lb : ub) = mid;
}
return lb;
}
template <typename U> int lcp(const RollingHash<U> &t, int i, int j) {
int lb = 0, ub = min(static_cast<int>(str.size()) - i,
static_cast<int>(t.str.size()) - j) +
1;
while (ub - lb > 1) {
int mid = (lb + ub) >> 1;
(get(i, i + mid) == t.get(j, j + mid) ? lb : ub) = mid;
}
return lb;
}
private:
int base, mod;
vector<long long> hash_val, power;
};
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
// freopen("input.txt", "r", stdin);
int n;
cin >> n;
string s;
cin >> s;
RollingHash<> rh(s);
int lb = 0, ub = n + 1;
while (ub - lb > 1) {
int mid = (lb + ub) / 2;
map<long long, vector<int>> mp;
REP(i, n) {
if (i + mid > n)
break;
mp[rh.get(i, i + mid)].emplace_back(i);
}
bool ok = false;
for (auto pr : mp) {
if (pr.second.size() >= 2) {
if (pr.second.back() - pr.second.front() >= mid)
ok = true;
}
}
(ok ? lb : ub) = mid;
}
cout << lb << '\n';
return 0;
}
| replace | 101 | 104 | 101 | 120 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
int Z_algo(string s, int k) {
int n = s.length();
vector<int> z(n);
int L = 0, R = 0;
for (int i = 1; i < n; i++) {
if (i > R) {
L = R = i;
while (R < n && s[R - L] == s[R])
R++;
z[i] = R - L;
R--;
} else {
int k = i - L;
if (z[k] < R - i + 1)
z[i] = z[k];
else {
L = i;
while (R < n && s[R - L] == s[R])
R++;
z[i] = R - L;
R--;
}
}
}
int mx = 0;
for (int i = k; i < n; i++)
mx = max(mx, z[i]);
return mx;
}
int main() {
int n;
cin >> n;
string s;
cin >> s;
int mx = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
mx = max(mx, Z_algo(s.substr(i, j) + "#" + s.substr(j, n - j), j));
}
}
cout << mx;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
int Z_algo(string s, int k) {
int n = s.length();
vector<int> z(n);
int L = 0, R = 0;
for (int i = 1; i < n; i++) {
if (i > R) {
L = R = i;
while (R < n && s[R - L] == s[R])
R++;
z[i] = R - L;
R--;
} else {
int k = i - L;
if (z[k] < R - i + 1)
z[i] = z[k];
else {
L = i;
while (R < n && s[R - L] == s[R])
R++;
z[i] = R - L;
R--;
}
}
}
int mx = 0;
for (int i = k; i < n; i++)
mx = max(mx, z[i]);
return mx;
}
int main() {
int n;
cin >> n;
string s;
cin >> s;
int mx = 0;
for (int i = n - 1; i >= 0; i--) {
mx = max(mx, Z_algo(s.substr(i, n - i) + "#" + s.substr(0, i), n - i));
}
cout << mx;
return 0;
} | replace | 44 | 48 | 44 | 46 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXLEN = 5 * 1e3 + 5;
int n;
string s;
int dp[MAXLEN][MAXLEN];
int solve(int i, int j, int lim) {
if (i >= n || j >= n)
return 0;
if (i >= lim)
return 0;
if (dp[i][j] >= 0)
return dp[i][j];
if (s[i] != s[j])
return 0;
return 1 + solve(i + 1, j + 1, lim);
}
int main() {
cin >> n >> s;
memset(dp, -1, sizeof(dp));
int len = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
len = max(len, solve(i, j, j));
}
}
cout << len;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXLEN = 5 * 1e3 + 5;
int n;
string s;
int dp[MAXLEN][MAXLEN];
int solve(int i, int j, int lim) {
if (i >= n || j >= n)
return 0;
if (i >= lim)
return 0;
if (dp[i][j] >= 0)
return dp[i][j];
if (s[i] != s[j])
return 0;
dp[i][j] = 1 + solve(i + 1, j + 1, lim);
return dp[i][j];
}
int main() {
cin >> n >> s;
memset(dp, -1, sizeof(dp));
int len = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
len = max(len, solve(i, j, j));
}
}
cout << len;
} | replace | 23 | 24 | 23 | 25 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <iostream>
#include <math.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, double> pld;
typedef pair<double, double> pdd;
typedef pair<double, ll> pdl;
typedef pair<int, char> pic;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef priority_queue<ll, vector<ll>, greater<ll>> llgreaterq;
typedef priority_queue<pll, vector<pll>, greater<pll>> pllgreaterq;
typedef priority_queue<pair<ll, pll>, vector<pair<ll, pll>>,
greater<pair<ll, pll>>>
plpllgreaterq;
typedef priority_queue<vi, vector<vi>, greater<vi>> vigreaterq;
typedef priority_queue<vl, vector<vl>, greater<vl>> vlgreaterq;
template <class o, class p, class q>
using tuple3q = priority_queue<tuple<o, p, q>, vector<tuple<o, p, q>>,
greater<tuple<o, p, q>>>;
template <class o, class p, class q, class r>
using tuple4q = priority_queue<tuple<o, p, q, r>, vector<tuple<o, p, q, r>>,
greater<tuple<o, p, q, r>>>;
template <class o, class p, class q, class r, class s>
using tuple5q =
priority_queue<tuple<o, p, q, r, s>, vector<tuple<o, p, q, r, s>>,
greater<tuple<o, p, q, r, s>>>;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
#define bit(x, v) ((ll)x << v)
#define rep(x, n) for (ll x = 0; x < n; x++)
#define rep2(x, f, v) for (ll x = f; x < v; x++)
#define repe(v, x) for (auto v : x)
// 許容する誤差ε
#define EPS (1e-10)
// 2つのスカラーが等しいかどうか
#define EQ(a, b) (std::abs(a - b) < EPS)
// 2つのベクトルが等しいかどうか
#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
#define all(a) a.begin(), a.end()
#define all0(a) memset(a, 0, sizeof(a))
#define allm1(a) memset(a, -1, sizeof(a))
#define put_float(v) \
cout << fixed << setprecision(10); \
cout << v << endl
#define put(v) cout << v << endl
#define vinsert(v, p, x) v.insert(v.begin() + p, x)
#define vsort(v) sort(all(v));
#define vdesc(v) \
vsort(v); \
reverse(all(v))
#define dup(v) v.erase(unique(all(v)), v.end())
#define ion(i, j) ((i & (1LL << j)) > 0)
#define next(i) \
i++; \
i %= 2
#define Len size()
#define ull unsignd long long
#define psp(a, b) push_back(make_pair(a, b))
#define psp2(a, b) push(make_pair(a, b))
#define cini(a) \
a; \
cin >> a
#define infa(a, b) (a + b) % INF
#define infm(a, b) (a * b) % INF
#define infd(a, b) (a * modinv(b)) % INF
#define infs(a, b) (a + INF - b) % INF
#define inf(a) (a) %= INF
#define inff(a) ((a) % INF)
#define No cout << "No" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
#define smal -INF *INF
#define big INF *INF
const ll INF = 1000000007;
const int MAX = 2000010;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll getpow(ll b, ll x, ll md) {
ll t = b;
ll res = 1;
while (x > 0) {
if (x & 1) {
res *= t;
res %= md;
}
x >>= 1;
t *= t;
t %= md;
}
return res;
}
ll getpow(ll b, ll x) { return getpow(b, x, INF); }
ll modinv(ll x) { return getpow(x, INF - 2); }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
class mint {
int md = 1000000007;
public:
long long x;
mint(ll x, ll md) {
this->md = md;
this->x = (x % md + md) % md;
}
mint(long long x = 0) : x((x % md + md) % md) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= md)
x -= md;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += md - a.x) >= md)
x -= md;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= md;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(md - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
int pr[100010];
int lank[100010];
void uini(int n) {
for (size_t i = 0; i <= n; i++) {
pr[i] = i;
lank[i] = 1;
}
}
int parent(int x) {
if (x == pr[x])
return x;
return pr[x] = parent(pr[x]);
}
int same(int x, int y) { return parent(x) == parent(y); }
bool unit(int x, int y) {
int px = parent(x);
int py = parent(y);
if (px == py)
return false;
if (lank[py] < lank[px]) {
pr[py] = px;
lank[px] += lank[py];
} else {
pr[px] = py;
lank[py] += lank[px];
}
return true;
}
ll n, m;
int ci = 0;
struct Node {
int key;
int priority;
Node *parent, *left, *right;
Node(int key, int priority);
Node() {}
};
Node NIL;
Node::Node(int key, int priority) : key(key), priority(priority) {
left = &NIL;
right = &NIL;
}
Node *root = new Node();
void cenrec(Node *k) {
if (k->key == NIL.key)
return;
cenrec(k->left);
cout << " " << k->key;
cenrec(k->right);
}
void fastrec(Node *k) {
if (k->key == NIL.key)
return;
cout << " " << k->key;
fastrec(k->left);
fastrec(k->right);
}
void insert(Node *v) {
Node *y = &NIL;
Node *x = root;
while (x->key != NIL.key) {
y = x;
if (v->key < x->key) {
x = x->left;
} else {
x = x->right;
}
}
v->parent = y;
if (y->key == NIL.key) {
root = v;
} else if (v->key < y->key) {
y->left = v;
} else {
y->right = v;
}
}
Node *find(Node *k, ll v) {
if (k->key == NIL.key)
return &NIL;
if (k->key == v)
return k;
if (v < k->key)
return find(k->left, v);
return find(k->right, v);
}
void delp12(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key == NIL.key && r->key == NIL.key) {
if (pr->left == x) {
pr->left = &NIL;
} else
pr->right = &NIL;
} else if (l->key != NIL.key) {
if (pr->left == x) {
pr->left = l;
} else
pr->right = l;
l->parent = pr;
} else if (r->key != NIL.key) {
if (pr->left == x) {
pr->left = r;
} else
pr->right = r;
r->parent = pr;
}
}
Node *get_next(Node *k) {
if (k->key == NIL.key)
return &NIL;
Node *res = get_next(k->left);
if (res->key != NIL.key)
return res;
return k;
}
void del(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key != NIL.key && r->key != NIL.key) {
Node *nex = get_next(r);
x->key = nex->key;
delp12(nex);
} else {
delp12(x);
}
}
Node *rightRotate(Node *t) {
Node *s = t->left;
t->left = s->right;
s->right = t;
return s;
}
Node *leftRotate(Node *t) {
Node *s = t->right;
t->right = s->left;
s->left = t;
return s;
}
Node *_insert(Node *t, int key, int priority) {
if (t->key == NIL.key) {
return new Node(key, priority);
}
if (key == t->key) {
return t;
}
if (key < t->key) {
t->left = _insert(t->left, key, priority);
if (t->priority < t->left->priority) {
t = rightRotate(t);
}
} else {
t->right = _insert(t->right, key, priority);
if (t->priority < t->right->priority) {
t = leftRotate(t);
}
}
return t;
}
Node *delete1(Node *t, int key);
Node *_delete(Node *t, int key) {
if (t->left->key == NIL.key && t->right->key == NIL.key) {
return &NIL;
} else if (t->left->key == NIL.key) {
t = leftRotate(t);
} else if (t->right->key == NIL.key) {
t = rightRotate(t);
} else {
if (t->left->priority > t->right->priority) {
t = rightRotate(t);
} else
t = leftRotate(t);
}
return delete1(t, key);
}
Node *delete1(Node *t, int key) {
if (t->key == NIL.key) {
return &NIL;
}
if (key < t->key) {
t->left = delete1(t->left, key);
} else if (key > t->key) {
t->right = delete1(t->right, key);
} else
return _delete(t, key);
return t;
}
int H;
int left(int i) { return i * 2 + 1; }
int right(int i) { return i * 2 + 2; }
class edge {
public:
int from, to, i;
ll val;
edge() {}
edge(ll to) : to(to) {}
edge(ll to, ll i) : to(to), i(i) {}
edge(ll from, ll to, ll val) : from(from), to(to), val(val) {}
};
class LCA {
private:
vector<vector<edge>> v;
vector<vector<int>> parent;
vector<int> depth;
void dfs(int n, int m, int d) {
parent[0][n] = m;
depth[n] = d;
for (auto x : v[n]) {
if (x.to != m)
dfs(x.to, n, d + 1);
}
}
public:
LCA(ll N, ll root, vector<vector<edge>> &tree) {
v = tree;
parent = vector<vector<int>>(21, vector<int>(N + 1, 0));
depth = vector<int>(N + 1, 0);
dfs(root, -1, 0);
for (int j = 0; j + 1 < 20; j++) {
for (int i = 1; i <= N; i++) {
if (parent[j][i] < 0)
parent[j + 1][i] = -1;
else
parent[j + 1][i] = parent[j][parent[j][i]];
}
}
}
int lca(int n, int m) {
if (depth[n] > depth[m])
swap(n, m);
for (int j = 0; j < 20; j++) {
if ((depth[m] - depth[n]) >> j & 1)
m = parent[j][m];
}
if (n == m)
return n;
for (int j = 19; j >= 0; j--) {
if (parent[j][n] != parent[j][m]) {
n = parent[j][n];
m = parent[j][m];
}
}
return parent[0][n];
}
int dep(int n) { return depth[n]; }
};
ll k;
int _rank[1010];
int temp[1010];
bool compare_sa(int i, int j) {
if (_rank[i] != _rank[j])
return _rank[i] < _rank[j];
else {
int ri = i + k <= n ? _rank[i + k] : -1;
int rj = j + k <= n ? _rank[j + k] : -1;
return ri < rj;
}
}
void construct_sa(string S, int *sa) {
n = S.length();
for (size_t i = 0; i <= n; i++) {
sa[i] = i;
_rank[i] = i < n ? S[i] : -1;
}
for (k = 1; k <= n; k *= 2) {
sort(sa, sa + n + 1, compare_sa);
// saはソート後の接尾辞の並びになっている、rankは元の位置のindexを保持したまま、更新されている。
// ピンとこなかった部分
temp[sa[0]] = 0;
for (size_t i = 1; i <= n; i++) {
temp[sa[i]] = temp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);
}
for (size_t i = 0; i <= n; i++) {
_rank[i] = temp[i];
}
}
}
bool contain(string S, int *sa, string T) {
int a = 0, b = S.length();
// sa は 接尾辞が辞書順に並んでいる、入っているのはその位置のインデックス
while (b - a > 1) {
int c = (a + b) / 2;
if (S.compare(sa[c], T.length(), T) < 0)
a = c;
else
b = c;
}
return S.compare(sa[b], T.length(), T) == 0;
}
#define bit(x, v) ((ll)x << v)
class BIT {
static const int MAX_N = 500010;
public:
BIT() { memset(bit, 0, sizeof(bit)); }
ll bit[MAX_N + 1], n;
ll sum(int i) {
ll s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
};
struct UnionFind {
vector<int> A;
UnionFind(int n) : A(n, -1) {}
int find(int x) {
if (A[x] < 0)
return x;
return A[x] = find(A[x]);
}
void unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return;
if (A[x] > A[y])
swap(x, y);
A[x] += A[y];
A[y] = x;
}
int ngroups() {
int ans = 0;
for (auto a : A)
if (a < 0)
ans++;
return ans;
}
};
vector<ll> getp(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
res.push_back(2);
while (n % 2 == 0)
n /= 2;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(i);
while (n % i == 0)
n /= i;
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<ll> getp2(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
while (n % 2 == 0) {
n /= 2;
res.push_back(2);
}
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
while (n % i == 0) {
n /= i;
res.push_back(i);
}
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<pll> getp3(ll n) {
vector<pll> res;
ll a = 2;
int si = 0;
if (n % 2 == 0) {
res.push_back(make_pair(2, 0));
while (n % 2 == 0) {
n /= 2;
res[si].second++;
}
si++;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(make_pair(i, 0));
while (n % i == 0) {
n /= i;
res[si].second++;
}
si++;
}
}
if (n != 1) {
res.push_back(make_pair(n, 1));
}
return res;
}
vector<ll> getDivisors(ll n) {
vector<ll> res;
ll a = 2;
res.push_back(1);
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (n / i != i)
res.push_back(n / i);
}
}
return res;
}
struct ve {
public:
vector<ve> child;
int _t = INF;
ve(int t) : _t(t) {}
ve(ve _left, ve _right) {
_t = _left._t + _right._t;
child.push_back(_left);
child.push_back(_right);
}
bool operator<(const ve &t) const { return _t > t._t; }
};
vector<bool> elas(ll n) {
vector<bool> r(n);
fill(r.begin(), r.end(), 1);
r[0] = 0;
r[1] = 0;
for (ll i = 2; i * i < n; i++) {
if (!r[i])
continue;
ll ti = i * 2;
while (ti < n) {
r[ti] = false;
ti += i;
}
}
return r;
}
bool isPrime(ll v) {
for (ll i = 2; i * i <= v; i++) {
if (v % i == 0)
return false;
}
return true;
}
class SegTree {
public:
const static int MAX_N = 100010;
const static int DAT_SIZE = (1 << 18) - 1;
int N, Q;
int A[MAX_N];
ll data[DAT_SIZE], datb[DAT_SIZE];
void init(int _n) {
N = 1;
while (N < _n)
N <<= 1;
memset(data, 0, sizeof(data));
memset(datb, 0, sizeof(datb));
}
void init(int _n, ll iv) {
N = 1;
while (N < _n)
N <<= 1;
rep(i, DAT_SIZE) {
data[i] = iv;
datb[i] = iv;
}
}
void add(int a, int b, int x) { add(a, b + 1, x, 0, 0, N); }
void add(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] += x;
} else if (l < b && a < r) {
datb[k] += (min(b, r) - max(a, l)) * x;
add(a, b, x, k * 2 + 1, l, (l + r) / 2);
add(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
void change(int a, int b, int x) { change(a, b + 1, x, 0, 0, N); }
void change(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] = x;
} else if (l < b && a < r) {
datb[k] = x;
change(a, b, x, k * 2 + 1, l, (l + r) / 2);
change(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
ll sum(int a, int b) { return sum(a, b + 1, 0, 0, N); }
ll sum(int a, int b, int k, int l, int r) {
if (b <= l || r <= a) {
return 0;
}
if (a <= l && r <= b) {
return data[k] * (r - l) + datb[k];
}
ll res = (min(b, r) - max(a, l)) * data[k];
res += sum(a, b, k * 2 + 1, l, (l + r) / 2);
res += sum(a, b, k * 2 + 2, (l + r) / 2, r);
return res;
}
};
class Segment;
class Circle;
class Point {
public:
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
Point operator+(Point p) { return Point(x + p.x, y + p.y); }
Point operator-(Point p) { return Point(x - p.x, y - p.y); }
Point operator*(double a) { return Point(a * x, a * y); }
Point operator/(double a) { return Point(x / a, y / a); }
double abs() { return sqrt(norm()); }
double norm() { return x * x + y * y; }
bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
bool operator==(const Point &p) const {
return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
}
static double dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }
static double cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
static bool isOrthogonal(Point a, Point b) { return EQ(dot(a, b), 0.0); }
static bool isOrthogonal(Point a1, Point a2, Point b1, Point b2) {
return isOrthogonal(a1 - a2, b1 - b2);
}
static bool isOrthogonal(Segment s1, Segment s2);
static bool isPalallel(Point a, Point b) { return EQ(cross(a, b), 0.0); }
static bool isPalallel(Point a1, Point a2, Point b1, Point b2) {
return isPalallel(a1 - a2, b1 - b2);
}
static bool isPalallel(Segment s1, Segment s2);
static const int COUNTER_CLOCKWISE = 1;
static const int CLOCKWISE = -1;
static const int ONLINE_BACK = 2;
static const int ONLINE_FRONT = -2;
static const int ON_SEGMENT = 0;
static int ccw(Point p0, Point p1, Point p2) {
// 線分はp0とp1でp2がどこにあるかを探る
Point a = p1 - p0;
Point b = p2 - p0;
if (cross(a, b) > EPS)
return COUNTER_CLOCKWISE;
if (cross(a, b) < -EPS)
return CLOCKWISE;
if (dot(a, b) < -EPS)
return ONLINE_BACK;
if (a.norm() < b.norm())
return ONLINE_FRONT;
return ON_SEGMENT;
}
static bool intersect(Point p1, Point p2, Point p3, Point p4) {
return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}
static bool intersect(Segment s1, Segment s2);
static Point project(Segment s, Point p);
static Point reflect(Segment s, Point p);
static Point getDistance(Point a, Point b) { return (a - b).abs(); }
static double getDistanceLP(Segment s, Point p);
static double getDistanceSP(Segment s, Point p);
static double getDistance(Segment s1, Segment s2);
static Point getIntersection(Segment s1, Segment s2);
static pair<Point, Point> crossPoints(Circle c, Segment s);
static int contains(vector<Point> g, Point p) {
int n = g.size();
bool x = false;
rep(i, n) {
Point a = g[i] - p, b = g[(i + 1) % n] - p;
// 線の上に載っているか
if (std::abs(cross(a, b)) < EPS && dot(a, b) < EPS)
return 1;
// pを基準として上下にあるか
// または外積が正か?(→にあるか)
if (a.y > b.y)
swap(a, b);
if (a.y < EPS && EPS < b.y && cross(a, b) > EPS)
x = !x;
}
return x ? 2 : 0;
}
static vector<Point> andrewScan(vector<Point> s) {
vector<Point> u, l;
if (s.size() < 3)
return s;
sort(all(s));
u.push_back(s[0]);
u.push_back(s[1]);
l.push_back(s[s.size() - 1]);
l.push_back(s[s.size() - 2]);
for (int i = 2; i < s.size(); i++) {
for (int _n = u.size();
_n >= 2 && ccw(u[_n - 2], u[_n - 1], s[i]) > CLOCKWISE; _n--) {
u.pop_back();
}
u.push_back(s[i]);
}
for (int i = s.size() - 3; i >= 0; i--) {
for (int _n = l.size();
_n >= 2 && ccw(l[_n - 2], l[_n - 1], s[i]) > CLOCKWISE; _n--) {
l.pop_back();
}
l.push_back(s[i]);
}
reverse(all(l));
for (int i = u.size() - 2; i >= 1; i--) {
l.push_back(u[i]);
}
return l;
}
void get_cin() { cin >> x >> y; }
};
class Segment {
public:
Point p1, p2;
Segment() {}
Segment(Point p1, Point p2) : p1(p1), p2(p2) {}
void get_cin() { cin >> p1.x >> p1.y >> p2.x >> p2.y; }
Point p1tp2() { return p2 - p1; }
Point p2tp1() { return p1 - p2; }
double abs() { return std::abs(norm()); }
double norm() { return (p2 - p1).norm(); }
};
bool Point::isOrthogonal(Segment s1, Segment s2) {
return EQ(dot(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::isPalallel(Segment s1, Segment s2) {
return EQ(cross(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::intersect(Segment s1, Segment s2) {
return intersect(s1.p1, s1.p2, s2.p1, s2.p2);
}
Point Point::project(Segment s, Point p) {
Point base = s.p2 - s.p1;
double r = Point::dot(p - s.p1, base) / base.norm();
return s.p1 + base * r;
}
Point Point::reflect(Segment s, Point p) { return (project(s, p) * 2) - p; }
double Point::getDistanceLP(Segment s, Point p) {
return std::abs(cross(s.p2 - s.p1, p - s.p1) / (s.p2 - s.p1).abs());
}
double Point::getDistanceSP(Segment s, Point p) {
if (dot(s.p2 - s.p1, p - s.p1) < 0.0)
return (p - s.p1).abs();
if (dot(s.p1 - s.p2, p - s.p2) < 0.0)
return (p - s.p2).abs();
return getDistanceLP(s, p);
}
double Point::getDistance(Segment s1, Segment s2) {
if (intersect(s1, s2))
return 0.0;
return min({getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2),
getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)});
}
Point Point::getIntersection(Segment s1, Segment s2) {
// (s1.p1 - s2.p1).norm()
auto bs = s1.p2 - s1.p1;
auto n1 = s2.p1 - s1.p1;
auto n2 = s2.p2 - s1.p1;
auto c1 = std::abs(cross(n1, bs)) / bs.norm();
auto c2 = std::abs(cross(n2, bs)) / bs.norm();
return s2.p1 + (s2.p2 - s2.p1) * (c1 / (c1 + c2));
// c1:c2=t:1-t
// c2t=(1-t)c1
// t/(1-t)=c1/(c1+c2)
//
}
double arg(Point p) { return atan2(p.y, p.x); }
Point polar(double a, double r) { return Point(cos(r) * a, sin(r) * a); }
class Circle {
public:
Point c;
double r;
Circle(Point c = Point(), double r = 0.0) : c(c), r(r) {}
void get_cin() { cin >> c.x >> c.y >> r; }
static pair<Point, Point> getCrossPoints(Circle c1, Circle c2) {
double d = (c1.c - c2.c).abs(); // 中心点どうしの距離
double a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));
double t = arg(c2.c - c1.c);
return make_pair(c1.c + polar(c1.r, t + a), c1.c + polar(c1.r, t - a));
}
};
pair<Point, Point> Point::crossPoints(Circle c, Segment s) {
auto pp = project(s, c.c);
auto f = (pp - c.c).norm();
auto mu = sqrt(c.r * c.r - f);
auto e = s.p1tp2() / s.p1tp2().abs();
return make_pair(pp + e * mu, pp - e * mu);
}
ll divRm(string s, ll x) {
ll r = 0;
for (ll i = 0; i < s.size(); i++) {
r *= 10;
r += s[i] - '0';
r %= x;
}
return r;
}
ll cmbi(ll x, ll b) {
ll res = 1;
for (size_t i = 0; i < b; i++) {
res *= x - i;
res %= INF;
res *= inv[b - i];
res %= INF;
}
return res;
}
double digsum(ll x) {
ll res = 0;
while (x > 0) {
res += x % 10;
x /= 10;
}
return res;
}
bool check_parindrome(string s) {
int n = s.size();
rep(i, n / 2) {
if (s[i] != s[n - i - 1]) {
return false;
}
}
return true;
}
ll npr(ll n, ll r) {
if (r == 0)
return 1;
return inff(fac[n] * modinv(fac[n - r]));
}
vl zalgo(string s) {
ll c = 0;
vl a(s.size());
ll si = s.size();
rep2(i, 1, s.size()) {
if (i + a[i - c] < c + a[c]) {
a[i] = a[i - c];
} else {
ll j = max(0LL, a[c] - (i - c));
while (i + j < si && s[j] == s[i + j]) {
j++;
}
a[i] = j;
c = i;
}
}
a[0] = s.size();
return a;
}
string decStrNum(string s) {
ll si = s.size();
for (int i = si - 1; i >= 0; i--) {
if (s[i] == '0') {
s[i] = '9';
continue;
}
s[i] = s[i] - 1;
break;
}
return s;
}
// ここまでライブラリ
// ここからコード
vl za(string s) {
ll si = s.size();
vl a(si);
ll c = 0;
rep2(i, 1, si) {
if (i - c + a[i - c] < a[c]) {
a[i] = a[i - c];
} else {
// これだとTLEする
ll j = max(0LL, a[c] - i);
while (i + j < si && s[j] == s[i + j]) {
j++;
}
a[i] = j;
c = i;
}
}
a[0] = si;
return a;
}
void solv() {
cin >> n;
string s;
cin >> s;
ll res = 0;
rep(i, n - 1) {
auto p = za(s.substr(i));
rep(j, p.size()) {
if (p[j] == 0)
continue;
res = max(res, min(p[j], j));
}
}
cout << res << endl;
}
int main() {
COMinit();
solv();
return 0;
}
| #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <iostream>
#include <math.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, double> pld;
typedef pair<double, double> pdd;
typedef pair<double, ll> pdl;
typedef pair<int, char> pic;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef priority_queue<ll, vector<ll>, greater<ll>> llgreaterq;
typedef priority_queue<pll, vector<pll>, greater<pll>> pllgreaterq;
typedef priority_queue<pair<ll, pll>, vector<pair<ll, pll>>,
greater<pair<ll, pll>>>
plpllgreaterq;
typedef priority_queue<vi, vector<vi>, greater<vi>> vigreaterq;
typedef priority_queue<vl, vector<vl>, greater<vl>> vlgreaterq;
template <class o, class p, class q>
using tuple3q = priority_queue<tuple<o, p, q>, vector<tuple<o, p, q>>,
greater<tuple<o, p, q>>>;
template <class o, class p, class q, class r>
using tuple4q = priority_queue<tuple<o, p, q, r>, vector<tuple<o, p, q, r>>,
greater<tuple<o, p, q, r>>>;
template <class o, class p, class q, class r, class s>
using tuple5q =
priority_queue<tuple<o, p, q, r, s>, vector<tuple<o, p, q, r, s>>,
greater<tuple<o, p, q, r, s>>>;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
#define bit(x, v) ((ll)x << v)
#define rep(x, n) for (ll x = 0; x < n; x++)
#define rep2(x, f, v) for (ll x = f; x < v; x++)
#define repe(v, x) for (auto v : x)
// 許容する誤差ε
#define EPS (1e-10)
// 2つのスカラーが等しいかどうか
#define EQ(a, b) (std::abs(a - b) < EPS)
// 2つのベクトルが等しいかどうか
#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
#define all(a) a.begin(), a.end()
#define all0(a) memset(a, 0, sizeof(a))
#define allm1(a) memset(a, -1, sizeof(a))
#define put_float(v) \
cout << fixed << setprecision(10); \
cout << v << endl
#define put(v) cout << v << endl
#define vinsert(v, p, x) v.insert(v.begin() + p, x)
#define vsort(v) sort(all(v));
#define vdesc(v) \
vsort(v); \
reverse(all(v))
#define dup(v) v.erase(unique(all(v)), v.end())
#define ion(i, j) ((i & (1LL << j)) > 0)
#define next(i) \
i++; \
i %= 2
#define Len size()
#define ull unsignd long long
#define psp(a, b) push_back(make_pair(a, b))
#define psp2(a, b) push(make_pair(a, b))
#define cini(a) \
a; \
cin >> a
#define infa(a, b) (a + b) % INF
#define infm(a, b) (a * b) % INF
#define infd(a, b) (a * modinv(b)) % INF
#define infs(a, b) (a + INF - b) % INF
#define inf(a) (a) %= INF
#define inff(a) ((a) % INF)
#define No cout << "No" << endl
#define Yes cout << "Yes" << endl
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
#define smal -INF *INF
#define big INF *INF
const ll INF = 1000000007;
const int MAX = 2000010;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll getpow(ll b, ll x, ll md) {
ll t = b;
ll res = 1;
while (x > 0) {
if (x & 1) {
res *= t;
res %= md;
}
x >>= 1;
t *= t;
t %= md;
}
return res;
}
ll getpow(ll b, ll x) { return getpow(b, x, INF); }
ll modinv(ll x) { return getpow(x, INF - 2); }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
class mint {
int md = 1000000007;
public:
long long x;
mint(ll x, ll md) {
this->md = md;
this->x = (x % md + md) % md;
}
mint(long long x = 0) : x((x % md + md) % md) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= md)
x -= md;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += md - a.x) >= md)
x -= md;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= md;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(md - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
int pr[100010];
int lank[100010];
void uini(int n) {
for (size_t i = 0; i <= n; i++) {
pr[i] = i;
lank[i] = 1;
}
}
int parent(int x) {
if (x == pr[x])
return x;
return pr[x] = parent(pr[x]);
}
int same(int x, int y) { return parent(x) == parent(y); }
bool unit(int x, int y) {
int px = parent(x);
int py = parent(y);
if (px == py)
return false;
if (lank[py] < lank[px]) {
pr[py] = px;
lank[px] += lank[py];
} else {
pr[px] = py;
lank[py] += lank[px];
}
return true;
}
ll n, m;
int ci = 0;
struct Node {
int key;
int priority;
Node *parent, *left, *right;
Node(int key, int priority);
Node() {}
};
Node NIL;
Node::Node(int key, int priority) : key(key), priority(priority) {
left = &NIL;
right = &NIL;
}
Node *root = new Node();
void cenrec(Node *k) {
if (k->key == NIL.key)
return;
cenrec(k->left);
cout << " " << k->key;
cenrec(k->right);
}
void fastrec(Node *k) {
if (k->key == NIL.key)
return;
cout << " " << k->key;
fastrec(k->left);
fastrec(k->right);
}
void insert(Node *v) {
Node *y = &NIL;
Node *x = root;
while (x->key != NIL.key) {
y = x;
if (v->key < x->key) {
x = x->left;
} else {
x = x->right;
}
}
v->parent = y;
if (y->key == NIL.key) {
root = v;
} else if (v->key < y->key) {
y->left = v;
} else {
y->right = v;
}
}
Node *find(Node *k, ll v) {
if (k->key == NIL.key)
return &NIL;
if (k->key == v)
return k;
if (v < k->key)
return find(k->left, v);
return find(k->right, v);
}
void delp12(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key == NIL.key && r->key == NIL.key) {
if (pr->left == x) {
pr->left = &NIL;
} else
pr->right = &NIL;
} else if (l->key != NIL.key) {
if (pr->left == x) {
pr->left = l;
} else
pr->right = l;
l->parent = pr;
} else if (r->key != NIL.key) {
if (pr->left == x) {
pr->left = r;
} else
pr->right = r;
r->parent = pr;
}
}
Node *get_next(Node *k) {
if (k->key == NIL.key)
return &NIL;
Node *res = get_next(k->left);
if (res->key != NIL.key)
return res;
return k;
}
void del(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key != NIL.key && r->key != NIL.key) {
Node *nex = get_next(r);
x->key = nex->key;
delp12(nex);
} else {
delp12(x);
}
}
Node *rightRotate(Node *t) {
Node *s = t->left;
t->left = s->right;
s->right = t;
return s;
}
Node *leftRotate(Node *t) {
Node *s = t->right;
t->right = s->left;
s->left = t;
return s;
}
Node *_insert(Node *t, int key, int priority) {
if (t->key == NIL.key) {
return new Node(key, priority);
}
if (key == t->key) {
return t;
}
if (key < t->key) {
t->left = _insert(t->left, key, priority);
if (t->priority < t->left->priority) {
t = rightRotate(t);
}
} else {
t->right = _insert(t->right, key, priority);
if (t->priority < t->right->priority) {
t = leftRotate(t);
}
}
return t;
}
Node *delete1(Node *t, int key);
Node *_delete(Node *t, int key) {
if (t->left->key == NIL.key && t->right->key == NIL.key) {
return &NIL;
} else if (t->left->key == NIL.key) {
t = leftRotate(t);
} else if (t->right->key == NIL.key) {
t = rightRotate(t);
} else {
if (t->left->priority > t->right->priority) {
t = rightRotate(t);
} else
t = leftRotate(t);
}
return delete1(t, key);
}
Node *delete1(Node *t, int key) {
if (t->key == NIL.key) {
return &NIL;
}
if (key < t->key) {
t->left = delete1(t->left, key);
} else if (key > t->key) {
t->right = delete1(t->right, key);
} else
return _delete(t, key);
return t;
}
int H;
int left(int i) { return i * 2 + 1; }
int right(int i) { return i * 2 + 2; }
class edge {
public:
int from, to, i;
ll val;
edge() {}
edge(ll to) : to(to) {}
edge(ll to, ll i) : to(to), i(i) {}
edge(ll from, ll to, ll val) : from(from), to(to), val(val) {}
};
class LCA {
private:
vector<vector<edge>> v;
vector<vector<int>> parent;
vector<int> depth;
void dfs(int n, int m, int d) {
parent[0][n] = m;
depth[n] = d;
for (auto x : v[n]) {
if (x.to != m)
dfs(x.to, n, d + 1);
}
}
public:
LCA(ll N, ll root, vector<vector<edge>> &tree) {
v = tree;
parent = vector<vector<int>>(21, vector<int>(N + 1, 0));
depth = vector<int>(N + 1, 0);
dfs(root, -1, 0);
for (int j = 0; j + 1 < 20; j++) {
for (int i = 1; i <= N; i++) {
if (parent[j][i] < 0)
parent[j + 1][i] = -1;
else
parent[j + 1][i] = parent[j][parent[j][i]];
}
}
}
int lca(int n, int m) {
if (depth[n] > depth[m])
swap(n, m);
for (int j = 0; j < 20; j++) {
if ((depth[m] - depth[n]) >> j & 1)
m = parent[j][m];
}
if (n == m)
return n;
for (int j = 19; j >= 0; j--) {
if (parent[j][n] != parent[j][m]) {
n = parent[j][n];
m = parent[j][m];
}
}
return parent[0][n];
}
int dep(int n) { return depth[n]; }
};
ll k;
int _rank[1010];
int temp[1010];
bool compare_sa(int i, int j) {
if (_rank[i] != _rank[j])
return _rank[i] < _rank[j];
else {
int ri = i + k <= n ? _rank[i + k] : -1;
int rj = j + k <= n ? _rank[j + k] : -1;
return ri < rj;
}
}
void construct_sa(string S, int *sa) {
n = S.length();
for (size_t i = 0; i <= n; i++) {
sa[i] = i;
_rank[i] = i < n ? S[i] : -1;
}
for (k = 1; k <= n; k *= 2) {
sort(sa, sa + n + 1, compare_sa);
// saはソート後の接尾辞の並びになっている、rankは元の位置のindexを保持したまま、更新されている。
// ピンとこなかった部分
temp[sa[0]] = 0;
for (size_t i = 1; i <= n; i++) {
temp[sa[i]] = temp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);
}
for (size_t i = 0; i <= n; i++) {
_rank[i] = temp[i];
}
}
}
bool contain(string S, int *sa, string T) {
int a = 0, b = S.length();
// sa は 接尾辞が辞書順に並んでいる、入っているのはその位置のインデックス
while (b - a > 1) {
int c = (a + b) / 2;
if (S.compare(sa[c], T.length(), T) < 0)
a = c;
else
b = c;
}
return S.compare(sa[b], T.length(), T) == 0;
}
#define bit(x, v) ((ll)x << v)
class BIT {
static const int MAX_N = 500010;
public:
BIT() { memset(bit, 0, sizeof(bit)); }
ll bit[MAX_N + 1], n;
ll sum(int i) {
ll s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
};
struct UnionFind {
vector<int> A;
UnionFind(int n) : A(n, -1) {}
int find(int x) {
if (A[x] < 0)
return x;
return A[x] = find(A[x]);
}
void unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return;
if (A[x] > A[y])
swap(x, y);
A[x] += A[y];
A[y] = x;
}
int ngroups() {
int ans = 0;
for (auto a : A)
if (a < 0)
ans++;
return ans;
}
};
vector<ll> getp(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
res.push_back(2);
while (n % 2 == 0)
n /= 2;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(i);
while (n % i == 0)
n /= i;
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<ll> getp2(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
while (n % 2 == 0) {
n /= 2;
res.push_back(2);
}
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
while (n % i == 0) {
n /= i;
res.push_back(i);
}
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<pll> getp3(ll n) {
vector<pll> res;
ll a = 2;
int si = 0;
if (n % 2 == 0) {
res.push_back(make_pair(2, 0));
while (n % 2 == 0) {
n /= 2;
res[si].second++;
}
si++;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(make_pair(i, 0));
while (n % i == 0) {
n /= i;
res[si].second++;
}
si++;
}
}
if (n != 1) {
res.push_back(make_pair(n, 1));
}
return res;
}
vector<ll> getDivisors(ll n) {
vector<ll> res;
ll a = 2;
res.push_back(1);
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (n / i != i)
res.push_back(n / i);
}
}
return res;
}
struct ve {
public:
vector<ve> child;
int _t = INF;
ve(int t) : _t(t) {}
ve(ve _left, ve _right) {
_t = _left._t + _right._t;
child.push_back(_left);
child.push_back(_right);
}
bool operator<(const ve &t) const { return _t > t._t; }
};
vector<bool> elas(ll n) {
vector<bool> r(n);
fill(r.begin(), r.end(), 1);
r[0] = 0;
r[1] = 0;
for (ll i = 2; i * i < n; i++) {
if (!r[i])
continue;
ll ti = i * 2;
while (ti < n) {
r[ti] = false;
ti += i;
}
}
return r;
}
bool isPrime(ll v) {
for (ll i = 2; i * i <= v; i++) {
if (v % i == 0)
return false;
}
return true;
}
class SegTree {
public:
const static int MAX_N = 100010;
const static int DAT_SIZE = (1 << 18) - 1;
int N, Q;
int A[MAX_N];
ll data[DAT_SIZE], datb[DAT_SIZE];
void init(int _n) {
N = 1;
while (N < _n)
N <<= 1;
memset(data, 0, sizeof(data));
memset(datb, 0, sizeof(datb));
}
void init(int _n, ll iv) {
N = 1;
while (N < _n)
N <<= 1;
rep(i, DAT_SIZE) {
data[i] = iv;
datb[i] = iv;
}
}
void add(int a, int b, int x) { add(a, b + 1, x, 0, 0, N); }
void add(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] += x;
} else if (l < b && a < r) {
datb[k] += (min(b, r) - max(a, l)) * x;
add(a, b, x, k * 2 + 1, l, (l + r) / 2);
add(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
void change(int a, int b, int x) { change(a, b + 1, x, 0, 0, N); }
void change(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] = x;
} else if (l < b && a < r) {
datb[k] = x;
change(a, b, x, k * 2 + 1, l, (l + r) / 2);
change(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
ll sum(int a, int b) { return sum(a, b + 1, 0, 0, N); }
ll sum(int a, int b, int k, int l, int r) {
if (b <= l || r <= a) {
return 0;
}
if (a <= l && r <= b) {
return data[k] * (r - l) + datb[k];
}
ll res = (min(b, r) - max(a, l)) * data[k];
res += sum(a, b, k * 2 + 1, l, (l + r) / 2);
res += sum(a, b, k * 2 + 2, (l + r) / 2, r);
return res;
}
};
class Segment;
class Circle;
class Point {
public:
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
Point operator+(Point p) { return Point(x + p.x, y + p.y); }
Point operator-(Point p) { return Point(x - p.x, y - p.y); }
Point operator*(double a) { return Point(a * x, a * y); }
Point operator/(double a) { return Point(x / a, y / a); }
double abs() { return sqrt(norm()); }
double norm() { return x * x + y * y; }
bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
bool operator==(const Point &p) const {
return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
}
static double dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }
static double cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
static bool isOrthogonal(Point a, Point b) { return EQ(dot(a, b), 0.0); }
static bool isOrthogonal(Point a1, Point a2, Point b1, Point b2) {
return isOrthogonal(a1 - a2, b1 - b2);
}
static bool isOrthogonal(Segment s1, Segment s2);
static bool isPalallel(Point a, Point b) { return EQ(cross(a, b), 0.0); }
static bool isPalallel(Point a1, Point a2, Point b1, Point b2) {
return isPalallel(a1 - a2, b1 - b2);
}
static bool isPalallel(Segment s1, Segment s2);
static const int COUNTER_CLOCKWISE = 1;
static const int CLOCKWISE = -1;
static const int ONLINE_BACK = 2;
static const int ONLINE_FRONT = -2;
static const int ON_SEGMENT = 0;
static int ccw(Point p0, Point p1, Point p2) {
// 線分はp0とp1でp2がどこにあるかを探る
Point a = p1 - p0;
Point b = p2 - p0;
if (cross(a, b) > EPS)
return COUNTER_CLOCKWISE;
if (cross(a, b) < -EPS)
return CLOCKWISE;
if (dot(a, b) < -EPS)
return ONLINE_BACK;
if (a.norm() < b.norm())
return ONLINE_FRONT;
return ON_SEGMENT;
}
static bool intersect(Point p1, Point p2, Point p3, Point p4) {
return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}
static bool intersect(Segment s1, Segment s2);
static Point project(Segment s, Point p);
static Point reflect(Segment s, Point p);
static Point getDistance(Point a, Point b) { return (a - b).abs(); }
static double getDistanceLP(Segment s, Point p);
static double getDistanceSP(Segment s, Point p);
static double getDistance(Segment s1, Segment s2);
static Point getIntersection(Segment s1, Segment s2);
static pair<Point, Point> crossPoints(Circle c, Segment s);
static int contains(vector<Point> g, Point p) {
int n = g.size();
bool x = false;
rep(i, n) {
Point a = g[i] - p, b = g[(i + 1) % n] - p;
// 線の上に載っているか
if (std::abs(cross(a, b)) < EPS && dot(a, b) < EPS)
return 1;
// pを基準として上下にあるか
// または外積が正か?(→にあるか)
if (a.y > b.y)
swap(a, b);
if (a.y < EPS && EPS < b.y && cross(a, b) > EPS)
x = !x;
}
return x ? 2 : 0;
}
static vector<Point> andrewScan(vector<Point> s) {
vector<Point> u, l;
if (s.size() < 3)
return s;
sort(all(s));
u.push_back(s[0]);
u.push_back(s[1]);
l.push_back(s[s.size() - 1]);
l.push_back(s[s.size() - 2]);
for (int i = 2; i < s.size(); i++) {
for (int _n = u.size();
_n >= 2 && ccw(u[_n - 2], u[_n - 1], s[i]) > CLOCKWISE; _n--) {
u.pop_back();
}
u.push_back(s[i]);
}
for (int i = s.size() - 3; i >= 0; i--) {
for (int _n = l.size();
_n >= 2 && ccw(l[_n - 2], l[_n - 1], s[i]) > CLOCKWISE; _n--) {
l.pop_back();
}
l.push_back(s[i]);
}
reverse(all(l));
for (int i = u.size() - 2; i >= 1; i--) {
l.push_back(u[i]);
}
return l;
}
void get_cin() { cin >> x >> y; }
};
class Segment {
public:
Point p1, p2;
Segment() {}
Segment(Point p1, Point p2) : p1(p1), p2(p2) {}
void get_cin() { cin >> p1.x >> p1.y >> p2.x >> p2.y; }
Point p1tp2() { return p2 - p1; }
Point p2tp1() { return p1 - p2; }
double abs() { return std::abs(norm()); }
double norm() { return (p2 - p1).norm(); }
};
bool Point::isOrthogonal(Segment s1, Segment s2) {
return EQ(dot(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::isPalallel(Segment s1, Segment s2) {
return EQ(cross(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::intersect(Segment s1, Segment s2) {
return intersect(s1.p1, s1.p2, s2.p1, s2.p2);
}
Point Point::project(Segment s, Point p) {
Point base = s.p2 - s.p1;
double r = Point::dot(p - s.p1, base) / base.norm();
return s.p1 + base * r;
}
Point Point::reflect(Segment s, Point p) { return (project(s, p) * 2) - p; }
double Point::getDistanceLP(Segment s, Point p) {
return std::abs(cross(s.p2 - s.p1, p - s.p1) / (s.p2 - s.p1).abs());
}
double Point::getDistanceSP(Segment s, Point p) {
if (dot(s.p2 - s.p1, p - s.p1) < 0.0)
return (p - s.p1).abs();
if (dot(s.p1 - s.p2, p - s.p2) < 0.0)
return (p - s.p2).abs();
return getDistanceLP(s, p);
}
double Point::getDistance(Segment s1, Segment s2) {
if (intersect(s1, s2))
return 0.0;
return min({getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2),
getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)});
}
Point Point::getIntersection(Segment s1, Segment s2) {
// (s1.p1 - s2.p1).norm()
auto bs = s1.p2 - s1.p1;
auto n1 = s2.p1 - s1.p1;
auto n2 = s2.p2 - s1.p1;
auto c1 = std::abs(cross(n1, bs)) / bs.norm();
auto c2 = std::abs(cross(n2, bs)) / bs.norm();
return s2.p1 + (s2.p2 - s2.p1) * (c1 / (c1 + c2));
// c1:c2=t:1-t
// c2t=(1-t)c1
// t/(1-t)=c1/(c1+c2)
//
}
double arg(Point p) { return atan2(p.y, p.x); }
Point polar(double a, double r) { return Point(cos(r) * a, sin(r) * a); }
class Circle {
public:
Point c;
double r;
Circle(Point c = Point(), double r = 0.0) : c(c), r(r) {}
void get_cin() { cin >> c.x >> c.y >> r; }
static pair<Point, Point> getCrossPoints(Circle c1, Circle c2) {
double d = (c1.c - c2.c).abs(); // 中心点どうしの距離
double a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));
double t = arg(c2.c - c1.c);
return make_pair(c1.c + polar(c1.r, t + a), c1.c + polar(c1.r, t - a));
}
};
pair<Point, Point> Point::crossPoints(Circle c, Segment s) {
auto pp = project(s, c.c);
auto f = (pp - c.c).norm();
auto mu = sqrt(c.r * c.r - f);
auto e = s.p1tp2() / s.p1tp2().abs();
return make_pair(pp + e * mu, pp - e * mu);
}
ll divRm(string s, ll x) {
ll r = 0;
for (ll i = 0; i < s.size(); i++) {
r *= 10;
r += s[i] - '0';
r %= x;
}
return r;
}
ll cmbi(ll x, ll b) {
ll res = 1;
for (size_t i = 0; i < b; i++) {
res *= x - i;
res %= INF;
res *= inv[b - i];
res %= INF;
}
return res;
}
double digsum(ll x) {
ll res = 0;
while (x > 0) {
res += x % 10;
x /= 10;
}
return res;
}
bool check_parindrome(string s) {
int n = s.size();
rep(i, n / 2) {
if (s[i] != s[n - i - 1]) {
return false;
}
}
return true;
}
ll npr(ll n, ll r) {
if (r == 0)
return 1;
return inff(fac[n] * modinv(fac[n - r]));
}
vl zalgo(string s) {
ll c = 0;
vl a(s.size());
ll si = s.size();
rep2(i, 1, s.size()) {
if (i + a[i - c] < c + a[c]) {
a[i] = a[i - c];
} else {
ll j = max(0LL, a[c] - (i - c));
while (i + j < si && s[j] == s[i + j]) {
j++;
}
a[i] = j;
c = i;
}
}
a[0] = s.size();
return a;
}
string decStrNum(string s) {
ll si = s.size();
for (int i = si - 1; i >= 0; i--) {
if (s[i] == '0') {
s[i] = '9';
continue;
}
s[i] = s[i] - 1;
break;
}
return s;
}
// ここまでライブラリ
// ここからコード
vl za(string s) {
ll si = s.size();
vl a(si);
ll c = 0;
rep2(i, 1, si) {
if (i - c + a[i - c] < a[c]) {
a[i] = a[i - c];
} else {
// これだとTLEする
ll j = max(0LL, c + a[c] - i);
while (i + j < si && s[j] == s[i + j]) {
j++;
}
a[i] = j;
c = i;
}
}
a[0] = si;
return a;
}
void solv() {
cin >> n;
string s;
cin >> s;
ll res = 0;
rep(i, n - 1) {
auto p = za(s.substr(i));
rep(j, p.size()) {
if (p[j] == 0)
continue;
res = max(res, min(p[j], j));
}
}
cout << res << endl;
}
int main() {
COMinit();
solv();
return 0;
}
| replace | 1,066 | 1,067 | 1,066 | 1,067 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define FORIN(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1 << 29)
#define LLINF (1LL << 60)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
using Pi = pair<int, int>;
using ll = long long;
string to_string(string s) { return s; }
template <class S> string to_string(unordered_set<S> s);
template <class S> string to_string(set<S> s);
template <class S, class T> string to_string(map<S, T> m);
template <class T> string to_string(vector<T> v);
template <class S, class T> string to_string(pair<S, T> p) {
return "{" + to_string(p.first) + "," + to_string(p.second) + "}";
}
template <class S> string to_string(unordered_set<S> s) {
string ret = "{";
for (S x : s)
ret += to_string(x) + ",";
return ret + "}";
}
template <class S> string to_string(set<S> s) {
string ret = "{";
for (S x : s)
ret += to_string(x) + ",";
return ret + "}";
}
template <class S, class T> string to_string(map<S, T> m) {
string ret = "{";
for (pair<S, T> x : m)
ret += to_string(x) + ",";
return ret + "}";
}
template <class T> string to_string(vector<T> v) {
string ret = "{";
for (int i = 0; i < (int)v.size() - 1; ++i) {
ret += to_string(v[i]) + ",";
}
if (v.size() > 0) {
ret += to_string(v.back());
}
ret += "}";
return ret;
}
void debug() { cerr << endl; }
template <class Head, class... Tail> void debug(Head head, Tail... tail) {
cerr << to_string(head) << " ";
debug(tail...);
}
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head head, Tail... tail) {
cout << to_string(head);
print(tail...);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int N;
cin >> N;
string S;
cin >> S;
int ans = 0;
for (int i = 0; i < N - 1; ++i) {
for (int j = i + 1; j < N; ++j) {
for (int k = 0; i + k < j && S[i + k] == S[j + k]; ++k)
ans = max(ans, k + 1);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define FORIN(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define MOD 1000000007
#define INF (1 << 29)
#define LLINF (1LL << 60)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
using Pi = pair<int, int>;
using ll = long long;
string to_string(string s) { return s; }
template <class S> string to_string(unordered_set<S> s);
template <class S> string to_string(set<S> s);
template <class S, class T> string to_string(map<S, T> m);
template <class T> string to_string(vector<T> v);
template <class S, class T> string to_string(pair<S, T> p) {
return "{" + to_string(p.first) + "," + to_string(p.second) + "}";
}
template <class S> string to_string(unordered_set<S> s) {
string ret = "{";
for (S x : s)
ret += to_string(x) + ",";
return ret + "}";
}
template <class S> string to_string(set<S> s) {
string ret = "{";
for (S x : s)
ret += to_string(x) + ",";
return ret + "}";
}
template <class S, class T> string to_string(map<S, T> m) {
string ret = "{";
for (pair<S, T> x : m)
ret += to_string(x) + ",";
return ret + "}";
}
template <class T> string to_string(vector<T> v) {
string ret = "{";
for (int i = 0; i < (int)v.size() - 1; ++i) {
ret += to_string(v[i]) + ",";
}
if (v.size() > 0) {
ret += to_string(v.back());
}
ret += "}";
return ret;
}
void debug() { cerr << endl; }
template <class Head, class... Tail> void debug(Head head, Tail... tail) {
cerr << to_string(head) << " ";
debug(tail...);
}
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head head, Tail... tail) {
cout << to_string(head);
print(tail...);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int N;
cin >> N;
string S;
cin >> S;
int ans = 0;
for (int k = 1; k < N - 1; ++k) {
int tmp = 0;
for (int i = 0; i + k < N; ++i) {
if (S[i] == S[i + k])
tmp++;
else
tmp = 0;
ans = max(ans, min(tmp, k));
}
}
cout << ans << endl;
return 0;
} | replace | 80 | 84 | 80 | 88 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef pair<ii, int> ri3;
#define mp make_pair
#define pb push_back
#define fi first
#define sc second
#define SZ(x) (int)(x).size()
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define RFOR(i, a, b) for (int i = a; i >= b; --i)
vector<int> zFunc(string s) {
int n = (int)s.length();
vector<int> z(n, 0);
for (int i = 0, l = 0, r = 0; i < n; ++i) {
if (i <= r)
z[i] = min(r - i + 1, z[i - l]);
while (i + z[i] < n and s[z[i]] == s[i + z[i]])
++z[i];
if (i + z[i] - 1 > r)
l = i, r = i + z[i] - 1;
}
return z;
}
int main() {
// freopen("in.txt", "r", stdin);
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
string S;
cin >> S;
string T = "";
int ans = 0;
FOR(i, 0, N - 1) {
T = S[N - 1 - i] + T;
vector<int> z = zFunc(T);
FOR(j, 0, (int)T.length() - 1) ans = max(ans, min(j, z[j]));
}
cout << ans << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef pair<ii, int> ri3;
#define mp make_pair
#define pb push_back
#define fi first
#define sc second
#define SZ(x) (int)(x).size()
#define ALL(x) begin(x), end(x)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define RFOR(i, a, b) for (int i = a; i >= b; --i)
vector<int> zFunc(string s) {
int n = (int)s.length();
vector<int> z(n, 0);
for (int i = 1, l = 0, r = 0; i < n; ++i) {
if (i <= r)
z[i] = min(r - i + 1, z[i - l]);
while (i + z[i] < n and s[z[i]] == s[i + z[i]])
++z[i];
if (i + z[i] - 1 > r)
l = i, r = i + z[i] - 1;
}
return z;
}
int main() {
// freopen("in.txt", "r", stdin);
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
string S;
cin >> S;
string T = "";
int ans = 0;
FOR(i, 0, N - 1) {
T = S[N - 1 - i] + T;
vector<int> z = zFunc(T);
FOR(j, 0, (int)T.length() - 1) ans = max(ans, min(j, z[j]));
}
cout << ans << '\n';
}
| replace | 21 | 22 | 21 | 22 | TLE | |
p02913 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
const int MAXN = 5005;
int M[MAXN][MAXN];
int main() {
std::ios_base::sync_with_stdio(0);
int n;
std::string s;
std::cin >> n >> s;
int result = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
if (s[i] == s[j]) {
M[i][j] = std::min(M[i - 1][j - 1] + 1, j - i);
result = std::max(result, M[i][j]);
}
}
}
std::cout << result;
return 0;
} | #include <algorithm>
#include <iostream>
const int MAXN = 5005;
int M[MAXN][MAXN];
int main() {
std::ios_base::sync_with_stdio(0);
int n;
std::string s;
std::cin >> n >> s;
int result = 0;
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
if (s[i] == s[j]) {
if (i == 0 || j == 0)
M[i][j] = 1;
else
M[i][j] = std::min(M[i - 1][j - 1] + 1, j - i);
result = std::max(result, M[i][j]);
}
}
}
std::cout << result;
return 0;
} | replace | 16 | 17 | 16 | 20 | 127 | /tmp/c92a5eae-e661-47b3-bdce-682002154420.out: error while loading shared libraries: libc.so.6: failed to map segment from shared object
|
p02913 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int N;
string S;
cin >> N >> S;
int ans = 0;
rep(i, N) {
string s;
for (int j = i; j < N - 1; j++) {
s += S[j];
int is = S.find(s, j + 1);
if (is != string::npos)
chmax(ans, (int)s.size());
else
break;
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
int main() {
int N;
string S;
cin >> N >> S;
int ans = 0;
for (int i = 1; i < N; i++) { // 2つの部分文字列の開始位置j,j+iの距離
int cnt = 0;
rep(j, N - i) {
if (cnt < i && S[j] == S[j + i]) {
cnt++;
chmax(ans, cnt);
} else
cnt = 0;
}
}
cout << ans << endl;
return 0;
} | replace | 38 | 47 | 38 | 46 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int z[5001];
int res = 0;
int n;
string s;
void solve() {
for (int i = 0; i < n; i++)
z[i] = 0;
int l = 0, r = 0;
for (int i = 0; i < n; i++) {
if (i <= r) {
z[i] = min(r - i + 1, z[i - l]);
}
while (i + z[i] < n && s[z[i]] == s[i + z[i]])
z[i]++;
if (i + z[i] - 1 > r)
l = i, r = i + z[i] - 1;
}
for (int i = 1; i < n; i++) {
res = max(res, min(i, z[i]));
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
cin >> s;
while (n > 0) {
solve();
n--;
for (int i = 0; i < n; i++)
s[i] = s[i + 1];
}
cout << res;
}
| #include <bits/stdc++.h>
using namespace std;
int z[5001];
int res = 0;
int n;
string s;
void solve() {
for (int i = 0; i < n; i++)
z[i] = 0;
int l = 0, r = 0;
for (int i = 1; i < n; i++) {
if (i <= r) {
z[i] = min(r - i + 1, z[i - l]);
}
while (i + z[i] < n && s[z[i]] == s[i + z[i]])
z[i]++;
if (i + z[i] - 1 > r)
l = i, r = i + z[i] - 1;
}
for (int i = 1; i < n; i++) {
res = max(res, min(i, z[i]));
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
cin >> s;
while (n > 0) {
solve();
n--;
for (int i = 0; i < n; i++)
s[i] = s[i + 1];
}
cout << res;
}
| replace | 12 | 13 | 12 | 13 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define mod 1000000007ll
// #define mod 998244353ll
#define flagcount __builtin_popcount
#define flag(x) (1ll << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1ll << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define idx_lower(v, x) \
(distance(v.begin(), low2way(v, x))) // 配列vでx未満の要素数を返す
#define idx_upper(v, x) \
(distance(v.begin(), high2way(v, x))) // 配列vでx以下の要素数を返す
#define idx_lower2(v, x) \
(v.size() - idx_lower(v, x)) // 配列vでx以上の要素数を返す
#define idx_upper2(v, x) \
(v.size() - idx_upper(v, x)) // 配列vでxより大きい要素の数を返す
#define putout(a) cout << a << endl
#define Sum(v) accumulate(all(v), 0ll)
#define gcd(x, y) __gcd(x, y)
ll ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return -1;
}
template <typename T> T lcm(T x, T y) {
T z = gcd(x, y);
return x * y / z;
}
template <typename T> bool primejudge(T n) {
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
double sqrtn = sqrt(n);
for (T i = 3; i < sqrtn + 1; i++) {
if (n % i == 0) {
return false;
}
i++;
}
return true;
}
// 場合によって使い分ける
// const ll dx[4]={1,0,-1,0};
// const ll dy[4]={0,1,0,-1};
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
// 2次元配列の宣言
// vector<vector<ll>> field(h, vector<ll>(w));
// SとS.substr(i,|S|-i)(i=0~|S|-1)の最長共通接頭辞の長さを格納した配列を返す
vector<long long> Z_algorithm(string S) {
long long siz = S.size();
vector<long long> ret(siz);
long long pre = 0;
for (long long i = 1; i < siz; i++) {
// 計算済みの最大共通接頭辞に完全に覆われる
if (i + ret[i - pre] < pre + ret[pre])
ret[i] = ret[i - pre];
// はみ出すorそもそもかぶらない場合
else {
// 覆われている部分の長さ(かぶらない場合は0)
long long j = max(0ll, pre + ret[pre] - i);
// 愚直にチェック
while ((i + j) < siz && S[j] == S[i + j])
j++;
ret[i] = j;
}
}
// 先頭はイレギュラーなので別に求める
ret[0] = siz;
return ret;
}
int main() {
cout << fixed << setprecision(30);
ll N;
string S;
cin >> N >> S;
ll ans = 0;
loop(i, N) {
string SS = S.substr(i, N - i);
vector<ll> check = Z_algorithm(SS);
ll siz = check.size();
loop(j, siz) {
if (check[j] <= j)
ans = max(ans, check[j]);
}
}
putout(ans);
return 0;
}
| #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using vec = vector<ll>;
using vect = vector<double>;
using Graph = vector<vector<ll>>;
#define loop(i, n) for (ll i = 0; i < n; i++)
#define Loop(i, m, n) for (ll i = m; i < n; i++)
#define pool(i, n) for (ll i = n; i >= 0; i--)
#define Pool(i, m, n) for (ll i = n; i >= m; i--)
#define mod 1000000007ll
// #define mod 998244353ll
#define flagcount __builtin_popcount
#define flag(x) (1ll << x)
#define flagadd(bit, x) bit |= flag(x)
#define flagpop(bit, x) bit &= ~flag(x)
#define flagon(bit, i) bit &flag(i)
#define flagoff(bit, i) !(bit & (1ll << i))
#define all(v) v.begin(), v.end()
#define low2way(v, x) lower_bound(all(v), x)
#define high2way(v, x) upper_bound(all(v), x)
#define idx_lower(v, x) \
(distance(v.begin(), low2way(v, x))) // 配列vでx未満の要素数を返す
#define idx_upper(v, x) \
(distance(v.begin(), high2way(v, x))) // 配列vでx以下の要素数を返す
#define idx_lower2(v, x) \
(v.size() - idx_lower(v, x)) // 配列vでx以上の要素数を返す
#define idx_upper2(v, x) \
(v.size() - idx_upper(v, x)) // 配列vでxより大きい要素の数を返す
#define putout(a) cout << a << endl
#define Sum(v) accumulate(all(v), 0ll)
#define gcd(x, y) __gcd(x, y)
ll ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return -1;
}
template <typename T> T lcm(T x, T y) {
T z = gcd(x, y);
return x * y / z;
}
template <typename T> bool primejudge(T n) {
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
double sqrtn = sqrt(n);
for (T i = 3; i < sqrtn + 1; i++) {
if (n % i == 0) {
return false;
}
i++;
}
return true;
}
// 場合によって使い分ける
// const ll dx[4]={1,0,-1,0};
// const ll dy[4]={0,1,0,-1};
const ll dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
// 2次元配列の宣言
// vector<vector<ll>> field(h, vector<ll>(w));
// SとS.substr(i,|S|-i)(i=0~|S|-1)の最長共通接頭辞の長さを格納した配列を返す
vector<long long> Z_algorithm(string S) {
long long siz = S.size();
vector<long long> ret(siz);
long long pre = 0;
for (long long i = 1; i < siz; i++) {
// 計算済みの最大共通接頭辞に完全に覆われる
if (i + ret[i - pre] < pre + ret[pre])
ret[i] = ret[i - pre];
// はみ出すorそもそもかぶらない場合
else {
// 覆われている部分の長さ(かぶらない場合は0)
long long j = max(0ll, pre + ret[pre] - i);
// 愚直にチェック
while ((i + j) < siz && S[j] == S[i + j])
j++;
ret[i] = j;
// 鋳型となる最大共通接頭辞を変更する
pre = i;
}
}
// 先頭はイレギュラーなので別に求める
ret[0] = siz;
return ret;
}
int main() {
cout << fixed << setprecision(30);
ll N;
string S;
cin >> N >> S;
ll ans = 0;
loop(i, N) {
string SS = S.substr(i, N - i);
vector<ll> check = Z_algorithm(SS);
ll siz = check.size();
loop(j, siz) {
if (check[j] <= j)
ans = max(ans, check[j]);
}
}
putout(ans);
return 0;
}
| insert | 83 | 83 | 83 | 85 | TLE | |
p02913 | C++ | Runtime Error | #include <bits/stdc++.h>
#define loop(n, i) for (int i = 0; i < n; i++)
#define loop1(n, i) for (int i = 1; i <= n; i++)
#define rloop(n, i) for (int i = n; i; i++)
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
const long long mod1 = 999999937LL, mod2 = 1000000007LL, base = 9973;
int main() {
int n;
cin >> n;
string S;
cin >> S;
V<ll> hash1(n), hash2(n);
loop(n, i) {
hash1[i] = S[i];
hash2[i] = S[i];
}
int l = 0, r = n;
while (r - l > 1) {
int i = (l + r) / 2;
int found = 0;
unordered_set<ll> set1, set2;
ll pow1 = 1, pow2 = 1;
loop(i, j) {
pow1 = (pow1 * base) % mod1;
pow2 = (pow2 * base) % mod2;
}
hash1[0] = S[0] % mod1;
hash2[0] = S[0] % mod2;
loop1(n, j) {
hash1[j] = (hash1[j - 1] * base + S[j]) % mod1;
hash2[j] = (hash2[j - 1] * base + S[j]) % mod2;
if (j - i >= 0) {
hash1[j] -= (S[j - i] * pow1) % mod1;
hash1[j] = (hash1[j] + mod1) % mod1;
hash2[j] -= (S[j - i] * pow2) % mod2;
hash2[j] = (hash2[j] + mod2) % mod2;
}
}
for (int j = i; j < n; j++) {
set1.insert(hash1[j - i]);
set2.insert(hash2[j - i]);
if (set1.find(hash1[j]) != set1.end() &&
set2.find(hash2[j]) != set2.end()) {
found = 1;
}
}
if (found)
l = i;
else
r = i;
}
cout << l << endl;
return 0;
}
| #include <bits/stdc++.h>
#define loop(n, i) for (int i = 0; i < n; i++)
#define loop1(n, i) for (int i = 1; i <= n; i++)
#define rloop(n, i) for (int i = n; i; i++)
#define HERE cout << "HERE: " << __LINE__ << endl;
#define INSP(v) cout << v << " at " << __LINE__ << endl;
using namespace std;
using ll = long long;
template <class T> using V = vector<T>;
const long long mod1 = 999999937LL, mod2 = 1000000007LL, base = 9973;
int main() {
int n;
cin >> n;
string S;
cin >> S;
V<ll> hash1(n), hash2(n);
loop(n, i) {
hash1[i] = S[i];
hash2[i] = S[i];
}
int l = 0, r = n;
while (r - l > 1) {
int i = (l + r) / 2;
int found = 0;
unordered_set<ll> set1, set2;
ll pow1 = 1, pow2 = 1;
loop(i, j) {
pow1 = (pow1 * base) % mod1;
pow2 = (pow2 * base) % mod2;
}
hash1[0] = S[0] % mod1;
hash2[0] = S[0] % mod2;
loop1(n - 1, j) {
hash1[j] = (hash1[j - 1] * base + S[j]) % mod1;
hash2[j] = (hash2[j - 1] * base + S[j]) % mod2;
if (j - i >= 0) {
hash1[j] -= (S[j - i] * pow1) % mod1;
hash1[j] = (hash1[j] + mod1) % mod1;
hash2[j] -= (S[j - i] * pow2) % mod2;
hash2[j] = (hash2[j] + mod2) % mod2;
}
}
for (int j = i; j < n; j++) {
set1.insert(hash1[j - i]);
set2.insert(hash2[j - i]);
if (set1.find(hash1[j]) != set1.end() &&
set2.find(hash2[j]) != set2.end()) {
found = 1;
}
}
if (found)
l = i;
else
r = i;
}
cout << l << endl;
return 0;
}
| replace | 36 | 37 | 36 | 37 | -6 | malloc(): corrupted top size
|
p02913 | C++ | Time Limit Exceeded | /*!enjoy karo yaar!*/
// CF,CC,AtC,SPOJ: hp1999
// HE: hemant269
// HR: hemant2132
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define fast() \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define all(x) begin(x), end(x)
#define rz(x) resize(x)
#define asn(x, y) assign(x, y)
#define mem(a, b) memset(a, b, sizeof(a))
#define sz(x) ((int)(x.size()))
#define eb emplace_back
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define ins insert
#define vi vector<int>
#define pii pair<int, int>
#define mii map<int, int>
#define F first
#define S second
#define makep make_pair
#define maket make_tuple
#define remax(a, b) a = max(a, b)
#define remin(a, b) a = min(a, b)
#define bitcount(x) __builtin_popcountll(x)
#define iceil(n, x) (((n) + (x)-1) / (x))
#define gcd(a, b) (__gcd((a), (b)))
#define lcm(a, b) ((a) * ((b) / gcd((a), (b))))
#define dbug(x) cout << #x << ": " << (x) << "\n"
#define flush fflush(stdout)
#define show(x) \
for (auto zz : x) \
cout << zz << " "; \
cout << "\n";
#define show2(x) \
for (auto zz : x) \
cout << zz.F << " " << zz.S << "\n";
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
const ld pi = acos(-1);
const ll inf = 1e18, M = 1e9 + 7;
const int N = 1;
vi Hash;
int n;
string s;
int pw(int x, int n, int mod = M) {
int res = 1;
x %= mod;
for (; n; n /= 2) {
if (n % 2)
res = (res * x) % mod;
x = (x * x) % mod;
}
return res;
}
int mul(int a, int b, int mod) {
int res = (a * b) % mod;
return res;
}
int prm = 131, mod = 1000000007;
vector<int> pows, invpows;
void pow_init(int n) {
pows.rz(n);
pows[0] = 1;
for (int i = 1; i < n; ++i)
pows[i] = (pows[i - 1] * prm) % mod;
invpows.rz(n);
invpows[n - 1] = pw(pows[n - 1], mod - 2);
for (int i = n - 2; i >= 0; --i)
invpows[i] = (invpows[i + 1] * prm) % mod;
}
void hashit(string str) {
int len = str.length();
int hsh = 0;
Hash.rz(n);
for (int i = 0; i < len; ++i) {
hsh = (hsh + mul(str[i] - 'a' + 1, pows[i], mod)) % mod;
Hash[i] = hsh;
}
}
int get_hash(int l, int r) {
int tmp = 0;
if (l)
tmp = Hash[l - 1];
int res = (Hash[r] - tmp + mod) % mod;
res = (res * invpows[l]) % mod;
return res;
}
bool chk(int len) {
int a, b;
for (int i = 0; i + 2 * len - 1 < n; ++i) {
a = get_hash(i, i + len - 1);
for (int j = i + len; j + len - 1 < n; ++j) {
b = get_hash(j, j + len - 1);
if (a == b)
return 1;
}
}
return 0;
}
void solve() {
cin >> n >> s;
pow_init(n);
hashit(s);
int beg = 1, en = n / 2;
int mid, ans = 0;
while (beg <= en) {
mid = (beg + en) / 2;
if (chk(mid)) {
ans = mid;
beg = mid + 1;
} else
en = mid - 1;
}
cout << ans;
}
int32_t main() {
fast();
int t = 1;
// cin>>t;
for (int z = 1; z <= t; ++z) {
solve();
// cout<<"\n";
}
return 0;
}
| /*!enjoy karo yaar!*/
// CF,CC,AtC,SPOJ: hp1999
// HE: hemant269
// HR: hemant2132
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define fast() \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define all(x) begin(x), end(x)
#define rz(x) resize(x)
#define asn(x, y) assign(x, y)
#define mem(a, b) memset(a, b, sizeof(a))
#define sz(x) ((int)(x.size()))
#define eb emplace_back
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define ins insert
#define vi vector<int>
#define pii pair<int, int>
#define mii map<int, int>
#define F first
#define S second
#define makep make_pair
#define maket make_tuple
#define remax(a, b) a = max(a, b)
#define remin(a, b) a = min(a, b)
#define bitcount(x) __builtin_popcountll(x)
#define iceil(n, x) (((n) + (x)-1) / (x))
#define gcd(a, b) (__gcd((a), (b)))
#define lcm(a, b) ((a) * ((b) / gcd((a), (b))))
#define dbug(x) cout << #x << ": " << (x) << "\n"
#define flush fflush(stdout)
#define show(x) \
for (auto zz : x) \
cout << zz << " "; \
cout << "\n";
#define show2(x) \
for (auto zz : x) \
cout << zz.F << " " << zz.S << "\n";
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
const ld pi = acos(-1);
const ll inf = 1e18, M = 1e9 + 7;
const int N = 1;
vi Hash;
int n;
string s;
int pw(int x, int n, int mod = M) {
int res = 1;
x %= mod;
for (; n; n /= 2) {
if (n % 2)
res = (res * x) % mod;
x = (x * x) % mod;
}
return res;
}
int mul(int a, int b, int mod) {
int res = (a * b) % mod;
return res;
}
int prm = 131, mod = 1000000007;
vector<int> pows, invpows;
void pow_init(int n) {
pows.rz(n);
pows[0] = 1;
for (int i = 1; i < n; ++i)
pows[i] = (pows[i - 1] * prm) % mod;
invpows.rz(n);
invpows[n - 1] = pw(pows[n - 1], mod - 2);
for (int i = n - 2; i >= 0; --i)
invpows[i] = (invpows[i + 1] * prm) % mod;
}
void hashit(string str) {
int len = str.length();
int hsh = 0;
Hash.rz(n);
for (int i = 0; i < len; ++i) {
hsh = (hsh + mul(str[i] - 'a' + 1, pows[i], mod)) % mod;
Hash[i] = hsh;
}
}
int get_hash(int l, int r) {
int tmp = 0;
if (l)
tmp = Hash[l - 1];
int res = (Hash[r] - tmp + mod) % mod;
res = (res * invpows[l]) % mod;
return res;
}
bool chk(int len) {
vector<pii> v;
for (int i = 0; i + len - 1 < n; ++i)
v.pb({get_hash(i, i + len - 1), i});
sort(all(v));
for (int i = 0; i + len - 1 < n; ++i) {
int j;
for (j = i + 1; j < n && v[j].F == v[i].F; ++j)
;
--j;
if (v[i].S + len <= v[j].S)
return 1;
i = j;
}
return 0;
}
void solve() {
cin >> n >> s;
pow_init(n);
hashit(s);
int beg = 1, en = n / 2;
int mid, ans = 0;
while (beg <= en) {
mid = (beg + en) / 2;
if (chk(mid)) {
ans = mid;
beg = mid + 1;
} else
en = mid - 1;
}
cout << ans;
}
int32_t main() {
fast();
int t = 1;
// cin>>t;
for (int z = 1; z <= t; ++z) {
solve();
// cout<<"\n";
}
return 0;
}
| replace | 118 | 126 | 118 | 134 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define int long long int
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using namespace std;
typedef pair<int, int> P;
const int INF = 1e15;
const int MOD = 1e9 + 7;
template <typename T> using vector2 = vector<vector<T>>;
template <typename T> vector2<T> initVec2(size_t n0, size_t n1, T e = T()) {
return vector2<T>(n0, vector<T>(n1, e));
}
template <typename T> using vector3 = vector<vector<vector<T>>>;
template <typename T>
vector3<T> initVec3(size_t n0, size_t n1, size_t n2, T e = T()) {
return vector3<T>(n0, vector2<T>(n1, vector<T>(n2, e)));
}
vector<int> z_algorithm(string s) {
vector<int> z(s.size());
z[0] = s.size();
int i = 1, j = 0;
while (i < (int)s.size()) {
while (i + j < (int)s.size() && s[j] == s[i + j]) {
j++;
}
z[i] = j;
if (j == 0) {
i++;
continue;
}
int k = 1;
while (i + k < (int)s.size() && k + z[k] < j) {
z[i + k] = z[k];
k++;
}
i += k;
j -= k;
}
return z;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
string s;
cin >> n >> s;
int ans = 0;
rep(i, n) {
string t = s.substr(i, n - i);
auto za = z_algorithm(t);
for (int j = 1; j <= (n - i) / 2; j++) {
for (int k = j; k < n - i; k++) {
ans = max(ans, min(za[k], j));
}
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define int long long int
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using namespace std;
typedef pair<int, int> P;
const int INF = 1e15;
const int MOD = 1e9 + 7;
template <typename T> using vector2 = vector<vector<T>>;
template <typename T> vector2<T> initVec2(size_t n0, size_t n1, T e = T()) {
return vector2<T>(n0, vector<T>(n1, e));
}
template <typename T> using vector3 = vector<vector<vector<T>>>;
template <typename T>
vector3<T> initVec3(size_t n0, size_t n1, size_t n2, T e = T()) {
return vector3<T>(n0, vector2<T>(n1, vector<T>(n2, e)));
}
vector<int> z_algorithm(string s) {
vector<int> z(s.size());
z[0] = s.size();
int i = 1, j = 0;
while (i < (int)s.size()) {
while (i + j < (int)s.size() && s[j] == s[i + j]) {
j++;
}
z[i] = j;
if (j == 0) {
i++;
continue;
}
int k = 1;
while (i + k < (int)s.size() && k + z[k] < j) {
z[i + k] = z[k];
k++;
}
i += k;
j -= k;
}
return z;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
string s;
cin >> n >> s;
int ans = 0;
rep(i, n) {
string t = s.substr(i, n - i);
auto za = z_algorithm(t);
for (int j = 1; j < n - i; j++) {
ans = max(ans, min(za[j], j));
}
}
cout << ans << endl;
return 0;
}
| replace | 79 | 83 | 79 | 81 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
#define N_MAX 5000
int dp[N_MAX + 1][N_MAX + 1];
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
int main() {
int N;
string s;
cin >> N;
cin >> s;
int men = 0;
int mlen = 0;
for (int k = 0; k < N - 1; k++) {
string s1 = s.substr(k, N - k);
string s2 = s1;
Fill(dp, 0);
int maxlen = 0;
int endIdx = 0;
for (int i = 0; i < N - k; i++) {
for (int j = i + 1; j < N - k; j++) {
if (s1[i] == s2[j]) {
dp[i + 1][j + 1] = dp[i][j] + 1;
if (dp[i + 1][j + 1] > j - i) {
dp[i + 1][j + 1] = j - i;
}
if (dp[i + 1][j + 1] > maxlen) {
maxlen = dp[i + 1][j + 1];
endIdx = i + 1;
}
}
}
}
if (mlen <= maxlen) {
mlen = maxlen;
men = endIdx + k;
}
}
string com = s.substr(men - mlen, mlen);
// cout <<men << "," << mlen << endl;
// cout << com << endl;
cout << mlen << endl;
return 0;
}
| #include <iostream>
using namespace std;
#define N_MAX 5000
int dp[N_MAX + 1][N_MAX + 1];
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
int main() {
int N;
string s;
cin >> N;
cin >> s;
int men = 0;
int mlen = 0;
// for(int k=0; k<N-1; k++) {
for (int k = 0; k < 1; k++) {
string s1 = s.substr(k, N - k);
string s2 = s1;
Fill(dp, 0);
int maxlen = 0;
int endIdx = 0;
for (int i = 0; i < N - k; i++) {
for (int j = i + 1; j < N - k; j++) {
if (s1[i] == s2[j]) {
dp[i + 1][j + 1] = dp[i][j] + 1;
if (dp[i + 1][j + 1] > j - i) {
dp[i + 1][j + 1] = j - i;
}
if (dp[i + 1][j + 1] > maxlen) {
maxlen = dp[i + 1][j + 1];
endIdx = i + 1;
}
}
}
}
if (mlen <= maxlen) {
mlen = maxlen;
men = endIdx + k;
}
}
string com = s.substr(men - mlen, mlen);
// cout <<men << "," << mlen << endl;
// cout << com << endl;
cout << mlen << endl;
return 0;
}
| replace | 24 | 25 | 24 | 26 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
#define FOR0(var, max) for (ul(var) = 0; (var) < (max); ++(var))
#define FORi(var, min, max) for (ul(var) = (min); (var) < (max); ++(var))
#define FORi_INV(var, min, max) \
for (ul(var) = (max)-1; (var) + 1 > (min); --(var))
#define FORITER(var, iter) \
for (auto(iter) = (var).begin(); (iter) != (var).end(); (iter)++)
#define FORITER_INV(var, iter) \
for (auto(iter) = (var).rbegin(); (iter) != (var).rend(); (iter)++)
#define LTLT(a, b, c) (((a) < (b)) && ((b) < (c)))
#define LELT(a, b, c) (((a) <= (b)) && ((b) < (c)))
#define LTLE(a, b, c) (((a) < (b)) && ((b) <= (c)))
#define LELE(a, b, c) (((a) <= (b)) && ((b) <= (c)))
using namespace std;
using uc = unsigned char;
using ui = unsigned int;
using ul = unsigned long long int;
using sc = signed char;
using si = signed int;
using sl = signed long long int;
const static ui NMAX = 5000;
static ui N;
static string S;
struct Z_algorithm {
vector<ul> Z;
Z_algorithm(const string &str) {
ul n = str.size();
Z.resize(n, 0);
ul c = 0;
FORi(i, 1, n) {
if (Z[i - c] + i < Z[c] + c) {
Z[i] = Z[i - c];
} else {
ul j = 0;
if (i < c + Z[c]) {
j = c + Z[c] - i;
}
while (i + j < n && str[i + j] == str[j]) {
j++;
}
Z[i] = j;
c = i;
}
}
}
};
void solve(void) {
ul res = 0;
FOR0(i, N) {
Z_algorithm z(S.substr(i));
FOR0(j, S.substr(i).size()) {
ul k = z.Z[j];
if (k > j) {
k = j;
}
res = max(k, res);
}
}
cout << res << endl;
}
int main(void) {
cin >> N;
cin >> S;
solve();
return 0;
} | #include <algorithm>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
#define FOR0(var, max) for (ul(var) = 0; (var) < (max); ++(var))
#define FORi(var, min, max) for (ul(var) = (min); (var) < (max); ++(var))
#define FORi_INV(var, min, max) \
for (ul(var) = (max)-1; (var) + 1 > (min); --(var))
#define FORITER(var, iter) \
for (auto(iter) = (var).begin(); (iter) != (var).end(); (iter)++)
#define FORITER_INV(var, iter) \
for (auto(iter) = (var).rbegin(); (iter) != (var).rend(); (iter)++)
#define LTLT(a, b, c) (((a) < (b)) && ((b) < (c)))
#define LELT(a, b, c) (((a) <= (b)) && ((b) < (c)))
#define LTLE(a, b, c) (((a) < (b)) && ((b) <= (c)))
#define LELE(a, b, c) (((a) <= (b)) && ((b) <= (c)))
using namespace std;
using uc = unsigned char;
using ui = unsigned int;
using ul = unsigned long long int;
using sc = signed char;
using si = signed int;
using sl = signed long long int;
const static ui NMAX = 5000;
static ui N;
static string S;
struct Z_algorithm {
vector<ul> Z;
Z_algorithm(const string &str) {
ul n = str.size();
Z.resize(n, 0);
ul c = 0;
FORi(i, 1, n) {
if (Z[i - c] + i < Z[c] + c) {
Z[i] = Z[i - c];
} else {
ul j = 0;
if (i < c + Z[c]) {
j = c + Z[c] - i;
}
while (i + j < n && str[i + j] == str[j]) {
j++;
}
Z[i] = j;
c = i;
}
}
}
};
void solve(void) {
ul res = 0;
FOR0(i, N) {
Z_algorithm z(S.substr(i));
FOR0(j, N - i) {
ul k = z.Z[j];
if (k > j) {
k = j;
}
res = max(k, res);
}
}
cout << res << endl;
}
int main(void) {
cin >> N;
cin >> S;
solve();
return 0;
} | replace | 68 | 69 | 68 | 69 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <iostream>
#include <queue>
#include <string>
using namespace std;
const int N_MAX = 5 * 1e3 + 10;
typedef struct cover {
int first;
int second;
int len;
} Cover;
int checked[N_MAX][N_MAX] = {0};
int main() {
int N;
string S;
cin >> N >> S;
queue<Cover> que;
for (int i = 0; i < S.length(); i++) {
for (int j = i + 1; j < S.length(); j++) {
if (S[i] == S[j]) {
if (checked[i][j] == 0) {
que.push(Cover{i, j, 1});
}
checked[i][j] = 1;
}
}
}
int ans = 0;
while (!que.empty()) {
Cover c = que.front();
que.pop();
if (ans < c.len)
ans = c.len;
int nf = c.first + c.len;
int ns = c.second + c.len;
if (nf >= S.length())
continue;
if (ns >= S.length())
continue;
if (nf >= c.second)
continue;
if (S[nf] == S[ns]) {
c.len += 1;
que.push(c);
}
}
cout << ans << endl;
}
| #include <iostream>
#include <queue>
#include <string>
using namespace std;
const int N_MAX = 5 * 1e3 + 10;
typedef struct cover {
int first;
int second;
int len;
} Cover;
int checked[N_MAX][N_MAX] = {0};
int main() {
int N;
string S;
cin >> N >> S;
queue<Cover> que;
for (int i = 0; i < S.length(); i++) {
for (int j = i + 1; j < S.length(); j++) {
if (S[i] == S[j]) {
if (i == 0 || j == 0) {
que.push(Cover{i, j, 1});
} else if (checked[i - 1][j - 1] == 0) {
que.push(Cover{i, j, 1});
}
checked[i][j] = 1;
}
}
}
int ans = 0;
while (!que.empty()) {
Cover c = que.front();
que.pop();
if (ans < c.len)
ans = c.len;
int nf = c.first + c.len;
int ns = c.second + c.len;
if (nf >= S.length())
continue;
if (ns >= S.length())
continue;
if (nf >= c.second)
continue;
if (S[nf] == S[ns]) {
c.len += 1;
que.push(c);
}
}
cout << ans << endl;
}
| replace | 27 | 28 | 27 | 30 | TLE | |
p02913 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define chmax(x, y) x = max(x, y)
using namespace std;
int mx = 0;
int n;
string s;
int nextfree = 1;
class trie {
uint32_t d[20] = {0};
public:
int first;
int depth;
int nxt(int i) {
int s = i * 24, t = s + 24;
int sa = s / 32, sb = s % 32;
int ta = t / 32, tb = t % 32;
if (sa == ta) {
return d[sa] & ((1 << 24) - 1);
}
return (d[sa] >> sb) | ((d[ta] & ((1 << tb) - 1)) << (24 - tb));
}
void setnxt(int i, uint32_t v) {
int s = i * 24, t = s + 24;
int sa = s / 32, sb = s % 32;
int ta = t / 32, tb = t % 32;
if (sa == ta) {
d[sa] = v | ((d[sa] >> 24) << 24);
return;
}
d[sa] = d[sa] & ((1 << sb) - 1) | (v << sb);
d[ta] = ((d[ta] >> tb) << tb) | (v >> (24 - tb));
}
// trie(int f, int d): first(f), depth(d) {}
} t[5000 * 5001 / 2];
void f(int i_nxt, int first, trie &pre) {
if (i_nxt >= n || i_nxt - first > n / 2)
return;
int tc = s[i_nxt] - 'a';
if (pre.nxt(tc) == 0) {
pre.setnxt(tc, nextfree++);
t[pre.nxt(tc)].first = first;
t[pre.nxt(tc)].depth = pre.depth + 1;
}
trie &now = t[pre.nxt(tc)];
int d = now.depth;
if (now.first + d <= first) {
chmax(mx, d);
}
return f(i_nxt + 1, first, now);
}
int main() {
cin >> n;
cin >> s;
rep(i, n) { f(i, i, t[0]); }
cout << mx << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define chmax(x, y) x = max(x, y)
using namespace std;
int mx = 0;
int n;
string s;
int nextfree = 1;
class trie {
uint32_t d[20] = {0};
public:
int first;
int depth;
int nxt(int i) {
int s = i * 24, t = s + 24;
int sa = s / 32, sb = s % 32;
int ta = t / 32, tb = t % 32;
if (sa == ta) {
return d[sa] & ((1 << 24) - 1);
}
return (d[sa] >> sb) | ((d[ta] & ((1 << tb) - 1)) << (24 - tb));
}
void setnxt(int i, uint32_t v) {
int s = i * 24, t = s + 24;
int sa = s / 32, sb = s % 32;
int ta = t / 32, tb = t % 32;
if (sa == ta) {
d[sa] = v | ((d[sa] >> 24) << 24);
return;
}
d[sa] = d[sa] & ((1 << sb) - 1) | (v << sb);
d[ta] = ((d[ta] >> tb) << tb) | (v >> (24 - tb));
}
// trie(int f, int d): first(f), depth(d) {}
} t[5000 * 5001 / 2 * 5 / 6];
void f(int i_nxt, int first, trie &pre) {
if (i_nxt >= n || i_nxt - first > n / 2)
return;
int tc = s[i_nxt] - 'a';
if (pre.nxt(tc) == 0) {
pre.setnxt(tc, nextfree++);
t[pre.nxt(tc)].first = first;
t[pre.nxt(tc)].depth = pre.depth + 1;
}
trie &now = t[pre.nxt(tc)];
int d = now.depth;
if (now.first + d <= first) {
chmax(mx, d);
}
return f(i_nxt + 1, first, now);
}
int main() {
cin >> n;
cin >> s;
rep(i, n) { f(i, i, t[0]); }
cout << mx << endl;
}
| replace | 38 | 39 | 38 | 39 | MLE | |
p02913 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 5e3 + 100;
int dp[maxn][maxn];
string str;
int main() {
int N;
cin >> N;
cin >> str;
for (int j = 1; j < N; ++j)
dp[0][j] = (str[j] == str[0]);
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
dp[i][j] =
min(min(j - i, i + 1), (str[j] == str[i]) * (dp[i - 1][j - 1] + 1));
}
}
int ans = 0;
for (int i = 0; i < N; ++i)
for (int j = i + 1; j < N; ++j)
ans = max(ans, dp[i][j]);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int maxn = 5e3 + 100;
int dp[maxn][maxn];
string str;
int main() {
int N;
cin >> N;
cin >> str;
for (int j = 1; j < N; ++j)
dp[0][j] = (str[j] == str[0]);
for (int i = 1; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
dp[i][j] =
min(min(j - i, i + 1), (str[j] == str[i]) * (dp[i - 1][j - 1] + 1));
}
}
int ans = 0;
for (int i = 0; i < N; ++i)
for (int j = i + 1; j < N; ++j)
ans = max(ans, dp[i][j]);
cout << ans << endl;
return 0;
}
| replace | 11 | 12 | 11 | 12 | 127 | /tmp/99f271c9-4e3e-4570-acbe-132dff48ac76.out: error while loading shared libraries: libstdc++.so.6: failed to map segment from shared object
|
p02913 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2500;
const int INF = 1e6;
int n;
string s;
bool C(int x) {
string M[MAX];
if (x > n / 2)
return false;
for (int i = 0; i + x <= n; i++) {
M[i] = s.substr(i, x);
}
for (int i = 0; i + x + x <= n; i++) {
for (int j = i + x; j + x <= n; j++) {
if (M[i] == M[j])
return true;
}
}
return false;
}
void solve() {
int lb = 0, ub = INF;
while (ub - lb > 1) {
int mid = (lb + ub) / 2;
if (C(mid))
lb = mid;
else
ub = mid;
}
printf("%d\n", lb);
}
int main() {
cin >> n >> s;
solve();
} | #include <bits/stdc++.h>
using namespace std;
const int MAX = 5000;
const int INF = 1e6;
int n;
string s;
bool C(int x) {
string M[MAX];
if (x > n / 2)
return false;
for (int i = 0; i + x <= n; i++) {
M[i] = s.substr(i, x);
}
for (int i = 0; i + x + x <= n; i++) {
for (int j = i + x; j + x <= n; j++) {
if (M[i] == M[j])
return true;
}
}
return false;
}
void solve() {
int lb = 0, ub = INF;
while (ub - lb > 1) {
int mid = (lb + ub) / 2;
if (C(mid))
lb = mid;
else
ub = mid;
}
printf("%d\n", lb);
}
int main() {
cin >> n >> s;
solve();
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02913 | C++ | Runtime Error | // #include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
// #define dump(x) cerr << #x << "=" << (x) << endl;
using namespace std;
const int INF = (int)2e9 + 1;
const long long LINF = (long long)9e18 + 1;
// int dp[5005][5005];
int dp[5][5];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, ans = 0;
string S;
cin >> N >> S;
for (int i = N - 1; i >= 0; i--) {
for (int j = i + 1; j < N; j++) {
if (S[i] == S[j]) {
dp[i][j] = dp[i + 1][j + 1] + 1;
ans = max(ans, min(dp[i][j], j - i));
}
}
}
cout << ans << endl;
return 0;
}
| // #include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
// #define dump(x) cerr << #x << "=" << (x) << endl;
using namespace std;
const int INF = (int)2e9 + 1;
const long long LINF = (long long)9e18 + 1;
int dp[5005][5005];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, ans = 0;
string S;
cin >> N >> S;
for (int i = N - 1; i >= 0; i--) {
for (int j = i + 1; j < N; j++) {
if (S[i] == S[j]) {
dp[i][j] = dp[i + 1][j + 1] + 1;
ans = max(ans, min(dp[i][j], j - i));
}
}
}
cout << ans << endl;
return 0;
}
| replace | 40 | 42 | 40 | 41 | 0 | |
p02913 | C++ | Time Limit Exceeded | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = int(m); i < int(n); i++)
#define RREP(i, m, n) for (int i = int(n) - 1; i >= int(m); --i)
#define EACH(i, c) for (auto &(i) : c)
#define all(c) begin(c), end(c)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort(begin(c), end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#ifdef LOCAL
#define DEBUG(s) cout << (s) << endl
#define dump(x) cerr << #x << " = " << (x) << endl
#define BR cout << endl;
#else
#define DEBUG(s) \
do { \
} while (0)
#define dump(x) \
do { \
} while (0)
#define BR
#endif
using namespace std;
using UI = unsigned int;
using UL = unsigned long;
using LL = long long int;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VS = vector<string>;
using PII = pair<int, int>;
using VP = vector<PII>;
const int MAX = 500000, MS = 2;
const long long mod[] = {999999937LL, 1000000007LL}, base = 9973;
struct rolling_hash {
int n;
vector<long long> hs[MS], pw[MS];
rolling_hash() {}
rolling_hash(const string &s) {
n = s.size();
for (int i = 0; i < MS; i++) {
hs[i].assign(n + 1, 0);
pw[i].assign(n + 1, 0);
hs[i][0] = 0;
pw[i][0] = 1;
for (int j = 0; j < n; j++) {
pw[i][j + 1] = pw[i][j] * base % mod[i];
hs[i][j + 1] = (hs[i][j] * base + s[j]) % mod[i];
}
}
}
long long hash(int l, int r, int i) {
return ((hs[i][r] - hs[i][l] * pw[i][r - l]) % mod[i] + mod[i]) % mod[i];
}
bool match(int l1, int r1, int l2, int r2) {
bool ret = 1;
for (int i = 0; i < MS; i++)
ret &= hash(l1, r1, i) == hash(l2, r2, i);
return ret;
}
};
bool solve(int &len, rolling_hash &rh, int &n, string &s) {
// dump(len);
REP(i, 0, n - len + 1) REP(j, i + len, n - len + 1) {
// cerr << i << ", " << j << endl;
if (rh.match(i, i + len, j, j + len))
return true;
}
return false;
};
int meguru_bin(rolling_hash &rh, int &n, string &s) {
int ng = n + 1;
int ok = -1;
while (abs(ok - ng) > 1) {
int mid = ng + (ok - ng) / 2;
// cerr << ok << ", " << ng << ", " << mid << endl;
if (solve(mid, rh, n, s))
ok = mid;
else
ng = mid;
}
return ok;
}
void solve() {
int n;
string s;
cin >> n >> s;
rolling_hash rh(s);
cout << meguru_bin(rh, n, s) << endl;
}
int main() {
solve();
return 0;
} | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i = int(m); i < int(n); i++)
#define RREP(i, m, n) for (int i = int(n) - 1; i >= int(m); --i)
#define EACH(i, c) for (auto &(i) : c)
#define all(c) begin(c), end(c)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort(begin(c), end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())
#ifdef LOCAL
#define DEBUG(s) cout << (s) << endl
#define dump(x) cerr << #x << " = " << (x) << endl
#define BR cout << endl;
#else
#define DEBUG(s) \
do { \
} while (0)
#define dump(x) \
do { \
} while (0)
#define BR
#endif
using namespace std;
using UI = unsigned int;
using UL = unsigned long;
using LL = long long int;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<LL>;
using VVLL = vector<VLL>;
using VS = vector<string>;
using PII = pair<int, int>;
using VP = vector<PII>;
const int MAX = 500000, MS = 2;
const long long mod[] = {999999937LL, 1000000007LL}, base = 9973;
struct rolling_hash {
int n;
vector<long long> hs[MS], pw[MS];
rolling_hash() {}
rolling_hash(const string &s) {
n = s.size();
for (int i = 0; i < MS; i++) {
hs[i].assign(n + 1, 0);
pw[i].assign(n + 1, 0);
hs[i][0] = 0;
pw[i][0] = 1;
for (int j = 0; j < n; j++) {
pw[i][j + 1] = pw[i][j] * base % mod[i];
hs[i][j + 1] = (hs[i][j] * base + s[j]) % mod[i];
}
}
}
long long hash(int l, int r, int i) {
return ((hs[i][r] - hs[i][l] * pw[i][r - l]) % mod[i] + mod[i]) % mod[i];
}
bool match(int l1, int r1, int l2, int r2) {
bool ret = 1;
for (int i = 0; i < MS; i++)
ret &= hash(l1, r1, i) == hash(l2, r2, i);
return ret;
}
};
bool solve(int &len, rolling_hash &rh, int &n, string &s) {
// dump(len);
/*
REP(i,0,n-len+1) REP(j,i+len,n-len+1) {
//cerr << i << ", " << j << endl;
if (rh.match(i,i+len,j,j+len)) return true;
}
*/
vector<map<LL, int>> se(2);
REP(i, 0, n - len + 1) {
LL hash1 = rh.hash(i, i + len, 0), hash2 = rh.hash(i, i + len, 1);
/*
if (len == 3) {
dump(hash1);
dump(hash2);
}
*/
if (se[0].count(hash1) > 0 && se[1].count(hash2) > 0) {
if (se[0][hash1] == se[1][hash2]) {
if (se[0][hash1] + len <= i)
return true;
else
continue;
}
}
se[0].emplace(hash1, i);
se[1].emplace(hash2, i);
}
return false;
};
int meguru_bin(rolling_hash &rh, int &n, string &s) {
int ng = n + 1;
int ok = -1;
while (abs(ok - ng) > 1) {
int mid = ng + (ok - ng) / 2;
// cerr << ok << ", " << ng << ", " << mid << endl;
if (solve(mid, rh, n, s))
ok = mid;
else
ng = mid;
}
return ok;
}
void solve() {
int n;
string s;
cin >> n >> s;
rolling_hash rh(s);
cout << meguru_bin(rh, n, s) << endl;
}
int main() {
solve();
return 0;
} | replace | 88 | 92 | 88 | 113 | TLE | |
p02913 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
string s;
cin >> s;
vector<vector<int>> dp(n, vector<int>(n));
for (int i = 0; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (s[i - 1] == s[j - 1]) {
if (j - dp[i - 1][j - 1] != i)
dp[i][j] = 1 + dp[i - 1][j - 1];
else {
dp[i][j] = dp[i - 1][j - 1];
}
} else {
dp[i][j] = 0;
}
ans = max(ans, dp[i][j]);
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
string s;
cin >> s;
vector<vector<int>> dp(n + 1, vector<int>(n + 1));
for (int i = 0; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
if (s[i - 1] == s[j - 1]) {
if (j - dp[i - 1][j - 1] != i)
dp[i][j] = 1 + dp[i - 1][j - 1];
else {
dp[i][j] = dp[i - 1][j - 1];
}
} else {
dp[i][j] = 0;
}
ans = max(ans, dp[i][j]);
}
}
cout << ans << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02913 | Python | Time Limit Exceeded | N = int(input())
S = input()
ans = 0
left, right = 0, 1
while right < N:
s = S[left:right]
if s in S[right:]:
right += 1
ans = max(ans, len(s))
else:
left = right - 1
print(ans)
| N = int(input())
S = input()
ans = 0
left, right = 0, 1
while right < N:
s = S[left:right]
if s in S[right:]:
right += 1
ans = max(ans, len(s))
else:
left += 1
print(ans)
| replace | 12 | 13 | 12 | 13 | TLE | |
p02913 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define MOD 1000000007
#define rep(i, m, n) for (int(i) = (int)(m); i < (int)(n); i++)
#define REP(i, n) rep(i, 0, n)
#define FOR(i, c) \
for (decltype((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ll long long
#define ull unsigned long long
#define all(hoge) (hoge).begin(), (hoge).end()
typedef pair<ll, ll> P;
const long long INF = 1LL << 60;
typedef vector<ll> Array;
typedef vector<Array> Matrix;
string operator*(const string &s, int k) {
if (k == 0)
return "";
string p = (s + s) * (k / 2);
if (k % 2 == 1)
p += s;
return p;
}
// priority_queue<ll> max;//大きい順
// priority_queue<ll, Array, greater<ll>> min;//小さい順
/*firstについては昇順 secondについては降順
sort(all(wh), [&](P x, P y) {
if (x.first == y.first)return x.second > y.second;
return x.first < y.first;
});
*/
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// substr 文字列取り出し
// upper_bound
// ある値より大きい一番左のイテレータを返す、lowerは以上(setに対して使うとO(N)なので、setのメンバ関数を使う
// stoi
struct Edge { // グラフ
ll to, cap, rev;
Edge(ll _to, ll _cap, ll _rev) {
to = _to;
cap = _cap;
rev = _rev;
}
};
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
void add_edge(Graph &G, ll from, ll to, ll cap, bool revFlag,
ll revCap) { // 最大フロー求める Ford-fulkerson
G[from].push_back(Edge(to, cap, (ll)G[to].size()));
if (revFlag)
G[to].push_back(Edge(
from, revCap, (ll)G[from].size() - 1)); // 最小カットの場合逆辺は0にする
}
ll max_flow_dfs(Graph &G, ll v, ll t, ll f, vector<bool> &used) {
if (v == t)
return f;
used[v] = true;
for (int i = 0; i < G[v].size(); ++i) {
Edge &e = G[v][i];
if (!used[e.to] && e.cap > 0) {
ll d = max_flow_dfs(G, e.to, t, min(f, e.cap), used);
if (d > 0) {
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
// 二分グラフの最大マッチングを求めたりも出来る また二部グラフの最大独立集合は頂点数-最大マッチングのサイズ
ll max_flow(Graph &G, ll s, ll t) // O(V(V+E))
{
ll flow = 0;
for (;;) {
vector<bool> used(G.size());
REP(i, used.size()) used[i] = false;
ll f = max_flow_dfs(G, s, t, INF, used);
if (f == 0) {
return flow;
}
flow += f;
}
}
void BellmanFord(Graph &G, ll s, Array &d, Array &negative) { // O(|E||V|)
d.resize(G.size());
negative.resize(G.size());
REP(i, d.size()) d[i] = INF;
REP(i, d.size()) negative[i] = false;
d[s] = 0;
REP(k, G.size() - 1) {
REP(i, G.size()) {
REP(j, G[i].size()) {
if (d[i] != INF && d[G[i][j].to] > d[i] + G[i][j].cap) {
d[G[i][j].to] = d[i] + G[i][j].cap;
}
}
}
}
REP(k, G.size() - 1) {
REP(i, G.size()) {
REP(j, G[i].size()) {
if (d[i] != INF && d[G[i][j].to] > d[i] + G[i][j].cap) {
d[G[i][j].to] = d[i] + G[i][j].cap;
negative[G[i][j].to] = true;
}
if (negative[i] == true)
negative[G[i][j].to] = true;
}
}
}
}
void Dijkstra(Graph &G, ll s, Array &d) { // O(|E|log|V|)
d.resize(G.size());
REP(i, d.size()) d[i] = INF;
d[s] = 0;
priority_queue<P, vector<P>, greater<P>> q;
q.push(make_pair(0, s));
while (!q.empty()) {
P a = q.top();
q.pop();
if (d[a.second] < a.first)
continue;
REP(i, G[a.second].size()) {
Edge e = G[a.second][i];
if (d[e.to] > d[a.second] + e.cap) {
d[e.to] = d[a.second] + e.cap;
q.push(make_pair(d[e.to], e.to));
}
}
}
}
void WarshallFloyd(Graph &G, Matrix &d) { // O(V^3)
d.resize(G.size());
REP(i, d.size()) d[i].resize(G.size());
REP(i, d.size()) {
REP(j, d[i].size()) { d[i][j] = INF; }
}
REP(i, G.size()) {
REP(j, G[i].size()) { d[i][G[i][j].to] = G[i][j].cap; }
}
REP(i, G.size()) {
REP(j, G.size()) {
REP(k, G.size()) { chmin(d[j][k], d[j][i] + d[i][k]); }
}
}
}
bool tsort(Graph &graph, vector<int> &order) { // トポロジカルソートO(E+V)
int n = graph.size(), k = 0;
Array in(n);
for (auto &es : graph)
for (auto &e : es)
in[e.to]++;
priority_queue<ll, Array, greater<ll>> que;
REP(i, n)
if (in[i] == 0)
que.push(i);
while (que.size()) {
int v = que.top();
que.pop();
order.push_back(v);
for (auto &e : graph[v])
if (--in[e.to] == 0)
que.push(e.to);
}
if (order.size() != n)
return false;
else
return true;
}
class lca {
public:
const int n = 0;
const int log2_n = 0;
std::vector<std::vector<int>> parent;
std::vector<int> depth;
lca() {}
lca(const Graph &g, int root)
: n(g.size()), log2_n(log2(n) + 1), parent(log2_n, std::vector<int>(n)),
depth(n) {
dfs(g, root, -1, 0);
for (int k = 0; k + 1 < log2_n; k++) {
for (int v = 0; v < (int)g.size(); v++) {
if (parent[k][v] < 0)
parent[k + 1][v] = -1;
else
parent[k + 1][v] = parent[k][parent[k][v]];
}
}
}
void dfs(const Graph &g, int v, int p, int d) {
parent[0][v] = p;
depth[v] = d;
for (auto &e : g[v]) {
if (e.to != p)
dfs(g, e.to, v, d + 1);
}
}
int get(int u, int v) {
if (depth[u] > depth[v])
std::swap(u, v);
for (int k = 0; k < log2_n; k++) {
if ((depth[v] - depth[u]) >> k & 1) {
v = parent[k][v];
}
}
if (u == v)
return u;
for (int k = log2_n - 1; k >= 0; k--) {
if (parent[k][u] != parent[k][v]) {
u = parent[k][u];
v = parent[k][v];
}
}
return parent[0][u];
}
};
class UnionFind {
vector<int> data;
ll num;
public:
UnionFind(int size) : data(size, -1), num(size) {}
bool unionSet(int x, int y) { // xとyの集合を統合する
x = root(x);
y = root(y);
if (x != y) {
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
}
num -= (x != y);
return x != y;
}
bool findSet(int x, int y) { // xとyが同じ集合か返す
return root(x) == root(y);
}
int root(int x) { // xのルートを返す
return data[x] < 0 ? x : data[x] = root(data[x]);
}
int size(int x) { // xの集合のサイズを返す
return -data[root(x)];
}
int numSet() { // 集合の数を返す
return num;
}
};
class SumSegTree {
private:
ll _sum(ll a, ll b, ll k, ll l, ll r) {
if (r <= a || b <= l)
return 0; // 交差しない
if (a <= l && r <= b)
return dat[k]; // a,l,r,bの順で完全に含まれる
else {
ll s1 = _sum(a, b, 2 * k + 1, l, (l + r) / 2); // 左の子
ll s2 = _sum(a, b, 2 * k + 2, (l + r) / 2, r); // 右の子
return s1 + s2;
}
}
public:
ll n, height;
vector<ll> dat;
// 初期化（_nは最大要素数）
SumSegTree(ll _n) {
n = 1;
height = 1;
while (n < _n) {
n *= 2;
height++;
}
dat = vector<ll>(2 * n - 1, 0);
}
// 場所i(0-indexed)にxを足す
void add(ll i, ll x) {
i += n - 1; // i番目の葉ノードへ
dat[i] += x;
while (i > 0) { // 下から上がっていく
i = (i - 1) / 2;
dat[i] += x;
}
}
// 区間[a,b)の総和。ノードk=[l,r)に着目している。
ll sum(ll a, ll b) { return _sum(a, b, 0, 0, n); }
};
class RmqTree {
private:
ll _find(ll a, ll b, ll k, ll l, ll r) {
if (r <= a || b <= l)
return INF; // 交差しない
if (a <= l && r <= b)
return dat[k]; // a,l,r,bの順で完全に含まれる
else {
ll s1 = _find(a, b, 2 * k + 1, l, (l + r) / 2); // 左の子
ll s2 = _find(a, b, 2 * k + 2, (l + r) / 2, r); // 右の子
return min(s1, s2);
}
}
public:
ll n, height;
vector<ll> dat;
// 初期化（_nは最大要素数）
RmqTree(ll _n) {
n = 1;
height = 1;
while (n < _n) {
n *= 2;
height++;
}
dat = vector<ll>(2 * n - 1, INF);
}
// 場所i(0-indexed)をxにする
void update(ll i, ll x) {
i += n - 1; // i番目の葉ノードへ
dat[i] = x;
while (i > 0) { // 下から上がっていく
i = (i - 1) / 2;
dat[i] = min(dat[i * 2 + 1], dat[i * 2 + 2]);
}
}
// 区間[a,b)の最小値。ノードk=[l,r)に着目している。
ll find(ll a, ll b) { return _find(a, b, 0, 0, n); }
};
// 約数求める //約数
void divisor(ll n, vector<ll> &ret) {
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(ret.begin(), ret.end());
}
vector<ll> lis_fast(const vector<ll> &a) { // 最長部分増加列
const ll n = a.size();
vector<ll> A(n, INT_MAX);
vector<ll> id(n);
for (int i = 0; i < n; ++i) {
id[i] = distance(A.begin(), lower_bound(A.begin(), A.end(), a[i]));
A[id[i]] = a[i];
}
ll m = *max_element(id.begin(), id.end());
vector<ll> b(m + 1);
for (int i = n - 1; i >= 0; --i)
if (id[i] == m)
b[m--] = a[i];
return b;
}
bool z_algorithm(string &str, vector<int> &z,
ll s) { // s&tを渡してtにsが含まれるかを返す
const int L = str.size();
z.resize(str.size());
for (int i = 1, left = 0, right = 0; i < L; i++) {
if (i > right) {
left = right = i;
for (; right < L && str[right - left] == str[right]; right++)
;
z[i] = right - left;
right--;
} else {
int k = i - left;
if (z[k] < right - i + 1) {
z[i] = z[k];
} else {
left = i;
for (; right < L && str[right - left] == str[right]; right++)
;
z[i] = right - left;
right--;
}
}
if (z[i] == s)
return true;
}
return false;
}
bool z_algorithm(string &str,
vector<int> &z) { // z[i]==|s|のときstr[i]からsが含まれる
const int L = str.size();
z.resize(str.size());
for (int i = 1, left = 0, right = 0; i < L; i++) {
if (i > right) {
left = right = i;
for (; right < L && str[right - left] == str[right]; right++)
;
z[i] = right - left;
right--;
} else {
int k = i - left;
if (z[k] < right - i + 1) {
z[i] = z[k];
} else {
left = i;
for (; right < L && str[right - left] == str[right]; right++)
;
z[i] = right - left;
right--;
}
}
}
return true;
}
ll ModPow(ll x, ll n) {
ll res = 1LL;
while (n > 0) {
if (n & 1)
res = res * x % MOD;
x = x * x % MOD;
n >>= 1;
}
return res;
}
// nCrとか
class Combination {
public:
Array fact;
Array inv;
ll mod;
ll mod_inv(ll x) {
ll n = mod - 2LL;
ll res = 1LL;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
ll nCr(ll n, ll r) { return ((fact[n] * inv[r] % mod) * inv[n - r]) % mod; }
ll nPr(ll n, ll r) { return (fact[n] * inv[n - r]) % mod; }
ll nHr(ll n, ll r) { return nCr(r + n - 1, r); }
Combination(ll n, ll _mod) {
mod = _mod;
fact.resize(n + 1);
fact[0] = 1;
REP(i, n) { fact[i + 1] = (fact[i] * (i + 1LL)) % mod; }
inv.resize(n + 1);
REP(i, n + 1) { inv[i] = mod_inv(fact[i]); }
}
};
ll gcd(ll m, ll n) {
if (n == 0)
return m;
return gcd(n, m % n);
} // gcd
ll lcm(ll m, ll n) { return m / gcd(m, n) * n; }
Matrix mIdentity(ll n) {
Matrix A(n, Array(n));
for (int i = 0; i < n; ++i)
A[i][i] = 1;
return A;
}
Matrix mMul(const Matrix &A, const Matrix &B) {
Matrix C(A.size(), Array(B[0].size()));
for (int i = 0; i < C.size(); ++i)
for (int j = 0; j < C[i].size(); ++j)
for (int k = 0; k < A[i].size(); ++k)
(C[i][j] += (A[i][k] % MOD) * (B[k][j] % MOD)) %= MOD;
return C;
}
// O( n^3 log e )
Matrix mPow(const Matrix &A, ll e) {
return e == 0 ? mIdentity(A.size())
: e % 2 == 0 ? mPow(mMul(A, A), e / 2)
: mMul(A, mPow(A, e - 1));
}
template <class T> class RectangleSum {
public:
vector<vector<T>> sum;
T GetSum(int left, int right, int top,
int bottom) { //[left, right], [top, bottom]
T res = sum[bottom][right];
if (left > 0)
res -= sum[bottom][left - 1];
if (top > 0)
res -= sum[top - 1][right];
if (left > 0 && top > 0)
res += sum[top - 1][left - 1];
return res;
}
RectangleSum(const vector<vector<T>> &s, int h, int w) {
sum.resize(h);
for (int i = 0; i < h; i++)
sum[i].resize(w, 0);
for (int y = 0; y < h; y++) {
for (int x = 0; x < w; x++) {
sum[y][x] = s[y][x];
if (y > 0)
sum[y][x] += sum[y - 1][x];
if (x > 0)
sum[y][x] += sum[y][x - 1];
if (y > 0 && x > 0)
sum[y][x] -= sum[y - 1][x - 1];
}
}
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
string s;
cin >> s;
for (int i = s.size() / 2; i >= 1; i--) {
map<string, Array> se;
for (int j = 0; j <= s.size() - i * 2; j++) {
if (se[s.substr(j, i)].size() == 0)
se[s.substr(j, i)].push_back(j);
}
for (int j = i; j <= s.size() - i; j++) {
string t = s.substr(j, i);
if (se[t].size() == 1) {
if (j - se[t][0] >= i) {
cout << i << endl;
return 0;
}
}
}
}
cout << 0 << endl;
return 0;
} | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define MOD 1000000007
#define rep(i, m, n) for (int(i) = (int)(m); i < (int)(n); i++)
#define REP(i, n) rep(i, 0, n)
#define FOR(i, c) \
for (decltype((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ll long long
#define ull unsigned long long
#define all(hoge) (hoge).begin(), (hoge).end()
typedef pair<ll, ll> P;
const long long INF = 1LL << 60;
typedef vector<ll> Array;
typedef vector<Array> Matrix;
string operator*(const string &s, int k) {
if (k == 0)
return "";
string p = (s + s) * (k / 2);
if (k % 2 == 1)
p += s;
return p;
}
// priority_queue<ll> max;//大きい順
// priority_queue<ll, Array, greater<ll>> min;//小さい順
/*firstについては昇順 secondについては降順
sort(all(wh), [&](P x, P y) {
if (x.first == y.first)return x.second > y.second;
return x.first < y.first;
});
*/
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
// substr 文字列取り出し
// upper_bound
// ある値より大きい一番左のイテレータを返す、lowerは以上(setに対して使うとO(N)なので、setのメンバ関数を使う
// stoi
struct Edge { // グラフ
ll to, cap, rev;
Edge(ll _to, ll _cap, ll _rev) {
to = _to;
cap = _cap;
rev = _rev;
}
};
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
void add_edge(Graph &G, ll from, ll to, ll cap, bool revFlag,
ll revCap) { // 最大フロー求める Ford-fulkerson
G[from].push_back(Edge(to, cap, (ll)G[to].size()));
if (revFlag)
G[to].push_back(Edge(
from, revCap, (ll)G[from].size() - 1)); // 最小カットの場合逆辺は0にする
}
ll max_flow_dfs(Graph &G, ll v, ll t, ll f, vector<bool> &used) {
if (v == t)
return f;
used[v] = true;
for (int i = 0; i < G[v].size(); ++i) {
Edge &e = G[v][i];
if (!used[e.to] && e.cap > 0) {
ll d = max_flow_dfs(G, e.to, t, min(f, e.cap), used);
if (d > 0) {
e.cap -= d;
G[e.to][e.rev].cap += d;
return d;
}
}
}
return 0;
}
// 二分グラフの最大マッチングを求めたりも出来る また二部グラフの最大独立集合は頂点数-最大マッチングのサイズ
ll max_flow(Graph &G, ll s, ll t) // O(V(V+E))
{
ll flow = 0;
for (;;) {
vector<bool> used(G.size());
REP(i, used.size()) used[i] = false;
ll f = max_flow_dfs(G, s, t, INF, used);
if (f == 0) {
return flow;
}
flow += f;
}
}
void BellmanFord(Graph &G, ll s, Array &d, Array &negative) { // O(|E||V|)
d.resize(G.size());
negative.resize(G.size());
REP(i, d.size()) d[i] = INF;
REP(i, d.size()) negative[i] = false;
d[s] = 0;
REP(k, G.size() - 1) {
REP(i, G.size()) {
REP(j, G[i].size()) {
if (d[i] != INF && d[G[i][j].to] > d[i] + G[i][j].cap) {
d[G[i][j].to] = d[i] + G[i][j].cap;
}
}
}
}
REP(k, G.size() - 1) {
REP(i, G.size()) {
REP(j, G[i].size()) {
if (d[i] != INF && d[G[i][j].to] > d[i] + G[i][j].cap) {
d[G[i][j].to] = d[i] + G[i][j].cap;
negative[G[i][j].to] = true;
}
if (negative[i] == true)
negative[G[i][j].to] = true;
}
}
}
}
void Dijkstra(Graph &G, ll s, Array &d) { // O(|E|log|V|)
d.resize(G.size());
REP(i, d.size()) d[i] = INF;
d[s] = 0;
priority_queue<P, vector<P>, greater<P>> q;
q.push(make_pair(0, s));
while (!q.empty()) {
P a = q.top();
q.pop();
if (d[a.second] < a.first)
continue;
REP(i, G[a.second].size()) {
Edge e = G[a.second][i];
if (d[e.to] > d[a.second] + e.cap) {
d[e.to] = d[a.second] + e.cap;
q.push(make_pair(d[e.to], e.to));
}
}
}
}
void WarshallFloyd(Graph &G, Matrix &d) { // O(V^3)
d.resize(G.size());
REP(i, d.size()) d[i].resize(G.size());
REP(i, d.size()) {
REP(j, d[i].size()) { d[i][j] = INF; }
}
REP(i, G.size()) {
REP(j, G[i].size()) { d[i][G[i][j].to] = G[i][j].cap; }
}
REP(i, G.size()) {
REP(j, G.size()) {
REP(k, G.size()) { chmin(d[j][k], d[j][i] + d[i][k]); }
}
}
}
bool tsort(Graph &graph, vector<int> &order) { // トポロジカルソートO(E+V)
int n = graph.size(), k = 0;
Array in(n);
for (auto &es : graph)
for (auto &e : es)
in[e.to]++;
priority_queue<ll, Array, greater<ll>> que;
REP(i, n)
if (in[i] == 0)
que.push(i);
while (que.size()) {
int v = que.top();
que.pop();
order.push_back(v);
for (auto &e : graph[v])
if (--in[e.to] == 0)
que.push(e.to);
}
if (order.size() != n)
return false;
else
return true;
}
class lca {
public:
const int n = 0;
const int log2_n = 0;
std::vector<std::vector<int>> parent;
std::vector<int> depth;
lca() {}
lca(const Graph &g, int root)
: n(g.size()), log2_n(log2(n) + 1), parent(log2_n, std::vector<int>(n)),
depth(n) {
dfs(g, root, -1, 0);
for (int k = 0; k + 1 < log2_n; k++) {
for (int v = 0; v < (int)g.size(); v++) {
if (parent[k][v] < 0)
parent[k + 1][v] = -1;
else
parent[k + 1][v] = parent[k][parent[k][v]];
}
}
}
void dfs(const Graph &g, int v, int p, int d) {
parent[0][v] = p;
depth[v] = d;
for (auto &e : g[v]) {
if (e.to != p)
dfs(g, e.to, v, d + 1);
}
}
int get(int u, int v) {
if (depth[u] > depth[v])
std::swap(u, v);
for (int k = 0; k < log2_n; k++) {
if ((depth[v] - depth[u]) >> k & 1) {
v = parent[k][v];
}
}
if (u == v)
return u;
for (int k = log2_n - 1; k >= 0; k--) {
if (parent[k][u] != parent[k][v]) {
u = parent[k][u];
v = parent[k][v];
}
}
return parent[0][u];
}
};
class UnionFind {
vector<int> data;
ll num;
public:
UnionFind(int size) : data(size, -1), num(size) {}
bool unionSet(int x, int y) { // xとyの集合を統合する
x = root(x);
y = root(y);
if (x != y) {
if (data[y] < data[x])
swap(x, y);
data[x] += data[y];
data[y] = x;
}
num -= (x != y);
return x != y;
}
bool findSet(int x, int y) { // xとyが同じ集合か返す
return root(x) == root(y);
}
int root(int x) { // xのルートを返す
return data[x] < 0 ? x : data[x] = root(data[x]);
}
int size(int x) { // xの集合のサイズを返す
return -data[root(x)];
}
int numSet() { // 集合の数を返す
return num;
}
};
class SumSegTree {
private:
ll _sum(ll a, ll b, ll k, ll l, ll r) {
if (r <= a || b <= l)
return 0; // 交差しない
if (a <= l && r <= b)
return dat[k]; // a,l,r,bの順で完全に含まれる
else {
ll s1 = _sum(a, b, 2 * k + 1, l, (l + r) / 2); // 左の子
ll s2 = _sum(a, b, 2 * k + 2, (l + r) / 2, r); // 右の子
return s1 + s2;
}
}
public:
ll n, height;
vector<ll> dat;
// 初期化（_nは最大要素数）
SumSegTree(ll _n) {
n = 1;
height = 1;
while (n < _n) {
n *= 2;
height++;
}
dat = vector<ll>(2 * n - 1, 0);
}
// 場所i(0-indexed)にxを足す
void add(ll i, ll x) {
i += n - 1; // i番目の葉ノードへ
dat[i] += x;
while (i > 0) { // 下から上がっていく
i = (i - 1) / 2;
dat[i] += x;
}
}
// 区間[a,b)の総和。ノードk=[l,r)に着目している。
ll sum(ll a, ll b) { return _sum(a, b, 0, 0, n); }
};
class RmqTree {
private:
ll _find(ll a, ll b, ll k, ll l, ll r) {
if (r <= a || b <= l)
return INF; // 交差しない
if (a <= l && r <= b)
return dat[k]; // a,l,r,bの順で完全に含まれる
else {
ll s1 = _find(a, b, 2 * k + 1, l, (l + r) / 2); // 左の子
ll s2 = _find(a, b, 2 * k + 2, (l + r) / 2, r); // 右の子
return min(s1, s2);
}
}
public:
ll n, height;
vector<ll> dat;
// 初期化（_nは最大要素数）
RmqTree(ll _n) {
n = 1;
height = 1;
while (n < _n) {
n *= 2;
height++;
}
dat = vector<ll>(2 * n - 1, INF);
}
// 場所i(0-indexed)をxにする
void update(ll i, ll x) {
i += n - 1; // i番目の葉ノードへ
dat[i] = x;
while (i > 0) { // 下から上がっていく
i = (i - 1) / 2;
dat[i] = min(dat[i * 2 + 1], dat[i * 2 + 2]);
}
}
// 区間[a,b)の最小値。ノードk=[l,r)に着目している。
ll find(ll a, ll b) { return _find(a, b, 0, 0, n); }
};
// 約数求める //約数
void divisor(ll n, vector<ll> &ret) {
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n)
ret.push_back(n / i);
}
}
sort(ret.begin(), ret.end());
}
vector<ll> lis_fast(const vector<ll> &a) { // 最長部分増加列
const ll n = a.size();
vector<ll> A(n, INT_MAX);
vector<ll> id(n);
for (int i = 0; i < n; ++i) {
id[i] = distance(A.begin(), lower_bound(A.begin(), A.end(), a[i]));
A[id[i]] = a[i];
}
ll m = *max_element(id.begin(), id.end());
vector<ll> b(m + 1);
for (int i = n - 1; i >= 0; --i)
if (id[i] == m)
b[m--] = a[i];
return b;
}
bool z_algorithm(string &str, vector<int> &z,
ll s) { // s&tを渡してtにsが含まれるかを返す
const int L = str.size();
z.resize(str.size());
for (int i = 1, left = 0, right = 0; i < L; i++) {
if (i > right) {
left = right = i;
for (; right < L && str[right - left] == str[right]; right++)
;
z[i] = right - left;
right--;
} else {
int k = i - left;
if (z[k] < right - i + 1) {
z[i] = z[k];
} else {
left = i;
for (; right < L && str[right - left] == str[right]; right++)
;
z[i] = right - left;
right--;
}
}
if (z[i] == s)
return true;
}
return false;
}
bool z_algorithm(string &str,
vector<int> &z) { // z[i]==|s|のときstr[i]からsが含まれる
const int L = str.size();
z.resize(str.size());
for (int i = 1, left = 0, right = 0; i < L; i++) {
if (i > right) {
left = right = i;
for (; right < L && str[right - left] == str[right]; right++)
;
z[i] = right - left;
right--;
} else {
int k = i - left;
if (z[k] < right - i + 1) {
z[i] = z[k];
} else {
left = i;
for (; right < L && str[right - left] == str[right]; right++)
;
z[i] = right - left;
right--;
}
}
}
return true;
}
ll ModPow(ll x, ll n) {
ll res = 1LL;
while (n > 0) {
if (n & 1)
res = res * x % MOD;
x = x * x % MOD;
n >>= 1;
}
return res;
}
// nCrとか
class Combination {
public:
Array fact;
Array inv;
ll mod;
ll mod_inv(ll x) {
ll n = mod - 2LL;
ll res = 1LL;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
ll nCr(ll n, ll r) { return ((fact[n] * inv[r] % mod) * inv[n - r]) % mod; }
ll nPr(ll n, ll r) { return (fact[n] * inv[n - r]) % mod; }
ll nHr(ll n, ll r) { return nCr(r + n - 1, r); }
Combination(ll n, ll _mod) {
mod = _mod;
fact.resize(n + 1);
fact[0] = 1;
REP(i, n) { fact[i + 1] = (fact[i] * (i + 1LL)) % mod; }
inv.resize(n + 1);
REP(i, n + 1) { inv[i] = mod_inv(fact[i]); }
}
};
ll gcd(ll m, ll n) {
if (n == 0)
return m;
return gcd(n, m % n);
} // gcd
ll lcm(ll m, ll n) { return m / gcd(m, n) * n; }
Matrix mIdentity(ll n) {
Matrix A(n, Array(n));
for (int i = 0; i < n; ++i)
A[i][i] = 1;
return A;
}
Matrix mMul(const Matrix &A, const Matrix &B) {
Matrix C(A.size(), Array(B[0].size()));
for (int i = 0; i < C.size(); ++i)
for (int j = 0; j < C[i].size(); ++j)
for (int k = 0; k < A[i].size(); ++k)
(C[i][j] += (A[i][k] % MOD) * (B[k][j] % MOD)) %= MOD;
return C;
}
// O( n^3 log e )
Matrix mPow(const Matrix &A, ll e) {
return e == 0 ? mIdentity(A.size())
: e % 2 == 0 ? mPow(mMul(A, A), e / 2)
: mMul(A, mPow(A, e - 1));
}
template <class T> class RectangleSum {
public:
vector<vector<T>> sum;
T GetSum(int left, int right, int top,
int bottom) { //[left, right], [top, bottom]
T res = sum[bottom][right];
if (left > 0)
res -= sum[bottom][left - 1];
if (top > 0)
res -= sum[top - 1][right];
if (left > 0 && top > 0)
res += sum[top - 1][left - 1];
return res;
}
RectangleSum(const vector<vector<T>> &s, int h, int w) {
sum.resize(h);
for (int i = 0; i < h; i++)
sum[i].resize(w, 0);
for (int y = 0; y < h; y++) {
for (int x = 0; x < w; x++) {
sum[y][x] = s[y][x];
if (y > 0)
sum[y][x] += sum[y - 1][x];
if (x > 0)
sum[y][x] += sum[y][x - 1];
if (y > 0 && x > 0)
sum[y][x] -= sum[y - 1][x - 1];
}
}
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll n;
cin >> n;
string s;
cin >> s;
ll ans = 0;
REP(i, n) {
string t = s.substr(i, n - i) + '&' + s;
vector<int> z;
z_algorithm(t, z);
ll ma = 1;
rep(j, n + 2, z.size()) {
if (z[j] <= ma)
chmax(ans, (ll)z[j]);
ma++;
}
}
cout << ans << endl;
return 0;
} | replace | 564 | 581 | 564 | 577 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long LINF = numeric_limits<long long>::max() / 3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr << #x << ":" << x << endl
#define debug2(x, y) cerr << #x << "," << #y ":" << x << "," << y << endl
// struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double {
double d;
explicit Double(double x) : d(x) {}
};
ostream &operator<<(ostream &os, const Double x) {
os << fixed << setprecision(20) << x.d;
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (const auto &v : vec) {
os << v << ",";
}
os << "]";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &mp) {
os << "{";
for (auto &p : mp) {
os << p << ",";
}
os << "}";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) {
os << "{";
for (T v : st)
os << v << ",";
os << "}";
return os;
}
template <typename T, typename U> inline void chmax(T &x, U y) {
if (y > x)
x = y;
}
template <typename T, typename U> inline void chmin(T &x, U y) {
if (y < x)
x = y;
}
using ll = long long;
using pii = std::pair<int, int>;
using vi = std::vector<int>;
typedef vector<vi> vvi;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
// constexpr double eps = 1e-14;
constexpr double eps = 1e-10;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
/*}}}*/
struct RollingHash {
static const int hash_size = 2;
vector<long long> mod{999999937LL, 1000000007LL};
const long long base = 9973;
vector<long long> pw[hash_size], hs[hash_size];
RollingHash(const string &s) {
int n = s.size();
for (int i = 0; i < hash_size; i++) {
pw[i].resize(n + 1);
pw[i][0] = 1;
for (int j = 0; j < n; j++)
pw[i][j + 1] = pw[i][j] * base % mod[i];
hs[i].resize(n + 1);
hs[i][0] = 0;
for (int j = 0; j < n; j++) {
hs[i][j + 1] = hs[i][j] * base % mod[i] + s[j];
if (hs[i][j + 1] >= mod[i])
hs[i][j + 1] -= mod[i];
}
}
}
long long get(int l, int r, int i) const {
long long ret = hs[i][r] + mod[i] - (hs[i][l] * pw[i][r - l] % mod[i]);
if (ret >= mod[i])
ret -= mod[i];
return ret;
}
bool match(int l1, int r1, int l2, int r2) const {
for (int i = 0; i < hash_size; i++) {
if (get(l1, r1, i) != get(l2, r2, i))
return false;
}
return true;
}
bool match(int l, int r, const RollingHash &p, int pl, int pr) const {
for (int i = 0; i < hash_size; i++) {
if (get(l, r, i) != p.get(pl, pr, i))
return false;
}
return true;
}
};
int n;
string s;
int main() {
cin >> n >> s;
RollingHash rh(s);
int low = 0;
int high = n;
while (high - low > 1) {
int m = (low + high) / 2;
bool ok = false;
for (int i = 0; i + m <= n; i++) {
for (int j = i + m; j + m <= n; j++) {
if (rh.match(i, i + m, j, j + m)) {
ok = true;
break;
}
}
if (ok)
break;
}
if (ok) {
low = m;
} else {
high = m;
}
}
cout << low << endl;
}
| #include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long LINF = numeric_limits<long long>::max() / 3;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr << #x << ":" << x << endl
#define debug2(x, y) cerr << #x << "," << #y ":" << x << "," << y << endl
// struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double {
double d;
explicit Double(double x) : d(x) {}
};
ostream &operator<<(ostream &os, const Double x) {
os << fixed << setprecision(20) << x.d;
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[";
for (const auto &v : vec) {
os << v << ",";
}
os << "]";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &mp) {
os << "{";
for (auto &p : mp) {
os << p << ",";
}
os << "}";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) {
os << "{";
for (T v : st)
os << v << ",";
os << "}";
return os;
}
template <typename T, typename U> inline void chmax(T &x, U y) {
if (y > x)
x = y;
}
template <typename T, typename U> inline void chmin(T &x, U y) {
if (y < x)
x = y;
}
using ll = long long;
using pii = std::pair<int, int>;
using vi = std::vector<int>;
typedef vector<vi> vvi;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
// constexpr double eps = 1e-14;
constexpr double eps = 1e-10;
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
/*}}}*/
struct RollingHash {
static const int hash_size = 2;
vector<long long> mod{999999937LL, 1000000007LL};
const long long base = 9973;
vector<long long> pw[hash_size], hs[hash_size];
RollingHash(const string &s) {
int n = s.size();
for (int i = 0; i < hash_size; i++) {
pw[i].resize(n + 1);
pw[i][0] = 1;
for (int j = 0; j < n; j++)
pw[i][j + 1] = pw[i][j] * base % mod[i];
hs[i].resize(n + 1);
hs[i][0] = 0;
for (int j = 0; j < n; j++) {
hs[i][j + 1] = hs[i][j] * base % mod[i] + s[j];
if (hs[i][j + 1] >= mod[i])
hs[i][j + 1] -= mod[i];
}
}
}
long long get(int l, int r, int i) const {
long long ret = hs[i][r] + mod[i] - (hs[i][l] * pw[i][r - l] % mod[i]);
if (ret >= mod[i])
ret -= mod[i];
return ret;
}
bool match(int l1, int r1, int l2, int r2) const {
for (int i = 0; i < hash_size; i++) {
if (get(l1, r1, i) != get(l2, r2, i))
return false;
}
return true;
}
bool match(int l, int r, const RollingHash &p, int pl, int pr) const {
for (int i = 0; i < hash_size; i++) {
if (get(l, r, i) != p.get(pl, pr, i))
return false;
}
return true;
}
};
int n;
string s;
int main() {
cin >> n >> s;
RollingHash rh(s);
int low = 0;
int high = n;
while (high - low > 1) {
int m = (low + high) / 2;
bool ok = false;
for (int i = 0; i + m <= n; i++) {
for (int j = i + m; j + m <= n; j++) {
if (s[i] != s[j])
continue;
if (rh.match(i, i + m, j, j + m)) {
ok = true;
break;
}
}
if (ok)
break;
}
if (ok) {
low = m;
} else {
high = m;
}
}
cout << low << endl;
}
| insert | 139 | 139 | 139 | 141 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define For(i, n1, n2) for (int i = (int)(n1); i < (int)(n2); i++)
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = (ll)(n1); i < (ll)(n2); i++)
#define RFOR(i, n1, n2) for (ll i = ((ll)(n1)-1); i >= (ll)(n2); i--)
#define all(a) (a).begin(), (a).end()
#define SORT(a) sort((a).begin(), (a).end())
#define oorret 0
#define oor(x) \
[&]() { \
try { \
x; \
} catch (const out_of_range &oor) { \
return oorret; \
} \
return x; \
}()
#define IOS cin.tie(0), ios::sync_with_stdio(false)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class Type> struct is_vector : std::false_type {};
template <class ValueType, class Alloc>
struct is_vector<std::vector<ValueType, Alloc>> : std::true_type {};
template <typename T>
inline ostream &operator<<(ostream &out, const vector<T> &v) {
if (v.empty())
return out;
constexpr bool is_vector_v = is_vector<T>::value;
if (is_vector_v)
for (auto itr = v.begin(); itr != v.end();)
out << (*itr), out << ((++itr != v.end()) ? "\n" : "");
else
for (auto itr = v.begin(); itr != v.end();)
out << (*itr), out << ((++itr != v.end()) ? " " : "");
return out;
}
inline void put() {}
template <class T> inline void put(const T &first) {
std::cout << first << "\n";
}
template <class T, class... N>
inline void put(const T &first, const N &...rest) {
std::cout << first << " ";
put(rest...);
}
inline void putn() {}
template <class T, class... N>
inline void putn(const T &first, const N &...rest) {
std::cout << first << "\n";
putn(rest...);
}
class RollingHash {
private:
const ull base;
const vector<ull> mod;
const int n;
public:
RollingHash(const vector<ull> &mod, const ull &base)
: mod(mod), base(base), n((int)mod.size()) {}
bool contain(const string &s, const string &t) { // sのsubstringにtが存在するか
return contain(s, t, 0, s.size());
}
bool contain(const string &s, const string &t, int l,
int r) { // sの[l,r)にsubstringにtが存在するか
int sl = (int)s.size(), tl = (int)t.size();
chmin(r, sl);
chmax(l, 0);
int ran = r - l;
if (ran < tl)
return false;
vector<ull> sh(n, 0), th(n, 0), p(n, 1);
bool flag = true;
for (int i = 0; i < n; ++i) {
for (int j = l; j < l + tl; ++j) {
sh[i] = sh[i] * base + s[j];
if (sh[i] > mod[i])
sh[i] %= mod[i];
th[i] = th[i] * base + t[j - l];
if (th[i] > mod[i])
th[i] %= mod[i];
p[i] *= base;
if (p[i] > mod[i])
p[i] %= mod[i];
}
}
for (int i = 0; i < n; ++i) {
if (th[i] != sh[i])
flag = false;
}
if (flag) {
return true;
}
for (int j = l + tl; j < r; ++j) {
flag = true;
for (int i = 0; i < n; ++i) {
sh[i] = sh[i] * base + s[j];
if (sh[i] < p[i] * s[j - tl]) {
sh[i] += mod[i] * s[j - tl];
}
sh[i] -= p[i] * s[j - tl];
if (sh[i] > mod[i])
sh[i] %= mod[i];
}
for (int i = 0; i < n; ++i) {
if (th[i] != sh[i])
flag = false;
}
if (flag) {
return true;
}
}
return false;
}
vector<int> find(const string &s, const string &t) {
return find(s, t, 0, s.size());
}
vector<int> find(const string &s, const string &t, int l,
int r) { // sのsubstringがtである先頭のindexを返す
int sl = (int)s.size(), tl = (int)t.size();
vector<int> res;
int ran = r - l;
if (ran < tl)
return res;
vector<ull> sh(n, 0), th(n, 0), p(n, 1);
bool flag = true;
for (int i = 0; i < n; ++i) {
for (int j = l; j < l + tl; ++j) {
sh[i] = sh[i] * base + s[j];
if (sh[i] > mod[i])
sh[i] %= mod[i];
th[i] = th[i] * base + t[j - l];
if (th[i] > mod[i])
th[i] %= mod[i];
p[i] *= base;
if (p[i] > mod[i])
p[i] %= mod[i];
}
}
for (int i = 0; i < n; ++i)
if (th[i] != sh[i])
flag = false;
if (flag)
res.push_back(0);
for (int j = l + tl; j < r; ++j) {
flag = true;
for (int i = 0; i < n; ++i) {
sh[i] = sh[i] * base + s[j];
if (sh[i] < p[i] * s[j - tl]) {
sh[i] += mod[i] * s[j - tl];
}
sh[i] -= p[i] * s[j - tl];
if (sh[i] > mod[i])
sh[i] %= mod[i];
}
for (int i = 0; i < n; ++i)
if (th[i] != sh[i])
flag = false;
if (flag)
res.push_back(j - tl + 1);
}
return res;
}
};
int main() {
IOS;
int n;
string s;
cin >> n >> s;
const vector<ull> mod = {1000000033, 1000000087};
random_device rnd;
mt19937 mt(rnd());
const ull base = mt() + 1e5;
using RH = RollingHash;
RH r(mod, base);
int lb = -1, ub = n + 1;
while (ub - lb > 1) {
int mid = (ub + lb) / 2;
bool flag = false;
REP(i, n - mid) {
string tmp;
FOR(j, i, i + mid) { tmp += s[j]; }
if (r.contain(s, tmp, i + mid, n)) {
flag = true;
break;
}
}
if (flag) {
lb = mid;
} else {
ub = mid;
}
}
put(lb);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define For(i, n1, n2) for (int i = (int)(n1); i < (int)(n2); i++)
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = (ll)(n1); i < (ll)(n2); i++)
#define RFOR(i, n1, n2) for (ll i = ((ll)(n1)-1); i >= (ll)(n2); i--)
#define all(a) (a).begin(), (a).end()
#define SORT(a) sort((a).begin(), (a).end())
#define oorret 0
#define oor(x) \
[&]() { \
try { \
x; \
} catch (const out_of_range &oor) { \
return oorret; \
} \
return x; \
}()
#define IOS cin.tie(0), ios::sync_with_stdio(false)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class Type> struct is_vector : std::false_type {};
template <class ValueType, class Alloc>
struct is_vector<std::vector<ValueType, Alloc>> : std::true_type {};
template <typename T>
inline ostream &operator<<(ostream &out, const vector<T> &v) {
if (v.empty())
return out;
constexpr bool is_vector_v = is_vector<T>::value;
if (is_vector_v)
for (auto itr = v.begin(); itr != v.end();)
out << (*itr), out << ((++itr != v.end()) ? "\n" : "");
else
for (auto itr = v.begin(); itr != v.end();)
out << (*itr), out << ((++itr != v.end()) ? " " : "");
return out;
}
inline void put() {}
template <class T> inline void put(const T &first) {
std::cout << first << "\n";
}
template <class T, class... N>
inline void put(const T &first, const N &...rest) {
std::cout << first << " ";
put(rest...);
}
inline void putn() {}
template <class T, class... N>
inline void putn(const T &first, const N &...rest) {
std::cout << first << "\n";
putn(rest...);
}
class RollingHash {
private:
const ull base;
const vector<ull> mod;
const int n;
public:
RollingHash(const vector<ull> &mod, const ull &base)
: mod(mod), base(base), n((int)mod.size()) {}
bool contain(const string &s, const string &t) { // sのsubstringにtが存在するか
return contain(s, t, 0, s.size());
}
bool contain(const string &s, const string &t, int l,
int r) { // sの[l,r)にsubstringにtが存在するか
int sl = (int)s.size(), tl = (int)t.size();
chmin(r, sl);
chmax(l, 0);
int ran = r - l;
if (ran < tl)
return false;
vector<ull> sh(n, 0), th(n, 0), p(n, 1);
bool flag = true;
for (int i = 0; i < n; ++i) {
for (int j = l; j < l + tl; ++j) {
sh[i] = sh[i] * base + s[j];
if (sh[i] > mod[i])
sh[i] %= mod[i];
th[i] = th[i] * base + t[j - l];
if (th[i] > mod[i])
th[i] %= mod[i];
p[i] *= base;
if (p[i] > mod[i])
p[i] %= mod[i];
}
}
for (int i = 0; i < n; ++i) {
if (th[i] != sh[i])
flag = false;
}
if (flag) {
return true;
}
for (int j = l + tl; j < r; ++j) {
flag = true;
for (int i = 0; i < n; ++i) {
sh[i] = sh[i] * base + s[j];
if (sh[i] < p[i] * s[j - tl]) {
sh[i] += mod[i] * s[j - tl];
}
sh[i] -= p[i] * s[j - tl];
if (sh[i] > mod[i])
sh[i] %= mod[i];
}
for (int i = 0; i < n; ++i) {
if (th[i] != sh[i])
flag = false;
}
if (flag) {
return true;
}
}
return false;
}
vector<int> find(const string &s, const string &t) {
return find(s, t, 0, s.size());
}
vector<int> find(const string &s, const string &t, int l,
int r) { // sのsubstringがtである先頭のindexを返す
int sl = (int)s.size(), tl = (int)t.size();
vector<int> res;
int ran = r - l;
if (ran < tl)
return res;
vector<ull> sh(n, 0), th(n, 0), p(n, 1);
bool flag = true;
for (int i = 0; i < n; ++i) {
for (int j = l; j < l + tl; ++j) {
sh[i] = sh[i] * base + s[j];
if (sh[i] > mod[i])
sh[i] %= mod[i];
th[i] = th[i] * base + t[j - l];
if (th[i] > mod[i])
th[i] %= mod[i];
p[i] *= base;
if (p[i] > mod[i])
p[i] %= mod[i];
}
}
for (int i = 0; i < n; ++i)
if (th[i] != sh[i])
flag = false;
if (flag)
res.push_back(0);
for (int j = l + tl; j < r; ++j) {
flag = true;
for (int i = 0; i < n; ++i) {
sh[i] = sh[i] * base + s[j];
if (sh[i] < p[i] * s[j - tl]) {
sh[i] += mod[i] * s[j - tl];
}
sh[i] -= p[i] * s[j - tl];
if (sh[i] > mod[i])
sh[i] %= mod[i];
}
for (int i = 0; i < n; ++i)
if (th[i] != sh[i])
flag = false;
if (flag)
res.push_back(j - tl + 1);
}
return res;
}
};
int main() {
IOS;
int n;
string s;
cin >> n >> s;
const vector<ull> mod = {2000000011};
random_device rnd;
mt19937 mt(rnd());
const ull base = mt() + 1e5;
using RH = RollingHash;
RH r(mod, base);
int lb = -1, ub = n + 1;
while (ub - lb > 1) {
int mid = (ub + lb) / 2;
bool flag = false;
REP(i, n - mid) {
string tmp;
FOR(j, i, i + mid) { tmp += s[j]; }
if (r.contain(s, tmp, i + mid, n)) {
flag = true;
break;
}
}
if (flag) {
lb = mid;
} else {
ub = mid;
}
}
put(lb);
return 0;
} | replace | 189 | 190 | 189 | 190 | TLE | |
p02913 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// FILE *fi=freopen("1.txt","r",stdin);
int n;
char ch[5001];
string s, sam;
bool check(int k) {
int dem = 1, vt = 0;
vector<pair<string, int>> a;
string s1;
for (int i = 1; i <= k; ++i) {
char c = ch[i];
s1.push_back(ch[i]);
}
a.push_back({s1, 1});
for (int i = k + 1; i <= n; ++i) {
dem++;
s1.erase(s1.begin());
s1.push_back(ch[i]);
a.push_back({s1, dem});
}
sort(a.begin(), a.end());
while (vt < a.size()) {
int j = vt;
while (vt < a.size() - 1 && a[j].first == a[vt + 1].first) {
if (a[j].second + k <= a[vt + 1].second)
return true;
vt++;
}
vt++;
}
return false;
}
void process() {
int l = 0, r = n / 2 + 1, mid, kq = 0;
while (l <= r) {
mid = (l + r) / 2;
if (check(mid)) {
l = mid + 1;
kq = mid;
} else
r = mid - 1;
}
cout << kq;
}
int main() {
scanf("%d", &n);
cin >> s;
s = "1" + s;
for (int i = 1; i <= n; ++i)
ch[i] = s[i];
process();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// FILE *fi=freopen("1.txt","r",stdin);
int n;
char ch[5001];
string s, sam;
bool check(int k) {
int dem = 1, vt = 0;
vector<pair<string, int>> a;
string s1;
for (int i = 1; i <= k; ++i) {
char c = ch[i];
s1.push_back(ch[i]);
}
a.push_back({s1, 1});
for (int i = k + 1; i <= n; ++i) {
dem++;
s1.erase(s1.begin());
s1.push_back(ch[i]);
a.push_back({s1, dem});
}
sort(a.begin(), a.end());
while (vt < a.size()) {
int j = vt;
while (vt < a.size() - 1 && a[j].first == a[vt + 1].first) {
if (a[j].second + k <= a[vt + 1].second)
return true;
vt++;
}
vt++;
}
return false;
}
void process() {
int l = 1, r = n / 2, mid, kq = 0;
while (l <= r) {
mid = (l + r) / 2;
if (check(mid)) {
l = mid + 1;
kq = mid;
} else
r = mid - 1;
}
cout << kq;
}
int main() {
scanf("%d", &n);
cin >> s;
s = "1" + s;
for (int i = 1; i <= n; ++i)
ch[i] = s[i];
process();
return 0;
}
| replace | 39 | 40 | 39 | 40 | 0 | |
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 5e3 + 5;
const ll LINF = 1e18 + 5;
int n;
char s[N];
int nxt[N];
void kmp_pre(char s[], int m, int nxt[]) {
int i = 0, j = nxt[0] = -1;
while (i < m) {
while (j != -1 && s[i] != s[j])
j = nxt[j];
nxt[++i] = ++j;
}
}
bool kmp_work(char s[], int n, char t[], int m) {
int i = 0, j = 0;
kmp_pre(s, n, nxt);
while (i < m) {
while (j != -1 && t[i] != s[j])
j = nxt[j];
i++;
j++;
if (j >= n)
return 1;
}
return 0;
}
bool check(int x) {
for (int i = 0; i + 2 * x - 1 < n; i++)
for (int j = i + x; j + x - 1 < n; j++)
if (kmp_work(s + i, x, s + j, n - j))
return 1;
return 0;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> s;
int l = 1, r = n / 2, ans = 0;
while (l <= r) {
int mid = (l + r) >> 1;
if (check(mid))
ans = mid, l = mid + 1;
else
r = mid - 1;
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 5e3 + 5;
const ll LINF = 1e18 + 5;
int n;
char s[N];
int nxt[N];
void kmp_pre(char s[], int m, int nxt[]) {
int i = 0, j = nxt[0] = -1;
while (i < m) {
while (j != -1 && s[i] != s[j])
j = nxt[j];
nxt[++i] = ++j;
}
}
bool kmp_work(char s[], int n, char t[], int m) {
int i = 0, j = 0;
kmp_pre(s, n, nxt);
while (i < m) {
while (j != -1 && t[i] != s[j])
j = nxt[j];
i++;
j++;
if (j >= n)
return 1;
}
return 0;
}
bool check(int x) {
for (int i = 0; i + 2 * x - 1 < n; i++)
if (kmp_work(s + i, x, s + i + x, n - i - x))
return 1;
return 0;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> s;
int l = 1, r = n / 2, ans = 0;
while (l <= r) {
int mid = (l + r) >> 1;
if (check(mid))
ans = mid, l = mid + 1;
else
r = mid - 1;
}
cout << ans;
return 0;
}
| replace | 38 | 41 | 38 | 40 | TLE | |
p02913 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define loop(it, v) for (auto it = v.begin(); it != v.end(); it++)
#define cont(i, x) for (int i = head[x]; i; i = e[i].nxt)
#define clr(a) memset(a, 0, sizeof(a))
#define ass(a, sum) memset(a, sum, sizeof(a))
#define lowbit(x) (x & -x)
#define all(x) x.begin(), x.end()
#define SC(t, x) static_cast<t>(x)
#define ub upper_bound
#define lb lower_bound
#define pqueue priority_queue
#define mp make_pair
#define pb push_back
#define pof pop_front
#define pob pop_back
#define fi first
#define se second
#define y1 y1_
#define Pi acos(-1.0)
#define iv inline void
#define enter cout << endl
#define siz(x) ((int)x.size())
#define file(x) freopen(x ".in", "r", stdin), freopen(x ".out", "w", stdout)
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<int, pii> tri;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef vector<string> vst;
typedef queue<int> qi;
typedef queue<pii> qii;
typedef set<int> si;
typedef map<int, int> mii;
typedef map<string, int> msi;
const int N = 5010;
const int INF = 0x3f3f3f3f;
const int iinf = 1 << 30;
const ll linf = 2e18;
const int mod = 1000000007;
const double eps = 1e-7;
void douout(double x) { printf("%lf\n", x + 0.0000000001); }
template <class T> void print(T a) {
cout << a << endl;
exit(0);
}
template <class T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> void Tmin(T &a, T &b, T &c) { return min(a, min(b, c)); }
template <class T> void Tmax(T &a, T &b, T &c) { return max(a, max(b, c)); }
void add(int &a, int b) { a = a + b < mod ? a + b : a + b - mod; }
void sub(int &a, int b) { a = (a - b + mod) % mod; }
void mul(int &a, int b) { a = (ll)a * b % mod; }
int addv(int a, int b) { return (a += b) >= mod ? a -= mod : a; }
int subv(int a, int b) { return (a -= b) < 0 ? a += mod : a; }
int mulv(int a, int b) { return (ll)a * b % mod; }
int read() {
int f = 1, x = 0;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int pw(int a, int b) {
int s = 1;
for (; b; b >>= 1, a = (ll)a * a % mod)
if (b & 1)
s = (ll)s * a % mod;
return s;
}
int n, ans;
string s;
int g[N][N];
signed main() {
scanf("%d", &n);
cin >> s;
s = ' ' + s;
rep(i, 1, n) rep(j, i + 1, n) if (s[i] == s[j]) { g[i][j] = g[j][i] = 1; }
rep(i, 1, n) rep(j, i + 1, n) if (g[i][j]) {
int len = 0;
while (i + len < j && g[i + len][j + len])
len++;
chmax(ans, len);
}
printf("%d\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define loop(it, v) for (auto it = v.begin(); it != v.end(); it++)
#define cont(i, x) for (int i = head[x]; i; i = e[i].nxt)
#define clr(a) memset(a, 0, sizeof(a))
#define ass(a, sum) memset(a, sum, sizeof(a))
#define lowbit(x) (x & -x)
#define all(x) x.begin(), x.end()
#define SC(t, x) static_cast<t>(x)
#define ub upper_bound
#define lb lower_bound
#define pqueue priority_queue
#define mp make_pair
#define pb push_back
#define pof pop_front
#define pob pop_back
#define fi first
#define se second
#define y1 y1_
#define Pi acos(-1.0)
#define iv inline void
#define enter cout << endl
#define siz(x) ((int)x.size())
#define file(x) freopen(x ".in", "r", stdin), freopen(x ".out", "w", stdout)
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<int, pii> tri;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef vector<string> vst;
typedef queue<int> qi;
typedef queue<pii> qii;
typedef set<int> si;
typedef map<int, int> mii;
typedef map<string, int> msi;
const int N = 5010;
const int INF = 0x3f3f3f3f;
const int iinf = 1 << 30;
const ll linf = 2e18;
const int mod = 1000000007;
const double eps = 1e-7;
void douout(double x) { printf("%lf\n", x + 0.0000000001); }
template <class T> void print(T a) {
cout << a << endl;
exit(0);
}
template <class T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
template <class T> void Tmin(T &a, T &b, T &c) { return min(a, min(b, c)); }
template <class T> void Tmax(T &a, T &b, T &c) { return max(a, max(b, c)); }
void add(int &a, int b) { a = a + b < mod ? a + b : a + b - mod; }
void sub(int &a, int b) { a = (a - b + mod) % mod; }
void mul(int &a, int b) { a = (ll)a * b % mod; }
int addv(int a, int b) { return (a += b) >= mod ? a -= mod : a; }
int subv(int a, int b) { return (a -= b) < 0 ? a += mod : a; }
int mulv(int a, int b) { return (ll)a * b % mod; }
int read() {
int f = 1, x = 0;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int pw(int a, int b) {
int s = 1;
for (; b; b >>= 1, a = (ll)a * a % mod)
if (b & 1)
s = (ll)s * a % mod;
return s;
}
int n, ans;
string s;
int g[N][N];
signed main() {
scanf("%d", &n);
cin >> s;
s = ' ' + s;
rep(i, 1, n) rep(j, i + 1, n) if (s[i] == s[j]) { g[i][j] = g[j][i] = 1; }
rep(i, 1, n) rep(j, i + 1, n) if (g[i][j]) {
int len = 0;
while (i + len < j && g[i + len][j + len])
g[i + len][j + len] = 0, len++;
chmax(ans, len);
}
printf("%d\n", ans);
return 0;
} | replace | 103 | 104 | 103 | 104 | TLE | |
p02913 | C++ | Runtime Error | #include <bits/stdc++.h>
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
int main() {
ll n, len = 0, start = 0, tmp = 1;
string s, t;
cin >> n >> s;
while (len < 2 / n || start < n - 1) {
t = s.substr(start, tmp);
for (ll i = start + tmp; i < n; i++) {
if (t == s.substr(i, tmp)) {
len = tmp;
break;
}
}
if (len == tmp)
tmp++;
else
start++;
if (start + tmp >= n)
start++;
}
cout << len << endl;
}
| #include <bits/stdc++.h>
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
int main() {
ll n, len = 0, start = 0, tmp = 1;
string s, t;
cin >> n >> s;
while (len < n / 2 && start < n - 1) {
t = s.substr(start, tmp);
for (ll i = start + tmp; i < n; i++) {
if (t == s.substr(i, tmp)) {
len = tmp;
break;
}
}
if (len == tmp)
tmp++;
else
start++;
if (start + tmp >= n)
start++;
}
cout << len << endl;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02913 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define popcnt(x) __builtin_popcount(x)
#define inf 0x3f3f3f3f
#define watch(x) cout << (#x) << " is " << (x) << endl
#define rand() (rand() << 15 | rand())
using namespace std;
typedef long long ll;
#define EPS 1e-9
#define PI acos(-1.0)
const int MOD = 1e9 + 9;
const int N = 5e5 + 4;
const int p = 31;
const int m = 1e9 + 9;
int preH[N];
string s;
int n;
void compute_hash(string const &s) {
long long hash_value = 0;
long long p_pow = 1;
int indx = 0;
for (char c : s) {
hash_value = (hash_value + (c - 'a' + 1) * p_pow) % m;
p_pow = (p_pow * p) % m;
preH[indx++] = hash_value;
}
}
int power(int b, int p) {
if (p == 0)
return 1;
int res = power(b, p / 2);
res = 1LL * res * res % MOD;
if (p & 1) {
res = 1LL * b * res % MOD;
}
return res;
}
int modInv(int x) { return power(x, MOD - 2); }
int mul(int a, int b, int m) { return (1LL * (a % m) * (b % m)) % m; }
int add(int a, int b, int m) { return (1LL * (a % m) + (b % m)) % m; }
long long get_hash(int l, int r) {
long long ret = (preH[r] - (l ? preH[l - 1] : 0) + MOD) % MOD;
return mul(ret, modInv(power(p, l)), MOD);
}
bool valid(int sz) {
unordered_map<int, bool> mp;
for (int i = n - sz; i >= 0; --i) {
int cur = get_hash(i, i + sz - 1);
mp[cur] = true;
int j = i - sz;
if (j < 0)
return false;
int nxt = get_hash(j, j + sz - 1);
if (mp.count(nxt)) {
return true;
}
}
return false;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n;
cin >> s;
compute_hash(s);
int l = 1, r = n, ans = 0;
while (l <= r) {
int mid = (l + r) / 2;
if (valid(mid)) {
ans = mid, l = mid + 1;
} else {
r = mid - 1;
}
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define popcnt(x) __builtin_popcount(x)
#define inf 0x3f3f3f3f
#define watch(x) cout << (#x) << " is " << (x) << endl
#define rand() (rand() << 15 | rand())
using namespace std;
typedef long long ll;
#define EPS 1e-9
#define PI acos(-1.0)
const int MOD = 1e9 + 9;
const int N = 5e5 + 4;
const int p = 31;
const int m = 1e9 + 9;
int preH[N];
string s;
int n;
void compute_hash(string const &s) {
long long hash_value = 0;
long long p_pow = 1;
int indx = 0;
for (char c : s) {
hash_value = (hash_value + (c - 'a' + 1) * p_pow) % m;
p_pow = (p_pow * p) % m;
preH[indx++] = hash_value;
}
}
int power(int b, int p) {
if (p == 0)
return 1;
int res = power(b, p / 2);
res = 1LL * res * res % MOD;
if (p & 1) {
res = 1LL * b * res % MOD;
}
return res;
}
int modInv(int x) { return power(x, MOD - 2); }
int mul(int a, int b, int m) { return (1LL * (a % m) * (b % m)) % m; }
int add(int a, int b, int m) { return (1LL * (a % m) + (b % m)) % m; }
long long get_hash(int l, int r) {
long long ret = (preH[r] - (l ? preH[l - 1] : 0) + MOD) % MOD;
return mul(ret, modInv(power(p, l)), MOD);
}
bool valid(int sz) {
unordered_map<int, bool> mp;
for (int i = n - sz; i >= 0; --i) {
int cur = get_hash(i, i + sz - 1);
mp[cur] = true;
int j = i - sz;
if (j < 0)
return false;
int nxt = get_hash(j, j + sz - 1);
if (mp.count(nxt)) {
return true;
}
}
return false;
}
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n;
cin >> s;
compute_hash(s);
int l = 1, r = n, ans = 0;
while (l <= r) {
int mid = (l + r) / 2;
if (valid(mid)) {
ans = mid, l = mid + 1;
} else {
r = mid - 1;
}
}
cout << ans << "\n";
} | delete | 68 | 71 | 68 | 68 | 0 | |
p02913 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define Would
#define you
#define please
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
string S;
cin >> S;
int kotae = 0;
rep(p, N) {
int Z[2000];
Z[0] = N;
int i = 1;
int j = 0;
while (i < N - p) {
while (i + j < N - p && S[p + j] == S[p + i + j])
j++;
Z[i] = j;
if (j == 0) {
i++;
continue;
}
int k = 1;
while (i + k < N && k + Z[k] < j) {
Z[i + k] = Z[k];
k++;
}
i += k;
j -= k;
}
rep(q, N - p) { kotae = max(kotae, min(Z[q], q)); }
}
co(kotae);
Would you please return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define Would
#define you
#define please
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
string S;
cin >> S;
int kotae = 0;
rep(p, N) {
int Z[5000];
Z[0] = N;
int i = 1;
int j = 0;
while (i < N - p) {
while (i + j < N - p && S[p + j] == S[p + i + j])
j++;
Z[i] = j;
if (j == 0) {
i++;
continue;
}
int k = 1;
while (i + k < N && k + Z[k] < j) {
Z[i + k] = Z[k];
k++;
}
i += k;
j -= k;
}
rep(q, N - p) { kotae = max(kotae, min(Z[q], q)); }
}
co(kotae);
Would you please return 0;
} | replace | 27 | 28 | 27 | 28 | 0 | |
p02913 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define EPS (1e-7)
#define INF (3e9)
using namespace std;
typedef long long int ll;
int N;
string s;
bool exist(int l) {
if (l == 0)
return false;
for (int i = 0; i < N; i++) {
if (N - (i + l) < l)
return false;
string p = s.substr(i, l);
for (int j = i + l; j + l <= N; j++) {
string q = s.substr(j, l);
if (p == q)
return true;
}
}
return false;
}
int main(void) {
cin >> N;
cin >> s;
int left = 0, right = N / 2;
while (abs(right - left) > 1) {
int m = (right + left) / 2;
if (exist(m))
left = m;
else
right = m;
}
if (exist(right))
cout << right << endl;
else
cout << left << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define EPS (1e-7)
#define INF (3e9)
using namespace std;
typedef long long int ll;
int N;
string s;
bool exist(int l) {
if (l == 0)
return false;
for (int i = 0; i < N; i++) {
if (N - (i + l) < l)
return false;
string p = s.substr(i, l);
string q = s.substr(i + l);
if (q.find(p) != string::npos)
return true;
}
return false;
}
int main(void) {
cin >> N;
cin >> s;
int left = 0, right = N / 2;
while (abs(right - left) > 1) {
int m = (right + left) / 2;
if (exist(m))
left = m;
else
right = m;
}
if (exist(right))
cout << right << endl;
else
cout << left << endl;
return 0;
}
| replace | 28 | 33 | 28 | 31 | TLE | |
p02914 | C++ | Runtime Error | /*
source: ABC 141 F Xor Sum 3
*/
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const int MXN = 10005;
int main() {
int n;
LL a[MXN], b[MXN], sum = 0;
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
sum ^= a[i];
}
for (int i = 0; i < n; ++i) {
a[i] &= (~sum);
for (int j = 60; j >= 0; --j) {
if ((a[i] >> j) & 1) {
if (b[j] == 0) {
b[j] = a[i];
break;
} else {
a[i] ^= b[j];
}
}
}
}
LL x = 0;
for (int i = 60; i >= 0; --i) {
x = max(x, x ^ b[i]);
}
cout << (x + (x ^ sum)) << '\n';
} | /*
source: ABC 141 F Xor Sum 3
*/
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
const int MXN = 100005;
int main() {
int n;
LL a[MXN], b[MXN], sum = 0;
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
sum ^= a[i];
}
for (int i = 0; i < n; ++i) {
a[i] &= (~sum);
for (int j = 60; j >= 0; --j) {
if ((a[i] >> j) & 1) {
if (b[j] == 0) {
b[j] = a[i];
break;
} else {
a[i] ^= b[j];
}
}
}
}
LL x = 0;
for (int i = 60; i >= 0; --i) {
x = max(x, x ^ b[i]);
}
cout << (x + (x ^ sum)) << '\n';
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02914 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
#define all(v) v.begin(), v.end()
const int N = (int)3e5;
ll mpow(ll a, ll b) {
if (b == 0)
return 1;
else if (b % 2 == 0) {
ll memo = mpow(a, b / 2);
return memo * memo % MOD;
} else
return mpow(a, b - 1) * a % MOD;
}
ll lpow(ll a, ll b) {
if (b == 0)
return 1;
else if (b % 2 == 0) {
ll memo = lpow(a, b / 2);
return memo * memo;
} else
return lpow(a, b - 1) * a;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
vector<ll> kaijo_memo;
ll kaijo(ll n) {
if (kaijo_memo.size() > n)
return kaijo_memo[n];
if (kaijo_memo.size() == 0)
kaijo_memo.push_back(1);
while (kaijo_memo.size() <= n)
kaijo_memo.push_back(kaijo_memo[kaijo_memo.size() - 1] * kaijo_memo.size() %
MOD);
return kaijo_memo[n];
}
ll nCr(ll n, ll r) {
if (n < r || r < 0)
return 0;
ll ret = 1;
ret *= kaijo(n);
ret %= MOD;
ret *= mpow(kaijo(r), MOD - 2);
ret %= MOD;
ret *= mpow(kaijo(n - r), MOD - 2);
ret %= MOD;
return ret;
}
int main(void) {
int n;
cin >> n;
vector<vector<int>> A;
rep(i, n) {
ll a;
cin >> a;
A.push_back(vector<int>());
rep(j, 60) {
A[i].push_back(a % 2);
a /= 2;
}
reverse(all(A[i]));
}
ll ans = 0;
rep(c, 60) {
int count = 0;
rep(i, n) { count += A[i][c]; }
if (count % 2 == 1) {
ans += lpow((ll)2, 60 - c - 1);
rep(i, n) { A[i][c] = 0; }
}
}
vector<bool> kitei;
rep(i, n) { kitei.push_back(false); }
rep(c, 60) {
int br = 0;
while (br < n && (A[br][c] == 0 || kitei[br])) {
br++;
}
if (br == n) {
continue;
}
kitei[br] = true;
rep(r, n) {
if (br == r)
continue;
if (A[r][c] == 1) {
rep(j, 60) { A[r][j] ^= A[br][j]; }
}
}
}
rep(i, n) {
rep(j, 60) { cerr << A[i][j]; }
cerr << endl;
}
vector<ll> count;
rep(i, 60) { count.push_back(0); }
rep(c, 60) {
if (count[c] > 0) {
if (count[c] % 2 == 1) {
ans += lpow((ll)2, 60 - c);
}
continue;
}
int r = 0;
while (r < n && A[r][c] == 0) {
r++;
}
if (r == n)
continue;
rep(j, 60) { count[j] += A[r][j]; }
ans += lpow((ll)2, 60 - c);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#define INF (int)(1123456789)
#define LINF (long long int)(112345678901234567)
#define chmax(a, b) a = (((a) < (b)) ? (b) : (a))
#define chmin(a, b) a = (((a) > (b)) ? (b) : (a))
#define all(v) v.begin(), v.end()
const int N = (int)3e5;
ll mpow(ll a, ll b) {
if (b == 0)
return 1;
else if (b % 2 == 0) {
ll memo = mpow(a, b / 2);
return memo * memo % MOD;
} else
return mpow(a, b - 1) * a % MOD;
}
ll lpow(ll a, ll b) {
if (b == 0)
return 1;
else if (b % 2 == 0) {
ll memo = lpow(a, b / 2);
return memo * memo;
} else
return lpow(a, b - 1) * a;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
vector<ll> kaijo_memo;
ll kaijo(ll n) {
if (kaijo_memo.size() > n)
return kaijo_memo[n];
if (kaijo_memo.size() == 0)
kaijo_memo.push_back(1);
while (kaijo_memo.size() <= n)
kaijo_memo.push_back(kaijo_memo[kaijo_memo.size() - 1] * kaijo_memo.size() %
MOD);
return kaijo_memo[n];
}
ll nCr(ll n, ll r) {
if (n < r || r < 0)
return 0;
ll ret = 1;
ret *= kaijo(n);
ret %= MOD;
ret *= mpow(kaijo(r), MOD - 2);
ret %= MOD;
ret *= mpow(kaijo(n - r), MOD - 2);
ret %= MOD;
return ret;
}
int main(void) {
int n;
cin >> n;
vector<vector<int>> A;
rep(i, n) {
ll a;
cin >> a;
A.push_back(vector<int>());
rep(j, 60) {
A[i].push_back(a % 2);
a /= 2;
}
reverse(all(A[i]));
}
ll ans = 0;
rep(c, 60) {
int count = 0;
rep(i, n) { count += A[i][c]; }
if (count % 2 == 1) {
ans += lpow((ll)2, 60 - c - 1);
rep(i, n) { A[i][c] = 0; }
}
}
vector<bool> kitei;
rep(i, n) { kitei.push_back(false); }
rep(c, 60) {
int br = 0;
while (br < n && (A[br][c] == 0 || kitei[br])) {
br++;
}
if (br == n) {
continue;
}
kitei[br] = true;
rep(r, n) {
if (br == r)
continue;
if (A[r][c] == 1) {
rep(j, 60) { A[r][j] ^= A[br][j]; }
}
}
}
/*rep(i,n){
rep(j,60){
cerr<<A[i][j];
}
cerr<<endl;
}*/
vector<ll> count;
rep(i, 60) { count.push_back(0); }
rep(c, 60) {
if (count[c] > 0) {
if (count[c] % 2 == 1) {
ans += lpow((ll)2, 60 - c);
}
continue;
}
int r = 0;
while (r < n && A[r][c] == 0) {
r++;
}
if (r == n)
continue;
rep(j, 60) { count[j] += A[r][j]; }
ans += lpow((ll)2, 60 - c);
}
cout << ans << endl;
return 0;
}
| replace | 119 | 123 | 119 | 125 | TLE | |
p02914 | C++ | Runtime Error | // #include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
#define int ll
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
// typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<double, double> pdd;
typedef vector<vector<int>> mat;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
const int INF =
sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
const int MAX_ROW = 510; // to be set appropriately
const int MAX_COL = 510; // to be set appropriately
struct BitMatrix {
int H, W;
bitset<MAX_COL> val[MAX_ROW];
BitMatrix(int m = 1, int n = 1) : H(m), W(n) {}
inline bitset<MAX_COL> &operator[](int i) { return val[i]; }
};
int GaussJordan(BitMatrix &A, bool is_extended = false) {
int rank = 0;
for (int col = 0; col < A.W; ++col) {
if (is_extended && col == A.W - 1)
break;
int pivot = -1;
for (int row = rank; row < A.H; ++row) {
if (A[row][col]) {
pivot = row;
break;
}
}
if (pivot == -1)
continue;
swap(A[pivot], A[rank]);
for (int row = 0; row < A.H; ++row) {
if (row != rank && A[row][col])
A[row] ^= A[rank];
}
++rank;
}
return rank;
}
int linear_equation(BitMatrix A, vector<int> b, vector<int> &res) {
int m = A.H, n = A.W;
BitMatrix M(m, n + 1);
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j)
M[i][j] = A[i][j];
M[i][n] = b[i];
}
int rank = GaussJordan(M, true);
// check if it has no solution
for (int row = rank; row < m; ++row)
if (M[row][n])
return -1;
// answer
res.assign(n, 0);
for (int i = 0; i < rank; ++i)
res[i] = M[i][n];
return rank;
}
BitMatrix encodeBM(vector<int> v, int col) {
BitMatrix M(v.size(), col);
rep(i, 0, (int)v.size()) {
rep(j, 0, col) { M[i][col - (j + 1)] = (v[i] >> j) & 1; }
}
return M;
}
vector<int> decodeBM(BitMatrix M) {
vector<int> v(M.H);
rep(i, 0, M.H) {
int n = 0;
rep(j, 0, M.W) {
if (M[i][j]) {
n |= 1LL << (M.W - (j + 1));
}
}
v[i] = n;
}
return v;
}
int N;
int A[100010];
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
int ans = 0;
rep(i, 0, N) {
cin >> A[i];
ans ^= A[i];
}
vector<int> v;
rep(i, 0, N) { v.push_back(A[i] & (~ans)); }
BitMatrix M = encodeBM(v, 60);
GaussJordan(M, false);
v = decodeBM(M);
int res = 0;
for (auto n : v) {
res ^= n;
}
ans += res * 2;
cout << ans << endl;
return 0;
} | // #include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
#define int ll
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
// typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<double, double> pdd;
typedef vector<vector<int>> mat;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
const int INF =
sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
const int MAX_ROW = 100010; // to be set appropriately
const int MAX_COL = 70; // to be set appropriately
struct BitMatrix {
int H, W;
bitset<MAX_COL> val[MAX_ROW];
BitMatrix(int m = 1, int n = 1) : H(m), W(n) {}
inline bitset<MAX_COL> &operator[](int i) { return val[i]; }
};
int GaussJordan(BitMatrix &A, bool is_extended = false) {
int rank = 0;
for (int col = 0; col < A.W; ++col) {
if (is_extended && col == A.W - 1)
break;
int pivot = -1;
for (int row = rank; row < A.H; ++row) {
if (A[row][col]) {
pivot = row;
break;
}
}
if (pivot == -1)
continue;
swap(A[pivot], A[rank]);
for (int row = 0; row < A.H; ++row) {
if (row != rank && A[row][col])
A[row] ^= A[rank];
}
++rank;
}
return rank;
}
int linear_equation(BitMatrix A, vector<int> b, vector<int> &res) {
int m = A.H, n = A.W;
BitMatrix M(m, n + 1);
for (int i = 0; i < m; ++i) {
for (int j = 0; j < n; ++j)
M[i][j] = A[i][j];
M[i][n] = b[i];
}
int rank = GaussJordan(M, true);
// check if it has no solution
for (int row = rank; row < m; ++row)
if (M[row][n])
return -1;
// answer
res.assign(n, 0);
for (int i = 0; i < rank; ++i)
res[i] = M[i][n];
return rank;
}
BitMatrix encodeBM(vector<int> v, int col) {
BitMatrix M(v.size(), col);
rep(i, 0, (int)v.size()) {
rep(j, 0, col) { M[i][col - (j + 1)] = (v[i] >> j) & 1; }
}
return M;
}
vector<int> decodeBM(BitMatrix M) {
vector<int> v(M.H);
rep(i, 0, M.H) {
int n = 0;
rep(j, 0, M.W) {
if (M[i][j]) {
n |= 1LL << (M.W - (j + 1));
}
}
v[i] = n;
}
return v;
}
int N;
int A[100010];
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> N;
int ans = 0;
rep(i, 0, N) {
cin >> A[i];
ans ^= A[i];
}
vector<int> v;
rep(i, 0, N) { v.push_back(A[i] & (~ans)); }
BitMatrix M = encodeBM(v, 60);
GaussJordan(M, false);
v = decodeBM(M);
int res = 0;
for (auto n : v) {
res ^= n;
}
ans += res * 2;
cout << ans << endl;
return 0;
} | replace | 65 | 67 | 65 | 67 | 0 | |
p02914 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define per(i, a, b) for (ll i = (b)-1; i >= (a); i--)
#define pb push_back
#define mp make_pair
#define bg begin()
#define en end()
#define all(v) (v).begin(), (v).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<int, int>;
static const long long MOD = 1000000007;
static const long long LINF = (ll)(1e18 + 99);
static const int INF = 1e9 + 99;
const int MAX_ROW = 100;
const int MAX_COL = 100005;
struct BitMatrix {
int H, W;
bitset<MAX_COL> val[MAX_ROW];
BitMatrix(int h = 1, int w = 1) : H(h), W(w) {}
inline bitset<MAX_COL> &operator[](int i) { return val[i]; }
};
int xor_elimination(BitMatrix &A) {
// rep(i, 0, A.H) cout << A[i] << endl;
// cout << "\n";
int COL = A.W, ROW = A.H;
int rank = 0;
for (int col = COL; col >= 0; col--) {
int pivot = -1;
for (int row = rank; row <= ROW; row++) {
if (A[row][col]) {
pivot = row;
break;
}
}
if (pivot == -1)
continue;
swap(A[pivot], A[rank]);
for (int row = 0; row <= ROW; row++) {
if (row != rank && A[row][col])
A[row] ^= A[rank];
}
rank++;
}
// rep(i, 0, A.H) cout << A[i] << endl;
return rank;
}
int n;
ll a[100005], ans;
int main(void) {
cin >> n;
BitMatrix M(n, MAX_COL);
rep(i, 0, n) {
cin >> a[i];
M[i] = a[i];
}
for (int d = 61; d >= 0; d--) {
int num = 0;
for (int i = 0; i < n; i++)
num += M[i][d];
if (num % 2) {
ans += (1LL << d);
for (int i = 0; i < n; i++)
M[i][d] = 0;
}
}
int rank = xor_elimination(M);
bitset<MAX_COL> b;
rep(i, 0, rank) b ^= M[i];
rep(i, 0, 62) ans += (1LL << (i + 1)) * b[i];
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define per(i, a, b) for (ll i = (b)-1; i >= (a); i--)
#define pb push_back
#define mp make_pair
#define bg begin()
#define en end()
#define all(v) (v).begin(), (v).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<int, int>;
static const long long MOD = 1000000007;
static const long long LINF = (ll)(1e18 + 99);
static const int INF = 1e9 + 99;
const int MAX_ROW = 100005;
const int MAX_COL = 100;
struct BitMatrix {
int H, W;
bitset<MAX_COL> val[MAX_ROW];
BitMatrix(int h = 1, int w = 1) : H(h), W(w) {}
inline bitset<MAX_COL> &operator[](int i) { return val[i]; }
};
int xor_elimination(BitMatrix &A) {
// rep(i, 0, A.H) cout << A[i] << endl;
// cout << "\n";
int COL = A.W, ROW = A.H;
int rank = 0;
for (int col = COL; col >= 0; col--) {
int pivot = -1;
for (int row = rank; row <= ROW; row++) {
if (A[row][col]) {
pivot = row;
break;
}
}
if (pivot == -1)
continue;
swap(A[pivot], A[rank]);
for (int row = 0; row <= ROW; row++) {
if (row != rank && A[row][col])
A[row] ^= A[rank];
}
rank++;
}
// rep(i, 0, A.H) cout << A[i] << endl;
return rank;
}
int n;
ll a[100005], ans;
int main(void) {
cin >> n;
BitMatrix M(n, MAX_COL);
rep(i, 0, n) {
cin >> a[i];
M[i] = a[i];
}
for (int d = 61; d >= 0; d--) {
int num = 0;
for (int i = 0; i < n; i++)
num += M[i][d];
if (num % 2) {
ans += (1LL << d);
for (int i = 0; i < n; i++)
M[i][d] = 0;
}
}
int rank = xor_elimination(M);
bitset<MAX_COL> b;
rep(i, 0, rank) b ^= M[i];
rep(i, 0, 62) ans += (1LL << (i + 1)) * b[i];
cout << ans << endl;
return 0;
}
| replace | 31 | 33 | 31 | 33 | 0 | |
p02914 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
template <typename T> void printv(const vector<T> &s) {
for (int i = 0; i < (int)(s.size()); ++i) {
cout << s[i];
if (i == (int)(s.size()) - 1)
cout << endl;
else
cout << " ";
}
}
// Bit Matrix
const int MAX_ROW = 110000; // to be set appropriately
const int MAX_COL = 111100; // to be set appropriately
struct BitMatrix {
int H, W;
bitset<MAX_COL> val[MAX_ROW];
BitMatrix(int m = 1, int n = 1) : H(m), W(n) {}
inline bitset<MAX_COL> &operator[](int i) { return val[i]; }
};
// 掃き出し法
void GaussJordan(BitMatrix &A, bool is_extended = false) {
vector<bool> used(A.H, 0);
for (int col = 0; col < A.W; ++col) {
if (is_extended && col == A.W - 1)
break;
int pivot = -1;
for (int row = 0; row < A.H; ++row) {
if (used[row])
continue;
if (A[row][col]) {
pivot = row;
break;
}
}
if (pivot == -1)
continue;
for (int row = 0; row < A.H; ++row) {
if (row != pivot && A[row][col])
A[row] ^= A[pivot];
}
used[pivot] = true;
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int n;
cin >> n;
vll a(n);
ll x = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
x ^= a[i];
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < 60; ++j) {
a[i] &= (((1ll << 60) - 1) ^ x);
}
}
BitMatrix A(n, 60);
for (int i = 0; i < n; ++i) {
ll tmp = 0;
for (int j = 0; j < 60; ++j) {
tmp += ((a[i] >> j) & 1) << (59 - j);
}
A[i] = bitset<MAX_COL>(tmp);
}
GaussJordan(A);
ll add = 0;
for (int i = 0; i < n; ++i) {
ll tmp = 0;
// cout << A[i] << endl;
for (int j = 0; j < 60; ++j) {
tmp *= 2;
tmp += A[i][j];
}
// cout << tmp << endl;
add ^= tmp;
}
cout << x + add * 2 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
template <typename T> void printv(const vector<T> &s) {
for (int i = 0; i < (int)(s.size()); ++i) {
cout << s[i];
if (i == (int)(s.size()) - 1)
cout << endl;
else
cout << " ";
}
}
// Bit Matrix
const int MAX_ROW = 110000; // to be set appropriately
const int MAX_COL = 60; // to be set appropriately
struct BitMatrix {
int H, W;
bitset<MAX_COL> val[MAX_ROW];
BitMatrix(int m = 1, int n = 1) : H(m), W(n) {}
inline bitset<MAX_COL> &operator[](int i) { return val[i]; }
};
// 掃き出し法
void GaussJordan(BitMatrix &A, bool is_extended = false) {
vector<bool> used(A.H, 0);
for (int col = 0; col < A.W; ++col) {
if (is_extended && col == A.W - 1)
break;
int pivot = -1;
for (int row = 0; row < A.H; ++row) {
if (used[row])
continue;
if (A[row][col]) {
pivot = row;
break;
}
}
if (pivot == -1)
continue;
for (int row = 0; row < A.H; ++row) {
if (row != pivot && A[row][col])
A[row] ^= A[pivot];
}
used[pivot] = true;
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int n;
cin >> n;
vll a(n);
ll x = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
x ^= a[i];
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < 60; ++j) {
a[i] &= (((1ll << 60) - 1) ^ x);
}
}
BitMatrix A(n, 60);
for (int i = 0; i < n; ++i) {
ll tmp = 0;
for (int j = 0; j < 60; ++j) {
tmp += ((a[i] >> j) & 1) << (59 - j);
}
A[i] = bitset<MAX_COL>(tmp);
}
GaussJordan(A);
ll add = 0;
for (int i = 0; i < n; ++i) {
ll tmp = 0;
// cout << A[i] << endl;
for (int j = 0; j < 60; ++j) {
tmp *= 2;
tmp += A[i][j];
}
// cout << tmp << endl;
add ^= tmp;
}
cout << x + add * 2 << endl;
}
| replace | 30 | 31 | 30 | 31 | -11 | |
p02914 | C++ | Runtime Error | #include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#if 0
const int MOD = ;
inline int lgput(int a, int b) {
int ans = 1;
while(b > 0) {
if(b & 1) ans = (1LL * ans * a) % MOD;
b >>= 1;
a = (1LL * a * a) % MOD;
}
return ans;
}
inline void mod(int &x) {
if(x >= MOD)
x -= MOD;
}
inline void add(int &x, int y) {
x += y;
mod(x);
}
inline void sub(int &x, int y) {
x += MOD - y;
mod(x);
}
inline void mul(int &x, int y) {
x = (1LL * x * y) % MOD;
}
inline int inv(int x) {
return lgput(x, MOD - 2);
}
#endif
#if 0
int fact[], invfact[];
inline void prec(int n) {
fact[0] = 1;
for(int i = 1; i <= n; i++) {
fact[i] = (1LL * fact[i - 1] * i) % MOD;
}
invfact[n] = lgput(fact[n], MOD - 2);
for(int i = n - 1; i >= 0; i--) {
invfact[i] = (1LL * invfact[i + 1] * (i + 1)) % MOD;
}
}
inline int comb(int n, int k) {
if(n < k) return 0;
return (1LL * fact[n] * (1LL * invfact[k] * invfact[n - k] % MOD)) % MOD;
}
#endif
using namespace std;
const int MAXN = (int)1e5;
int main() {
#if 0
ifstream cin("A.in");
ofstream cout("A.out");
#endif
int i, n;
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
cin >> n;
vector<ll> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
vector<bitset<MAXN + 1>> eqs(60);
vector<int> where(n, -1), sol(n, -1);
ll ans = 0;
for (int bit = 59; bit >= 0; bit--) {
int cnt = 0;
for (i = 0; i < n; i++) {
if (a[i] & (1LL << bit)) {
eqs[bit][i] = 1;
cnt++;
} else {
eqs[bit][i] = 0;
}
}
eqs[bit][n] = 1;
if (cnt & 1) {
ans += (1LL << bit);
continue;
}
for (i = 0; i < n; i++) {
if (eqs[bit][i] && where[i] != -1) {
eqs[bit] ^= eqs[where[i]];
}
}
int pos = -1;
for (i = 0; i < n; i++) {
if (eqs[bit][i]) {
pos = i;
break;
}
}
if (pos == -1 && eqs[bit][n]) {
continue;
}
ans += (2LL << bit);
where[pos] = bit;
sol[pos] = eqs[bit][n];
for (i = n - 1; i > pos; i--) {
if (eqs[bit][i] && where[i] != -1) {
sol[pos] ^= sol[where[i]];
}
}
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
#if 0
const int MOD = ;
inline int lgput(int a, int b) {
int ans = 1;
while(b > 0) {
if(b & 1) ans = (1LL * ans * a) % MOD;
b >>= 1;
a = (1LL * a * a) % MOD;
}
return ans;
}
inline void mod(int &x) {
if(x >= MOD)
x -= MOD;
}
inline void add(int &x, int y) {
x += y;
mod(x);
}
inline void sub(int &x, int y) {
x += MOD - y;
mod(x);
}
inline void mul(int &x, int y) {
x = (1LL * x * y) % MOD;
}
inline int inv(int x) {
return lgput(x, MOD - 2);
}
#endif
#if 0
int fact[], invfact[];
inline void prec(int n) {
fact[0] = 1;
for(int i = 1; i <= n; i++) {
fact[i] = (1LL * fact[i - 1] * i) % MOD;
}
invfact[n] = lgput(fact[n], MOD - 2);
for(int i = n - 1; i >= 0; i--) {
invfact[i] = (1LL * invfact[i + 1] * (i + 1)) % MOD;
}
}
inline int comb(int n, int k) {
if(n < k) return 0;
return (1LL * fact[n] * (1LL * invfact[k] * invfact[n - k] % MOD)) % MOD;
}
#endif
using namespace std;
const int MAXN = (int)1e5;
int main() {
#if 0
ifstream cin("A.in");
ofstream cout("A.out");
#endif
int i, n;
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
cin >> n;
vector<ll> a(n);
for (i = 0; i < n; i++) {
cin >> a[i];
}
vector<bitset<MAXN + 1>> eqs(60);
vector<int> where(n, -1), sol(n, -1);
ll ans = 0;
for (int bit = 59; bit >= 0; bit--) {
int cnt = 0;
for (i = 0; i < n; i++) {
if (a[i] & (1LL << bit)) {
eqs[bit][i] = 1;
cnt++;
} else {
eqs[bit][i] = 0;
}
}
eqs[bit][n] = 1;
if (cnt & 1) {
ans += (1LL << bit);
continue;
}
for (i = 0; i < n; i++) {
if (eqs[bit][i] && where[i] != -1) {
eqs[bit] ^= eqs[where[i]];
}
}
int pos = -1;
for (i = 0; i < n; i++) {
if (eqs[bit][i]) {
pos = i;
break;
}
}
if (pos == -1 && eqs[bit][n]) {
continue;
}
ans += (2LL << bit);
if (pos != -1) {
where[pos] = bit;
sol[pos] = eqs[bit][n];
for (i = n - 1; i > pos; i--) {
if (eqs[bit][i] && where[i] != -1) {
sol[pos] ^= sol[where[i]];
}
}
}
}
cout << ans;
return 0;
}
| replace | 121 | 126 | 121 | 128 | 0 | |
p02914 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int64_t i = 0; i < (int64_t)(n); ++i)
#define endl '\n'
template <typename T> void _dbg(const char *_s, T _h) {
cerr << _s << " = " << _h << "\n";
}
template <typename T, typename... Ts>
void _dbg(const char *_s, T _h, Ts... _t) {
for (int _b = 0; ((_b += *_s == '(') -= *_s == ')') != 0 || *_s != ',';)
cerr << *_s++;
cerr << " = " << _h << ",";
_dbg(_s + 1, _t...);
}
#define int long long
#ifdef LOCAL
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define dbg(...)
#endif
const int N = 500 * 1000 + 17;
const int MOD = 1000 * 1000 * 1000 + 7;
int n;
int a[N], c[N];
bool read() {
if (!(cin >> n))
return false;
forn(i, n) cin >> a[i];
return true;
}
int getrank(int mask, int nn) {
for (int b = 59; b >= 0; --b) {
int j = -1;
forn(i, nn) if ((c[i] >> b) == 1) {
if (j == -1)
j = i;
else
c[i] ^= c[j];
}
}
int res = 0;
forn(i, nn) res += (c[i] != 0);
return res;
}
bool check(int mask) {
forn(i, n) c[i] = (a[i] & mask);
auto r1 = getrank(mask, n);
forn(i, n) c[i] = (a[i] & mask);
c[n] = mask;
auto r2 = getrank(mask, n + 1);
return r1 == r2;
}
void solve() {
int mask = 0, ans = 0;
for (int b = 59; b >= 0; --b) {
int cnt = 0;
forn(i, n) cnt += ((a[i] >> b) & 1);
if (cnt > 0 && cnt % 2 == 0) {
mask |= (1ll << b);
if (!check(mask))
mask ^= (1ll << b);
} else if (cnt > 0) {
ans += (1ll << b);
}
}
cout << ans + 2ll * mask << endl;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
while (read())
solve();
return 0;
}
| #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int64_t i = 0; i < (int64_t)(n); ++i)
#define endl '\n'
template <typename T> void _dbg(const char *_s, T _h) {
cerr << _s << " = " << _h << "\n";
}
template <typename T, typename... Ts>
void _dbg(const char *_s, T _h, Ts... _t) {
for (int _b = 0; ((_b += *_s == '(') -= *_s == ')') != 0 || *_s != ',';)
cerr << *_s++;
cerr << " = " << _h << ",";
_dbg(_s + 1, _t...);
}
#define int long long
#ifdef LOCAL
#define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
#else
#define dbg(...)
#endif
const int N = 500 * 1000 + 17;
const int MOD = 1000 * 1000 * 1000 + 7;
int n;
int a[N], c[N];
bool read() {
if (!(cin >> n))
return false;
forn(i, n) cin >> a[i];
return true;
}
int getrank(int mask, int nn) {
for (int b = 59; b >= 0; --b) {
int j = -1;
forn(i, nn) if ((c[i] >> b) == 1) {
if (j == -1)
j = i;
else
c[i] ^= c[j];
}
}
int res = 0;
forn(i, nn) res += (c[i] != 0);
return res;
}
bool check(int mask) {
forn(i, n) c[i] = (a[i] & mask);
auto r1 = getrank(mask, n);
forn(i, n) c[i] = (a[i] & mask);
c[n] = mask;
auto r2 = getrank(mask, n + 1);
return r1 == r2;
}
void solve() {
int mask = 0, ans = 0;
for (int b = 59; b >= 0; --b) {
int cnt = 0;
forn(i, n) cnt += ((a[i] >> b) & 1);
if (cnt > 0 && cnt % 2 == 0) {
mask |= (1ll << b);
if (!check(mask))
mask ^= (1ll << b);
} else if (cnt > 0) {
ans += (1ll << b);
}
}
cout << ans + 2ll * mask << endl;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
while (read())
solve();
return 0;
}
| insert | 0 | 0 | 0 | 2 | TLE | |
p02914 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long mask = 0;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
long long arr[n];
for (auto &i : arr)
cin >> i;
for (auto i : arr)
mask ^= i;
mask = ~mask;
sort(arr, arr + n,
[](long long x, long long y) { return (x & mask) > (y & mask); });
vector<long long> root;
for (auto i : arr) {
for (auto j : root)
if ((i & mask) > ((i ^ j) & mask))
i = i ^ j;
if (i)
root.push_back(i);
}
long long ans = 0;
for (auto i : root) {
if ((ans & mask) < ((ans ^ i) & mask))
ans = ans ^ i;
}
cout << ans + (~mask ^ ans);
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long mask = 0;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
long long arr[n];
for (auto &i : arr)
cin >> i;
for (auto i : arr)
mask ^= i;
mask = ~mask;
sort(arr, arr + n,
[](long long x, long long y) { return (x & mask) > (y & mask); });
vector<long long> root;
for (auto i : arr) {
for (auto j : root)
if ((i & mask) > ((i ^ j) & mask))
i = i ^ j;
if (i & mask)
root.push_back(i);
}
long long ans = 0;
for (auto i : root) {
if ((ans & mask) < ((ans ^ i) & mask))
ans = ans ^ i;
}
cout << ans + (~mask ^ ans);
return 0;
}
| replace | 28 | 29 | 28 | 29 | TLE | |
p02914 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
template <class C> void print(const C &c, std::ostream &os = std::cout) {
std::copy(std::begin(c), std::end(c),
std::ostream_iterator<typename C::value_type>(os, " "));
os << std::endl;
}
int main() {
int n;
cin >> n;
vl a(n);
ll xorsum = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
xorsum ^= a[i];
}
for (int i = 0; i < n; ++i) {
a[i] &= ~xorsum;
}
vector<bool> used(60, false);
for (ll i = 60; i >= 0; --i) {
int idx = -1;
for (int j = 0; j < n; ++j) {
if (!used[j] && ((1LL << i) & a[j])) {
idx = j;
break;
}
}
if (idx == -1)
continue;
used[idx] = true;
for (int j = 0; j < n; ++j) {
if (j == idx)
continue;
if (a[j] & (1LL << i))
a[j] ^= a[idx];
}
}
ll ret = xorsum;
ll sum = 0;
for (int i = 0; i < n; ++i) {
sum ^= a[i];
}
cout << ret + 2LL * sum << "\n";
return 0;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
template <class C> void print(const C &c, std::ostream &os = std::cout) {
std::copy(std::begin(c), std::end(c),
std::ostream_iterator<typename C::value_type>(os, " "));
os << std::endl;
}
int main() {
int n;
cin >> n;
vl a(n);
ll xorsum = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
xorsum ^= a[i];
}
for (int i = 0; i < n; ++i) {
a[i] &= ~xorsum;
}
vector<bool> used(n, false);
for (ll i = 60; i >= 0; --i) {
int idx = -1;
for (int j = 0; j < n; ++j) {
if (!used[j] && ((1LL << i) & a[j])) {
idx = j;
break;
}
}
if (idx == -1)
continue;
used[idx] = true;
for (int j = 0; j < n; ++j) {
if (j == idx)
continue;
if (a[j] & (1LL << i))
a[j] ^= a[idx];
}
}
ll ret = xorsum;
ll sum = 0;
for (int i = 0; i < n; ++i) {
sum ^= a[i];
}
cout << ret + 2LL * sum << "\n";
return 0;
} | replace | 35 | 36 | 35 | 36 | 0 | |
p02914 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double db;
typedef pair<int, int> pii;
const int N = 10000;
const db pi = acos(-1.0);
#define lowbit(x) (x) & (-x)
#define sqr(x) (x) * (x)
#define rep(i, a, b) for (register int i = a; i <= b; i++)
#define per(i, a, b) for (register int i = a; i >= b; i--)
#define fir first
#define sec second
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define maxd 998244353
#define eps 1e-8
int n, cnt[70];
ll a[100100], p[70];
int read() {
int x = 0, f = 1;
char ch = getchar();
while ((ch < '0') || (ch > '9')) {
if (ch == '-')
f = -1;
ch = getchar();
}
while ((ch >= '0') && (ch <= '9')) {
x = x * 10 + (ch - '0');
ch = getchar();
}
return x * f;
}
ll readll() {
ll x = 0;
int f = 1;
char ch = getchar();
while ((ch < '0') || (ch > '9')) {
if (ch == '-')
f = -1;
ch = getchar();
}
while ((ch >= '0') && (ch <= '9')) {
x = x * 10 + (ch - '0');
ch = getchar();
}
return x * f;
}
void insert(ll x) {
per(i, 60, 0) {
if ((x >> i) & 1) {
if (!p[i]) {
p[i] = x;
return;
} else
x ^= p[i];
}
}
}
ll query() {
ll ans = 0;
per(i, 60, 0) if ((ans ^ p[i]) > ans) ans ^= p[i];
return ans;
}
int main() {
n = read();
rep(i, 1, n) {
a[i] = readll();
rep(j, 0, 60) if ((a[i] >> j) & 1) cnt[j]++;
}
ll ans = 0;
rep(i, 0, 60) if (cnt[i] & 1) {
ans += (1ll << i);
rep(j, 1, n) if ((a[j] >> i) & 1) a[j] ^= (1ll << i);
}
rep(i, 1, n) insert(a[i]);
ans += query() * 2;
printf("%lld", ans);
return ans;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double db;
typedef pair<int, int> pii;
const int N = 10000;
const db pi = acos(-1.0);
#define lowbit(x) (x) & (-x)
#define sqr(x) (x) * (x)
#define rep(i, a, b) for (register int i = a; i <= b; i++)
#define per(i, a, b) for (register int i = a; i >= b; i--)
#define fir first
#define sec second
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define maxd 998244353
#define eps 1e-8
int n, cnt[70];
ll a[100100], p[70];
int read() {
int x = 0, f = 1;
char ch = getchar();
while ((ch < '0') || (ch > '9')) {
if (ch == '-')
f = -1;
ch = getchar();
}
while ((ch >= '0') && (ch <= '9')) {
x = x * 10 + (ch - '0');
ch = getchar();
}
return x * f;
}
ll readll() {
ll x = 0;
int f = 1;
char ch = getchar();
while ((ch < '0') || (ch > '9')) {
if (ch == '-')
f = -1;
ch = getchar();
}
while ((ch >= '0') && (ch <= '9')) {
x = x * 10 + (ch - '0');
ch = getchar();
}
return x * f;
}
void insert(ll x) {
per(i, 60, 0) {
if ((x >> i) & 1) {
if (!p[i]) {
p[i] = x;
return;
} else
x ^= p[i];
}
}
}
ll query() {
ll ans = 0;
per(i, 60, 0) if ((ans ^ p[i]) > ans) ans ^= p[i];
return ans;
}
int main() {
n = read();
rep(i, 1, n) {
a[i] = readll();
rep(j, 0, 60) if ((a[i] >> j) & 1) cnt[j]++;
}
ll ans = 0;
rep(i, 0, 60) if (cnt[i] & 1) {
ans += (1ll << i);
rep(j, 1, n) if ((a[j] >> i) & 1) a[j] ^= (1ll << i);
}
rep(i, 1, n) insert(a[i]);
ans += query() * 2;
printf("%lld", ans);
return 0;
}
| replace | 83 | 84 | 83 | 84 | 12 | |
p02915 | Python | Runtime Error | N = int(input().split())
print(N * N * N)
| N = int(input())
print(N * N * N)
| replace | 0 | 1 | 0 | 1 | TypeError: int() argument must be a string, a bytes-like object or a real number, not 'list' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02915/Python/s074412118.py", line 1, in <module>
N = int(input().split())
TypeError: int() argument must be a string, a bytes-like object or a real number, not 'list'
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.