OJ Board

what's the bottleneck of my prog? I'm geting TLE.


Doing a quick profile of your code, it seems that most of the time is spent inside the spfa function (about 86% of the total runtime), but I wouldn't call it a bottleneck, it's more of a problem with the complexity of your algorithm.

If I ...

what's the bottleneck of my prog? I'm geting TLE.

#include <iostream>
#include <map>
#include <vector>
#include <cstdio>
#include <queue>
#include <memory.h>
using namespace std;

#define MAX 10001
typedef struct Edge
{
int i,v;
Edge *next;
Edge(int ii=0,int vv=0,Edge * nnext=NULL):i(ii),v(vv ...