# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
963161 | ByeWorld | Type Printer (IOI08_printer) | C++14 | 78 ms | 39928 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include <random>
#define ll long long
// #define int long long
#define fi first
#define se second
#define pb push_back
#define md ((l+r)>>1)
#define lf (id<<1)
#define rg ((id<<1)|1)
#define ld long double
using namespace std;
typedef pair<int,int> pii;
typedef pair<pii,pii> ipii;
const int MAXN = 5e5+10;
const int MAXA = 1e6+10;
const int INF = 2e9+10;
const int LOG = 30;
const int MOD = 998244353;
int n;
string s[MAXN], gan[MAXN];
vector <pair<char,char>> vec;
vector <pair<string, int>> out;
vector <char> ANS;
signed main(){
// ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n;
int mx = -1, idx = -1;
for(int i=1; i<=n; i++){
cin >> s[i];
if(mx < (int)s[i].size()){
mx = (int)s[i].size();
idx = i;
}
}
for(int i=0; i<s[idx].size(); i++){
pair<char,char> te = {s[idx][i], 'z'};
vec.pb(te);
}
for(int i=1; i<=n; i++){
gan[i] = s[i];
for(int j=0; j<min(vec.size(), s[i].size()); j++){
if(s[i][j] == vec[j].fi) gan[i][j] = vec[j].se;
else if(s[i][j] == vec[j].se) gan[i][j] = vec[j].fi;
}
// cout << i << ' ' << gan[i] << " pp\n";
out.pb({gan[i], i});
}
sort(out.begin(), out.end());
// for(auto in : out){
// cout << in.fi << ' ' << in.se << " inn\n";
// }
string nw = "";
for(int i=0; i<n; i++){
int idx = out[i].se;
string mau = s[idx];
while(mau != nw){
int len = nw.size();
if(len==0){
nw.pb(mau[0]);
ANS.pb(mau[0]);
} else {
bool can = 1;
for(int i=0; i<len; i++){
if(nw[i] != mau[i]){
nw.pop_back();
ANS.pb('-');
can = 0;
}
}
if(can){
nw.pb(mau[len]);
ANS.pb(mau[len]);
}
}
}
ANS.pb('P');
}
cout << ANS.size() << '\n';
for(auto in : ANS) cout << in << '\n';
}
컴파일 시 표준 에러 (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... |