oj.uz

답안 #223356

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
223356 2020-04-15T07:46:47 Z MrDomino Rectangles (IOI19_rect) C++14
100 / 100
 2115 ms 378196 KB 
/// Just checking if this dudes solution works
/*
        IOI 19-rect
    editorial: https://ioinformatics.org/page/ioi-2019/51
    Basically, we compute using stacks the closest value to each square (i, j) such that it's bigger than value on (i, j) on up, down, left and right.
    Then we will use the values computed at the previous step to turn the valid squares into valid lines/columns and we are going to check each pair
using brute force(there are about O(n^2) possible pairs).
*/
#include "rect.h"
#include<bits/stdc++.h>
using namespace std;
int maxst[2502][2502], maxdr[2502][2502], maxup[2502][2502], maxdwn[2502][2502];
int upleft[2502][2502], downleft[2502][2502], leftup[2502][2502], rightup[2502][2502];

vector<long long> v;
void check(int xa, int xb, int ya, int yb)
{
    if(xb < xa || yb < ya)
        return;
    if(!((maxdr[xb][ya-1]-1 == yb && rightup[xb][ya-1] <= xa) || (maxst[xb][yb+1]+1 == ya && leftup[xb][yb+1] <= xa)))
        return;
    if(!((maxdwn[xa-1][yb]-1 == xb && downleft[xa-1][yb] <= ya) || (maxup[xb+1][yb]+1 == xa && upleft[xb+1][yb] <= ya)))
        return;
    v.push_back(((1LL * xa * 3010 + xb) * 3010 + ya) * 3010 + yb);
}
long long count_rectangles(vector<vector<int> > a)
{
    int n = a.size();
    int m = a[0].size();
    long long ans = 0;
    deque<int> d;
    for(int i = 0; i < n; ++i)
    {
        for(int j = 0; j < m; ++j)
        {
            while(!d.empty() && a[i][j] > a[i][d.back()])
                d.pop_back();
            if(d.empty())
                maxst[i][j] = -1;
            else
                maxst[i][j] = d.back();
            d.push_back(j);
        }
        d.clear();
        for(int j = m - 1; j >= 0; --j)
        {
            while(!d.empty() && a[i][j] > a[i][d.back()])
                d.pop_back();
            if(d.empty())
                maxdr[i][j] = -1;
            else
                maxdr[i][j] = d.back();
            d.push_back(j);
        }
        d.clear();
    }
    for(int i = 0; i < m; ++i)
    {
        for(int j = 0; j < n; ++j)
        {
            while(!d.empty() && a[j][i] > a[d.back()][i])
                d.pop_back();
            if(d.empty())
                maxup[j][i] = -1;
            else
                maxup[j][i] = d.back();
            d.push_back(j);
        }
        d.clear();
        for(int j = n-1; j >= 0; --j)
        {
            while(!d.empty() && a[j][i] > a[d.back()][i])
                d.pop_back();
            if(d.empty())
                maxdwn[j][i] = -1;
            else
                maxdwn[j][i] = d.back();
            d.push_back(j);
        }
        d.clear();
    }
    for(int j = 0; j < m; ++j)
    {
        for(int i = 0; i < n; ++i)
        {
            if(maxup[i][j] != -1)
            {
                if(j > 0 && maxup[i][j] == maxup[i][j-1])
                    upleft[i][j] = upleft[i][j-1];
                else
                    if(j > 0 && i == maxdwn[maxup[i][j]][j-1])
                        upleft[i][j] = downleft[maxup[i][j]][j-1];
                    else
                        upleft[i][j] = j;
            }
            if(maxdwn[i][j] != -1)
            {
                if(j > 0 && maxdwn[i][j] == maxdwn[i][j-1])
                    downleft[i][j] = downleft[i][j-1];
                else
                    if(j > 0 && i == maxup[maxdwn[i][j]][j-1])
                        downleft[i][j] = upleft[maxdwn[i][j]][j-1];
                    else
                        downleft[i][j] = j;
            }
        }
    }
    for(int i = 0; i < n; ++i)
    {
        for(int j = 0; j < m; ++j)
        {
            if(maxst[i][j] != -1)
            {
                if(i > 0 && maxst[i][j] == maxst[i-1][j])
                    leftup[i][j] = leftup[i-1][j];
                else
                    if(i > 0 && j == maxdr[i-1][maxst[i][j]])
                        leftup[i][j] = rightup[i-1][maxst[i][j]];
                    else
                        leftup[i][j] = i;
            }
            if(maxdr[i][j] != -1)
            {
                if(i > 0 && maxdr[i][j] == maxdr[i-1][j])
                    rightup[i][j] = rightup[i-1][j];
                else
                    if(i > 0 && j == maxst[i-1][maxdr[i][j]])
                        rightup[i][j] = leftup[i-1][maxdr[i][j]];
                    else
                        rightup[i][j] = i;
            }
        }
    }
    for(int i = 1; i + 1 < n; ++i)
        for(int j = 1; j + 1 < m; ++j)
        {
            if(maxup[i+1][j] != -1 && maxst[i][j+1] != -1)
                check(maxup[i+1][j]+1, i, maxst[i][j+1]+1, j);
            if(maxup[i+1][j] != -1 && maxdr[i][j-1] != -1)
                check(maxup[i+1][j]+1, i, j, maxdr[i][j-1]-1);
            if(maxdwn[i-1][j] != -1 && maxst[i][j+1] != -1)
                check(i, maxdwn[i-1][j]-1, maxst[i][j+1]+1, j);
            if(maxdwn[i-1][j] != -1 && maxdr[i][j-1] != -1)
                check(i, maxdwn[i-1][j]-1, j, maxdr[i][j-1]-1);
            if(maxdwn[i-1][j] != -1 && maxdr[maxdwn[i-1][j]-1][j-1] != -1)
                check(i, maxdwn[i-1][j]-1, j, maxdr[maxdwn[i-1][j]-1][j-1]-1);
            if(maxdwn[i-1][j] != -1 && maxst[maxdwn[i-1][j]-1][j+1] != -1)
                check(i, maxdwn[i-1][j]-1, maxst[maxdwn[i-1][j]-1][j+1]+1, j);
        }
    sort(v.begin(), v.end());
    v.resize(unique(v.begin(), v.end()) - v.begin());
    return v.size();
}

