Submission #8842701
Source Code Expand
#include<bits/stdc++.h> using namespace std; int main(){ int n; int m; cin >> n; cin >> m; vector<int> a(m); vector<int> b(m); for(int i = 0;i<m;i++){ cin >> a.at(i) >> b.at(i); } int result = 0; queue<int> que; vector<int> grouping(n); for(int k=0;k<m;k++){ int groupcnt = 0; que.empty(); for(int i=0;i<n;i++){ grouping.at(i) = -1; } for(int i = 0;i<n;i++){ if(grouping.at(i) == -1){ que.push(i); grouping.at(i) = groupcnt; while(!que.empty()){ //1 int target = que.front(); que.pop(); for(int j=0;j<m;j++){ //2 if(a.at(j)-1 == target && j != k){ //3 if(grouping.at(b.at(j)-1) == -1){ //4 que.push(b.at(j)-1); grouping.at(b.at(j)-1) = groupcnt; } //4 }else if(b.at(j)-1 == target && j != k){ //3 if(grouping.at(a.at(j)-1) == -1){ //4 que.push(a.at(j)-1); grouping.at(a.at(j)-1) = groupcnt; } // 4 } //3 } //2 } //1 groupcnt++; //cout << "###" << endl; } } if(groupcnt != 1){ result++; } } cout << result << endl; }
Submission Info
Submission Time | |
---|---|
Task | C - Bridge |
User | taropro |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1377 Byte |
Status | AC |
Exec Time | 2 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, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_1.txt | AC | 2 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 | 2 ms | 256 KB |
subtask_1_14.txt | AC | 2 ms | 256 KB |
subtask_1_15.txt | AC | 2 ms | 256 KB |
subtask_1_16.txt | AC | 2 ms | 256 KB |
subtask_1_17.txt | AC | 2 ms | 256 KB |
subtask_1_2.txt | AC | 2 ms | 256 KB |
subtask_1_3.txt | AC | 1 ms | 256 KB |
subtask_1_4.txt | AC | 1 ms | 256 KB |
subtask_1_5.txt | AC | 1 ms | 256 KB |
subtask_1_6.txt | AC | 1 ms | 256 KB |
subtask_1_7.txt | AC | 1 ms | 256 KB |
subtask_1_8.txt | AC | 1 ms | 256 KB |
subtask_1_9.txt | AC | 1 ms | 256 KB |