oj.uz

답안 #850698

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
850698 2023-09-17T09:50:12 Z abcvuitunggio Type Printer (IOI08_printer) C++17
100 / 100
 71 ms 50776 KB 
#include <bits/stdc++.h>
using namespace std;
int n,id,ke[500001][26],d[500001],w[500001];
string s,t;
void add(){
    int cur=0;
    for (char c:s){
        if (!ke[cur][c-'a']){
            ke[cur][c-'a']=++id;
            d[id]=d[cur]+1;
        }
        cur=ke[cur][c-'a'];
    }
    w[cur]=1;
}
void dfs(int u, int b){
    for (int i=0;i<26;i++)
        if (!(b&&i==t[d[u]]-'a')&&ke[u][i]){
            cout << (char)(i+'a') << '\n';
            dfs(ke[u][i],0);
        }
    if (w[u])
        cout << "P\n";
    if (b){
        if (d[u]!=t.length()-1){
            cout << t[d[u]] << '\n';
            dfs(ke[u][t[d[u]]-'a'],1);
        }
    }
    else
        cout << "-\n";
}
int main(){
    ios_base::sync_with_stdio(NULL);cin.tie(nullptr);
    cin >> n;
    for (int i=0;i<n;i++){
        cin >> s;
        add();
        if (t.length()<s.length())
            t=s;
    }
    cout << id*2-t.length()+n << '\n';
    t+=' ';
    dfs(0,1);
}

Compilation message

printer.cpp: In function 'void dfs(int, int)':
printer.cpp:25:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |         if (d[u]!=t.length()-1){
      |             ~~~~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

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

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 3160 KB Output is correct
2 Correct 8 ms 6488 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7512 KB Output is correct
2 Correct 4 ms 1880 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 18512 KB Output is correct
2 Correct 60 ms 42632 KB Output is correct
3 Correct 32 ms 22124 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 14556 KB Output is correct
2 Correct 71 ms 50776 KB Output is correct
3 Correct 36 ms 25168 KB Output is correct
4 Correct 58 ms 47900 KB Output is correct