Submission #2695825


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }
// ll comb(ll n, ll k) { ll v=1; for(ll i=1; i<=k; i++) v = DIV(MUL(v, n-i+1),i); return v; }
//

int d[50][50];

int solve(int N, int M, vi& a, vi& b){
    int cnt = 0;
    rep(br,M){
        rep(i,N) rep(j,N) d[i][j] = 1000;
        rep(i,N) d[i][i] = 0;
        rep(j,M) {
            if (j == br) continue;
            d[a[j]-1][b[j]-1] = d[b[j]-1][a[j]-1] = 1;
        }
        rep(k,N) rep(i,N) rep(j,N) d[i][j] = min(d[i][j], d[i][k]+d[k][j]);

        bool good = true;
        for (int i=1; i<N; ++i) {
            if (d[0][i] > 50) { good = false; break; }
        }
        if (!good) ++cnt;
    }
    return cnt;
}
int main() {
    int n,m; cin >> n >> m;
    vi a(m), b(m);
    rep(i,m) cin >> a[i] >> b[i];
    cout << solve(n,m,a,b) << endl;
    // cout << (solve(N,a) ? "Yes":"No") << endl;
    return 0;
}

Submission Info

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

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample_01.txt, sample_02.txt, sample_03.txt
All 300 / 300 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 1 ms 256 KB
sample_02.txt 1 ms 256 KB
sample_03.txt 1 ms 256 KB
subtask_1_1.txt 9 ms 256 KB
subtask_1_10.txt 1 ms 256 KB
subtask_1_11.txt 3 ms 256 KB
subtask_1_12.txt 2 ms 256 KB
subtask_1_13.txt 9 ms 256 KB
subtask_1_14.txt 9 ms 256 KB
subtask_1_15.txt 9 ms 256 KB
subtask_1_16.txt 9 ms 256 KB
subtask_1_17.txt 9 ms 256 KB
subtask_1_2.txt 9 ms 256 KB
subtask_1_3.txt 2 ms 256 KB
subtask_1_4.txt 3 ms 256 KB
subtask_1_5.txt 3 ms 256 KB
subtask_1_6.txt 3 ms 256 KB
subtask_1_7.txt 7 ms 256 KB
subtask_1_8.txt 2 ms 256 KB
subtask_1_9.txt 1 ms 256 KB