oj.uz

답안 #165729

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
165729 2019-11-28T12:00:53 Z Sensei Lozinke (COCI17_lozinke) C++17
50 / 100
 1000 ms 65540 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];
bool s[MAXN + 7][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++) {

		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[i][id] = true;
						}
					}
				}
			}
		}

		for (int j = 1; j <= N; j++) {
			if (s[i][j]) {
				ans++;
			}
		}
	}

	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:33: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:78:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < st[i].size(); j++) {
                   ~~^~~~~~~~~~~~~~

Subtask #1
50.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1016 KB Output is correct
2 Correct 3 ms 1144 KB Output is correct
3 Correct 3 ms 1400 KB Output is correct
4 Correct 5 ms 2808 KB Output is correct
5 Correct 11 ms 5496 KB Output is correct
6 Correct 16 ms 7928 KB Output is correct
7 Correct 21 ms 11896 KB Output is correct
8 Correct 15 ms 1272 KB Output is correct
9 Runtime error 226 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
10 Correct 137 ms 2808 KB Output is correct
11 Runtime error 223 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
12 Incorrect 298 ms 3192 KB Output isn't correct
13 Runtime error 153 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
14 Runtime error 159 ms 65536 KB Execution killed with signal 9 (could be triggered by violating memory limits)
15 Incorrect 458 ms 4156 KB Output isn't correct
16 Runtime error 197 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
17 Correct 575 ms 2596 KB Output is correct
18 Execution timed out 1083 ms 35296 KB Time limit exceeded
19 Runtime error 156 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)
20 Runtime error 286 ms 65540 KB Execution killed with signal 9 (could be triggered by violating memory limits)