oj.uz

Submission #912742

# Submission time Handle Problem Language Result Execution time Memory
912742 2024-01-19T19:18:13 Z imarn Duathlon (APIO18_duathlon) C++14
0 / 100
 1000 ms 1048576 KB 
#include<bits/stdc++.h>
#define f first
#define s second
#define ll long long
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define sz(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vvi vector<vi>
using namespace std;
const int N=1e5+5;
vi g[N];stack<int>st;
vvi cmp,bst;
unsigned ll d[N]{0},lo[N]{0},t=0,ap[N]{0},id[N]{0},cur=0,isap[N]{0},sz[N],dp[N];
void dfs(int u,int p){
    lo[u]=d[u]=++t;st.push(u);
    for(auto v:g[u]){
        if(!d[v]){
            dfs(v,u);
            lo[u]=min(lo[u],lo[v]);
            if(d[u]<=lo[v]){
                ap[u] = (d[u]>1||d[v]>2);cmp.pb({u});
                while(cmp.back().back()!=v){
                    cmp.back().pb(st.top());st.pop();
                }
            }
        }
        else if(v!=p)lo[u]=min(lo[u],d[v]);
    }
}
void build(int n){
    for(int i=1;i<=n;i++)if(ap[i])id[i]=cur++,isap[id[i]]=1,bst.pb({}),sz[id[i]]=1;
    for(auto it : cmp){
        bst.pb({});sz[cur]=it.size();
        for(auto ij : it){
            if(!ap[ij])id[ij]=cur;
            else {
                bst[cur].pb(id[ij]);
                bst[id[ij]].pb(cur);
            }
        }cur++;
    }
}ll ans=0,n;
void solve(int u,int p){
    dp[u]=1;id[u]=1;
    ll tt=0;
    for(auto v:g[u]){
        if(v==p)continue;
        solve(v,u);
        if(isap[u])ans+=2*(dp[u]-1)*(dp[v]);
        dp[u]+=dp[v];
    }
    if(isap[u])ans+=2*(n-dp[u])*(dp[u]-1);
}
int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int m;cin>>n>>m;
    for(int i=1;i<=m;i++){
        int u,v;cin>>u>>v;
        g[u].pb(v);g[v].pb(u);
    }
    //dfs(1,1);build(n);
    for(int i=1;i<=n;i++)sz[i]=1,isap[i]=1;
    for(int i=1;i<=n;i++)if(!id[i])solve(i,i);cout<<ans;
}

Compilation message

count_triplets.cpp: In function 'void solve(int, int)':
count_triplets.cpp:48:8: warning: unused variable 'tt' [-Wunused-variable]
   48 |     ll tt=0;
      |        ^~
count_triplets.cpp: In function 'int main()':
count_triplets.cpp:66:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   66 |     for(int i=1;i<=n;i++)if(!id[i])solve(i,i);cout<<ans;
      |     ^~~
count_triplets.cpp:66:47: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   66 |     for(int i=1;i<=n;i++)if(!id[i])solve(i,i);cout<<ans;
      |                                               ^~~~

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 677 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 677 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 1085 ms 566952 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 11448 KB Output is correct
2 Correct 26 ms 11484 KB Output is correct
3 Correct 35 ms 11344 KB Output is correct
4 Correct 29 ms 11484 KB Output is correct
5 Correct 26 ms 11280 KB Output is correct
6 Correct 32 ms 15448 KB Output is correct
7 Correct 40 ms 14016 KB Output is correct
8 Correct 31 ms 13392 KB Output is correct
9 Correct 31 ms 12848 KB Output is correct
10 Incorrect 28 ms 11368 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5992 KB Output is correct
2 Correct 2 ms 5988 KB Output is correct
3 Runtime error 749 ms 1048576 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 11264 KB Output is correct
2 Correct 34 ms 11364 KB Output is correct
3 Runtime error 809 ms 1048576 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #8
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 677 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 677 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -