Submission #82822

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
82822	2018-11-01T20:47:31 Z	farukkastamonuda	Inspection (POI11_ins)	C++14	100 / 100	2670 ms	107596 KB

/*************************************************************************
 *                                                                       *
 *                    XVIII Olimpiada Informatyczna                      *
 *                                                                       *
 *   Zadanie:           Inspekcja                                        *
 *   Autor:             Miroslaw Michalski                               *
 *   Zlozonosc czasowa: O(n)                                             *
 *   Opis:              Rozwiazanie wzorcowe - sprytniejsze              *
 *                                                                       *
 *************************************************************************/
 
#include <cstdio>
#include <vector>
#include <queue>
#include <cassert>
 
typedef long long LL; // tylko po to aby sprawdzic jak zachowa sie dla intow
 
const int MAXN = 1000123;
const int NOANS = -1;
 
 
int deg[MAXN];
std::vector<int> v[MAXN];
int n;
 
bool used[MAXN];
int myDeg[MAXN], father[MAXN], sizeOfSubtree[MAXN], depth[MAXN], maxSubtree[MAXN];
LL cost[MAXN];
 
void dfs(int x) {
    used[x] = true;
    for(size_t i = 0; i < v[x].size(); i++) if (!used[v[x][i]]) {
        father[v[x][i]] = x;
        dfs(v[x][i]);
    }
}
 
std::vector<int> getCands(int root) {
    std::vector<int> cands;
    for(int i = 0; i < n; i++) {
        myDeg[i] = deg[i];
        used[i] = false;
        father[i] = -1;
        
        sizeOfSubtree[i] = 1;
        maxSubtree[i] = 0;
    }
    dfs(root);
 
    std::queue<int> q;
    for(int i = 0; i < n; i++) if (myDeg[i] == 1) {
        q.push(i);
    }
    while (!q.empty()) {
        int wz1 = q.front(); q.pop();
        myDeg[father[wz1]]--;
        if (std::max(n - sizeOfSubtree[wz1], maxSubtree[wz1]) <= n/2) {
            cands.push_back(wz1);
        }
        
        sizeOfSubtree[father[wz1]] += sizeOfSubtree[wz1];
        maxSubtree[father[wz1]] = std::max(maxSubtree[father[wz1]], sizeOfSubtree[wz1]);
 
        if (myDeg[father[wz1]] == 1 && father[wz1] != -1) {
            q.push(father[wz1]);
        }
    }
    return cands;
}
 
LL anal(int root) {
// liczymy odpowiedz dla root'a max. poddrzewo == n/2
    for(int i = 0; i < n; i++) {
        myDeg[i] = deg[i];
        used[i] = false;
        father[i] = -1;
        
        sizeOfSubtree[i] = 1;
        cost[i] = 0;
        depth[i] = 0;
    }
    dfs(root);
 
    std::queue<int> q;
    for(int i = 0; i < n; i++) if (myDeg[i] == 1) {
        q.push(i);
    }
 
    while (!q.empty()) {
        int wz1 = q.front(); q.pop();
        myDeg[father[wz1]]--;
        
        sizeOfSubtree[father[wz1]] += sizeOfSubtree[wz1];
        cost[father[wz1]] += (2L * sizeOfSubtree[wz1] + cost[wz1]);
        depth[father[wz1]] = std::max(depth[father[wz1]], depth[wz1] + 1);
 
        if (myDeg[father[wz1]] == 1 && father[wz1] != -1) {
            q.push(father[wz1]);
        }
    }
 
    int maxDepth = 0;
    for(size_t i = 0; i < v[root].size(); i++) {
        maxDepth = std::max(maxDepth, depth[v[root][i]]);
    }
    for(size_t i = 0; i < v[root].size(); i++) {
        if (sizeOfSubtree[v[root][i]] ==  n/2) {
            maxDepth = depth[v[root][i]];
        }
    }
    return cost[root] - (maxDepth + 1);
}
 
