제출 #213457

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
213457		Blagojce	Rectangles (IOI19_rect)	C++14	37 / 100	5090 ms	343100 KiB

rect

#include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define st first
#define nd second
#define pb push_back
#define pq priority_queue
#define all(x) begin(x), end(x)

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
ll const inf = 1e9;
ll const mod = 1e9 + 7;
ld const eps = 1e-13;

#include "rect.h"

int n, m;
int a[2500][2500];
vector<int> le[2500][2500];
vector<int> up[2500][2500];

void find_lefts(){
        fr(i, 0, n){
                fr(j, 0, m){
                        int MAX = 0;
                        for(int k = j - 1; k >= 0; k --){
                                if(j - k > 1 && MAX < a[i][j] && MAX < a[i][k]){
                                        le[i][j].pb(k);
                                }
                                MAX = max(MAX, a[i][k]);
                        }
                }
        }
}
void find_ups(){
        fr(i, 0, n){
                fr(j, 0, m){
                        int MAX = 0;
                        for(int k = i - 1; k >= 0; k --){
                                if(i - k > 1 && MAX < a[i][j] && MAX < a[k][j]){
                                        up[i][j].pb(k);
                                }
                                MAX = max(MAX, a[k][j]);
                        }
                }
        }
}
long long count_rectangles(std::vector<std::vector<int> > v) {
        /*cin >> n >> m;
        v.resize(n);
        fr(i, 0, n){
                v[i].resize(m);
                fr(j, 0, m){
                        cin >> v[i][j];
                }
        }*/

        n = v.size();
        m = v[0].size();
        fr(i, 0, n){
                fr(j, 0, m){
                        a[i][j] = v[i][j];
                }
        }
        find_lefts();
        find_ups();
        int vis1[n][m];
        int vis2[n][m];
        memset(vis1, -1, sizeof(vis1));
        memset(vis2, -1, sizeof(vis2));

        int ANS = 0;
        int VIS = 0;
        fr(i, 2, n){
                fr(j, 2, m){
                        ++VIS;
                        for(int k = i - 1; k > 0; k --){
                                for(auto u : le[k][j]){
                                        if(k == i - 1 || vis1[k][u] == VIS){
                                                vis1[k - 1][u] = VIS;
                                        }
                                }
                        }
                        for(int k = j - 1; k > 0; k --){
                                for(auto u : up[i][k]){
                                        if(k == j - 1 || vis2[u][k] == VIS){
                                                vis2[u][k - 1] = VIS;
                                                if(vis1[u][k - 1] == VIS) ANS ++;
                                        }
                                }
                        }
                }
        }
      //  cout << ANS<<endl;
        return ANS;
}
/*
int main()
{
        freopen("in.txt", "r", stdin);

        vector<vector<int> > v;
        count_rectangles(v);
        return 0;
}
*/
/*
6 5
4 8 7 5 6
7 4 10 3 5
9 7 20 14 2
9 14 7 3 6
5 7 5 2 7
4 5 13 5 6
*/

• 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