Search found 11 matches

by bourne
Wed Dec 31, 2008 7:05 pm
Forum: Volume 114 (11400-11499)
Topic: 11436 - Cubes - EXTREME!!!
Replies: 21
Views: 8261

Re: 11436 - Cubes - EXTREME!!!

I have tested a lot of test cases still I am getting WA. Can't find the bug. Here's the code: #include<iostream> #include<vector> #include<string> #include<queue> #include<sstream> #include<map> #include<stack> #include<set> #include<cmath> #include<iomanip> using namespace std; #define PB push_back...
by bourne
Tue Dec 30, 2008 7:53 pm
Forum: Volume 115 (11500-11599)
Topic: 11563 - Introspective Caching
Replies: 7
Views: 1302

Re: 11563 - Introspective Caching

I am getting WA too. Can someone who got AC post some test cases?
by bourne
Fri Dec 26, 2008 2:37 pm
Forum: Volume 115 (11500-11599)
Topic: 11545 - Avoiding Jungle in the Dark
Replies: 13
Views: 4353

Re: 11545 - Avoiding Jungle in the Dark

I get correct answer for every test case on this forum still OJ gives me WA. I am not able to find the bug. #include<iostream> #include<vector> #include<string> #include<queue> #include<sstream> #include<map> #include<stack> #include<set> #include<cmath> #include<iomanip> using namespace std; #defin...
by bourne
Wed Sep 24, 2008 1:15 am
Forum: Volume 7 (700-799)
Topic: 747 - Grid Soccer
Replies: 1
Views: 2237

747 - Grid Soccer

I am getting WA in this problem. It seems to be a combination of DP and DFS. Can anyone give me some critical test cases for this problem?
by bourne
Mon Sep 22, 2008 2:41 am
Forum: Volume 7 (700-799)
Topic: 714 - Copying Books
Replies: 29
Views: 18887

Re: 714 - Copying Books

I am getting correct result for all the test cases posted in this thread. Still I am getting WA at the judge. I used the binary search + greedy approach as discussed in this thread. Can someone figure out my mistake or post some more tricky cases? #include<iostream> #include<vector> #include<string>...
by bourne
Tue Sep 16, 2008 2:34 am
Forum: Volume 6 (600-699)
Topic: 607 - Scheduling Lectures
Replies: 3
Views: 3670

Re: 607 - Scheduling Lectures

I am getting TLE in this problem. I use DP for finding the minimum number of lectures and then use the DP table to backtrack for minimum DI. How do I optimize?
by bourne
Mon Sep 15, 2008 11:37 pm
Forum: Volume 5 (500-599)
Topic: 590 - Always on the run
Replies: 12
Views: 6390

Re: 590 can you give me a tiny hint

I solved this problem using recursion with memoization. But I am getting WA. Here is my recursive function, int n,k; vector<int> D[11][11]; //D[city1][city2][day] long long dp[11][31]; //dp[city][day] long long solve(int city,int day) { if(day==k){ if(city==n) return 0; return INF; } long long& res=...
by bourne
Wed Jun 11, 2008 4:34 pm
Forum: Volume 101 (10100-10199)
Topic: 10136 - Chocolate Chip Cookies
Replies: 6
Views: 4077

Re: 10136 - Chocolate Chip Cookies

@Darko

Can you explain your O(n^3) idea. A brute force approach I can think of is to draw all possible circles using triplets of points and count the maximum no of points residing on the circle. But that would be O(n^4). How to do it in O(n^3)?
by bourne
Sun Jun 08, 2008 8:56 pm
Forum: Volume 1 (100-199)
Topic: 193 - Graph Coloring
Replies: 93
Views: 19432

Re: How can i solve the problem 193

Then why are the input constraints of the problem so deceptive. I wasted most of my time on this problem just because of the constraints given since no practical solution can pass if the constraints are followed strictly.
by bourne
Sun Jun 08, 2008 8:21 pm
Forum: Volume 1 (100-199)
Topic: 193 - Graph Coloring
Replies: 93
Views: 19432

Re: How can i solve the problem 193

I think the judge input data is very very weak. I had not submitted the problem before my last post because I analyzed the problem and found that backtracking solution will time out. Now when you guys said that backtracking is getting AC, I thought of giving it a try and got AC in 0.01sec. Now I rem...
by bourne
Thu Jun 05, 2008 12:43 pm
Forum: Volume 1 (100-199)
Topic: 193 - Graph Coloring
Replies: 93
Views: 19432

Re:

If you are getting TLE then, Backtracking with prunning should be enough to pass the time limit. :) .. My AC took 0.187 seconds. 8) there are 2^100 possibilities....... which seems to be significantly high but prunning at different stages should reduce the time quite extensively. Analysis : Suppose...

Go to advanced search