oj.uz

답안 #285661

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
285661 2020-08-29T11:41:59 Z MKopchev Rectangles (IOI19_rect) C++14
100 / 100
 4457 ms 571980 KB 
#include "rect.h"
#include<bits/stdc++.h>
using namespace std;

const int nmax=2500+42,ST=1<<13,ADD=1<<12;

int bigger_up[nmax][nmax],bigger_down[nmax][nmax],bigger_right[nmax][nmax],bigger_left[nmax][nmax];

int tree_up[nmax][ST];

int WANTED_AT_LEAST,WANTED_AT_MOST;

void build_up(int id,int l,int r)
{
    for(int i=ST-1;i>=ADD;i--)
    {
        int where=i-ADD;
        if(where<r)tree_up[id][i]=bigger_up[id][where];
    }

    for(int i=ADD-1;i>=1;i--)
    {
        tree_up[id][i]=max(tree_up[id][i*2],tree_up[id][i*2+1]);
    }
}

int query_up(int id,int node,int l,int r,int lq,int rq)
{
    lq=lq+ADD;
    rq=rq+ADD;

    while(lq<=rq)
    {
        if(tree_up[id][lq]>=WANTED_AT_LEAST)return 1;
        if(tree_up[id][rq]>=WANTED_AT_LEAST)return 1;

        lq=(lq+1)/2;
        rq=(rq-1)/2;
    }
    return 0;
}


int tree_down[nmax][ST];

void build_down(int id,int l,int r)
{
    for(int i=ST-1;i>=ADD;i--)
    {
        int where=i-ADD;
        if(where<r)tree_down[id][i]=bigger_down[id][where];
        else tree_down[id][i]=1e9;
    }

    for(int i=ADD-1;i>=1;i--)
    {
        tree_down[id][i]=min(tree_down[id][i*2],tree_down[id][i*2+1]);
    }
}

int query_down(int id,int node,int l,int r,int lq,int rq)
{
    lq=lq+ADD;
    rq=rq+ADD;

    while(lq<=rq)
    {
        if(tree_down[id][lq]<=WANTED_AT_MOST)return 1;
        if(tree_down[id][rq]<=WANTED_AT_MOST)return 1;

        lq=(lq+1)/2;
        rq=(rq-1)/2;
    }
    return 0;
}




int tree_left[nmax][ST];

void build_left(int id,int l,int r)
{
    for(int i=ST-1;i>=ADD;i--)
    {
        int where=i-ADD;
        if(where<r)tree_left[id][i]=bigger_left[where][id];
    }

    for(int i=ADD-1;i>=1;i--)
    {
        tree_left[id][i]=max(tree_left[id][i*2],tree_left[id][i*2+1]);
    }
}

int query_left(int id,int node,int l,int r,int lq,int rq)
{
    lq=lq+ADD;
    rq=rq+ADD;

    while(lq<=rq)
    {
        if(tree_left[id][lq]>=WANTED_AT_LEAST)return 1;
        if(tree_left[id][rq]>=WANTED_AT_LEAST)return 1;

        lq=(lq+1)/2;
        rq=(rq-1)/2;
    }
    return 0;
}



int tree_right[nmax][ST];

void build_right(int id,int l,int r)
{
    for(int i=ST-1;i>=ADD;i--)
    {
        int where=i-ADD;
        if(where<r)tree_right[id][i]=bigger_right[where][id];
        else tree_right[id][i]=1e9;
    }

    for(int i=ADD-1;i>=1;i--)
    {
        tree_right[id][i]=min(tree_right[id][i*2],tree_right[id][i*2+1]);
    }
}

int query_right(int id,int node,int l,int r,int lq,int rq)
{
    lq=lq+ADD;
    rq=rq+ADD;

    while(lq<=rq)
    {
        if(tree_right[id][lq]<=WANTED_AT_MOST)return 1;
        if(tree_right[id][rq]<=WANTED_AT_MOST)return 1;

        lq=(lq+1)/2;
        rq=(rq-1)/2;
    }
    return 0;
}



stack<int> active,idle;

int pointer=0;

struct rect
{
    int x1,y1,x2,y2;
};

rect to_test[nmax*nmax];

