Submission #120110

#	Time	Username	Problem	Language	Result	Execution time	Memory
120110		arthurconmy	Type Printer (IOI08_printer)	C++17	100 / 100	161 ms	50236 KiB

printer

#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <map>
#include <queue>
#include <bitset>
#include <random>
#include <stack>
#include <deque>
#include <chrono>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef pair<int,int> pii;
#define REP(i, a, b) for (int i = int(a); i <= int(b); i++)
#define REPb(j, d, c) for (int j = int(d); j >= int(c); j--)
#define ff first
#define ss second
#define pb push_back
#define endl "\n"

vector<char> all_actions;

int trie[int(6e5)][26];
bool is_end[int(6e5)];
bool is_long[int(6e5)];

bool comper(string a, string b)
{
	if(a.size() < b.size()) return true;
	if(a.size() > b.size()) return false;

	REP(i,0,a.size()-1)
	{
		if((int)a[i] > (int)b[i])
		{
			return false;
		}

		if((int)a[i] < (int)b[i])
		{
			return true;
		}
	}

	return true;
}

void dfs(int v)
{
	if(is_end[v]) all_actions.pb('P'); // cout << "P" << endl;

	pii loong = {-1,-1};

	REP(i,0,25)
	{
		if(trie[v][i]!=0)
		{
			if(is_long[trie[v][i]])
			{
				loong = {v,i};
				continue; 
			}

			all_actions.pb((char)(i+97)); // cout << (char)(i+97) << endl;

			dfs(trie[v][i]);
		}
	}

	if(loong.ff != -1)
	{
		all_actions.pb((char)(loong.ss+97)); // cout << (char)(loong.ss+97) << endl;

		dfs(trie[loong.ff][loong.ss]);
	}

	all_actions.pb({'-'}); // cout << "-" << endl;
}

int main() // LL OR INT?? DELETED IFSTREAM??
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	//ifstream cin("input.txt");
	//ifstream cin("test.in");
	//ofstream cout("test.out");

	int n;
	cin>>n;

	vector<string> words;

	REP(i,1,n)
	{
		string w;
		cin>>w;

		words.pb(w);
	}

	sort(words.begin(),words.end(),comper);

	// build the trie

	int nex=1;

	REP(wi,0,n-1)
	{
		string w = words[wi];

		int len = w.size();
		int cur=0;

		REP(i,0,len-1)
		{
			if(trie[cur][(int)w[i]-97]!=0)
			{
				cur=trie[cur][(int)w[i]-97];
			}

			else
			{
				trie[cur][(int)w[i]-97]=nex;
				cur=nex;
				nex++;
			}

			if(i==len-1)
			{
				is_end[cur]=true;
			}

			if(wi==n-1)
			{
				is_long[cur] = true;
			}
		}
	}

	// Euler tour the trie

	dfs(0);

	int ans = all_actions.size()-1;

	while(all_actions[ans]=='-') ans--;

	cout << ans+1 << endl;

	REP(i,0,ans)
	{
		cout << all_actions[i] << endl; 
	} 
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10