QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#603453 | #7780. Dark LaTeX vs. Light LaTeX | xxcdsgyes# | TL | 1588ms | 33812kb | C++20 | 2.8kb | 2024-10-01 16:38:46 | 2024-10-01 16:38:47 |
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};//静态成员变量要初始化,否则无法使用
//set<ull> shash[N];
//set<ull> thash[N];
map<ull,int> shash[N];
map<ull,int> thash[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)]++;
}
}
//s比较大的情况
int ans = 0;
for(int r = 0;r < n;r++){
priority_queue<int> pqu;
for(int l = 0;l <= r;l++){
if(thash[r - l + 1].count(ss[0].get_hash_range(l,r))){
while(!pqu.empty() && -pqu.top() < l - 1) pqu.pop();
//cout << l << ' ' << r << ' ' << ((int)pqu.size() + 1) * thash[r - l + 1][ss[0].get_hash_range(l,r)] << '\n';
ans += ((int)pqu.size() + 1) * thash[r - l + 1][ss[0].get_hash_range(l,r)];
}
//begin = l,begin2 = r + 1
int _l = l,_r = r;
while(_l <= _r){
int mid = (_l + _r) / 2;
if(r + 1 + mid - _l >= n) _r = mid - 1;
else{
if(ss[0].get_hash_range(l,mid) == ss[0].get_hash_range(r + 1,r + 1 + mid - l)) _l = mid + 1;
else _r = mid - 1;
}
}
pqu.push(-_r);
}
}
//t比较大的情况
for(int r = 0;r < m;r++){
priority_queue<int> pqu;
for(int l = 0;l <= r;l++){
if(shash[r - l + 1].count(ss[1].get_hash_range(l,r))){
while(!pqu.empty() && -pqu.top() < l - 1) pqu.pop();
ans += (int)pqu.size() * shash[r - l + 1][ss[1].get_hash_range(l,r)];
//cout << l << ' ' << r << ' ' << (int)pqu.size() * shash[r - l + 1][ss[1].get_hash_range(l,r)] << '\n';
}
//begin = l,begin2 = r + 1
int _l = l,_r = r;
while(_l <= _r){
int mid = (_l + _r) / 2;
if(r + 1 + mid - _l >= m) _r = mid - 1;
else{
if(ss[1].get_hash_range(l,mid) == ss[1].get_hash_range(r + 1,r + 1 + mid - l)) _l = mid + 1;
else _r = mid - 1;
}
}
pqu.push(-_r);
}
}
cout << ans << '\n';
}
signed main(){
IOS
string_hash::init(5000);
int t = 1;//cin >> t;
while(t--){
test();
}
}
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 4336kb
input:
abab ab
output:
8
result:
ok 1 number(s): "8"
Test #2:
score: 0
Accepted
time: 1ms
memory: 4036kb
input:
abab abaaab
output:
29
result:
ok 1 number(s): "29"
Test #3:
score: 0
Accepted
time: 1ms
memory: 4116kb
input:
abcd abcde
output:
10
result:
ok 1 number(s): "10"
Test #4:
score: 0
Accepted
time: 1ms
memory: 4036kb
input:
aaba ba
output:
6
result:
ok 1 number(s): "6"
Test #5:
score: 0
Accepted
time: 1ms
memory: 4096kb
input:
babababaaabbaabababbbaabbbababbaaaaa aaaabbaababbab
output:
1161
result:
ok 1 number(s): "1161"
Test #6:
score: 0
Accepted
time: 1588ms
memory: 4896kb
input:
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...
output:
78156256250000
result:
ok 1 number(s): "78156256250000"
Test #7:
score: 0
Accepted
time: 414ms
memory: 33800kb
input:
gzgzggzgzggzggzgzggzgzggzggzgzggzggzgzggzgzggzggzgzggzggzgzggzgzggzggzgzggzgzggzggzgzggzggzgzggzgzggzggzgzggzgzggzggzgzggzggzgzggzgzggzggzgzggzggzgzggzgzggzggzgzggzgzggzggzgzggzggzgzggzgzggzggzgzggzggzgzggzgzggzggzgzggzgzggzggzgzggzggzgzggzgzggzggzgzggzgzggzggzgzggzggzgzggzgzggzggzgzggzggzgzggzgzggz...
output:
60716448
result:
ok 1 number(s): "60716448"
Test #8:
score: 0
Accepted
time: 422ms
memory: 33812kb
input:
mlmllmllmlmllmlmllmllmlmllmlmllmllmlmllmllmlmllmlmllmllmlmllmlmllmllmlmllmllmlmllmlmllmllmlmllmllmlmllmlmllmllmlmllmlmllmllmlmllmllmlmllmlmllmllmlmllmllmlmllmlmllmllmlmllmlmllmllmlmllmllmlmllmlmllmllmlmllmlmllmllmlmllmllmlmllmlmllmllmlmllmllmlmllmlmllmllmlmllmlmllmllmlmllmllmlmllmlmllmllmlmllmlmllml...
output:
60679828
result:
ok 1 number(s): "60679828"
Test #9:
score: -100
Time Limit Exceeded
input:
vbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbbvbvbbvbvbbvbbvbvbbvbbvbvbbvbvbbvb...