oj.uz

Submission #1045938

# Submission time Handle Problem Language Result Execution time Memory
1045938 2024-08-06T08:37:52 Z vjudge1 Rectangles (IOI19_rect) C++17
0 / 100
 1066 ms 701896 KB 
#include "rect.h"
#include<bits/stdc++.h>
using namespace std;
set<int>pos[2501][2501],pos2[2501][2501],stb[2501][20];
set<int> operator & (const set<int>&a,const set<int>&b){
    set<int>c;
    if(a.size()<b.size()){
        for(auto i:a)
            if(b.count(i))
                c.insert(i);
    } else for(auto i:b)
        if(a.count(i))
            c.insert(i);
    return c;
}
vector<array<int,4>> ops;
int CC;
vector<int>res;
int cnt(int l,int r,int col){
    int x=31-__builtin_clz(r-l+1);
    set<int>k=stb[l][x]&stb[r-(1<<x)+1][x];
    return distance(k.begin(),k.upper_bound(res[CC++]));
}
int calc(int r1,int r2,int beg){
    int col=beg;
    for(int i=20;i--;)
        if(stb[beg][i].count(r2))
            beg+=1<<i;
    return beg;
}
long long count_rectangles(std::vector<std::vector<int> > a) {
    int n=a.size(),m=a[0].size();
    int ans=0;
    for(int i=1;i<n-1;i++){
        stack<int>stk;
        stk.push(m-1);
        for(int j=m-1;j--;){
            while(stk.size()&&a[i][j]>a[i][stk.top()])
                pos[i][j+1].insert(stk.top()-1),stk.pop();
            if(stk.size()){
                pos[i][j+1].insert(stk.top()-1);
                if(a[i][stk.top()]==a[i][j])
                    stk.pop();
            }
            stk.push(j);
            pos[i][j+1].erase(j);
        }
    }
    for(int j=1;j<m-1;j++){
        stack<int>stk;
        stk.push(n-1);
        for(int i=n-1;i--;){
            while(stk.size()&&a[i][j]>a[stk.top()][j])
                pos2[i+1][j].insert(stk.top()-1),stk.pop(); 
            if(stk.size()){
                pos2[i+1][j].insert(stk.top()-1);
                if(a[stk.top()][j]==a[i][j])
                    stk.pop();
            }
            stk.push(i);
            pos2[i+1][j].erase(i);
        }
    }
    for(int j=1;j<m-1;j++)
        for(int i=1;i<n-1;i++)
            for(auto x:pos2[i][j])
                ops.push_back({i,x,j,CC++});
    res.resize(CC);
    CC=0;
    sort(ops.begin(),ops.end());
    int currr=0;
    for(auto[r1,r2,col,id]:ops){
        if(r1-currr) {
            currr=r1;
            for(int i=1;i<m-1;i++)
                stb[i][0]=pos2[r1][i];
            for(int j=1;j<20;j++) for(int i=1;i+(1<<j)<m;i++)
                stb[i][j]=stb[i][j-1]&stb[i+(1<<j-1)][j-1];
        }
        res[id]=calc(r1,r2,col);
    }
    
    ops.clear();
    for(int col=1;col<m-1;col++){
        for(int i=1;i<n-1;i++)
            stb[i][0]=pos[i][col];
        for(int j=1;j<20;j++) for(int i=1;i+(1<<j)<n;i++)
            stb[i][j]=stb[i][j-1]&stb[i+(1<<j-1)][j-1];
        for(int row1=1;row1<n-1;row1++)
            for(auto row2:pos2[row1][col])
                ans+=cnt(row1,row2,col);
    }
    return ans;
}

Compilation message

rect.cpp: In function 'int calc(int, int, int)':
rect.cpp:25:9: warning: unused variable 'col' [-Wunused-variable]
   25 |     int col=beg;
      |         ^~~
rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:78:50: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   78 |                 stb[i][j]=stb[i][j-1]&stb[i+(1<<j-1)][j-1];
      |                                                 ~^~
rect.cpp:88:46: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   88 |             stb[i][j]=stb[i][j-1]&stb[i+(1<<j-1)][j-1];
      |                                             ~^~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 590136 KB Output is correct
2 Correct 175 ms 590196 KB Output is correct
3 Correct 159 ms 590420 KB Output is correct
4 Correct 158 ms 590404 KB Output is correct
5 Correct 160 ms 590120 KB Output is correct
6 Incorrect 180 ms 590164 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 590136 KB Output is correct
2 Correct 175 ms 590196 KB Output is correct
3 Correct 159 ms 590420 KB Output is correct
4 Correct 158 ms 590404 KB Output is correct
5 Correct 160 ms 590120 KB Output is correct
6 Incorrect 180 ms 590164 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 590136 KB Output is correct
2 Correct 175 ms 590196 KB Output is correct
3 Correct 159 ms 590420 KB Output is correct
4 Correct 158 ms 590404 KB Output is correct
5 Correct 160 ms 590120 KB Output is correct
6 Incorrect 180 ms 590164 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 590136 KB Output is correct
2 Correct 175 ms 590196 KB Output is correct
3 Correct 159 ms 590420 KB Output is correct
4 Correct 158 ms 590404 KB Output is correct
5 Correct 160 ms 590120 KB Output is correct
6 Incorrect 180 ms 590164 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 160 ms 591700 KB Output is correct
2 Correct 167 ms 591440 KB Output is correct
3 Correct 179 ms 590164 KB Output is correct
4 Correct 155 ms 590164 KB Output is correct
5 Incorrect 157 ms 590436 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 161 ms 590164 KB Output is correct
2 Incorrect 1066 ms 701896 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 158 ms 590136 KB Output is correct
2 Correct 175 ms 590196 KB Output is correct
3 Correct 159 ms 590420 KB Output is correct
4 Correct 158 ms 590404 KB Output is correct
5 Correct 160 ms 590120 KB Output is correct
6 Incorrect 180 ms 590164 KB Output isn't correct
7 Halted 0 ms 0 KB -