Submission #1104863


Source Code Expand

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdlib>
using namespace std;
const int MaxN = 100 + 5;
int n, m;
int pre[2 * MaxN], last[MaxN], other[2 * MaxN];
int all = -1;
bool vis[MaxN];
int ans;
void Build(int u, int v){
	pre[++all] = last[u];
	last[u] = all;
	other[all] = v;
}
void Dfs(int x, int cont){
	if(vis[x]) return;
	vis[x] = true;
	cont++;
	int ed, dr;
	ed = last[x];
	while(ed != -1){
		dr = other[ed];
		Dfs(dr, cont);
		ed = pre[ed];
	}
	if(cont == n) ans++;
	cont--;
	vis[x] = false;
}
	
int main(){
	while(~scanf("%d %d", &n, &m)){
		memset(pre, 0, sizeof(pre));
		memset(last, - 1, sizeof(last));
		memset(other, 0, sizeof(other));
		all = -1;
		ans = 0;
		int u, v;
		for(int i = 1; i <= m; i++){
			scanf("%d %d", &u, &v);
			Build(u, v);
			Build(v, u);
		}
		Dfs(1, 0);
		printf("%d\n", ans);
	}
	return 0;
}

Submission Info

Submission Time
Task C - One-stroke Path
User ZZZZone
Language C++14 (GCC 5.4.1)
Score 300
Code Size 919 Byte
Status AC
Exec Time 1 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:43:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d %d", &u, &v);
                          ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 15
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 128 KB
sample_02.txt AC 0 ms 128 KB
subtask_1_01.txt AC 1 ms 128 KB
subtask_1_02.txt AC 1 ms 128 KB
subtask_1_03.txt AC 1 ms 128 KB
subtask_1_04.txt AC 1 ms 128 KB
subtask_1_05.txt AC 0 ms 128 KB
subtask_1_06.txt AC 0 ms 128 KB
subtask_1_07.txt AC 1 ms 128 KB
subtask_1_08.txt AC 1 ms 128 KB
subtask_1_09.txt AC 1 ms 128 KB
subtask_1_10.txt AC 1 ms 128 KB
subtask_1_11.txt AC 1 ms 128 KB
subtask_1_12.txt AC 1 ms 128 KB
subtask_1_13.txt AC 1 ms 128 KB