oj.uz

답안 #165184

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
165184 2019-11-25T16:30:30 Z theStaticMind Lozinke (COCI17_lozinke) C++14
90 / 100
 441 ms 19320 KB 
#include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define ii pair<int,int>
#define all(x) (x).begin(),(x).end()
#define INF 100000000000000000
#define modulo 1000000007
#define mod 998244353
#define int long long int
using namespace std;

int32_t main(){
      ios_base::sync_with_stdio(false);
      cin.tie(NULL);
 //     freopen("q.gir","r",stdin);
 //     freopen("q.cik","w",stdout);
      int n;
      cin>>n;
      vector<string>arr(n);
      vector<int>H[n],h[n],Hh[n];
      map<int,int>data;
      for(int i=0;i<n;i++){
            string s;
            set<int> S;
            cin>>s;
            arr[i]=s;
            H[i].resize(s.length()+1,0);
            Hh[i]=h[i]=H[i];
            for(int j=1;j<=s.length();j++){
                  H[i][j]=(H[i][j-1]*29+s[j-1]-'a'+1)%modulo;
                  h[i][j]=(h[i][j-1]*31+s[j-1]-'a'+1)%mod;
                  Hh[i][j]=(Hh[i][j-1]*53+s[j-1]-'a'+1)%(modulo+2);
            }
            int K=29,T=31,X=53;
            for(int j=1;j<=s.length();j++){
                  K=29,T=31,X=53;
                  for(int k=j-1;k>=0;k--){
                        S.insert((H[i][j]-H[i][k]*K%modulo+modulo)%modulo+(h[i][j]-h[i][k]*T%mod+mod)%mod+(Hh[i][j]-Hh[i][k]*X%(modulo+2)+(modulo+2))%(modulo+2));
                        K=K*29%modulo;
                        T=T*31%mod;
                        X=X*53%(modulo+2);
                  }
            }
            for(set<int>::iterator itr=S.begin();itr!=S.end();itr++){
                  data[*itr]++;
            }
      }
      int ans=0;
      for(int i=0;i<n;i++){
            ans+=data[H[i].back()+h[i].back()+Hh[i].back()]-1;
      }
      cout<<ans;
}

Compilation message

lozinke.cpp: In function 'int32_t main()':
lozinke.cpp:29:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j=1;j<=s.length();j++){
                         ~^~~~~~~~~~~~
lozinke.cpp:35:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int j=1;j<=s.length();j++){
                         ~^~~~~~~~~~~~

Subtask #1
90.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 8 ms 988 KB Output is correct
6 Correct 12 ms 1144 KB Output is correct
7 Correct 17 ms 1784 KB Output is correct
8 Correct 29 ms 2552 KB Output is correct
9 Correct 63 ms 4728 KB Output is correct
10 Correct 157 ms 9160 KB Output is correct
11 Incorrect 110 ms 7552 KB Output isn't correct
12 Correct 392 ms 18268 KB Output is correct
13 Correct 413 ms 8696 KB Output is correct
14 Correct 441 ms 17400 KB Output is correct
15 Incorrect 403 ms 19320 KB Output isn't correct
16 Correct 169 ms 8312 KB Output is correct
17 Correct 55 ms 8056 KB Output is correct
18 Correct 45 ms 7288 KB Output is correct
19 Correct 230 ms 12664 KB Output is correct
20 Correct 160 ms 6776 KB Output is correct