int main() {
    int a, b;
    scanf("%d", &n);
    if (n == 1) {
        printf("0\n");
        return 0;
    }
    for(int i = 0; i < n - 1; i++) {
        scanf("%d %d", &a, &b);
        a--; b--;
        v[a].push_back(b);
        v[b].push_back(a);
        deg[a]++;
        deg[b]++;
    }
 
    std::vector<int> getCandidates = getCands(n - 1);
    if (getCandidates.size() == 1) {
        int a = getCandidates[0]; 
        for(int i = 0; i < a; i++) {
            printf("%d\n", NOANS);
        }
        printf("%lld\n", anal(a));
        for(int i = a + 1; i < n; i++) {
            printf("%d\n", NOANS);
        }
    } else if (getCandidates.size() == 2) {
        int a = getCandidates[0], b = getCandidates[1];
        if (a > b) std::swap(a, b);
        for(int i = 0; i < a; i++) {
            printf("%d\n", NOANS);
        }
        printf("%lld\n", anal(a));
        for(int i = a + 1; i < b; i++) {
            printf("%d\n", NOANS);
        }
        printf("%lld\n", anal(b));
        for(int i = b + 1; i < n; i++) {
            printf("%d\n", NOANS);
        }
    } else {
        assert(false);
    }
    return 0;
}

Compilation message

ins.cpp: In function 'int main()':
ins.cpp:117:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
ins.cpp:123:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d", &a, &b);
         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	24 ms	23928 KB	Output is correct
2	Correct	22 ms	23936 KB	Output is correct
3	Correct	22 ms	23936 KB	Output is correct
4	Correct	22 ms	23936 KB	Output is correct
5	Correct	22 ms	23936 KB	Output is correct
6	Correct	22 ms	24028 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	23 ms	24064 KB	Output is correct
2	Correct	22 ms	24064 KB	Output is correct
3	Correct	23 ms	24064 KB	Output is correct
4	Correct	24 ms	24064 KB	Output is correct

Subtask #3
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	24 ms	24096 KB	Output is correct
2	Correct	24 ms	24244 KB	Output is correct
3	Correct	24 ms	24412 KB	Output is correct
4	Correct	25 ms	24412 KB	Output is correct

Subtask #4
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	38 ms	25836 KB	Output is correct
2	Correct	43 ms	26052 KB	Output is correct
3	Correct	41 ms	26252 KB	Output is correct
4	Correct	40 ms	26252 KB	Output is correct

Subtask #5
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	55 ms	27416 KB	Output is correct
2	Correct	56 ms	27544 KB	Output is correct
3	Correct	55 ms	27800 KB	Output is correct
4	Correct	51 ms	27800 KB	Output is correct

Subtask #6
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	119 ms	31432 KB	Output is correct
2	Correct	119 ms	32244 KB	Output is correct
3	Correct	118 ms	32880 KB	Output is correct
4	Correct	101 ms	32880 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	948 ms	59440 KB	Output is correct
2	Correct	918 ms	62812 KB	Output is correct
3	Correct	900 ms	66468 KB	Output is correct
4	Correct	699 ms	66468 KB	Output is correct

Subtask #8
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2299 ms	93448 KB	Output is correct
2	Correct	2341 ms	100472 KB	Output is correct
3	Correct	2330 ms	107444 KB	Output is correct
4	Correct	1881 ms	107444 KB	Output is correct

Subtask #9
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2670 ms	107444 KB	Output is correct
2	Correct	2194 ms	107444 KB	Output is correct
3	Correct	2028 ms	107596 KB	Output is correct
4	Correct	1669 ms	107596 KB	Output is correct

Subtask #10
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2348 ms	107596 KB	Output is correct
2	Correct	2179 ms	107596 KB	Output is correct
3	Correct	2230 ms	107596 KB	Output is correct
4	Correct	1775 ms	107596 KB	Output is correct