oj.uz

답안 #917341

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
917341 2024-01-27T22:01:36 Z Mher777 Type Printer (IOI08_printer) C++17
60 / 100
 94 ms 56272 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <iomanip>
#include <array>
#include <string>
#include <algorithm>
#include <cmath>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <utility>
#include <random>
#include <fstream>
using namespace std;

/* -------------------- Typedefs -------------------- */

typedef int itn;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef float fl;
typedef long double ld;

/* -------------------- Usings -------------------- */

using vi = vector<int>;
using vll = vector<ll>;
using mii = map<int, int>;
using mll = map<ll, ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

/* -------------------- Defines -------------------- */

#define ff first
#define ss second
#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define mpr make_pair
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
#define all(x) (x).begin(), (x).end()

/* -------------------- Constants -------------------- */

const int MAX = int(2e9 + 5);
const ll MAXL = ll(1e18) + 5ll;
const ll MOD = ll(1e9 + 7);
const ll MOD2 = ll(998244353);

/* -------------------- Functions -------------------- */

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

void precision(int x) {
    cout.setf(ios::fixed | ios::showpoint);
    cout.precision(x);
}

ll gcd(ll a, ll b) {
    if (a == 0 || b == 0) return(max(a, b));
    while (b) {
        a %= b;
        swap(a, b);
    }
    return a;
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}

ll range_sum(ll a, ll b) {
    ll dif = a - 1, cnt = b - a + 1;
    ll ans = ((b - a + 1) * (b - a + 2)) / 2;
    ans += ((b - a + 1) * dif);
    return ans;
}

string dec_to_bin(ll a) {
    string s = "";
    for (ll i = a; i > 0; ) {
        ll k = i % 2;
        i /= 2;
        char c = k + 48;
        s += c;
    }
    if (a == 0) {
        s = "0";
    }
    reverse(all(s));
    return s;
}

ll bin_to_dec(string s) {
    ll num = 0;
    for (int i = 0; i < s.size(); i++) {
        num *= 2ll;
        num += (s[i] - '0');
    }
    return num;
}

int isPrime(ll a) {
    if (a == 1) return 0;
    for (ll i = 2; i * i <= a; i++) {
        if (a % i == 0) return 0;
    }
    return 1;
}

ll binpow(ll a, ll b) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
        }
        b >>= 1;
        a *= a;
    }
    return ans;
}

ll binpow_by_mod(ll a, ll b, ll mod) {
    if (!a) return 0;
    ll ans = 1;
    while (b) {
        if (b & 1) {
            ans *= a;
            ans %= mod;
        }
        b >>= 1;
        a *= a;
        a %= mod;
    }
    return ans;
}

/* -------------------- Solution -------------------- */

const int N = 1000005, M = 30;
int trie[N][M], p[N], last[N], mark[N];
string s;
int n, id = 1, answ = 0, node = 0;
vector<char> ans;

void add(int cur = 1, int ind = 0) {
    if (ind == s.size()) {
        mark[cur] = 1;
        return;
    }
    if (!trie[cur][s[ind] - 'a']) trie[cur][s[ind] - 'a'] = ++id, p[id] = cur;
    add(trie[cur][s[ind] - 'a'], ind + 1);
}

void dfs1(int u = 1, int sub = 0, int len = 0) {
    int cnt = 0;
    for (int i = 0; i < 26; ++i) {
        if (trie[u][i]) ++cnt;
    }
    if (cnt > 1) ++sub;
    for (int i = 0; i < 26; ++i) {
        if (trie[u][i]) dfs1(trie[u][i], sub, len + 1);
    }
    if (len - sub > answ) {
        answ = len - sub;
        node = u;
    }
}

void dfs2(int u = 1) {
    int gag = -1;
    if (mark[u]) ans.pub('P');
    for (int i = 0; i < 26; ++i) {
        if (!trie[u][i]) continue;
        if (last[trie[u][i]]) {
            gag = i;
            continue;
        }
        ans.pub(char('a' + i));
        dfs2(trie[u][i]);
    }
    if (gag != -1) {
        ans.pub(char('a' + gag));
        dfs2(trie[u][gag]);
    }
    if (!last[u]) ans.pub('-');
}

void slv() {
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> s;
        add();
    }
    dfs1();
    while (node) {
        last[node] = 1;
        node = p[node];
    }
    dfs2();
    cout << ans.size() << '\n';
    for (auto elem : ans) cout << elem << '\n';
}

void cs() {
    int tstc = 1;
    //cin >> tstc;
    while (tstc--) {
        slv();
    }
}

void precalc() {
    return;
}

int main() {
    fastio();
    precalc();
    //precision(0);
    cs();
    return 0;
}

Compilation message

printer.cpp: In function 'll range_sum(ll, ll)':
printer.cpp:91:21: warning: unused variable 'cnt' [-Wunused-variable]
   91 |     ll dif = a - 1, cnt = b - a + 1;
      |                     ^~~
printer.cpp: In function 'll bin_to_dec(std::string)':
printer.cpp:114:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |     for (int i = 0; i < s.size(); i++) {
      |                     ~~^~~~~~~~~~
printer.cpp: In function 'void add(int, int)':
printer.cpp:166:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  166 |     if (ind == s.size()) {
      |         ~~~~^~~~~~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Incorrect 1 ms 2396 KB too many deletions
3 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

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

Subtask #3
10.0 / 10.0

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

Subtask #4
10.0 / 10.0

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

Subtask #5
10.0 / 10.0

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

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 5464 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 7 ms 7768 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 14812 KB Output is correct
2 Correct 6 ms 6236 KB Output is correct

Subtask #9
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 28628 KB Output is correct
2 Correct 94 ms 56272 KB Output is correct
3 Correct 52 ms 34256 KB Output is correct

Subtask #10
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 35 ms 22228 KB Output isn't correct
2 Halted 0 ms 0 KB -