제출 #481181

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
481181		lolipop	Type Printer (IOI08_printer)	C++17	10 / 100	39 ms	2912 KiB

printer

#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ii = pair <int, int>;

int main () {
  ios::sync_with_stdio(0); cin.tie(0);
#ifdef LOCAL
  freopen("in.txt", "r", stdin);
#endif
  int n; cin >> n;
  vector <string> v;
  for (int i = 0; i < n; ++i) {
    string s; cin >> s;
    v.emplace_back(s);
  }
  sort(v.begin(), v.end(), [](string a, string b){return a.size() < b.size();});
  vector <char> ans;
  n = (int) v.size();
  for (int i = 0; i < n; ++i) {
    string s = v[i];
    int sz = (int) s.size();
    for (char ch : s) ans.emplace_back(ch);
    ans.emplace_back('P');
    if (i != n - 1) {
      while (sz--) ans.emplace_back('-');
    }
  }
  cout << (int) ans.size() << "\n";
  for (auto c : ans) cout << c << "\n";
  return 0;
}
/*
array bound?
overflow?
print newline after every cases
idea correct?
*/

• 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