bool cmp(rect a,rect b)
{
    if(a.x1!=b.x1)return a.x1<b.x1;
    if(a.y1!=b.y1)return a.y1<b.y1;
    if(a.x2!=b.x2)return a.x2<b.x2;
    return a.y2<b.y2;
}

bool eq(rect a,rect b)
{
    return a.x1==b.x1&&a.y1==b.y1&&a.x2==b.x2&&a.y2==b.y2;
}

int n,m;

bool test(rect a)
{
    //cout<<"to test "<<a.x1<<" "<<a.y1<<" "<<a.x2<<" "<<a.y2<<endl;

    WANTED_AT_LEAST=a.x1;

    if(query_up(a.x2+1,1,0,m-1,a.y1,a.y2))return 0;

    WANTED_AT_MOST=a.x2;

    if(query_down(a.x1-1,1,0,m-1,a.y1,a.y2))return 0;

    WANTED_AT_LEAST=a.y1;

    if(query_left(a.y2+1,1,0,n-1,a.x1,a.x2))return 0;

    WANTED_AT_MOST=a.y2;

    if(query_right(a.y1-1,1,0,n-1,a.x1,a.x2))return 0;

    return 1;
}

vector< vector<int> > inp;

void eval(int type)//1=> bigger, 0=> bigger or equal
{
    n=inp.size();
	m=inp[0].size();

	for(int i=0;i<n;i++)
    {
        active=idle;

        for(int j=0;j<m;j++)
        {
            while(active.size()&&inp[i][active.top()]+type<=inp[i][j])active.pop();

            if(active.size())bigger_left[i][j]=active.top();
            else bigger_left[i][j]=-1;

            active.push(j);
        }
    }

    for(int i=0;i<n;i++)
    {
        active=idle;

        for(int j=m-1;j>=0;j--)
        {
            while(active.size()&&inp[i][active.top()]+type<=inp[i][j])active.pop();

            if(active.size())bigger_right[i][j]=active.top();
            else bigger_right[i][j]=m;

            active.push(j);
        }
    }

    for(int j=0;j<m;j++)
    {
        active=idle;

        for(int i=0;i<n;i++)
        {
            while(active.size()&&inp[active.top()][j]+type<=inp[i][j])active.pop();

            if(active.size())bigger_up[i][j]=active.top();
            else bigger_up[i][j]=-1;

            active.push(i);
        }
    }

    for(int j=0;j<m;j++)
    {
        active=idle;

        for(int i=n-1;i>=0;i--)
        {
            while(active.size()&&inp[active.top()][j]+type<=inp[i][j])active.pop();

            if(active.size())bigger_down[i][j]=active.top();
            else bigger_down[i][j]=n;

            active.push(i);
        }
    }
}

