oj.uz

Submission #143743

# Submission time Handle Problem Language Result Execution time Memory
143743 2019-08-15T01:54:28 Z icypiggy Rectangles (IOI19_rect) C++14
100 / 100
 4570 ms 796920 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()*h_map[i][j].size()<=100) {
                for(auto &p: h_map[i][j]) {
                    for(auto &q: v_map[i][j]) {
                        if(p.first>=q.first && p.second<=q.second) {
                            ans++;
                        }
                    }
                }
            } 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 493 ms 356868 KB Output is correct
2 Correct 483 ms 356844 KB Output is correct
3 Correct 479 ms 356600 KB Output is correct
4 Correct 482 ms 356820 KB Output is correct
5 Correct 487 ms 356552 KB Output is correct
6 Correct 482 ms 356768 KB Output is correct
7 Correct 481 ms 356736 KB Output is correct
8 Correct 574 ms 356684 KB Output is correct
9 Correct 523 ms 356688 KB Output is correct
10 Correct 485 ms 356692 KB Output is correct
11 Correct 486 ms 356680 KB Output is correct
12 Correct 491 ms 356692 KB Output is correct
13 Correct 477 ms 356612 KB Output is correct
14 Correct 512 ms 356736 KB Output is correct
15 Correct 488 ms 356728 KB Output is correct
16 Correct 515 ms 356684 KB Output is correct
17 Correct 477 ms 356600 KB Output is correct
18 Correct 484 ms 356720 KB Output is correct
19 Correct 480 ms 356600 KB Output is correct
20 Correct 533 ms 356764 KB Output is correct
21 Correct 493 ms 356984 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 493 ms 356868 KB Output is correct
2 Correct 483 ms 356844 KB Output is correct
3 Correct 479 ms 356600 KB Output is correct
4 Correct 482 ms 356820 KB Output is correct
5 Correct 487 ms 356552 KB Output is correct
6 Correct 482 ms 356768 KB Output is correct
7 Correct 481 ms 356736 KB Output is correct
8 Correct 574 ms 356684 KB Output is correct
9 Correct 523 ms 356688 KB Output is correct
10 Correct 485 ms 356692 KB Output is correct
11 Correct 486 ms 356680 KB Output is correct
12 Correct 491 ms 356692 KB Output is correct
13 Correct 477 ms 356612 KB Output is correct
14 Correct 512 ms 356736 KB Output is correct
15 Correct 488 ms 356728 KB Output is correct
16 Correct 515 ms 356684 KB Output is correct
17 Correct 481 ms 356984 KB Output is correct
18 Correct 483 ms 357164 KB Output is correct
19 Correct 483 ms 357112 KB Output is correct
20 Correct 481 ms 356776 KB Output is correct
21 Correct 484 ms 356984 KB Output is correct
22 Correct 507 ms 357000 KB Output is correct
23 Correct 488 ms 356856 KB Output is correct
24 Correct 479 ms 356728 KB Output is correct
25 Correct 477 ms 356600 KB Output is correct
26 Correct 484 ms 356720 KB Output is correct
27 Correct 480 ms 356600 KB Output is correct
28 Correct 533 ms 356764 KB Output is correct
29 Correct 493 ms 356984 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 493 ms 356868 KB Output is correct
2 Correct 483 ms 356844 KB Output is correct
3 Correct 479 ms 356600 KB Output is correct
4 Correct 482 ms 356820 KB Output is correct
5 Correct 487 ms 356552 KB Output is correct
6 Correct 482 ms 356768 KB Output is correct
7 Correct 481 ms 356736 KB Output is correct
8 Correct 574 ms 356684 KB Output is correct
9 Correct 523 ms 356688 KB Output is correct
10 Correct 485 ms 356692 KB Output is correct
11 Correct 486 ms 356680 KB Output is correct
12 Correct 491 ms 356692 KB Output is correct
13 Correct 477 ms 356612 KB Output is correct
14 Correct 512 ms 356736 KB Output is correct
15 Correct 488 ms 356728 KB Output is correct
16 Correct 515 ms 356684 KB Output is correct
17 Correct 481 ms 356984 KB Output is correct
18 Correct 483 ms 357164 KB Output is correct
19 Correct 483 ms 357112 KB Output is correct
20 Correct 481 ms 356776 KB Output is correct
21 Correct 484 ms 356984 KB Output is correct
22 Correct 507 ms 357000 KB Output is correct
23 Correct 488 ms 356856 KB Output is correct
24 Correct 479 ms 356728 KB Output is correct
25 Correct 511 ms 359456 KB Output is correct
26 Correct 490 ms 359544 KB Output is correct
27 Correct 490 ms 359376 KB Output is correct
28 Correct 556 ms 357912 KB Output is correct
29 Correct 502 ms 358372 KB Output is correct
30 Correct 494 ms 358520 KB Output is correct
31 Correct 494 ms 358364 KB Output is correct
32 Correct 502 ms 358376 KB Output is correct
33 Correct 477 ms 356600 KB Output is correct
34 Correct 484 ms 356720 KB Output is correct
35 Correct 480 ms 356600 KB Output is correct
36 Correct 533 ms 356764 KB Output is correct
37 Correct 493 ms 356984 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 493 ms 356868 KB Output is correct
2 Correct 483 ms 356844 KB Output is correct
3 Correct 479 ms 356600 KB Output is correct
4 Correct 482 ms 356820 KB Output is correct
5 Correct 487 ms 356552 KB Output is correct
6 Correct 482 ms 356768 KB Output is correct
7 Correct 481 ms 356736 KB Output is correct
8 Correct 574 ms 356684 KB Output is correct
9 Correct 523 ms 356688 KB Output is correct
10 Correct 485 ms 356692 KB Output is correct
11 Correct 486 ms 356680 KB Output is correct
12 Correct 491 ms 356692 KB Output is correct
13 Correct 477 ms 356612 KB Output is correct
14 Correct 512 ms 356736 KB Output is correct
15 Correct 488 ms 356728 KB Output is correct
16 Correct 515 ms 356684 KB Output is correct
17 Correct 481 ms 356984 KB Output is correct
18 Correct 483 ms 357164 KB Output is correct
19 Correct 483 ms 357112 KB Output is correct
20 Correct 481 ms 356776 KB Output is correct
21 Correct 484 ms 356984 KB Output is correct
22 Correct 507 ms 357000 KB Output is correct
23 Correct 488 ms 356856 KB Output is correct
24 Correct 479 ms 356728 KB Output is correct
25 Correct 511 ms 359456 KB Output is correct
26 Correct 490 ms 359544 KB Output is correct
27 Correct 490 ms 359376 KB Output is correct
28 Correct 556 ms 357912 KB Output is correct
29 Correct 502 ms 358372 KB Output is correct
30 Correct 494 ms 358520 KB Output is correct
31 Correct 494 ms 358364 KB Output is correct
32 Correct 502 ms 358376 KB Output is correct
33 Correct 592 ms 375936 KB Output is correct
34 Correct 587 ms 371176 KB Output is correct
35 Correct 571 ms 371172 KB Output is correct
36 Correct 543 ms 366456 KB Output is correct
37 Correct 636 ms 391032 KB Output is correct
38 Correct 642 ms 391156 KB Output is correct
39 Correct 642 ms 391164 KB Output is correct
40 Correct 635 ms 388848 KB Output is correct
41 Correct 565 ms 368312 KB Output is correct
42 Correct 607 ms 370832 KB Output is correct
43 Correct 712 ms 378744 KB Output is correct
44 Correct 717 ms 378800 KB Output is correct
45 Correct 595 ms 367736 KB Output is correct
46 Correct 595 ms 367720 KB Output is correct
47 Correct 694 ms 377336 KB Output is correct
48 Correct 702 ms 377416 KB Output is correct
49 Correct 477 ms 356600 KB Output is correct
50 Correct 484 ms 356720 KB Output is correct
51 Correct 480 ms 356600 KB Output is correct
52 Correct 533 ms 356764 KB Output is correct
53 Correct 493 ms 356984 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 490 ms 357052 KB Output is correct
2 Correct 482 ms 357112 KB Output is correct
3 Correct 479 ms 356856 KB Output is correct
4 Correct 480 ms 356600 KB Output is correct
5 Correct 483 ms 356924 KB Output is correct
6 Correct 503 ms 356988 KB Output is correct
7 Correct 497 ms 356848 KB Output is correct
8 Correct 479 ms 357112 KB Output is correct
9 Correct 478 ms 356984 KB Output is correct
10 Correct 483 ms 356704 KB Output is correct
11 Correct 484 ms 356856 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 481 ms 356792 KB Output is correct
2 Correct 1206 ms 424308 KB Output is correct
3 Correct 1879 ms 503428 KB Output is correct
4 Correct 1935 ms 504368 KB Output is correct
5 Correct 1857 ms 504056 KB Output is correct
6 Correct 590 ms 381052 KB Output is correct
7 Correct 711 ms 402808 KB Output is correct
8 Correct 729 ms 405880 KB Output is correct
9 Correct 477 ms 356600 KB Output is correct
10 Correct 484 ms 356720 KB Output is correct
11 Correct 480 ms 356600 KB Output is correct
12 Correct 533 ms 356764 KB Output is correct
13 Correct 493 ms 356984 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 493 ms 356868 KB Output is correct
2 Correct 483 ms 356844 KB Output is correct
3 Correct 479 ms 356600 KB Output is correct
4 Correct 482 ms 356820 KB Output is correct
5 Correct 487 ms 356552 KB Output is correct
6 Correct 482 ms 356768 KB Output is correct
7 Correct 481 ms 356736 KB Output is correct
8 Correct 574 ms 356684 KB Output is correct
9 Correct 523 ms 356688 KB Output is correct
10 Correct 485 ms 356692 KB Output is correct
11 Correct 486 ms 356680 KB Output is correct
12 Correct 491 ms 356692 KB Output is correct
13 Correct 477 ms 356612 KB Output is correct
14 Correct 512 ms 356736 KB Output is correct
15 Correct 488 ms 356728 KB Output is correct
16 Correct 515 ms 356684 KB Output is correct
17 Correct 481 ms 356984 KB Output is correct
18 Correct 483 ms 357164 KB Output is correct
19 Correct 483 ms 357112 KB Output is correct
20 Correct 481 ms 356776 KB Output is correct
21 Correct 484 ms 356984 KB Output is correct
22 Correct 507 ms 357000 KB Output is correct
23 Correct 488 ms 356856 KB Output is correct
24 Correct 479 ms 356728 KB Output is correct
25 Correct 511 ms 359456 KB Output is correct
26 Correct 490 ms 359544 KB Output is correct
27 Correct 490 ms 359376 KB Output is correct
28 Correct 556 ms 357912 KB Output is correct
29 Correct 502 ms 358372 KB Output is correct
30 Correct 494 ms 358520 KB Output is correct
31 Correct 494 ms 358364 KB Output is correct
32 Correct 502 ms 358376 KB Output is correct
33 Correct 592 ms 375936 KB Output is correct
34 Correct 587 ms 371176 KB Output is correct
35 Correct 571 ms 371172 KB Output is correct
36 Correct 543 ms 366456 KB Output is correct
37 Correct 636 ms 391032 KB Output is correct
38 Correct 642 ms 391156 KB Output is correct
39 Correct 642 ms 391164 KB Output is correct
40 Correct 635 ms 388848 KB Output is correct
41 Correct 565 ms 368312 KB Output is correct
42 Correct 607 ms 370832 KB Output is correct
43 Correct 712 ms 378744 KB Output is correct
44 Correct 717 ms 378800 KB Output is correct
45 Correct 595 ms 367736 KB Output is correct
46 Correct 595 ms 367720 KB Output is correct
47 Correct 694 ms 377336 KB Output is correct
48 Correct 702 ms 377416 KB Output is correct
49 Correct 490 ms 357052 KB Output is correct
50 Correct 482 ms 357112 KB Output is correct
51 Correct 479 ms 356856 KB Output is correct
52 Correct 480 ms 356600 KB Output is correct
53 Correct 483 ms 356924 KB Output is correct
54 Correct 503 ms 356988 KB Output is correct
55 Correct 497 ms 356848 KB Output is correct
56 Correct 479 ms 357112 KB Output is correct
57 Correct 478 ms 356984 KB Output is correct
58 Correct 483 ms 356704 KB Output is correct
59 Correct 484 ms 356856 KB Output is correct
60 Correct 481 ms 356792 KB Output is correct
61 Correct 1206 ms 424308 KB Output is correct
62 Correct 1879 ms 503428 KB Output is correct
63 Correct 1935 ms 504368 KB Output is correct
64 Correct 1857 ms 504056 KB Output is correct
65 Correct 590 ms 381052 KB Output is correct
66 Correct 711 ms 402808 KB Output is correct
67 Correct 729 ms 405880 KB Output is correct
68 Correct 2123 ms 601324 KB Output is correct
69 Correct 2364 ms 535328 KB Output is correct
70 Correct 1588 ms 535404 KB Output is correct
71 Correct 1785 ms 469240 KB Output is correct
72 Correct 3369 ms 796920 KB Output is correct
73 Correct 2711 ms 525432 KB Output is correct
74 Correct 2804 ms 535708 KB Output is correct
75 Correct 4312 ms 637832 KB Output is correct
76 Correct 2735 ms 526704 KB Output is correct
77 Correct 3555 ms 583444 KB Output is correct
78 Correct 4570 ms 640248 KB Output is correct
79 Correct 2528 ms 515832 KB Output is correct
80 Correct 3905 ms 623844 KB Output is correct
81 Correct 3827 ms 615544 KB Output is correct
82 Correct 1979 ms 620564 KB Output is correct
83 Correct 3173 ms 796536 KB Output is correct
84 Correct 3188 ms 796820 KB Output is correct
85 Correct 3339 ms 796748 KB Output is correct
86 Correct 477 ms 356600 KB Output is correct
87 Correct 484 ms 356720 KB Output is correct
88 Correct 480 ms 356600 KB Output is correct
89 Correct 533 ms 356764 KB Output is correct
90 Correct 493 ms 356984 KB Output is correct