oj.uz

Submission #507385

# Submission time Handle Problem Language Result Execution time Memory
507385 2022-01-12T11:34:13 Z haxorman Type Printer (IOI08_printer) C++14
30 / 100
 26 ms 3512 KB 
#include <bits/stdc++.h>
using namespace std;

int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	
	int n;
	cin >> n;

	vector<string> words(n);
	for (auto& w : words) {
		cin >> w;
	}

	int mx = 0;
	char c;
	for (int i = 0; i < n; ++i) {
		if (mx < words[i].size()) {
			mx = words[i].size();
			c = words[i][0];
		}
	}
	
	vector<string> big, smol;
	for (int i = 0; i < n; ++i) {
		if (words[i][0] == c) {
			big.push_back(words[i]);
		}
		else {
			smol.push_back(words[i]);
		}
	}
	sort(smol.begin(), smol.end());
	sort(big.begin(), big.end());
	
	string cur = "0";
	vector<char> out;
	if (smol.size()) {
		cur = smol[0];
		for (auto ch : cur) {
			out.push_back(ch);
		}
		out.push_back('P');

		for (int i = 1; i < smol.size(); ++i) {
			int ind = 0;
			while (ind < min(cur.size(), smol[i].size()) && 
				  cur[ind] == smol[i][ind]) {
				
				ind++;
			}
			ind--;

			int cur_ind = cur.size() - 1;
			while (cur_ind > ind) {
				out.push_back('-');
				cur_ind--;
			}

			for (int j = ind + 1; j < smol[i].size(); ++j) {
				out.push_back(smol[i][j]);
			}
			out.push_back('P');

			cur = smol[i];
		}
	}
	
	int start = 0;
	if (cur[0] == '0') {
		cur = big[0];
		for (auto ch : cur) {
			out.push_back(ch);
		}
		out.push_back('P');
		start = 1;
	}
	
	for (int i = start; i < big.size(); ++i) {
		int ind = 0;
		while (ind < min(cur.size(), big[i].size()) && 
			  cur[ind] == big[i][ind]) {
			
			ind++;
		}
		ind--;

		int cur_ind = cur.size() - 1;
		while (cur_ind > ind) {
			out.push_back('-');
			cur_ind--;
		}

		for (int j = ind + 1; j < big[i].size(); ++j) {
			out.push_back(big[i][j]);
		}
		out.push_back('P');

		cur = big[i];
	}

	cout << out.size() << "\n";
	for (auto ch : out) {
		cout << ch << "\n";
	}
}

Compilation message

printer.cpp: In function 'int32_t main()':
printer.cpp:18:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |   if (mx < words[i].size()) {
      |       ~~~^~~~~~~~~~~~~~~~~
printer.cpp:45:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |   for (int i = 1; i < smol.size(); ++i) {
      |                   ~~^~~~~~~~~~~~~
printer.cpp:47:15: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
   47 |    while (ind < min(cur.size(), smol[i].size()) &&
      |           ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
printer.cpp:60:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |    for (int j = ind + 1; j < smol[i].size(); ++j) {
      |                          ~~^~~~~~~~~~~~~~~~
printer.cpp:79:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::__cxx11::basic_string<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |  for (int i = start; i < big.size(); ++i) {
      |                      ~~^~~~~~~~~~~~
printer.cpp:81:14: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
   81 |   while (ind < min(cur.size(), big[i].size()) &&
      |          ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
printer.cpp:94:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |   for (int j = ind + 1; j < big[i].size(); ++j) {
      |                         ~~^~~~~~~~~~~~~~~
printer.cpp:26:3: warning: 'c' may be used uninitialized in this function [-Wmaybe-uninitialized]
   26 |   if (words[i][0] == c) {
      |   ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 308 KB Output is correct
2 Correct 0 ms 204 KB Output is correct

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 836 KB Output is correct
2 Incorrect 9 ms 1256 KB Output isn't correct

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

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

Subtask #10
0 / 10.0

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