제출 #25898

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
25898		model_code	새로운 문제 (POI13_luk)	C++11	0 / 100	346 ms	39392 KiB

luk

/*************************************************************************
 *                                                                       *
 *                    XX Olimpiada Informatyczna                         *
 *                                                                       *
 *   Zadanie:              Luk triumfalny                                *
 *   Autor:                Karol Pokorski                                *
 *   Zlozonosc czasowa:    O(n^2)                                        *
 *   Zlozonosc pamieciowa: O(n)                                          *
 *   Opis:                 Rozwiazanie bledne                            *
 *                         Oblicza odleglosci od korzenia, nastepnie     *
 *                         probuje pokrywac kolejne poziomy.             *
 *                                                                       *
 *************************************************************************/

#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

const int MAXN = 1000001;

int numD[MAXN], maxD = 0;
vector<int> adj[MAXN];
bool visited[MAXN];

void Dfs(int u, int curD) {
    visited[u] = true;
    numD[curD]++;
    maxD = max(maxD, curD);

    for (int i = 0; i < (int)adj[u].size(); i++)
        if (!visited[adj[u][i]])
            Dfs(adj[u][i], curD+1);
}

int main() {
    int ret, N, result = 0;

    ret = scanf("%d", &N);
    if (ret < 0)
        return 0;
    for (int i = 0; i < N-1; i++) {
        int u, v;

        ret = scanf("%d%d", &u, &v);
        u--;
        v--;

        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    Dfs(0, 0);

    N--;
    while (N > 0) {
        int canUse = 0;

        result++;

        for (int i = 1; i <= maxD; i++) {
            canUse++;
            while ((canUse > 0) && (numD[i] > 0)) {
                canUse--;
                numD[i]--;
                N--;
            }
        }
    }

    printf("%d\n", result);

    return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 10
• Subtask 5: 0 / 10
• Subtask 6: 0 / 10
• Subtask 7: 0 / 10
• Subtask 8: 0 / 10
• Subtask 9: 0 / 10
• Subtask 10: 0 / 10