Submission #1201345


Source Code Expand

#include <bits/stdc++.h>
 
using namespace std;
 
typedef pair<int,string> P;
typedef pair<int,int> PP;
typedef pair<string,int> PPP;
int N,Q,K,X,Y,W,Max,I,ans;
const int A=400010,B=100010;
const int INF=1000000009;
 
char C[A]; 
int parent[A],Parent[A],node[A],Node[A],O[26];
int G[B]; PPP H[B];
int J[B];
int JJ[B];
int Cnt[A];
int table[26][26];
vector<int> ch[A],L[A];
string S[B],T[B],U[B],V[B];
 
void dfs(int s,int e,int j,int p){
    int x=S[s][j]-'a'; int k=s;
  for(int i=s; i<=e; i++){
    if(x!=S[i][j]-'a'){
      dfs(k,i-1,j,p); k=i;
      x=S[i][j]-'a'; 
    }
  }
     //cout<<x<<" "<<j<<" "<<I++<<" "<<p<<endl;
     if(x<0) node[I]=26;
     else node[I]=x;
     if(j==0) parent[I]=A-1;
     else parent[I]=p;
     I++;
    if(x<0) return;
    if(j<Max) dfs(k,e,j+1,I-1);
    return;
}
int Pr(int k){
  int p=parent[k];
  if(p==A-1) return A-1;
  if(ch[parent[p]].size()==1){
    return Pr(p);
  }else{
    return p;
  }
}
int cnt(int k){
  if(L[k].size()==0){
    Cnt[k]=1;
    return 1;
  }
  for(int i=0; i<L[k].size(); i++){
    Cnt[k]+=cnt(L[k][i]);
  }
    return Cnt[k];
}
void make(int k){
  if(L[k].size()==0){
    J[X]=node[k]; JJ[X]=k;//cout<<node[k]<<endl;
    X++;
    return;
  }
  for(int i=0; i<L[k].size(); i++){
    make(L[k][i]);
  }
}
void Find(int k){
  if(W>=V[G[K-1]].size()) return;
  if(L[k].size()==0) return;
  int s;
  if(V[G[K-1]][W]-'a'>=0) s=V[G[K-1]][W]-'a'; 
  else s=-INF;
  int t;
  //cout<<k<<endl;
  for(int i=0; i<L[k].size(); i++){
     if(s==node[L[k][i]]){
      t=L[k][i]; 
     }
     if(node[L[k][i]]<26&&table[s][node[L[k][i]]]==0){
      ans+=Cnt[L[k][i]];
      //cout<<k<<" "<<Cnt[L[k][i]]<<" "<<L[k][i]<<endl;
      //Find(L[k][i],j+1); 
     }
     if(node[L[k][i]]==26){
      //cout<<Cnt[L[k][i]]<<" "<<L[k][i]<<endl;
      ans++;
      Find(L[k][i]); 
     }
  }
  W++; Find(t); 
}
 
int main(){
 
cin>>N;
 
for(int i = 0; i < N; i++){
  scanf("%s", C);
  S[i] = string(C);
  if(S[i].size()>Max) Max=S[i].size();
}
 
for(int i = 0; i < N; i++) U[i]=S[i];
 
sort(S,S+N);
 
dfs(0,N-1,0,A-1);  
 
for(int i = 0; i < I; i++) ch[parent[i]].push_back(i);
 
for(int i = 0; i < I; i++){
  int p=parent[i];
  if(ch[p].size()==1) node[i]=-INF;
}
 
for(int i = 0; i < I; i++){
  if(node[i]!=-INF){
    Parent[i]=Pr(i);
  }else{
    Parent[i]=-INF;
  }
}
 
for(int i = 0; i < I; i++){
  if(Parent[i]>=0) L[Parent[i]].push_back(i);
}
 
make(A-1); 
for(int i=0; i<N; i++){
  if(J[i]<=25){
    char c='a'+J[i];
    V[i]=c;
  }
  if(J[i]==26){
    V[i]="";
  }
  int k=JJ[i];
  while(1){
    if(Parent[k]==A-1) break;
    char c='a'+node[Parent[k]];
    V[i]=c+V[i];
    k=Parent[k];
  }
}
 
sort(V,V+N); 
for(int i=0; i<N; i++){
  H[i].first=U[i];
  H[i].second=i;
}
sort(H,H+N);
for(int i=0; i<N; i++){
  G[H[i].second]=i;
}

cnt(A-1);
 
cin>>Q;
 
for(int i=0; i<Q; i++){
  scanf("%d %s",&K,C);
  T[i] = string(C);
  for(int j=0; j<26; j++){
    O[T[i][j]-'a']=j;
  }
 for(int k=0; k<26; k++){
  for(int j=0; j<26; j++){
    table[k][j]=0;
  }
 }
 for(int k=0; k<26; k++){
  for(int j=0; j<26; j++){
   if(O[k]<=O[j]){
    table[k][j]=1;
   }else{
    table[k][j]=0;
   }
  }
 }
  X=0; I=0; ans=0; W=0;
  Find(A-1);
  printf("%d\n",ans+1);
}
 
return 0;
 
}

Submission Info

Submission Time
Task E - Lexicographical disorder
User momotaro1303
Language C++14 (GCC 5.4.1)
Score 0
Code Size 3400 Byte
Status RE
Exec Time 1001 ms
Memory 58880 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:100:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", C);
                 ^
./Main.cpp:163:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %s",&K,C);
                      ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1100
Status
AC × 2
AC × 39
RE × 3
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt AC 443 ms 58368 KB
02.txt AC 437 ms 58368 KB
03.txt AC 443 ms 58368 KB
04.txt AC 438 ms 58368 KB
05.txt AC 338 ms 55296 KB
06.txt AC 258 ms 53376 KB
07.txt AC 240 ms 52992 KB
08.txt AC 226 ms 52864 KB
09.txt RE 132 ms 46336 KB
10.txt AC 202 ms 52736 KB
11.txt AC 306 ms 45696 KB
12.txt AC 326 ms 48000 KB
13.txt AC 353 ms 50944 KB
14.txt AC 240 ms 52736 KB
15.txt AC 210 ms 52992 KB
16.txt AC 201 ms 52736 KB
17.txt RE 131 ms 46336 KB
18.txt AC 869 ms 40960 KB
19.txt AC 882 ms 40960 KB
20.txt AC 990 ms 40960 KB
21.txt AC 991 ms 40960 KB
22.txt AC 1001 ms 40960 KB
23.txt AC 314 ms 48256 KB
24.txt AC 301 ms 45696 KB
25.txt AC 323 ms 48000 KB
26.txt AC 866 ms 40960 KB
27.txt AC 220 ms 42240 KB
28.txt AC 220 ms 43008 KB
29.txt AC 200 ms 42112 KB
30.txt AC 260 ms 45824 KB
31.txt AC 213 ms 44416 KB
32.txt AC 196 ms 43008 KB
33.txt AC 188 ms 44672 KB
34.txt AC 188 ms 44032 KB
35.txt AC 192 ms 45312 KB
36.txt AC 421 ms 58880 KB
37.txt AC 185 ms 46464 KB
38.txt AC 186 ms 46464 KB
39.txt AC 12 ms 33024 KB
40.txt RE 107 ms 33024 KB
s1.txt AC 12 ms 33024 KB
s2.txt AC 12 ms 33024 KB