제출 #1113448

#제출 시각아이디문제언어결과실행 시간메모리
1113448adaawf철인 이종 경기 (APIO18_duathlon)C++17
5 / 100
209 ms12368 KiB
#include <iostream> #include <vector> using namespace std; vector<int> g[100005], v; int dd[100005], a[15][15][15], h; void dfs(int x) { v.push_back(x); for (int w : v) { a[h][x][w] = 1; } dd[x] = 1; for (int w : g[x]) { if (dd[w] == 1) continue; dfs(w); } dd[x] = 0; v.pop_back(); } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; for (int i = 1; i <= m; i++) { int u, v; cin >> u >> v; g[u].push_back(v); g[v].push_back(u); } for (int i = 1; i <= n; i++) { h = i; dfs(i); } int res = 0; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { if (i == j) continue; for (int k = 1; k <= n; k++) { if (i != k && j != k) { res += a[i][j][k]; } } } } cout << res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...