oj.uz

Submission #924263

# Submission time Handle Problem Language Result Execution time Memory
924263 2024-02-08T18:21:58 Z codefox Duathlon (APIO18_duathlon) C++14
0 / 100
 147 ms 84296 KB 
#include<bits/stdc++.h>
    
using namespace std;
    
#define ll long long
#define int ll
    
vector<vector<int>> graph;
vector<vector<int>> cgraph;
vector<int> comp;
vector<int> art;
vector<int> low;
vector<int> num;
vector<int> vis;
stack<int> s;
int c = 0;
int d = 0;
int root = 0;
int sub = 0;
vector<ll> compsize;
ll sol = 0;
int n, m;
int N = 1e6;
    
void dfs(int i, int p)
{
    num[i] = low[i] = ++c;
    s.push(i);
    for (int ele:graph[i])
    {
        if (ele == p) continue;
        if (!num[ele]) 
        {
            if (i == root) sub++;
            dfs(ele, i);
            if (low[ele]>=num[i]) art[i] = 1;
            if (low[ele]==num[i])
            {
                while(s.top() != i)
                {
                    comp[s.top()] = d;
                    compsize[d]++;
                    s.pop();
                }
                comp[i] = d;
                compsize[d]++;
                s.pop();
                d++;
            }
            low[i] = min(low[i], low[ele]);
        }
        else low[i] = min(low[i], num[ele]);
    }
    if (num[i]==low[i] && comp[i]==-1)
    {
        art[i] = 1;
        while (s.top() != i)
        {
            comp[s.top()] = d;
            compsize[d]++;
            s.pop();
        }
        comp[i] = d;
        compsize[d]++;
        s.pop();
        d++;
    }
}
    
int dfs2(int i, int p)
{
    vis[i] = 1;
    ll ss = 0;
    vector<int> cs;
    vector<int> v;
    for (int ele:cgraph[i])
    {
        if (!vis[ele]) 
        {
            if (ele < N) cs.push_back(compsize[ele]);
            int h  = dfs2(ele, i);
            ss += h;
            v.push_back(h);
        }
    }
    if (i >= N) ss++;
    else ss+=compsize[i];
    ss-=v.size();
    if (p != -1) 
    {
        if (p < N)   cs.push_back(compsize[p]);
        v.push_back(sub-ss);
    }
    
    if (i >= N)
    {
        for (int ele:v)
        {
            sol += (ele-1)*(sub-ele);
        }
    }
    else 
    {
        int css = compsize[i]-v.size();
        sol += (compsize[i]-1)*(compsize[i]-2)*(compsize[i]);
        for (ll ele:v)
        {
            sol += ele*(sub-ele-1)*(compsize[i]);
        }
    }
    return ss;
}
    
int32_t main()
{
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    
    cin >> n >> m;
    graph.assign(n, vector<int>());
    cgraph.assign(2*N, vector<int>());
    compsize.assign(n, 0);
    low.assign(n, 0);
    num.assign(n, 0);
    comp.assign(n, -1);
    art.assign(n, 0);
    vis.assign(2*N, 0);
    
    for (int i =0; i < m; i++)
    {
        int a, b;
        cin >> a >> b;
        a--; b--;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }
    vector<int> subtree(n, 0);
    
    for (int i = 0; i < n; i++)
    {
        if (!num[i]) 
        {
            root = i;
            sub = 0;
            c = (n-i)*n;
            dfs(i, -1);
            subtree[i] = c;
            if (sub==1) art[i] = 0;
        }
    }
    
    d = N;
    for (int i = 0; i <n; i++)
    {
        if (art[i])
        {
            for (int ele:graph[i])
            {
                cgraph[d].push_back(comp[ele]);
                cgraph[comp[ele]].push_back(d);
            }
            comp[i] = d;
            d++;
        }
    }
    
    for (int i = 0; i < n; i++)
    {
        if (!vis[comp[i]])
        {
            sub = subtree[i];
            dfs2(comp[i], -1);
        }
    }
    cout << sol << "\n";
    
    return 0;
}

Compilation message

count_triplets.cpp: In function 'long long int dfs2(long long int, long long int)':
count_triplets.cpp:104:13: warning: unused variable 'css' [-Wunused-variable]
  104 |         int css = compsize[i]-v.size();
      |             ^~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 63068 KB Output is correct
2 Correct 16 ms 63064 KB Output is correct
3 Correct 17 ms 63068 KB Output is correct
4 Incorrect 17 ms 62896 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 63068 KB Output is correct
2 Correct 16 ms 63064 KB Output is correct
3 Correct 17 ms 63068 KB Output is correct
4 Incorrect 17 ms 62896 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 81748 KB Output is correct
2 Correct 84 ms 81784 KB Output is correct
3 Incorrect 107 ms 84296 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0 / 13.0

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

Subtask #6
0 / 15.0

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

Subtask #7
0 / 20.0

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

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 63068 KB Output is correct
2 Correct 16 ms 63064 KB Output is correct
3 Correct 17 ms 63068 KB Output is correct
4 Incorrect 17 ms 62896 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #9
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 63068 KB Output is correct
2 Correct 16 ms 63064 KB Output is correct
3 Correct 17 ms 63068 KB Output is correct
4 Incorrect 17 ms 62896 KB Output isn't correct
5 Halted 0 ms 0 KB -