제출 #1058576

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1058576		gyg	Cat in a tree (BOI17_catinatree)	C++17	11 / 100	0 ms	440 KiB

catinatree

#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 18 + 5, INF = 1e9;

int n, d;
array<vector<int>, MAX_N> adj;

array<array<int, MAX_N>, MAX_N> dist;
void precomp() {
    for (int u = 1; u <= n; u++) {
        fill(dist[u].begin(), dist[u].end(), INF);
        for (int v : adj[u]) dist[u][v] = 1;
        dist[u][u] = 0;
    }

    for (int u = 1; u <= n; u++) 
        for (int v = 1; v <= n; v++) 
            for (int w = 1; w <= n; w++) 
                dist[u][v] = min(dist[u][v], dist[u][w] + dist[w][v]);
}

array<unordered_set<int>, MAX_N> range;
array<bool, MAX_N> del;
int comp() {
    for (int u = 1; u <= n; u++)
        for (int v = 1; v <= n; v++)
            if (dist[u][v] < d) range[u].insert(v);
    
    int ans = 0;
    while (true) {
        int min_siz = INF, best = -1;
        for (int u = 1; u <= n; u++) {
            if (del[u]) continue;
            if (range[u].size() >= min_siz) continue;
            min_siz = range[u].size(), best = u;
        }
        if (best == -1) break;

        ans++;
        for (int u : range[best]) del[u] = true;
        for (int u = 1; u <= n; u++) {
            if (del[u]) continue;
            vector<int> to_del;
            for (int v : range[u])
                if (del[v]) to_del.push_back(v);
            for (int v : to_del) range[u].erase(v);
        }
    }
    return ans;
}

int main() {
    // freopen("cat.in", "r", stdin);
    cin >> n >> d; assert(n <= 18);
    for (int u = 2; u <= n; u++) {
        int v; cin >> v; v++;
        adj[u].push_back(v), adj[v].push_back(u);
    }

    precomp();
    int ans = comp();
    cout << ans << '\n';
}

컴파일 시 표준 에러 (stderr) 메시지

catinatree.cpp: In function 'int comp()':
catinatree.cpp:34:33: warning: comparison of integer expressions of different signedness: 'std::unordered_set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   34 |             if (range[u].size() >= min_siz) continue;
      |                 ~~~~~~~~~~~~~~~~^~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 0 / 40
• Subtask 3: 0 / 49