oj.uz

Submission #143518

# Submission time Handle Problem Language Result Execution time Memory
143518 2019-08-14T13:04:12 Z icypiggy Rectangles (IOI19_rect) C++14
72 / 100
 2433 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];
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

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++) {
                      ~^~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 548 ms 611160 KB Output is correct
2 Correct 558 ms 611432 KB Output is correct
3 Correct 550 ms 611508 KB Output is correct
4 Correct 555 ms 611368 KB Output is correct
5 Correct 545 ms 611220 KB Output is correct
6 Correct 558 ms 611336 KB Output is correct
7 Correct 551 ms 611320 KB Output is correct
8 Correct 551 ms 611192 KB Output is correct
9 Correct 596 ms 611448 KB Output is correct
10 Correct 547 ms 611320 KB Output is correct
11 Correct 547 ms 611340 KB Output is correct
12 Correct 566 ms 611244 KB Output is correct
13 Correct 546 ms 611252 KB Output is correct
14 Correct 552 ms 611260 KB Output is correct
15 Correct 548 ms 611236 KB Output is correct
16 Correct 547 ms 611192 KB Output is correct
17 Correct 548 ms 611172 KB Output is correct
18 Correct 552 ms 611264 KB Output is correct
19 Correct 552 ms 611320 KB Output is correct
20 Correct 545 ms 611052 KB Output is correct
21 Correct 561 ms 611320 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 548 ms 611160 KB Output is correct
2 Correct 558 ms 611432 KB Output is correct
3 Correct 550 ms 611508 KB Output is correct
4 Correct 555 ms 611368 KB Output is correct
5 Correct 545 ms 611220 KB Output is correct
6 Correct 558 ms 611336 KB Output is correct
7 Correct 551 ms 611320 KB Output is correct
8 Correct 551 ms 611192 KB Output is correct
9 Correct 596 ms 611448 KB Output is correct
10 Correct 547 ms 611320 KB Output is correct
11 Correct 547 ms 611340 KB Output is correct
12 Correct 566 ms 611244 KB Output is correct
13 Correct 546 ms 611252 KB Output is correct
14 Correct 552 ms 611260 KB Output is correct
15 Correct 548 ms 611236 KB Output is correct
16 Correct 547 ms 611192 KB Output is correct
17 Correct 555 ms 612044 KB Output is correct
18 Correct 550 ms 612088 KB Output is correct
19 Correct 556 ms 612188 KB Output is correct
20 Correct 565 ms 611784 KB Output is correct
21 Correct 555 ms 612076 KB Output is correct
22 Correct 553 ms 612088 KB Output is correct
23 Correct 559 ms 612036 KB Output is correct
24 Correct 558 ms 611772 KB Output is correct
25 Correct 548 ms 611172 KB Output is correct
26 Correct 552 ms 611264 KB Output is correct
27 Correct 552 ms 611320 KB Output is correct
28 Correct 545 ms 611052 KB Output is correct
29 Correct 561 ms 611320 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 548 ms 611160 KB Output is correct
2 Correct 558 ms 611432 KB Output is correct
3 Correct 550 ms 611508 KB Output is correct
4 Correct 555 ms 611368 KB Output is correct
5 Correct 545 ms 611220 KB Output is correct
6 Correct 558 ms 611336 KB Output is correct
7 Correct 551 ms 611320 KB Output is correct
8 Correct 551 ms 611192 KB Output is correct
9 Correct 596 ms 611448 KB Output is correct
10 Correct 547 ms 611320 KB Output is correct
11 Correct 547 ms 611340 KB Output is correct
12 Correct 566 ms 611244 KB Output is correct
13 Correct 546 ms 611252 KB Output is correct
14 Correct 552 ms 611260 KB Output is correct
15 Correct 548 ms 611236 KB Output is correct
16 Correct 547 ms 611192 KB Output is correct
17 Correct 555 ms 612044 KB Output is correct
18 Correct 550 ms 612088 KB Output is correct
19 Correct 556 ms 612188 KB Output is correct
20 Correct 565 ms 611784 KB Output is correct
21 Correct 555 ms 612076 KB Output is correct
22 Correct 553 ms 612088 KB Output is correct
23 Correct 559 ms 612036 KB Output is correct
24 Correct 558 ms 611772 KB Output is correct
25 Correct 562 ms 616116 KB Output is correct
26 Correct 587 ms 616056 KB Output is correct
27 Correct 569 ms 616160 KB Output is correct
28 Correct 561 ms 614020 KB Output is correct
29 Correct 581 ms 615156 KB Output is correct
30 Correct 596 ms 615276 KB Output is correct
31 Correct 579 ms 615020 KB Output is correct
32 Correct 572 ms 614968 KB Output is correct
33 Correct 548 ms 611172 KB Output is correct
34 Correct 552 ms 611264 KB Output is correct
35 Correct 552 ms 611320 KB Output is correct
36 Correct 545 ms 611052 KB Output is correct
37 Correct 561 ms 611320 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 548 ms 611160 KB Output is correct
2 Correct 558 ms 611432 KB Output is correct
3 Correct 550 ms 611508 KB Output is correct
4 Correct 555 ms 611368 KB Output is correct
5 Correct 545 ms 611220 KB Output is correct
6 Correct 558 ms 611336 KB Output is correct
7 Correct 551 ms 611320 KB Output is correct
8 Correct 551 ms 611192 KB Output is correct
9 Correct 596 ms 611448 KB Output is correct
10 Correct 547 ms 611320 KB Output is correct
11 Correct 547 ms 611340 KB Output is correct
12 Correct 566 ms 611244 KB Output is correct
13 Correct 546 ms 611252 KB Output is correct
14 Correct 552 ms 611260 KB Output is correct
15 Correct 548 ms 611236 KB Output is correct
16 Correct 547 ms 611192 KB Output is correct
17 Correct 555 ms 612044 KB Output is correct
18 Correct 550 ms 612088 KB Output is correct
19 Correct 556 ms 612188 KB Output is correct
20 Correct 565 ms 611784 KB Output is correct
21 Correct 555 ms 612076 KB Output is correct
22 Correct 553 ms 612088 KB Output is correct
23 Correct 559 ms 612036 KB Output is correct
24 Correct 558 ms 611772 KB Output is correct
25 Correct 562 ms 616116 KB Output is correct
26 Correct 587 ms 616056 KB Output is correct
27 Correct 569 ms 616160 KB Output is correct
28 Correct 561 ms 614020 KB Output is correct
29 Correct 581 ms 615156 KB Output is correct
30 Correct 596 ms 615276 KB Output is correct
31 Correct 579 ms 615020 KB Output is correct
32 Correct 572 ms 614968 KB Output is correct
33 Correct 741 ms 649048 KB Output is correct
34 Correct 690 ms 639944 KB Output is correct
35 Correct 732 ms 639548 KB Output is correct
36 Correct 647 ms 630380 KB Output is correct
37 Correct 850 ms 663844 KB Output is correct
38 Correct 855 ms 663728 KB Output is correct
39 Correct 863 ms 663904 KB Output is correct
40 Correct 817 ms 660500 KB Output is correct
41 Correct 701 ms 634844 KB Output is correct
42 Correct 741 ms 639648 KB Output is correct
43 Correct 883 ms 654460 KB Output is correct
44 Correct 895 ms 654748 KB Output is correct
45 Correct 734 ms 634332 KB Output is correct
46 Correct 763 ms 632980 KB Output is correct
47 Correct 879 ms 650964 KB Output is correct
48 Correct 946 ms 651020 KB Output is correct
49 Correct 548 ms 611172 KB Output is correct
50 Correct 552 ms 611264 KB Output is correct
51 Correct 552 ms 611320 KB Output is correct
52 Correct 545 ms 611052 KB Output is correct
53 Correct 561 ms 611320 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 555 ms 611680 KB Output is correct
2 Correct 550 ms 611848 KB Output is correct
3 Correct 561 ms 611376 KB Output is correct
4 Correct 553 ms 611276 KB Output is correct
5 Correct 568 ms 611608 KB Output is correct
6 Correct 555 ms 611540 KB Output is correct
7 Correct 593 ms 611736 KB Output is correct
8 Correct 556 ms 611644 KB Output is correct
9 Correct 550 ms 611448 KB Output is correct
10 Correct 564 ms 611320 KB Output is correct
11 Correct 612 ms 611384 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 553 ms 611164 KB Output is correct
2 Correct 1411 ms 734004 KB Output is correct
3 Correct 2420 ms 875848 KB Output is correct
4 Correct 2433 ms 877316 KB Output is correct
5 Correct 2394 ms 877332 KB Output is correct
6 Correct 817 ms 635616 KB Output is correct
7 Correct 1091 ms 657400 KB Output is correct
8 Correct 1129 ms 660452 KB Output is correct
9 Correct 548 ms 611172 KB Output is correct
10 Correct 552 ms 611264 KB Output is correct
11 Correct 552 ms 611320 KB Output is correct
12 Correct 545 ms 611052 KB Output is correct
13 Correct 561 ms 611320 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 548 ms 611160 KB Output is correct
2 Correct 558 ms 611432 KB Output is correct
3 Correct 550 ms 611508 KB Output is correct
4 Correct 555 ms 611368 KB Output is correct
5 Correct 545 ms 611220 KB Output is correct
6 Correct 558 ms 611336 KB Output is correct
7 Correct 551 ms 611320 KB Output is correct
8 Correct 551 ms 611192 KB Output is correct
9 Correct 596 ms 611448 KB Output is correct
10 Correct 547 ms 611320 KB Output is correct
11 Correct 547 ms 611340 KB Output is correct
12 Correct 566 ms 611244 KB Output is correct
13 Correct 546 ms 611252 KB Output is correct
14 Correct 552 ms 611260 KB Output is correct
15 Correct 548 ms 611236 KB Output is correct
16 Correct 547 ms 611192 KB Output is correct
17 Correct 555 ms 612044 KB Output is correct
18 Correct 550 ms 612088 KB Output is correct
19 Correct 556 ms 612188 KB Output is correct
20 Correct 565 ms 611784 KB Output is correct
21 Correct 555 ms 612076 KB Output is correct
22 Correct 553 ms 612088 KB Output is correct
23 Correct 559 ms 612036 KB Output is correct
24 Correct 558 ms 611772 KB Output is correct
25 Correct 562 ms 616116 KB Output is correct
26 Correct 587 ms 616056 KB Output is correct
27 Correct 569 ms 616160 KB Output is correct
28 Correct 561 ms 614020 KB Output is correct
29 Correct 581 ms 615156 KB Output is correct
30 Correct 596 ms 615276 KB Output is correct
31 Correct 579 ms 615020 KB Output is correct
32 Correct 572 ms 614968 KB Output is correct
33 Correct 741 ms 649048 KB Output is correct
34 Correct 690 ms 639944 KB Output is correct
35 Correct 732 ms 639548 KB Output is correct
36 Correct 647 ms 630380 KB Output is correct
37 Correct 850 ms 663844 KB Output is correct
38 Correct 855 ms 663728 KB Output is correct
39 Correct 863 ms 663904 KB Output is correct
40 Correct 817 ms 660500 KB Output is correct
41 Correct 701 ms 634844 KB Output is correct
42 Correct 741 ms 639648 KB Output is correct
43 Correct 883 ms 654460 KB Output is correct
44 Correct 895 ms 654748 KB Output is correct
45 Correct 734 ms 634332 KB Output is correct
46 Correct 763 ms 632980 KB Output is correct
47 Correct 879 ms 650964 KB Output is correct
48 Correct 946 ms 651020 KB Output is correct
49 Correct 555 ms 611680 KB Output is correct
50 Correct 550 ms 611848 KB Output is correct
51 Correct 561 ms 611376 KB Output is correct
52 Correct 553 ms 611276 KB Output is correct
53 Correct 568 ms 611608 KB Output is correct
54 Correct 555 ms 611540 KB Output is correct
55 Correct 593 ms 611736 KB Output is correct
56 Correct 556 ms 611644 KB Output is correct
57 Correct 550 ms 611448 KB Output is correct
58 Correct 564 ms 611320 KB Output is correct
59 Correct 612 ms 611384 KB Output is correct
60 Correct 553 ms 611164 KB Output is correct
61 Correct 1411 ms 734004 KB Output is correct
62 Correct 2420 ms 875848 KB Output is correct
63 Correct 2433 ms 877316 KB Output is correct
64 Correct 2394 ms 877332 KB Output is correct
65 Correct 817 ms 635616 KB Output is correct
66 Correct 1091 ms 657400 KB Output is correct
67 Correct 1129 ms 660452 KB Output is correct
68 Runtime error 1916 ms 1048580 KB Execution killed with signal 9 (could be triggered by violating memory limits)
69 Halted 0 ms 0 KB -