OJ Board

Getting WA. May I get some test cases.

#include <bits/stdc++.h>

using namespace std;

const int MAX = 30;

struct Return {
int time, serial;
Return() {}
Return(int time, int serial) {
this->time = time;
this->serial = serial;
}
};

int symbols[MAX], revSymbols[MAX];

int timeNeeded[MAX][MAX ...

Getting WA. May I get some test cases?
Edit: solved

Thanks for the hint. I'll try it again.
However, I was wondering why my code gets TLE while this one gets AC. Seems similar to mine. Just wanted to understand how the complexity was improved.

*code removed*

Getting TLE. Any help on how to make it efficient will be highly appreciated.


#include <bits/stdc++.h>

using namespace std;
int t, h, f;
//vector<int> acorn[2010];
int acorn[2010][2010];
int dp[2010][2010];
bool vis[2010][2010];
int func(int, int);

int main() {
int c;
scanf("%d", &c);
while ...

Getting WA :(
Please provide some test cases.


#include <bits/stdc++.h>

using namespace std;

int main() {
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
int t;
scanf("%d", &t);
getchar();
while(t--) {
int l, m;
scanf("%d %d", &l, &m);
getchar();
if(m == 0 ...

Getting WA. Please help!


#include <bits/stdc++.h>
#define MAX 55

using namespace std;


void trans(int, int);
int m, n, mat[MAX][MAX], mat2[MAX][MAX];
struct square{int x, y, dir; square() {} square(int a, int b) {x = a; y = b;} square(int a, int b, int c) {x = a; y = b; dir = c;}};
map<string ...

Ok I got rid of those loops, and used another array which keeps track of how many time dfs has been called from a node. If dfs has been called more than 1 time from a source node, then the node is an articulation point. Found some other errors that were causing TLE and fixed them. Now getting WA ...

Trying to determine if the source node is an articulation point or not. If the finishing time of the first adjacent node of the source node is less than the discovery time of any of the the next adjacent nodes, it is an articulation point.
Don't know how I can achieve this faster in this way, have ...

I'm using DFS to find articulation points, but getting TLE. Please help!

#include <bits/stdc++.h>
#define MAX 101

using namespace std;
map<string, int> mymap;
vector<int> adj[MAX];
vector<int> apoints;
int col[MAX], par[MAX], low[MAX], dis[MAX], fin[MAX], tim, n;
void dfs();
void dfs_visit(int ...