OJ Board

hello,

I m getting TLE for GATTACA problem...
below is my code...anyone pls help me !!


int main ()
{
int t = GI;
while ( t -- )
{
char c[1002] = {'\0'};
scanf ( "%s" , c );
string s = c;
mSI mp;

FORZ (i , s.sz)
{
FORZ (j , s.sz - i)
{
string x = s.substr(i , j + 1);
mp [x ...

Hi,
I m getting WA ...I tried BigInt in JAVA...
I cant find wats wrong in my code...
anyone pls help me...


import java.io.*;
import java.math.*;
import java.util.*;

class Main
{

public static boolean leap_year ( BigInteger b )
{
int a = 0;boolean leap = false;
BigInteger [] d1 = new ...

Hi,
I tried to use binary tree and count the number of swaps needed but getting TLE......
below is my code...anyone pls help me !!
thanks in advance !!



#include <iostream>
using namespace std;

struct node
{
int val;
struct node *left;
struct node *right;
};

long long cnt;
struct node *root ...

Hi,
I tried to use binary tree and count the number of swaps needed but getting TLE......
below is my code...anyone pls help me !!
thanks in advance !!


#include <iostream>
using namespace std;

struct node
{
int val;
struct node *left;
struct node *right;
};

long long cnt;
struct node *root ...

hi everyone,

I tried to solve this problem using tries (implementing a structure)...but keep getting TLE...
I think the problem is when getting inputs...
Below is my code ...anyone pls help me !!!
thanks in advance..!!


#include <iostream>
using namespace std;

struct node
{
string word;
int ...

can anyone provide me some test cases ?...i m getting WA
pls help me!!
thanks in advance..

hi everybody,

is the test case provided by "helloneo" 1 0 2 0 a valid one ??
in the problem desc its given tat 1 <= X1,Y1,X2,Y2 <= 8...
but here Y1 = 0 and Y2 = 0...
how is it posible ???

pls anyone help me to understand that test case...

I ve a doubt in the 3rd test case provided by Raiyan Kamal

8 3
Rome Chittagong
Rome Khulna
Rome Pabna
Rome Sylhet
Sylhet Moulovibazar
Chittagong Bandorban
Pabna Gaibandha
Rome Barisal
Rome Chittagong
Khulna Gaibandha
Pabna Sylhet


his output were :
RBC
KRPG
PRS ...

hi everybody,

now got AC...
there should not be any blank line after the last test case...

Hi everyone,
I m repeatedly getting RE for this problem...
below is my code...anyone pls help me...



vector <int> BFS ( int s , vector < vector <int> > edg)
{
vector <int> D(1001 , INT_MAX) , color(1001 , 1) , pi(1001 , 0);

color[s] = 2;
pi[s] = 0;
D[s] = 0;

queue <int> Q;
Q.push (s ...

Hi everyone,
I m repeatedly getting RE for this problem...
below is my code...anyone pls help me...



vector <int> BFS ( int s , vector < vector <int> > edg)
{
vector <int> D(1001 , INT_MAX) , color(1001 , 1) , pi(1001 , 0);

color[s] = 2;
pi[s] = 0;
D[s] = 0;

queue <int> Q;
Q.push (s ...

problem solved...
used STL <map> and got AC...I think the "STL sort() algortihm" each time in the loop led to TLE...
thanks

need help...!!!


#define foriz(i,n) for( i = 0 ; i < n ; i ++ )

bool immediately_decodable ( vecs cd )
{
sort( cd.begin() , cd.end() );
int i , j;
foriz ( i , sz(cd) )
{
foriz ( j , sz(cd) )
{
if ( i != j && sz(cd[j]) >= sz(cd[i]) )
{
string x = cd[j].substr ( 0 , sz(cd[i]) );
if ( x ...