Submission #3388204
Source Code Expand
#include <cstdio>
#include <algorithm>
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <cmath>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
#define INF int(1e9)
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define REPONE(i, n) for(int i = 1; i <= (int)(n); i++)
#define EACH(i, mp) for(auto i:mp)
#define FOR(i, m, n) for(int i = m;i < n;i++)
using namespace std;
const int MAX_V = 100;
vector<int> G[MAX_V + 1];
bool seen[MAX_V + 1];
int N, M;
bool dfs(int i) {
seen[i] = true;
int temp = 0;
EACH(g, G[i]) {
if (!seen[g] && !dfs(g)) return false;
if (seen[g]) temp++;
}
return temp == 0 || temp == 1;
}
void solve() {
int ans = 0;
FOR(i, 1, N + 1) {
if (!seen[i]) {
if (dfs(i)) ans++;
}
}
cout << ans << endl;
}
int main() {
scanf("%d %d", &N, &M);
REP (i, M) {
int s, t;
scanf("%d %d", &s, &t);
G[s].push_back(t);
G[t].push_back(s);
}
solve();
return 0;
}
Submission Info
Submission Time |
|
Task |
B - バウムテスト |
User |
hiramekun |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
1176 Byte |
Status |
WA |
Exec Time |
2 ms |
Memory |
256 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:47:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &N, &M);
^
./Main.cpp:50:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &s, &t);
^
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 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 |
WA |
1 ms |
256 KB |
subtask0_sample_02.txt |
AC |
1 ms |
256 KB |
subtask0_sample_03.txt |
AC |
1 ms |
256 KB |
subtask1_01.txt |
WA |
1 ms |
256 KB |
subtask1_02.txt |
WA |
1 ms |
256 KB |
subtask1_03.txt |
WA |
1 ms |
256 KB |
subtask1_04.txt |
AC |
1 ms |
256 KB |
subtask1_05.txt |
AC |
1 ms |
256 KB |
subtask1_06.txt |
AC |
1 ms |
256 KB |
subtask1_07.txt |
WA |
1 ms |
256 KB |
subtask1_08.txt |
WA |
1 ms |
256 KB |
subtask1_09.txt |
WA |
1 ms |
256 KB |
subtask1_10.txt |
WA |
1 ms |
256 KB |
subtask1_11.txt |
WA |
1 ms |
256 KB |
subtask1_12.txt |
WA |
1 ms |
256 KB |
subtask1_13.txt |
AC |
1 ms |
256 KB |
subtask1_14.txt |
WA |
1 ms |
256 KB |
subtask1_15.txt |
WA |
1 ms |
256 KB |
subtask1_16.txt |
AC |
1 ms |
256 KB |
subtask1_17.txt |
WA |
1 ms |
256 KB |
subtask1_18.txt |
WA |
1 ms |
256 KB |
subtask1_19.txt |
WA |
1 ms |
256 KB |
subtask1_20.txt |
WA |
1 ms |
256 KB |
subtask1_21.txt |
WA |
1 ms |
256 KB |
subtask1_22.txt |
AC |
1 ms |
256 KB |
subtask1_23.txt |
WA |
1 ms |
256 KB |
subtask1_24.txt |
WA |
1 ms |
256 KB |
subtask1_25.txt |
AC |
1 ms |
256 KB |
subtask1_26.txt |
WA |
1 ms |
256 KB |
subtask1_27.txt |
WA |
1 ms |
256 KB |
subtask1_28.txt |
WA |
1 ms |
256 KB |
subtask1_29.txt |
AC |
2 ms |
256 KB |
subtask1_30.txt |
AC |
2 ms |
256 KB |
subtask1_31.txt |
AC |
1 ms |
256 KB |