oj.uz

Submission #104125

# Submission time Handle Problem Language Result Execution time Memory
104125 2019-04-04T06:59:10 Z Kewo Savez (COCI15_savez) C++17
96 / 120
 102 ms 66560 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)(7e5 + 5);
const int LOG = (int)(20);

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

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

void add(int ind, int idx, int x) {
	if(x == s[ind].length() - 1) {
		tree[idx].word++;
		tree[idx].ans++;
		return;
	}
	char fc = s[ind][x], lc = s[ind][(int)s[ind].length() - x - 1];
	cc e = {fc, lc};
	if(tree[idx].ed.count(e) == 0)
		tree[idx].ed[e] = ++sz;
	add(ind, tree[idx].ed[e], x + 1);
	tree[idx].ans = max(tree[idx].ans, tree[tree[idx].ed[e]].ans);
}

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

	cout << tree[1].ans;
}

Compilation message

savez.cpp: In function 'void add(int, int, int)':
savez.cpp:37:7: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(x == s[ind].length() - 1) {
     ~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 60664 KB Output is correct
2 Correct 61 ms 60668 KB Output is correct
3 Correct 61 ms 60664 KB Output is correct

Subtask #2
0 / 12.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 62828 KB Output is correct
2 Correct 101 ms 63092 KB Output is correct
3 Correct 81 ms 62844 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 61388 KB Output is correct
2 Correct 82 ms 63416 KB Output is correct
3 Correct 87 ms 63608 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 63088 KB Output is correct
2 Correct 88 ms 63056 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 63036 KB Output is correct
2 Correct 81 ms 63044 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 62968 KB Output is correct
2 Correct 80 ms 62940 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 81 ms 62584 KB Output is correct
2 Correct 83 ms 62968 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 88 ms 60536 KB Output is correct
2 Correct 88 ms 60656 KB Output is correct

Subtask #10
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 102 ms 60656 KB Output is correct
2 Correct 95 ms 60664 KB Output is correct
3 Runtime error 97 ms 66560 KB Execution killed with signal 11 (could be triggered by violating memory limits)