QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#603646 | #7780. Dark LaTeX vs. Light LaTeX | xxcdsgyes | TL | 634ms | 395620kb | C++20 | 2.3kb | 2024-10-01 18:05:25 | 2024-10-01 18:05:26 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define ull unsigned long long
#define int long long
const int Base = 233,N = 5001;
class string_hash{
public:
static ull pow_base[N];
static void init(int n){
pow_base[0] = 1;
for(int i = 1;i <= n;i++)
pow_base[i] = pow_base[i - 1] * Base;
}
vector<ull> hash;
string s;
void get_hash(int n){
hash.resize(n + 1);
for(int i = 0;i < n;i++){
hash[i + 1] = hash[i] * Base + s[i];
}
}
ull get_hash_range(int l,int r){
return hash[r + 1] - hash[l] * pow_base[r - l + 1];
}
}ss[2];
ull string_hash::pow_base[N] = {0};//静态成员变量要初始化,否则无法使用
map<ull,int> shash[N];
map<ull,int> thash[N];
int dps[N][N];
int dpt[N][N];
void test(){
cin >> ss[0].s >> ss[1].s;
int n = ss[0].s.size();
int m = ss[1].s.size();
ss[0].get_hash(n);
ss[1].get_hash(m);
for(int i = 0;i < n;i++){
for(int j = i;j < n;j++){
shash[j - i + 1][ss[0].get_hash_range(i,j)]++;
}
}
for(int i = 0;i < m;i++){
for(int j = i;j < m;j++){
thash[j - i + 1][ss[1].get_hash_range(i,j)]++;
}
}
for(int i = n - 1;i >= 0;i--){
for(int j = n - 1;j > i;j--){
if(ss[0].s[i] == ss[0].s[j]) dps[i][j] = dps[i + 1][j + 1] + 1;
}
}
for(int i = m - 1;i >= 0;i--){
for(int j = m - 1;j > i;j--){
if(ss[1].s[i] == ss[1].s[j]) dpt[i][j] = dpt[i + 1][j + 1] + 1;
}
}
//s比较大的情况
int ans = 0;
for(int r = 0;r < n;r++){
vector<int> tem(n,0);
for(int l = 0;l <= r;l++){
if(l != 0)
tem[l] += tem[l - 1];
if(thash[r - l + 1].count(ss[0].get_hash_range(l,r))){
ans += (tem[l] + 1) * thash[r - l + 1][ss[0].get_hash_range(l,r)];
}
int _r = l + dps[l][r + 1] - 1;
tem[_r + 2]--;
tem[l]++;
}
}
for(int r = 0;r < m;r++){
vector<int> tem(m + 10,0);
for(int l = 0;l <= r;l++){
if(l != 0)
tem[l] += tem[l - 1];
if(shash[r - l + 1].count(ss[1].get_hash_range(l,r))){
ans += tem[l] * shash[r - l + 1][ss[1].get_hash_range(l,r)];
}
int _r = l + dpt[l][r + 1] - 1;
tem[_r + 2]--;
tem[l]++;
}
}
cout << ans << '\n';
}
signed main(){
IOS
string_hash::init(5000);
int t = 1;//cin >> t;
while(t--){
test();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 4144kb
input:
abab ab
output:
8
result:
ok 1 number(s): "8"
Test #2:
score: 0
Accepted
time: 1ms
memory: 5880kb
input:
abab abaaab
output:
29
result:
ok 1 number(s): "29"
Test #3:
score: 0
Accepted
time: 1ms
memory: 4072kb
input:
abcd abcde
output:
10
result:
ok 1 number(s): "10"
Test #4:
score: 0
Accepted
time: 0ms
memory: 5576kb
input:
aaba ba
output:
6
result:
ok 1 number(s): "6"
Test #5:
score: 0
Accepted
time: 1ms
memory: 4368kb
input:
babababaaabbaabababbbaabbbababbaaaaa aaaabbaababbab
output:
1161
result:
ok 1 number(s): "1161"
Test #6:
score: 0
Accepted
time: 634ms
memory: 395620kb
input:
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...
output:
78156256250000
result:
ok 1 number(s): "78156256250000"
Test #7:
score: 0
Accepted
time: 555ms
memory: 110244kb
input:
gzgzggzgzggzggzgzggzgzggzggzgzggzggzgzggzgzggzggzgzggzggzgzggzgzggzggzgzggzgzggzggzgzggzggzgzggzgzggzggzgzggzgzggzggzgzggzggzgzggzgzggzggzgzggzggzgzggzgzggzggzgzggzgzggzggzgzggzggzgzggzgzggzggzgzggzggzgzggzgzggzggzgzggzgzggzggzgzggzggzgzggzgzggzggzgzggzgzggzggzgzggzggzgzggzgzggzggzgzggzggzgzggzgzggz...
output:
60716448
result:
ok 1 number(s): "60716448"
Test #8:
score: 0
Accepted
time: 543ms
memory: 110200kb
input:
mlmllmllmlmllmlmllmllmlmllmlmllmllmlmllmllmlmllmlmllmllmlmllmlmllmllmlmllmllmlmllmlmllmllmlmllmllmlmllmlmllmllmlmllmlmllmllmlmllmllmlmllmlmllmllmlmllmllmlmllmlmllmllmlmllmlmllmllmlmllmllmlmllmlmllmllmlmllmlmllmllmlmllmllmlmllmlmllmllmlmllmllmlmllmlmllmllmlmllmlmllmllmlmllmllmlmllmlmllmllmlmllmlmllml...
output:
60679828
result:
ok 1 number(s): "60679828"
Test #9:
score: -100
Time Limit Exceeded
input:
vbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbbvbvbbvbvbbvb...