Submission #1186347


Source Code Expand

import java.io.*;
import java.util.*;

public class Main {
    public static PrintWriter out;
    public static FastScanner in;

    private void solve(){
        int n = in.nextInt();
        int m = in.nextInt();

        int[] a = new int[1001];
        int[] b = new int[1001];
        int[] c = new int[1001];

        int[][] dist = new int[101][101];
        for(int i=0;i<=100;i++){
            for(int j=0;j<=100;j++){
                if(i==j) dist[i][j] = 0;
                else dist[i][j] = (int)1e7;
            }
        }

        for(int i=0;i<m;i++){
            a[i] = in.nextInt()-1;
            b[i] = in.nextInt()-1;
            c[i] = in.nextInt();
            dist[a[i]][b[i]] = c[i];
            dist[b[i]][a[i]] = c[i];
        }

        for(int k=0;k<n;k++){
            for(int i=0;i<n;i++){
                for(int j=0;j<n;j++){
                    if(dist[i][k] + dist[k][j] < dist[i][j]){
                        dist[i][j] = dist[i][k] + dist[k][j];
                    }
                }
            }
        }

        int ans = m;
        for(int j=0;j<m;j++){
            boolean check = false;
            for(int i=0;i<n;i++){
                if(dist[i][a[j]]+c[j] == dist[i][b[j]] || dist[i][b[j]]+c[j] == dist[i][a[j]]) check = true;
            }
            if(check) ans--;
        }
        out.print(ans);

    }

    private void runIO() {
        in = new FastScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out));
        solve();
        out.close();
    }
    private static class FastScanner {
        BufferedReader bufferedReader;
        StringTokenizer stringTokenizer;

        private FastScanner() {
            bufferedReader = new BufferedReader(new InputStreamReader(System.in));
        }

        private String next() {
            if (stringTokenizer == null || !stringTokenizer.hasMoreElements()) {
                try {
                    stringTokenizer = new StringTokenizer(bufferedReader.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return stringTokenizer.nextToken();
        }

        private int nextInt() {
            return Integer.parseInt(next());
        }

        private long nextLong() {
            return Long.parseLong(next());
        }

        private String nextLine() {
            String ret = "";
            try {
                ret = bufferedReader.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return ret;
        }
    }

    public static void main(String[] args) {
        new Main().runIO();
    }
}

Submission Info

Submission Time
Task D - Candidates of No Shortest Paths
User kush_vi
Language Java8 (OpenJDK 1.8.0)
Score 400
Code Size 2794 Byte
Status AC
Exec Time 114 ms
Memory 22740 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 30
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All 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 AC 73 ms 19156 KB
sample_02.txt AC 70 ms 18260 KB
subtask_1_01.txt AC 71 ms 17876 KB
subtask_1_02.txt AC 86 ms 19668 KB
subtask_1_03.txt AC 96 ms 21076 KB
subtask_1_04.txt AC 98 ms 20180 KB
subtask_1_05.txt AC 106 ms 22100 KB
subtask_1_06.txt AC 83 ms 21332 KB
subtask_1_07.txt AC 80 ms 19156 KB
subtask_1_08.txt AC 96 ms 19540 KB
subtask_1_09.txt AC 97 ms 18896 KB
subtask_1_10.txt AC 97 ms 22740 KB
subtask_1_11.txt AC 72 ms 18772 KB
subtask_1_12.txt AC 90 ms 21460 KB
subtask_1_13.txt AC 104 ms 20012 KB
subtask_1_14.txt AC 101 ms 22100 KB
subtask_1_15.txt AC 96 ms 18004 KB
subtask_1_16.txt AC 82 ms 21460 KB
subtask_1_17.txt AC 91 ms 17492 KB
subtask_1_18.txt AC 85 ms 19540 KB
subtask_1_19.txt AC 105 ms 21076 KB
subtask_1_20.txt AC 77 ms 21204 KB
subtask_1_21.txt AC 74 ms 21332 KB
subtask_1_22.txt AC 80 ms 21716 KB
subtask_1_23.txt AC 85 ms 19924 KB
subtask_1_24.txt AC 108 ms 19284 KB
subtask_1_25.txt AC 114 ms 21204 KB
subtask_1_26.txt AC 88 ms 19924 KB
subtask_1_27.txt AC 110 ms 18772 KB
subtask_1_28.txt AC 108 ms 22516 KB