Submission #2555305
Source Code Expand
#include <bits/stdc++.h> #define REP(i, s, n) for (int i = s; i < n; ++i) #define rep(i, n) REP(i, 0, n) #define SORT(c) sort((c).begin(), (c).end()) #define SORT_INV(c) sort((c).begin(), (c).end(), greater<int>()) #define IINF INT_MAX #define LLINF LLONG_MAX #define DEBUG false #define LL long long // sort(a.begin(), a.end(), std::greater<int>()); using namespace std; struct edge { int to, cost; }; vector<int> G[8]; int check[8] = {0}; int N; int func(int index) { //今、indexにいる int result = 0; rep(i, G[index].size()) { auto next = G[index][i]; if (check[next] == 0) { check[next] = 1; result += func(next); check[next] = 0; } } int ans = 0; rep(i, N) { ans += check[i]; } if (ans == N) return result + 1; else return result; } int main() { int m; cin >> N >> m; rep(i, m) { int s, t; cin >> s >> t; G[s - 1].push_back(t - 1); G[t - 1].push_back(s - 1); } check[0] = 1; int hoge = func(0); cout << hoge << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - One-stroke Path |
User | ToM_ynu |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1194 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 |