I am getting TLE, can someone go through it once, thanks in advance I am getting TLE, can someone go through my code once, thanks in advance
//Link: https://uva.onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=2768#include<bits/stdc++.h>using namespace std;class Graph{public: map<int, list<pair<int, int> > > G;map<int, list<pair<int, int> > > Grev;int V;Graph(int v){V = v;}void addEdge(int u, int v, int weight){G[u].push_back(make_pair(v,weight));
Read more… (27 words)