Submission #1793601


Source Code Expand

#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
#define INF 100000000
typedef pair<int, int> P;

int N, M;
int graph[50][50];

int main(){
    cin >> N >> M;
    for(int i=0; i<N; i++){
        for(int j=0; j<N; j++){
            graph[i][j] = INF;
        }
    }

    P edge[M];

    for(int i=0; i<M; i++){
        int a, b;
        cin >> a >> b;
        a--; b--;
        graph[a][b] = graph[b][a] = 1;
        edge[i] = P(a, b);
    }

    int res = 0;
    for(int i=0; i<M; i++){
        int dist[N][N];
        for(int j=0; j<N; j++){
            for(int k=0; k<N; k++){
                dist[j][k] = graph[j][k];
            }
        }
        int a=edge[i].first, b=edge[i].second;
        dist[a][b] = dist[b][a] = INF;
        for(int z=0; z<N; z++){
            for(int x=0; x<N; x++){
                for(int y=0; y<N; y++){
                    dist[x][y] = min(dist[x][y], dist[x][z]+dist[z][y]);
                }
            }
        }
        if(dist[a][b] == INF){
            res++;
        }
    }

    cout << res << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Bridge
User yna87
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1165 Byte
Status AC
Exec Time 9 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 20
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 9 ms 256 KB
subtask_1_10.txt AC 1 ms 256 KB
subtask_1_11.txt AC 3 ms 256 KB
subtask_1_12.txt AC 2 ms 256 KB
subtask_1_13.txt AC 9 ms 256 KB
subtask_1_14.txt AC 9 ms 256 KB
subtask_1_15.txt AC 9 ms 256 KB
subtask_1_16.txt AC 9 ms 256 KB
subtask_1_17.txt AC 9 ms 256 KB
subtask_1_2.txt AC 9 ms 256 KB
subtask_1_3.txt AC 2 ms 256 KB
subtask_1_4.txt AC 3 ms 256 KB
subtask_1_5.txt AC 3 ms 256 KB
subtask_1_6.txt AC 3 ms 256 KB
subtask_1_7.txt AC 7 ms 256 KB
subtask_1_8.txt AC 2 ms 256 KB
subtask_1_9.txt AC 1 ms 256 KB