oj.uz

Submission #855043

# Submission time Handle Problem Language Result Execution time Memory
855043 2023-09-30T01:32:29 Z vjudge1 Type Printer (IOI08_printer) C++17
90 / 100
 1000 ms 50468 KB 
#include <bits/stdc++.h>
using namespace std;
const int NN = 1e6 + 10;
#define _for(i, a, b) for(int i = (a); i <= (b); ++i)
bool ED[NN], K[NN];
char L[NN];
int TR[NN][26], N, cnt, num;
string ans;
void insert(string s){
    int p = 0;
    for(int i = 0; s[i]; ++i){
        int x = s[i] - 'a';
        if(!TR[p][x]) TR[p][x] = ++cnt;
        L[TR[p][x]] = x + 'a', p = TR[p][x];
    }
    ED[p] = 1;
}
void mark(string s){
    int p = 0;
    for(int i = 0; s[i]; i++){
        int x = s[i] - 'a';
        K[TR[p][x]] = 1, p = TR[p][x];
    }
}
void dfs(int x){
    if(ED[x] == 1 && x != 0) ++num, ans += "P";
    if(num == N){
        cout << ans.size() << endl;
        for(int i = 0; ans[i]; ++i) cout << ans[i] << endl;
        return;
    }
    int u;
    _for(i, 0, 25){
        u = TR[x][i];
        if(K[u] == 0 && u != 0) ans += L[u], dfs(u), ans += "-";
    }
    _for(i, 0, 25){
        u = TR[x][i];
        if(K[u] && u) ans += L[u], dfs(u), ans += "-";
    }
}
int main(){
	ios::sync_with_stdio(false), cin.tie(0);
    cin >> N;
    string s, l;
    _for(i, 1, N){
        cin >> s, insert(s);
        if(l.size() < s.size()) l = s;
    }
    mark(l), dfs(0);
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2552 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2392 KB Output is correct
2 Correct 9 ms 2908 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 3164 KB Output is correct
2 Correct 21 ms 3416 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 5244 KB Output is correct
2 Correct 125 ms 8284 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 157 ms 9924 KB Output is correct
2 Correct 44 ms 3968 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 379 ms 20248 KB Output is correct
2 Correct 839 ms 42768 KB Output is correct
3 Correct 441 ms 23088 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 303 ms 16372 KB Output is correct
2 Execution timed out 1014 ms 50468 KB Time limit exceeded
3 Halted 0 ms 0 KB -