Submission #10313729
Source Code Expand
#include <iostream> #include <vector> #include <algorithm> using namespace std; int N, M, a[10], b[10]; int e[10][10]; vector<int > V; int CHECK(void) { int cur = 1; for (int i = 0; i <= N - 2; i++) { int next = V[i]; if (e[cur][next] == 0) { return -1; } cur = next; } return 1; } int main(void) { cin >> N >> M; for (int i = 1; i <= M; i++) { cin >> a[i] >> b[i]; e[a[i]][b[i]] = 1; e[b[i]][a[i]] = 1; } for (int i = 2; i <= N; i++) { V.push_back(i); } int ans = 0; do { if (CHECK() == 1) { ans++; } } while (next_permutation(V.begin(), V.end())); cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - One-stroke Path |
User | LEE_0102 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 666 Byte |
Status | WA |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 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 | WA | 1 ms | 256 KB |
subtask_1_09.txt | WA | 1 ms | 256 KB |
subtask_1_10.txt | WA | 1 ms | 256 KB |
subtask_1_11.txt | WA | 1 ms | 256 KB |
subtask_1_12.txt | WA | 1 ms | 256 KB |
subtask_1_13.txt | WA | 1 ms | 256 KB |