Submission #2701852


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))

#define INFTY 9999

int solve(int N,int M,vi& a,vi& b,vi& c) {
    vvi d(N, vi(N, INFTY));
    rep(i,N) d[i][i] = 0;
    rep(i,M){
        int x=a[i], y=b[i];
        d[x][y] = d[y][x] = c[i];
    }
    rep(k,N) rep(i,N) rep(j,N) d[i][j] = min(d[i][j], d[i][k]+d[k][j]);
    int ans = 0;
    rep(i,M){
        int x=a[i], y=b[i];
        if (c[i] > d[x][y]) ++ans;
    }
    return ans;
}

int main() {
    int N,M; cin >> N >> M;
    vi a(M),b(M),c(M);
    rep(i,M){
        cin >> a[i] >> b[i] >> c[i];
        --a[i]; --b[i];
    }
    cout << solve(N,M,a,b,c) << endl;
    return 0;
}

Submission Info

Submission Time
Task D - Candidates of No Shortest Paths
User naoya_t
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1810 Byte
Status
Exec Time 3 ms
Memory 256 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample_01.txt, sample_02.txt
All 400 / 400 sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.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_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt
Case Name Status Exec Time Memory
sample_01.txt 1 ms 256 KB
sample_02.txt 1 ms 256 KB
subtask_1_01.txt 1 ms 256 KB
subtask_1_02.txt 1 ms 256 KB
subtask_1_03.txt 2 ms 256 KB
subtask_1_04.txt 2 ms 256 KB
subtask_1_05.txt 3 ms 256 KB
subtask_1_06.txt 1 ms 256 KB
subtask_1_07.txt 1 ms 256 KB
subtask_1_08.txt 2 ms 256 KB
subtask_1_09.txt 2 ms 256 KB
subtask_1_10.txt 2 ms 256 KB
subtask_1_11.txt 1 ms 256 KB
subtask_1_12.txt 2 ms 256 KB
subtask_1_13.txt 2 ms 256 KB
subtask_1_14.txt 2 ms 256 KB
subtask_1_15.txt 2 ms 256 KB
subtask_1_16.txt 1 ms 256 KB
subtask_1_17.txt 1 ms 256 KB
subtask_1_18.txt 2 ms 256 KB
subtask_1_19.txt 2 ms 256 KB
subtask_1_20.txt 1 ms 256 KB
subtask_1_21.txt 1 ms 256 KB
subtask_1_22.txt 2 ms 256 KB
subtask_1_23.txt 2 ms 256 KB
subtask_1_24.txt 3 ms 256 KB
subtask_1_25.txt 2 ms 256 KB
subtask_1_26.txt 2 ms 256 KB
subtask_1_27.txt 3 ms 256 KB
subtask_1_28.txt 3 ms 256 KB