oj.uz

Submission #737039

# Submission time Handle Problem Language Result Execution time Memory
737039 2023-05-06T13:45:21 Z onlk97 Duathlon (APIO18_duathlon) C++14
0 / 100
 1000 ms 27056 KB 
#include <bits/stdc++.h>
using namespace std;
long long n,m;
vector <int> g[100010],bc[200010];
bool visited[200010];
long long dfn[100010],lo[100010],w[200020],sz[200020],occ[200020];
stack <int> st;
int tme,curid;
void dfs(int cur){
    tme++;
    dfn[cur]=lo[cur]=tme;
    visited[cur]=1;
    st.push(cur);
    for (int i:g[cur]){
        if (!visited[i]){
            dfs(i);
            lo[cur]=min(lo[cur],lo[i]);
            if (lo[i]==dfn[cur]){
                curid++;
                bool ok=1;
                while (ok){
                    bc[st.top()].push_back(curid);
                    bc[curid].push_back(st.top());
                    w[curid]++;
                    if (st.top()==i) ok=0;
                    st.pop();
                }
                bc[cur].push_back(curid);
                bc[curid].push_back(cur);
                w[curid]++;
            }
        } else lo[cur]=min(lo[cur],dfn[i]);
    }
}
void dfs2(int cur,int prv){
    sz[cur]=(cur<=n);
    long long rem=n-(cur<=n);
    occ[cur]=n*(n-1)/2;
    for (int i:bc[cur]){
        if (i==prv) continue;
        dfs2(i,cur);
        sz[cur]+=sz[i];
        occ[cur]-=sz[i]*(sz[i]-1)/2;
        rem-=sz[i];
    }
    occ[cur]-=rem*(rem-1)/2;
}
signed main(){
    cin>>n>>m;
    for (int i=0; i<m; i++){
        int u,v; cin>>u>>v;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    curid=n;
    for (int i=1; i<=n; i++){
        if (!visited[i]) dfs(i);
    }
    for (int i=1; i<=curid; i++) visited[i]=0;
    for (int i=1; i<=n; i++) w[i]=-1;
    for (int i=1; i<=curid; i++){
        if (!visited[i]) dfs2(i,0);
    }
    long long ans=0;
    for (int i=1; i<=curid; i++) ans+=w[i]*occ[i];
    cout<<ans*2<<'\n';
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 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 5 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 Execution timed out 1066 ms 27056 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 7508 KB Output is correct
2 Correct 68 ms 7532 KB Output is correct
3 Correct 64 ms 7532 KB Output is correct
4 Correct 54 ms 7636 KB Output is correct
5 Correct 57 ms 7636 KB Output is correct
6 Correct 60 ms 7628 KB Output is correct
7 Correct 52 ms 7636 KB Output is correct
8 Correct 66 ms 7624 KB Output is correct
9 Correct 61 ms 7508 KB Output is correct
10 Incorrect 51 ms 7508 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

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

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 63 ms 7508 KB Output is correct
2 Correct 63 ms 7508 KB Output is correct
3 Correct 52 ms 7508 KB Output is correct
4 Correct 41 ms 7472 KB Output is correct
5 Correct 35 ms 7508 KB Output is correct
6 Correct 27 ms 7488 KB Output is correct
7 Correct 21 ms 7508 KB Output is correct
8 Correct 19 ms 7488 KB Output is correct
9 Correct 16 ms 7508 KB Output is correct
10 Correct 16 ms 7512 KB Output is correct
11 Correct 16 ms 7492 KB Output is correct
12 Correct 51 ms 7636 KB Output is correct
13 Correct 62 ms 7588 KB Output is correct
14 Correct 51 ms 7600 KB Output is correct
15 Correct 44 ms 7508 KB Output is correct
16 Incorrect 33 ms 7532 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

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

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 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 5 ms 7380 KB Output isn't correct
2 Halted 0 ms 0 KB -