Submission #1592685
Source Code Expand
#include <cstdio> #include <cstdlib> #include <cmath> #include <cctype> #include <iostream> #include <iomanip> #include <algorithm> #include <string> #include <sstream> #include <vector> #include <map> #include <set> #include <complex> #include <functional> #include <utility> #define REP(i, n) for(int i = 0; i < (int)(n); ++i) #define FOR(i, m, n) for(int i = (m); i < (int)(n); ++i) #define ALL(x) (x).begin(), (x).end() #define INF 2000000000 //#define int long long int #ifdef LOCAL #define eprintf(...) fprintf(stdout, __VA_ARGS__) #else #define eprintf(...) 0 #endif using namespace std; typedef long long LL; typedef unsigned long long ULL; typedef unsigned int uint; vector<vector<int>> vv; map<int, map<int, int>> mm; int dfs(int point, vector<bool> visited) { visited[point] = true; if(count(ALL(visited), true) == visited.size()) { return 1; } int result = 0; REP(dest, vv[point].size()) { if(visited[dest] == false && vv[point][dest] == 1) { result += dfs(dest, visited); } } return result; } int main() { int n, m; cin >> n >> m; //map<int, map<int, int>> mm; REP(i, n) { vv.push_back(vector<int>(n)); } int a, b; REP(i, m) { cin >> a >> b; vv[a-1][b-1] = 1; vv[b-1][a-1] = 1; } int ans = 0; vector<int> visited_orig(n, 0); ans += dfs(0, vector<bool>(n)); cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - One-stroke Path |
User | yoshi_k |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1462 Byte |
Status | AC |
Exec Time | 2 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 | 2 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 | 2 ms | 256 KB |
subtask_1_13.txt | AC | 2 ms | 256 KB |