LeetCode Weekly Contest 173 3問目 - Find the City With the Smallest Number of Neighbors at a Threshold Distance [1334]

Source

LeetCode Weekly Contest 173
問題文

問題概要

省略

解法

省略

cLay（version 20200119-1）のコード

C++に変換後のコードはこちら

#define main dummy_main
{}
#undef main

int dist[100][100];

class Solution {
public:
  int findTheCity(int n, vector<vector<int>>& edges, int distanceThreshold) {
    int i, j, k, cnt, res = -1, mn = int_inf;
    rep(i,n) rep(j,n) dist[i][j] = int_inf;
    rep(i,n) dist[i][i] = 0;
    rep(i,edges.size()){
      j = edges[i][0];
      k = edges[i][1];
      dist[j][k] = dist[k][j] <?= edges[i][2];
    }
    rep(k,n) rep(i,n) rep(j,i+1,n) dist[i][j] = dist[j][i] <?= dist[i][k] + dist[k][j];
    rep(i,n){
      cnt = 0;
      rep(j,n) if(dist[i][j] <= distanceThreshold) cnt++;
      if(cnt <= mn) mn = cnt, res = i;
    }
    return res;
  }
};

Current time: 2024年04月23日19時44分10秒
Last modified: 2020年02月02日00時56分23秒 (by laycrs)
Tags: Competitive_Programming_Incomplete LeetCode
トップページに戻る

Logged in as: unknown user (not login)