Submission #2530316
Source Code Expand
#include <bits/stdc++.h> #define foreach(i, v) for(__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++ i) using namespace std; typedef long long ll; int edge[200][200]; int vis[200]; int n,m; bool ok; void solve(int p, int u){ vis[u]=1; for(int i=0;i<n;i++){ if(vis[i] && p != i && edge[u][i]){ ok = false; } if(!vis[i] && edge[u][i]){ solve(u, i); } } } int main(int argc, char *argv[]) { ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); cin>>n>>m; for(int i=0;i<m;i++){ int u,v;cin>>u>>v; u--;v--; edge[u][v]=1; edge[v][u]=1; } int ans=0; for(int i=0;i<n;i++){ ok = true; solve(-1, i); if(ok)ans++; } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - バウムテスト |
User | kerotan |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 802 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 384 KB |
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 | 256 KB |
subtask0_sample_02.txt | AC | 1 ms | 256 KB |
subtask0_sample_03.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 1 ms | 256 KB |
subtask1_04.txt | AC | 1 ms | 384 KB |
subtask1_05.txt | AC | 1 ms | 256 KB |
subtask1_06.txt | AC | 1 ms | 256 KB |
subtask1_07.txt | AC | 1 ms | 256 KB |
subtask1_08.txt | AC | 1 ms | 256 KB |
subtask1_09.txt | AC | 1 ms | 256 KB |
subtask1_10.txt | AC | 1 ms | 256 KB |
subtask1_11.txt | AC | 1 ms | 256 KB |
subtask1_12.txt | AC | 1 ms | 256 KB |
subtask1_13.txt | AC | 1 ms | 384 KB |
subtask1_14.txt | AC | 1 ms | 384 KB |
subtask1_15.txt | AC | 1 ms | 384 KB |
subtask1_16.txt | AC | 1 ms | 384 KB |
subtask1_17.txt | AC | 1 ms | 384 KB |
subtask1_18.txt | AC | 1 ms | 384 KB |
subtask1_19.txt | AC | 1 ms | 384 KB |
subtask1_20.txt | AC | 1 ms | 384 KB |
subtask1_21.txt | AC | 1 ms | 384 KB |
subtask1_22.txt | AC | 1 ms | 384 KB |
subtask1_23.txt | AC | 1 ms | 384 KB |
subtask1_24.txt | AC | 1 ms | 384 KB |
subtask1_25.txt | AC | 1 ms | 256 KB |
subtask1_26.txt | AC | 1 ms | 384 KB |
subtask1_27.txt | AC | 1 ms | 384 KB |
subtask1_28.txt | AC | 1 ms | 384 KB |
subtask1_29.txt | AC | 2 ms | 384 KB |
subtask1_30.txt | AC | 2 ms | 384 KB |
subtask1_31.txt | AC | 1 ms | 256 KB |