oj.uz

답안 #839664

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
839664 2023-08-30T11:41:49 Z ZeroCool Type Printer (IOI08_printer) C++17
0 / 100
 377 ms 24092 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pb push_back
#define mp make_pair

using ll = long long;
using ld = long double;


 
void solve(int T);
void pre();
 
const int mxn = 405;
const int mxm = 405;
const int SQRT = 500;
const int LOG = 20;
const int inf = 1e18;
const int mod = 1e9 + 7;
const ld eps = 1e-9;
 
void pre(){
	#ifdef ONLINE_JUDGE
    ios::sync_with_stdio(false);
    cin.tie(0);
	#endif
	
}




int32_t main(){
	pre();
	int tt = 1;
	//cin>>tt;
	for(int i = 1;i<=tt;i++){
		#ifndef ONLINE_JUDGE
		cout<<"Case "<<i<<": "<<endl;
		#endif
		solve(i);
	}
    return 0;
}



struct Node{
    bool word;
    int chars;
    map<char, Node*> child;

    Node(){
        word = false;
        chars = 0;
    }

    ~Node(){
        for(auto p : child){
            delete p.second;
        }
    }
};

bool cmp(pair<Node*, char> a, pair<Node*, char> b) {
    return (a.first->chars) < (b.first->chars);
}
struct Trie{


    Node *root;

    int totalW;
    int totalO;
    int totalF;
    string ans;

    Trie(){
        root= new Node();
        totalW = 0;
        ans = "";
        totalO = 0;
    }

    ~Trie(){
        delete root;
    }

    void insert(string word){
        Node *curr = root;
        int add = 0;

        for(char &ch : word){
            if(!curr->child.count(ch)){
                curr->child[ch] = new Node();
            }

            curr = curr->child[ch];
            curr->chars = max(curr->chars, (int)(word.size() - add));
            add++;
        }

        curr->word = true;

        totalW++;
    }

    void dfs(Node *curr, char ch){
        if(ch != ' '){
            ans += ch;
            totalO++;
        }

        if(curr->word){
            ans += 'P';
            totalO++;
            totalF++;
        }

        vector<pair<Node*, char> > nex;

        for(auto n : curr->child){
            nex.pb({n.second, n.first});
        }

        sort(nex.begin(), nex.end(), cmp);

        for(auto n : nex){
            dfs(n.first, n.second);
        }

        if(ch != ' ' && totalF < totalW){
            ans+='-';
            totalO++;
        }
    }

    void dfs(){
        totalF = 0;

        dfs(root, ' ');
        cout<<totalO<<endl;

        for(char c : ans)cout<<c<<endl;
    }
};

void solve(int T){
	int n;
    cin>>n;
    Trie t;

    for(int i = 0;i<n;i++){
        string s;
        cin>>s;
        t.insert(s);
    }

    t.dfs();
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Expected integer, but "Case" found
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Expected integer, but "Case" found
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 308 KB Expected integer, but "Case" found
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 212 KB Expected integer, but "Case" found
2 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 340 KB Expected integer, but "Case" found
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 15 ms 1316 KB Expected integer, but "Case" found
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 58 ms 3952 KB Expected integer, but "Case" found
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 148 ms 9748 KB Expected integer, but "Case" found
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 377 ms 24092 KB Expected integer, but "Case" found
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 318 ms 18896 KB Expected integer, but "Case" found
2 Halted 0 ms 0 KB -