CodeForces 489D Unbearable Controversy of Being
2014-11-18 14:10
330 查看
题意:
给出一个n个节点m条边的有向图,求如图所示的菱形的个数。
代码君
给出一个n个节点m条边的有向图,求如图所示的菱形的个数。
#include <cstdio> #include <vector> using namespace std; const int maxn = 3000 + 10; bool G[maxn][maxn]; vector<int> nxt[maxn]; int main() { //freopen("in.txt", "r", stdin); int n, m; scanf("%d%d", &n, &m); for(int i = 0; i < m; ++i) { int a, b; scanf("%d%d", &a, &b); G[a][b] = true; nxt[a].push_back(b); } int ans = 0; for(int a = 1; a <= n; ++a) for(int c = 1; c <= n; ++c) { if(a != c) { int r = 0; for(int b = 0; b < nxt[a].size(); ++b) { if(nxt[a][b] != a && nxt[a][b] != c && G[nxt[a][b]][c]) r++; } ans += r*(r-1)/2; } } printf("%d\n", ans); return 0; }
代码君
相关文章推荐
- Codeforces-352A
- 动态规划,而已! CodeForces 433B - Kuriyama Mirai's Stones
- CodeForces 86D Powerful array
- CodeForces-719B Anatoly and Cockroaches(思维题)
- Codeforces 510D Fox And Jumping【数论+Dp+压缩空间】好题~
- Codeforces 462C C. Appleman and Toastman【贪心】
- CF->CodeForces 256A
- Codeforces 17D Notepad 简单的数论
- CodeForces 638D Three-dimensional Turtle Super Computer
- Codeforces--486B---OR in Matrix思维题
- Codeforces 270A - Fancy Fence
- CodeForces - 859B Lazy Security Guard(思维)
- Codeforces-356C
- CodeForces 363C - Fixing Typos
- codeforces 86D. Powerful array(莫队算法)
- CodeForces 415D Mashmokh and ACM
- CodeForces 605 A.Sorting Railway Cars(贪心)
- Codeforces 322C Ciel and Robot【思维+模拟】细节很多= =
- CodeForces 275C 贪心
- CodeForces 296C Greg and Array (线段树)