oj.uz

Submission #80280

# Submission time Handle Problem Language Result Execution time Memory
80280 2018-10-19T18:17:59 Z thiago4532 Lozinke (COCI17_lozinke) C++17
100 / 100
 30 ms 16392 KB 
#include <bits/stdc++.h>
#define gc getchar
#define rep(i, a, b) for(int i=a;i<=b;i++)
#define rep2(i, a, b) for(int i=a;i>=b;--i)
#define wipe(a, b) memset(a, b, sizeof a);
#define pb push_back
#define ff first
#define ss second

using namespace std;
typedef pair<int, int> pii;

inline int scan(){
	int n=0, x=gc(), s=1;
	for(;x<'0'||x>'9';x=gc()) if(x=='-') s=-1;
	for(;x>='0'&&x<='9';x=gc()) n = 10*n + x - '0';
	return n*s;
}

int gcd(int a, int b){
	return (b?gcd(b, a%b):a);
}

struct node{
	node *son[26];
	int end, marca;
	node(){
		end = 0;
		marca = 0;
		for(int i=0;i<26;i++)
			son[i] = nullptr;
	}
};

node *root;

inline void add(string str){
	node *x = root;

	for(auto c : str){
		if(x->son[c-'a'] == nullptr) x->son[c-'a'] = new node();
		x = x->son[c-'a'];
	}
	x->end++;
}

int search(string str, int marca){
	node *x = root;
	int ans=0;

	for(auto c : str){
		if(!x->son[c-'a']) break;
		x = x->son[c-'a'];
		if(x->end > 0 && x->marca != marca) ans += x->end, x->marca = marca;
	}
	return ans;
}

int main(){
	ios::sync_with_stdio(false), cin.tie(0);
	root = new node;
	int n;
	cin >> n;
	vector<string> str;
	for(int i=1;i<=n;i++){
		string x;
		cin >> x;
		str.push_back(x);
	}

	sort(str.begin(), str.end(), [](string const& a, string const& b){
		if(a.size() != b.size()) return a.size() < b.size();
		else return a < b;
	});

	int ans=0;
	for(int i=0;i<n;i++){
		for(int j=0;j<(int)str[i].size();j++){
			int x = search(str[i].substr(j), i);
			//cout << "Valor da palavra " << str[i] << ": " << x << "\n";
			ans += x;
		}
		//cout << "Adicionando palavra " << str[i] << "\n";
		add(str[i]);
	}

	int qtd=1;
	string atual = str[0];
	for(int i=1;i<(int)str.size();i++){
		if(str[i] == atual) ++qtd;
		else{ 
			ans += ((qtd*(qtd-1))/2);
			atual = str[i];
			qtd=1;
		}
	}
	ans += ((qtd*(qtd-1))/2);
	cout << ans << "\n";
	return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 2 ms 460 KB Output is correct
4 Correct 3 ms 544 KB Output is correct
5 Correct 4 ms 972 KB Output is correct
6 Correct 4 ms 1172 KB Output is correct
7 Correct 5 ms 1832 KB Output is correct
8 Correct 5 ms 2296 KB Output is correct
9 Correct 11 ms 4016 KB Output is correct
10 Correct 15 ms 8012 KB Output is correct
11 Correct 18 ms 8012 KB Output is correct
12 Correct 25 ms 15032 KB Output is correct
13 Correct 20 ms 15032 KB Output is correct
14 Correct 28 ms 15604 KB Output is correct
15 Correct 30 ms 16392 KB Output is correct
16 Correct 15 ms 16392 KB Output is correct
17 Correct 19 ms 16392 KB Output is correct
18 Correct 14 ms 16392 KB Output is correct
19 Correct 24 ms 16392 KB Output is correct
20 Correct 14 ms 16392 KB Output is correct