oj.uz

Submission #1045614

# Submission time Handle Problem Language Result Execution time Memory
1045614 2024-08-06T06:26:05 Z vjudge1 Rectangles (IOI19_rect) C++17
0 / 100
 160 ms 588120 KB 
#include "rect.h"
#include<bits/stdc++.h>
using namespace std;
set<int>pos[2501][2501];
set<int>pos2[2501][2501];
bitset<2501>stb[2501][20];
int cnt(int l,int r){
    int x=31-__builtin_clz(r-l+1);
    return (stb[l][x]&stb[r-(1<<x)+1][x]).count();
}
long long count_rectangles(std::vector<std::vector<int> > a) {
    int n=a.size(),m=a[0].size();
    long long 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 col=1;col<m-1;col++){
        for(int i=1;i<n-1;i++){
            stb[i][0].reset();
            for(auto k:pos[i][col])
                stb[i][0][k]=1;
        }
        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);
    }
    return ans;
}

Compilation message

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:52:50: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   52 |                 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 143 ms 587856 KB Output is correct
2 Correct 146 ms 587972 KB Output is correct
3 Correct 150 ms 588116 KB Output is correct
4 Correct 156 ms 588116 KB Output is correct
5 Correct 145 ms 588112 KB Output is correct
6 Incorrect 144 ms 588112 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 587856 KB Output is correct
2 Correct 146 ms 587972 KB Output is correct
3 Correct 150 ms 588116 KB Output is correct
4 Correct 156 ms 588116 KB Output is correct
5 Correct 145 ms 588112 KB Output is correct
6 Incorrect 144 ms 588112 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 587856 KB Output is correct
2 Correct 146 ms 587972 KB Output is correct
3 Correct 150 ms 588116 KB Output is correct
4 Correct 156 ms 588116 KB Output is correct
5 Correct 145 ms 588112 KB Output is correct
6 Incorrect 144 ms 588112 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 587856 KB Output is correct
2 Correct 146 ms 587972 KB Output is correct
3 Correct 150 ms 588116 KB Output is correct
4 Correct 156 ms 588116 KB Output is correct
5 Correct 145 ms 588112 KB Output is correct
6 Incorrect 144 ms 588112 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 151 ms 588096 KB Output is correct
2 Correct 158 ms 588120 KB Output is correct
3 Correct 150 ms 587820 KB Output is correct
4 Correct 160 ms 587896 KB Output is correct
5 Incorrect 151 ms 587936 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 153 ms 587852 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 587856 KB Output is correct
2 Correct 146 ms 587972 KB Output is correct
3 Correct 150 ms 588116 KB Output is correct
4 Correct 156 ms 588116 KB Output is correct
5 Correct 145 ms 588112 KB Output is correct
6 Incorrect 144 ms 588112 KB Output isn't correct
7 Halted 0 ms 0 KB -