Submission #956277

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstring>
#include <assert.h>
#include <sys/time.h>
#include <fstream>

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)  FOR(i,0,n)
#define REP(i,n)  FOR(i,0,n)
#define each(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define EACH(i,c) for(auto i=(c).begin(); i!=(c).end(); ++i)
#define exist(s,e) ((s).find(e)!=(s).end())

#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#define deb(x) cerr << #x << " = " << (x) << " , ";
#define debl cerr << " (L" << __LINE__ << ")"<< endl;
#define sz(s) (int)((s).size())


#define clr(a) memset((a),0,sizeof(a))
#define nclr(a) memset((a),-1,sizeof(a))
#define pb push_back
#define INRANGE(x,s,e) ((s)<=(x) && (x)<(e))
#define MP(x,y) make_pair((x),(y))

double pi=3.14159265358979323846;

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<string> vs;

template<typename T> std::ostream& operator<<(std::ostream& os, const vector<T>& z){
	os << "[ ";
	REP(i,z.size())os << z[i] << ", " ;
	return ( os << "]" << endl);
}

template<typename T> std::ostream& operator<<(std::ostream& os, const set<T>& z){
	os << "set( ";
	EACH(p,z)os << (*p) << ", " ;
	return ( os << ")" << endl);
}

template<typename T,typename U> std::ostream& operator<<(std::ostream& os, const map<T,U>& z){
	os << "{ ";
	EACH(p,z)os << (p->first) << ": " << (p->second) << ", " ;
	return ( os << "}" << endl);
}

template<typename T,typename U> std::ostream& operator<<(std::ostream& os, const pair<T,U>& z){
	return ( os << "(" << z.first << ", " << z.second << ",)" );
}

double get_time(){
	struct timeval tv;
	gettimeofday(&tv, NULL);
	return tv.tv_sec + tv.tv_usec*1e-6;
}

typedef unsigned int uint32_t;
struct RND{
	uint32_t x;
	uint32_t y;
	uint32_t z;
	uint32_t w;
	RND(){
		x=123456789;
		y=362436069;
		z=521288629;
		w=88675123;
	}
	void init(int seed){
		x=123456789;
		y=362436069;
		z=521288629;
		w=seed+100;
		REP(i,10)get();
	}
	uint32_t get(){
		uint32_t t;
		t=x^(x<<11);
		x=y;y=z;z=w;
		w=(w^(w>>19))^(t^(t>>8));
		return w;
	}
};
RND rnd;

int N,M;
vvl s[2];
vl visit;
vl color;
bool black; // 色の区別がなくなってしまった。
bool bomb; // 爆発したかどうか？
ll edge_num; // 爆発しないときに使用。
ll cnt[3]; // 各色の頂点数

void rec(int v, int c){
	//deb(v);deb(c);debl;
	if(visit[v]){
		if(c!=color[v]){
			black = true;
		}
		return;
	}
	if(s[0][v].size()>0 && s[1][v].size()>0){
		if(!(s[0][v].size()==1 && s[1][v].size()==1 && s[0][v][0]==v ))bomb = true;
	}

	color[v]=c;
	visit[v]=1;
	cnt[c]++;

	rep(b,2){
		rep(ii, s[b][v].size()){
			edge_num++;
			int v2 = s[b][v][ii];
			int c2 = (c+b+1)%3;
			rec(v2, c2);
		}
	}

}

void _main(istream &inp){
	inp >> N >>M;
	rep(b,2){
		s[b] = vvl(N);
	}
	visit = vl(N);
	color = vl(N, -1);
	rep(i,M){
		int a,b;
		inp >> a >> b;
		a--;
		b--;
		s[0][a].push_back(b);
		s[1][b].push_back(a);
	}
	ll ret = 0;
	rep(v,N){
		if(visit[v]==0){
			black = false ; // 色の区別がなくなってしまった。
			bomb = false; // 爆発したかどうか？
			edge_num = 0 ; // 爆発しないときに使用。
			rep(k,3)cnt[k]=0; // 各色の頂点数

			rec(v,0);
			if(!bomb){
				ret += edge_num/2;
			}
			else{
				if(!black){
					ret += cnt[0]*cnt[1] + cnt[1]*cnt[2] + cnt[2]*cnt[0];
				}
				else{
					ret += ( cnt[0] + cnt[1] + cnt[2] ) * ( cnt[0] + cnt[1] + cnt[2] );
				}
			}
			//deb(v);
			//deb(black);
			//deb(bomb);
			//deb(edge_num);
			//debl;

		}
	}
	cout << ret << endl;

	while(true){
		break;
	}

}

int main(){
	if(0){
		ifstream ifs("test.txt");
		_main(ifs);
	}
	else{
		_main(cin);
	}
	return 0;
}

Submission Info

Judge Result