제출 #1151653

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1151653		Pacybwoah	Rectangles (IOI19_rect)	C++20	59 / 100	3551 ms	1114112 KiB

rect

#include "rect.h"
#include<iostream>
#include<vector>
#include<algorithm>
#include<bitset>
#include<utility>
using namespace std;
typedef long long ll;

long long count_rectangles(std::vector<std::vector<int> > a) {
	ll ans = 0;
	int n = (int)a.size();
	int m = (int)a[0].size();
	if(n <= 2 || m <= 2) return 0;
	vector<vector<bitset<2505>>> visr(n, vector<bitset<2505>>(m)), visc(m, vector<bitset<2505>>(n));
	vector<vector<pair<int, int>>> r(n), c(m);
    for(int i = 1; i < n - 1; i++){
        vector<pair<int, int>> st;
        for(int j = 0; j < m; j++){
            bool flag = 0;
            while(!st.empty() && st.back().first <= a[i][j]){
                auto x = st.back();
                st.pop_back();
                if(x.second + 1 < j){
                    visr[i][x.second][j] = 1;
                    r[i].emplace_back(x.second, j);
                }
                if(x.first == a[i][j]) flag = 1;
            }
            if(!st.empty() && (!flag)){
                auto &x = st.back();
                if(x.second + 1 < j){
                    visr[i][x.second][j] = 1;
                    r[i].emplace_back(x.second, j);
                }
            }
            st.emplace_back(a[i][j], j);
        }
    }
    for(int i = 1; i < m - 1; i++){
        vector<pair<int, int>> st;
        for(int j = 0; j < n; j++){
            bool flag = 0;
            while(!st.empty() && st.back().first <= a[j][i]){
                auto x = st.back();
                st.pop_back();
                if(x.second + 1 < j){
                    visc[i][x.second][j] = 1;
                    c[i].emplace_back(x.second, j);
                }
                if(x.first == a[j][i]) flag = 1;
            }
            if(!st.empty() && (!flag)){
                auto &x = st.back();
                if(x.second + 1 < j){
                    visc[i][x.second][j] = 1;
                    c[i].emplace_back(x.second, j);
                }
            }
            st.emplace_back(a[j][i], j);
        }
    }
    for(int i = 1; i < n - 1; i++){
        vector<pair<int, int>> imp = r[i];
        for(int j = i; j < n - 1; j++){
            vector<pair<int, int>> tmp;
            while(!imp.empty()){
                auto [a, b] = imp.back();
                imp.pop_back();
                if(visr[j][a][b]) tmp.emplace_back(a, b);
            }
            imp = tmp;
            vector<int> pre(m);
            for(int k = 1; k < m - 1; k++){
                if(visc[k][i - 1][j + 1]) pre[k] = pre[k - 1] + 1;
                else pre[k] = pre[k - 1];
                //cout << pre[k] << " ";
            }
            for(auto &[a, b]: imp){
                if(pre[b - 1] - pre[a] == b - a - 1) ans++;
            }
        }
    }
	return ans;
}
// g++ -std=c++17 -Wall -Wextra -Wshadow -fsanitize=undefined -fsanitize=address -o run rect.cpp grader.cpp

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