oj.uz

Submission #143584

# Submission time Handle Problem Language Result Execution time Memory
143584 2019-08-14T16:47:28 Z icypiggy Rectangles (IOI19_rect) C++14
72 / 100
 2688 ms 1048576 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,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];
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) {
    //cout << tmp[left][right].first << " " << tmp[left][right].second << " " << left << " " << right << " " << row << "\n";
    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));
                //cout << "hmap update: " << i << " " << left << " " << tmp[left][right].second << " " << right << "\n";
            }
        }
        tmp[left][right] = make_pair(row, row);
    } else {
        tmp[left][right].second++;
    }
}
void update_val2(int left, int right, int row) {
    //cout << tmp[left][right].first << " " << tmp[left][right].second << " " << left << " " << right << " " << row << "\n";
    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));
                //cout << "vmap update: " << left << " " << i << " " << right << " " << tmp[left][right].second << "\n";

            }
        }
        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) {

                h_seg[r][s.top()+1].push_back(make_pair(i-1, true));
                //cout << "attempt update: " << r << " " << s.top()+1 << " " << i-1 << "\n";
                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) {
            h_seg[r][s.top()+1].push_back(make_pair(i-1, true));
            update_val(s.top()+1, i-1, r);
            //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";
                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) {
            v_seg[r][s.top()+1].push_back(make_pair(i-1, true));
            //cout << r << " " << s.top()+1 << " " << i-1 << "\n";
            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);
        }
    }
    /*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());
        }
    }

    fenwick f[a.size()];
    for(int i=0; i<a.size(); i++) {
        f[i].reset();
    }

    long long ans = 0;
    for(int j=0; j<a[0].size(); j++) {
        vector<pair<int,int>> updates;
        for(int i=0; i<a.size(); i++) {
            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;
                            f[down].update(p.first, 1);
                            updates.push_back(make_pair(down,p.first));
                            down++;
                        } else {
                            break;
                        }
                    }
                    f[down].update(p.first, 1);
                    updates.push_back(make_pair(down,p.first));
                }
            }
            swap(i,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_map2[j].push_back(make_pair(p.first, down));
                    //cout << "i,j,p.first,down(v): " << i << " " << j << " " << p.first << " " << down << "\n";
                }
            }
            swap(i,j);
            for(int a=0; a<v_map2[i].size(); a++) {
                while(a<v_map2[i].size() && v_map2[i][a].second<j) {
                    swap(v_map2[i][a], v_map2[i][v_map2[i].size()-1]);
                    v_map2[i].pop_back();
                }
            }
            for(auto q: v_map2[i]) {
                int tmp = f[q.first].query(j,q.second);
                ans += tmp;
            }
        }
        for(auto p: updates) {
            f[p.first].update(p.second, -1);
        }
    }*/
    long long ans = 0;
    for(int i=0; i<a.size(); i++) {
        for(int j=0; j<a[0].size(); j++) {
            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";
                    }
                }
            }
        }
    }

    return ans;
}

Compilation message

