oj.uz

답안 #165180

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
165180 2019-11-25T16:21:14 Z theStaticMind Lozinke (COCI17_lozinke) C++14
85 / 100
 379 ms 15496 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];
      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);
            for(int j=1;j<=s.length();j++){
                  H[i][j]=(H[i][j-1]*29+s[j-1]-'a'+1)%modulo;
            }
            int K=29;
            for(int j=1;j<=s.length();j++){
                  K=29;
                  for(int k=j-1;k>=0;k--){
                        S.insert((H[i][j]-H[i][k]*K%modulo+modulo)%modulo);
                        K=K*29%modulo;
                  }
            }
            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()]-1;
      }
      cout<<ans;
}

Compilation message

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

Subtask #1
85.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 376 KB Output is correct
5 Correct 8 ms 760 KB Output is correct
6 Correct 11 ms 888 KB Output is correct
7 Correct 15 ms 1400 KB Output is correct
8 Correct 26 ms 2168 KB Output is correct
9 Correct 57 ms 2936 KB Output is correct
10 Incorrect 153 ms 7160 KB Output isn't correct
11 Correct 98 ms 5104 KB Output is correct
12 Correct 369 ms 15324 KB Output is correct
13 Correct 158 ms 4644 KB Output is correct
14 Incorrect 238 ms 13944 KB Output isn't correct
15 Incorrect 379 ms 15496 KB Output isn't correct
16 Correct 152 ms 3704 KB Output is correct
17 Correct 35 ms 3576 KB Output is correct
18 Correct 28 ms 3192 KB Output is correct
19 Correct 217 ms 9024 KB Output is correct
20 Correct 74 ms 3064 KB Output is correct