oj.uz

Submission #74681

# Submission time Handle Problem Language Result Execution time Memory
74681 2018-09-06T12:13:08 Z PeppaPig Type Printer (IOI08_printer) C++14
20 / 100
 87 ms 21140 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 5e5+5;

int n, ptr, cnt;
int t[N][30], sub[N];
vector<char> C;

int subSize(int u) {
	sub[u] = 1;
	for(int i = 0; i < 26; i++) if(t[u][i]) sub[u] += subSize(t[u][i]);
	return sub[u];
}

void dfs(int u) {
	int mx = 0, hv = -1;
	for(int i = 0; i < 26; i++) if(t[u][i] && sub[t[u][i]] > mx) mx = sub[t[u][i]], hv = i;
	if(hv == -1) C.emplace_back('P'), cnt++;
	else {
		for(int i = 0; i < 26; i++) if(t[u][i] && i != hv) C.emplace_back('a'+i), dfs(t[u][i]);
		C.emplace_back('a'+hv);
		dfs(t[u][hv]);
	}
	if(cnt < n) C.emplace_back('-');
}

int main() {
	scanf("%d", &n);
	for(int i = 1; i <= n; i++) {
		char A[25];
		scanf(" %s", A+1);
		int cptr = 0;
		for(int i = 1; i <= strlen(A+1); i++) {
			if(!t[cptr][A[i]-'a']) t[cptr][A[i]-'a'] = ++ptr;
			cptr = t[cptr][A[i]-'a'];
		}
	}
	subSize(0);
	dfs(0);
	printf("%d\n", C.size());
	for(char c : C) printf("%c\n", c);

	return 0;
}

Compilation message

printer.cpp: In function 'int main()':
printer.cpp:35:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 1; i <= strlen(A+1); i++) {
                  ~~^~~~~~~~~~~~~~
printer.cpp:42:25: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<char>::size_type {aka long unsigned int}' [-Wformat=]
  printf("%d\n", C.size());
                 ~~~~~~~~^
printer.cpp:30:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
printer.cpp:33:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf(" %s", A+1);
   ~~~~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 556 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 OK 2 ms 556 KB Checker has crashed
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 556 KB Output is correct
2 OK 2 ms 556 KB Checker has crashed

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 OK 2 ms 556 KB Checker has crashed
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 OK 5 ms 1268 KB Checker has crashed
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 OK 13 ms 3728 KB Checker has crashed
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 OK 32 ms 8732 KB Checker has crashed
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 OK 78 ms 21140 KB Checker has crashed
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 OK 87 ms 21140 KB Checker has crashed
2 Halted 0 ms 0 KB -