oj.uz

답안 #489036

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
489036 2021-11-21T04:41:09 Z JerryLiu06 Type Printer (IOI08_printer) C++17
100 / 100
 92 ms 51776 KB 
// https://oj.uz/problem/view/IOI08_printer

#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using ld = long double;
using db = double;
using str = string;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
 
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<ll>;
using vd = vector<db>;
using vs = vector<str>;
using vpi = vector<pi>;
using vpl = vector<pl>;
using vpd = vector<pd>;
 
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(0);
#define FASTIOF ios_base::sync_with_stdio(false); fin.tie(0);

#define mp make_pair
#define f first
#define s second
 
#define sz(x) (int)(x).size()
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert 
#define ft front()
#define bk back()
#define pb push_back
#define pf push_front
 
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define R0F(i, a) ROF(i, 0, a)
#define EACH(a, x) for (auto& a : x)
 
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); }
ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
 
template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
 
template<class T> void remDup(vector<T>& v) { sor(v); v.erase(unique(all(v)), v.end()); }
 
const int MOD = 1e9 + 7;
const int MX = 5e5 + 10;
const ll INF = 1e18;

template<int SZ> struct Trie {
    int trie[SZ][26], num = 1; int end[SZ]; vector<char> ans;

    void insert(str S) {
        int curNode = 1;

        F0R(i, sz(S)) {
            if (!trie[curNode][S[i] - 'a']) {
                trie[curNode][S[i] - 'a'] = ++num;
            }
            curNode = trie[curNode][S[i] - 'a'];

            if (i == sz(S) - 1) {
                end[curNode]++;
            }
        }
    }
    void DFS(int X, int dep, const str& longest, bool check) {
        F0R(i, end[X]) {
            ans.pb('P');
        }

        F0R(i, 26) {
            if (!trie[X][i] || (check && i == longest[dep] - 'a')) {
                continue;
            }
            ans.pb((char) ('a' + i));
            
            DFS(trie[X][i], dep + 1, longest, false);
            
            ans.pb('-');
        }
        if (check) {
            if (dep < sz(longest) && trie[X][longest[dep] - 'a']) {
                ans.pb(longest[dep]);
                
                DFS(trie[X][longest[dep] - 'a'], dep + 1, longest, true);
                
                ans.pb('-');
            }
        }
    }
};

int N; vs S; Trie<MX> T;

int main() {
    FASTIO;

    cin >> N;
    S.rsz(N);
    
    str longest = "";

    F0R(i, N) {
        cin >> S[i];
        
        if (sz(S[i]) > sz(longest)) {
            longest = S[i];
        }
    }
    F0R(i, N) {
        T.insert(S[i]);
    }
    T.DFS(1, 0, longest, true);
    
    while (T.ans.bk == '-') {
        T.ans.pop_back();
    }
    cout << sz(T.ans) << "\n";
    
    EACH(C, T.ans) {
        cout << C << "\n";
    }
    
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 204 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 716 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1100 KB Output is correct
2 Correct 2 ms 1356 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 3276 KB Output is correct
2 Correct 11 ms 6604 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 7760 KB Output is correct
2 Correct 5 ms 2380 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 19052 KB Output is correct
2 Correct 77 ms 43132 KB Output is correct
3 Correct 44 ms 23144 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 15180 KB Output is correct
2 Correct 92 ms 51776 KB Output is correct
3 Correct 52 ms 26692 KB Output is correct
4 Correct 86 ms 49064 KB Output is correct