Submission #1254732
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define rep(i,a,b) for(int i=a;i<b;i++) #define print(x) cout<<x<<endl; typedef long long ll; bool graph[8][8]; int dfs(int v,int N,bool visited[8]){ bool all_visited = true; rep(i, 0, N) { if (visited[i] == false) all_visited = false; } if (all_visited) return 1; int ret = 0; rep(i, 0, N) { if (graph[v][i] == false)continue; if (visited[i]) continue; visited[i] = true; ret += dfs(i, N, visited); visited[i] = false; } return ret; } int main() { int N, M; int A, B; cin >> N >> M; rep(i, 0, M) { cin >> A >> B; graph[A - 1][B - 1] = graph[B - 1][A - 1] = true; } bool visited[8]; rep(i, 0, N) { visited[i] = false; } visited[0] = true; print(dfs(0, N, visited)); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - One-stroke Path |
User | ttakano |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 820 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 |