Submission #54061

# Submission time Handle Problem Language Result Execution time Memory
54061 2018-07-02T09:33:08 Z bogdan10bos Duathlon (APIO18_duathlon) C++14
0 / 100
103 ms 13268 KB
#include <bits/stdc++.h>

using namespace std;

//#define FILE_IO

typedef long long LL;

LL ans;
int N, M;
int sz[100005];
int f[100005];
vector<int> edg[100005];

void DFS(int nod, int fth)
{
    sz[nod] = 1;
    LL cnt = 0;
    for(auto nxt: edg[nod])
    {
        if(nxt == fth)  continue;
        DFS(nxt, nod);
        sz[nod] += sz[nxt];
        ans += 1LL * sz[nxt] * cnt;
        cnt += sz[nxt];
    }
    ans += 1LL * (N - sz[nod]) * (sz[nod] - 1);
}

int main()
{
    #ifdef FILE_IO
    freopen("1.in", "r", stdin);
    freopen("1.out", "w", stdout);
    #endif

    scanf("%d%d", &N, &M);
    assert(M == N - 1);
    for(int i = 1; i <= M; i++)
    {
        int x, y;
        scanf("%d%d", &x, &y);
        edg[x].push_back(y);
        edg[y].push_back(x);
    }

    DFS(1, 0);

    ans *= 2;
    printf("%lld\n", ans);

    return 0;
}

Compilation message

count_triplets.cpp: In function 'int main()':
count_triplets.cpp:37:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &N, &M);
     ~~~~~^~~~~~~~~~~~~~~~
count_triplets.cpp:42:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &x, &y);
         ~~~~~^~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Runtime error 7 ms 5112 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 7 ms 5112 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 7 ms 5364 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 4 ms 5364 KB Output is correct
2 Correct 4 ms 5444 KB Output is correct
3 Correct 4 ms 5444 KB Output is correct
4 Correct 4 ms 5496 KB Output is correct
5 Correct 4 ms 5544 KB Output is correct
6 Correct 4 ms 5564 KB Output is correct
7 Correct 4 ms 5564 KB Output is correct
8 Correct 4 ms 5564 KB Output is correct
9 Correct 4 ms 5564 KB Output is correct
10 Runtime error 9 ms 5564 KB Execution killed with signal 11 (could be triggered by violating memory limits)
11 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 69 ms 9236 KB Output is correct
2 Correct 69 ms 9236 KB Output is correct
3 Correct 93 ms 9240 KB Output is correct
4 Correct 64 ms 9240 KB Output is correct
5 Correct 70 ms 9240 KB Output is correct
6 Correct 103 ms 13268 KB Output is correct
7 Correct 92 ms 13268 KB Output is correct
8 Correct 85 ms 13268 KB Output is correct
9 Correct 81 ms 13268 KB Output is correct
10 Runtime error 7 ms 13268 KB Execution killed with signal 11 (could be triggered by violating memory limits)
11 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 5 ms 13268 KB Output is correct
2 Correct 4 ms 13268 KB Output is correct
3 Runtime error 7 ms 13268 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 86 ms 13268 KB Output is correct
2 Correct 81 ms 13268 KB Output is correct
3 Runtime error 7 ms 13268 KB Execution killed with signal 11 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 7 ms 5112 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 7 ms 5112 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -