oj.uz

Submission #143829

# Submission time Handle Problem Language Result Execution time Memory
143829 2019-08-15T09:40:11 Z icypiggy Rectangles (IOI19_rect) C++14
100 / 100
 4585 ms 796824 KB 
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
#include <stack>
#include <assert.h>
using namespace std;
const int n_max = 2550; // make it not lag
vector<pair<int,int>> h_map[n_max][n_max];
vector<pair<int,int>> v_map[n_max][n_max];
//vector<pair<int,int>> v_map2[n_max];
pair<int,int> tmp[n_max][n_max]; // start and end
void update_val(int left, int right, int row) {
    if(tmp[left][right].second != row-1) {
        if(tmp[left][right].second!=-2) {
            for(int i=tmp[left][right].first; i<=tmp[left][right].second; i++) {
                h_map[i][left].push_back(make_pair(tmp[left][right].second, right));
            }
        }
        tmp[left][right] = make_pair(row, row);
    } else {
        tmp[left][right].second++;
    }
}
void update_val2(int left, int right, int row) {
    if(tmp[left][right].second != row-1) {
        if(tmp[left][right].second!=-2) {
            for(int i=tmp[left][right].first; i<=tmp[left][right].second; i++) {

                v_map[left][i].push_back(make_pair(right, tmp[left][right].second));
            }
        }
        tmp[left][right] = make_pair(row, row);
    } else {
        tmp[left][right].second++;
    }
}
stack<int> s;
void gen_h_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) {
                update_val(s.top()+1, i-1, r);

            }
            int t = x[s.top()];
            while(!s.empty() && x[s.top()]==t) {
                s.pop();
            }
        }
        if(!s.empty() && s.top()!=i-1) {
            update_val(s.top()+1, i-1, r);
        }
        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;
    }

};
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) {
                update_val2(s.top()+1, i-1, r);
            }
            int t = x[s.top()];
            while(!s.empty() && x[s.top()]==t) {
                s.pop();
            }
        }
        if(!s.empty() && s.top()!=i-1) {
            update_val2(s.top()+1, i-1, r);
        }
        s.push(i);
    }
    while(!s.empty()) s.pop();
}

long long count_rectangles(vector<vector<int>> a) {
    for(int i=0; i<n_max; i++) {
        for(int j=0; j<n_max; j++) {
            tmp[i][j] = make_pair(-2,-2);
        }
    }
    for(int i=0; i<a.size(); i++) {
        gen_h_seg(a[i],i);
    }
    for(int i=0; i<n_max; i++) {
        for(int j=0; j<=i; j++) {
            update_val(j,i,1e5);
        }
    }
    for(int i=0; i<n_max; i++) {
        for(int j=0; j<n_max; j++) {
            tmp[i][j] = make_pair(-2,-2);
        }
    }
    //cout << "\n";
    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<n_max; i++) {
        for(int j=0; j<=i; j++) {
            update_val2(j,i,1e5);
        }
    }
    fenwick f;
    f.reset();
    long long ans = 0;
    for(int i=0; i<a.size(); i++) {
        for(int j=0; j<a[0].size(); j++) {
            if(v_map[i][j].size()<5 || h_map[i][j].size()<5) {
                for(auto &p: h_map[i][j]) {
                    for(auto &q: v_map[i][j]) {
                        if(p.first>=q.first && p.second<=q.second) {
                            ans++;
                            //cout << i << " " << j << " " << q.first << " " << p.second << "\n";
                        }
                    }
                }
            } else {
                auto it = v_map[i][j].begin();
                sort(h_map[i][j].begin(), h_map[i][j].end());
                for(auto &p: h_map[i][j]) {
                    f.update(p.second, 1);
                }
                sort(v_map[i][j].begin(), v_map[i][j].end());
                for(auto &p: h_map[i][j]) {
                    while(it!=v_map[i][j].end() && it->first<=p.first) {
                        ans+=f.query(it->second);
                        it++;
                    }
                    f.update(p.second, -1);
                }
            }
        }
    }
	assert(ans <= 2*a.size()*a[0].size());
    return ans;
}

