OJ Board

Hint: bitmask

You have to use bitmask to avoid TLE.

My program works in this test case.

Hi,

I don't know what I'm doing wrong. Can anyone help me?

My algorithm:

- Ford-Fulkerson method to get the maximum matching in the bipartite graph.
- Reverse all match edges.
- DFS for each slide "x": if find a cycle with "x", don't print the match.


#include <cstdio>
#include <cstdlib ...

I'm getting WA but i don't know why.
Does anyone can help me with this problem?

My code:


#include <stdio.h>
#include <stdlib.h>
#define MAX_BUFF 1000
#define MAX 10000

struct Aresta {
int o;
int d;
int t;
} a[MAX];

int pos[MAX];

int compare (struct Aresta *a, struct Aresta *b)
{
if(a -> o ...