oj.uz

Submission #217512

# Submission time Handle Problem Language Result Execution time Memory
217512 2020-03-30T05:03:18 Z dolphingarlic Rectangles (IOI19_rect) C++14
0 / 100
 5 ms 1408 KB 
#include "rect.h"

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

int gl[3000][3000], gr[3000][3000], gu[3000][3000], gd[3000][3000];
int lu[3000][3000], ru[3000][3000], ul[3000][3000], dl[3000][3000];
set<tuple<int, int, int, int>> rects;

void check(int x1, int x2, int y1, int y2) {
    if (x2 < x1 || y2 < y1) return;
    if (!((gl[x2][y2 + 1] + 1 == y1 && lu[x2][y2 + 1] <= x1) || (gr[x2][y1 - 1] - 1 == y2 && ru[x2][y1 - 1] <= x1))) return;
    if (!((gu[x2 + 1][y2] + 1 == x1 && ul[x2 + 1][y2] <= y1) || (gd[x1 - 1][y2] - 1 == x2 && dl[x1 - 1][y2] <= y1))) return;
    rects.insert({x1, x2, y1, y2});
}

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

    for (int i = 0; i < n; i++) {
        vector<int> stck;
        for (int j = 0; j < m; j++) {
            while (stck.size() && a[i][stck.back()] < a[i][j]) stck.pop_back();
            if (stck.size()) gl[i][j] = stck.back();
            else gl[i][j] = -1;
            stck.push_back(j);
        }
        stck.clear();
        for (int j = m - 1; ~j; j--) {
            while (stck.size() && a[i][stck.back()] < a[i][j]) stck.pop_back();
            if (stck.size()) gr[i][j] = stck.back();
            else gr[i][j] = -1;
            stck.push_back(j);
        }
    }

    for (int i = 0; i < m; i++) {
        vector<int> stck;
        for (int j = 0; j < n; j++) {
            while (stck.size() && a[stck.back()][i] < a[j][i]) stck.pop_back();
            if (stck.size()) gu[j][i] = stck.back();
            else gu[j][i] = -1;
            stck.push_back(j);
        }
        stck.clear();
        for (int j = n - 1; ~j; j--) {
            while (stck.size() && a[stck.back()][i] < a[j][i]) stck.pop_back();
            if (stck.size()) gd[j][i] = stck.back();
            else gd[j][i] = -1;
            stck.push_back(j);
        }
    }

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (~gl[i][j]) {
                if (i && gl[i - 1][j] == gl[i][j]) lu[i][j] = lu[i - 1][j];
                else if (i && gr[i - 1][gl[i][j]] == j) lu[i][j] = ru[i - 1][gl[i][j]];
                else lu[i][j] = i;
            }
            if (~gr[i][j]) {
                if (i && gr[i - 1][j] == gr[i][j]) ru[i][j] = ru[i - 1][j];
                else if (i && gl[i - 1][gr[i][j]] == j) ru[i][j] = lu[i - 1][gr[i][j]];
                else ru[i][j] = i;
            }
        }
    }

    for (int i = 0; i < m; i++) {
        for (int j = 0; j < n; j++) {
            if (~gu[j][i]) {
                if (i && gu[j][i - 1] == gl[j][i]) ul[j][i] = ul[j][i - 1];
                else if (i && gu[gd[j][i]][i - 1] == j) ul[j][i] = dl[gd[j][i]][i - 1];
                else ul[j][i] = i;
            }
            if (~gd[j][i]) {
                if (i && gd[j][i - 1] == gd[j][i]) dl[j][i] = dl[j][i - 1];
                else if (i && gd[gu[j][i]][i - 1] == j) dl[j][i] = ul[gu[j][i]][i - 1];
                else dl[j][i] = i;
            }
        }
    }

    for (int i = 1; i < n - 1; i++) for (int j = 1; j < m - 1; j++) {
        if (~gl[i][j + 1] && ~gu[i + 1][j]) check(gu[i + 1][j] + 1, i, gl[i][j + 1] + 1, j);
        if (~gl[i][j + 1] && ~gd[i - 1][j]) check(i, gd[i - 1][j] - 1, gl[i][j + 1] + 1, j);
        if (~gr[i][j - 1] && ~gu[i + 1][j]) check(gu[i + 1][j] + 1, i, j, gr[i][j - 1] - 1);
        if (~gr[i][j - 1] && ~gd[i - 1][j]) check(i, gd[i - 1][j] - 1, j, gr[i][j - 1] - 1);

        if (~gr[i][j - 1] && ~gd[i - 1][gr[i][j - 1] - 1])
            check(i, gd[i - 1][gr[i][j - 1] - 1] - 1, j, gr[i][j - 1] - 1);
        if (~gd[i - 1][j] && ~gr[gd[i - 1][j] - 1][j - 1])
            check(i, gd[i - 1][j] - 1, j, gr[gd[i - 1][j] - 1][j - 1] - 1);
    }

    return rects.size();
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Incorrect 5 ms 1408 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Incorrect 5 ms 1408 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Incorrect 5 ms 1408 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Incorrect 5 ms 1408 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 768 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 640 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Incorrect 5 ms 1408 KB Output isn't correct
3 Halted 0 ms 0 KB -