oj.uz

Submission #143522

# Submission time Handle Problem Language Result Execution time Memory
143522 2019-08-14T13:14:01 Z icypiggy Rectangles (IOI19_rect) C++14
72 / 100
 2413 ms 1048580 KB 
#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];

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) {
                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));
                }
            }
            h_seg[i][j].clear();
        }
    }
    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";
                }
            }
            v_seg[i][j].clear();
        }
    }
    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].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

rect.cpp: In function 'void gen_h_seg(std::vector<int>&, int)':
rect.cpp:16: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:65: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:86:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<a.size(); i++) {
                  ~^~~~~~~~~
rect.cpp:89:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<a[0].size(); i++) {
                  ~^~~~~~~~~~~~
rect.cpp:91:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<a.size(); j++) {
                      ~^~~~~~~~~
rect.cpp:96:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<a.size(); i++) {
                  ~^~~~~~~~~
rect.cpp:97:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<a[0].size(); j++) {
                      ~^~~~~~~~~~~~
rect.cpp:102:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<a.size(); i++) {
                  ~^~~~~~~~~
rect.cpp:103:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<a[0].size(); j++) {
                      ~^~~~~~~~~~~~
rect.cpp:108:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     while(down+1!=a.size()) {
                           ~~~~~~^~~~~~~~~~
rect.cpp:124:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<a[0].size(); i++) {
                  ~^~~~~~~~~~~~
rect.cpp:125:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<a.size(); j++) {
                      ~^~~~~~~~~
rect.cpp:130:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     while(down+1!=a[0].size()) {
                           ~~~~~~^~~~~~~~~~~~~
rect.cpp:158: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++) {
                      ~^~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 548 ms 611168 KB Output is correct
2 Correct 547 ms 611440 KB Output is correct
3 Correct 586 ms 611496 KB Output is correct
4 Correct 560 ms 611488 KB Output is correct
5 Correct 549 ms 611056 KB Output is correct
6 Correct 546 ms 611516 KB Output is correct
7 Correct 552 ms 611424 KB Output is correct
8 Correct 553 ms 611300 KB Output is correct
9 Correct 554 ms 611580 KB Output is correct
10 Correct 551 ms 611564 KB Output is correct
11 Correct 549 ms 611600 KB Output is correct
12 Correct 550 ms 611504 KB Output is correct
13 Correct 550 ms 611060 KB Output is correct
14 Correct 542 ms 611120 KB Output is correct
15 Correct 552 ms 611104 KB Output is correct
16 Correct 550 ms 611096 KB Output is correct
17 Correct 551 ms 611200 KB Output is correct
18 Correct 575 ms 611140 KB Output is correct
19 Correct 545 ms 611448 KB Output is correct
20 Correct 552 ms 611176 KB Output is correct
21 Correct 545 ms 611136 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 548 ms 611168 KB Output is correct
2 Correct 547 ms 611440 KB Output is correct
3 Correct 586 ms 611496 KB Output is correct
4 Correct 560 ms 611488 KB Output is correct
5 Correct 549 ms 611056 KB Output is correct
6 Correct 546 ms 611516 KB Output is correct
7 Correct 552 ms 611424 KB Output is correct
8 Correct 553 ms 611300 KB Output is correct
9 Correct 554 ms 611580 KB Output is correct
10 Correct 551 ms 611564 KB Output is correct
11 Correct 549 ms 611600 KB Output is correct
12 Correct 550 ms 611504 KB Output is correct
13 Correct 550 ms 611060 KB Output is correct
14 Correct 542 ms 611120 KB Output is correct
15 Correct 552 ms 611104 KB Output is correct
16 Correct 550 ms 611096 KB Output is correct
17 Correct 552 ms 612556 KB Output is correct
18 Correct 555 ms 612588 KB Output is correct
19 Correct 555 ms 612596 KB Output is correct
20 Correct 560 ms 612216 KB Output is correct
21 Correct 553 ms 612308 KB Output is correct
22 Correct 550 ms 612404 KB Output is correct
23 Correct 550 ms 612300 KB Output is correct
24 Correct 553 ms 612116 KB Output is correct
25 Correct 551 ms 611200 KB Output is correct
26 Correct 575 ms 611140 KB Output is correct
27 Correct 545 ms 611448 KB Output is correct
28 Correct 552 ms 611176 KB Output is correct
29 Correct 545 ms 611136 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 548 ms 611168 KB Output is correct
2 Correct 547 ms 611440 KB Output is correct
3 Correct 586 ms 611496 KB Output is correct
4 Correct 560 ms 611488 KB Output is correct
5 Correct 549 ms 611056 KB Output is correct
6 Correct 546 ms 611516 KB Output is correct
7 Correct 552 ms 611424 KB Output is correct
8 Correct 553 ms 611300 KB Output is correct
9 Correct 554 ms 611580 KB Output is correct
10 Correct 551 ms 611564 KB Output is correct
11 Correct 549 ms 611600 KB Output is correct
12 Correct 550 ms 611504 KB Output is correct
13 Correct 550 ms 611060 KB Output is correct
14 Correct 542 ms 611120 KB Output is correct
15 Correct 552 ms 611104 KB Output is correct
16 Correct 550 ms 611096 KB Output is correct
17 Correct 552 ms 612556 KB Output is correct
18 Correct 555 ms 612588 KB Output is correct
19 Correct 555 ms 612596 KB Output is correct
20 Correct 560 ms 612216 KB Output is correct
21 Correct 553 ms 612308 KB Output is correct
22 Correct 550 ms 612404 KB Output is correct
23 Correct 550 ms 612300 KB Output is correct
24 Correct 553 ms 612116 KB Output is correct
25 Correct 571 ms 617260 KB Output is correct
26 Correct 581 ms 617104 KB Output is correct
27 Correct 577 ms 617216 KB Output is correct
28 Correct 565 ms 615172 KB Output is correct
29 Correct 576 ms 616168 KB Output is correct
30 Correct 590 ms 616164 KB Output is correct
31 Correct 568 ms 615964 KB Output is correct
32 Correct 574 ms 615876 KB Output is correct
33 Correct 551 ms 611200 KB Output is correct
34 Correct 575 ms 611140 KB Output is correct
35 Correct 545 ms 611448 KB Output is correct
36 Correct 552 ms 611176 KB Output is correct
37 Correct 545 ms 611136 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 548 ms 611168 KB Output is correct
2 Correct 547 ms 611440 KB Output is correct
3 Correct 586 ms 611496 KB Output is correct
4 Correct 560 ms 611488 KB Output is correct
5 Correct 549 ms 611056 KB Output is correct
6 Correct 546 ms 611516 KB Output is correct
7 Correct 552 ms 611424 KB Output is correct
8 Correct 553 ms 611300 KB Output is correct
9 Correct 554 ms 611580 KB Output is correct
10 Correct 551 ms 611564 KB Output is correct
11 Correct 549 ms 611600 KB Output is correct
12 Correct 550 ms 611504 KB Output is correct
13 Correct 550 ms 611060 KB Output is correct
14 Correct 542 ms 611120 KB Output is correct
15 Correct 552 ms 611104 KB Output is correct
16 Correct 550 ms 611096 KB Output is correct
17 Correct 552 ms 612556 KB Output is correct
18 Correct 555 ms 612588 KB Output is correct
19 Correct 555 ms 612596 KB Output is correct
20 Correct 560 ms 612216 KB Output is correct
21 Correct 553 ms 612308 KB Output is correct
22 Correct 550 ms 612404 KB Output is correct
23 Correct 550 ms 612300 KB Output is correct
24 Correct 553 ms 612116 KB Output is correct
25 Correct 571 ms 617260 KB Output is correct
26 Correct 581 ms 617104 KB Output is correct
27 Correct 577 ms 617216 KB Output is correct
28 Correct 565 ms 615172 KB Output is correct
29 Correct 576 ms 616168 KB Output is correct
30 Correct 590 ms 616164 KB Output is correct
31 Correct 568 ms 615964 KB Output is correct
32 Correct 574 ms 615876 KB Output is correct
33 Correct 738 ms 652808 KB Output is correct
34 Correct 683 ms 643064 KB Output is correct
35 Correct 720 ms 643036 KB Output is correct
36 Correct 653 ms 633540 KB Output is correct
37 Correct 881 ms 667608 KB Output is correct
38 Correct 865 ms 667528 KB Output is correct
39 Correct 860 ms 667604 KB Output is correct
40 Correct 844 ms 663752 KB Output is correct
41 Correct 694 ms 637148 KB Output is correct
42 Correct 765 ms 641960 KB Output is correct
43 Correct 893 ms 656700 KB Output is correct
44 Correct 904 ms 657016 KB Output is correct
45 Correct 735 ms 637540 KB Output is correct
46 Correct 725 ms 633956 KB Output is correct
47 Correct 903 ms 653032 KB Output is correct
48 Correct 887 ms 653256 KB Output is correct
49 Correct 551 ms 611200 KB Output is correct
50 Correct 575 ms 611140 KB Output is correct
51 Correct 545 ms 611448 KB Output is correct
52 Correct 552 ms 611176 KB Output is correct
53 Correct 545 ms 611136 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 558 ms 611632 KB Output is correct
2 Correct 554 ms 611704 KB Output is correct
3 Correct 592 ms 611228 KB Output is correct
4 Correct 549 ms 611096 KB Output is correct
5 Correct 554 ms 611704 KB Output is correct
6 Correct 555 ms 611500 KB Output is correct
7 Correct 557 ms 611576 KB Output is correct
8 Correct 577 ms 611576 KB Output is correct
9 Correct 551 ms 611512 KB Output is correct
10 Correct 554 ms 611268 KB Output is correct
11 Correct 555 ms 611508 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 554 ms 611296 KB Output is correct
2 Correct 1434 ms 733972 KB Output is correct
3 Correct 2401 ms 875980 KB Output is correct
4 Correct 2413 ms 877400 KB Output is correct
5 Correct 2413 ms 877332 KB Output is correct
6 Correct 803 ms 635428 KB Output is correct
7 Correct 1102 ms 657400 KB Output is correct
8 Correct 1157 ms 660444 KB Output is correct
9 Correct 551 ms 611200 KB Output is correct
10 Correct 575 ms 611140 KB Output is correct
11 Correct 545 ms 611448 KB Output is correct
12 Correct 552 ms 611176 KB Output is correct
13 Correct 545 ms 611136 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 548 ms 611168 KB Output is correct
2 Correct 547 ms 611440 KB Output is correct
3 Correct 586 ms 611496 KB Output is correct
4 Correct 560 ms 611488 KB Output is correct
5 Correct 549 ms 611056 KB Output is correct
6 Correct 546 ms 611516 KB Output is correct
7 Correct 552 ms 611424 KB Output is correct
8 Correct 553 ms 611300 KB Output is correct
9 Correct 554 ms 611580 KB Output is correct
10 Correct 551 ms 611564 KB Output is correct
11 Correct 549 ms 611600 KB Output is correct
12 Correct 550 ms 611504 KB Output is correct
13 Correct 550 ms 611060 KB Output is correct
14 Correct 542 ms 611120 KB Output is correct
15 Correct 552 ms 611104 KB Output is correct
16 Correct 550 ms 611096 KB Output is correct
17 Correct 552 ms 612556 KB Output is correct
18 Correct 555 ms 612588 KB Output is correct
19 Correct 555 ms 612596 KB Output is correct
20 Correct 560 ms 612216 KB Output is correct
21 Correct 553 ms 612308 KB Output is correct
22 Correct 550 ms 612404 KB Output is correct
23 Correct 550 ms 612300 KB Output is correct
24 Correct 553 ms 612116 KB Output is correct
25 Correct 571 ms 617260 KB Output is correct
26 Correct 581 ms 617104 KB Output is correct
27 Correct 577 ms 617216 KB Output is correct
28 Correct 565 ms 615172 KB Output is correct
29 Correct 576 ms 616168 KB Output is correct
30 Correct 590 ms 616164 KB Output is correct
31 Correct 568 ms 615964 KB Output is correct
32 Correct 574 ms 615876 KB Output is correct
33 Correct 738 ms 652808 KB Output is correct
34 Correct 683 ms 643064 KB Output is correct
35 Correct 720 ms 643036 KB Output is correct
36 Correct 653 ms 633540 KB Output is correct
37 Correct 881 ms 667608 KB Output is correct
38 Correct 865 ms 667528 KB Output is correct
39 Correct 860 ms 667604 KB Output is correct
40 Correct 844 ms 663752 KB Output is correct
41 Correct 694 ms 637148 KB Output is correct
42 Correct 765 ms 641960 KB Output is correct
43 Correct 893 ms 656700 KB Output is correct
44 Correct 904 ms 657016 KB Output is correct
45 Correct 735 ms 637540 KB Output is correct
46 Correct 725 ms 633956 KB Output is correct
47 Correct 903 ms 653032 KB Output is correct
48 Correct 887 ms 653256 KB Output is correct
49 Correct 558 ms 611632 KB Output is correct
50 Correct 554 ms 611704 KB Output is correct
51 Correct 592 ms 611228 KB Output is correct
52 Correct 549 ms 611096 KB Output is correct
53 Correct 554 ms 611704 KB Output is correct
54 Correct 555 ms 611500 KB Output is correct
55 Correct 557 ms 611576 KB Output is correct
56 Correct 577 ms 611576 KB Output is correct
57 Correct 551 ms 611512 KB Output is correct
58 Correct 554 ms 611268 KB Output is correct
59 Correct 555 ms 611508 KB Output is correct
60 Correct 554 ms 611296 KB Output is correct
61 Correct 1434 ms 733972 KB Output is correct
62 Correct 2401 ms 875980 KB Output is correct
63 Correct 2413 ms 877400 KB Output is correct
64 Correct 2413 ms 877332 KB Output is correct
65 Correct 803 ms 635428 KB Output is correct
66 Correct 1102 ms 657400 KB Output is correct
67 Correct 1157 ms 660444 KB Output is correct
68 Runtime error 1979 ms 1048580 KB Execution killed with signal 9 (could be triggered by violating memory limits)
69 Halted 0 ms 0 KB -