oj.uz

답안 #572232

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
572232 2022-06-04T03:00:06 Z AGE Ispit (COCI19_ispit) C++14
0 / 90
 933 ms 60024 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=31;
int hashh[505][505],cnt[505][505][27],ans[505][505],hashh2[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));
    }


}
void compute_hash3(string s,int index){

    const int pp=31;
    int p_pow=1;

    hashh2[index][0]=(s[0]-'a')+1;
    for(int i=1;i<s.size();i++){
        p_pow=mult(p_pow,pp);
        hashh2[index][i]=summ(hashh2[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;i++){

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


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

    for(int i=0;i<n;i++)
        reverse(s[i].begin(),s[i].end());

    for(int i=0;i<n;i++){
        compute_hash3(s[i],i);
        reverse(s[i].begin(),s[i].end());
        reverse(hashh2[i],hashh2[i]+n);
    }


    for(int i=0;i<n;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%mod;

        }

        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])&&(hashh2[j][i+1]==hashh2[k][i+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: In function 'void compute_hash3(std::string, long long int)':
ispit.cpp:49: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]
   49 |     for(int i=1;i<s.size();i++){
      |                 ~^~~~~~~~~
ispit.cpp: At global scope:
ispit.cpp:68:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   68 | main()
      | ^~~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Incorrect 0 ms 468 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Incorrect 1 ms 468 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 468 KB Output is correct
2 Incorrect 1 ms 468 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 11988 KB Output is correct
2 Incorrect 67 ms 11976 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 12064 KB Output is correct
2 Incorrect 70 ms 11908 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 11968 KB Output is correct
2 Incorrect 67 ms 11992 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 12064 KB Output is correct
2 Incorrect 65 ms 11996 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 904 ms 59976 KB Output is correct
2 Incorrect 930 ms 60024 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #9
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 930 ms 59980 KB Output is correct
2 Incorrect 933 ms 60024 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #10
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 924 ms 60008 KB Output is correct
2 Incorrect 925 ms 59988 KB Output isn't correct
3 Halted 0 ms 0 KB -