oj.uz

Submission #25895

# Submission time Handle Problem Language Result Execution time Memory
25895 2017-06-25T03:13:25 Z model_code Triumphal arch (POI13_luk) C++11
100 / 100
 1206 ms 40556 KB 
/*************************************************************************
 *                                                                       *
 *                    XX Olimpiada Informatyczna                         *
 *                                                                       *
 *   Zadanie:              Luk triumfalny                                *
 *   Autor:                Karol Pokorski                                *
 *   Zlozonosc czasowa:    O(n log n)                                    *
 *   Zlozonosc pamieciowa: O(n)                                          *
 *   Opis:                 Rozwiazanie wzorcowe                          *
 *                                                                       *
 *************************************************************************/

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

const int MAXN = 1000001;

vector<int> adj[MAXN];
bool visited[MAXN];

int Check(int u, int k) {
    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);
        }

    return max(0, numChildren+sumTree-k);
}

int main() {
    int ret, N, fromSearch = 0, toSearch;

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

    toSearch = N;

    while (fromSearch < toSearch) {
        int centSearch = (fromSearch+toSearch)/2;

        fill(visited, visited+N, false);

        if (Check(0, centSearch) == 0)
            toSearch = centSearch;
        else
            fromSearch = centSearch+1;
    }

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

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 25584 KB Output is correct
2 Correct 9 ms 25584 KB Output is correct
3 Correct 6 ms 25584 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 25584 KB Output is correct
2 Correct 6 ms 25584 KB Output is correct
3 Correct 6 ms 25584 KB Output is correct
4 Correct 3 ms 25584 KB Output is correct
5 Correct 9 ms 25584 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 25584 KB Output is correct
2 Correct 9 ms 25584 KB Output is correct
3 Correct 3 ms 25584 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 25584 KB Output is correct
2 Correct 6 ms 25584 KB Output is correct
3 Correct 9 ms 25584 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 25980 KB Output is correct
2 Correct 19 ms 26080 KB Output is correct
3 Correct 9 ms 25980 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 26640 KB Output is correct
2 Correct 39 ms 27304 KB Output is correct
3 Correct 26 ms 26772 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 239 ms 28884 KB Output is correct
2 Correct 253 ms 30620 KB Output is correct
3 Correct 133 ms 29284 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 473 ms 32184 KB Output is correct
2 Correct 743 ms 36648 KB Output is correct
3 Correct 296 ms 32992 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1206 ms 35484 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1149 ms 35484 KB Output is correct
2 Correct 783 ms 40556 KB Output is correct
3 Correct 223 ms 36520 KB Output is correct