Compilation message

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:87: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:125:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<a[0].size(); i++) {
                  ~^~~~~~~~~~~~
rect.cpp:127:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<a.size(); j++) {
                      ~^~~~~~~~~
rect.cpp:140:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<a.size(); i++) {
                  ~^~~~~~~~~
rect.cpp:141:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<a[0].size(); j++) {
                      ~^~~~~~~~~~~~
In file included from rect.cpp:6:0:
rect.cpp:168:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  assert(ans <= 2*a.size()*a[0].size());
         ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 477 ms 356572 KB Output is correct
2 Correct 471 ms 356600 KB Output is correct
3 Correct 474 ms 356732 KB Output is correct
4 Correct 477 ms 356728 KB Output is correct
5 Correct 471 ms 356728 KB Output is correct
6 Correct 474 ms 356728 KB Output is correct
7 Correct 472 ms 356704 KB Output is correct
8 Correct 474 ms 356776 KB Output is correct
9 Correct 475 ms 356600 KB Output is correct
10 Correct 470 ms 356600 KB Output is correct
11 Correct 482 ms 356600 KB Output is correct
12 Correct 476 ms 356728 KB Output is correct
13 Correct 475 ms 356600 KB Output is correct
14 Correct 471 ms 356728 KB Output is correct
15 Correct 497 ms 356828 KB Output is correct
16 Correct 474 ms 356704 KB Output is correct
17 Correct 477 ms 356764 KB Output is correct
18 Correct 476 ms 356600 KB Output is correct
19 Correct 481 ms 356724 KB Output is correct
20 Correct 480 ms 356688 KB Output is correct
21 Correct 481 ms 356668 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 477 ms 356572 KB Output is correct
2 Correct 471 ms 356600 KB Output is correct
3 Correct 474 ms 356732 KB Output is correct
4 Correct 477 ms 356728 KB Output is correct
5 Correct 471 ms 356728 KB Output is correct
6 Correct 474 ms 356728 KB Output is correct
7 Correct 472 ms 356704 KB Output is correct
8 Correct 474 ms 356776 KB Output is correct
9 Correct 475 ms 356600 KB Output is correct
10 Correct 470 ms 356600 KB Output is correct
11 Correct 482 ms 356600 KB Output is correct
12 Correct 476 ms 356728 KB Output is correct
13 Correct 475 ms 356600 KB Output is correct
14 Correct 471 ms 356728 KB Output is correct
15 Correct 497 ms 356828 KB Output is correct
16 Correct 474 ms 356704 KB Output is correct
17 Correct 476 ms 357176 KB Output is correct
18 Correct 486 ms 357096 KB Output is correct
19 Correct 476 ms 357240 KB Output is correct
20 Correct 475 ms 356856 KB Output is correct
21 Correct 516 ms 356984 KB Output is correct
22 Correct 473 ms 356856 KB Output is correct
23 Correct 483 ms 357044 KB Output is correct
24 Correct 484 ms 356676 KB Output is correct
25 Correct 477 ms 356764 KB Output is correct
26 Correct 476 ms 356600 KB Output is correct
27 Correct 481 ms 356724 KB Output is correct
28 Correct 480 ms 356688 KB Output is correct
29 Correct 481 ms 356668 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 477 ms 356572 KB Output is correct
2 Correct 471 ms 356600 KB Output is correct
3 Correct 474 ms 356732 KB Output is correct
4 Correct 477 ms 356728 KB Output is correct
5 Correct 471 ms 356728 KB Output is correct
6 Correct 474 ms 356728 KB Output is correct
7 Correct 472 ms 356704 KB Output is correct
8 Correct 474 ms 356776 KB Output is correct
9 Correct 475 ms 356600 KB Output is correct
10 Correct 470 ms 356600 KB Output is correct
11 Correct 482 ms 356600 KB Output is correct
12 Correct 476 ms 356728 KB Output is correct
13 Correct 475 ms 356600 KB Output is correct
14 Correct 471 ms 356728 KB Output is correct
15 Correct 497 ms 356828 KB Output is correct
16 Correct 474 ms 356704 KB Output is correct
17 Correct 476 ms 357176 KB Output is correct
18 Correct 486 ms 357096 KB Output is correct
19 Correct 476 ms 357240 KB Output is correct
20 Correct 475 ms 356856 KB Output is correct
21 Correct 516 ms 356984 KB Output is correct
22 Correct 473 ms 356856 KB Output is correct
23 Correct 483 ms 357044 KB Output is correct
24 Correct 484 ms 356676 KB Output is correct
25 Correct 486 ms 359496 KB Output is correct
26 Correct 486 ms 359556 KB Output is correct
27 Correct 486 ms 359416 KB Output is correct
28 Correct 480 ms 357752 KB Output is correct
29 Correct 506 ms 358392 KB Output is correct
30 Correct 549 ms 358520 KB Output is correct
31 Correct 493 ms 358264 KB Output is correct
32 Correct 487 ms 358316 KB Output is correct
33 Correct 477 ms 356764 KB Output is correct
34 Correct 476 ms 356600 KB Output is correct
35 Correct 481 ms 356724 KB Output is correct
36 Correct 480 ms 356688 KB Output is correct
37 Correct 481 ms 356668 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 477 ms 356572 KB Output is correct
2 Correct 471 ms 356600 KB Output is correct
3 Correct 474 ms 356732 KB Output is correct
4 Correct 477 ms 356728 KB Output is correct
5 Correct 471 ms 356728 KB Output is correct
6 Correct 474 ms 356728 KB Output is correct
7 Correct 472 ms 356704 KB Output is correct
8 Correct 474 ms 356776 KB Output is correct
9 Correct 475 ms 356600 KB Output is correct
10 Correct 470 ms 356600 KB Output is correct
11 Correct 482 ms 356600 KB Output is correct
12 Correct 476 ms 356728 KB Output is correct
13 Correct 475 ms 356600 KB Output is correct
14 Correct 471 ms 356728 KB Output is correct
15 Correct 497 ms 356828 KB Output is correct
16 Correct 474 ms 356704 KB Output is correct
17 Correct 476 ms 357176 KB Output is correct
18 Correct 486 ms 357096 KB Output is correct
19 Correct 476 ms 357240 KB Output is correct
20 Correct 475 ms 356856 KB Output is correct
21 Correct 516 ms 356984 KB Output is correct
22 Correct 473 ms 356856 KB Output is correct
23 Correct 483 ms 357044 KB Output is correct
24 Correct 484 ms 356676 KB Output is correct
25 Correct 486 ms 359496 KB Output is correct
26 Correct 486 ms 359556 KB Output is correct
27 Correct 486 ms 359416 KB Output is correct
28 Correct 480 ms 357752 KB Output is correct
29 Correct 506 ms 358392 KB Output is correct
30 Correct 549 ms 358520 KB Output is correct
31 Correct 493 ms 358264 KB Output is correct
32 Correct 487 ms 358316 KB Output is correct
33 Correct 561 ms 375904 KB Output is correct
34 Correct 606 ms 371128 KB Output is correct
35 Correct 548 ms 371036 KB Output is correct
36 Correct 589 ms 366400 KB Output is correct
37 Correct 623 ms 391132 KB Output is correct
38 Correct 623 ms 391028 KB Output is correct
39 Correct 654 ms 391160 KB Output is correct
40 Correct 611 ms 388856 KB Output is correct
41 Correct 567 ms 368248 KB Output is correct
42 Correct 595 ms 370812 KB Output is correct
43 Correct 713 ms 378712 KB Output is correct
44 Correct 716 ms 379000 KB Output is correct
45 Correct 598 ms 367736 KB Output is correct
46 Correct 602 ms 367736 KB Output is correct
47 Correct 688 ms 377464 KB Output is correct
48 Correct 695 ms 377592 KB Output is correct
49 Correct 477 ms 356764 KB Output is correct
50 Correct 476 ms 356600 KB Output is correct
51 Correct 481 ms 356724 KB Output is correct
52 Correct 480 ms 356688 KB Output is correct
53 Correct 481 ms 356668 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 533 ms 357024 KB Output is correct
2 Correct 560 ms 357160 KB Output is correct
3 Correct 501 ms 356728 KB Output is correct
4 Correct 476 ms 356800 KB Output is correct
5 Correct 476 ms 356856 KB Output is correct
6 Correct 477 ms 357008 KB Output is correct
7 Correct 481 ms 356988 KB Output is correct
8 Correct 473 ms 356984 KB Output is correct
9 Correct 475 ms 356916 KB Output is correct
10 Correct 481 ms 356728 KB Output is correct
11 Correct 476 ms 356780 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 477 ms 356616 KB Output is correct
2 Correct 1097 ms 424200 KB Output is correct
3 Correct 1895 ms 503344 KB Output is correct
4 Correct 1886 ms 504212 KB Output is correct
5 Correct 1894 ms 504156 KB Output is correct
6 Correct 584 ms 380940 KB Output is correct
7 Correct 714 ms 402800 KB Output is correct
8 Correct 728 ms 406008 KB Output is correct
9 Correct 477 ms 356764 KB Output is correct
10 Correct 476 ms 356600 KB Output is correct
11 Correct 481 ms 356724 KB Output is correct
12 Correct 480 ms 356688 KB Output is correct
13 Correct 481 ms 356668 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 477 ms 356572 KB Output is correct
2 Correct 471 ms 356600 KB Output is correct
3 Correct 474 ms 356732 KB Output is correct
4 Correct 477 ms 356728 KB Output is correct
5 Correct 471 ms 356728 KB Output is correct
6 Correct 474 ms 356728 KB Output is correct
7 Correct 472 ms 356704 KB Output is correct
8 Correct 474 ms 356776 KB Output is correct
9 Correct 475 ms 356600 KB Output is correct
10 Correct 470 ms 356600 KB Output is correct
11 Correct 482 ms 356600 KB Output is correct
12 Correct 476 ms 356728 KB Output is correct
13 Correct 475 ms 356600 KB Output is correct
14 Correct 471 ms 356728 KB Output is correct
15 Correct 497 ms 356828 KB Output is correct
16 Correct 474 ms 356704 KB Output is correct
17 Correct 476 ms 357176 KB Output is correct
18 Correct 486 ms 357096 KB Output is correct
19 Correct 476 ms 357240 KB Output is correct
20 Correct 475 ms 356856 KB Output is correct
21 Correct 516 ms 356984 KB Output is correct
22 Correct 473 ms 356856 KB Output is correct
23 Correct 483 ms 357044 KB Output is correct
24 Correct 484 ms 356676 KB Output is correct
25 Correct 486 ms 359496 KB Output is correct
26 Correct 486 ms 359556 KB Output is correct
27 Correct 486 ms 359416 KB Output is correct
28 Correct 480 ms 357752 KB Output is correct
29 Correct 506 ms 358392 KB Output is correct
30 Correct 549 ms 358520 KB Output is correct
31 Correct 493 ms 358264 KB Output is correct
32 Correct 487 ms 358316 KB Output is correct
33 Correct 561 ms 375904 KB Output is correct
34 Correct 606 ms 371128 KB Output is correct
35 Correct 548 ms 371036 KB Output is correct
36 Correct 589 ms 366400 KB Output is correct
37 Correct 623 ms 391132 KB Output is correct
38 Correct 623 ms 391028 KB Output is correct
39 Correct 654 ms 391160 KB Output is correct
40 Correct 611 ms 388856 KB Output is correct
41 Correct 567 ms 368248 KB Output is correct
42 Correct 595 ms 370812 KB Output is correct
43 Correct 713 ms 378712 KB Output is correct
44 Correct 716 ms 379000 KB Output is correct
45 Correct 598 ms 367736 KB Output is correct
46 Correct 602 ms 367736 KB Output is correct
47 Correct 688 ms 377464 KB Output is correct
48 Correct 695 ms 377592 KB Output is correct
49 Correct 533 ms 357024 KB Output is correct
50 Correct 560 ms 357160 KB Output is correct
51 Correct 501 ms 356728 KB Output is correct
52 Correct 476 ms 356800 KB Output is correct
53 Correct 476 ms 356856 KB Output is correct
54 Correct 477 ms 357008 KB Output is correct
55 Correct 481 ms 356988 KB Output is correct
56 Correct 473 ms 356984 KB Output is correct
57 Correct 475 ms 356916 KB Output is correct
58 Correct 481 ms 356728 KB Output is correct
59 Correct 476 ms 356780 KB Output is correct
60 Correct 477 ms 356616 KB Output is correct
61 Correct 1097 ms 424200 KB Output is correct
62 Correct 1895 ms 503344 KB Output is correct
63 Correct 1886 ms 504212 KB Output is correct
64 Correct 1894 ms 504156 KB Output is correct
65 Correct 584 ms 380940 KB Output is correct
66 Correct 714 ms 402800 KB Output is correct
67 Correct 728 ms 406008 KB Output is correct
68 Correct 2016 ms 601288 KB Output is correct
69 Correct 2247 ms 535264 KB Output is correct
70 Correct 1558 ms 535328 KB Output is correct
71 Correct 1779 ms 469296 KB Output is correct
72 Correct 2975 ms 796740 KB Output is correct
73 Correct 2757 ms 525304 KB Output is correct
74 Correct 2875 ms 535612 KB Output is correct
75 Correct 4440 ms 637820 KB Output is correct
76 Correct 2839 ms 526712 KB Output is correct
77 Correct 3687 ms 583644 KB Output is correct
78 Correct 4585 ms 640204 KB Output is correct
79 Correct 2484 ms 515872 KB Output is correct
80 Correct 4026 ms 623816 KB Output is correct
81 Correct 3895 ms 615544 KB Output is correct
82 Correct 1893 ms 620668 KB Output is correct
83 Correct 3021 ms 796504 KB Output is correct
84 Correct 2990 ms 796740 KB Output is correct
85 Correct 3008 ms 796824 KB Output is correct
86 Correct 477 ms 356764 KB Output is correct
87 Correct 476 ms 356600 KB Output is correct
88 Correct 481 ms 356724 KB Output is correct
89 Correct 480 ms 356688 KB Output is correct
90 Correct 481 ms 356668 KB Output is correct