| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 710243 |
2023-03-15T06:02:31 Z |
lam |
Duathlon (APIO18_duathlon) |
C++14 |
|
117 ms |
23500 KB |
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 1e5 + 10;
int n,m;
vector <int> adj[maxn];
stack <int> st;
int l[maxn],t[maxn],cnt,scc,id[maxn];
int dp[maxn],dp2[maxn],s[maxn];
vector <int> adj2[maxn];
int ans = 0LL;
bool dau[maxn];
void dfs(int x, int p)
{
st.push(x);
l[x] = t[x] = ++cnt;
for (int i:adj[x])
if (i!=p)
{
if (!t[i])
{
dfs(i,x);
l[x]=min(l[x],l[i]);
}
else l[x]=min(l[x],t[i]);
}
if (l[x]==t[x])
{
scc++; int temp;
do
{
temp = st.top(); st.pop();
s[scc]++;
id[temp] = scc;
}
while (temp!=x);
}
}
void dfs2(int x, int p)
{
dp[x] = 0;
for (int i:adj2[x])
if (i!=p)
{
dfs2(i,x);
dp[x] = (dp[x] + dp[i] + s[i]) ;
}
}
void dfs3(int x, int p, int val)
{
dp2[x] = val;
vector <int> pre,suf;
for (int i:adj2[x])
if (i!=p)
{
pre.push_back((dp[i]+s[i]) );
suf.push_back((dp[i]+s[i]) );
}
val = (val + s[x]) ;
// cout<<x<<" :: "<<val<<endl;
// for (int i:pre) cout<<i<<' '; cout<<"@@@@@@@@@@@"<<endl;
// for (int i:suf) cout<<i<<' '; cout<<"@@@@@@@@@@@"<<endl;
for (int i=1; i<pre.size(); i++) pre[i] = (pre[i-1] + pre[i]) ;
for (int i=suf.size()-2; i>=0; i--) suf[i] = (suf[i+1] + suf[i]) ;
// cout<<(int)suf.size()<<"@%$@%#$@"<<endl;
int cnt2=0;
for (int i:adj2[x])
if (i!=p)
{
int val2 = val;
// cout<<val2<<' '<<cnt2<<" -> "<<suf.size()-2<<endl;
if (cnt2>0) val2 = (val2 + pre[cnt2-1]) ;
if (cnt2<=(int)suf.size()-2) val2 = (val2 + suf[cnt2+1]) ;
// cout<<val2<<endl;
cnt2++;
dfs3(i,x,val2);
}
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
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);
}
cnt = scc= 0;
vector <int> root;
for (int i=1; i<=n; i++) if (!t[i]) dfs(i,i), root.push_back(id[i]);
for (int i=1; i<=n; i++)
for (int j:adj[i])
if (id[i]!=id[j])
{
adj2[id[i]].push_back(id[j]);
}
for (int i=1; i<=scc; i++)
{
sort(adj2[i].begin(),adj2[i].end());
adj2[i].resize(unique(adj2[i].begin(),adj2[i].end())-adj2[i].begin());
}
for (int i:root) dfs2(i,i);
for (int i:root) dfs3(i,i,0);
ans = 0LL;
for (int i=1; i<=scc; i++)
{
int sl = s[i];
int temp = 0;
// cout<<s[i]<<" := "<<dp[i]<<' '<<dp2[i]<<'\n';
// assert(sl==1||(sl>=3&&dp[i]==0&&dp2[i]==0));
if (sl>=3)
{
temp = sl*(sl-1)*(sl-2);
ans = (ans + temp);
}
if (sl>=2)
{
temp = (sl-1)*(sl-2) + sl-1;
// cerr<<temp<<endl;
ans = (ans + temp*dp[i]*2);
ans = (ans + temp*dp2[i]*2);
}
ans = (ans + sl*dp[i]*dp2[i]*2);
}
// assert(scc==1);
// int res = 0;
// for (int i:root)
// {
// if (dp[i]==0) continue;
// int p = dp[i] + s[i];
// for (int j=1; j<=p; j++) ans += 2*(j-1)*(p-j);
// }
// cout<<res<<'\n';
// cout<<ans<<'\n';
cout<<ans<<'\n';
}
Compilation message
count_triplets.cpp: In function 'void dfs3(long long int, long long int, long long int)':
count_triplets.cpp:66:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
66 | for (int i=1; i<pre.size(); i++) pre[i] = (pre[i-1] + pre[i]) ;
| ~^~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 2 |
Correct |
3 ms |
4948 KB |
Output is correct |
| 3 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 4 |
Correct |
3 ms |
4948 KB |
Output is correct |
| 5 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 6 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 7 |
Incorrect |
3 ms |
4948 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 2 |
Correct |
3 ms |
4948 KB |
Output is correct |
| 3 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 4 |
Correct |
3 ms |
4948 KB |
Output is correct |
| 5 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 6 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 7 |
Incorrect |
3 ms |
4948 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
64 ms |
17612 KB |
Output is correct |
| 2 |
Correct |
53 ms |
17476 KB |
Output is correct |
| 3 |
Incorrect |
88 ms |
23500 KB |
Output isn't correct |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
5076 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
104 ms |
17140 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
5076 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
117 ms |
17188 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 2 |
Correct |
3 ms |
4948 KB |
Output is correct |
| 3 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 4 |
Correct |
3 ms |
4948 KB |
Output is correct |
| 5 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 6 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 7 |
Incorrect |
3 ms |
4948 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 2 |
Correct |
3 ms |
4948 KB |
Output is correct |
| 3 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 4 |
Correct |
3 ms |
4948 KB |
Output is correct |
| 5 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 6 |
Correct |
2 ms |
4948 KB |
Output is correct |
| 7 |
Incorrect |
3 ms |
4948 KB |
Output isn't correct |
| 8 |
Halted |
0 ms |
0 KB |
- |
