oj.uz

답안 #406599

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
406599 2021-05-17T19:28:11 Z Carmel_Ab1 Type Printer (IOI08_printer) C++17
100 / 100
 163 ms 58364 KB 
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define gcd __gcd
#define popcount __builtin_popcountll
#define mp make_pair

template<typename T1, typename T2> istream& operator>>(istream& is, pair<T1, T2>& p){is >> p.first >> p.second;return is;}
template<typename T1, typename T2> ostream& operator<<(ostream& os, pair<T1, T2>& p){os <<"" << p.first << " " << p.second << ""; return os;}
void usaco(string taskname){
    string fin = taskname + ".in";
    string fout = taskname + ".out";
    const char* FIN = fin.c_str();
    const char* FOUT = fout.c_str();
    freopen(FIN, "r", stdin);
    freopen(FOUT, "w", stdout);
}
template<typename T>
void read(vector<T>& v){
    int n=v.size();
    for(int i=0; i<n; i++)
        cin >> v[i];
}
template<typename T>
vector<T>UNQ(vector<T>a){
    vector<T>ans;
    for(T t:a)
        if(ans.empty() || t!=ans.back())
            ans.push_back(t);
    return ans;
}
ll ceil(ll a,ll b){
    ll ans=a/b;
    if(a%b)ans++;
    return ans;
}
ld log (ld a,ld b){return log(b)/log(a);}
ll power(ll base, ll exp,ll M=1e9+7){//(base^exp)%M
    ll ans=1;
    while(exp){
        if(exp%2==1)ans=((ans%M)*(base%M))%M;
        base=((base%M)*(base%M))%M;
        exp/=2;
    }
    return ans;
}

string to_base(int n,int new_base){
    string s;
    int nn=n;
    while(nn){
        s+=to_string(nn%new_base);
        nn/=new_base;
    }
    reverse(all(s));
    return s;
}

ll lcm(ll a,ll b){
    ll x= (a/gcd(a,b));
    return b*x;
}
vl generate_array(ll n,ll mn=1,ll mx=1e18+1){
    if(mx==1e18+1)
        mx=n;
    vl ans(n);
    for(int i=0; i<n;i++)
        ans[i]=(mn+rand()%(mx-mn+1));
    return ans;
}
string substr(string s,int l,int r){
    string ans;
    for(int i=l; i<=r; i++)
        ans+=s[i];
    return ans;
}


void solve();
int main(){
    GLHF;
    int t=1;
    //cin >> t;
    while(t--)
        solve();
}
const int maxn=5e5+1;
string ans;
int is_leaf[maxn];
int nxt [maxn][26];
int sz[maxn];
int timer=0;

void insert(string& s){
    int cur=0;
    int n=s.size();
    for(int i=0; i<n; i++){
        sz[cur]=max(sz[cur],n-i);
        if(nxt[cur][s[i]])
            cur=nxt[cur][s[i]];
        else
            cur=nxt[cur][s[i]]=++timer;
    }
    is_leaf[cur]++;
}

void dfs(int cur){
    if(is_leaf[cur])
        ans+='P';
    vector<char> ord;
    for(char c='a'; c<='z'; c++)
        if(nxt[cur][c])
            ord.push_back(c);
    if(!ord.size())
        return;
    sort(all(ord),[&](char x,char y){
        return sz[nxt[cur][x]]<sz[nxt[cur][y]];
    });

    for(int i=0; i<ord.size(); i++){
        ans+=(ord[i]);
        dfs(nxt[cur][ord[i]]);
        ans+=('-');
    }
}
void solve() {
    int n;
    cin >> n;
    for(int i=0; i<maxn; i++){
        for(int j=0; j<26; j++)
            nxt[i][j]=0;
        is_leaf[i]=sz[i]=0;
    }

    for(int i=0; i<n; i++){
        string s;
        cin >> s;
        insert(s);
    }

    dfs(0);
    while(!ans.empty() && ans.back()=='-')
        ans.pop_back();
    cout << ans.size() << "\n";
    for(char c:ans)
        cout << c << "\n";

}

Compilation message

printer.cpp: In function 'void insert(std::string&)':
printer.cpp:124:25: warning: array subscript has type 'char' [-Wchar-subscripts]
  124 |         if(nxt[cur][s[i]])
      |                         ^
printer.cpp:125:30: warning: array subscript has type 'char' [-Wchar-subscripts]
  125 |             cur=nxt[cur][s[i]];
      |                              ^
printer.cpp:127:30: warning: array subscript has type 'char' [-Wchar-subscripts]
  127 |             cur=nxt[cur][s[i]]=++timer;
      |                              ^
printer.cpp: In function 'void dfs(int)':
printer.cpp:137:21: warning: array subscript has type 'char' [-Wchar-subscripts]
  137 |         if(nxt[cur][c])
      |                     ^
printer.cpp: In lambda function:
printer.cpp:142:28: warning: array subscript has type 'char' [-Wchar-subscripts]
  142 |         return sz[nxt[cur][x]]<sz[nxt[cur][y]];
      |                            ^
printer.cpp:142:44: warning: array subscript has type 'char' [-Wchar-subscripts]
  142 |         return sz[nxt[cur][x]]<sz[nxt[cur][y]];
      |                                            ^
printer.cpp: In function 'void dfs(int)':
printer.cpp:145:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  145 |     for(int i=0; i<ord.size(); i++){
      |                  ~^~~~~~~~~~~
printer.cpp:147:28: warning: array subscript has type 'char' [-Wchar-subscripts]
  147 |         dfs(nxt[cur][ord[i]]);
      |                            ^
printer.cpp: In function 'void usaco(std::string)':
printer.cpp:40:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |     freopen(FIN, "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~
printer.cpp:41:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |     freopen(FOUT, "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 54988 KB Output is correct
2 Correct 28 ms 55052 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 55020 KB Output is correct
2 Correct 28 ms 55000 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 54980 KB Output is correct
2 Correct 28 ms 55036 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 55016 KB Output is correct
2 Correct 28 ms 55036 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 54988 KB Output is correct
2 Correct 28 ms 55128 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 55052 KB Output is correct
2 Correct 35 ms 55116 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 55256 KB Output is correct
2 Correct 50 ms 55492 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 55564 KB Output is correct
2 Correct 35 ms 55236 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 78 ms 56172 KB Output is correct
2 Correct 142 ms 57824 KB Output is correct
3 Correct 90 ms 56804 KB Output is correct

Subtask #10
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 55988 KB Output is correct
2 Correct 163 ms 58364 KB Output is correct
3 Correct 99 ms 57060 KB Output is correct
4 Correct 162 ms 58316 KB Output is correct