제출 #89300

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
89300		vvash17	새로운 문제 (POI13_luk)	C++14	0 / 100	2065 ms	35868 KiB

luk

/*************************************************************************
 *                                                                       *
 *                    XX Olimpiada Informatyczna                         *
 *                                                                       *
 *   Zadanie:              Luk triumfalny                                *
 *   Autor:                Karol Pokorski                                *
 *   Zlozonosc czasowa:    O(n^2)                                        *
 *   Zlozonosc pamieciowa: O(n)                                          *
 *   Opis:                 Rozwiazanie wolne                             *
 *                                                                       *
 *************************************************************************/

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

const int MAXN = 1000001;

vector<int> adj[MAXN];
bool visited[MAXN];
int a = 0;
int Check(int u, int k,int height) {
	if(height>=a)a = height;
    int numChildren = 0, sumTree = 0;
	
    visited[u] = true;

    for (int i = 0; i < (int)adj[u].size(); i++)
        if (!visited[adj[u][i]]) {
            numChildren++;
            sumTree += Check(adj[u][i], k,height+1);
        }

    return max(0, numChildren+sumTree);
}

int main() {
    int N, ret;

    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);
    }

    for (int i = 0; i <= N; i++) {
        fill(visited, visited+N, false);
		int tmp = Check(0, i,0);
		if(a!=0){
			
        if (tmp%a == 0 &&tmp/a == i) {
            printf("%d\n", i);
            return 0;
        }
		
		}
    }

    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