UVa OJ Board

How to solve this problem within time limit ? It is not possible to solve it with 100^4 . Any idea ? Thanks.

Can anyone please suggest me how to build the graph for this flow problem? Thanks.

No need to use jonson's algorithm. The graph may contain negative edges due to its modification for flow. But it wont have any negative cycle. So straight forward dijkstra will do.

Yeah your approach is correct

I tried it with floyd and mst together. But got wa. my approach: 1) First run a floyd with the given floyd matrix and see if there is a better path.If there is a shorter path then its impossilbe. else i run a kruskel with the given floyd matrix . And then i print the edges. I am not sure if its the ...

@ robot My code works for your case.
and your case's output which you have given aliahmed is wrong.

I am getting wa in this.I am not sure if my process is ok. I used BFS.I color every node with bfs except the nodes which were the starting node of the bfs'.And then last i checked how many uncolored node is there. is it ok?? #include<stdio.h> #include<vector> #include<algorithm> using namespace std;...

I totally agree with andmej.

Got wa again :o :o This time i did as msh mentioned . Here is my code. #include<stdio.h> #include<stdlib.h> #include<math.h> #define lim 105 #define INF 9999999 int node,edge,high,i,j,bro,pol,k,test,u,v,len,mx,cur,now; int mat[lim][lim],fn[lim],distance[lim],dis[lim],adj[lim][lim],distn[lim]; double...

this message is spam. you should report when you see this.

I tried with manual power function.But it is no use. Still wa.

can anyone tell me why wa.checked all the input above. #include<stdio.h> #include<stdlib.h> #include<string.h> #include<ctype.h> #include<math.h> int i,j,f,y,num,shudho,k,test,mn; int cnt[10000010],intgr[1000010],store[100020]; char ans[100010][20],str[1000]; bool flag[10000010]; int sort_function( ...

zero is considered as a plural number in english language

i couldn't help writing something about this problem. everyone here seems to have used dijkstra for this problem. but i used floyd warshell :D :D . and guess what , my time limit was 3.564 sec :lol: . i think i have the worst limit :P :P .this my worst time limit in any problem :lol: but with warshe...

change if(mx<2) cout<<"The largest component contains "<<mx<<" ring."<<endl; else cout<<"The largest component contains "<<mx<<" rings."<<endl; to this if(mx==1) cout<<"The largest component contains "<<mx<<" ring."<<endl; else cout<<"The largest component contains "<<mx<<" rings."<<endl; this hint ...