Search found 76 matches

by calicratis19
Mon Oct 17, 2011 9:55 pm
Forum: Volume 119 (11900-11999)
Topic: 11951 - Area
Replies: 6
Views: 4322

Re: 11951 - Area

How to solve this problem within time limit ? It is not possible to solve it with 100^4 . Any idea ? Thanks.
by calicratis19
Mon Oct 17, 2011 10:42 am
Forum: Volume 117 (11700-11799)
Topic: 11765 - Component Placement
Replies: 0
Views: 1367

11765 - Component Placement

Can anyone please suggest me how to build the graph for this flow problem? Thanks.
by calicratis19
Tue Oct 11, 2011 9:55 pm
Forum: Volume 105 (10500-10599)
Topic: 10594 - Data Flow
Replies: 40
Views: 25824

Re: 10594 - Data Flow

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.
by calicratis19
Mon May 17, 2010 7:45 pm
Forum: Volume 5 (500-599)
Topic: 544 - Heavy Cargo
Replies: 32
Views: 14509

Re: 544 - heavy cargo

Yeah your approach is correct :)
by calicratis19
Tue Mar 09, 2010 8:08 am
Forum: Volume 109 (10900-10999)
Topic: 10987 - Antifloyd
Replies: 13
Views: 5273

10987 - AntiFloyd

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 ...
by calicratis19
Sun Feb 07, 2010 8:59 am
Forum: Volume 117 (11700-11799)
Topic: 11770 - Lighting Away
Replies: 27
Views: 8535

Re: WA in problem 11770

@ robot My code works for your case.
and your case's output which you have given aliahmed is wrong.
by calicratis19
Sat Feb 06, 2010 10:23 pm
Forum: Volume 117 (11700-11799)
Topic: 11770 - Lighting Away
Replies: 27
Views: 8535

Re: WA in problem 11770

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;...
by calicratis19
Fri Nov 20, 2009 11:47 am
Forum: Bugs and suggestions
Topic: Spam is back!
Replies: 2
Views: 2278

Re: Spam is back!

I totally agree with andmej.
by calicratis19
Fri Nov 20, 2009 11:12 am
Forum: Volume 116 (11600-11699)
Topic: 11693 - Speedy Escape
Replies: 7
Views: 3507

Re: 11693 - Speedy Escape

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...
by calicratis19
Mon Nov 16, 2009 8:58 pm
Forum: Volume 116 (11600-11699)
Topic: 11666 - Logarithms
Replies: 16
Views: 6132

Re: 11666 Logarithms WA again and agian

this message is spam. you should report when you see this.
by calicratis19
Thu Nov 05, 2009 7:56 pm
Forum: Volume 7 (700-799)
Topic: 755 - 487--3279
Replies: 115
Views: 28631

Re: 755 - 487-3279

I tried with manual power function.But it is no use. Still wa. :o :o
by calicratis19
Tue Nov 03, 2009 7:25 pm
Forum: Volume 7 (700-799)
Topic: 755 - 487--3279
Replies: 115
Views: 28631

Re: 755 - 487-3279

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( ...
by calicratis19
Tue Nov 03, 2009 8:46 am
Forum: Volume 103 (10300-10399)
Topic: 10301 - Rings and Glue
Replies: 50
Views: 16280

Re: 10301 - Rings and Glue

zero is considered as a plural number in english language :wink:
by calicratis19
Mon Nov 02, 2009 12:34 pm
Forum: Volume 103 (10300-10399)
Topic: 10356 - Rough Roads
Replies: 29
Views: 15402

Re: 10356 - Rough Roads

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...
by calicratis19
Mon Nov 02, 2009 11:59 am
Forum: Volume 103 (10300-10399)
Topic: 10301 - Rings and Glue
Replies: 50
Views: 16280

Re: 10301 - Rings and Glue

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 ...

Go to advanced search