#235230 (C++11) No.488 四角関係

• 問題: No.488 四角関係
• ユーザー: komori3
• 提出日時: 2018-02-10 01:11:09
• 言語: C++11 (gcc 11.4.0)
• 結果: AC
• 実行時間: 31 ms / 5,000 ms
• コード長: 3,573 bytes
• コンパイル時間: 2,164 ms
• コンパイル使用メモリ: 164,216 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-04-17 15:14:40
• 合計ジャッジ時間: 2,544 ms
• ジャッジサーバーID （参考情報）: judge1 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	10 ms; 5,248 KB
testcase_01	AC	10 ms; 5,376 KB
testcase_02	AC	10 ms; 5,376 KB
testcase_03	AC	6 ms; 5,376 KB
testcase_04	AC	7 ms; 5,376 KB
testcase_05	AC	15 ms; 5,376 KB
testcase_06	AC	19 ms; 5,376 KB
testcase_07	AC	30 ms; 5,376 KB
testcase_08	AC	31 ms; 5,376 KB
testcase_09	AC	2 ms; 5,376 KB
testcase_10	AC	4 ms; 5,376 KB
testcase_11	AC	1 ms; 5,376 KB
testcase_12	AC	4 ms; 5,376 KB
testcase_13	AC	4 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB
testcase_15	AC	2 ms; 5,376 KB
testcase_16	AC	1 ms; 5,376 KB
testcase_17	AC	2 ms; 5,376 KB
testcase_18	AC	2 ms; 5,376 KB
testcase_19	AC	2 ms; 5,376 KB
testcase_20	AC	1 ms; 5,376 KB
testcase_21	AC	1 ms; 5,376 KB
testcase_22	AC	1 ms; 5,376 KB
testcase_23	AC	1 ms; 5,376 KB
testcase_24	AC	1 ms; 5,376 KB

ソースコード

#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"

#include <random>
//#include "util.k"

using namespace std;

//呪文
#define DUMPOUT cout
#define dump(...) DUMPOUT<<"  ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<"    ";dump_func(__VA_ARGS__)

typedef unsigned uint; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef pair<string, string> pss;
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { ostr << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { ostr << ", " << *itr; }	ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { ostr << ", " << *itr; }	ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const stack<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } stack<_Ty> t(s); ostr << "{" << t.top(); t.pop(); while (!t.empty()) { ostr << ", " << t.top(); t.pop(); } ostr << "}";	return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const list<_Ty>& l) { if (l.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << l.front(); for (auto itr = ++l.begin(); itr != l.end(); ++itr) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _KTy, typename _Ty> istream& operator >> (istream& istr, pair<_KTy, _Ty>& m) { istr >> m.first >> m.second; return istr; }
template <typename _Ty> istream& operator >> (istream& istr, vector<_Ty>& v) { for (size_t i = 0; i < v.size(); i++) istr >> v[i]; return istr; }

template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); }

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...); }

#define PI 3.14159265358979323846
#define EPS 1e-11
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define fake false


typedef pair<ll, pll> pl3;

int main()
{
	//clock_t start, end;
	//start = clock();

	int N, M;
	cin >> N >> M;

	vector<vector<bool>> G(N, vector<bool>(N, false));

	REP(i, M) {
		int a, b;
		cin >> a >> b;
		G[a][b] = G[b][a] = true;
	}

	int ans = 0;
	for (int a = 0; a < N; a++) {
		for (int b = 0; b < N; b++) {
			if (a == b) continue;
			for (int c = 0; c < N; c++) {
				if (a == c || b == c) continue;
				for (int d = 0; d < N; d++) {
					if (a == d || b == d || c == d) continue;
					if (G[a][b] && G[b][c] && G[c][d] && G[d][a] && !G[a][c] && !G[b][d]) ans++;
				}
			}
		}
	}
	cout << ans / 8 << endl;

	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}