#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
const int n_max = 2600; // make it not lag
vector<pair<int,bool>> h_seg[n_max][n_max];
vector<pair<int,bool>> v_seg[n_max][n_max];
vector<pair<int,int>> h_map[n_max][n_max];
vector<pair<int,int>> v_map[n_max][n_max];
int get_lower(set<int> &s, int val) {
auto it = s.lower_bound(val);
it--;
return *it;
}
vector<pair<int,int>> gen_h_seg(vector<int> &x, int r) {
vector<pair<int,int>> ret;
vector<pair<int,int>> y;
for(int i=0; i<x.size(); i++) {
y.push_back(make_pair(-x[i],i));
}
sort(y.begin(), y.end());
set<int> s;
s.insert(-2e8);
s.insert(2e8);
for(int i=0; i<y.size(); i++) {
int z = get_lower(s,y[i].second);
if(z!=-2e8 && y[i].second!=z+1)
h_seg[r][z+1].push_back(make_pair(y[i].second-1, true));
z = *(s.upper_bound(y[i].second));
if((i+1==y.size() || (y[i].first!=y[i+1].first || z<y[i+1].second)) && z!=2e8 && y[i].second+1!=z) {
h_seg[r][y[i].second+1].push_back(make_pair(z-1,true));
}
s.insert(y[i].second);
}
return ret;
}
struct fenwick {
int BIT[n_max], a[n_max], n;
fenwick(): n(0) {}
void reset() {
for(int i=0; i<n_max; i++) {
BIT[i] = 0;
a[i] = 0;
}
}
void update(int x, int delta)
{
for(; x <= n; x += x&-x)
BIT[x] += delta;
}
int query(int x) {
int sum = 0;
for(; x > 0; x -= x&-x)
sum += BIT[x];
return sum;
}
int query(int x, int y) {
return query(y)-query(x-1);
}
};
vector<pair<int,int>> gen_v_seg(vector<int> &x, int r) {
vector<pair<int,int>> ret;
vector<pair<int,int>> y;
for(int i=0; i<x.size(); i++) {
y.push_back(make_pair(-x[i],i));
}
sort(y.begin(), y.end());
set<int> s;
s.insert(-2e8);
s.insert(2e8);
for(int i=0; i<y.size(); i++) {
int z = get_lower(s,y[i].second);
if(z!=-2e8 && y[i].second!=z+1) {
v_seg[r][z+1].push_back(make_pair(y[i].second-1,true));
}
z = *(s.upper_bound(y[i].second));
if((i+1==y.size() || (y[i].first!=y[i+1].first || z<y[i+1].second)) && z!=2e8 && y[i].second+1!=z) {
v_seg[r][y[i].second+1].push_back(make_pair(z-1,true));
}
s.insert(y[i].second);
}
return ret;
}
long long count_rectangles(vector<vector<int>> a) {
for(int i=0; i<a.size(); i++) {
gen_h_seg(a[i],i);
}
for(int i=0; i<a[0].size(); i++) {
vector<int> tmp;
for(int j=0; j<a.size(); j++) {
tmp.push_back(a[j][i]);
}
gen_v_seg(tmp, i);
}
for(int i=0; i<a.size(); i++) {
for(int j=0; j<a[0].size(); j++) {
sort(h_seg[i][j].begin(), h_seg[i][j].end());
sort(v_seg[j][i].begin(), v_seg[j][i].end());
/*cout << i << " " << j << ": ";
for(auto &p: h_seg[i][j]) {
cout << p.first << " ";
}
cout << ",";
for(auto &p: v_seg[j][i]) {
cout << p.first << " ";
}
cout << "\n";*/
}
}
for(int i=0; i<a.size(); i++) {
for(int j=0; j<a[0].size(); j++) {
for(auto &p: h_seg[i][j]) {
if(p.second) {
int down = i;
while(down+1!=a.size()) {
auto it = lower_bound(h_seg[down+1][j].begin(), h_seg[down+1][j].end(), make_pair(p.first,true));
if(it==h_seg[down+1][j].end()) break;
//cout << it->first << "??" << it->second << "\n";
if(*it==make_pair(p.first, true)) {
it->second = false;
down++;
} else {
break;
}
}
h_map[i][j].push_back(make_pair(p.first, down));
}
}
}
}
for(int i=0; i<a[0].size(); i++) {
for(int j=0; j<a.size(); j++) {
for(auto &p: v_seg[i][j]) {
if(p.second) {
int down = i;
while(down+1!=a[0].size()) {
auto it = lower_bound(v_seg[down+1][j].begin(), v_seg[down+1][j].end(), make_pair(p.first,true));
if(it==v_seg[down+1][j].end()) break;
if(*it==make_pair(p.first, true)) {
it->second = false;
down++;
} else {
break;
}
}
v_map[i][j].push_back(make_pair(p.first, down));
//cout << "i,j,p.first,down: " << i << " " << j << " " << p.first << " " << down << "\n";
}
}
}
}
fenwick f[a.size()];
for(int i=0; i<a.size(); i++) {
f[i].n = a[0].size()+10;
f[i].reset();
}
long long ans = 0;
for(int i=0; i<a[0].size(); i++) {
vector<pair<int,int>> updates;
for(int j=0; j<a.size(); j++) {
for(auto p: h_map[j][i]) {
for(int k=j; k<=p.second; k++) {
f[k].update(p.first, 1);
//cout << "updated: " << k << "-th fenwick, position " << p.first << "increased by 1.\n";
updates.push_back(make_pair(k, p.first));
}
}
for(auto p: v_map[i][j]) {
int tmp = f[p.first].query(i,p.second);
ans += tmp;
//cout << "ans changed by " << tmp << " queried: " << p.first << " " << i << " " << p.second << "\n";
}
}
for(auto p: updates) {
f[p.first].update(p.second, -1);
}
}
//cout << "ans: " << ans << "\n";
return ans;
}
Compilation message
rect.cpp: In function 'std::vector<std::pair<int, int> > gen_h_seg(std::vector<int>&, int)':
rect.cpp:19:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0; i<x.size(); i++) {
~^~~~~~~~~
rect.cpp:26:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0; i<y.size(); i++) {
~^~~~~~~~~
rect.cpp:31:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if((i+1==y.size() || (y[i].first!=y[i+1].first || z<y[i+1].second)) && z!=2e8 && y[i].second+1!=z) {
~~~^~~~~~~~~~
rect.cpp: In function 'std::vector<std::pair<int, int> > gen_v_seg(std::vector<int>&, int)':
rect.cpp:65:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0; i<x.size(); i++) {
~^~~~~~~~~
rect.cpp:72:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0; i<y.size(); i++) {
~^~~~~~~~~
rect.cpp:78:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if((i+1==y.size() || (y[i].first!=y[i+1].first || z<y[i+1].second)) && z!=2e8 && y[i].second+1!=z) {
~~~^~~~~~~~~~
rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:87:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0; i<a.size(); i++) {
~^~~~~~~~~
rect.cpp:90:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0; i<a[0].size(); i++) {
~^~~~~~~~~~~~
rect.cpp:92:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j=0; j<a.size(); j++) {
~^~~~~~~~~
rect.cpp:97:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0; i<a.size(); i++) {
~^~~~~~~~~
rect.cpp:98:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j=0; j<a[0].size(); j++) {
~^~~~~~~~~~~~
rect.cpp:112:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0; i<a.size(); i++) {
~^~~~~~~~~
rect.cpp:113:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j=0; j<a[0].size(); j++) {
~^~~~~~~~~~~~
rect.cpp:118:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(down+1!=a.size()) {
~~~~~~^~~~~~~~~~
rect.cpp:134:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0; i<a[0].size(); i++) {
~^~~~~~~~~~~~
rect.cpp:135:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j=0; j<a.size(); j++) {
~^~~~~~~~~
rect.cpp:140:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(down+1!=a[0].size()) {
~~~~~~^~~~~~~~~~~~~
rect.cpp:157:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0; i<a.size(); i++) {
~^~~~~~~~~
rect.cpp:163:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0; i<a[0].size(); i++) {
~^~~~~~~~~~~~
rect.cpp:165:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int j=0; j<a.size(); j++) {
~^~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
637 ms |
635600 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
637 ms |
635600 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
637 ms |
635600 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
637 ms |
635600 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
583 ms |
635912 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
594 ms |
635504 KB |
Output is correct |
2 |
Correct |
3282 ms |
776760 KB |
Output is correct |
3 |
Execution timed out |
5054 ms |
798268 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
637 ms |
635600 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |