You are viewing a single comment's thread. Return to all comments →
for C++ remove all log fector of searching in map mean's do not use map use 2d array of list of pair, int i got AC using
long long dist[701][701]; list<pair<pair<int,int>,int>> graph[701][701];
use stl set c++ as priority queue.
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #83: Path sum: four ways
You are viewing a single comment's thread. Return to all comments →
for C++ remove all log fector of searching in map mean's do not use map use 2d array of list of pair, int i got AC using
use stl set c++ as priority queue.