Submission #1131374

#	Time	Username	Problem	Language	Result	Execution time	Memory
1131374		Champ_Naman	Swapping Cities (APIO20_swap)	C++20	0 / 100	2095 ms	15016 KiB

swap

#include<bits/stdc++.h>
using namespace std;
#define nl '\n'
#include "swap.h"

const int N = 1e5;
vector<pair<int,int>> g[N];

int n, m;
int ans, cnt;

void dfs(int v, int f, int d, vector<int>& vis){
   vis[v] = 1;
   for(auto [ch, w] : g[v]){
      if(ch == f) ans = max(ans, max(d, w)), cnt++;
      if(!vis[ch] and ch != f){
         dfs(ch, f, max(d, w), vis);
      }
   }
}

void init(int N, int M, vector<int> u, vector<int> v, vector<int> w){
   n = N;
   m = M;
   for(int i=0; i<m; i++){
      g[u[i]].push_back({v[i], w[i]});
      g[v[i]].push_back({u[i], w[i]});
   }
   return;
}

int getMinimumFuelCapacity(int x, int y){
   vector<int> vis(n, 0);
   ans = cnt = 0;
   dfs(x, y, 0, vis);

   return (cnt < 2 ? -1 : ans);
}

• Subtask 1: 0 / 6
• Subtask 2: 0 / 7
• Subtask 3: 0 / 17
• Subtask 4: 0 / 20
• Subtask 5: 0 / 23
• Subtask 6: 0 / 27