Submission #3416050
Source Code Expand
#include <cstdio> #include <algorithm> #include <iostream> #include <vector> #include <map> #include <unordered_map> #include <cmath> #include <queue> #include <set> using namespace std; typedef long long ll; typedef pair<int, int> P; #define INF int(1e9) #define REP(i, n) for(int i = 0; i < (int)(n); i++) #define REPR(i, n) for(int i = n - 1; i >= 0; i--) #define REPONE(i, n) for(int i = 1; i <= (int)(n); i++) #define EACH(i, mp) for(auto i:mp) #define FOR(i, m, n) for(int i = m;i < n;i++) int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; const int MAX_N = 8, MAX_M = 8 * 7 / 2; bool G[MAX_N][MAX_N]; bool visited[MAX_N]; int N, M; int dfs(int v) { bool all_visited = true; REP(i, N) if (!visited[i]) all_visited = false; if (all_visited) return 1; int ret = 0; REP(i, N) { if (!G[v][i]) continue; if (visited[i]) continue; visited[i] = true; ret += dfs(i); visited[i] = false; } return ret; } void solve() { fill(visited, visited + N, false); visited[0] = true; int ans = dfs(0); cout << ans << endl; } int main() { cin >> N >> M; for (int i = 0; i < M; ++i) { int a, b; cin >> a >> b; a--, b--; G[a][b] = G[b][a] = true; } solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - One-stroke Path |
User | hiramekun |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1353 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
subtask_1_01.txt | AC | 1 ms | 256 KB |
subtask_1_02.txt | AC | 1 ms | 256 KB |
subtask_1_03.txt | AC | 1 ms | 256 KB |
subtask_1_04.txt | AC | 1 ms | 256 KB |
subtask_1_05.txt | AC | 1 ms | 256 KB |
subtask_1_06.txt | AC | 1 ms | 256 KB |
subtask_1_07.txt | AC | 1 ms | 256 KB |
subtask_1_08.txt | AC | 1 ms | 256 KB |
subtask_1_09.txt | AC | 1 ms | 256 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |
subtask_1_12.txt | AC | 1 ms | 256 KB |
subtask_1_13.txt | AC | 1 ms | 256 KB |