oj.uz

Submission #571437

# Submission time Handle Problem Language Result Execution time Memory
571437 2022-06-02T08:25:17 Z azberjibiou Rectangles (IOI19_rect) C++17
100 / 100
 4368 ms 578432 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 solvl(short idx, short s1, short e1, short s2)
{
    if(s2==s1)  return (typ ? seg[idx]<=lim : seg[idx]>=lim);
    while(s2<=e1)
    {
        short mid=(s1+e1)/2;
        if(s2<=mid+1)
        {
            if(typ ? seg[2*idx+1]>lim : seg[2*idx+1]<lim)   return false;
            idx*=2; e1=mid;
        }
        else    idx=2*idx+1, s1=mid+1;
    }
    return true;
}
bool solvr(short idx, short s1, short e1, short e2)
{
    if(e2==e1)  return (typ ? seg[idx]<=lim : seg[idx]>=lim);
    while(e2>=s1)
    {
        short mid=(s1+e1)/2;
        if(e2>=mid)
        {
            if(typ ? seg[2*idx]>lim : seg[2*idx]<lim)   return false;
            idx=2*idx+1, s1=mid+1;
        }
        else    idx*=2, e1=mid;
    }
    return true;
}
bool solv(short s1, short e1, short s2, short e2)
{
    short idx=1;
    while(s1!=e1)
    {
        short mid=(s1+e1)/2;
        if(e2<=mid) e1=mid, idx*=2;
        else if(s2>mid) s1=mid+1, idx=2*idx+1;
        else    break;
    }
    if(s1==e1)  return (typ ? seg[idx]<=lim : seg[idx]>=lim);
    short mid=(s1+e1)/2;
    return (solvl(2*idx, s1, mid, s2) && solvr(2*idx+1, mid+1, e1, 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(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(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(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(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:218:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<rect>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  218 |     for(int i=0;i<v.size();i++)
      |                 ~^~~~~~~~~
rect.cpp:229:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<rect>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  229 |     for(int i=0;i<v.size();i++) ans+=Chk[i];
      |                 ~^~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1200 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 1 ms 816 KB Output is correct
9 Correct 1 ms 1236 KB Output is correct
10 Correct 2 ms 1236 KB Output is correct
11 Correct 1 ms 1236 KB Output is correct
12 Correct 2 ms 1196 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 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 552 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 680 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1200 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 1 ms 816 KB Output is correct
9 Correct 1 ms 1236 KB Output is correct
10 Correct 2 ms 1236 KB Output is correct
11 Correct 1 ms 1236 KB Output is correct
12 Correct 2 ms 1196 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 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 552 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 680 KB Output is correct
22 Correct 4 ms 2772 KB Output is correct
23 Correct 4 ms 2772 KB Output is correct
24 Correct 4 ms 2788 KB Output is correct
25 Correct 5 ms 2516 KB Output is correct
26 Correct 6 ms 2776 KB Output is correct
27 Correct 5 ms 2772 KB Output is correct
28 Correct 5 ms 2744 KB Output is correct
29 Correct 3 ms 2388 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1200 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 1 ms 816 KB Output is correct
9 Correct 1 ms 1236 KB Output is correct
10 Correct 2 ms 1236 KB Output is correct
11 Correct 1 ms 1236 KB Output is correct
12 Correct 2 ms 1196 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 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 4 ms 2788 KB Output is correct
20 Correct 5 ms 2516 KB Output is correct
21 Correct 6 ms 2776 KB Output is correct
22 Correct 5 ms 2772 KB Output is correct
23 Correct 5 ms 2744 KB Output is correct
24 Correct 3 ms 2388 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 552 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 680 KB Output is correct
30 Correct 19 ms 8240 KB Output is correct
31 Correct 20 ms 8204 KB Output is correct
32 Correct 18 ms 8228 KB Output is correct
33 Correct 18 ms 7064 KB Output is correct
34 Correct 24 ms 8360 KB Output is correct
35 Correct 27 ms 8556 KB Output is correct
36 Correct 23 ms 8352 KB Output is correct
37 Correct 23 ms 8412 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1200 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 1 ms 816 KB Output is correct
9 Correct 1 ms 1236 KB Output is correct
10 Correct 2 ms 1236 KB Output is correct
11 Correct 1 ms 1236 KB Output is correct
12 Correct 2 ms 1196 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 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 4 ms 2788 KB Output is correct
20 Correct 5 ms 2516 KB Output is correct
21 Correct 6 ms 2776 KB Output is correct
22 Correct 5 ms 2772 KB Output is correct
23 Correct 5 ms 2744 KB Output is correct
24 Correct 3 ms 2388 KB Output is correct
25 Correct 19 ms 8240 KB Output is correct
26 Correct 20 ms 8204 KB Output is correct
27 Correct 18 ms 8228 KB Output is correct
28 Correct 18 ms 7064 KB Output is correct
29 Correct 24 ms 8360 KB Output is correct
30 Correct 27 ms 8556 KB Output is correct
31 Correct 23 ms 8352 KB Output is correct
32 Correct 23 ms 8412 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 552 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 680 KB Output is correct
38 Correct 82 ms 24524 KB Output is correct
39 Correct 78 ms 24528 KB Output is correct
40 Correct 87 ms 24556 KB Output is correct
41 Correct 85 ms 24648 KB Output is correct
42 Correct 247 ms 57364 KB Output is correct
43 Correct 240 ms 57272 KB Output is correct
44 Correct 252 ms 57408 KB Output is correct
45 Correct 234 ms 54112 KB Output is correct
46 Correct 189 ms 43168 KB Output is correct
47 Correct 213 ms 44684 KB Output is correct
48 Correct 303 ms 64604 KB Output is correct
49 Correct 327 ms 64856 KB Output is correct
50 Correct 159 ms 40428 KB Output is correct
51 Correct 157 ms 33264 KB Output is correct
52 Correct 284 ms 57824 KB Output is correct
53 Correct 288 ms 58480 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1108 KB Output is correct
2 Correct 3 ms 948 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 3 ms 776 KB Output is correct
6 Correct 2 ms 852 KB Output is correct
7 Correct 2 ms 852 KB Output is correct
8 Correct 2 ms 824 KB Output is correct
9 Correct 3 ms 852 KB Output is correct
10 Correct 2 ms 564 KB Output is correct
11 Correct 1 ms 596 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 552 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 680 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1089 ms 148196 KB Output is correct
8 Correct 2455 ms 305784 KB Output is correct
9 Correct 2438 ms 315336 KB Output is correct
10 Correct 2375 ms 309568 KB Output is correct
11 Correct 420 ms 62628 KB Output is correct
12 Correct 908 ms 123136 KB Output is correct
13 Correct 934 ms 126004 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 1200 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 1 ms 816 KB Output is correct
9 Correct 1 ms 1236 KB Output is correct
10 Correct 2 ms 1236 KB Output is correct
11 Correct 1 ms 1236 KB Output is correct
12 Correct 2 ms 1196 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 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 4 ms 2788 KB Output is correct
20 Correct 5 ms 2516 KB Output is correct
21 Correct 6 ms 2776 KB Output is correct
22 Correct 5 ms 2772 KB Output is correct
23 Correct 5 ms 2744 KB Output is correct
24 Correct 3 ms 2388 KB Output is correct
25 Correct 19 ms 8240 KB Output is correct
26 Correct 20 ms 8204 KB Output is correct
27 Correct 18 ms 8228 KB Output is correct
28 Correct 18 ms 7064 KB Output is correct
29 Correct 24 ms 8360 KB Output is correct
30 Correct 27 ms 8556 KB Output is correct
31 Correct 23 ms 8352 KB Output is correct
32 Correct 23 ms 8412 KB Output is correct
33 Correct 82 ms 24524 KB Output is correct
34 Correct 78 ms 24528 KB Output is correct
35 Correct 87 ms 24556 KB Output is correct
36 Correct 85 ms 24648 KB Output is correct
37 Correct 247 ms 57364 KB Output is correct
38 Correct 240 ms 57272 KB Output is correct
39 Correct 252 ms 57408 KB Output is correct
40 Correct 234 ms 54112 KB Output is correct
41 Correct 189 ms 43168 KB Output is correct
42 Correct 213 ms 44684 KB Output is correct
43 Correct 303 ms 64604 KB Output is correct
44 Correct 327 ms 64856 KB Output is correct
45 Correct 159 ms 40428 KB Output is correct
46 Correct 157 ms 33264 KB Output is correct
47 Correct 284 ms 57824 KB Output is correct
48 Correct 288 ms 58480 KB Output is correct
49 Correct 3 ms 1108 KB Output is correct
50 Correct 3 ms 948 KB Output is correct
51 Correct 1 ms 724 KB Output is correct
52 Correct 1 ms 596 KB Output is correct
53 Correct 3 ms 776 KB Output is correct
54 Correct 2 ms 852 KB Output is correct
55 Correct 2 ms 852 KB Output is correct
56 Correct 2 ms 824 KB Output is correct
57 Correct 3 ms 852 KB Output is correct
58 Correct 2 ms 564 KB Output is correct
59 Correct 1 ms 596 KB Output is correct
60 Correct 1 ms 724 KB Output is correct
61 Correct 1089 ms 148196 KB Output is correct
62 Correct 2455 ms 305784 KB Output is correct
63 Correct 2438 ms 315336 KB Output is correct
64 Correct 2375 ms 309568 KB Output is correct
65 Correct 420 ms 62628 KB Output is correct
66 Correct 908 ms 123136 KB Output is correct
67 Correct 934 ms 126004 KB Output is correct
68 Correct 1 ms 468 KB Output is correct
69 Correct 1 ms 552 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 680 KB Output is correct
73 Correct 1044 ms 125144 KB Output is correct
74 Correct 1028 ms 125248 KB Output is correct
75 Correct 1076 ms 125240 KB Output is correct
76 Correct 1060 ms 125244 KB Output is correct
77 Correct 3336 ms 518116 KB Output is correct
78 Correct 2495 ms 334056 KB Output is correct
79 Correct 2659 ms 383248 KB Output is correct
80 Correct 4236 ms 572600 KB Output is correct
81 Correct 2513 ms 336388 KB Output is correct
82 Correct 3437 ms 451952 KB Output is correct
83 Correct 4368 ms 578432 KB Output is correct
84 Correct 2374 ms 306988 KB Output is correct
85 Correct 4049 ms 502848 KB Output is correct
86 Correct 3939 ms 474252 KB Output is correct
87 Correct 2015 ms 343580 KB Output is correct
88 Correct 3422 ms 520552 KB Output is correct
89 Correct 3426 ms 519596 KB Output is correct
90 Correct 3446 ms 519096 KB Output is correct