oj.uz

답안 #571428

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
571428 2022-06-02T07:59:03 Z azberjibiou Rectangles (IOI19_rect) C++17
100 / 100
 4839 ms 621532 KB 
#include <bits/stdc++.h>
#include "rect.h"
using namespace std;
const int mxN=2505;
typedef struct rect{
    short x1, x2, y1, y2;
    rect() : x1(0), x2(0), y1(0), y2(0) {}
    rect(short x1, short x2, short y1, short y2) : x1(x1), x2(x2), y1(y1), y2(y2) {}
    bool operator==(rect a)
    {
        return (a.x1==x1 && a.x2==x2 && a.y1==y1 && a.y2==y2);
    }
}rect;
typedef struct qry{
    short s, e, rowcol;
    int idx;
    qry() : s(0), e(0), rowcol(0), idx(0) {}
    qry(short s, short e, short rowcol, int idx) : s(s), e(e), rowcol(rowcol), idx(idx) {}
}qry;
short N, M;
int A[mxN][mxN];
short L[mxN][mxN], R[mxN][mxN], U[mxN][mxN], D[mxN][mxN];
vector <rect> v;
bool Chk[mxN*mxN];
vector <qry> cont[4][mxN];
bool cmp1(rect a, rect b)
{
    if(a.x1!=b.x1)  return a.x1<b.x1;
    if(a.x2!=b.x2)  return a.x2<b.x2;
    if(a.y1!=b.y1)  return a.y1<b.y1;
    return a.y2<b.y2;
}
void make_LRUD1()
{
    for(short i=1;i<N-1;i++)
    {
        stack <short> stk;
        for(short j=0;j<M;j++)
        {
            while(!stk.empty() && A[i][stk.top()]<=A[i][j])   stk.pop();
            L[i][j]=(stk.empty() ? -1 : stk.top());
            stk.push(j);
        }
        while(!stk.empty()) stk.pop();
        for(short j=M-1;j>=0;j--)
        {
            while(!stk.empty() && A[i][stk.top()]<=A[i][j])   stk.pop();
            R[i][j]=(stk.empty() ? M : stk.top());
            stk.push(j);
        }
    }
    for(short i=1;i<M-1;i++)
    {
        stack <short> stk;
        for(short j=0;j<N;j++)
        {
            while(!stk.empty() && A[stk.top()][i]<=A[j][i]) stk.pop();
            U[j][i]=(stk.empty() ? -1 : stk.top());
            stk.push(j);
        }
        while(!stk.empty()) stk.pop();
        for(short j=N-1;j>=0;j--)
        {
            while(!stk.empty() && A[stk.top()][i]<=A[j][i]) stk.pop();
            D[j][i]=(stk.empty() ? N : stk.top());
            stk.push(j);
        }
    }
}
void make_LRUD2()
{
    for(short i=1;i<N-1;i++)
    {
        stack <short> stk;
        for(short j=0;j<M;j++)
        {
            while(!stk.empty() && A[i][stk.top()]<A[i][j])   stk.pop();
            L[i][j]=(stk.empty() ? -1 : stk.top());
            stk.push(j);
        }
        while(!stk.empty()) stk.pop();
        for(short j=M-1;j>=0;j--)
        {
            while(!stk.empty() && A[i][stk.top()]<A[i][j])   stk.pop();
            R[i][j]=(stk.empty() ? M : stk.top());
            stk.push(j);
        }
    }
    for(short i=1;i<M-1;i++)
    {
        stack <short> stk;
        for(short j=0;j<N;j++)
        {
            while(!stk.empty() && A[stk.top()][i]<A[j][i]) stk.pop();
            U[j][i]=(stk.empty() ? -1 : stk.top());
            stk.push(j);
        }
        while(!stk.empty()) stk.pop();
        for(short j=N-1;j>=0;j--)
        {
            while(!stk.empty() && A[stk.top()][i]<A[j][i]) stk.pop();
            D[j][i]=(stk.empty() ? N : stk.top());
            stk.push(j);
        }
    }
}
short seg[4*mxN];
void init(short idx, short s, short e, short lrud, short rowcol)  ///DURL
{
    if(s==e)
    {
        if(lrud==0) seg[idx]=D[rowcol][s];
        if(lrud==1) seg[idx]=U[rowcol][s];
        if(lrud==2) seg[idx]=R[s][rowcol];
        if(lrud==3) seg[idx]=L[s][rowcol];
        return;
    }
    short mid=(s+e)/2;
    init(2*idx, s, mid, lrud, rowcol);
    init(2*idx+1, mid+1, e, lrud, rowcol);
    if(lrud==0 || lrud==2)  seg[idx]=min(seg[2*idx], seg[2*idx+1]);
    else    seg[idx]=max(seg[2*idx], seg[2*idx+1]);
}
short lim;
bool typ;
bool solv(short idx, short s1, short e1, short s2, short e2)
{
    if(s2<=s1 && e1<=e2)    return (typ ? seg[idx]<=lim : seg[idx]>=lim);
    short mid=(s1+e1)/2;
    if(e2<=mid) return solv(2*idx, s1, mid, s2, e2);
    if(s2>mid)  return solv(2*idx+1, mid+1, e1, s2, e2);
    return (solv(2*idx, s1, mid, s2, e2) && solv(2*idx+1, mid+1, e1, s2, e2));
}
void make_seg()
{
    for(short i=0;i<N;i++)
    {
        init(1, 0, M-1, 0, i);  typ=false;
        for(auto ele : cont[0][i])
        {
            lim=ele.rowcol;
            if(!solv(1, 0, M-1, ele.s, ele.e))    Chk[ele.idx]=false;
        }
        init(1, 0, M-1, 1, i);  typ=true;
        for(auto ele : cont[1][i])
        {
            lim=ele.rowcol;
            if(!solv(1, 0, M-1, ele.s, ele.e))    Chk[ele.idx]=false;
        }
    }
    for(short i=0;i<M;i++)
    {
        init(1, 0, N-1, 2, i);  typ=false;
        for(auto ele : cont[2][i])
        {
            lim=ele.rowcol;
            if(!solv(1, 0, N-1, ele.s, ele.e))    Chk[ele.idx]=false;
        }
        init(1, 0, N-1, 3, i);  typ=true;
        for(auto ele : cont[3][i])
        {
            lim=ele.rowcol;
            if(!solv(1, 0, N-1, ele.s, ele.e))    Chk[ele.idx]=false;
        }
    }
}
long long count_rectangles(std::vector<std::vector<int> > a) {
    N=a.size();
    M=a[0].size();
    for(short i=0;i<N;i++)    for(short j=0;j<M;j++)    A[i][j]=a[i][j];
    make_LRUD1();
    for(short i=1;i<N-1;i++)
    {
        for(short j=1;j<M-1;j++)
        {
            if(U[i][j]!=-1 && D[i][j]!=N && L[i][j]!=-1 && R[i][j]!=M)  v.emplace_back(U[i][j]+1, D[i][j]-1, L[i][j]+1, R[i][j]-1);
        }
    }
    sort(v.begin(), v.end(), cmp1);
    v.erase(unique(v.begin(), v.end()), v.end());
    make_LRUD2();
    for(int i=0;i<v.size();i++)
    {
        rect ele=v[i];
        Chk[i]=true;
        cont[0][ele.x1-1].emplace_back(ele.y1, ele.y2, ele.x2+1, i);
        cont[1][ele.x2+1].emplace_back(ele.y1, ele.y2, ele.x1-1, i);
        cont[2][ele.y1-1].emplace_back(ele.x1, ele.x2, ele.y2+1, i);
        cont[3][ele.y2+1].emplace_back(ele.x1, ele.x2, ele.y1-1, i);
    }
    make_seg();
    int ans=0;
    for(int i=0;i<v.size();i++) ans+=Chk[i];
    return ans;
}

