OJ Board

Thank you very much, Jan! AC!

Thank you very much, AC!

If there are more then one answer, can I print anyone of then?
Im getting WA, and I can't find the error.
Thank you.

Can I say that if a vertex is on the queue, it don't need to go again?
Because I tried to do it, and got WA.

I can change the code to work for the inputs, but I get TLE. How can I optimize this code?
Thank you.

I changed my code, but got WA in 0.189.
Thank you.

But I got WA, no TLE...

I try to use BFS, but I got WA. Can anyone help me?
Thank you.

Hi, I am getting WA for this problem, but my code is right for the inputs.


#include <stdio.h>

#define INF 2100100100
#define MAXVERTICES 500
#define MAXARESTAS MAXVERTICES * MAXVERTICES

typedef struct
{
int u, v, c;
}
Aresta;

typedef enum
{
FALSE = 0, TRUE
}
boolean;

int pai[MAXVERTICES ...

Thank you very much! I got AC!

Hello, I don't know why I'm getting WA... My algotithm:

1 - Make a graph with no edges.
2 - Read the input of the dances and make the edges.
3 - Find the Shortest Path from the vertex 0 for all other vertices.

Is that correct? Thank you.

Can anyone help me to find the wrong? My code is right for all inputs for this problem...

Hello, I cant find the error of this code, but I get WA.
Thank you.

Hello, I need to optimize this code (TLE), but I have no idea how to do this, can you help me?


#include <stdio.h>

int max = -9999, matriz[101][101], lado;

void busca(int altura, int largura);

int main()
{
int valor, i, j;

scanf("%d", &lado);

for (i = 0; i < lado; i++)
{
for (j = 0; j ...

Now I got RE (Signal 11) :( :(


#include <stdio.h>

int *pai, *rank, *flag, pessoas;

void MakeSet(int x);
int FindSet(int x);
void Union(int x, int y);
void Separa(int x, int y);

int main()
{
int comando, n1, n2, i;

scanf("%d", &pessoas);

pai = calloc(pessoas, sizeof(int));
rank = calloc ...