OJ Board

But do i need to include power plant into the kindom?

As i understand kingdom's wall surrounds power plant.
It seems to me you don't include in kingdom. (The square of the last poligon must be greater than yours).

WA again & again, but my programm passes all my tests

May be not
bin[0][1]+bin[0][2]+bin[1][0]+bin[1][1]+bin[2][0]+bin[2][2]

but
bin[0][1]+bin[0][2]+bin[1][0]+bin[1][2]+bin[2][0]+bin[2][1] ?

What does Lexicographically mean?
For example what is first in lexicographical order
1 1 1 3 4
or
1 10 9 8 7
??
Maybe it is your problem?

Algorithm solving was described some posts earlier. I've solved the task in the same way but i get WA. It passes all test i've found on this forum. What is wrong with it?
[cpp]
#include <iostream.h>
#include <string.h>

int d[31][10];
int map[30][30];

int N, M;

char less(int i, int j)
{
for (int ...