oj.uz

답안 #511495

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
511495 2022-01-16T00:27:46 Z Yazan_Alattar Type Printer (IOI08_printer) C++14
100 / 100
 106 ms 56712 KB 
#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <utility>
#include <cmath>
#include <numeric>
#include <assert.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 500007;
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};

vector <char> ans;
int n;

struct Trie{
    int to[M][26] = {0}, mx[M] = {0}, sz;
    bool leaf[M] = {0};

    void add(string s){
        int cur = 0;
        mx[0] = max(mx[0], (int)s.size());
        for(int i = 0; i < s.size(); ++i){
            int c = s[i] - 'a';
            if(!to[cur][c]) to[cur][c] = ++sz;
            cur = to[cur][c];
            mx[cur] = max(mx[cur], (int)s.size());
        }
        leaf[cur] = 1;
        return;
    }

    void get(int node){
        vector < pair < pair <int,int>, int > > v;
        for(int i = 0; i < 26; ++i) if(to[node][i]) v.pb({{mx[to[node][i]], i}, to[node][i]});
        sort(all(v));
        if(leaf[node]) ans.pb('P');

        for(auto i : v){
            ans.pb(char('a' + i.F.S));
            get(i.S);
        }
        ans.pb('-');
    }

}T;

int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n;
    for(int i = 1; i <= n; ++i){
        string s;
        cin >> s;
        T.add(s);
    }
    T.get(0);
    while(ans.back() == '-') ans.pop_back();
    cout << ans.size() << endl;
    for(auto i : ans) cout << i << endl;
    return 0;
}

Compilation message

printer.cpp: In member function 'void Trie::add(std::string)':
printer.cpp:37:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   37 |         for(int i = 0; i < s.size(); ++i){
      |                        ~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 53608 KB Output is correct
2 Correct 20 ms 53580 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 53548 KB Output is correct
2 Correct 20 ms 53580 KB Output is correct

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 53800 KB Output is correct
2 Correct 31 ms 54092 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 32 ms 54076 KB Output is correct
2 Correct 26 ms 53748 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 54652 KB Output is correct
2 Correct 87 ms 55992 KB Output is correct
3 Correct 61 ms 55356 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 54536 KB Output is correct
2 Correct 106 ms 56348 KB Output is correct
3 Correct 63 ms 55484 KB Output is correct
4 Correct 90 ms 56712 KB Output is correct