Cod sursa(job #2482288)

Utilizator IordachescuAncaFMI Iordachescu Anca Mihaela IordachescuAnca Data 27 octombrie 2019 23:50:11
Problema Zone Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 2.06 kb
#include<fstream>
#include<algorithm>
using namespace std;
	
ifstream fin("zone.in");
ofstream fout("zone.out");

int N;
int viz[11], A[600][600];;
long long matr[600][600], C[11];
int Linie[5], Coloana[5];
bool ok;
	
	
long long Submatrice(int x1,int y1,int x2,int y2)
	
{
	
    return matr[x2][y2]+matr[x1][y1]-matr[x1][y2]-matr[x2][y1];
	
}
	
 
	
int FoundedArea(long long c)
{
	
    for(int i=1;i<=9;i++)
    {
	
        if(!viz[i] && C[i] == c)
	
            return i;
    }

	
    return 0;
	
}
	
bool isSolution(int l1,int l2,int c1,int c2)
{
	
    Linie[1] = l1;
    Linie[2] = l2; 
    Linie[3] = N;
    Coloana[1] = c1;
    Coloana[2] = c2;
    Coloana[3] = N;
    for(int i = 1; i <= 3; i++)
    {
        for(int j = 1; j <= 3; j++)
        {
        	long long calculatesubmatrix = Submatrice(Linie[i-1],Coloana[j-1],Linie[i],Coloana[j]);
            int isOk = FoundedArea(calculatesubmatrix);
            if(!isOk || viz[isOk]) 
            {
            	return false;
            }
           	viz[isOk] = 1;
	
        }
    }
	
    return true;
	
}
	
 
	
void Solve()
{
	
    for(int i = 1; i < N && !ok; i++)
    {
        for(int j = 1; j < N && !ok; j++)
        {
            if(FoundedArea(matr[i][j]))
	
                for(int k = i+1; k < N && !ok; k++)
                {
                    for(int l=j+1; l<N && !ok;l++)
                    {
                        ok = isSolution(i,k,j,l);
	
                        for(int i = 1; i <= 9; i++)
                        {
                        	viz[i] = 0;
                        }
                    }
                }
        }
    }
	
}
	
 
	
int main()	
{
    fin >> N;
	for(int i = 1; i <= 9; i++)
	{
		fin >> C[i];
	}
	sort(C+1, C+10);

	for(int i = 1; i <= N; i++)
	{
		for(int j = 1; j <= N; j++)
		{
			fin >> A[i][j];
		}
	}
	
	for(int i = 1; i <= N; i++)
	{
		for(int j = 1; j <= N; j++)
		{
			matr[i][j] = A[i][j] + matr[i-1][j] + matr[i][j-1] - matr[i-1][j-1];
		}
	}
    
    Solve();     
	
    fout << Linie[1] <<" " << Linie[2] << " " << Coloana[1] << " " << Coloana[2];
    fin.close();
    fout.close();
	
}