oj.uz

Submission #143507

# Submission time Handle Problem Language Result Execution time Memory
143507 2019-08-14T12:06:03 Z icypiggy Rectangles (IOI19_rect) C++14
59 / 100
 5000 ms 799900 KB 
#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]) {
                //cout << i << " " << j << " " << p.first << "!\n";
                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));
                    //cout << "i,j,p.first,down(h): " << i << " " << j << " " << p.first << " " << down << "\n";
                }
            }
        }
    }
    for(int i=0; i<a[0].size(); i++) {
        for(int j=0; j<a.size(); j++) {
            for(auto &p: v_seg[i][j]) {
                //cout << i << " " << j << " " << p.first << "!!!\n";
                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 '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:119:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     while(down+1!=a.size()) {
                           ~~~~~~^~~~~~~~~~
rect.cpp:136:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<a[0].size(); i++) {
                  ~^~~~~~~~~~~~
rect.cpp:137:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<a.size(); j++) {
                      ~^~~~~~~~~
rect.cpp:143:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                     while(down+1!=a[0].size()) {
                           ~~~~~~^~~~~~~~~~~~~
rect.cpp:170:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<a.size(); i++) {
                  ~^~~~~~~~~
rect.cpp:176:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<a[0].size(); i++) {
                  ~^~~~~~~~~~~~
rect.cpp:178: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 576 ms 635720 KB Output is correct
2 Correct 572 ms 636024 KB Output is correct
3 Correct 570 ms 636024 KB Output is correct
4 Correct 577 ms 636232 KB Output is correct
5 Correct 572 ms 635896 KB Output is correct
6 Correct 575 ms 635928 KB Output is correct
7 Correct 578 ms 636108 KB Output is correct
8 Correct 574 ms 635644 KB Output is correct
9 Correct 573 ms 635928 KB Output is correct
10 Correct 571 ms 636024 KB Output is correct
11 Correct 574 ms 636068 KB Output is correct
12 Correct 573 ms 635888 KB Output is correct
13 Correct 601 ms 635384 KB Output is correct
14 Correct 581 ms 635592 KB Output is correct
15 Correct 573 ms 635532 KB Output is correct
16 Correct 585 ms 635456 KB Output is correct
17 Correct 604 ms 635280 KB Output is correct
18 Correct 585 ms 635432 KB Output is correct
19 Correct 575 ms 636024 KB Output is correct
20 Correct 584 ms 635884 KB Output is correct
21 Correct 574 ms 635484 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 576 ms 635720 KB Output is correct
2 Correct 572 ms 636024 KB Output is correct
3 Correct 570 ms 636024 KB Output is correct
4 Correct 577 ms 636232 KB Output is correct
5 Correct 572 ms 635896 KB Output is correct
6 Correct 575 ms 635928 KB Output is correct
7 Correct 578 ms 636108 KB Output is correct
8 Correct 574 ms 635644 KB Output is correct
9 Correct 573 ms 635928 KB Output is correct
10 Correct 571 ms 636024 KB Output is correct
11 Correct 574 ms 636068 KB Output is correct
12 Correct 573 ms 635888 KB Output is correct
13 Correct 601 ms 635384 KB Output is correct
14 Correct 581 ms 635592 KB Output is correct
15 Correct 573 ms 635532 KB Output is correct
16 Correct 585 ms 635456 KB Output is correct
17 Correct 587 ms 637732 KB Output is correct
18 Correct 585 ms 637676 KB Output is correct
19 Correct 605 ms 637744 KB Output is correct
20 Correct 629 ms 637304 KB Output is correct
21 Correct 617 ms 637336 KB Output is correct
22 Correct 629 ms 637404 KB Output is correct
23 Correct 587 ms 637460 KB Output is correct
24 Correct 581 ms 637224 KB Output is correct
25 Correct 604 ms 635280 KB Output is correct
26 Correct 585 ms 635432 KB Output is correct
27 Correct 575 ms 636024 KB Output is correct
28 Correct 584 ms 635884 KB Output is correct
29 Correct 574 ms 635484 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 576 ms 635720 KB Output is correct
2 Correct 572 ms 636024 KB Output is correct
3 Correct 570 ms 636024 KB Output is correct
4 Correct 577 ms 636232 KB Output is correct
5 Correct 572 ms 635896 KB Output is correct
6 Correct 575 ms 635928 KB Output is correct
7 Correct 578 ms 636108 KB Output is correct
8 Correct 574 ms 635644 KB Output is correct
9 Correct 573 ms 635928 KB Output is correct
10 Correct 571 ms 636024 KB Output is correct
11 Correct 574 ms 636068 KB Output is correct
12 Correct 573 ms 635888 KB Output is correct
13 Correct 601 ms 635384 KB Output is correct
14 Correct 581 ms 635592 KB Output is correct
15 Correct 573 ms 635532 KB Output is correct
16 Correct 585 ms 635456 KB Output is correct
17 Correct 587 ms 637732 KB Output is correct
18 Correct 585 ms 637676 KB Output is correct
19 Correct 605 ms 637744 KB Output is correct
20 Correct 629 ms 637304 KB Output is correct
21 Correct 617 ms 637336 KB Output is correct
22 Correct 629 ms 637404 KB Output is correct
23 Correct 587 ms 637460 KB Output is correct
24 Correct 581 ms 637224 KB Output is correct
25 Correct 626 ms 644048 KB Output is correct
26 Correct 620 ms 644120 KB Output is correct
27 Correct 642 ms 644172 KB Output is correct
28 Correct 616 ms 641400 KB Output is correct
29 Correct 635 ms 642676 KB Output is correct
30 Correct 643 ms 642808 KB Output is correct
31 Correct 626 ms 642372 KB Output is correct
32 Correct 653 ms 642488 KB Output is correct
33 Correct 604 ms 635280 KB Output is correct
34 Correct 585 ms 635432 KB Output is correct
35 Correct 575 ms 636024 KB Output is correct
36 Correct 584 ms 635884 KB Output is correct
37 Correct 574 ms 635484 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 576 ms 635720 KB Output is correct
2 Correct 572 ms 636024 KB Output is correct
3 Correct 570 ms 636024 KB Output is correct
4 Correct 577 ms 636232 KB Output is correct
5 Correct 572 ms 635896 KB Output is correct
6 Correct 575 ms 635928 KB Output is correct
7 Correct 578 ms 636108 KB Output is correct
8 Correct 574 ms 635644 KB Output is correct
9 Correct 573 ms 635928 KB Output is correct
10 Correct 571 ms 636024 KB Output is correct
11 Correct 574 ms 636068 KB Output is correct
12 Correct 573 ms 635888 KB Output is correct
13 Correct 601 ms 635384 KB Output is correct
14 Correct 581 ms 635592 KB Output is correct
15 Correct 573 ms 635532 KB Output is correct
16 Correct 585 ms 635456 KB Output is correct
17 Correct 587 ms 637732 KB Output is correct
18 Correct 585 ms 637676 KB Output is correct
19 Correct 605 ms 637744 KB Output is correct
20 Correct 629 ms 637304 KB Output is correct
21 Correct 617 ms 637336 KB Output is correct
22 Correct 629 ms 637404 KB Output is correct
23 Correct 587 ms 637460 KB Output is correct
24 Correct 581 ms 637224 KB Output is correct
25 Correct 626 ms 644048 KB Output is correct
26 Correct 620 ms 644120 KB Output is correct
27 Correct 642 ms 644172 KB Output is correct
28 Correct 616 ms 641400 KB Output is correct
29 Correct 635 ms 642676 KB Output is correct
30 Correct 643 ms 642808 KB Output is correct
31 Correct 626 ms 642372 KB Output is correct
32 Correct 653 ms 642488 KB Output is correct
33 Correct 1012 ms 687900 KB Output is correct
34 Correct 946 ms 676496 KB Output is correct
35 Correct 1024 ms 676472 KB Output is correct
36 Correct 981 ms 665052 KB Output is correct
37 Correct 1222 ms 707064 KB Output is correct
38 Correct 1207 ms 706936 KB Output is correct
39 Correct 1186 ms 706980 KB Output is correct
40 Correct 1189 ms 702220 KB Output is correct
41 Correct 1022 ms 669880 KB Output is correct
42 Correct 1141 ms 674716 KB Output is correct
43 Correct 1365 ms 690104 KB Output is correct
44 Correct 1353 ms 690320 KB Output is correct
45 Correct 958 ms 669876 KB Output is correct
46 Correct 942 ms 662608 KB Output is correct
47 Correct 1317 ms 686096 KB Output is correct
48 Correct 1316 ms 686504 KB Output is correct
49 Correct 604 ms 635280 KB Output is correct
50 Correct 585 ms 635432 KB Output is correct
51 Correct 575 ms 636024 KB Output is correct
52 Correct 584 ms 635884 KB Output is correct
53 Correct 574 ms 635484 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 591 ms 635968 KB Output is correct
2 Correct 577 ms 635872 KB Output is correct
3 Correct 575 ms 635716 KB Output is correct
4 Correct 577 ms 635396 KB Output is correct
5 Correct 618 ms 635896 KB Output is correct
6 Correct 584 ms 635888 KB Output is correct
7 Correct 585 ms 635896 KB Output is correct
8 Correct 581 ms 635832 KB Output is correct
9 Correct 579 ms 635776 KB Output is correct
10 Correct 587 ms 635652 KB Output is correct
11 Correct 576 ms 635640 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 576 ms 635508 KB Output is correct
2 Correct 3281 ms 778424 KB Output is correct
3 Execution timed out 5126 ms 799900 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 576 ms 635720 KB Output is correct
2 Correct 572 ms 636024 KB Output is correct
3 Correct 570 ms 636024 KB Output is correct
4 Correct 577 ms 636232 KB Output is correct
5 Correct 572 ms 635896 KB Output is correct
6 Correct 575 ms 635928 KB Output is correct
7 Correct 578 ms 636108 KB Output is correct
8 Correct 574 ms 635644 KB Output is correct
9 Correct 573 ms 635928 KB Output is correct
10 Correct 571 ms 636024 KB Output is correct
11 Correct 574 ms 636068 KB Output is correct
12 Correct 573 ms 635888 KB Output is correct
13 Correct 601 ms 635384 KB Output is correct
14 Correct 581 ms 635592 KB Output is correct
15 Correct 573 ms 635532 KB Output is correct
16 Correct 585 ms 635456 KB Output is correct
17 Correct 587 ms 637732 KB Output is correct
18 Correct 585 ms 637676 KB Output is correct
19 Correct 605 ms 637744 KB Output is correct
20 Correct 629 ms 637304 KB Output is correct
21 Correct 617 ms 637336 KB Output is correct
22 Correct 629 ms 637404 KB Output is correct
23 Correct 587 ms 637460 KB Output is correct
24 Correct 581 ms 637224 KB Output is correct
25 Correct 626 ms 644048 KB Output is correct
26 Correct 620 ms 644120 KB Output is correct
27 Correct 642 ms 644172 KB Output is correct
28 Correct 616 ms 641400 KB Output is correct
29 Correct 635 ms 642676 KB Output is correct
30 Correct 643 ms 642808 KB Output is correct
31 Correct 626 ms 642372 KB Output is correct
32 Correct 653 ms 642488 KB Output is correct
33 Correct 1012 ms 687900 KB Output is correct
34 Correct 946 ms 676496 KB Output is correct
35 Correct 1024 ms 676472 KB Output is correct
36 Correct 981 ms 665052 KB Output is correct
37 Correct 1222 ms 707064 KB Output is correct
38 Correct 1207 ms 706936 KB Output is correct
39 Correct 1186 ms 706980 KB Output is correct
40 Correct 1189 ms 702220 KB Output is correct
41 Correct 1022 ms 669880 KB Output is correct
42 Correct 1141 ms 674716 KB Output is correct
43 Correct 1365 ms 690104 KB Output is correct
44 Correct 1353 ms 690320 KB Output is correct
45 Correct 958 ms 669876 KB Output is correct
46 Correct 942 ms 662608 KB Output is correct
47 Correct 1317 ms 686096 KB Output is correct
48 Correct 1316 ms 686504 KB Output is correct
49 Correct 591 ms 635968 KB Output is correct
50 Correct 577 ms 635872 KB Output is correct
51 Correct 575 ms 635716 KB Output is correct
52 Correct 577 ms 635396 KB Output is correct
53 Correct 618 ms 635896 KB Output is correct
54 Correct 584 ms 635888 KB Output is correct
55 Correct 585 ms 635896 KB Output is correct
56 Correct 581 ms 635832 KB Output is correct
57 Correct 579 ms 635776 KB Output is correct
58 Correct 587 ms 635652 KB Output is correct
59 Correct 576 ms 635640 KB Output is correct
60 Correct 576 ms 635508 KB Output is correct
61 Correct 3281 ms 778424 KB Output is correct
62 Execution timed out 5126 ms 799900 KB Time limit exceeded
63 Halted 0 ms 0 KB -