Submission #473304

#TimeUsernameProblemLanguageResultExecution timeMemory
473304blueRectangles (IOI19_rect)C++17
8 / 100
5055 ms28276 KiB
#include "rect.h"
#include <vector>
#include <algorithm>
using namespace std;

int mn(vector<int> x)
{
    int r = 1'000'000'000;
    for(int k:x) r = min(r, k);
    return r;
}

long long count_rectangles(vector< vector<int> > A)
{
    int N = (int)A.size();
    int M = (int)A[0].size();
    long long res = 0;
    for(int r1 = 1; r1 <= N-2; r1++)
    {
        for(int r2 = r1; r2 <= N-2; r2++)
        {
            for(int c1 = 1; c1 <= M-2; c1++)
            {
                for(int c2 = c1; c2 <= M-2; c2++)
                {
                    bool good = 1;
                    for(int i = r1; i <= r2; i++)
                    {
                        for(int j = c1; j <= c2; j++)
                        {
                            if(A[i][j] >= mn(vector<int>{A[i][c1-1], A[i][c2+1], A[r1-1][j], A[r2+1][j]}))
                                good = 0;
                        }
                    }
                    res += good;
                }
            }
        }
    }
    return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...