Submission #1604217
Source Code Expand
//http://abc054.contest.atcoder.jp/tasks/abc054_c //https://book.mynavi.jp/manatee/detail/id=65960 #include <bits/stdc++.h> #define REP(i,a,b) for(int i=(a);i<(b);i++) typedef long long ll; using namespace std; const int INF=1e9, MOD=1e9+7; const int MAX_N=10000; int n,m,a,b; bool con[8][8]={}; //con[i][j]:=iとjがつながっているか。 bool stay[8]={}; //既に訪問したか。 int dfs(int now,int d){ //今いる頂点(now), 深度(d) if(stay[now]) return 0; if(d==n) return 1; stay[now]=true; int c=0; REP(i,0,n) if(con[now][i]) c+=dfs(i,d+1); stay[now]=false; return c; } int main(){ cin >> n >> m; REP(i,0,m){ cin >> a >> b; con[a-1][b-1]=con[b-1][a-1]=true; } cout << dfs(0,1) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - One-stroke Path |
User | ecasdqina |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 781 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 |