OJ Board

I don't understand why I get TLE my algo should run with O(V+E) time complexity. I have test the the test case given here and got it right. First I run topological sort with DFS then DP bottom up

Here is my code

#include <iostream>
#include <cstdio>
#include <stdlib.h>
#include <vector>
#include ...

Got Accepted now. I changed all the C++ I/O for C I/O, change all the cin for scanf, and cout for printf, and quit all the classes of the standard library, such as map, vector, etc.. and use simple arrays. Hope it helps. I really don't know why this happens, but it worked.

I replace every vector ...

Hello ,

I got TLE, I have used 10 queues and getchar() but still got TLE. Is there something wrong with my code?


#include <iostream>
#include <cstdio>
#include <stdlib.h>
#include <vector>
#include <queue>
#include <utility>
#include <algorithm>
#include <math.h>

using namespace std;

typedef ...