oj.uz

Submission #985283

# Submission time Handle Problem Language Result Execution time Memory
985283 2024-05-17T14:28:48 Z roctes7 Type Printer (IOI08_printer) C++17
90 / 100
 1000 ms 68104 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
const double eps = 1e-6;
const int MAX = 5e5+3;

int adj[MAX][30];
int num[MAX];
int level[MAX];
int mx_level[MAX];
bool has[MAX];
int nex = 1;

void init(){
    memset(adj,-1,sizeof adj);
}

void add(string s){
	int i = 0, v = 0;
	while(i < s.size()){
		if(adj[v][s[i]-'a'] == -1)
			v = adj[v][s[i++]-'a'] = nex++;
		else
			v = adj[v][s[i++]-'a'];
	}
	has[v] = true;
	num[v]++;
}



void dfs(int u,int d){
    level[u] = d;
    for(char c='a';c<='z';c++)if(adj[u][c-'a']!=-1){
        dfs(adj[u][c-'a'],d+1);
    }
}


void dfs_mx(int u){
    if(has[u])mx_level[u] = level[u];
    for(char c='a';c<='z';c++)if(adj[u][c-'a']!=-1){
        dfs_mx(adj[u][c-'a']);
        mx_level[u] = max(mx_level[u],mx_level[adj[u][c-'a']]);
    }
}

vector<char> ans;

void dfs_ans(int u){
    if(has[u])ans.push_back('P');
    int mx = -1;
    int ind = -1;
    for(char c='a';c<='z';c++)if(adj[u][c-'a']!=-1)if(mx_level[adj[u][c-'a']]>0){
        if(mx_level[adj[u][c-'a']]>mx){
            mx = mx_level[adj[u][c-'a']];
            ind = adj[u][c-'a'];
        }
    }
    for(char c='a';c<='z';c++)if(adj[u][c-'a']!=-1)if(mx_level[adj[u][c-'a']]>0)if(adj[u][c-'a']!=ind){
        ans.push_back(c);
        dfs_ans(adj[u][c-'a']);
    }
    for(char c='a';c<='z';c++)if(adj[u][c-'a']!=-1)if(mx_level[adj[u][c-'a']]>0)if(adj[u][c-'a']==ind){
        ans.push_back(c);
        dfs_ans(adj[u][c-'a']);
    }

    ans.push_back('-');
}

int main(){
    fastio;
    //freopen("output.txt","w",stdout);


    init();

    int n;
    cin>>n;

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


    dfs(0,0);
    dfs_mx(0);
    dfs_ans(0);

    while(ans.back()=='-')ans.pop_back();
    cout<<ans.size()<<endl;

    for(auto a:ans)cout<<a<<endl;



    return 0;
}

Compilation message

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 65112 KB Output is correct
2 Correct 8 ms 65116 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 65116 KB Output is correct
2 Correct 10 ms 65308 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 65368 KB Output is correct
2 Correct 9 ms 65116 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 65112 KB Output is correct
2 Correct 9 ms 65284 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 65112 KB Output is correct
2 Correct 18 ms 65380 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 65368 KB Output is correct
2 Correct 30 ms 65368 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 65836 KB Output is correct
2 Correct 154 ms 65628 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 206 ms 65940 KB Output is correct
2 Correct 54 ms 65372 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 412 ms 66572 KB Output is correct
2 Correct 924 ms 68104 KB Output is correct
3 Correct 542 ms 67100 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 349 ms 66252 KB Output is correct
2 Execution timed out 1024 ms 68084 KB Time limit exceeded
3 Halted 0 ms 0 KB -