Submission #143518

#TimeUsernameProblemLanguageResultExecution timeMemory
143518icypiggyRectangles (IOI19_rect)C++14
72 / 100
2433 ms1048580 KiB
#include <iostream> #include <vector> #include <set> #include <algorithm> #include <stack> using namespace std; const int n_max = 2550; // 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; } stack<int> s; void 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); }*/ s.push(0); for(int i=1; i<x.size(); i++) { while(!s.empty() && x[s.top()]<x[i]) { if(s.top()!=i-1) { h_seg[r][s.top()+1].push_back(make_pair(i-1, true)); //cout << r << " " << s.top()+1 << " " << i-1 << "\n"; } int t = x[s.top()]; while(!s.empty() && x[s.top()]==t) { s.pop(); } } if(!s.empty() && s.top()!=i-1) { h_seg[r][s.top()+1].push_back(make_pair(i-1, true)); //cout << r << " " << s.top()+1 << " " << i-1 << "\n"; } s.push(i); } while(!s.empty()) s.pop(); } int fwbit[n_max][n_max]; int fwa[n_max][n_max]; int fw_pt = 0; struct fenwick { int *BIT; int *a; int n; fenwick(): n(n_max) {} void reset() { BIT = fwbit[fw_pt]; a = fwa[fw_pt]; fw_pt++; } 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); } }; void gen_v_seg(vector<int> &x, int r) { s.push(0); for(int i=1; i<x.size(); i++) { while(!s.empty() && x[s.top()]<x[i]) { if(s.top()!=i-1) { v_seg[r][s.top()+1].push_back(make_pair(i-1, true)); //cout << r << " " << s.top()+1 << " " << i-1 << "\n"; } int t = x[s.top()]; while(!s.empty() && x[s.top()]==t) { s.pop(); } } if(!s.empty() && s.top()!=i-1) { v_seg[r][s.top()+1].push_back(make_pair(i-1, true)); //cout << r << " " << s.top()+1 << " " << i-1 << "\n"; } s.push(i); } while(!s.empty()) s.pop(); } 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()); } } 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; 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(v): " << i << " " << j << " " << p.first << " " << down << "\n"; } } } } for(int i=a[0].size()-1; i>=0; i--) { for(int j=a.size()-1; j>=0; j--) { for(auto p: v_map[i][j]) { for(int k=i+1; k<=p.second; k++) { v_map[k][j].push_back(p); //cout << "k,j,p: " << k << " " << j << " " << p.first << " " << p.second << "\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++) { //cout << "coordinate: " << i << " " << j << "\n"; 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 << "undo increment: " << p.first << " " << p.second << "\n"; } } //cout << "ans: " << ans << "\n"; return ans; }

Compilation message (stderr)

rect.cpp: In function 'void gen_h_seg(std::vector<int>&, int)':
rect.cpp:41:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=1; i<x.size(); i++) {
                  ~^~~~~~~~~
rect.cpp: In function 'void gen_v_seg(std::vector<int>&, int)':
rect.cpp:90:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=1; i<x.size(); i++) {
                  ~^~~~~~~~~
rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:111:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<a.size(); i++) {
                  ~^~~~~~~~~
rect.cpp:114:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<a[0].size(); i++) {
                  ~^~~~~~~~~~~~
rect.cpp:116:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<a.size(); j++) {
                      ~^~~~~~~~~
rect.cpp:121:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<a.size(); i++) {
                  ~^~~~~~~~~
rect.cpp:122:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<a[0].size(); j++) {
                      ~^~~~~~~~~~~~
rect.cpp:127:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<a.size(); i++) {
                  ~^~~~~~~~~
rect.cpp:128:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<a[0].size(); j++) {
                      ~^~~~~~~~~~~~
rect.cpp:133:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     while(down+1!=a.size()) {
                           ~~~~~~^~~~~~~~~~
rect.cpp:148:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<a[0].size(); i++) {
                  ~^~~~~~~~~~~~
rect.cpp:149:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<a.size(); j++) {
                      ~^~~~~~~~~
rect.cpp:154:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     while(down+1!=a[0].size()) {
                           ~~~~~~^~~~~~~~~~~~~
rect.cpp:181:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<a.size(); i++) {
                  ~^~~~~~~~~
rect.cpp:187:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<a[0].size(); i++) {
                  ~^~~~~~~~~~~~
rect.cpp:189:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<a.size(); j++) {
                      ~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...