結果
問題 | No.488 四角関係 |
ユーザー |
|
提出日時 | 2019-02-02 15:55:05 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 5 ms / 5,000 ms |
コード長 | 3,030 bytes |
コンパイル時間 | 1,538 ms |
コンパイル使用メモリ | 167,788 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-27 19:05:34 |
合計ジャッジ時間 | 2,591 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 22 |
ソースコード
#include "bits/stdc++.h"using namespace std;/* macro */#define rep(i,a,b) for(int i=a;i<b;i++)#define revrep(i,a,b) for(int i = a; i > b; i--)#define int long long#define exist(s,e) ((s).find(e)!=(s).end())#define all(v) (v).begin(), (v).end()#define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++)#define sum(v) accumulate(all(v), (0LL))#define isin(a, b, c) (b <= a && a <= c)#define println cout << "\n";#define sz(v) (int)v.size()/* alias */template<class T> using vec = vector<T>;typedef vector<int> vi;typedef pair<int, int> pi;typedef tuple<int, int, int> ti;/* constant */const int inf = 1LL << 62;//const int mod = 1e9 + 7;const int dx[8]={1,0,-1,0,-1,1,-1,1};const int dy[8]={0,1,0,-1,-1,-1,1,1};const string alphabet = "abcdefghijklmnopqrstuvwxyz";/* io_method */int input(){int tmp;cin >> tmp;return tmp;}string raw_input(){string tmp;cin >> tmp;return tmp;}template<class T> void printx(T n){cout << n;}template<class T, class U> void printx(pair<T, U> p){cout << "(" << p.first << "," << p.second << ")";}template<class T, class U, class V> void printx(tuple<T, U, V> t){cout << "{" << get<0>(t) << "," << get<1>(t) <<"," << get<2>(t) << "}" << endl;}template<class T> void printx(vector<T> v){cout << "{";rep(i,0,v.size()){printx(v[i]);if(i != v.size()-1)printx(",");}cout << "}";}template<class T> void print(T n){printx(n);cout << endl;}template<class T> void print(set<T> s){cout << "{";each(s, e){if(e != s.begin()) printx(",");printx(*e);}cout << "}" << endl;}template<class T, class U> void print(map<T, U> mp){cout << "{";each(mp, e){cout << "(" << e -> first << "," << e -> second << ")";}cout << "}" <<endl;}/* general_method */template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }template<class T>T cut(T &a, int l, int r){return T(a.begin()+l, a.begin()+r);}template<class T>bool isunique(vector<T> v){set<T> s;rep(i,0,sz(v)){if(not exist(s, v[i])){s.insert(v[i]);}else{return false;}}return true;}/* main */int n, m;bool edges[51][51];void in(){cin >> n >> m;memset(edges, false, sizeof(edges));rep(i,0,m){int f, t; cin >> f >> t;edges[f][t] = true;edges[t][f] = true;}}bool isok(int a, int b, int c, int d){if(edges[a][b] && edges[b][c] && edges[c][d] && edges[d][a]&& not edges[a][c] && not edges[b][d]) return true;else return false;}void solve(){int cnt = 0;rep(i,0,n){rep(j,i + 1, n){rep(k,j + 1, n){rep(l, k + 1, n){if(isok(i,j,k,l) or isok(i,j,l,k) or isok(i,l,j,k)){cnt++;}}}}}print(cnt);}signed main(){cin.tie(0);ios::sync_with_stdio(false);in();solve();}