# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
747766 | 2023-05-24T16:15:44 Z | 1075508020060209tc | Duathlon (APIO18_duathlon) | C++14 | 132 ms | 47212 KB |
#include <bits/stdc++.h> using namespace std; #define int long long int n;int m; vector<int>e[300005]; vector<int>tr[300005]; vector<int>bke[300005]; vector<int>dwe[300005]; int sz[300005];int vis[300005];int dph[300005];int fa[300005]; int ans; int ok; void fdfs(int nw){ vis[nw]=1; sz[nw]=1; for(int i=0;i<e[nw].size();i++){ int v=e[nw][i]; if(vis[v]==0){ fa[v]=nw; dph[v]=dph[nw]+1; tr[nw].push_back(v); fdfs(v); sz[nw]+=sz[v]; continue; } if(v==fa[nw]){continue;} if(dph[v]<dph[nw]){ bke[nw].push_back(v); dwe[v].push_back(nw); } } } void dfs1(int nw,int rtsz){ //ans+=(rtsz-sz[nw])*(sz[nw]-1); for(int i=0;i<tr[nw].size();i++){ int v=tr[nw][i]; dfs1(v,rtsz); // ans+=sz[v]*(rtsz-1-sz[v]); } if(bke[nw].size()){ok=1;} } signed main() { cin>>n>>m; for(int i=1;i<=m;i++){ int a;int b; cin>>a>>b; e[a].push_back(b); e[b].push_back(a); } ans=0; vector<int>rt; for(int i=1;i<=n;i++){ if(vis[i]==0){ rt.push_back(i); fdfs(i); } } for(int i=0;i<rt.size();i++){ ok=0; dfs1(rt[i],sz[rt[i]]); // cout<<ok<<" "<<sz[rt[i]]<<"\n"; if(ok){ ans+=(sz[rt[i]]*(sz[rt[i]]-1)*(sz[rt[i]]-2))*2; }else{ ans+=(sz[rt[i]]*(sz[rt[i]]-1)*(sz[rt[i]]-2)/6); } } cout<<ans<<endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 14 ms | 28500 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 14 ms | 28500 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 132 ms | 47212 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 15 ms | 28492 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 127 ms | 37324 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 15 ms | 28508 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 122 ms | 37128 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 14 ms | 28500 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 14 ms | 28500 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |