oj.uz

Submission #143599

# Submission time Handle Problem Language Result Execution time Memory
143599 2019-08-14T17:33:16 Z icypiggy Rectangles (IOI19_rect) C++14
100 / 100
 4476 ms 796796 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()<7	 || h_map[i][j].size()<7) {
                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);
                }
            }
        }
    }
    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++) {
                      ~^~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 480 ms 356728 KB Output is correct
2 Correct 491 ms 356728 KB Output is correct
3 Correct 490 ms 356752 KB Output is correct
4 Correct 483 ms 356728 KB Output is correct
5 Correct 477 ms 356732 KB Output is correct
6 Correct 476 ms 356728 KB Output is correct
7 Correct 478 ms 356768 KB Output is correct
8 Correct 480 ms 356900 KB Output is correct
9 Correct 478 ms 356600 KB Output is correct
10 Correct 477 ms 356820 KB Output is correct
11 Correct 502 ms 356728 KB Output is correct
12 Correct 503 ms 356872 KB Output is correct
13 Correct 485 ms 356688 KB Output is correct
14 Correct 494 ms 356728 KB Output is correct
15 Correct 511 ms 356728 KB Output is correct
16 Correct 504 ms 356744 KB Output is correct
17 Correct 475 ms 356600 KB Output is correct
18 Correct 477 ms 356728 KB Output is correct
19 Correct 480 ms 356800 KB Output is correct
20 Correct 479 ms 356728 KB Output is correct
21 Correct 562 ms 356728 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 480 ms 356728 KB Output is correct
2 Correct 491 ms 356728 KB Output is correct
3 Correct 490 ms 356752 KB Output is correct
4 Correct 483 ms 356728 KB Output is correct
5 Correct 477 ms 356732 KB Output is correct
6 Correct 476 ms 356728 KB Output is correct
7 Correct 478 ms 356768 KB Output is correct
8 Correct 480 ms 356900 KB Output is correct
9 Correct 478 ms 356600 KB Output is correct
10 Correct 477 ms 356820 KB Output is correct
11 Correct 502 ms 356728 KB Output is correct
12 Correct 503 ms 356872 KB Output is correct
13 Correct 485 ms 356688 KB Output is correct
14 Correct 494 ms 356728 KB Output is correct
15 Correct 511 ms 356728 KB Output is correct
16 Correct 504 ms 356744 KB Output is correct
17 Correct 479 ms 357148 KB Output is correct
18 Correct 489 ms 357144 KB Output is correct
19 Correct 481 ms 357112 KB Output is correct
20 Correct 511 ms 356912 KB Output is correct
21 Correct 476 ms 356932 KB Output is correct
22 Correct 478 ms 356856 KB Output is correct
23 Correct 557 ms 356860 KB Output is correct
24 Correct 543 ms 356856 KB Output is correct
25 Correct 475 ms 356600 KB Output is correct
26 Correct 477 ms 356728 KB Output is correct
27 Correct 480 ms 356800 KB Output is correct
28 Correct 479 ms 356728 KB Output is correct
29 Correct 562 ms 356728 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 480 ms 356728 KB Output is correct
2 Correct 491 ms 356728 KB Output is correct
3 Correct 490 ms 356752 KB Output is correct
4 Correct 483 ms 356728 KB Output is correct
5 Correct 477 ms 356732 KB Output is correct
6 Correct 476 ms 356728 KB Output is correct
7 Correct 478 ms 356768 KB Output is correct
8 Correct 480 ms 356900 KB Output is correct
9 Correct 478 ms 356600 KB Output is correct
10 Correct 477 ms 356820 KB Output is correct
11 Correct 502 ms 356728 KB Output is correct
12 Correct 503 ms 356872 KB Output is correct
13 Correct 485 ms 356688 KB Output is correct
14 Correct 494 ms 356728 KB Output is correct
15 Correct 511 ms 356728 KB Output is correct
16 Correct 504 ms 356744 KB Output is correct
17 Correct 479 ms 357148 KB Output is correct
18 Correct 489 ms 357144 KB Output is correct
19 Correct 481 ms 357112 KB Output is correct
20 Correct 511 ms 356912 KB Output is correct
21 Correct 476 ms 356932 KB Output is correct
22 Correct 478 ms 356856 KB Output is correct
23 Correct 557 ms 356860 KB Output is correct
24 Correct 543 ms 356856 KB Output is correct
25 Correct 489 ms 359536 KB Output is correct
26 Correct 490 ms 359416 KB Output is correct
27 Correct 515 ms 359508 KB Output is correct
28 Correct 486 ms 357856 KB Output is correct
29 Correct 492 ms 358604 KB Output is correct
30 Correct 503 ms 358376 KB Output is correct
31 Correct 500 ms 358444 KB Output is correct
32 Correct 491 ms 358392 KB Output is correct
33 Correct 475 ms 356600 KB Output is correct
34 Correct 477 ms 356728 KB Output is correct
35 Correct 480 ms 356800 KB Output is correct
36 Correct 479 ms 356728 KB Output is correct
37 Correct 562 ms 356728 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 480 ms 356728 KB Output is correct
2 Correct 491 ms 356728 KB Output is correct
3 Correct 490 ms 356752 KB Output is correct
4 Correct 483 ms 356728 KB Output is correct
5 Correct 477 ms 356732 KB Output is correct
6 Correct 476 ms 356728 KB Output is correct
7 Correct 478 ms 356768 KB Output is correct
8 Correct 480 ms 356900 KB Output is correct
9 Correct 478 ms 356600 KB Output is correct
10 Correct 477 ms 356820 KB Output is correct
11 Correct 502 ms 356728 KB Output is correct
12 Correct 503 ms 356872 KB Output is correct
13 Correct 485 ms 356688 KB Output is correct
14 Correct 494 ms 356728 KB Output is correct
15 Correct 511 ms 356728 KB Output is correct
16 Correct 504 ms 356744 KB Output is correct
17 Correct 479 ms 357148 KB Output is correct
18 Correct 489 ms 357144 KB Output is correct
19 Correct 481 ms 357112 KB Output is correct
20 Correct 511 ms 356912 KB Output is correct
21 Correct 476 ms 356932 KB Output is correct
22 Correct 478 ms 356856 KB Output is correct
23 Correct 557 ms 356860 KB Output is correct
24 Correct 543 ms 356856 KB Output is correct
25 Correct 489 ms 359536 KB Output is correct
26 Correct 490 ms 359416 KB Output is correct
27 Correct 515 ms 359508 KB Output is correct
28 Correct 486 ms 357856 KB Output is correct
29 Correct 492 ms 358604 KB Output is correct
30 Correct 503 ms 358376 KB Output is correct
31 Correct 500 ms 358444 KB Output is correct
32 Correct 491 ms 358392 KB Output is correct
33 Correct 566 ms 375732 KB Output is correct
34 Correct 566 ms 371072 KB Output is correct
35 Correct 544 ms 371064 KB Output is correct
36 Correct 546 ms 366292 KB Output is correct
37 Correct 619 ms 391228 KB Output is correct
38 Correct 724 ms 391208 KB Output is correct
39 Correct 625 ms 391160 KB Output is correct
40 Correct 613 ms 388988 KB Output is correct
41 Correct 567 ms 368368 KB Output is correct
42 Correct 601 ms 370936 KB Output is correct
43 Correct 753 ms 378840 KB Output is correct
44 Correct 764 ms 379000 KB Output is correct
45 Correct 595 ms 367828 KB Output is correct
46 Correct 588 ms 367744 KB Output is correct
47 Correct 692 ms 377492 KB Output is correct
48 Correct 704 ms 377592 KB Output is correct
49 Correct 475 ms 356600 KB Output is correct
50 Correct 477 ms 356728 KB Output is correct
51 Correct 480 ms 356800 KB Output is correct
52 Correct 479 ms 356728 KB Output is correct
53 Correct 562 ms 356728 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 482 ms 356984 KB Output is correct
2 Correct 481 ms 356920 KB Output is correct
3 Correct 478 ms 356728 KB Output is correct
4 Correct 478 ms 356676 KB Output is correct
5 Correct 485 ms 356888 KB Output is correct
6 Correct 484 ms 356984 KB Output is correct
7 Correct 485 ms 356980 KB Output is correct
8 Correct 534 ms 356960 KB Output is correct
9 Correct 486 ms 356992 KB Output is correct
10 Correct 479 ms 356856 KB Output is correct
11 Correct 476 ms 356824 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 477 ms 356608 KB Output is correct
2 Correct 1104 ms 424472 KB Output is correct
3 Correct 1892 ms 503396 KB Output is correct
4 Correct 1878 ms 504184 KB Output is correct
5 Correct 1984 ms 504308 KB Output is correct
6 Correct 644 ms 381048 KB Output is correct
7 Correct 739 ms 402760 KB Output is correct
8 Correct 737 ms 405988 KB Output is correct
9 Correct 475 ms 356600 KB Output is correct
10 Correct 477 ms 356728 KB Output is correct
11 Correct 480 ms 356800 KB Output is correct
12 Correct 479 ms 356728 KB Output is correct
13 Correct 562 ms 356728 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 480 ms 356728 KB Output is correct
2 Correct 491 ms 356728 KB Output is correct
3 Correct 490 ms 356752 KB Output is correct
4 Correct 483 ms 356728 KB Output is correct
5 Correct 477 ms 356732 KB Output is correct
6 Correct 476 ms 356728 KB Output is correct
7 Correct 478 ms 356768 KB Output is correct
8 Correct 480 ms 356900 KB Output is correct
9 Correct 478 ms 356600 KB Output is correct
10 Correct 477 ms 356820 KB Output is correct
11 Correct 502 ms 356728 KB Output is correct
12 Correct 503 ms 356872 KB Output is correct
13 Correct 485 ms 356688 KB Output is correct
14 Correct 494 ms 356728 KB Output is correct
15 Correct 511 ms 356728 KB Output is correct
16 Correct 504 ms 356744 KB Output is correct
17 Correct 479 ms 357148 KB Output is correct
18 Correct 489 ms 357144 KB Output is correct
19 Correct 481 ms 357112 KB Output is correct
20 Correct 511 ms 356912 KB Output is correct
21 Correct 476 ms 356932 KB Output is correct
22 Correct 478 ms 356856 KB Output is correct
23 Correct 557 ms 356860 KB Output is correct
24 Correct 543 ms 356856 KB Output is correct
25 Correct 489 ms 359536 KB Output is correct
26 Correct 490 ms 359416 KB Output is correct
27 Correct 515 ms 359508 KB Output is correct
28 Correct 486 ms 357856 KB Output is correct
29 Correct 492 ms 358604 KB Output is correct
30 Correct 503 ms 358376 KB Output is correct
31 Correct 500 ms 358444 KB Output is correct
32 Correct 491 ms 358392 KB Output is correct
33 Correct 566 ms 375732 KB Output is correct
34 Correct 566 ms 371072 KB Output is correct
35 Correct 544 ms 371064 KB Output is correct
36 Correct 546 ms 366292 KB Output is correct
37 Correct 619 ms 391228 KB Output is correct
38 Correct 724 ms 391208 KB Output is correct
39 Correct 625 ms 391160 KB Output is correct
40 Correct 613 ms 388988 KB Output is correct
41 Correct 567 ms 368368 KB Output is correct
42 Correct 601 ms 370936 KB Output is correct
43 Correct 753 ms 378840 KB Output is correct
44 Correct 764 ms 379000 KB Output is correct
45 Correct 595 ms 367828 KB Output is correct
46 Correct 588 ms 367744 KB Output is correct
47 Correct 692 ms 377492 KB Output is correct
48 Correct 704 ms 377592 KB Output is correct
49 Correct 482 ms 356984 KB Output is correct
50 Correct 481 ms 356920 KB Output is correct
51 Correct 478 ms 356728 KB Output is correct
52 Correct 478 ms 356676 KB Output is correct
53 Correct 485 ms 356888 KB Output is correct
54 Correct 484 ms 356984 KB Output is correct
55 Correct 485 ms 356980 KB Output is correct
56 Correct 534 ms 356960 KB Output is correct
57 Correct 486 ms 356992 KB Output is correct
58 Correct 479 ms 356856 KB Output is correct
59 Correct 476 ms 356824 KB Output is correct
60 Correct 477 ms 356608 KB Output is correct
61 Correct 1104 ms 424472 KB Output is correct
62 Correct 1892 ms 503396 KB Output is correct
63 Correct 1878 ms 504184 KB Output is correct
64 Correct 1984 ms 504308 KB Output is correct
65 Correct 644 ms 381048 KB Output is correct
66 Correct 739 ms 402760 KB Output is correct
67 Correct 737 ms 405988 KB Output is correct
68 Correct 2020 ms 601324 KB Output is correct
69 Correct 2231 ms 535332 KB Output is correct
70 Correct 1547 ms 535288 KB Output is correct
71 Correct 1818 ms 469376 KB Output is correct
72 Correct 3005 ms 796740 KB Output is correct
73 Correct 2722 ms 525324 KB Output is correct
74 Correct 2927 ms 535576 KB Output is correct
75 Correct 4305 ms 637900 KB Output is correct
76 Correct 2825 ms 526664 KB Output is correct
77 Correct 3582 ms 583328 KB Output is correct
78 Correct 4476 ms 640112 KB Output is correct
79 Correct 2436 ms 515876 KB Output is correct
80 Correct 3975 ms 623660 KB Output is correct
81 Correct 3848 ms 615412 KB Output is correct
82 Correct 1852 ms 620564 KB Output is correct
83 Correct 2951 ms 796372 KB Output is correct
84 Correct 3014 ms 796696 KB Output is correct
85 Correct 3014 ms 796796 KB Output is correct
86 Correct 475 ms 356600 KB Output is correct
87 Correct 477 ms 356728 KB Output is correct
88 Correct 480 ms 356800 KB Output is correct
89 Correct 479 ms 356728 KB Output is correct
90 Correct 562 ms 356728 KB Output is correct