Compilation message

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:182:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<rect>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  182 |     for(int i=0;i<v.size();i++)
      |                 ~^~~~~~~~~
rect.cpp:193:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<rect>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  193 |     for(int i=0;i<v.size();i++) ans+=Chk[i];
      |                 ~^~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 596 KB Output is correct
2 Correct 1 ms 1236 KB Output is correct
3 Correct 1 ms 1236 KB Output is correct
4 Correct 1 ms 1236 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1236 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 2 ms 1236 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 596 KB Output is correct
15 Correct 0 ms 724 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 1 ms 1108 KB Output is correct
21 Correct 1 ms 596 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 596 KB Output is correct
2 Correct 1 ms 1236 KB Output is correct
3 Correct 1 ms 1236 KB Output is correct
4 Correct 1 ms 1236 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1236 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 2 ms 1236 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 596 KB Output is correct
15 Correct 0 ms 724 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 468 KB Output is correct
19 Correct 1 ms 1108 KB Output is correct
20 Correct 1 ms 1108 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 4 ms 2772 KB Output is correct
23 Correct 4 ms 2772 KB Output is correct
24 Correct 6 ms 2772 KB Output is correct
25 Correct 4 ms 2516 KB Output is correct
26 Correct 5 ms 2772 KB Output is correct
27 Correct 5 ms 2772 KB Output is correct
28 Correct 5 ms 2644 KB Output is correct
29 Correct 4 ms 2388 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 596 KB Output is correct
2 Correct 1 ms 1236 KB Output is correct
3 Correct 1 ms 1236 KB Output is correct
4 Correct 1 ms 1236 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1236 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 2 ms 1236 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 596 KB Output is correct
15 Correct 0 ms 724 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 4 ms 2772 KB Output is correct
18 Correct 4 ms 2772 KB Output is correct
19 Correct 6 ms 2772 KB Output is correct
20 Correct 4 ms 2516 KB Output is correct
21 Correct 5 ms 2772 KB Output is correct
22 Correct 5 ms 2772 KB Output is correct
23 Correct 5 ms 2644 KB Output is correct
24 Correct 4 ms 2388 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 1108 KB Output is correct
28 Correct 1 ms 1108 KB Output is correct
29 Correct 1 ms 596 KB Output is correct
30 Correct 22 ms 7920 KB Output is correct
31 Correct 22 ms 8012 KB Output is correct
32 Correct 22 ms 8012 KB Output is correct
33 Correct 18 ms 6992 KB Output is correct
34 Correct 25 ms 8320 KB Output is correct
35 Correct 27 ms 8232 KB Output is correct
36 Correct 24 ms 8140 KB Output is correct
37 Correct 24 ms 8128 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 596 KB Output is correct
2 Correct 1 ms 1236 KB Output is correct
3 Correct 1 ms 1236 KB Output is correct
4 Correct 1 ms 1236 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1236 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 2 ms 1236 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 596 KB Output is correct
15 Correct 0 ms 724 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 4 ms 2772 KB Output is correct
18 Correct 4 ms 2772 KB Output is correct
19 Correct 6 ms 2772 KB Output is correct
20 Correct 4 ms 2516 KB Output is correct
21 Correct 5 ms 2772 KB Output is correct
22 Correct 5 ms 2772 KB Output is correct
23 Correct 5 ms 2644 KB Output is correct
24 Correct 4 ms 2388 KB Output is correct
25 Correct 22 ms 7920 KB Output is correct
26 Correct 22 ms 8012 KB Output is correct
27 Correct 22 ms 8012 KB Output is correct
28 Correct 18 ms 6992 KB Output is correct
29 Correct 25 ms 8320 KB Output is correct
30 Correct 27 ms 8232 KB Output is correct
31 Correct 24 ms 8140 KB Output is correct
32 Correct 24 ms 8128 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 1108 KB Output is correct
36 Correct 1 ms 1108 KB Output is correct
37 Correct 1 ms 596 KB Output is correct
38 Correct 75 ms 22976 KB Output is correct
39 Correct 93 ms 22860 KB Output is correct
40 Correct 76 ms 22872 KB Output is correct
41 Correct 78 ms 22976 KB Output is correct
42 Correct 297 ms 55644 KB Output is correct
43 Correct 301 ms 55608 KB Output is correct
44 Correct 317 ms 55616 KB Output is correct
45 Correct 278 ms 52484 KB Output is correct
46 Correct 186 ms 42444 KB Output is correct
47 Correct 235 ms 43824 KB Output is correct
48 Correct 316 ms 62932 KB Output is correct
49 Correct 343 ms 63080 KB Output is correct
50 Correct 167 ms 38656 KB Output is correct
51 Correct 159 ms 31456 KB Output is correct
52 Correct 299 ms 56164 KB Output is correct
53 Correct 319 ms 56820 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 980 KB Output is correct
2 Correct 2 ms 852 KB Output is correct
3 Correct 2 ms 724 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 2 ms 724 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 2 ms 724 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 1108 KB Output is correct
4 Correct 1 ms 1108 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1114 ms 146564 KB Output is correct
8 Correct 2523 ms 303100 KB Output is correct
9 Correct 2545 ms 312428 KB Output is correct
10 Correct 2482 ms 306808 KB Output is correct
11 Correct 451 ms 61008 KB Output is correct
12 Correct 835 ms 120140 KB Output is correct
13 Correct 899 ms 123192 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 596 KB Output is correct
2 Correct 1 ms 1236 KB Output is correct
3 Correct 1 ms 1236 KB Output is correct
4 Correct 1 ms 1236 KB Output is correct
5 Correct 1 ms 1108 KB Output is correct
6 Correct 1 ms 1236 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 1108 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 1 ms 1108 KB Output is correct
12 Correct 2 ms 1236 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 596 KB Output is correct
15 Correct 0 ms 724 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 4 ms 2772 KB Output is correct
18 Correct 4 ms 2772 KB Output is correct
19 Correct 6 ms 2772 KB Output is correct
20 Correct 4 ms 2516 KB Output is correct
21 Correct 5 ms 2772 KB Output is correct
22 Correct 5 ms 2772 KB Output is correct
23 Correct 5 ms 2644 KB Output is correct
24 Correct 4 ms 2388 KB Output is correct
25 Correct 22 ms 7920 KB Output is correct
26 Correct 22 ms 8012 KB Output is correct
27 Correct 22 ms 8012 KB Output is correct
28 Correct 18 ms 6992 KB Output is correct
29 Correct 25 ms 8320 KB Output is correct
30 Correct 27 ms 8232 KB Output is correct
31 Correct 24 ms 8140 KB Output is correct
32 Correct 24 ms 8128 KB Output is correct
33 Correct 75 ms 22976 KB Output is correct
34 Correct 93 ms 22860 KB Output is correct
35 Correct 76 ms 22872 KB Output is correct
36 Correct 78 ms 22976 KB Output is correct
37 Correct 297 ms 55644 KB Output is correct
38 Correct 301 ms 55608 KB Output is correct
39 Correct 317 ms 55616 KB Output is correct
40 Correct 278 ms 52484 KB Output is correct
41 Correct 186 ms 42444 KB Output is correct
42 Correct 235 ms 43824 KB Output is correct
43 Correct 316 ms 62932 KB Output is correct
44 Correct 343 ms 63080 KB Output is correct
45 Correct 167 ms 38656 KB Output is correct
46 Correct 159 ms 31456 KB Output is correct
47 Correct 299 ms 56164 KB Output is correct
48 Correct 319 ms 56820 KB Output is correct
49 Correct 2 ms 980 KB Output is correct
50 Correct 2 ms 852 KB Output is correct
51 Correct 2 ms 724 KB Output is correct
52 Correct 1 ms 596 KB Output is correct
53 Correct 2 ms 724 KB Output is correct
54 Correct 2 ms 724 KB Output is correct
55 Correct 2 ms 724 KB Output is correct
56 Correct 3 ms 724 KB Output is correct
57 Correct 2 ms 724 KB Output is correct
58 Correct 1 ms 596 KB Output is correct
59 Correct 1 ms 596 KB Output is correct
60 Correct 1 ms 724 KB Output is correct
61 Correct 1114 ms 146564 KB Output is correct
62 Correct 2523 ms 303100 KB Output is correct
63 Correct 2545 ms 312428 KB Output is correct
64 Correct 2482 ms 306808 KB Output is correct
65 Correct 451 ms 61008 KB Output is correct
66 Correct 835 ms 120140 KB Output is correct
67 Correct 899 ms 123192 KB Output is correct
68 Correct 1 ms 468 KB Output is correct
69 Correct 1 ms 468 KB Output is correct
70 Correct 1 ms 1108 KB Output is correct
71 Correct 1 ms 1108 KB Output is correct
72 Correct 1 ms 596 KB Output is correct
73 Correct 1062 ms 123596 KB Output is correct
74 Correct 1071 ms 123532 KB Output is correct
75 Correct 1049 ms 123572 KB Output is correct
76 Correct 1072 ms 123500 KB Output is correct
77 Correct 4622 ms 516452 KB Output is correct
78 Correct 2625 ms 347428 KB Output is correct
79 Correct 3065 ms 404396 KB Output is correct
80 Correct 4680 ms 594776 KB Output is correct
81 Correct 2799 ms 362644 KB Output is correct
82 Correct 3738 ms 486260 KB Output is correct
83 Correct 4741 ms 621532 KB Output is correct
84 Correct 2515 ms 326492 KB Output is correct
85 Correct 4297 ms 546644 KB Output is correct
86 Correct 4132 ms 516708 KB Output is correct
87 Correct 2707 ms 370052 KB Output is correct
88 Correct 4827 ms 562952 KB Output is correct
89 Correct 4839 ms 563720 KB Output is correct
90 Correct 4670 ms 564048 KB Output is correct