OJ Board

Hi.

I got tle in this problem using Dijkstra algorithm and priority queu.


include <cstdlib>
#include <string>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <iostream>
#include <map>
#include <list>
#include <utility>
#include <algorithm>
#include <cmath ...

Hi everybody.

I was trying to attack this problem using a tree but got TLE. Which is how I can optimize this?

#include <cstdlib>
#include <string>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <iostream>
#include <map>
#include <algorithm>
#include <cmath ...