OJ Board

I've tried every possible input from here and udebug. Still getting WA. No idea what's wrong. Help me...
Here's the code....
#include<bits/stdc++.h>
#define sc(x) scanf("%d",&x)
#define sc2(x,y) scanf("%d%d",&x,&y)
#define scs(x) scanf("%s",x)
#define pr(x) printf("%d",x)
#define prn(x) printf("%d ...

I tried max flow algorithm, but got WA.
My algo:
source->every club(capacity=1);
clubs->their people(capacity=1);
people->their party(capacity=1);
party->sink(capacity=(Club numbers-1)/2);
if(flow!=club_number) print "Impossible" else, print solution.

I think the algorithm is correct and tried all ...

My code is getting correct ans for all inputs in this forum but still WA. Please anybody help...
#include<bits/stdc++.h>

#define sc(x) scanf("%d",&x)
#define sc2(x,y) scanf("%d%d",&x,&y)
#define sc3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define sc4(w,x,y,z) scanf("%d%d%d%d",&w,&x,&y,&z)
#define pr(x ...

I've been using a lot of macros to code faster in uva online judge. I always try to solve problems with more efficient algorithms. but I always get more runtimes then my friends whose algorithms are not that much efficient. So it led me thinking if my using macro's causing extra runtime. Please help ...

Thanks brianfry I got ac...

I am getting correct output but got WA. Please help...

I got AC. But can you explain why the last 5 teams in the output should be in rank 5 instead of rank 4? It doesn't make sense...

sorry for double posting...

My code is giving correct output for every input I try. But still it's giving WA...

I'm not an experienced programmer myself. So it maybe a stupid question. But often wonder that how the highest rank holders in most problems in uva solve them in 0 ms.
Even when I submitted a code by just writing:
int main()
{return 0;}
I took 13ms. So how do they solve these problems so ...

Thanks I got AC...

My algo:
1. first I shifted the small grid as left and as upper as possible(I didn't think I should do so for the larger grid as well)
2. then I traversed the large grid for any occurrence of the small grid. if found, filled that section of the larger grid with '.'. if none found then printed 0,
3 ...

Also I don't know why I'm getting wa. please help...
#include<iostream>
#include<sstream>
#include<string>
#include<algorithm>
#include<iomanip>
#include<array>
#include<vector>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<forward_list>
#include<map>
#include<unordered ...

brianfry713 wrote:It looks like the judge's input has Polyominos that don't have the correct number of characters. In my AC code I pad the right size of the Polyomino with '.' if the line is too short.

Can you explain please...?

Hello! I've tried all the inputs in my code. Don't know why I'm getting WA. Please help...