long long count_rectangles(std::vector<std::vector<int> > a)
{
    inp=a;

    int n=inp.size();
	int m=inp[0].size();

    eval(0);
    /*
    for(int i=0;i<n;i++)
        for(int j=0;j<m;j++)
        {
            cout<<i<<" "<<j<<" -> "<<bigger_up[i][j]<<" "<<bigger_right[i][j]<<" "<<bigger_down[i][j]<<" "<<bigger_left[i][j]<<endl;
        }
    */

    pointer=0;

    for(int i=1;i<n-1;i++)
        for(int j=1;j<m-1;j++)
        {
            rect cur;

            cur.x1=bigger_up[i][j]+1;
            cur.y1=bigger_left[i][j]+1;
            cur.x2=bigger_down[i][j]-1;
            cur.y2=bigger_right[i][j]-1;

            //cout<<i<<" "<<j<<" -> "<<cur.x1<<" "<<cur.y1<<" "<<cur.x2<<" "<<cur.y2<<endl;

            if(1<=cur.x1&&cur.x2<=n-2&&1<=cur.y1&&cur.y2<=m-2)
            {
                pointer++;

                to_test[pointer]=cur;
            }
        }

    sort(to_test+1,to_test+pointer+1,cmp);

    eval(1);

    for(int i=0;i<n;i++)
    {
        build_up(i,0,m-1);
        build_down(i,0,m-1);
    }

    for(int j=0;j<m;j++)
    {
        build_right(j,0,n-1);
        build_left(j,0,n-1);
    }

    int outp=0;

    for(int i=1;i<=pointer;i++)
    {
        if(eq(to_test[i-1],to_test[i]))continue;

        outp+=test(to_test[i]);
    }

    return outp;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 4 ms 3968 KB Output is correct
3 Correct 4 ms 3968 KB Output is correct
4 Correct 4 ms 3968 KB Output is correct
5 Correct 4 ms 3968 KB Output is correct
6 Correct 4 ms 3968 KB Output is correct
7 Correct 3 ms 3148 KB Output is correct
8 Correct 4 ms 2816 KB Output is correct
9 Correct 4 ms 3968 KB Output is correct
10 Correct 4 ms 3968 KB Output is correct
11 Correct 4 ms 3968 KB Output is correct
12 Correct 4 ms 3968 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 1152 KB Output is correct
15 Correct 1 ms 1536 KB Output is correct
16 Correct 1 ms 768 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 640 KB Output is correct
19 Correct 4 ms 3968 KB Output is correct
20 Correct 3 ms 3200 KB Output is correct
21 Correct 1 ms 1152 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 4 ms 3968 KB Output is correct
3 Correct 4 ms 3968 KB Output is correct
4 Correct 4 ms 3968 KB Output is correct
5 Correct 4 ms 3968 KB Output is correct
6 Correct 4 ms 3968 KB Output is correct
7 Correct 3 ms 3148 KB Output is correct
8 Correct 4 ms 2816 KB Output is correct
9 Correct 4 ms 3968 KB Output is correct
10 Correct 4 ms 3968 KB Output is correct
11 Correct 4 ms 3968 KB Output is correct
12 Correct 4 ms 3968 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 1152 KB Output is correct
15 Correct 1 ms 1536 KB Output is correct
16 Correct 1 ms 768 KB Output is correct
17 Correct 11 ms 10240 KB Output is correct
18 Correct 11 ms 10240 KB Output is correct
19 Correct 10 ms 10240 KB Output is correct
20 Correct 10 ms 10240 KB Output is correct
21 Correct 11 ms 10112 KB Output is correct
22 Correct 11 ms 10240 KB Output is correct
23 Correct 11 ms 10240 KB Output is correct
24 Correct 8 ms 8064 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 640 KB Output is correct
27 Correct 4 ms 3968 KB Output is correct
28 Correct 3 ms 3200 KB Output is correct
29 Correct 1 ms 1152 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 4 ms 3968 KB Output is correct
3 Correct 4 ms 3968 KB Output is correct
4 Correct 4 ms 3968 KB Output is correct
5 Correct 4 ms 3968 KB Output is correct
6 Correct 4 ms 3968 KB Output is correct
7 Correct 3 ms 3148 KB Output is correct
8 Correct 4 ms 2816 KB Output is correct
9 Correct 4 ms 3968 KB Output is correct
10 Correct 4 ms 3968 KB Output is correct
11 Correct 4 ms 3968 KB Output is correct
12 Correct 4 ms 3968 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 1152 KB Output is correct
15 Correct 1 ms 1536 KB Output is correct
16 Correct 1 ms 768 KB Output is correct
17 Correct 11 ms 10240 KB Output is correct
18 Correct 11 ms 10240 KB Output is correct
19 Correct 10 ms 10240 KB Output is correct
20 Correct 10 ms 10240 KB Output is correct
21 Correct 11 ms 10112 KB Output is correct
22 Correct 11 ms 10240 KB Output is correct
23 Correct 11 ms 10240 KB Output is correct
24 Correct 8 ms 8064 KB Output is correct
25 Correct 36 ms 26108 KB Output is correct
26 Correct 33 ms 26104 KB Output is correct
27 Correct 33 ms 26104 KB Output is correct
28 Correct 32 ms 25976 KB Output is correct
29 Correct 34 ms 26112 KB Output is correct
30 Correct 36 ms 26104 KB Output is correct
31 Correct 39 ms 26104 KB Output is correct
32 Correct 39 ms 25856 KB Output is correct
33 Correct 1 ms 512 KB Output is correct
34 Correct 1 ms 640 KB Output is correct
35 Correct 4 ms 3968 KB Output is correct
36 Correct 3 ms 3200 KB Output is correct
37 Correct 1 ms 1152 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 4 ms 3968 KB Output is correct
3 Correct 4 ms 3968 KB Output is correct
4 Correct 4 ms 3968 KB Output is correct
5 Correct 4 ms 3968 KB Output is correct
6 Correct 4 ms 3968 KB Output is correct
7 Correct 3 ms 3148 KB Output is correct
8 Correct 4 ms 2816 KB Output is correct
9 Correct 4 ms 3968 KB Output is correct
10 Correct 4 ms 3968 KB Output is correct
11 Correct 4 ms 3968 KB Output is correct
12 Correct 4 ms 3968 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 1152 KB Output is correct
15 Correct 1 ms 1536 KB Output is correct
16 Correct 1 ms 768 KB Output is correct
17 Correct 11 ms 10240 KB Output is correct
18 Correct 11 ms 10240 KB Output is correct
19 Correct 10 ms 10240 KB Output is correct
20 Correct 10 ms 10240 KB Output is correct
21 Correct 11 ms 10112 KB Output is correct
22 Correct 11 ms 10240 KB Output is correct
23 Correct 11 ms 10240 KB Output is correct
24 Correct 8 ms 8064 KB Output is correct
25 Correct 36 ms 26108 KB Output is correct
26 Correct 33 ms 26104 KB Output is correct
27 Correct 33 ms 26104 KB Output is correct
28 Correct 32 ms 25976 KB Output is correct
29 Correct 34 ms 26112 KB Output is correct
30 Correct 36 ms 26104 KB Output is correct
31 Correct 39 ms 26104 KB Output is correct
32 Correct 39 ms 25856 KB Output is correct
33 Correct 176 ms 98040 KB Output is correct
34 Correct 141 ms 98040 KB Output is correct
35 Correct 146 ms 98040 KB Output is correct
36 Correct 148 ms 98040 KB Output is correct
37 Correct 274 ms 105720 KB Output is correct
38 Correct 271 ms 105592 KB Output is correct
39 Correct 270 ms 105744 KB Output is correct
40 Correct 262 ms 101116 KB Output is correct
41 Correct 196 ms 101880 KB Output is correct
42 Correct 219 ms 103288 KB Output is correct
43 Correct 274 ms 105464 KB Output is correct
44 Correct 274 ms 105464 KB Output is correct
45 Correct 175 ms 76792 KB Output is correct
46 Correct 147 ms 71108 KB Output is correct
47 Correct 269 ms 105336 KB Output is correct
48 Correct 284 ms 105464 KB Output is correct
49 Correct 1 ms 512 KB Output is correct
50 Correct 1 ms 640 KB Output is correct
51 Correct 4 ms 3968 KB Output is correct
52 Correct 3 ms 3200 KB Output is correct
53 Correct 1 ms 1152 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 122 ms 131064 KB Output is correct
2 Correct 107 ms 111608 KB Output is correct
3 Correct 148 ms 131064 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 124 ms 131064 KB Output is correct
6 Correct 122 ms 131064 KB Output is correct
7 Correct 126 ms 131064 KB Output is correct
8 Correct 123 ms 131064 KB Output is correct
9 Correct 128 ms 131064 KB Output is correct
10 Correct 122 ms 130808 KB Output is correct
11 Correct 125 ms 130936 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1536 KB Output is correct
2 Correct 1102 ms 310052 KB Output is correct
3 Correct 2293 ms 520952 KB Output is correct
4 Correct 2323 ms 522872 KB Output is correct
5 Correct 2348 ms 523004 KB Output is correct
6 Correct 789 ms 300284 KB Output is correct
7 Correct 1368 ms 460408 KB Output is correct
8 Correct 1441 ms 474160 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 640 KB Output is correct
11 Correct 4 ms 3968 KB Output is correct
12 Correct 3 ms 3200 KB Output is correct
13 Correct 1 ms 1152 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 4 ms 3968 KB Output is correct
3 Correct 4 ms 3968 KB Output is correct
4 Correct 4 ms 3968 KB Output is correct
5 Correct 4 ms 3968 KB Output is correct
6 Correct 4 ms 3968 KB Output is correct
7 Correct 3 ms 3148 KB Output is correct
8 Correct 4 ms 2816 KB Output is correct
9 Correct 4 ms 3968 KB Output is correct
10 Correct 4 ms 3968 KB Output is correct
11 Correct 4 ms 3968 KB Output is correct
12 Correct 4 ms 3968 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 1152 KB Output is correct
15 Correct 1 ms 1536 KB Output is correct
16 Correct 1 ms 768 KB Output is correct
17 Correct 11 ms 10240 KB Output is correct
18 Correct 11 ms 10240 KB Output is correct
19 Correct 10 ms 10240 KB Output is correct
20 Correct 10 ms 10240 KB Output is correct
21 Correct 11 ms 10112 KB Output is correct
22 Correct 11 ms 10240 KB Output is correct
23 Correct 11 ms 10240 KB Output is correct
24 Correct 8 ms 8064 KB Output is correct
25 Correct 36 ms 26108 KB Output is correct
26 Correct 33 ms 26104 KB Output is correct
27 Correct 33 ms 26104 KB Output is correct
28 Correct 32 ms 25976 KB Output is correct
29 Correct 34 ms 26112 KB Output is correct
30 Correct 36 ms 26104 KB Output is correct
31 Correct 39 ms 26104 KB Output is correct
32 Correct 39 ms 25856 KB Output is correct
33 Correct 176 ms 98040 KB Output is correct
34 Correct 141 ms 98040 KB Output is correct
35 Correct 146 ms 98040 KB Output is correct
36 Correct 148 ms 98040 KB Output is correct
37 Correct 274 ms 105720 KB Output is correct
38 Correct 271 ms 105592 KB Output is correct
39 Correct 270 ms 105744 KB Output is correct
40 Correct 262 ms 101116 KB Output is correct
41 Correct 196 ms 101880 KB Output is correct
42 Correct 219 ms 103288 KB Output is correct
43 Correct 274 ms 105464 KB Output is correct
44 Correct 274 ms 105464 KB Output is correct
45 Correct 175 ms 76792 KB Output is correct
46 Correct 147 ms 71108 KB Output is correct
47 Correct 269 ms 105336 KB Output is correct
48 Correct 284 ms 105464 KB Output is correct
49 Correct 122 ms 131064 KB Output is correct
50 Correct 107 ms 111608 KB Output is correct
51 Correct 148 ms 131064 KB Output is correct
52 Correct 1 ms 640 KB Output is correct
53 Correct 124 ms 131064 KB Output is correct
54 Correct 122 ms 131064 KB Output is correct
55 Correct 126 ms 131064 KB Output is correct
56 Correct 123 ms 131064 KB Output is correct
57 Correct 128 ms 131064 KB Output is correct
58 Correct 122 ms 130808 KB Output is correct
59 Correct 125 ms 130936 KB Output is correct
60 Correct 2 ms 1536 KB Output is correct
61 Correct 1102 ms 310052 KB Output is correct
62 Correct 2293 ms 520952 KB Output is correct
63 Correct 2323 ms 522872 KB Output is correct
64 Correct 2348 ms 523004 KB Output is correct
65 Correct 789 ms 300284 KB Output is correct
66 Correct 1368 ms 460408 KB Output is correct
67 Correct 1441 ms 474160 KB Output is correct
68 Correct 1660 ms 474356 KB Output is correct
69 Correct 1697 ms 474236 KB Output is correct
70 Correct 1651 ms 474156 KB Output is correct
71 Correct 1631 ms 474156 KB Output is correct
72 Correct 4457 ms 571852 KB Output is correct
73 Correct 2105 ms 392568 KB Output is correct
74 Correct 2129 ms 442488 KB Output is correct
75 Correct 3611 ms 570872 KB Output is correct
76 Correct 2184 ms 392804 KB Output is correct
77 Correct 2688 ms 506780 KB Output is correct
78 Correct 3634 ms 571024 KB Output is correct
79 Correct 2117 ms 392356 KB Output is correct
80 Correct 3518 ms 570264 KB Output is correct
81 Correct 3384 ms 558840 KB Output is correct
82 Correct 2503 ms 432528 KB Output is correct
83 Correct 4457 ms 571632 KB Output is correct
84 Correct 4421 ms 571980 KB Output is correct
85 Correct 4434 ms 571896 KB Output is correct
86 Correct 1 ms 512 KB Output is correct
87 Correct 1 ms 640 KB Output is correct
88 Correct 4 ms 3968 KB Output is correct
89 Correct 3 ms 3200 KB Output is correct
90 Correct 1 ms 1152 KB Output is correct