oj.uz

답안 #240081

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
240081 2020-06-18T01:46:23 Z luciocf Rima (COCI17_rima) C++14
140 / 140
 499 ms 139640 KB 
#include <bits/stdc++.h>
#include <sys/resource.h>

using namespace std;

const int maxn = 3e6+10;

struct Node
{
	Node *b[26];
	int u;
	bool fim;
};

int cnt;

int dp[maxn], path[maxn];

void add(Node *t, string const s)
{
	Node *at = t;

	for (auto c: s)
	{
		if (!at->b[c-'a'])
		{
			at->b[c-'a'] = new Node();
			at->b[c-'a']->u = ++cnt;
		}

		at = at->b[c-'a'];
	}

	at->fim = true;
}

void dfs(Node *t)
{
	int mx1 = -1, mx2 = -1;

	int tot = (t->fim);

	for (int i = 0; i < 26; i++)
	{
		if (!t->b[i]) continue;

		dfs(t->b[i]);

		if (t->b[i]->fim)
		{
			tot++;

			int x = path[t->b[i]->u];

			if (x > mx1) mx2 = mx1, mx1 = x;
			else if (x > mx2) mx2 = x;
		}
	}

	dp[t->u] = path[t->u] = tot;

	if (mx2 != -1) 
	{
		dp[t->u] = mx1 + mx2 + tot-2;
		path[t->u] = mx1 + tot-1;
	}
	else if (mx1 != -1)
	{
		dp[t->u] = mx1 + tot-1;
		path[t->u] = mx1 + tot-1;
	}
}

int main(void)
{
	Node *root = new Node();
	root->u = 0;

	int n;
	scanf("%d", &n);

	for (int i = 1; i <= n; i++)
	{
		string s;
		cin >> s;

		reverse(s.begin(), s.end());

		add(root, s);
	}

	dfs(root);

	int ans = 0;
	for (int i = 0; i < maxn; i++)
		ans = max(ans, dp[i]);

	printf("%d\n", ans);
}

Compilation message

rima.cpp: In function 'int main()':
rima.cpp:80:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~

Subtask #1
140.0 / 140.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 384 KB Output is correct
2 Correct 10 ms 512 KB Output is correct
3 Correct 10 ms 512 KB Output is correct
4 Correct 499 ms 139640 KB Output is correct
5 Correct 153 ms 1144 KB Output is correct
6 Correct 119 ms 87988 KB Output is correct
7 Correct 113 ms 87732 KB Output is correct
8 Correct 114 ms 87608 KB Output is correct
9 Correct 250 ms 90936 KB Output is correct
10 Correct 111 ms 87608 KB Output is correct