結果
問題 | No.488 四角関係 |
ユーザー |
![]() |
提出日時 | 2017-02-25 00:36:24 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 880 ms / 5,000 ms |
コード長 | 2,178 bytes |
コンパイル時間 | 1,250 ms |
コンパイル使用メモリ | 109,960 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2025-01-03 02:18:26 |
合計ジャッジ時間 | 7,074 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 22 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:70:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 70 | scanf("%d%d", &N, &M); | ~~~~~^~~~~~~~~~~~~~~~ main.cpp:73:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 73 | scanf("%d%d", &l, &r); | ~~~~~^~~~~~~~~~~~~~~~
ソースコード
#include <iostream>#include <string>#include <queue>#include <stack>#include <algorithm>#include <list>#include <vector>#include <complex>#include <utility>#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <climits>#include <bitset>#include <ctime>#include <map>#include <unordered_map>#include <set>#include <unordered_set>#include <cassert>#include <cstddef>#include <iomanip>#include <numeric>#include <tuple>#include <sstream>#include <fstream>#include <chrono>using namespace std;#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)#define DEBUG(C) cerr << #C << " = " << C << endl;using LL = long long;using VI = vector<int>;using VVI = vector<VI>;using VL = vector<LL>;using VVL = vector<VL>;using VD = vector<double>;using VVD = vector<VD>;using PII = pair<int, int>;using PDD = pair<double, double>;using PLL = pair<LL, LL>;using VPII = vector<PII>;template<typename T> using VT = vector<T>;#define ALL(a) begin((a)), end((a))#define RALL(a) rbegin((a)), rend((a))#define SORT(a) sort(ALL((a)))#define RSORT(a) sort(RALL((a)))#define REVERSE(a) reverse(ALL((a)))#define MP make_pair#define FORE(a, b) for (auto &&a : (b))#define FIND(s, e) ((s).find(e) != (s).end())#define EB emplace_backtemplate<typename T> inline bool chmax(T &a, T b){if (a < b){a = b;return true;}return false;}template<typename T> inline bool chmin(T &a, T b){if (a > b){a = b;return true;}return false;}const int INF = 1e9;const int MOD = INF + 7;const LL LLINF = 1e18;const int MAX = 55;int N, M;PII lr[MAX];int cost[MAX][MAX];int main(void) {scanf("%d%d", &N, &M);REP(i, M) {int l, r;scanf("%d%d", &l, &r);cost[l][r] = cost[r][l] = 1;}int ans = 0;REP(i, N) REP(j, N) REP(k, N) REP(l, N) if (set<int>{i, j, k, l}.size() == 4) {ans += (cost[i][j] && cost[j][k] && cost[k][l] && cost[l][i] && !cost[i][k] && !cost[j][l]);}cout << ans / 8 << endl;}