Compilation message

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:30:15: warning: unused variable 'ans' [-Wunused-variable]
     long long ans = 0;
               ^~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1408 KB Output is correct
3 Correct 5 ms 1300 KB Output is correct
4 Correct 5 ms 1408 KB Output is correct
5 Correct 6 ms 1408 KB Output is correct
6 Correct 5 ms 1280 KB Output is correct
7 Correct 5 ms 1280 KB Output is correct
8 Correct 5 ms 768 KB Output is correct
9 Correct 5 ms 1280 KB Output is correct
10 Correct 5 ms 1408 KB Output is correct
11 Correct 5 ms 1280 KB Output is correct
12 Correct 5 ms 1280 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 640 KB Output is correct
15 Correct 5 ms 640 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 1408 KB Output is correct
20 Correct 5 ms 1280 KB Output is correct
21 Correct 5 ms 640 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1408 KB Output is correct
3 Correct 5 ms 1300 KB Output is correct
4 Correct 5 ms 1408 KB Output is correct
5 Correct 6 ms 1408 KB Output is correct
6 Correct 5 ms 1280 KB Output is correct
7 Correct 5 ms 1280 KB Output is correct
8 Correct 5 ms 768 KB Output is correct
9 Correct 5 ms 1280 KB Output is correct
10 Correct 5 ms 1408 KB Output is correct
11 Correct 5 ms 1280 KB Output is correct
12 Correct 5 ms 1280 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 640 KB Output is correct
15 Correct 5 ms 640 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 7 ms 3456 KB Output is correct
18 Correct 7 ms 3456 KB Output is correct
19 Correct 7 ms 3456 KB Output is correct
20 Correct 7 ms 3200 KB Output is correct
21 Correct 7 ms 3200 KB Output is correct
22 Correct 7 ms 3200 KB Output is correct
23 Correct 7 ms 3200 KB Output is correct
24 Correct 7 ms 3072 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 5 ms 1408 KB Output is correct
28 Correct 5 ms 1280 KB Output is correct
29 Correct 5 ms 640 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1408 KB Output is correct
3 Correct 5 ms 1300 KB Output is correct
4 Correct 5 ms 1408 KB Output is correct
5 Correct 6 ms 1408 KB Output is correct
6 Correct 5 ms 1280 KB Output is correct
7 Correct 5 ms 1280 KB Output is correct
8 Correct 5 ms 768 KB Output is correct
9 Correct 5 ms 1280 KB Output is correct
10 Correct 5 ms 1408 KB Output is correct
11 Correct 5 ms 1280 KB Output is correct
12 Correct 5 ms 1280 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 640 KB Output is correct
15 Correct 5 ms 640 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 7 ms 3456 KB Output is correct
18 Correct 7 ms 3456 KB Output is correct
19 Correct 7 ms 3456 KB Output is correct
20 Correct 7 ms 3200 KB Output is correct
21 Correct 7 ms 3200 KB Output is correct
22 Correct 7 ms 3200 KB Output is correct
23 Correct 7 ms 3200 KB Output is correct
24 Correct 7 ms 3072 KB Output is correct
25 Correct 15 ms 9724 KB Output is correct
26 Correct 16 ms 9596 KB Output is correct
27 Correct 16 ms 9596 KB Output is correct
28 Correct 14 ms 8576 KB Output is correct
29 Correct 17 ms 8960 KB Output is correct
30 Correct 20 ms 8960 KB Output is correct
31 Correct 17 ms 8832 KB Output is correct
32 Correct 16 ms 8832 KB Output is correct
33 Correct 5 ms 384 KB Output is correct
34 Correct 5 ms 384 KB Output is correct
35 Correct 5 ms 1408 KB Output is correct
36 Correct 5 ms 1280 KB Output is correct
37 Correct 5 ms 640 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1408 KB Output is correct
3 Correct 5 ms 1300 KB Output is correct
4 Correct 5 ms 1408 KB Output is correct
5 Correct 6 ms 1408 KB Output is correct
6 Correct 5 ms 1280 KB Output is correct
7 Correct 5 ms 1280 KB Output is correct
8 Correct 5 ms 768 KB Output is correct
9 Correct 5 ms 1280 KB Output is correct
10 Correct 5 ms 1408 KB Output is correct
11 Correct 5 ms 1280 KB Output is correct
12 Correct 5 ms 1280 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 640 KB Output is correct
15 Correct 5 ms 640 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 7 ms 3456 KB Output is correct
18 Correct 7 ms 3456 KB Output is correct
19 Correct 7 ms 3456 KB Output is correct
20 Correct 7 ms 3200 KB Output is correct
21 Correct 7 ms 3200 KB Output is correct
22 Correct 7 ms 3200 KB Output is correct
23 Correct 7 ms 3200 KB Output is correct
24 Correct 7 ms 3072 KB Output is correct
25 Correct 15 ms 9724 KB Output is correct
26 Correct 16 ms 9596 KB Output is correct
27 Correct 16 ms 9596 KB Output is correct
28 Correct 14 ms 8576 KB Output is correct
29 Correct 17 ms 8960 KB Output is correct
30 Correct 20 ms 8960 KB Output is correct
31 Correct 17 ms 8832 KB Output is correct
32 Correct 16 ms 8832 KB Output is correct
33 Correct 95 ms 40184 KB Output is correct
34 Correct 89 ms 40184 KB Output is correct
35 Correct 82 ms 40184 KB Output is correct
36 Correct 91 ms 40272 KB Output is correct
37 Correct 142 ms 50404 KB Output is correct
38 Correct 154 ms 53604 KB Output is correct
39 Correct 152 ms 54004 KB Output is correct
40 Correct 137 ms 51180 KB Output is correct
41 Correct 102 ms 44144 KB Output is correct
42 Correct 113 ms 45164 KB Output is correct
43 Correct 143 ms 46104 KB Output is correct
44 Correct 143 ms 47852 KB Output is correct
45 Correct 77 ms 35444 KB Output is correct
46 Correct 70 ms 24180 KB Output is correct
47 Correct 142 ms 46932 KB Output is correct
48 Correct 145 ms 47852 KB Output is correct
49 Correct 5 ms 384 KB Output is correct
50 Correct 5 ms 384 KB Output is correct
51 Correct 5 ms 1408 KB Output is correct
52 Correct 5 ms 1280 KB Output is correct
53 Correct 5 ms 640 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 768 KB Output is correct
2 Correct 6 ms 768 KB Output is correct
3 Correct 5 ms 640 KB Output is correct
4 Correct 4 ms 384 KB Output is correct
5 Correct 6 ms 768 KB Output is correct
6 Correct 6 ms 768 KB Output is correct
7 Correct 6 ms 768 KB Output is correct
8 Correct 6 ms 768 KB Output is correct
9 Correct 6 ms 768 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 5 ms 640 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 577 ms 128136 KB Output is correct
3 Correct 1228 ms 260748 KB Output is correct
4 Correct 1229 ms 261972 KB Output is correct
5 Correct 1230 ms 262080 KB Output is correct
6 Correct 462 ms 121464 KB Output is correct
7 Correct 905 ms 242424 KB Output is correct
8 Correct 957 ms 245496 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 1408 KB Output is correct
12 Correct 5 ms 1280 KB Output is correct
13 Correct 5 ms 640 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 5 ms 1408 KB Output is correct
3 Correct 5 ms 1300 KB Output is correct
4 Correct 5 ms 1408 KB Output is correct
5 Correct 6 ms 1408 KB Output is correct
6 Correct 5 ms 1280 KB Output is correct
7 Correct 5 ms 1280 KB Output is correct
8 Correct 5 ms 768 KB Output is correct
9 Correct 5 ms 1280 KB Output is correct
10 Correct 5 ms 1408 KB Output is correct
11 Correct 5 ms 1280 KB Output is correct
12 Correct 5 ms 1280 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 640 KB Output is correct
15 Correct 5 ms 640 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 7 ms 3456 KB Output is correct
18 Correct 7 ms 3456 KB Output is correct
19 Correct 7 ms 3456 KB Output is correct
20 Correct 7 ms 3200 KB Output is correct
21 Correct 7 ms 3200 KB Output is correct
22 Correct 7 ms 3200 KB Output is correct
23 Correct 7 ms 3200 KB Output is correct
24 Correct 7 ms 3072 KB Output is correct
25 Correct 15 ms 9724 KB Output is correct
26 Correct 16 ms 9596 KB Output is correct
27 Correct 16 ms 9596 KB Output is correct
28 Correct 14 ms 8576 KB Output is correct
29 Correct 17 ms 8960 KB Output is correct
30 Correct 20 ms 8960 KB Output is correct
31 Correct 17 ms 8832 KB Output is correct
32 Correct 16 ms 8832 KB Output is correct
33 Correct 95 ms 40184 KB Output is correct
34 Correct 89 ms 40184 KB Output is correct
35 Correct 82 ms 40184 KB Output is correct
36 Correct 91 ms 40272 KB Output is correct
37 Correct 142 ms 50404 KB Output is correct
38 Correct 154 ms 53604 KB Output is correct
39 Correct 152 ms 54004 KB Output is correct
40 Correct 137 ms 51180 KB Output is correct
41 Correct 102 ms 44144 KB Output is correct
42 Correct 113 ms 45164 KB Output is correct
43 Correct 143 ms 46104 KB Output is correct
44 Correct 143 ms 47852 KB Output is correct
45 Correct 77 ms 35444 KB Output is correct
46 Correct 70 ms 24180 KB Output is correct
47 Correct 142 ms 46932 KB Output is correct
48 Correct 145 ms 47852 KB Output is correct
49 Correct 5 ms 768 KB Output is correct
50 Correct 6 ms 768 KB Output is correct
51 Correct 5 ms 640 KB Output is correct
52 Correct 4 ms 384 KB Output is correct
53 Correct 6 ms 768 KB Output is correct
54 Correct 6 ms 768 KB Output is correct
55 Correct 6 ms 768 KB Output is correct
56 Correct 6 ms 768 KB Output is correct
57 Correct 6 ms 768 KB Output is correct
58 Correct 5 ms 512 KB Output is correct
59 Correct 5 ms 640 KB Output is correct
60 Correct 5 ms 640 KB Output is correct
61 Correct 577 ms 128136 KB Output is correct
62 Correct 1228 ms 260748 KB Output is correct
63 Correct 1229 ms 261972 KB Output is correct
64 Correct 1230 ms 262080 KB Output is correct
65 Correct 462 ms 121464 KB Output is correct
66 Correct 905 ms 242424 KB Output is correct
67 Correct 957 ms 245496 KB Output is correct
68 Correct 1084 ms 238040 KB Output is correct
69 Correct 1080 ms 246392 KB Output is correct
70 Correct 967 ms 238316 KB Output is correct
71 Correct 965 ms 238164 KB Output is correct
72 Correct 1975 ms 378196 KB Output is correct
73 Correct 1002 ms 175372 KB Output is correct
74 Correct 1084 ms 244432 KB Output is correct
75 Correct 1730 ms 278844 KB Output is correct
76 Correct 1075 ms 164180 KB Output is correct
77 Correct 1460 ms 276412 KB Output is correct
78 Correct 1806 ms 278928 KB Output is correct
79 Correct 996 ms 164440 KB Output is correct
80 Correct 1767 ms 279488 KB Output is correct
81 Correct 1691 ms 272316 KB Output is correct
82 Correct 1235 ms 291992 KB Output is correct
83 Correct 2115 ms 377476 KB Output is correct
84 Correct 2054 ms 377428 KB Output is correct
85 Correct 2108 ms 377664 KB Output is correct
86 Correct 5 ms 384 KB Output is correct
87 Correct 5 ms 384 KB Output is correct
88 Correct 5 ms 1408 KB Output is correct
89 Correct 5 ms 1280 KB Output is correct
90 Correct 5 ms 640 KB Output is correct