oj.uz

Submission #634257

# Submission time Handle Problem Language Result Execution time Memory
634257 2022-08-24T08:04:48 Z Mahdi Dabbeh (INOI20_dabbeh) C++17
50 / 100
 2000 ms 192760 KB 
#include<bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define F first
#define S second
typedef long long ll;
typedef pair<int, int> pii;
const int N=5e5+5, M=1e4+5;
int n, q, h, dis[N], nxt[N][28], C[N][28], f[N], p[N][22], ff[N];
vector<int>g[N];
string s[M], L;

void add(const string &t){
    int v=0;
    for(int i=0;i<t.size();++i){
        int z=t[i]-'a';
        if(nxt[v][z]==0){
            dis[h]=dis[v]+1;
            nxt[v][z]=h++;
        }
        v=nxt[v][z];
    }
}

int opr(const int &v, const int &x){
    if(nxt[v][x]!=0){
        C[v][x]=nxt[v][x];
        f[nxt[v][x]]=C[f[v]][x];
    }
    else
        C[v][x]=C[f[v]][x];
    return nxt[v][x];
}

void bfs(){
    vector<int>nd={0};
    f[0]=-1;
    for(int i=0;i<26;++i){
        if(nxt[0][i]!=0){
            C[0][i]=nxt[0][i];
            nd.push_back(nxt[0][i]);
        }
    }
    for(int i=1;i<nd.size();++i){
        int v=nd[i];
        for(int j=0;j<26;++j){
            int u=opr(v, j);
            if(u!=0)
                nd.push_back(u);
        }
    }
}

void dfs(const int &v){
    for(int u: g[v]){
        p[u][0]=v;
        for(int i=1;i<20;++i)
            p[u][i]=p[p[u][i-1]][i-1];
        dfs(u);
    }
}

int bin(int u, int h){
    if(dis[u]<=h)
        return dis[u];
    for(int i=19;i>=0;--i){
        if(dis[p[u][i]]>h)
            u=p[u][i];
    }
    return dis[p[u][0]];
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>q;
    h=1;
    for(int i=0;i<n;++i){
        cin>>s[i];
        add(s[i]);
    }
    bfs();
    for(int i=1;i<h;++i)
        g[f[i]].push_back(i);
    cin>>L;
    int v=0;
    for(int i=0;i<L.size();++i){
        v=C[v][L[i]-'a'];
        ff[i+1]=v;
    }
    dfs(0);
    while(q--){
        int l, r;
        cin>>l>>r;
        int ans=0;
        while(r>l){
            ++ans;
            int rr=bin(ff[r], r-l);
            if(rr==0){
                ans=-1;
                break;
            }
            r-=rr;
        }
        cout<<ans<<'\n';
    }
}

Compilation message

Main.cpp: In function 'void add(const string&)':
Main.cpp:15:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     for(int i=0;i<t.size();++i){
      |                 ~^~~~~~~~~
Main.cpp: In function 'void bfs()':
Main.cpp:44:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     for(int i=1;i<nd.size();++i){
      |                 ~^~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:86:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |     for(int i=0;i<L.size();++i){
      |                 ~^~~~~~~~~

Subtask #1
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12372 KB Output is correct
2 Correct 316 ms 133564 KB Output is correct
3 Correct 309 ms 99752 KB Output is correct
4 Correct 414 ms 130192 KB Output is correct
5 Correct 425 ms 118540 KB Output is correct
6 Correct 503 ms 149652 KB Output is correct
7 Correct 448 ms 167504 KB Output is correct
8 Correct 455 ms 160576 KB Output is correct
9 Correct 375 ms 146056 KB Output is correct
10 Correct 174 ms 45804 KB Output is correct
11 Correct 257 ms 192760 KB Output is correct
12 Correct 192 ms 98664 KB Output is correct
13 Correct 216 ms 150628 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 66668 KB Output is correct
2 Correct 174 ms 105464 KB Output is correct
3 Correct 103 ms 74128 KB Output is correct
4 Correct 51 ms 39600 KB Output is correct
5 Correct 54 ms 38144 KB Output is correct
6 Correct 168 ms 106748 KB Output is correct
7 Correct 211 ms 123016 KB Output is correct
8 Correct 152 ms 89972 KB Output is correct
9 Correct 188 ms 111328 KB Output is correct
10 Correct 216 ms 135028 KB Output is correct
11 Correct 106 ms 75076 KB Output is correct
12 Correct 98 ms 64664 KB Output is correct
13 Correct 230 ms 148020 KB Output is correct
14 Correct 187 ms 132472 KB Output is correct
15 Correct 29 ms 24700 KB Output is correct
16 Correct 155 ms 183704 KB Output is correct
17 Correct 55 ms 66008 KB Output is correct
18 Correct 57 ms 63952 KB Output is correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12372 KB Output is correct
2 Correct 316 ms 133564 KB Output is correct
3 Correct 309 ms 99752 KB Output is correct
4 Correct 414 ms 130192 KB Output is correct
5 Correct 425 ms 118540 KB Output is correct
6 Correct 503 ms 149652 KB Output is correct
7 Correct 448 ms 167504 KB Output is correct
8 Correct 455 ms 160576 KB Output is correct
9 Correct 375 ms 146056 KB Output is correct
10 Correct 174 ms 45804 KB Output is correct
11 Correct 257 ms 192760 KB Output is correct
12 Correct 192 ms 98664 KB Output is correct
13 Correct 216 ms 150628 KB Output is correct
14 Correct 93 ms 66668 KB Output is correct
15 Correct 174 ms 105464 KB Output is correct
16 Correct 103 ms 74128 KB Output is correct
17 Correct 51 ms 39600 KB Output is correct
18 Correct 54 ms 38144 KB Output is correct
19 Correct 168 ms 106748 KB Output is correct
20 Correct 211 ms 123016 KB Output is correct
21 Correct 152 ms 89972 KB Output is correct
22 Correct 188 ms 111328 KB Output is correct
23 Correct 216 ms 135028 KB Output is correct
24 Correct 106 ms 75076 KB Output is correct
25 Correct 98 ms 64664 KB Output is correct
26 Correct 230 ms 148020 KB Output is correct
27 Correct 187 ms 132472 KB Output is correct
28 Correct 29 ms 24700 KB Output is correct
29 Correct 155 ms 183704 KB Output is correct
30 Correct 55 ms 66008 KB Output is correct
31 Correct 57 ms 63952 KB Output is correct
32 Execution timed out 2081 ms 32468 KB Time limit exceeded
33 Halted 0 ms 0 KB -