Submission #3736354
Source Code Expand
#include <cstdio> #include <cstring> #define MAX_N 100 int N,M; bool relation[MAX_N][MAX_N] = {{0}}; bool dfs(int n, bool graph[]) { int count=0,i; graph[n] = true; for (i=0; i<N; i++) { if (!relation[n][i]) continue; if (graph[i]) count++; else if (!dfs(i,graph)) return false; if (count >= 2) return false; } return true; } int main() { scanf("%d %d",&N,&M); int i,j,ui,vi,trees=0; bool graph[MAX_N] = {0}, checked[MAX_N] = {0}; for (i=0; i<M; i++) { scanf("%d %d",&ui,&vi); relation[ui-1][vi-1] = true; relation[vi-1][ui-1] = true; } for (i=0; i<N; i++) { if (checked[i]) continue; if (dfs(i,graph)) trees++; for (j=0; j<N; j++) { if (graph[j]) checked[j] = true; graph[j] = false; } } printf("%d\n",trees); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - バウムテスト |
User | shugo256 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 987 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:26:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d",&N,&M); ^ ./Main.cpp:30:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d %d",&ui,&vi); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
All | subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample_01.txt | AC | 1 ms | 128 KB |
subtask0_sample_02.txt | AC | 1 ms | 128 KB |
subtask0_sample_03.txt | AC | 1 ms | 128 KB |
subtask1_01.txt | AC | 1 ms | 128 KB |
subtask1_02.txt | AC | 1 ms | 128 KB |
subtask1_03.txt | AC | 1 ms | 128 KB |
subtask1_04.txt | AC | 1 ms | 128 KB |
subtask1_05.txt | AC | 1 ms | 128 KB |
subtask1_06.txt | AC | 1 ms | 128 KB |
subtask1_07.txt | AC | 1 ms | 128 KB |
subtask1_08.txt | AC | 1 ms | 128 KB |
subtask1_09.txt | AC | 1 ms | 128 KB |
subtask1_10.txt | AC | 1 ms | 128 KB |
subtask1_11.txt | AC | 1 ms | 128 KB |
subtask1_12.txt | AC | 1 ms | 128 KB |
subtask1_13.txt | AC | 1 ms | 128 KB |
subtask1_14.txt | AC | 1 ms | 128 KB |
subtask1_15.txt | AC | 1 ms | 128 KB |
subtask1_16.txt | AC | 1 ms | 128 KB |
subtask1_17.txt | AC | 1 ms | 128 KB |
subtask1_18.txt | AC | 1 ms | 128 KB |
subtask1_19.txt | AC | 1 ms | 128 KB |
subtask1_20.txt | AC | 1 ms | 128 KB |
subtask1_21.txt | AC | 1 ms | 128 KB |
subtask1_22.txt | AC | 1 ms | 128 KB |
subtask1_23.txt | AC | 1 ms | 128 KB |
subtask1_24.txt | AC | 1 ms | 128 KB |
subtask1_25.txt | AC | 1 ms | 128 KB |
subtask1_26.txt | AC | 1 ms | 128 KB |
subtask1_27.txt | AC | 1 ms | 128 KB |
subtask1_28.txt | AC | 1 ms | 128 KB |
subtask1_29.txt | AC | 1 ms | 128 KB |
subtask1_30.txt | AC | 1 ms | 128 KB |
subtask1_31.txt | AC | 1 ms | 128 KB |