oj.uz

Submission #374632

# Submission time Handle Problem Language Result Execution time Memory
374632 2021-03-07T17:11:11 Z morato Duathlon (APIO18_duathlon) C++17
0 / 100
 1000 ms 1048576 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 5;

long long ans;
vector<int> adj[N];
int subtree[N], n;

void dfs(int v, int p = 0) {
    subtree[v] = 1;
    for (int u : adj[v]) if (u != p) {
        dfs(u, v);
        subtree[v] += subtree[u];
    }
    vector<long long> pref;
    pref.push_back(n - subtree[v]);
    long long local_ans = 0;
    for (int u : adj[v]) if (u != p) {
        assert(!pref.empty());
        local_ans += pref.back() * 1ll * subtree[u];
        pref.push_back(pref.back() + 1ll * subtree[u]);
    }
    ans += 2ll * local_ans;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int m; cin >> n >> m;
    for (int i = 0; i < m; i++) {
        int a, b; cin >> a >> b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    for (int i = 1; i <= n; i++) {
    	if (!subtree[i]) {
    		dfs(i);
    	}
    }
    cout << ans << '\n';
    return 0;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 588 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Runtime error 588 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1131 ms 590620 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 6636 KB Output is correct
2 Correct 67 ms 6764 KB Output is correct
3 Correct 62 ms 6636 KB Output is correct
4 Correct 64 ms 6636 KB Output is correct
5 Correct 71 ms 6636 KB Output is correct
6 Correct 75 ms 13420 KB Output is correct
7 Correct 78 ms 11116 KB Output is correct
8 Correct 82 ms 10092 KB Output is correct
9 Correct 71 ms 8940 KB Output is correct
10 Incorrect 65 ms 6636 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2796 KB Output is correct
2 Correct 2 ms 2796 KB Output is correct
3 Execution timed out 1030 ms 1048576 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 6784 KB Output is correct
2 Correct 71 ms 6636 KB Output is correct
3 Execution timed out 1150 ms 797548 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 588 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 588 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -