OJ Board

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

I am getting WA too. Can someone who got AC post some test cases?

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

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?

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

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?

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

@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)?

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.

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

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