Submission #59143976

Source Code Expand

#include <bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
#define all(a) a.begin(),a.end()
typedef long long ll;
typedef pair<ll,ll> P;
typedef modint1000000007 mi;
constexpr ll mod=1000000007;

int main(){
	ll n,m;cin>>n>>m;
	scc_graph graph(n);
	rep(i,m){
		int a,b;cin>>a>>b;
		graph.add_edge(a-1,b-1);
	}
	auto scc_graph=graph.scc();
	ll ans=0;
	for(auto e:scc_graph){
		ll d=e.size();
		ans+=d*(d-1)/2;
	}
	cout<<ans<<endl;
}

Submission Info

Submission Time
Task 021 - Come Back in One Piece（★5）
User Rho17
Language C++ 20 (gcc 12.2)
Score 5
Code Size 528 Byte
Status AC
Exec Time 75 ms
Memory 22432 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 5 / 5
Status
AC × 2
AC × 30
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, sample_01.txt, sample_02.txt
Case Name Status Exec Time Memory
in01.txt AC 1 ms 3496 KiB
in02.txt AC 1 ms 3712 KiB
in03.txt AC 2 ms 3796 KiB
in04.txt AC 1 ms 3640 KiB
in05.txt AC 1 ms 3440 KiB
in06.txt AC 1 ms 3592 KiB
in07.txt AC 1 ms 3516 KiB
in08.txt AC 1 ms 3688 KiB
in09.txt AC 1 ms 3552 KiB
in10.txt AC 1 ms 3480 KiB
in11.txt AC 1 ms 3680 KiB
in12.txt AC 1 ms 3528 KiB
in13.txt AC 1 ms 3488 KiB
in14.txt AC 1 ms 3468 KiB
in15.txt AC 1 ms 3560 KiB
in16.txt AC 2 ms 4008 KiB
in17.txt AC 1 ms 3592 KiB
in18.txt AC 1 ms 3508 KiB
in19.txt AC 1 ms 3568 KiB
in20.txt AC 1 ms 3496 KiB
in21.txt AC 45 ms 5408 KiB
in22.txt AC 75 ms 11792 KiB
in23.txt AC 75 ms 11888 KiB
in24.txt AC 75 ms 11812 KiB
in25.txt AC 46 ms 22432 KiB
in26.txt AC 73 ms 7668 KiB
in27.txt AC 49 ms 19208 KiB
in28.txt AC 59 ms 8640 KiB
sample_01.txt AC 1 ms 3508 KiB
sample_02.txt AC 1 ms 3492 KiB