oj.uz

Submission #1060478

# Submission time Handle Problem Language Result Execution time Memory
1060478 2024-08-15T15:58:49 Z belgianbot Type Printer (IOI08_printer) C++17
10 / 100
 50 ms 26564 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

vector<char> ans, letters;
vector<vector<pair<int,int>>> adj;
void dfs(int curr) {
	
	sort(adj[curr].begin(), adj[curr].end());
	//if (adj[curr].empty()) ans.push_back('P');
	for (auto x : adj[curr]) {
		ans.push_back(letters[x.second]);
		dfs(x.second);
		if (letters[x.second] != 'P') ans.push_back('-');
	}
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int N; cin >> N;
	vector<string> words(N);
	
	for (int i = 0; i < N; i++) cin >> words[i];
	sort(words.begin(), words.end());
	
	int cnt = 1;
	letters.resize(N * 21 + 1);
	adj.resize(N * 20 + 1);
	for (int i = 0; i < N; i++) {
		int pos = 0;
		for (int j = 0; j < words[i].size(); j++) {
			bool exist = false;
			for (auto x : adj[pos]) {
				if (letters[x.second] == words[i][j]) {
					pos = x.second;
					exist = true;
					x.first = max(x.first, (int)(words[i].size()) - j - 1);
					break;
				}
			}
			if (!exist) {
				adj[pos].push_back({words[i].size() - j - 1, cnt});
				letters[cnt] = words[i][j];
				pos = cnt;
				cnt++;
			}
		}
		adj[pos].push_back({0, cnt});
		letters[cnt] = 'P';
		cnt++;
	}
	dfs(0);
	int m = ans.size();
	for (int i = m-1; ans[i] == '-'; i--) {
		ans.pop_back();
	}
	m = ans.size(); cout << m << '\n';
	for (int i = 0; i < m; i++) cout << ans[i] << '\n';
	
	return 0;
}

Compilation message

printer.cpp: In function 'int main()':
printer.cpp:31:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |   for (int j = 0; j < words[i].size(); j++) {
      |                   ~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 10.0

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

Subtask #4
0 / 10.0

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

Subtask #5
0 / 10.0

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

Subtask #6
0 / 10.0

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

Subtask #7
0 / 10.0

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

Subtask #8
0 / 10.0

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

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 16584 KB Output is correct
2 Correct 50 ms 26564 KB Output is correct
3 Incorrect 31 ms 20436 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

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