Publications du 12 juin 2023

int minimumWeight(int n, vector<vector<int>>& edges, int C1, int C2) { vector<long long> A(n,LLONG_MAX), B(n,LLONG_MAX); Dijkstra(C1,graph,A); Dijkstra(C2,graph,B); int node=0 , dist=LLONG_MAX; for(int i=0;i<=n-1;i++){ if(A[i]==LLONG_MAX || B[i]==LLONG_MAX) continue; if(dist>A[i]+B[i]){ dist= A[i]+B[i]; node=i; } } return node; }

Nearest meeting cell

int solve(vector<int>& maze,int n) { int maxSum=-1; for(int i=0; i<n; i++) { int node=i; int sum=0; unordered_set<int> visited; while(node < n && node >= 0 && i!=maze[node] && visited.count(node)==0) { visited.insert(node); sum+=node; node=maze[node]; } if(node>=0 && node < n && i == maze[node]) { maxSum=max(maxSum,sum); } } return maxSum; }

largest sum cycle

int solution(vector<int>arr){ int ans=INT_MIN; int result=-1; vector<int>weight(arr.size(),0); for(int i=0;i<arr.size();i++){ int source=i; int dest=arr[i]; if(dest!=-1){ weight[dest]+=source; if(ans<=weight[dest]){ ans=max(ans,weight[dest]); result=dest; } } } if(ans!=INT_MIN) return result; return -1; }

Maximum weight node

import collections v=int(input()) l=list(map(int,input().split())) d=collections.defaultdict(int) for k,v in enumerate(l): if v!=-1: d[v]+=k req=max(d.values()) for k,v in d.items(): if v==req: print(k) break

Maximum weight Node, #python #Juspay

#include<bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; unordered_map<int,int> mp; vector<int> nums(n); for(int i=0; i<n; i++){ cin>>nums[i]; if(nums[i]!=-1) mp[nums[i]]+=i; } int maxi = INT_MIN; int res = 0; for(auto i: mp){ if(maxi<i.second){ maxi=i.second; res = i.first; } } cout<<res; }

Maximum weight Node #c++ #juspay