This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std ;
const int MAX = 1e5 + 10 ;
int arr[MAX] ;
int n , m ;
set<int>adj[MAX] ;
int main()
{
ios_base::sync_with_stdio(0) ;
cin.tie(0) ;
cin>>n>>m ;
for(int i = 0 ; i < m ; ++i)
{
int x , y ;
cin>>x>>y ;
adj[x].insert(y) ;
for(int it = 0 ; it < n+5 ; ++it)
{
for(int i = 1 ; i <= n ; ++i)
{
for(auto &j : adj[i])
{
for(auto &k : adj[j])
{
if(adj[k].find(j) != adj[k].end() && i != k)
adj[i].insert(k) ;
}
}
}
}
int ans = 0 ;
for(int i = 1 ; i <= n ; ++i)
ans += adj[i].size() ;
cout<<ans<<"\n" ;
}
return 0 ;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |