oj.uz

Submission #104052

# Submission time Handle Problem Language Result Execution time Memory
104052 2019-04-03T20:12:34 Z Kewo Savez (COCI15_savez) C++17
0 / 120
 49 ms 18424 KB 
#include <bits/stdc++.h>
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define mid ((x + y) / 2)
#define left (ind * 2)
#define right (ind * 2 + 1)
#define mp make_pair
#define timer ((double)clock() / CLOCKS_PER_SEC)
#define endl "\n"
#define spc " "
#define d1(x) cerr<<#x<<":"<<x<<endl
#define d2(x, y) cerr<<#x<<":"<<x<<" "<<#y<<":"<<y<<endl
#define d3(x, y, z) cerr<<#x<<":"<<x<<" "<<#y<<":"<<y<<" "<<#z<<":"<<z<<endl
#define fast_io() ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;

typedef long long int lli;
typedef pair<int, int> ii;
typedef pair<char, char> cc;
typedef pair<ii, int> iii;
typedef pair<double, double> dd;

const int N = (int)(1e5 + 5);
const int LOG = (int)(20);

struct node {
	int ind, word;
	map<cc, int> ed;
}tree[N];

int n, sz = 1;
string str[N];

void add(string s) {
	int idx = 1;
	for(int i = 0; i < (int)s.length(); i++) {
		char fc = s[i], lc = s[(int)s.length() - i - 1];
		cc e = {fc, lc};
		if(tree[idx].ed.count(e) == 0)
			tree[idx].ed[e] = ++sz;
		idx = tree[idx].ed[e];
	}
	tree[idx].word++;
}

int dfs(int x) {
	int re = 0;
	for(auto i : tree[x].ed)
		re = max(re, dfs(i.se));
	if(tree[x].word)
		re += tree[x].word;
	return re;
}

int main() {
	fast_io();
	// freopen("inp.in", "r", stdin);
	
	cin >> n;
	for(int i = 1; i <= n; i++) {
		cin >> str[i];
		add(str[i]);
	}

	cout << dfs(1);
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 8960 KB Output is correct
2 Incorrect 10 ms 8960 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 8960 KB Output is correct
2 Correct 11 ms 8960 KB Output is correct
3 Incorrect 21 ms 12800 KB Output isn't correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 11216 KB Output is correct
2 Incorrect 23 ms 11384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 9600 KB Output is correct
2 Correct 25 ms 11640 KB Output is correct
3 Incorrect 26 ms 11876 KB Output isn't correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 33 ms 11392 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 31 ms 11640 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 29 ms 11712 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 32 ms 11552 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 49 ms 18424 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #10
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 42 ms 18168 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -