oj.uz

Submission #395515

# Submission time Handle Problem Language Result Execution time Memory
395515 2021-04-28T12:37:57 Z MarcoMeijer Type Printer (IOI08_printer) C++14
100 / 100
 160 ms 48352 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e18
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
// dp
template<class T> bool ckmin(T&a, T&b) { bool bl = a > b; a = min(a,b); return bl;}
template<class T> bool ckmax(T&a, T&b) { bool bl = a < b; a = max(a,b); return bl;}
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 6e5;
const int N = (1<<20);

int n;

int chl[MX][26], nextNode=1;
int isLong[MX][26];
bitset<MX> isWord;
string s;
string longest;
vector<char> ans;

void addString(int i=0, int p=0) {
    if(i == s.size()) {
        isWord[p] = 1;
        return;
    }
    int c = s[i]-'a';
    if(chl[p][c] == 0) chl[p][c] = nextNode++;
    addString(i+1, chl[p][c]);
}
void addLong(int i=0, int p=0) {
    if(i == s.size()) return;
    int c = s[i]-'a';
    isLong[p][c] = 1;
    addLong(i+1, chl[p][c]);
}
void dfs(int p=0) {
    if(isWord[p]) ans.pb('P');
    RE(c,26) if(chl[p][c] && !isLong[p][c]) {
        ans.pb('a'+c);
        dfs(chl[p][c]);
        ans.pb('-');
    }
    RE(c,26) if(chl[p][c] && isLong[p][c]) {
        ans.pb('a'+c);
        dfs(chl[p][c]);
    }
}

void program() {
    IN(n);
    RE(i,n) {
        IN(s);
        addString();
        if(s.size() > longest.size()) longest = s;
    }
    s = longest;
    addLong();
    dfs();
    OUTL(ans.size());
    FOR(u,ans) OUTL(u);
}

Compilation message

printer.cpp: In function 'void addString(int, int)':
printer.cpp:75:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     if(i == s.size()) {
      |        ~~^~~~~~~~~~~
printer.cpp: In function 'void addLong(int, int)':
printer.cpp:84:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   84 |     if(i == s.size()) return;
      |        ~~^~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 328 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 324 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 2 ms 716 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1100 KB Output is correct
2 Correct 3 ms 1236 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 3020 KB Output is correct
2 Correct 23 ms 6228 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 7308 KB Output is correct
2 Correct 9 ms 1868 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 17776 KB Output is correct
2 Correct 126 ms 40652 KB Output is correct
3 Correct 66 ms 21184 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 13892 KB Output is correct
2 Correct 160 ms 48352 KB Output is correct
3 Correct 75 ms 24004 KB Output is correct
4 Correct 149 ms 45668 KB Output is correct