Submission #1312066

#	Time	Username	Problem	Language	Result	Execution time	Memory
1312066		iamsazidh	Type Printer (IOI08_printer)	C++20	10 / 100	338 ms	5980 KiB

printer

//ᴇᴀᴄʜ ᴘᴇʀꜱᴏɴ ᴡɪʟʟ ᴏɴʟʏ ʜᴀᴠᴇ ᴡʜᴀᴛ ᴛʜᴇʏ ᴇɴᴅᴇᴀᴠᴏᴜʀᴇᴅ ᴛᴏᴡᴀʀᴅꜱ [53:39]
//Author: Sazid Hasan
#include <bits/stdc++.h>
using namespace std;

typedef long long              ll;
typedef double                 dl;
typedef vector<int>            vi;
typedef vector<vector<int>>    vii;
typedef vector<ll>             vl;
typedef vector<bool>           vb;
typedef pair<int,int>         pii;
typedef pair<ll, ll>          pll;

#define ff                first
#define ss                second
#define all(a)            a.begin(),a.end()
#define gcd(a,b)          __gcd(a,b)
#define lcm(a,b)          (a*(b/gcd(a,b)))
#define file();           freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define spc               " "

#ifdef ONLINE_JUDGE
    #define debarr(array)
    #define deb(x)
    #define del
    #define debug(...)
#else
    #define debarr(array)  for(int w = 0; w < array.size(); w++) cerr << #array << "-" << w << " = " << array[w] << endl;
    #define deb(x)         cerr << #x << " = " << x << endl;
    #define del cerr << '\n';
    #define debug(...) _debug(#__VA_ARGS__, __VA_ARGS__);
    
    template <class X, class Y>
    ostream& operator<<(ostream& os, const pair<X, Y>& p) {
        return os << "(" << p.first << ", " << p.second << ")";
    }
    
    template <class Ch, class Tr, class Container>
    basic_ostream<Ch, Tr>& operator<<(basic_ostream<Ch, Tr>& os, const Container& x) {
        int i = 0, n = distance(x.begin(), x.end());
        os << "{ ";
        for (const auto& y : x)
            os << y << (++i < n ? ", " : "");
        return os << " }";
    }
    
    template <typename... Args>
    void _debug(const char* names, Args&&... args) {
        string_view s(names);
        cerr << "{ ";
        size_t i = 0, cnt = 0, n = sizeof...(args);
    
        auto next = [&]() {
            while (i < s.size() && (s[i] == ' ' || s[i] == ',')) ++i;
            size_t st = i;
            while (i < s.size() && s[i] != ',') ++i;
            return s.substr(st, i - st);
        };
    
        ((cerr << next() << ": " << args << (++cnt < n ? ", " : "")), ...);
        cerr << " }" << '\n';
    }
#endif


const double PI =         acos(-1);
const int MOD =           1000000007;
const int inf =           (2147483647);
const double EPS =        1e-6;
const int MAXN =          1e5+10;

vector<char> ans;

void getCost(string &a, string &b){
    int i = 0;
    if(a.size()>b.size()) swap(a, b);
    for(; i < a.size(); i++){
        if(a[i]!=b[i]) break;
    }
    for(int j = i; j < a.size(); j++){
        ans.push_back('-');
    }
    for(int j = i; j < b.size(); j++){
        if(b[j]<'a') ans.push_back(b[j]+32);
        else ans.push_back(b[j]);
    }
    ans.push_back('P');
}

bool solve(){
    int n; cin >> n;
    vector<string> arr(n);
    for(int i = 0; i < n; i++) cin >> arr[i];
    arr.push_back("");
    string mx = "";
    for(auto x: arr){
        if(x.size()>mx.size()) mx = x;
    }
    for(auto &x: arr){
        for(int i = 0; i < x.size(); i++){
            if(i>=mx.size()) break;
            if(x[i]!=mx[i]) x[i] -= 32;
        }
    }
    sort(all(arr));
    for(int i = 1; i <= n; i++){
        getCost(arr[i-1], arr[i]);
    }
    cout << ans.size() << endl;
    for(auto x: ans) cout << x << endl;
    

    return 1;
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int testcase = 1;
    //cin >> testcase;
    for(int tc = 1; tc <= testcase; tc++){
        //cerr << "TESTCASE - " << tc << endl;
        solve();
        //cout << (solve() ? "YES" : "NO") << '\n';
        cerr << endl;
    }

    return 0;
}

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