oj.uz

Submission #1000319

# Submission time Handle Problem Language Result Execution time Memory
1000319 2024-06-17T08:37:31 Z AtabayRajabli Type Printer (IOI08_printer) C++17
90 / 100
 1000 ms 129368 KB 
#include <bits/stdc++.h>

// author : a1abay                                                                                                                            

using namespace std;

#define int ll
#define all(v) v.begin(), v.end()

typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const int inff = (int)1e18 + 7;
const int sz = 25e3 + 5;

int n, k, x, cnt;
int t[sz * 26][26], mx[sz * 26], d[sz * 26];
bool w[sz * 26];
vector<array<int, 3>> g[sz * 26];
string s;

void add(int ind, int cur)
{
    while(ind < s.size())
    {
        if(t[cur][s[ind] - 'a']) cur = t[cur][s[ind] - 'a'];
        else cur = t[cur][s[ind] - 'a'] = ++x;
        ind++;
    }
    w[cur] = 1;
}

void dfs(int v)
{
    bool lf = 1;
    for(int i = 0; i < 26; i++)
    {
        if(!t[v][i]) continue;
        lf = 0;
        int c = t[v][i];
        d[c] = d[v] + 1;
        dfs(c);
        mx[v] = max(mx[v], mx[c]);
    }
    for(int i = 0; i < 26; i++)
    {
        if(!t[v][i]) continue;
        int c = t[v][i];
        g[v].push_back({mx[c], c, i});
    }
    sort(all(g[v]));
    if(lf) mx[v] = d[v];
}

void calc(int v, char c)
{
    cnt++;
    cout << c << endl;
    if(w[v]) cout << "P" << endl;
    for(auto i : g[v])
    {
        calc(i[1], char(i[2] + 'a'));
    }
    if(cnt < x)cout << "-" << endl;
}

void solve()
{
    cin >> n;
    for(int i = 0; i < n; i++)
    {
        cin >> s;
        add(0, 0);
    }
    dfs(0);
    cout << x * 2 - mx[0] + n << endl;
    for(auto i : g[0])
    {
        calc(i[1], char(i[2] + 'a'));
    }
}

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0); 
    
    int t = 1;
    // cin >> t;
    while(t--)
    {
        solve();
    }
}

Compilation message

printer.cpp: In function 'void add(ll, ll)':
printer.cpp:24:15: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     while(ind < s.size())
      |           ~~~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 19036 KB Output is correct
2 Correct 14 ms 19804 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 20568 KB Output is correct
2 Correct 23 ms 21084 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 58 ms 24996 KB Output is correct
2 Correct 121 ms 31828 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 168 ms 33996 KB Output is correct
2 Correct 43 ms 22108 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 363 ms 59176 KB Output is correct
2 Correct 845 ms 112720 KB Output is correct
3 Correct 438 ms 65880 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 294 ms 50760 KB Output is correct
2 Execution timed out 1004 ms 129368 KB Time limit exceeded
3 Halted 0 ms 0 KB -