oj.uz

Submission #572214

# Submission time Handle Problem Language Result Execution time Memory
572214 2022-06-04T02:10:18 Z AGE Ispit (COCI19_ispit) C++14
63 / 90
 459 ms 45568 KB 
#include<bits/stdc++.h>
#define int long long
#define F first
#define S second
#define pb push_back

using namespace std;
const int N=1e6,M=2e3,mod=1e16+31,ppp=1e9+7;
int hashh[505][505],cnt[505][505][27],ans[505][505];

string s[505];

int mult(int x,int y){

    return ((x%mod)*(y%mod))%mod;

}

int minuss(int x,int y){

    return ((x%mod)-(y%mod)+mod)%mod;

}

int summ(int x,int y){
    return((x%mod)+(y%mod))%mod;
}


void compute_hash(string s,int index){

    const int pp=31;
    int p_pow=1;

    hashh[index][0]=s[0]-'a'+1;
    for(int i=1;i<s.size();i++){
        p_pow=mult(p_pow,pp);
        hashh[index][i]=summ(hashh[index][i-1],mult(s[i]-'a'+1,p_pow));
    }


}

pair<int,int> compute_hash2(int start,int num,int anss,int intial){

    for(int i=0;i<num;i++){
        start=mult(start,ppp);
        anss=summ(anss,mult(intial,start));
    }

    return {anss,start};

}

main()
{

    int n,m;
    cin>>n>>m;


    for(int i=0;i<n;i++)
        cin>>s[i];

    for(int i=0;i<n-m+1;i++){

        for(int j=0;j<n;j++){
            for(int k=i;k<i+m;k++){
                cnt[i][j][s[j][k]-'a']++;
            }
        }
    }

    /*for(int i=0;i<n;i++){
        for(int j=0;j<n;j++){
            for(int k=0;k<26;k++)
                cout<<i<<" "<<j<<" "<<k+'a'<<" "<<cnt[i][j][k]<<endl;
        }
    }*/

    for(int i=0;i<n;i++){
        compute_hash(s[i],i);
    }


    for(int i=0;i<n-m+1;i++){
        for(int k=0;k<n;k++){

            int anss=0,start=1;

            for(int j=0;j<26;j++){

                pair<int,int> p;
                p=compute_hash2(start,cnt[i][k][j],anss,j+1);
                anss=p.F;
                start=p.S;
            }

            ans[i][k]=anss;

        }
        for(int j=0;j<n;j++){
            for(int k=j+1;k<n;k++){

                if((i==0||hashh[j][i-1]==hashh[k][i-1])&&(hashh[j][n-1]-hashh[j][i+m-1]==hashh[j][n-1]-hashh[j][i+m-1])&&(ans[i][j]==ans[i][k])){

                    cout<<"DA"<<endl;
                    exit(0);

                }
            }
        }
    }

    cout<<"NE"<<endl;

    return 0;
}
/*
4 2
abcd
acbd
unee
asds
*/

Compilation message

ispit.cpp: In function 'void compute_hash(std::string, long long int)':
ispit.cpp:36:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |     for(int i=1;i<s.size();i++){
      |                 ~^~~~~~~~~
ispit.cpp: At global scope:
ispit.cpp:55:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   55 | main()
      | ^~~~
ispit.cpp: In function 'int main()':
ispit.cpp:105:88: warning: self-comparison always evaluates to true [-Wtautological-compare]
  105 |                 if((i==0||hashh[j][i-1]==hashh[k][i-1])&&(hashh[j][n-1]-hashh[j][i+m-1]==hashh[j][n-1]-hashh[j][i+m-1])&&(ans[i][j]==ans[i][k])){
      |                                                           ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Incorrect 0 ms 340 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1492 KB Output is correct
2 Correct 10 ms 1988 KB Output is correct
3 Correct 36 ms 7128 KB Output is correct
4 Correct 10 ms 6704 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1108 KB Output is correct
2 Correct 8 ms 2004 KB Output is correct
3 Correct 35 ms 5236 KB Output is correct
4 Correct 13 ms 4948 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1492 KB Output is correct
2 Correct 4 ms 1236 KB Output is correct
3 Correct 28 ms 3660 KB Output is correct
4 Correct 9 ms 3412 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1364 KB Output is correct
2 Correct 5 ms 1620 KB Output is correct
3 Correct 39 ms 6236 KB Output is correct
4 Correct 21 ms 5972 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 3648 KB Output is correct
2 Correct 56 ms 4684 KB Output is correct
3 Correct 191 ms 8360 KB Output is correct
4 Correct 52 ms 8168 KB Output is correct

Subtask #9
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 3736 KB Output is correct
2 Correct 14 ms 3012 KB Output is correct
3 Incorrect 104 ms 45568 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 3428 KB Output is correct
2 Correct 63 ms 4660 KB Output is correct
3 Correct 459 ms 24960 KB Output is correct
4 Correct 132 ms 24252 KB Output is correct