oj.uz

답안 #116839

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
116839 2019-06-14T02:24:31 Z ntrung03 Lozinke (COCI17_lozinke) C++17
60 / 100
 378 ms 14716 KB 
#pragma GCC optimize("Ofast")
#include <stdio.h>
#include <string.h>
#include <set>
#include <utility>
#include <map>
using namespace std;
#define int long long
#define mod 1204755107
#define base 31
char s[20002][12];
int h[20002][12];
int p[12];
signed main() {
	int n;
	scanf("%lld\n",&n);
	p[0] = 1;
	for(int i=1;i<12;i++)p[i] = (p[i-1]*base)%mod;
	int res = 0;
	for(int i=0;i<n;i++) scanf("%s\n",s[i]);
	map<pair<int,int>,int> hashes;
	for(int i=0;i<n;i++)
	{
		int l = strlen(s[i]);
		for(int j=0;j<l;j++)
		{
			h[i][j] = (j>0?h[i][j-1]:0);
			h[i][j] = ((h[i][j]*base)%mod+s[i][j]-'a'+1)%mod;
		}
		hashes[{h[i][l-1],l}]+=1;
	}
	for(int k =0;k<n;k++)
	{
		int l = strlen(s[k]);
		set<pair<int,int>> ck;
		for(int i=0;i<l;i++)
		for(int j=i;j<l;j++){
			long long ph = h[k][j]-(i>0?h[k][i-1]*p[j-i+1]:0)%mod;
			pair<int,int> hh = {ph,j-i+1};
			if(ck.count(hh)) continue;
			res+=hashes[hh];
			ck.insert(hh);
			if(i==0&&j==l-1) res-=1;
		}
	}
	printf("%lld",res);
}

Compilation message

lozinke.cpp: In function 'int main()':
lozinke.cpp:16:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld\n",&n);
  ~~~~~^~~~~~~~~~~~~
lozinke.cpp:20:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i=0;i<n;i++) scanf("%s\n",s[i]);
                       ~~~~~^~~~~~~~~~~~~

Subtask #1
60.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Incorrect 7 ms 768 KB Output isn't correct
6 Incorrect 9 ms 768 KB Output isn't correct
7 Correct 14 ms 1408 KB Output is correct
8 Correct 25 ms 2040 KB Output is correct
9 Incorrect 47 ms 2940 KB Output isn't correct
10 Correct 144 ms 6816 KB Output is correct
11 Incorrect 85 ms 4728 KB Output isn't correct
12 Incorrect 378 ms 14488 KB Output isn't correct
13 Incorrect 150 ms 4216 KB Output isn't correct
14 Correct 271 ms 13628 KB Output is correct
15 Correct 378 ms 14716 KB Output is correct
16 Correct 115 ms 2560 KB Output is correct
17 Correct 26 ms 2432 KB Output is correct
18 Correct 21 ms 2464 KB Output is correct
19 Incorrect 243 ms 8584 KB Output isn't correct
20 Incorrect 62 ms 2588 KB Output isn't correct