oj.uz

답안 #1076834

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1076834 2024-08-26T17:03:36 Z steveonalex Mergers (JOI19_mergers) C++17
10 / 100
 61 ms 41744 KB 
// #include "aliens.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }
 
const int N = 5e5 + 69, LOG_N = 19;
 
int n, k;
int color[N], h[N], parent[N][LOG_N];
vector<int> graph[N];
vector<int> basket[N];
int dp[N], cnt[N];
 
void dfs(int u, int p){
    h[u] = h[p] + 1;
    for(int j = 1; MASK(j) < h[u]; ++j) 
        parent[u][j] = parent[parent[u][j-1]][j-1];
 
    for(int v: graph[u]) if (v != p){
        parent[v][0] = u;
        dfs(v, u);
    }
}
 
int LCA(int u, int v){
    if (h[u] < h[v]) swap(u, v);
    int diff = h[u] - h[v];
    for(int j = 0; j < LOG_N; ++j) if (GETBIT(diff, j)) u = parent[u][j];
    if (u == v) return u;
    for(int j = LOG_N - 1; j>=0; --j) if (parent[u][j] != parent[v][j]){
        u = parent[u][j];
        v = parent[v][j];
    }
    return parent[u][0];
}
 
vector<int> leaf;
void go(int u, int p){
    for(int v: graph[u]) if (v != p){
        go(v, u);
        minimize(dp[u], dp[v]);
    }
    if (u != 1 && dp[u] == h[u]) {
        leaf.push_back(u);
        cnt[u] = 1;
    }
}

void get_leaf(int u, int p){
    int sum = 0;
    for(int v: graph[u]) if (v != p){
        get_leaf(v, u);
        sum += cnt[v];
    } 
    maximize(cnt[u], sum);
}
 
int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();
 
    cin >> n >> k;
    for(int i = 1; i<n; ++i){
        int u, v; cin >> u >> v;
        graph[u].push_back(v);
        graph[v].push_back(u);
    }
 
    for(int i = 1; i<=n; ++i){
        cin >> color[i];
        basket[color[i]].push_back(i);
    }
 
    dfs(1, 0);
 
    for(int i = 1; i<=k; ++i) if (basket[i].size()){
        int lck = basket[i][0];
        for(int j: basket[i]) lck = LCA(lck, j);
        for(int j: basket[i]) dp[j] = h[lck];
    }
 
    go(1, 0);

    sort(ALL(leaf), [&h](int x, int y){return h[x] < h[y];});
    if (leaf.empty()) cout << 0 << "\n";
    else{
        cnt[leaf.back()] = 0;
        get_leaf(leaf.back(),0);

        int ans = cnt[leaf.back()] + 1;
        cout << (ans + 1) / 2 << "\n";
    }
 
    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

Compilation message

mergers.cpp: In function 'int main()':
mergers.cpp:134:23: warning: capture of variable 'h' with non-automatic storage duration
  134 |     sort(ALL(leaf), [&h](int x, int y){return h[x] < h[y];});
      |                       ^
mergers.cpp:59:15: note: 'int h [500069]' declared here
   59 | int color[N], h[N], parent[N][LOG_N];
      |               ^

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 23900 KB Output is correct
2 Correct 10 ms 23896 KB Output is correct
3 Correct 14 ms 23896 KB Output is correct
4 Correct 10 ms 23900 KB Output is correct
5 Correct 12 ms 23900 KB Output is correct
6 Correct 10 ms 23900 KB Output is correct
7 Correct 10 ms 23896 KB Output is correct
8 Correct 12 ms 24000 KB Output is correct
9 Correct 11 ms 23900 KB Output is correct
10 Correct 11 ms 23900 KB Output is correct
11 Correct 9 ms 23900 KB Output is correct
12 Correct 12 ms 23900 KB Output is correct
13 Correct 11 ms 23772 KB Output is correct
14 Correct 11 ms 23900 KB Output is correct
15 Correct 11 ms 23900 KB Output is correct
16 Correct 12 ms 23932 KB Output is correct
17 Correct 12 ms 23900 KB Output is correct
18 Correct 12 ms 23992 KB Output is correct
19 Correct 11 ms 23900 KB Output is correct
20 Correct 11 ms 23900 KB Output is correct
21 Correct 12 ms 23900 KB Output is correct
22 Correct 12 ms 23900 KB Output is correct
23 Correct 10 ms 23840 KB Output is correct
24 Correct 11 ms 23956 KB Output is correct

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 23900 KB Output is correct
2 Correct 10 ms 23896 KB Output is correct
3 Correct 14 ms 23896 KB Output is correct
4 Correct 10 ms 23900 KB Output is correct
5 Correct 12 ms 23900 KB Output is correct
6 Correct 10 ms 23900 KB Output is correct
7 Correct 10 ms 23896 KB Output is correct
8 Correct 12 ms 24000 KB Output is correct
9 Correct 11 ms 23900 KB Output is correct
10 Correct 11 ms 23900 KB Output is correct
11 Correct 9 ms 23900 KB Output is correct
12 Correct 12 ms 23900 KB Output is correct
13 Correct 11 ms 23772 KB Output is correct
14 Correct 11 ms 23900 KB Output is correct
15 Correct 11 ms 23900 KB Output is correct
16 Correct 12 ms 23932 KB Output is correct
17 Correct 12 ms 23900 KB Output is correct
18 Correct 12 ms 23992 KB Output is correct
19 Correct 11 ms 23900 KB Output is correct
20 Correct 11 ms 23900 KB Output is correct
21 Correct 12 ms 23900 KB Output is correct
22 Correct 12 ms 23900 KB Output is correct
23 Correct 10 ms 23840 KB Output is correct
24 Correct 11 ms 23956 KB Output is correct
25 Incorrect 10 ms 23900 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 23900 KB Output is correct
2 Correct 10 ms 23896 KB Output is correct
3 Correct 14 ms 23896 KB Output is correct
4 Correct 10 ms 23900 KB Output is correct
5 Correct 12 ms 23900 KB Output is correct
6 Correct 10 ms 23900 KB Output is correct
7 Correct 10 ms 23896 KB Output is correct
8 Correct 12 ms 24000 KB Output is correct
9 Correct 11 ms 23900 KB Output is correct
10 Correct 11 ms 23900 KB Output is correct
11 Correct 9 ms 23900 KB Output is correct
12 Correct 12 ms 23900 KB Output is correct
13 Correct 11 ms 23772 KB Output is correct
14 Correct 11 ms 23900 KB Output is correct
15 Correct 11 ms 23900 KB Output is correct
16 Correct 12 ms 23932 KB Output is correct
17 Correct 12 ms 23900 KB Output is correct
18 Correct 12 ms 23992 KB Output is correct
19 Correct 11 ms 23900 KB Output is correct
20 Correct 11 ms 23900 KB Output is correct
21 Correct 12 ms 23900 KB Output is correct
22 Correct 12 ms 23900 KB Output is correct
23 Correct 10 ms 23840 KB Output is correct
24 Correct 11 ms 23956 KB Output is correct
25 Incorrect 9 ms 23968 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 38124 KB Output is correct
2 Incorrect 61 ms 41744 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 23900 KB Output is correct
2 Correct 10 ms 23896 KB Output is correct
3 Correct 14 ms 23896 KB Output is correct
4 Correct 10 ms 23900 KB Output is correct
5 Correct 12 ms 23900 KB Output is correct
6 Correct 10 ms 23900 KB Output is correct
7 Correct 10 ms 23896 KB Output is correct
8 Correct 12 ms 24000 KB Output is correct
9 Correct 11 ms 23900 KB Output is correct
10 Correct 11 ms 23900 KB Output is correct
11 Correct 9 ms 23900 KB Output is correct
12 Correct 12 ms 23900 KB Output is correct
13 Correct 11 ms 23772 KB Output is correct
14 Correct 11 ms 23900 KB Output is correct
15 Correct 11 ms 23900 KB Output is correct
16 Correct 12 ms 23932 KB Output is correct
17 Correct 12 ms 23900 KB Output is correct
18 Correct 12 ms 23992 KB Output is correct
19 Correct 11 ms 23900 KB Output is correct
20 Correct 11 ms 23900 KB Output is correct
21 Correct 12 ms 23900 KB Output is correct
22 Correct 12 ms 23900 KB Output is correct
23 Correct 10 ms 23840 KB Output is correct
24 Correct 11 ms 23956 KB Output is correct
25 Incorrect 10 ms 23900 KB Output isn't correct
26 Halted 0 ms 0 KB -