QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#744464 | #7780. Dark LaTeX vs. Light LaTeX | Suhy | Compile Error | / | / | C++23 | 2.7kb | 2024-11-13 22:00:34 | 2024-11-13 22:00:37 |
Judging History
你现在查看的是最新测评结果
- [2024-11-25 20:53:52]
- hack成功,自动添加数据
- (/hack/1258)
- [2024-11-13 22:00:37]
- 评测
- 测评结果:Compile Error
- 用时:0ms
- 内存:0kb
- [2024-11-13 22:00:34]
- 提交
answer
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#pragma GCC optimize(3)
using namespace std;
const int maxn = 10004;
const int b1 = 37;
const int b2 = 37;
int n, m;
int s[maxn], t[maxn];
ull ps1[maxn], pt1[maxn];
unordered_map <ull, int> mp1;
ull pwb1[maxn];
ll ans;
int f[maxn], cnt[maxn];
//babaa
void wok(int dlt)
{
for(int i = 2, l = 2 + dlt - n + 1, r = dlt; i < n; i ++, l ++)
{
int j = f[i - 1];
while(j > 0 && (s[j + 1 + dlt] != s[i + dlt] || (i + dlt > n && (i + dlt - j <= n || j + dlt >= n))))
j = f[j];
if(s[j + 1 + dlt] == s[i + dlt])
j ++;
f[i] = j;
cnt[i] = 0;
if(j != 0) cnt[i] ++;
cnt[i] += cnt[j];
if(cnt[i] && l > 1 && r - l + 1 <= m)
{
//cout<<l<<' '<<r<<' '<<cnt[i]<<' '<<i<<' '<<f[i]<<' '<<s[i + dlt]<<' '<<s[1 + dlt]<<' ';
// for(int j = l; j <= r; j ++)
// putchar(s[j] + 'a' - 1);
// cout<<endl;
ans += cnt[i] * mp1[ps1[r] - ps1[l - 1] * pwb1[r - l + 1]];
//cout<<ps1[r] - ps1[l - 1] * pwb1[r - l + 1]<<endl;
}
}
}
void work()
{
mp1.clear();
for(int i = 1; i <= m; i ++)
{
for(int j = 1; j <= i; j ++)
{
if(i - j + 1 <= n)
mp1[pt1[i] - pt1[j - 1] * pwb1[(i - j + 1)]] ++;
}
}
for(int i = 1; i <= n; i ++)
s[i + n] = s[i];
for(int i = 1; i < n; i ++)
{
wok(i);
}
}
signed main()
{
char c = getchar();
while('a' <= c && c <= 'z')
s[++ n] = c - 'a' + 1, c = getchar();
while(!('a' <= c && c <= 'z'))
c = getchar();
while('a' <= c && c <= 'z')
t[++ m] = c - 'a' + 1, c = getchar();
for(int i = 1; i <= n; i ++)
{
ps1[i] = ps1[i - 1] * b1 + s[i];
}
for(int i = 1; i <= m; i ++)
{
pt1[i] = pt1[i - 1] * b1 + t[i];
}
pwb1[0] = pwb2[0] = 1;
for(int i = 1; i <= max(n, m); i ++)
{
pwb1[i] = 1ll * pwb1[i - 1] * b1;
}
swap(n, m);
for(int i = 1; i <= max(n, m); i ++)
{
swap(s[i], t[i]);
swap(ps1[i], pt1[i]);
}
work();
//cout<<"-----"<<endl;
swap(n, m);
for(int i = 1; i <= max(n, m); i ++)
{
swap(s[i], t[i]);
swap(ps1[i], pt1[i]);
}
work();
for(int i = 1; i <= n; i ++)
{
for(int j = 1; j <= i; j ++)
{
if(i - j + 1 <= m)
{
ull hsh1 = ps1[i] - ps1[j - 1] * pwb1[(i - j + 1)];
ans += mp1[hsh1];
}
}
}
cout<<ans<<endl;
}
詳細信息
answer.code: In function ‘int main()’: answer.code:82:15: error: ‘pwb2’ was not declared in this scope; did you mean ‘pwb1’? 82 | pwb1[0] = pwb2[0] = 1; | ^~~~ | pwb1