oj.uz

Submission #115188

# Submission time Handle Problem Language Result Execution time Memory
115188 2019-06-05T23:17:08 Z CaroLinda Type Printer (IOI08_printer) C++14
80 / 100
 1000 ms 56944 KB 
#include <bits/stdc++.h>

#define pii pair<int,int>
#define lp(i,a,b) for(int i=a;i<b;i++)
#define ll long long
#define ff first
#define ss second
#define pb push_back

const int MAXN = 25005;
const int ALF= 30;

using namespace std ;

int n ;
int trie[MAXN*20][ALF] , cnt ;
vector<char> ans ;
bool marc[MAXN*20] ;

void add( string str )
{
	
	int t = str.size() ;
	
	int cur = 0 ;
	
	lp(i,0,t)
	{
		
		int k = str[i] - 'a' ;
		
		if(trie[cur][k] == 0) trie[cur][k] = ++cnt ;
		
		cur = trie[cur][k] ;
		
	}
	marc[cur] =true;
}

bool comp(string s1, string s2)
{ return s1.size() > s2.size() ; }

void dfs(int x)
{
	vector<pii> v ;
	
	lp(i,0,27)
	if( trie[x][i]!= 0 ) v.pb(pii( trie[x][i] , i+'a' )) ;
	
	sort(v.begin() , v.end()) ;
	
	if(marc[x]) ans.pb('P') ;
	
	for(int i = v.size()- 1 ; i >= 0 ; i--)
	{
		char c = v[i].ss;
		ans.pb(c) ;
		dfs(v[i].ff) ;
		ans.pb('-') ;
	}
 	
}

int main()
{
	
	ios_base::sync_with_stdio(false) ;
	cin.tie(NULL) ;
	
	cin>>n ;
	
	vector<string> v ;
	
	string s ;
	
	lp(i,0,n) { cin>>s ; v.pb(s) ;  }
	
	sort(v.begin() , v.end(), comp ) ;
	
	lp(i,0,n) add(v[i]) ;

	dfs(0) ;
	
	cout<<ans.size() - v[0].size() <<endl ;
	
	lp(i,0,ans.size() - v[0].size()) cout<<ans[i]<<endl ;
	
}

Compilation message

printer.cpp: In function 'int main()':
printer.cpp:4:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define lp(i,a,b) for(int i=a;i<b;i++)
printer.cpp:86:5:
  lp(i,0,ans.size() - v[0].size()) cout<<ans[i]<<endl ;
     ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
printer.cpp:86:2: note: in expansion of macro 'lp'
  lp(i,0,ans.size() - v[0].size()) cout<<ans[i]<<endl ;
  ^~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 1280 KB Output is correct
2 Correct 28 ms 1536 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 3704 KB Output is correct
2 Correct 158 ms 7512 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 8700 KB Output is correct
2 Correct 60 ms 2712 KB Output is correct

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 487 ms 21548 KB Output is correct
2 Execution timed out 1062 ms 48088 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 382 ms 17136 KB Output is correct
2 Execution timed out 1077 ms 56944 KB Time limit exceeded
3 Halted 0 ms 0 KB -