You can take the Lisenced order for 1~n,and make the Pirate for n+1~n+n; then it can be obviously refered that : Regard the Lisened path that only u to v,then Pirate is that u+n to v+n and u to v+n,then Cracked is that u to v and u+n to v+n. then take spfa(1) check the d[n] and d[n<<1] if they are inf or available sorry for that my English is poor to some extent
