oj.uz

Submission #89462

# Submission time Handle Problem Language Result Execution time Memory
89462 2018-12-15T01:48:14 Z jasony123123 Savez (COCI15_savez) C++11
120 / 120
 216 ms 53536 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"
typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
typedef pair<char, char> pcc;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
inline void io() {
#ifdef LOCAL_PROJECT 
	freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else 
	/* online submission */
#endif 
	ios_base::sync_with_stdio(false); cin.tie(NULL);
}
/**********************COCI 16-17 R2 P4 :(*****************************/

struct Node {
	map<pcc, int> nxt;
	int dp;
	Node() {
		dp = 0;
	}
};

v<Node> trie(1);
int tsz = 1;
int ans = 1;

void add(string &s) {
	int cur = 0;
	v<int> visnode = { cur };
	FOR(i, 0, s.size()) {
		pcc c = { s[i], s[s.size() - 1 - i] };
		if (trie[cur].nxt.count(c) == 0) {
			trie.push_back(Node());
			trie[cur].nxt[c] = tsz;
			tsz++;
		}
		cur = trie[cur].nxt[c];
		visnode.push_back(cur);
	}
	trie[visnode.back()].dp++;
	RFORE(i, visnode.size() - 2, 0) {
		maxx(trie[visnode[i]].dp, trie[visnode[i + 1]].dp);
	}
}

stack<string> input;
int main() {
	io();
	int N;
	cin >> N;
	FOR(i, 0, N) {
		string str;
		cin >> str;
		input.push(str);
	}
	while (input.size()) {
		add(input.top());
		input.pop();
	}
	cout << trie[0].dp << "\n";
	return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 464 KB Output is correct
3 Correct 2 ms 572 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 572 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 22 ms 10880 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 10880 KB Output is correct
2 Correct 22 ms 10880 KB Output is correct
3 Correct 21 ms 10880 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 10880 KB Output is correct
2 Correct 22 ms 10880 KB Output is correct
3 Correct 24 ms 10880 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 10880 KB Output is correct
2 Correct 27 ms 10880 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 11076 KB Output is correct
2 Correct 33 ms 12040 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 13256 KB Output is correct
2 Correct 39 ms 14244 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 15756 KB Output is correct
2 Correct 47 ms 17024 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 22720 KB Output is correct
2 Correct 84 ms 23924 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 30572 KB Output is correct
2 Correct 116 ms 31940 KB Output is correct
3 Correct 216 ms 53536 KB Output is correct