rect.cpp: In function 'void gen_h_seg(std::vector<int>&, int)':
rect.cpp:48: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:101: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:129:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<a.size(); i++) {
                  ~^~~~~~~~~
rect.cpp:143:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<a[0].size(); i++) {
                  ~^~~~~~~~~~~~
rect.cpp:145:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<a.size(); j++) {
                      ~^~~~~~~~~
rect.cpp:225:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<a.size(); i++) {
                  ~^~~~~~~~~
rect.cpp:226:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for(int j=0; j<a[0].size(); j++) {
                      ~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 751 ms 662092 KB Output is correct
2 Correct 755 ms 662392 KB Output is correct
3 Correct 749 ms 662272 KB Output is correct
4 Correct 749 ms 662104 KB Output is correct
5 Correct 758 ms 662024 KB Output is correct
6 Correct 758 ms 662264 KB Output is correct
7 Correct 748 ms 662264 KB Output is correct
8 Correct 751 ms 662140 KB Output is correct
9 Correct 744 ms 662136 KB Output is correct
10 Correct 759 ms 662264 KB Output is correct
11 Correct 769 ms 662176 KB Output is correct
12 Correct 746 ms 662276 KB Output is correct
13 Correct 750 ms 662208 KB Output is correct
14 Correct 756 ms 662264 KB Output is correct
15 Correct 750 ms 662252 KB Output is correct
16 Correct 748 ms 662056 KB Output is correct
17 Correct 751 ms 662136 KB Output is correct
18 Correct 752 ms 662204 KB Output is correct
19 Correct 822 ms 662264 KB Output is correct
20 Correct 750 ms 662196 KB Output is correct
21 Correct 774 ms 662264 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 751 ms 662092 KB Output is correct
2 Correct 755 ms 662392 KB Output is correct
3 Correct 749 ms 662272 KB Output is correct
4 Correct 749 ms 662104 KB Output is correct
5 Correct 758 ms 662024 KB Output is correct
6 Correct 758 ms 662264 KB Output is correct
7 Correct 748 ms 662264 KB Output is correct
8 Correct 751 ms 662140 KB Output is correct
9 Correct 744 ms 662136 KB Output is correct
10 Correct 759 ms 662264 KB Output is correct
11 Correct 769 ms 662176 KB Output is correct
12 Correct 746 ms 662276 KB Output is correct
13 Correct 750 ms 662208 KB Output is correct
14 Correct 756 ms 662264 KB Output is correct
15 Correct 750 ms 662252 KB Output is correct
16 Correct 748 ms 662056 KB Output is correct
17 Correct 752 ms 662920 KB Output is correct
18 Correct 756 ms 663092 KB Output is correct
19 Correct 755 ms 663032 KB Output is correct
20 Correct 840 ms 662520 KB Output is correct
21 Correct 754 ms 662648 KB Output is correct
22 Correct 772 ms 662812 KB Output is correct
23 Correct 777 ms 662648 KB Output is correct
24 Correct 751 ms 662364 KB Output is correct
25 Correct 751 ms 662136 KB Output is correct
26 Correct 752 ms 662204 KB Output is correct
27 Correct 822 ms 662264 KB Output is correct
28 Correct 750 ms 662196 KB Output is correct
29 Correct 774 ms 662264 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 751 ms 662092 KB Output is correct
2 Correct 755 ms 662392 KB Output is correct
3 Correct 749 ms 662272 KB Output is correct
4 Correct 749 ms 662104 KB Output is correct
5 Correct 758 ms 662024 KB Output is correct
6 Correct 758 ms 662264 KB Output is correct
7 Correct 748 ms 662264 KB Output is correct
8 Correct 751 ms 662140 KB Output is correct
9 Correct 744 ms 662136 KB Output is correct
10 Correct 759 ms 662264 KB Output is correct
11 Correct 769 ms 662176 KB Output is correct
12 Correct 746 ms 662276 KB Output is correct
13 Correct 750 ms 662208 KB Output is correct
14 Correct 756 ms 662264 KB Output is correct
15 Correct 750 ms 662252 KB Output is correct
16 Correct 748 ms 662056 KB Output is correct
17 Correct 752 ms 662920 KB Output is correct
18 Correct 756 ms 663092 KB Output is correct
19 Correct 755 ms 663032 KB Output is correct
20 Correct 840 ms 662520 KB Output is correct
21 Correct 754 ms 662648 KB Output is correct
22 Correct 772 ms 662812 KB Output is correct
23 Correct 777 ms 662648 KB Output is correct
24 Correct 751 ms 662364 KB Output is correct
25 Correct 764 ms 667504 KB Output is correct
26 Correct 811 ms 667408 KB Output is correct
27 Correct 767 ms 667392 KB Output is correct
28 Correct 761 ms 664168 KB Output is correct
29 Correct 796 ms 665336 KB Output is correct
30 Correct 808 ms 665308 KB Output is correct
31 Correct 782 ms 665208 KB Output is correct
32 Correct 768 ms 664980 KB Output is correct
33 Correct 751 ms 662136 KB Output is correct
34 Correct 752 ms 662204 KB Output is correct
35 Correct 822 ms 662264 KB Output is correct
36 Correct 750 ms 662196 KB Output is correct
37 Correct 774 ms 662264 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 751 ms 662092 KB Output is correct
2 Correct 755 ms 662392 KB Output is correct
3 Correct 749 ms 662272 KB Output is correct
4 Correct 749 ms 662104 KB Output is correct
5 Correct 758 ms 662024 KB Output is correct
6 Correct 758 ms 662264 KB Output is correct
7 Correct 748 ms 662264 KB Output is correct
8 Correct 751 ms 662140 KB Output is correct
9 Correct 744 ms 662136 KB Output is correct
10 Correct 759 ms 662264 KB Output is correct
11 Correct 769 ms 662176 KB Output is correct
12 Correct 746 ms 662276 KB Output is correct
13 Correct 750 ms 662208 KB Output is correct
14 Correct 756 ms 662264 KB Output is correct
15 Correct 750 ms 662252 KB Output is correct
16 Correct 748 ms 662056 KB Output is correct
17 Correct 752 ms 662920 KB Output is correct
18 Correct 756 ms 663092 KB Output is correct
19 Correct 755 ms 663032 KB Output is correct
20 Correct 840 ms 662520 KB Output is correct
21 Correct 754 ms 662648 KB Output is correct
22 Correct 772 ms 662812 KB Output is correct
23 Correct 777 ms 662648 KB Output is correct
24 Correct 751 ms 662364 KB Output is correct
25 Correct 764 ms 667504 KB Output is correct
26 Correct 811 ms 667408 KB Output is correct
27 Correct 767 ms 667392 KB Output is correct
28 Correct 761 ms 664168 KB Output is correct
29 Correct 796 ms 665336 KB Output is correct
30 Correct 808 ms 665308 KB Output is correct
31 Correct 782 ms 665208 KB Output is correct
32 Correct 768 ms 664980 KB Output is correct
33 Correct 892 ms 696616 KB Output is correct
34 Correct 871 ms 687096 KB Output is correct
35 Correct 842 ms 687192 KB Output is correct
36 Correct 926 ms 677552 KB Output is correct
37 Correct 991 ms 727292 KB Output is correct
38 Correct 970 ms 727076 KB Output is correct
39 Correct 966 ms 727300 KB Output is correct
40 Correct 958 ms 722884 KB Output is correct
41 Correct 882 ms 681336 KB Output is correct
42 Correct 924 ms 686392 KB Output is correct
43 Correct 1115 ms 702144 KB Output is correct
44 Correct 1135 ms 702456 KB Output is correct
45 Correct 928 ms 682232 KB Output is correct
46 Correct 926 ms 682180 KB Output is correct
47 Correct 1097 ms 699620 KB Output is correct
48 Correct 1078 ms 699616 KB Output is correct
49 Correct 751 ms 662136 KB Output is correct
50 Correct 752 ms 662204 KB Output is correct
51 Correct 822 ms 662264 KB Output is correct
52 Correct 750 ms 662196 KB Output is correct
53 Correct 774 ms 662264 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 749 ms 662816 KB Output is correct
2 Correct 756 ms 662776 KB Output is correct
3 Correct 751 ms 662264 KB Output is correct
4 Correct 750 ms 662136 KB Output is correct
5 Correct 751 ms 662520 KB Output is correct
6 Correct 750 ms 662568 KB Output is correct
7 Correct 751 ms 662556 KB Output is correct
8 Correct 760 ms 662648 KB Output is correct
9 Correct 776 ms 662608 KB Output is correct
10 Correct 754 ms 662164 KB Output is correct
11 Correct 757 ms 662504 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 762 ms 662160 KB Output is correct
2 Correct 1597 ms 774652 KB Output is correct
3 Correct 2674 ms 906164 KB Output is correct
4 Correct 2688 ms 907240 KB Output is correct
5 Correct 2674 ms 907524 KB Output is correct
6 Correct 850 ms 686448 KB Output is correct
7 Correct 967 ms 708344 KB Output is correct
8 Correct 987 ms 711240 KB Output is correct
9 Correct 751 ms 662136 KB Output is correct
10 Correct 752 ms 662204 KB Output is correct
11 Correct 822 ms 662264 KB Output is correct
12 Correct 750 ms 662196 KB Output is correct
13 Correct 774 ms 662264 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 751 ms 662092 KB Output is correct
2 Correct 755 ms 662392 KB Output is correct
3 Correct 749 ms 662272 KB Output is correct
4 Correct 749 ms 662104 KB Output is correct
5 Correct 758 ms 662024 KB Output is correct
6 Correct 758 ms 662264 KB Output is correct
7 Correct 748 ms 662264 KB Output is correct
8 Correct 751 ms 662140 KB Output is correct
9 Correct 744 ms 662136 KB Output is correct
10 Correct 759 ms 662264 KB Output is correct
11 Correct 769 ms 662176 KB Output is correct
12 Correct 746 ms 662276 KB Output is correct
13 Correct 750 ms 662208 KB Output is correct
14 Correct 756 ms 662264 KB Output is correct
15 Correct 750 ms 662252 KB Output is correct
16 Correct 748 ms 662056 KB Output is correct
17 Correct 752 ms 662920 KB Output is correct
18 Correct 756 ms 663092 KB Output is correct
19 Correct 755 ms 663032 KB Output is correct
20 Correct 840 ms 662520 KB Output is correct
21 Correct 754 ms 662648 KB Output is correct
22 Correct 772 ms 662812 KB Output is correct
23 Correct 777 ms 662648 KB Output is correct
24 Correct 751 ms 662364 KB Output is correct
25 Correct 764 ms 667504 KB Output is correct
26 Correct 811 ms 667408 KB Output is correct
27 Correct 767 ms 667392 KB Output is correct
28 Correct 761 ms 664168 KB Output is correct
29 Correct 796 ms 665336 KB Output is correct
30 Correct 808 ms 665308 KB Output is correct
31 Correct 782 ms 665208 KB Output is correct
32 Correct 768 ms 664980 KB Output is correct
33 Correct 892 ms 696616 KB Output is correct
34 Correct 871 ms 687096 KB Output is correct
35 Correct 842 ms 687192 KB Output is correct
36 Correct 926 ms 677552 KB Output is correct
37 Correct 991 ms 727292 KB Output is correct
38 Correct 970 ms 727076 KB Output is correct
39 Correct 966 ms 727300 KB Output is correct
40 Correct 958 ms 722884 KB Output is correct
41 Correct 882 ms 681336 KB Output is correct
42 Correct 924 ms 686392 KB Output is correct
43 Correct 1115 ms 702144 KB Output is correct
44 Correct 1135 ms 702456 KB Output is correct
45 Correct 928 ms 682232 KB Output is correct
46 Correct 926 ms 682180 KB Output is correct
47 Correct 1097 ms 699620 KB Output is correct
48 Correct 1078 ms 699616 KB Output is correct
49 Correct 749 ms 662816 KB Output is correct
50 Correct 756 ms 662776 KB Output is correct
51 Correct 751 ms 662264 KB Output is correct
52 Correct 750 ms 662136 KB Output is correct
53 Correct 751 ms 662520 KB Output is correct
54 Correct 750 ms 662568 KB Output is correct
55 Correct 751 ms 662556 KB Output is correct
56 Correct 760 ms 662648 KB Output is correct
57 Correct 776 ms 662608 KB Output is correct
58 Correct 754 ms 662164 KB Output is correct
59 Correct 757 ms 662504 KB Output is correct
60 Correct 762 ms 662160 KB Output is correct
61 Correct 1597 ms 774652 KB Output is correct
62 Correct 2674 ms 906164 KB Output is correct
63 Correct 2688 ms 907240 KB Output is correct
64 Correct 2674 ms 907524 KB Output is correct
65 Correct 850 ms 686448 KB Output is correct
66 Correct 967 ms 708344 KB Output is correct
67 Correct 987 ms 711240 KB Output is correct
68 Runtime error 2037 ms 1048576 KB Execution killed with signal 9 (could be triggered by violating memory limits)
69 Halted 0 ms 0 KB -