Submission #696292

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
696292	2023-02-06T07:21:32 Z	SanguineChameleon	Rima (COCI17_rima)	C++17	140 / 140	253 ms	134776 KB

rima

// BEGIN BOILERPLATE CODE

#include <bits/stdc++.h>
using namespace std;

#ifdef KAMIRULEZ
	const bool kami_loc = true;
	const long long kami_seed = 69420;
#else
	const bool kami_loc = false;
	const long long kami_seed = chrono::steady_clock::now().time_since_epoch().count();
#endif

const string kami_fi = "kamirulez.inp";
const string kami_fo = "kamirulez.out";
mt19937_64 kami_gen(kami_seed);

long long rand_range(long long rmin, long long rmax) {
	uniform_int_distribution<long long> rdist(rmin, rmax);
	return rdist(kami_gen);
}

long double rand_real(long double rmin, long double rmax) {
	uniform_real_distribution<long double> rdist(rmin, rmax);
	return rdist(kami_gen);
}

void file_io(string fi, string fo) {
	if (fi != "" && (!kami_loc || fi == kami_fi)) {
		freopen(fi.c_str(), "r", stdin);
	}
	if (fo != "" && (!kami_loc || fo == kami_fo)) {
		freopen(fo.c_str(), "w", stdout);
	}
}

void set_up() {
	if (kami_loc) {
		file_io(kami_fi, kami_fo);
	}
	ios_base::sync_with_stdio(0);
	cin.tie(0);
}

void just_do_it();

void just_exec_it() {
	if (kami_loc) {
		auto pstart = chrono::steady_clock::now();
		just_do_it();
		auto pend = chrono::steady_clock::now();
		long long ptime = chrono::duration_cast<chrono::milliseconds>(pend - pstart).count();
		string bar(50, '=');
		cout << '\n' << bar << '\n';
		cout << "Time: " << ptime << " ms" << '\n';
	}
	else {
		just_do_it();
	}
}

int main() {
	set_up();
	just_exec_it();
	return 0;
}

// END BOILERPLATE CODE

// BEGIN MAIN CODE

struct node {
	node *ch[26] = {};
	bool f = false;
	int dp = 0;
};

node *root = new node();
int res = 1;

void dfs(node *u) {
	int b1 = 0;
	int b2 = 0;
	int tot = 0;
	for (int i = 0; i < 26; i++) {
		if (u->ch[i]) {
			dfs(u->ch[i]);
			if (u->ch[i]->f) {
				tot++;
				int X = u->ch[i]->dp;
				if (X > b1) {
					b2 = b1;
					b1 = X;
				}
				else if (X > b2) {
					b2 = X;
				}
			}
		}
	}
	u->dp = tot + b1;
	res = max(res, tot + b1);
	res = max(res, tot + b1 + b2 + (u->f));
}

void just_do_it() {
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		string s;
		cin >> s;
		reverse(s.begin(), s.end());
		node *cur = root;
		for (auto x: s) {
			int d = x - 'a';
			if (!cur->ch[d]) {
				cur->ch[d] = new node();
			}
			cur = cur->ch[d];
		}
		cur->f = true;
	}
	dfs(root);
	cout << res;
}

// END MAIN CODE

Compilation message

rima.cpp: In function 'void file_io(std::string, std::string)':
rima.cpp:30:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |   freopen(fi.c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
rima.cpp:33:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |   freopen(fo.c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

140.0 / 140.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	324 KB	Output is correct
3	Correct	1 ms	320 KB	Output is correct
4	Correct	253 ms	134776 KB	Output is correct
5	Correct	14 ms	1144 KB	Output is correct
6	Correct	64 ms	85632 KB	Output is correct
7	Correct	67 ms	85396 KB	Output is correct
8	Correct	61 ms	85228 KB	Output is correct
9	Correct	81 ms	88484 KB	Output is correct
10	Correct	66 ms	85332 KB	Output is correct