QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#600381 | #9406. Triangle | ucup-team5075 | AC ✓ | 948ms | 180508kb | C++14 | 5.6kb | 2024-09-29 16:10:38 | 2024-09-29 16:10:38 |
Judging History
answer
//Linkwish's code
#include<bits/stdc++.h>
#define lasp(x) (note[x][len[x]-1])
#define endl '\n'
#define si inline
#define fi first
#define se second
using namespace std;
typedef long long ll;typedef __int128 li;
typedef pair<int,int> pii;typedef pair<ll,ll> pll;
typedef const int ci;typedef const ll cl;ci iinf=INT_MAX;cl linf=1e18;
template<typename T>si bool gmax(T &x,const T y){if(x<y)return x=y,1;return 0;}
template<typename T>si bool gmin(T &x,const T y){if(y<x)return x=y,1;return 0;}
namespace LinkWish{
ci N=1200005;
int n;
vector<int> s[N];
int len[N];
vector<int> note[N];
struct Hoshino{
int fa,len,sz,tr[27],id,edp;
}t[N];
vector<int> e[N];
int las,cnt;
si void insert(int ch){
int cur=0,p=las,q,clone;
if((q=t[p].tr[ch])){
if(t[q].len==t[p].len+1)return las=q,void();
t[clone=++cnt]=t[q],t[clone].len=t[p].len+1,t[q].fa=las=clone;
while(~p&&t[p].tr[ch]==q)t[p].tr[ch]=clone,p=t[p].fa;
}
else{
t[las=cur=++cnt].len=t[p].len+1;
while(~p&&!t[p].tr[ch])t[p].tr[ch]=cur,p=t[p].fa;
if(p==-1)return t[cur].fa=0,void();
if(t[q=t[p].tr[ch]].len==t[p].len+1)return t[cur].fa=q,void();
t[clone=++cnt]=t[q],t[clone].len=t[p].len+1,t[cur].fa=t[q].fa=clone;
while(~p&&t[p].tr[ch]==q)t[p].tr[ch]=clone,p=t[p].fa;
}
}
si string getstr(int x){
string res;
for(int i=t[x].edp;i>=t[x].edp-t[x].len+1;i--)res+=char(s[t[x].id][i]+'a');
return res;
}
si void outp(int x){
for(int i=t[x].edp-t[x].len+1;i<=t[x].edp;i++)
cerr<<s[t[x].id][i];
cerr<<endl;
}
int pf[N][20];
void dfs(int x){
for(int i=1;i<20&&~pf[x][i-1];i++)pf[x][i]=pf[pf[x][i-1]][i-1];
for(int to:e[x]){
pf[to][0]=x,dfs(to);
if(!t[x].id)t[x].id=t[to].id,t[x].edp=t[to].edp;
}
sort(e[x].begin(),e[x].end(),[&](int p,int q){
return s[t[p].id][t[p].edp-t[x].len]<s[t[q].id][t[q].edp-t[x].len];
});
}
int dfn[N],out[N],ind[N],sign;
void getdfn(int x){
sign+=2,ind[sign-1]=ind[dfn[x]=sign]=x;
for(int to:e[x])getdfn(to);
out[x]=sign;
}
si int getp(int x,int len){
for(int i=19;~i;i--)
if(~pf[x][i]&&t[pf[x][i]].len>=len)x=pf[x][i];
return x;
}
si int getrg(int id,int r,int len){return getp(note[id][r],len);}
si int getid(int x,int y){
int l=dfn[x]+1,r=out[x],mid,res=dfn[x],id;
while(l<=r){
id=ind[mid=(l+r)>>1];
if(dfn[getrg(t[id].id,t[id].edp-t[x].len,t[id].len-t[x].len)]<dfn[y])res=mid,l=mid+1;
else r=mid-1;
}
id=ind[++res];
if(res<=out[x]&&getrg(t[id].id,t[id].edp-t[x].len,t[id].len-t[x].len)==y)res++;
return res;
}
struct BIT{
int c[N];
si int lowb(int x){return x&-x;}
si void add(int x,int v){for(;x<=sign;x+=lowb(x))c[x]+=v;}
si int ask(int x){int res=0;for(;x;x-=lowb(x))res+=c[x];return res;}
si int ask(int l,int r){
if(r<l)return 0;
return ask(r)-ask(l-1);
}
si int ask(int l,int r,int fl,int fr){
if(fr<l||fl>r)return ask(l,r);
if(fl<=l&&fr>=r)return 0;
int res=0;
if(fl>l)res+=ask(l,fl-1);
if(fr<r)res+=ask(fr+1,r);
return res;
}
}A,B;
si void Clear(){
for(int i=1;i<=n+1;i++)note[i].clear(),s[i].clear();
for(int i=0;i<=cnt;i++){
memset(t[i].tr,0,sizeof t[i]);
t[i].id=t[i].edp=t[i].fa=t[i].len=t[i].sz=0;
e[i].clear(),dfn[i]=out[i]=0;
}
for(int i=0;i<=sign;i++)A.c[i]=B.c[i]=ind[i]=0;
t[0].fa=-1,cnt=las=0,sign=0;
}
si void solve(int Case){
Clear();
cin>>n;
for(int i=1;i<=n;i++){
string tmp;cin>>tmp,reverse(tmp.begin(),tmp.end());
len[i]=tmp.size(),note[i].resize(len[i]),s[i].resize(len[i]);
for(int j=0;j<len[i];j++)insert(s[i][j]=(tmp[j]-'a')),t[las].edp=j,t[las].id=i,note[i][j]=las;
las=0;
}
insert(26),s[n+1].push_back(26),t[las].id=n+1,t[las].edp=0,note[n+1].push_back(las);
for(int i=1;i<=n;i++)t[lasp(i)].sz++;
for(int i=1;i<=cnt;i++)e[t[i].fa].push_back(i);
for(int i=0;i<=cnt;i++)for(int j=0;j<20;j++)pf[i][j]=-1;
dfs(0),getdfn(0);
vector<int> pos(n);
iota(pos.begin(),pos.end(),1);
sort(pos.begin(),pos.end(),[&](int x,int y){return dfn[lasp(x)]<dfn[lasp(y)];});
vector<pii> all;
for(int i:pos){
if(all.empty()||lasp(all.back().fi)!=lasp(i))all.emplace_back(i,1);
else all.back().se++;
}
ll ans=0;int pre=0;
for(int i=2;i<=sign;i+=2)A.add(i,t[ind[i]].sz);
for(auto i=all.begin();i!=all.end();pre+=(i++)->se){
int np=i->fi,nc=i->se,nid=lasp(np);
ans+=1ll*nc*(nc-1)/2*pre;
ans+=1ll*nc*(nc-1)/2*(nc-2)/3;
for(int now=nid;now;now=t[now].fa)A.add(dfn[now],-t[now].sz);
int forb=dfn[nid];
vector<pii> back;
for(auto j=next(i);j!=all.end();j++){
int tp=j->fi,tid=lasp(tp),tc=j->se;
if(getp(tid,t[nid].len)!=nid)break;
int lid=min(dfn[tid],dfn[note[tp][len[tp]-len[np]-1]])+1;
int pfn=max(getid(nid,tid),getid(tid,nid));
forb=dfn[tid];
if(pfn>=lid){
if(dfn[nid]>lid)ans+=1ll*nc*(nc-1)/2*tc;
ans+=1ll*nc*tc*(A.ask(lid,pfn,forb,out[nid])+B.ask(lid,sign));
}
lid=getid(tid,nid);
if(lid>getid(nid,tid)){
A.add(dfn[tid],-t[tid].sz),B.add(lid,t[tid].sz);
back.emplace_back(tid,lid);
}
}
for(int now=nid;now;now=t[now].fa)A.add(dfn[now],t[now].sz);
for(pii j:back){
B.add(j.se,-t[j.fi].sz);
A.add(dfn[j.fi],t[j.fi].sz);
}
}
cout<<ans<<endl;
}
si void mian(){
int TT;cin>>TT;
for(int i=1;i<=TT;i++)solve(i);
}
}
signed main(){
#ifndef ONLINE_JUDGE
assert(freopen("in.in","r",stdin));
// assert(freopen("out.out","w",stdout));
assert(freopen("out.err","w",stderr));
#endif
ios::sync_with_stdio(0);
cin.tie(0),cout.tie(0);
LinkWish::mian();
return 0;
}
这程序好像有点Bug,我给组数据试试?
詳細信息
Test #1:
score: 100
Accepted
time: 14ms
memory: 103196kb
input:
3 6 cbaa cb cb cbaa ba ba 3 sdcpc sd cpc 1 ccpc
output:
16 0 0
result:
ok 3 lines
Test #2:
score: 0
Accepted
time: 8ms
memory: 103068kb
input:
14 1 lfpbavjsm 2 pdtlkfwn mbd 3 dvqksg dvqksg uhbhpyhj 4 ombwb ombwb ombwb ombwb 5 oztclz oztclz oztclz oztclz kul 6 vco vco vco dtktsqtinm vco vco 7 tb tb kowbsu ygkfphcij tb uvei tb 8 vxxtxssht abnsxbf bydaae bydaae udalyvmcef bydaae bydaae bydaae 9 aaze zvyonw qjfv mmhkef qjfv qjfv qjfv mmhkef qj...
output:
0 0 0 4 10 20 10 20 41 14 63 74 18 11081
result:
ok 14 lines
Test #3:
score: 0
Accepted
time: 15ms
memory: 97676kb
input:
11 10 bppzfsncq bppzfsncq vcqxgcehdx bppzfsncq bppzfsncq muwrcvt w aanwhqmync aanwhqmync bppzfsncq 10 t jkky t z t t z z z t 10 qidkyca uhqubvbo kosyvh gsj gsj gsj duo jrro gsj jrro 10 lhktb lhktb lhktb uohl lhktb r lhktb lhktb wruim lhktb 10 e gqvdmpvxb gqvdmpvxb gqvdmpvxb sttirbhz gqvdmpvxb zdfpm ...
output:
30 60 15 35 20 20 23 12 38 44 8047
result:
ok 11 lines
Test #4:
score: 0
Accepted
time: 11ms
memory: 103220kb
input:
11 100 kalgqjh mdszzwe qxn kalgqjh hy kalgqjh suplvp r kkeoxmx tcoise suplvp suplvp y kalgqjh vrwniyici jmnyrradyq kalgqjh kalgqjh suplvp rkg xzevyk zc suplvp hcupv kalgqjh qakyahjaoi mum pbg u ip kalgqjh kalgqjh jngc ylr suplvp qxn kalgqjh bzwodm e kalgqjh kalgqjh evmm kbymvbccs kalgqjh suplvp kalg...
output:
12478 6722 9220 6668 4934 11233 7950 5470 4525 5743 1586066
result:
ok 11 lines
Test #5:
score: 0
Accepted
time: 14ms
memory: 102176kb
input:
2 1000 t lhijhkxzzx nhfiksblww h xg z dcbmbvyz ois ynwjgfp oqzv qtoinl gr teu kmza hs t mwhewk kjmuneon bekku qheweh szhagft fcwjp bobwnap y oqpole oqzv xeaiyhfeg rjkdidea wmeslege vyyi teomn yvmcnw vnvum tgnl swqqruuvc xxllevp bov dse e b rtbhogkx nzs e bs pppyndgrrv n tzbwqdusn e xeaiyhfeg i agnet...
output:
2430570 1904282
result:
ok 2 lines
Test #6:
score: 0
Accepted
time: 69ms
memory: 112480kb
input:
503 16 yh yh yhc yhc yhcowdfqlwfidnx yhc yhc yh yhcowdfqlwfidn yhcowdfqlwfidnx yh h yh yhcowdfqlwfidnx yhcowdfqlwfidnx yhc 19 nb nbg vpfkllgv nmzqfsuafqtayjjjcidpygz nb nb gutq n omyuvm fgxtfbhuglxyiumi nbghjuti nbg nb fgxt nbghjuti n nb nbg n 7 rtjiwfidoahckhvgoxvvrncqvgerqiuaruiftakvugsgnsw wllcan...
output:
531 485 6 12 4 118 6 3 1635 18 373 20 954 6208 45 12 1124 79 267 2 5778 22 13 1 1 16 630 0 7 16315 0 2155 2308 26 936 109 103 5 0 2492 7 2 114 144 11 158 0 0 101 455 0 12234 78 631 5402 94 66 84 161 4412 5 3 81 22 20 13 52 632 6 137 56 2 3 64521 122 330 0 0 7 0 113 249 8 301 335 1825 110 4 108 50 10...
result:
ok 503 lines
Test #7:
score: 0
Accepted
time: 74ms
memory: 116396kb
input:
503 23 rjyyivdg n n n n n n n nmr n nmrk nm rjyyivdguyiffnvunoxconw n n n o lixclcmwthwkrsi mqluhyypgfkmdvgpzju n nmrk rjy n 15 jotwxwhaqdxmazhslyouztprzlirisvwvduojb jot jotwxw j jotwx jotwx gohg j gdgneodagmdhvvapjh jotwxw xs vurk vurk j xs 7 xrczucnkbemaymvabkkwnn xrczucnkbemaymvabkkwnn xrczucnkb...
output:
855 58 35 0 1 56 2 112 1 8465 242 56 110 23 544 0 3 17 29 11 764 20 9 0 4 77 812 35 4 10 32 437 9 2364 3 2 11 2 421 50 4 107 1 62 1120 3 1 16 3970 1147 1026 8 4 85 9 31 61 16 205 2 2 84 238 1 1 51 4 0 16 61 331 4 16 7 0 7 148 10 13 2 1 37 1 67 0 296 1 0 644 32 2 10 0 5 126 3490 4 0 10 331 1216 7921 ...
result:
ok 503 lines
Test #8:
score: 0
Accepted
time: 62ms
memory: 109212kb
input:
503 5 ljtolmgjndlwoyjjttak mihjdhkyfnafwrpeuiuiurusvsnu ljtolmgjndlwoyjjttak mihjd ljtolmgjndlwoyjjttak 25 lhx lh lhx lh k lh kninp l lhx lhx izeqohkpfuovopebttqaufmmlivd lhx lhx qid lhx lh lhx lhx oklb l lhx lhx lhx lhx l 9 mxeonfwpujrilfigjoiyjkzdmi fezhyrcyqy mx fezh f dmvfbklnkxmnetib dmvfbkln m...
output:
4 1476 27 26 117970 2 105 30 4 737 4 2 19 48 34 434 6 78331 22 23 0 228 56 4 3 305 9 84 132 199 20 3 4057 0 0 20 35 34 48 4 266 14 17 4788 545 28989 0 10 535 84 1 1775 322 11 57 16 15 1331 5 0 10 5 183 8 2 237 10 0 60 20 42 7 10 297 14 210 6254 7 3 0 13 2744 119 47 0 1 68114 17 1 2 1 7 1 2 113 26 0 ...
result:
ok 503 lines
Test #9:
score: 0
Accepted
time: 69ms
memory: 113608kb
input:
503 11 wkeoqqqpvmgdv w w w wkeoqqqpvmgdv sgrwmsfwclpamgq wkeoqqqpvm qkmbyvcxjsh wkeoqqqpvm wke wkeoqqqpvmgdv 7 otd qelodfwrqeprgyvzbcjljx qe qelodfwrqeprgyvzbcjlj qelodfwrqeprgyvzbcjlj qelodfwrqeprgyvzbcjlj c 15 rce rce fwq fwqqfcjrhqot rceft jkdrcehfwhqkupe fwq r jkdr fwq rceft rce fwqqfcjrhqot fwq...
output:
156 17 213 12 20 1 374 4 0 26 26 3 122 30 4005 24 1385 50 84 44 0 112 42 36 19 887 99 5 9 13 2 5029 52 14 84 116 2 10 4 8 141 9287 822 37 5 13 25 1030 0 2 3 35 81 1 0 1 138 0 578 7 30 636 63 22 2118 863 5377 33 34 10 156 336 1 7 7 4 1793 2 124 13 4 2015 7 23 1 4516 3 17 6 35 13336 9 61 3093 0 1 7 22...
result:
ok 503 lines
Test #10:
score: 0
Accepted
time: 413ms
memory: 176300kb
input:
1003 3 mpfowyd mpfowydrivrkjiarwcxwbfqvnktlzcfolbbsgelvcnzeqy hytzojmfeiwtpquxhneeznbdjjlsptedaorwfsxi 3 nyfcq nyfcqgrmshiwmgcbukozvetdggebkkychamof nyfcqgrmshiwmgcbukozvetdggebkkychamofadozdympuejvhdnpi 8 yoeqyfcjsywowdrlzzybjvtycqvizzomc zci yoeqyfc zcinc yoeqyfcjsywowdrlzzybjvtycqvizzomc y zcinc ...
output:
0 1 26 10 66 403 1 265 1025 16 329 4 1219 1 10 70 30 182 60 5 71 1 20 5343 22328 40667 90 6983 66 10 35 20 250 307 913 98 44 5393 56 280 270 3 3 2229 77 17 774 50 5 21 0 208 8 14 185 35 20 11 465 132 176 10 0 10 1704 13 44 141 0 0 5 10 79 17 213 10 108 0 0 289 10 255 27 493 4 1 24 379 30 9 284 173 2...
result:
ok 1003 lines
Test #11:
score: 0
Accepted
time: 439ms
memory: 163604kb
input:
1003 6 exssl exsslhsuwyemcafatpinzvdeypwjqsnvxlkvmpywgx f exss exs exsslhsuwyemcafatpinzvdeypwjqsnvxlkvmpywgx 7 hzzev hzzevmltbehnvjfhsz hzzevmltbe hzzevmltbehnvjfhszqzobn hzzevmltbehnvjf hm hzzevmltbehnvjfhszqzobn 9 rdx rdxnxdfcyrdpgwzwtqgtu rdx rdxnxdfcyrdpgwzwtqgtu f kpotnxntufvd kpotnxntufvdlmij...
output:
3 19 41 134 107 2 372 0 466 456 20 13 25 339 64 170 1 5 27295 3 1 221 116 11 29 19 1006 16827 16 19863 4 6 5784 3 20 21130 66 1275 100 731 83 3 84 0 32 3 615 207 8 44 245 48 165 18050 128 11 864 21 3 1221 120 51 21 8 247 302 0 1098 0 57 42 20 0 845 1 84 16 4 0 2 836 482 4 12 150 654 1035 142 291 34 ...
result:
ok 1003 lines
Test #12:
score: 0
Accepted
time: 444ms
memory: 172452kb
input:
1003 10 lgbpleleme u u uxpwzhga uxpwzhg u uxpwzhgaadltqqpqkbteylath u uxpwzhgaadltqqpqkbteylath uxpwzhgaadltqqpq 9 aqoxfsmqwpafbocodlpdykesadqgiggw swzjus oim aqoxfsmq aqoxfsmqwpafboc swzju nohnsjbdhljarh swzjusx aqoxf 20 mbdiqaartewavbbwbhftzwxm k mbdiqaartewavbbwbhftzwxm kx kxs kxsqv kx kx kxsqv k...
output:
70 0 290 10 604 1770 2 913 1 165 16 316 4 169 26 3 36 2 1549 2 13 15 21 14 109 34 16 1889 132 1700 1 96 17 436 2 0 6183 4144 0 4 50 4 10 5 4 4 78 10 16 97 16 50204 15871 350 3 865 46 7 0 73 38 46 29 1946 65 22088 7 91 43 310 1806 0 50 4 17 38725 262 50 0 304 141 35 50 0 22760 2973 14 410 1112 20 703...
result:
ok 1003 lines
Test #13:
score: 0
Accepted
time: 443ms
memory: 170188kb
input:
1003 7 amhy ncfsepqjimkaxkvlsqw bgk ncfsepqjim n amhyderccfrcdclbgrhxospemrlwctcnogb ncfsepqjimkaxkvlsqwzxubaz 15 ul k cqm kuixi ovrwzbvkvkzfuqtxooevyvuayhupn o kuixi ulihj k k kzlmrtwddplvqvakmeda ku k kzlmrtwddplvqvakmeda k 15 mf dwhth cwkbrvykvcvqltdovbcy dwhth dwht dwhth cwkbrvykvcvqltdovbcy dwh...
output:
4 58 203 10 8614 17 20 0 0 4 43987 18 164 144 35 412 3 19 20 51 50 0 4 16 37 1 4 14 8 526 197 71 20 26 20 35 55 16 0 3667 274 2024 4 33 19492 435 1 2 10 10 22631 32 690 1 0 13 166 561 6 67 10 33 286 4 1 89 11 18 12266 26 23 280 286 16 400 102 0 10 46 40 1 84 27 14 5699 105 197 39 818 36 6 29491 4 17...
result:
ok 1003 lines
Test #14:
score: 0
Accepted
time: 431ms
memory: 178236kb
input:
1003 36 dv d dvgsku dv d d dv dv d d dv dvg dvgs dvgsku dv d d dv d d nwitakortf dv dv dvg d dvg dv d tksvgjqlfzdolvno d d dvg dv dv dvgsku dv 6 w oursusfeydeqnv wdrteonpibjzxvhzvqbytajwkgqwmucrzemrfowydhkkd wdrteonpibjzxvhzvqb wdrteo wdrteo 11 crmoyb c crmo wkyxgzsh cr flnsuvxkaqknoofhjdackgvavroh ...
output:
1840 19 9 370 7 31 892 504 6 56 150 209 41 0 255 221 1 7670 0 14 638 3 100 1365 17 3 20 16 74 20 15 496 3270 16 0 62 2 345 1 65 2277 0 1 39 0 0 1 2381 707 152 8485 289 109 2066 2803 38 197 1 46 38 44 323 14 1 10 98 2 116 38 82 0 56 2220 4 10 1879 29 241 65 17 7 10 6 8 162 20 9 2 10 4 4 0 4 76 50 194...
result:
ok 1003 lines
Test #15:
score: 0
Accepted
time: 228ms
memory: 180508kb
input:
1003 2 serwtujvdfqkirmfdetefaevwuuwqlkcmierfpxwzimcpmvdqvuwxwqtuq serwtujvdfqkirmfdetefaevwuuwqlkc 6 cnbkhujgexqrjtbcqwncpeiyj cnbkhujgexqrj cnbkhujgexqrj gisjwbxjohpnbvmtwvhhvb c cnbkhujgexqrjtbcqwncpeiyj 21 k k k kpqon k aesamtzjajczokh kpqonwvoiy kpqonwv kpqonwv sbl kpqonwvoiy k tdyvo tdyvo kpqon...
output:
0 4 199 4 199 16 650 1 506 9 0 12 81 4 1587 10 22 0 12383 436 29 152 61990 3 40 4 10 26 1 17 4 102 22 41 32 244 3 6486 1470 2 1425 22 5 2 321 5 70724 1023 7 41 15 7 10 5 11 0 186 34 7 7 4 5 0 1184 23 115 10 124 48 0 19104 969 1179 9 7 1 23042 809 100 86 18 4 1 27 77 84 0 30 1 0 6023 418 10 1 15 52 0...
result:
ok 1003 lines
Test #16:
score: 0
Accepted
time: 238ms
memory: 154428kb
input:
4 10000 aacbfedgih aachgdeibf aacbfedhgi aabciedghf aacbgeihfd aacdgbhefi aacgfeihdb aabgfehidc aabfgehdci aabhdceigf aacdebihfg aabdgeihcf aabgdcihfe aaceibdgfh aacdgehbif aabfdicehg aabhdfegic aacfibgdeh aacdfghieb aabgdifhec aabgdfhice aachedbgif aabdecgihf aabdchefig aacfgbeihd aabdgfihce aabehd...
output:
0 0 0 0
result:
ok 4 lines
Test #17:
score: 0
Accepted
time: 948ms
memory: 160624kb
input:
4 317 aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa...
output:
2600268 13538368 13577242 13530312
result:
ok 4 lines
Extra Test:
score: 0
Extra Test Passed