제출 #226172

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
226172		AaronNaidu	Rectangles (IOI19_rect)	C++14	37 / 100	5078 ms	40364 KiB

rect

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, m;
vector<pair<int, int> > topLeft;
vector<pair<int, int> > bottomRight;
vector<vector<int> > board; 

bool works(int startx, int endx, int starty, int endy) {
    if (startx > endx or starty > endy)
    {
        return false;
    }
    
    for (int x = startx; x <= endx; x++)
    {
        for (int y = starty; y <= endy; y++)
        {
            if (board[x][y] >= board[startx-1][y] or board[x][y] >= board[endx+1][y] or board[x][y] >= board[x][starty-1] or board[x][y] >= board[x][endy+1])
            {
                return false;
            }
            
        }       
    }
    //cout << startx << "," << starty << " to " << endx << "," << endy << "\n";
    return true;
}

ll count_rectangles(vector<vector<int> > a) {
    n = a.size();
    m = a[0].size();
    board = a;

    for (int i = 1; i < n - 1; i++)
    {
        for (int j = 1; j < m - 1; j++)
        {
            if (a[i][j] < a[i-1][j] and a[i][j] < a[i][j-1])
            {
                topLeft.push_back({i,j});
                //cout << "Top left could be " << i << "," << j << "\n";
            }
            if (a[i][j] < a[i+1][j] and a[i][j] < a[i][j+1])
            {
                bottomRight.push_back({i,j});
                //cout << "Bottom right could be " << i << "," << j << "\n";
            }
        }
    }
    ll totalCount = 0;
    for (auto i : topLeft)
    {
        for (auto j : bottomRight)
        {
            //cout << "Trying " << i.first << "," << i.second << " to " << j.first << "," << j.second << "\n";
            totalCount += works(i.first,j.first, i.second, j.second);      
        }
    }
    return totalCount;
}

• 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