| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 314331 | ShiftyBlock | Type Printer (IOI08_printer) | C++11 | 1088 ms | 3180 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pii pair<int, int>
#define long long long
#define v vector
#define rep(i,a,b) for(int i=a; i<b; i++)
void setIO(string name, int submit) {
if (submit) {
ios_base::sync_with_stdio(0);
cin.tie(0);
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
else{
ios_base::sync_with_stdio(0);
cin.tie(0);
}
}
string longest;
bool compare(string a, string b){
int samea=0; int sameb=0;
rep(j,0, a.size()){
if(longest[j]==a[j]) samea++;
else break;
}
rep(j,0, b.size()){
if(longest[j]==b[j]) sameb++;
else break;
}
if(samea==sameb){
int cmp= a.compare(b);
if(cmp<0) return true;
else return false;
}
return samea<sameb;
}
int main() {
setIO("printer", 0);
int N;
cin>>N;
v<string> arr;
int worst=0;
for (int i = 0; i < N; ++i)
{
string line; cin>>line; arr.push_back(line);
if(arr[worst].size()<line.size()){
worst=i;
}
}
int basecost=0;
longest= arr[worst];
sort(arr.begin(), arr.end(), compare);
v<int> samearr; samearr.push_back(0);
rep(i,0,N){
int len=arr[i].size();int plen=arr[i-1].size();
if(i==0){
basecost+=len; basecost++;
}
else{
int same=0;
rep(j,0, min(plen, len)){
if(arr[i-1][j]==arr[i][j]) same++;
else break;
}
samearr.push_back(same);
basecost+=plen-same;
basecost+=len-same;
basecost++;
}
}
longest=arr[worst];
cout<<basecost<<endl;
rep(i, 0,N){
int len=arr[i].size();
int plen=arr[i-1].size();
if(i==0){
rep(j,0,len){
cout<<arr[i][j]<<endl;
}
cout<<"P"<<endl;
}
else{
int same=samearr[i];
rep(j,0, plen-same) {
cout<<"-"<<endl;
}
rep(j,same, len){
cout<<arr[i][j]<<endl;
}
cout<<"P"<<endl;
}
}
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... | ||||
