Submission #445381

#	Time	Username	Problem	Language	Result	Execution time	Memory
445381		JerryLiu06	Type Printer (IOI08_printer)	C++17	100 / 100	123 ms	56452 KiB

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 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 = 1e5 + 10;
const ll INF = 1e18;

int numWords; string longest = ""; vector<char> ans;

template<int SZ> struct Trie {
    int N; struct Node { int child[26], END; } T[SZ]; 

    void init() { N = 0; memset(T[0].child, -1, sizeof T[0].child); T[0].END = 0; }

    void addNode(int X) { memset(T[X].child, -1, sizeof T[X].child); T[X].END = 0; }

    void addString(const string& S) {
        int curNode = 0; F0R(i, sz(S)) {
        	
            if (T[curNode].child[S[i] - 'a'] == -1) {
                addNode(++N); T[curNode].child[S[i] - 'a'] = N;
            }
            curNode = T[curNode].child[S[i] - 'a'];
        }
        T[curNode].END++;
    }
    void DFS(int X, int ind, bool isLongest) {
        if (T[X].END > 0) ans.pb('P'); 
        
        int bad = -1; if (ind < sz(longest)) bad = longest[ind] - 'a'; 

        F0R(i, 26) {
            if (T[X].child[i] == -1 || (i == bad && isLongest)) continue;
            
            ans.pb(char(i + 'a')); DFS(T[X].child[i], ind + 1, false); ans.pb('-');
        }
        if (isLongest && bad != -1) {
            ans.pb(char(bad + 'a')); DFS(T[X].child[bad], ind + 1, true);
        }
    }
};

int main() {
    ios_base::sync_with_stdio(false); cin.tie(0);

    cin >> numWords; Trie<500010> TRIE; TRIE.init();

    F0R(i, numWords) { string S; cin >> S; TRIE.addString(S); if (sz(S) > sz(longest)) longest = S; }
	
    TRIE.DFS(0, 0, true); cout << sz(ans) << "\n"; EACH(C, ans) cout << C << "\n";
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10