oj.uz

Submission #742125

# Submission time Handle Problem Language Result Execution time Memory
742125 2023-05-15T16:18:07 Z CSQ31 Type Printer (IOI08_printer) C++17
20 / 100
 1000 ms 126084 KB 
#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
map<int,int>ch[26];
int ncnt = 0;
void add(int v,int i,string s){
	if(i==sz(s))return;
	int c = s[i] - 'a';
	if(!ch[c][v])ch[c][v] = ++ncnt;
	add(ch[c][v],i+1,s);
}
string ans,lng;
int idx = 0;
void print(int v,bool deep){
	int cnt = 0;
	for(int i=0;i<26;i++){
		if(ch[i][v])cnt++;
	}
	if(!cnt){
		ans+='P';
		return;
	}
	int c = deep?lng[idx]-'a' : -1;
	for(int i=0;i<26;i++){
		if(ch[i][v] && i != c){
			ans+=char('a'+i);
			print(ch[i][v],0);
			ans+='-';
		}
	}
	if(deep){
		ans+=char('a'+c);
		idx++;
		print(ch[c][v],1);
	}
	
}
int main()
{
	owo
	int n;
	cin>>n;
	for(int i=0;i<n;i++){
		string s;
		cin>>s;
		if(sz(s) > sz(lng))lng = s;
		add(0,0,s);
	}
	print(0,1);
	cout<<sz(ans)<<'\n';
	string cur;
	for(auto x:ans){
		/*
		if(x=='-')cur.pop_back();
		else if(x=='P')cout<<cur<<'\n';
		else cur+=x;
		* */
		cout<<x<<'\n';
	}
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 340 KB didn't print every word
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 452 KB Output is correct
2 Incorrect 1 ms 340 KB didn't print every word
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 980 KB didn't print every word
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 54 ms 8520 KB didn't print every word
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 277 ms 30880 KB didn't print every word
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 816 ms 78076 KB didn't print every word
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1081 ms 126084 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1082 ms 123072 KB Time limit exceeded
2 Halted 0 ms 0 KB -