OJ Board

well, i spend hours testing, reading carefully the code and going over every tip that was mentioned in the forum, and i keep getting WA, can anyone help me?


#include <algorithm>
#include <cstdio>
#include <string>
#include <vector>
#include <iostream>
#include <sstream>
using namespace std ...

I've implemented preflow-push and got accepted in a regular flow problem (internet bandwidth, 820) and then i started working on this one because a friend of mine told me he had implemented edmond-karp and got TLE and when reading in the board found out that preflow-push was the answer. I've already ...

i dont know why this is giving me WA, i tested almost everything i came up with

#pragma warning(disable:4786)
#include <cstdio>
#include <iostream>
#include <list>
#include <vector>
#include <map>
#include <algorithm>
#include <string>
using namespace std;
#define forn(i,n) for(i=0;i<n;i ...

it is not stated in the problem if A-2-3-4-5 is a straight (when it only says consecutivew values)

if it IS to be considered a straight, it is a bigger one or a smaller one than, in example, 2-3-4-5-6 (because it says when you have two straights rank by their "highest card", which literally means ...