제출 #601285

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
601285		MohamedFaresNebili	Rectangles (IOI19_rect)	C++14	37 / 100	5094 ms	22684 KiB

rect

#include <bits/stdc++.h>
/// #pragma GCC optimize ("Ofast")
/// #pragma GCC target ("avx2")
/// #pragma GCC optimize("unroll-loops")

            using namespace std;

            using ll = long long;
            using ii = pair<ll, ll>;
            using vi = vector<int>;

            #define ff first
            #define ss second
            #define pb push_back
            #define all(x) (x).begin(), (x).end()
            #define lb lower_bound

            const int oo = 1000 * 1000 * 1000 + 7;

            ll count_rectangles(vector<vector<int>> A) {
                int N = A.size(), M = A[0].size();
              	ll res = 0;
              	if(N >= 3) {
              	    for(int l = 1; l < N - 1; l++) {
                        for(int i = 1; i < M - 1; i++) {
                            for(int j = l; j < N - 1; j++) {
                                for(int k = i; k < M - 1; k++) {
                                    bool ok = 1;
                                    for(int x = l; x <= j && ok; x++) {
                                        for(int y = i; y <= k && ok; y++) {
                                            int U = min(A[l - 1][y], A[j + 1][y]);
                                            int V = min(A[x][i - 1], A[x][k + 1]);
                                            if(A[x][y] >= min(U, V))
                                                ok = 0;
                                        }
                                    }
                                    res += ok;
                                }
                            }
                        }
              	    }
              	}
                return res;
            }

• 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