| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 349254 | jenny00513 | Type Printer (IOI08_printer) | C++14 | 44 ms | 3432 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
int n;
string st;
string s[25005];
vector<char> print;
vector<string> last;
string nvr = "This should not be printed!";
int main(void)
{
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
cin >> n;
for (int i = 1; i <= n; i++)
cin >> s[i];
sort(s + 1, s + n + 1);
char start = NULL; int mx = 0;
int pos;
for (int i = 1; i <= n; i++)
{
if (s[i].size() > mx)
{
start = (char)s[i][0], mx = s[i].size();
pos = i;
}
}
int ss = -1, ee = -1;
for (int i = 1; i <= n; i++)
{
if (ss == -1 && (char)s[i][0] == start)
ss = i;
if (ee == -1 && ((char)s[i + 1][0] != start || i == n))
{
ee = i;
break;
}
}
for (int i = ss; i <= pos; i++)
{
last.push_back(s[i]);
s[i] = nvr;
}
for (int i = 1; i <= n; i++)
{
if ((char)s[i][0] == start)
continue;
if (s[i] == nvr)
continue;
while (true)
{
if (st == s[i].substr(0, st.size()))
break;
st = st.substr(0, (int)st.size() - 1);
print.push_back('-');
}
for (int k = st.size(); k < s[i].size(); k++)
print.push_back((char)s[i][k]);
print.push_back('P');
st = s[i];
}
for (int i = 1; i <= n; i++)
{
if ((char)s[i][0] != start)
continue;
if (s[i] == nvr)
continue;
while (true)
{
if (st == s[i].substr(0, st.size()))
break;
st = st.substr(0, (int)st.size() - 1);
print.push_back('-');
}
for (int k = st.size(); k < s[i].size(); k++)
print.push_back((char)s[i][k]);
print.push_back('P');
st = s[i];
}
for (int i = 0; i < last.size(); i++)
{
while (true)
{
if (st == last[i].substr(0, st.size()))
break;
st = st.substr(0, (int)st.size() - 1);
print.push_back('-');
}
for (int k = st.size(); k < last[i].size(); k++)
print.push_back((char)last[i][k]);
print.push_back('P');
st = last[i];
}
cout << print.size() << '\n';
for (char each : print)
cout << each << '\n';
return 0;
}
컴파일 시 표준 에러 (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... | ||||
