Submission #1654832


Source Code Expand

#include <cstdio>
#include <algorithm>
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <set>
#include <map>
using namespace std;

int len, root, n, k, m;
int sum[1100000], dd[1100000], son[1100000][26], to[1100000], fa[1100000];
char S[410000];

void ins(char *S, int id) {
	int l = strlen(S);
	int now = root;
	for (int i = 0; i < l; i++) {
		sum[now] += 1;
		if (!son[now][S[i] - 'a'])
			son[now][S[i] - 'a'] = ++len;
		now = son[now][S[i] - 'a'];
	}
	sum[now] += 1;
	dd[now] += 1;
	to[id] = now;
}

void dfs(int k, int &ss) {
	for (int i = 0; i < 26; i++)
		if (son[k][i]) {
			dfs(son[k][i], son[k][i]);
			if (sum[son[k][i]] == sum[k])
				ss = son[k][i];
		}
}

int query(int k) {
	int ans = 0;
	while (k != root) {
		int kk = fa[k];
		for (int i = 0; i < 26; i++)
			if (son[kk][S[i] - 'a'] == k)
				break;
			else
				ans += sum[son[kk][S[i] - 'a']];
		ans += dd[kk];
		k = kk;
	}
	return ans + 1;
}

void ddd(int xx) {
	// printf("%d\n", xx);
	for (int i = 0; i < 26; i++)
		if (son[xx][i])
			fa[son[xx][i]] = xx, 
			ddd(son[xx][i]);
}

int main() {
	root = len = 1;
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)
		scanf("%s", S), ins(S, i);
	dfs(root, root);
	ddd(root);
	// for (int i = 1; i <= len; i++)
	// 	for (int j = 0; j < 26; j++)
	// 		if (son[i][j])
	// 			fa[son[i][j]] = i;
	scanf("%d", &m);
	for (int i = 0; i < m; i++) {
		scanf("%d%s", &k, S);
		printf("%d\n", query(to[k]));
	}
}

Submission Info

Submission Time
Task E - Lexicographical disorder
User xyz111
Language C++14 (GCC 5.4.1)
Score 1100
Code Size 1526 Byte
Status AC
Exec Time 1194 ms
Memory 68736 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:63:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
./Main.cpp:65:28: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", S), ins(S, i);
                            ^
./Main.cpp:72:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &m);
                 ^
./Main.cpp:74:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%s", &k, S);
                       ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1100 / 1100
Status
AC × 2
AC × 42
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt AC 72 ms 21632 KB
02.txt AC 73 ms 21632 KB
03.txt AC 72 ms 21632 KB
04.txt AC 73 ms 21632 KB
05.txt AC 91 ms 42880 KB
06.txt AC 79 ms 51456 KB
07.txt AC 75 ms 53376 KB
08.txt AC 70 ms 52736 KB
09.txt AC 64 ms 52352 KB
10.txt AC 62 ms 54400 KB
11.txt AC 88 ms 13184 KB
12.txt AC 79 ms 15360 KB
13.txt AC 74 ms 17408 KB
14.txt AC 91 ms 49280 KB
15.txt AC 78 ms 52352 KB
16.txt AC 66 ms 54400 KB
17.txt AC 69 ms 68736 KB
18.txt AC 1188 ms 8832 KB
19.txt AC 1194 ms 8832 KB
20.txt AC 1149 ms 8832 KB
21.txt AC 1152 ms 8832 KB
22.txt AC 1160 ms 8832 KB
23.txt AC 85 ms 17408 KB
24.txt AC 89 ms 13184 KB
25.txt AC 80 ms 15360 KB
26.txt AC 808 ms 8832 KB
27.txt AC 76 ms 15232 KB
28.txt AC 68 ms 17280 KB
29.txt AC 62 ms 17280 KB
30.txt AC 71 ms 19584 KB
31.txt AC 56 ms 23680 KB
32.txt AC 55 ms 19712 KB
33.txt AC 53 ms 27520 KB
34.txt AC 53 ms 24576 KB
35.txt AC 54 ms 28032 KB
36.txt AC 72 ms 21760 KB
37.txt AC 57 ms 38656 KB
38.txt AC 56 ms 38656 KB
39.txt AC 3 ms 8448 KB
40.txt AC 3 ms 8448 KB
s1.txt AC 3 ms 8448 KB
s2.txt AC 3 ms 8448 KB