oj.uz

답안 #165723

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
165723 2019-11-28T11:45:34 Z Sensei Lozinke (COCI17_lozinke) C++17
65 / 100
 1000 ms 3708 KB 
#include <bits/stdc++.h>

using namespace std;

const long long P = 53;
const long long MOD = 1e9 + 7;

const int MAXN = 2e4;

long long add (long long x, long long y) {
	return ((x % MOD) + (y % MOD)) % MOD;
}

long long mul (long long x, long long y) {
	return ((x % MOD) * (y % MOD)) % MOD;
}

unordered_map<long long, unordered_set<int> > m;
string st[MAXN + 7];

int main () {
	int N;
	cin >> N;

	for (int i = 1; i <= N; i++) {
		cin >> st[i];
	}

	for (int i = 1; i <= N; i++) {
		long long hash = 0;

		for (int j = 0; j < st[i].size(); j++) {
			hash = mul(hash, P);
			hash = add(hash, st[i][j] - 'a' + 1);
		}

		m[hash].insert(i);
	}

	long long ans = 0;

	for (int i = 1; i <= N; i++) {
		unordered_set<int> s;

		for (int ss = 0; ss < st[i].size(); ss++) {
			long long hash = 0;

			for (int j = ss; j < st[i].size(); j++) {
				if (ss == 0 && j + 1 == st[i].size()) {
					break;
				}

				hash = mul(hash, P);
				hash = add(hash, st[i][j] - 'a' + 1);

				if (m.find(hash) != m.end()) {
					for (int id : m[hash]) {
						if (id != i) {
							s.insert(id);
						}
					}
				}
			}
		}

		ans += s.size();
	}

	long long ans2 = 0;

	for (int i = 1; i <= N; i++) {
		long long hash = 0;

		for (int j = 0; j < st[i].size(); j++) {
			hash = mul(hash, P);
			hash = add(hash, st[i][j] - 'a' + 1);
		}

		ans2 += m[hash].size() - 1;
	}

	ans += ans2;

	cout << ans << "\n";

	return 0;
}

Compilation message

lozinke.cpp: In function 'int main()':
lozinke.cpp:32:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < st[i].size(); j++) {
                   ~~^~~~~~~~~~~~~~
lozinke.cpp:45:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int ss = 0; ss < st[i].size(); ss++) {
                    ~~~^~~~~~~~~~~~~~
lozinke.cpp:48:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int j = ss; j < st[i].size(); j++) {
                     ~~^~~~~~~~~~~~~~
lozinke.cpp:49:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (ss == 0 && j + 1 == st[i].size()) {
                    ~~~~~~^~~~~~~~~~~~~~~
lozinke.cpp:74:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < st[i].size(); j++) {
                   ~~^~~~~~~~~~~~~~

Subtask #1
65.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1016 KB Output is correct
2 Correct 3 ms 1020 KB Output is correct
3 Correct 3 ms 888 KB Output is correct
4 Correct 5 ms 1016 KB Output is correct
5 Correct 21 ms 1272 KB Output is correct
6 Correct 10 ms 1144 KB Output is correct
7 Correct 48 ms 1272 KB Output is correct
8 Correct 9 ms 1144 KB Output is correct
9 Execution timed out 1080 ms 2040 KB Time limit exceeded
10 Correct 33 ms 2168 KB Output is correct
11 Execution timed out 1071 ms 2792 KB Time limit exceeded
12 Incorrect 64 ms 2684 KB Output isn't correct
13 Correct 143 ms 3448 KB Output is correct
14 Execution timed out 1085 ms 3708 KB Time limit exceeded
15 Incorrect 64 ms 3320 KB Output isn't correct
16 Correct 141 ms 2040 KB Output is correct
17 Correct 50 ms 1912 KB Output is correct
18 Execution timed out 1066 ms 2920 KB Time limit exceeded
19 Correct 111 ms 3064 KB Output is correct
20 Execution timed out 1077 ms 2468 KB Time limit exceeded