oj.uz

답안 #1077229

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1077229 2024-08-27T03:37:34 Z Ejen Lampice (COCI19_lampice) C++17
17 / 110
 5000 ms 9224 KB 
#include <bits/stdc++.h>
 
#define el "\n"
#define fu(i, a, b) for (int i = a; i <= b; ++i)
#define fd(i, a, b) for (int i = a; i >= b; --i)
#define ff first
#define ss second
#define all(v) (v).begin(), (v).end()
#define sz(v) (ll)(v).size()
#define mask(i) (1LL << (i))
#define bit(x, i) ((x) >> (i) & 1)
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
 
ll Rand(ll l, ll r) {
    return uniform_int_distribution<ll>(l, r) (rng);
}
 
ll last(ll msk)     {return msk & (-msk);}
ll pop_cnt(ll msk)  {return __builtin_popcountll(msk);}
ll ctz(ll msk)      {return __builtin_ctzll(msk);}
ll lg(ll msk)       {return 63 - __builtin_clzll(msk);}
 
template<class T1, class T2> bool minimize(T1 &a, T2 b) {
    return a > b ? a = b, 1 : 0;
}
 
template<class T1, class T2> bool maximize(T1 &a, T2 b) {
    return a < b ? a = b, 1 : 0;
}
 
template<class T> void print(T a) {
    for (auto x : a) cout << x << " ";
    cout << el;
}
 
template<class T> void compress(T &a) {
    sort(all(a));
    a.resize(unique(all(a)) - a.begin());
}
 
const long long N = 5e4 + 27, mod = 1e9 + 7, inf = 2e18, bl = 320, lim = 1e6 + 27, base = 311;
 
int n, sz;
string s;
int child[N], h[N];
ll hashUp[N], hashDown[N], pw[N], save[N];
bool del[N], ok[N];
basic_string<int> adj[N];
unordered_map<ll, bool> mp;
 
void countChild(int u, int p) {
    child[u] = 1;
    // cout << u << ' '  << child[u] << el;
    for (int v : adj[u]) {
        if (v == p || del[v]) continue;
        countChild(v, u);
        child[u] += child[v];
    }
    // cout << child[u] << ' ';
}
 
int centroid(int u, int p, int root) {
    for (int v : adj[u]) {
        if (v == p || del[v] || child[v] <= child[root] / 2) continue;
        return centroid(v, u, root);
    }
    return u;
}
 
void dfs(int u, int p) {
    hashUp[u] = hashUp[p] + s[u] * pw[h[u] - 1];
    hashDown[u] = hashDown[p] * base + s[u];
    for (int v : adj[u]) {
        if (v == p || del[v]) continue;
        h[v] = h[u] + 1;
        dfs(v, u);
    }
}
 
void dfsUpdate(int u, int p, int len) {
    if (2 * h[u] > len) {
        int par = 2 * h[u] - len;
        if (ok[par]) mp[hashDown[u] - save[par - 1] * pw[h[u] - par + 1]] = true;
    }
    save[h[u]] = hashDown[u];
    if (hashDown[u] == hashUp[u]) ok[h[u]] = true;
    for (int v : adj[u]) {
        if (v == p || del[v]) continue;
        dfsUpdate(v, u, len);
    }
    ok[h[u]] = false;
}
 
bool dfsSearch(int u, int p, int len) {
    if (mp[hashDown[u]]) return true;
    if (h[u] == len && hashUp[u] == hashDown[u]) return true;
    for (int v : adj[u]) {
        if (v == p || del[v]) continue;
        if (dfsSearch(v, u, len)) return true;
    }
    return false;
}
 
bool check(int u, int len) {
    countChild(u, 0);
    int root = centroid(u, 0, u);
    // cout << root << el;
    h[root] = 1;
    dfs(root, 0);
    ok[1] = true;
    save[1] = hashDown[root];
    // fu(i, 1, n) cout << hashDown[i] << ' ' << hashUp[i] << el;
    fu(turn, 0, 1) {
        mp.clear();
        for (int x : adj[root]) {
            if (del[x]) continue;
            if (dfsSearch(x, root, len)) return true;
            dfsUpdate(x, root, len);
        }
        reverse(all(adj[root]));
    }
    // return false;
    del[root] = true;
    for (int v : adj[root]) {
        if (del[v]) continue;
        if (check(v, len)) return true;;
    }
    return false;
}
 
signed main() {
//    freopen("bai3.inp", "r", stdin);
//    freopen("bai3.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> s;
    s = ' ' + s;
    sz = sz(s) - 1;
    pw[0] = 1;
    fu(i, 1, n) pw[i] = pw[i - 1] * base;
    fu(i, 2, n) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    // cout << check(1, 6);
    int res = 1;
    int l = 1, r = n / 2;
    while (l <= r) {
        int mid = (r + l) / 2;
        fu(i, 1, n) del[i] = 0;
        if (check(1, 2 * mid)) {
            res = 2 * mid;
            l = mid + 1;
        }
        else r = mid - 1;
    }
    l = 1, r = n / 2;
    while (l <= r) {
        int mid = (l + r) / 2;
        fu(i, 1, n) del[i] = 0;
        if (check(1, 2 * mid + 1)) {
            maximize(res, 2 * mid + 1);
            l = mid + 1;
        }
        else r = mid - 1;
    }
    cout << res;
    
}

Subtask #1
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1884 KB Output is correct
2 Correct 7 ms 2116 KB Output is correct
3 Correct 32 ms 2136 KB Output is correct
4 Correct 33 ms 2140 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5076 ms 9224 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5025 ms 6840 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1884 KB Output is correct
2 Correct 7 ms 2116 KB Output is correct
3 Correct 32 ms 2136 KB Output is correct
4 Correct 33 ms 2140 KB Output is correct
5 Correct 1 ms 1880 KB Output is correct
6 Correct 1 ms 1884 KB Output is correct
7 Correct 1 ms 1884 KB Output is correct
8 Execution timed out 5076 ms 9224 KB Time limit exceeded
9 Halted 0 ms 0 KB -