# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
445725 | dxz05 | Type Printer (IOI08_printer) | C++14 | 1080 ms | 130688 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define SZ(x) (int)(x).size()
const int MAXN = 6e5 + 3e2;
string str[MAXN];
int next_free = 2;
int trie[MAXN][50];
int term[MAXN];
void add(int ind, string &s){
int v = 1;
for (int i = 0; i < s.size(); i++){
int x = s[i] - 'a';
if (trie[v][x] == 0) trie[v][x] = next_free++;
v = trie[v][x];
}
term[v] = ind;
}
string s[MAXN];
int arr2[MAXN];
int arr[MAXN];
int idx = 0;
void sort(int v){
if (term[v]) s[++idx] = str[term[v]], arr2[idx] = arr[term[v]];
for (int i = 0; i < 50; i++){
if (trie[v][i] != 0){
sort(trie[v][i]);
}
}
}
int main(){
ios_base::sync_with_stdio(false);
int n;
cin >> n;
int ind = 0;
for (int i = 1; i <= n; i++){
cin >> str[i];
if (str[i].size() > str[ind].size()) ind = i;
}
string longest = str[ind];
for (int i = 1; i <= n; i++){
int j = 0;
while (j < str[i].size() && str[i][j] == longest[j]) j++;
if (j) str[i] = string(j, '{') + str[i];
arr[i] = j;
add(i, str[i]);
//cout << j << ' ' << str[i] << endl;
}
sort(1);
vector<char> ans;
for (int i = 1; i <= n; i++){
int j = 0;
if (arr2[i]) s[i].erase(0, arr2[i]);
int m = s[i - 1].size(), k = s[i].size();
if (m > k){
int need = m - k;
while (need--) ans.push_back('-');
m = k;
}
int cnt = 0;
for (int j = 0; j < min(m, k); j++){
if (s[i - 1][j] == s[i][j]) cnt++; else
break;
}
int need = m - cnt;
while (need--){
ans.push_back('-');
}
for (int j = cnt; j < k; j++){
ans.push_back(s[i][j]);
}
ans.push_back('P');
}
cout << ans.size() << endl;
for (char c : ans) cout << c << endl;
return 0;
}
/**
3
print
the
poem
*/
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |