Submission #1780663
Source Code Expand
#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priotity_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ld PI=abs(acos(-1));
int n,m,a[55],b[55],li[55][55];
int main(){
cin >> n >> m;
REP(i,0,m) cin >> a[i] >> b[i], li[a[i]][b[i]]=true, li[b[i]][a[i]]=true;
int c=0;
REP(i,0,m){
li[a[i]][b[i]]=false;
li[b[i]][a[i]]=false;
queue<int> qu;
set<int> st;
qu.push(a[i]);
while(!qu.empty()){
auto p=qu.front(); qu.pop();
REP(j,1,n+1){
if(st.count(j)) continue;
if(li[p][j]) st.insert(j), qu.push(j);
}
}
if(st.size()!=n) c++;
li[a[i]][b[i]]=true;
li[b[i]][a[i]]=true;
}
cout << c << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Bridge |
User |
ecasdqina |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
942 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 |
2 ms |
256 KB |
subtask_1_12.txt |
AC |
2 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 |
2 ms |
256 KB |
subtask_1_5.txt |
AC |
2 ms |
256 KB |
subtask_1_6.txt |
AC |
2 ms |
256 KB |
subtask_1_7.txt |
AC |
2 ms |
256 KB |
subtask_1_8.txt |
AC |
2 ms |
256 KB |
subtask_1_9.txt |
AC |
1 ms |
256 KB |