oj.uz

Submission #829632

# Submission time Handle Problem Language Result Execution time Memory
829632 2023-08-18T13:37:51 Z FatihSolak Duathlon (APIO18_duathlon) C++17
0 / 100
 86 ms 26932 KB 
#include <bits/stdc++.h>
#define N 100005
using namespace std;
vector<int> adj[N];
vector<int> adj2[N];
vector<int> adj3[N];
int d[N];
int low[N];
vector<pair<int,int>> edges;
void dfs(int v,int par){
    d[v] = d[par] + 1;
    low[v] = d[v];
    for(auto u:adj[v]){
        if(u == par)
            continue;
        if(d[u] != 0){
            low[v] = min(d[u],low[v]);
            if(d[v] < d[u]){
                adj2[v].push_back(u);
                adj2[u].push_back(v);
            }
        }
        else{
            dfs(u,v);
            low[v] = min(low[v],low[u]);
            if(low[u] <= d[v]){
                adj2[v].push_back(u);
                adj2[u].push_back(v);
            }
            else{
                edges.push_back({u,v});
            }
        }
    }
}
int cnt[N];
int group[N];
int sub[N];
int n;
long long ans = 0;
void dfs2(int v){
    cnt[group[v]]++;
    for(auto u:adj2[v]){
        if(group[u])continue;
        group[u] = group[v];
        dfs2(u);
    }
}
void dfs3(int v,int par){
    sub[v] = cnt[group[v]];
    for(auto u:adj3[group[v]]){
        if(group[u] == group[par])
            continue;
        dfs3(u,v);
        sub[v] += sub[u];
    }
    // cout << v << ' ' << sub[v] << ' ' << cnt[group[v]] << endl;
    ans += 2 * (long long)cnt[group[v]] * (cnt[group[v]] - 1) * (n - cnt[group[v]]);
    ans -= 2 * (long long)(cnt[group[v]] - 1) * (n - cnt[group[v]]);
    for(auto u:adj3[group[v]]){
        if(u == par){
            ans += (long long)cnt[group[v]] * (n - sub[v]) * (sub[v] - cnt[group[v]]);
        }
        else{
            ans += (long long)cnt[group[v]] * (n - sub[u] - cnt[group[v]]) * (sub[u]);
        }
    }
}
void solve(){
    int m;
    cin >> n >> m;
    for(int i = 1;i<=m;i++){
        int u,v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    dfs(1,0);
    for(int i = 1;i<=n;i++){
        if(group[i] == 0){
            group[i] = i;
            dfs2(i);
            ans += (long long)cnt[i] * (cnt[i]-1) * (cnt[i]-2);
        }
        // cout << i << ' ' << group[i] << endl;
    }
    for(auto u:edges){
        adj3[group[u.first]].push_back(u.second);
        adj3[group[u.second]].push_back(u.first);
    }
    dfs3(1,0);
    cout << ans;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    #ifdef Local    
        freopen("in.txt","r",stdin);
        freopen("out.txt","w",stdout);
    #endif
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 25752 KB Output is correct
2 Correct 62 ms 26932 KB Output is correct
3 Incorrect 62 ms 20336 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 16572 KB Output is correct
2 Correct 63 ms 17244 KB Output is correct
3 Correct 57 ms 17256 KB Output is correct
4 Correct 74 ms 17248 KB Output is correct
5 Correct 67 ms 17428 KB Output is correct
6 Correct 86 ms 22964 KB Output is correct
7 Correct 71 ms 20960 KB Output is correct
8 Correct 63 ms 20040 KB Output is correct
9 Correct 58 ms 19008 KB Output is correct
10 Incorrect 44 ms 15548 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 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Incorrect 5 ms 7380 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 16584 KB Output is correct
2 Correct 60 ms 16412 KB Output is correct
3 Incorrect 81 ms 18184 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

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

Subtask #9
0 / 10.0

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