oj.uz

Submission #106237

# Submission time Handle Problem Language Result Execution time Memory
106237 2019-04-17T15:39:09 Z Just_Solve_The_Problem Duathlon (APIO18_duathlon) C++11
0 / 100
 174 ms 13672 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define mk make_pair
#define pb push_back
#define fr first
#define sc second
#define vi vector < int >
#define pii pair < int, int >
 
const int N = 2e5 + 7;
const int INF = 1e9 + 7;
 
ll sz[N];
ll n, m;
ll ans;
 
vi g[N];
 
void dfs (int v = 1, int p = 0){
    sz[v] = 1;
    for (int to : g[v]){
        if (!sz[to]){
            dfs(to, v);
            sz[v] += sz[to];
        }
    }
 
}
 
main(){
    cin >> n >> m;
    for (int i = 1; i <= m; i++){
        int a, b;
        cin >> a >> b;
        g[a].pb(b);
        g[b].pb(a);
    }
    dfs();
    for (int i = 1; i <= n; i++){
        ans += sz[i] * (n - sz[i]);
    }
    cout << (ll) ans * 2 - n * (n - 1);
}

Compilation message

count_triplets.cpp:32:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 4992 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 4992 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 165 ms 13672 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4992 KB Output is correct
2 Correct 9 ms 4992 KB Output is correct
3 Correct 7 ms 4992 KB Output is correct
4 Correct 8 ms 5120 KB Output is correct
5 Correct 8 ms 5120 KB Output is correct
6 Correct 7 ms 5120 KB Output is correct
7 Correct 8 ms 5120 KB Output is correct
8 Correct 8 ms 4992 KB Output is correct
9 Correct 7 ms 5120 KB Output is correct
10 Incorrect 7 ms 5120 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 147 ms 9156 KB Output is correct
2 Correct 152 ms 10292 KB Output is correct
3 Correct 174 ms 10380 KB Output is correct
4 Correct 126 ms 10204 KB Output is correct
5 Correct 137 ms 10196 KB Output is correct
6 Correct 157 ms 12640 KB Output is correct
7 Correct 156 ms 11772 KB Output is correct
8 Correct 155 ms 11364 KB Output is correct
9 Correct 149 ms 11128 KB Output is correct
10 Incorrect 130 ms 10232 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4992 KB Output is correct
2 Correct 8 ms 5120 KB Output is correct
3 Incorrect 8 ms 5092 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 9060 KB Output is correct
2 Correct 138 ms 10116 KB Output is correct
3 Incorrect 156 ms 10388 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 4992 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 4992 KB Output isn't correct
2 Halted 0 ms 0 KB -