oj.uz

답안 #1046769

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1046769 2024-08-06T22:22:46 Z Jarif_Rahman Mergers (JOI19_mergers) C++17
0 / 100
 23 ms 9424 KB 
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

int n, k;
vector<vector<int>> tree;
vector<int> sz;
vector<int> state, scnt;
vector<int> cnt;
int bsc = 0;

void pre_dfs(int nd, int ss){
    for(int x: tree[nd]) if(x != ss) pre_dfs(x, nd), sz[nd]+=sz[x];
}

bool separable = 0;
void add(int nd, int ss){
    cnt[state[nd]]++;
    if(cnt[state[nd]] == 1) bsc++;
    if(cnt[state[nd]] == scnt[state[nd]]) bsc--;
    for(int x: tree[nd]) if(x != ss) add(x, nd);
}
void remove(int nd, int ss){
    cnt[state[nd]]--;
    if(cnt[state[nd]] == scnt[state[nd]]-1) bsc++;
    if(cnt[state[nd]] == 0) bsc--;
    for(int x: tree[nd]) if(x != ss) remove(x, nd);
}
void dfs(int nd, int ss, bool keep){
    int bigchild = -1, bigchild_size = -1;
    for(int x: tree[nd]) if(x != ss && sz[x] > bigchild_size) bigchild_size = sz[x], bigchild = x;
    for(int x: tree[nd]) if(x != ss && x != bigchild) dfs(x, nd, 0);
    if(bigchild != -1) dfs(bigchild, nd, 1);

    cnt[state[nd]]++;
    if(cnt[state[nd]] == 1) bsc++;
    if(cnt[state[nd]] == scnt[state[nd]]) bsc--;
    for(int x: tree[nd]) if(x != ss && x != bigchild) add(x, nd);
    if(ss != -1 && bsc == 0) separable = 1;

    if(keep) return;
    cnt[state[nd]]--;
    if(cnt[state[nd]] == scnt[state[nd]]-1) bsc++;
    if(cnt[state[nd]] == 0) bsc--;
    for(int x: tree[nd]) if(x != ss) remove(x, nd);
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> k;
    tree.resize(n);
    sz.resize(n, 1);
    state.resize(n);
    scnt.resize(k, 0);
    cnt.resize(k, 0);

    for(int i = 0; i < n-1; i++){
        int a, b; cin >> a >> b; a--, b--;
        tree[a].push_back(b);
        tree[b].push_back(a);
    }
    for(int i = 0; i < n; i++){
        cin >> state[i]; state[i]--;
        scnt[state[i]]++;
    }

    pre_dfs(0, -1);
    dfs(0, -1, 1);
    cout << separable << "\n";
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 24.0

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

Subtask #3
0 / 14.0

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

Subtask #4
0 / 22.0

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

Subtask #5
0 / 30.0

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