# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
432990 | SAAD | Type Printer (IOI08_printer) | C++17 | 604 ms | 3408 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#define F first
#define S second
#define rep(i,a,b) for(int i=a;!(a==b&&i!=b)&&((i<=b&&b>=a)||(i>=b&&a>=b));i+=(a<=b?1:-1))
#define pb push_back
#define Fbitl __builtin_ffs
#define bit1 __builtin_popcount
//#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
//#include "memory.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
int mx[200];
int main(){
priority_queue <pair<pair<int,int>, string>> q;
int n;
cin >> n;
string s;
vector <string> x;
vector <char> ans ;
for (int i = 0; i < n; i++)
{
cin >> s;
mx[s[0]] = max(mx[s[0]],(int)s.length());
x.push_back(s);
}
for (auto i : x)
q.push({{-(mx[i[0]]),-i.length()},i});
string now = "";
while (!q.empty()) {
s = q.top().second;
if (now == "") {
for (auto i : s) {
ans.pb(i);
now += i;
}
ans.pb('P');
}
else {
while (now.length()&&(now.length() > s.length() || (s.length()>=now.length()&&s.substr(0,now.length())!=now) )) {
now.pop_back();
ans.pb('-');
}
for (int i = now.length(); i < s.length(); i++) {
ans.pb(s[i]);
now += s[i];
}
ans.pb('P');
}
q.pop();
}
cout << ans.size() << endl;
for(auto i:ans) cout << i << endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |