Submission #1242634

#	Time	Username	Problem	Language	Result	Execution time	Memory
1242634		duhendorfus	Rectangles (IOI19_rect)	C++20	37 / 100	5094 ms	22852 KiB

rect

#include <bits/stdc++.h>


using namespace std;
using ll = long long;

bool cnd(vector <vector <int>> &G , int c1 , int c2 , int r1 , int r2){
    bool t = true;
    for (int i = c1 ; i <= c2 ; ++i){
        for (int j = r1 ; j <= r2 ; ++j){
            if (G[i][j] < G[i][r1 - 1] && G[i][j] < G[i][r2 + 1] && G[i][j] < G[c1 - 1][j] && G[i][j] < G[c2 + 1][j]) t = true;
            else return false;
        }
    }
    return t;
}


ll count_rectangles(vector<vector<int>> a){
    int m = a[0].size();
    int n = a.size();
    ll cnt = 0;
    for (int c1 = 1 ; c1 < n - 1 ; ++c1){
        for (int c2 = c1  ; c2 < n - 1 ; ++c2){
            for (int r1 = 1 ; r1 < m - 1 ; ++r1){
                for (int r2 = r1 ; r2 < m - 1 ; ++r2){
                    if (cnd(a , c1 , c2 , r1 , r2)) cnt++;
                }
            }
        }
    }

    return cnt;
}

• Subtask 1: 8 / 8
• Subtask 2: 7 / 7
• Subtask 3: 12 / 12
• Subtask 4: 0 / 22
• Subtask 5: 10 / 10
• Subtask 6: 0 / 13
• Subtask 7: 0 / 28