In your dfs function you are unnecessarily iterating over the used edges. You only need to start from scratch whenever you recompute the bfs function(), and not everytime.

In short

1)Make a ptr[] array (size >= number of vertices)

2)change line 75 to for(;ptr[u]<g[u].size();++ptr[u]) //ptr[u] stores your position in g[u]

3)Do a memset(ptr,0,sizeof ptr) after your bfs function returns true

http://e-maxx.ru/algo/dinic

Another way of changing it is just adding something like d[u] = 1000000000ll before return 0 in the dfs.

Here is an accepted solution of your code: http://ideone.com/LBl7V9