oj.uz

답안 #143598

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
143598 2019-08-14T17:30:50 Z icypiggy Rectangles (IOI19_rect) C++14
100 / 100
 4777 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()<5 || h_map[i][j].size()<5) {
                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

# 결과 실행 시간 메모리 Grader output
1 Correct 484 ms 356760 KB Output is correct
2 Correct 471 ms 356728 KB Output is correct
3 Correct 476 ms 356684 KB Output is correct
4 Correct 504 ms 356720 KB Output is correct
5 Correct 472 ms 356708 KB Output is correct
6 Correct 472 ms 356728 KB Output is correct
7 Correct 474 ms 356600 KB Output is correct
8 Correct 514 ms 356728 KB Output is correct
9 Correct 500 ms 356728 KB Output is correct
10 Correct 499 ms 356756 KB Output is correct
11 Correct 485 ms 356648 KB Output is correct
12 Correct 472 ms 356748 KB Output is correct
13 Correct 472 ms 356676 KB Output is correct
14 Correct 472 ms 356676 KB Output is correct
15 Correct 480 ms 356600 KB Output is correct
16 Correct 479 ms 356744 KB Output is correct
17 Correct 480 ms 356572 KB Output is correct
18 Correct 473 ms 356600 KB Output is correct
19 Correct 476 ms 356728 KB Output is correct
20 Correct 473 ms 356600 KB Output is correct
21 Correct 472 ms 356728 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 484 ms 356760 KB Output is correct
2 Correct 471 ms 356728 KB Output is correct
3 Correct 476 ms 356684 KB Output is correct
4 Correct 504 ms 356720 KB Output is correct
5 Correct 472 ms 356708 KB Output is correct
6 Correct 472 ms 356728 KB Output is correct
7 Correct 474 ms 356600 KB Output is correct
8 Correct 514 ms 356728 KB Output is correct
9 Correct 500 ms 356728 KB Output is correct
10 Correct 499 ms 356756 KB Output is correct
11 Correct 485 ms 356648 KB Output is correct
12 Correct 472 ms 356748 KB Output is correct
13 Correct 472 ms 356676 KB Output is correct
14 Correct 472 ms 356676 KB Output is correct
15 Correct 480 ms 356600 KB Output is correct
16 Correct 479 ms 356744 KB Output is correct
17 Correct 506 ms 357240 KB Output is correct
18 Correct 479 ms 357084 KB Output is correct
19 Correct 486 ms 357172 KB Output is correct
20 Correct 478 ms 356856 KB Output is correct
21 Correct 481 ms 357052 KB Output is correct
22 Correct 486 ms 356856 KB Output is correct
23 Correct 477 ms 356984 KB Output is correct
24 Correct 472 ms 356728 KB Output is correct
25 Correct 480 ms 356572 KB Output is correct
26 Correct 473 ms 356600 KB Output is correct
27 Correct 476 ms 356728 KB Output is correct
28 Correct 473 ms 356600 KB Output is correct
29 Correct 472 ms 356728 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 484 ms 356760 KB Output is correct
2 Correct 471 ms 356728 KB Output is correct
3 Correct 476 ms 356684 KB Output is correct
4 Correct 504 ms 356720 KB Output is correct
5 Correct 472 ms 356708 KB Output is correct
6 Correct 472 ms 356728 KB Output is correct
7 Correct 474 ms 356600 KB Output is correct
8 Correct 514 ms 356728 KB Output is correct
9 Correct 500 ms 356728 KB Output is correct
10 Correct 499 ms 356756 KB Output is correct
11 Correct 485 ms 356648 KB Output is correct
12 Correct 472 ms 356748 KB Output is correct
13 Correct 472 ms 356676 KB Output is correct
14 Correct 472 ms 356676 KB Output is correct
15 Correct 480 ms 356600 KB Output is correct
16 Correct 479 ms 356744 KB Output is correct
17 Correct 506 ms 357240 KB Output is correct
18 Correct 479 ms 357084 KB Output is correct
19 Correct 486 ms 357172 KB Output is correct
20 Correct 478 ms 356856 KB Output is correct
21 Correct 481 ms 357052 KB Output is correct
22 Correct 486 ms 356856 KB Output is correct
23 Correct 477 ms 356984 KB Output is correct
24 Correct 472 ms 356728 KB Output is correct
25 Correct 487 ms 359496 KB Output is correct
26 Correct 482 ms 359416 KB Output is correct
27 Correct 482 ms 359448 KB Output is correct
28 Correct 489 ms 357752 KB Output is correct
29 Correct 498 ms 358520 KB Output is correct
30 Correct 496 ms 358460 KB Output is correct
31 Correct 491 ms 358352 KB Output is correct
32 Correct 499 ms 358324 KB Output is correct
33 Correct 480 ms 356572 KB Output is correct
34 Correct 473 ms 356600 KB Output is correct
35 Correct 476 ms 356728 KB Output is correct
36 Correct 473 ms 356600 KB Output is correct
37 Correct 472 ms 356728 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 484 ms 356760 KB Output is correct
2 Correct 471 ms 356728 KB Output is correct
3 Correct 476 ms 356684 KB Output is correct
4 Correct 504 ms 356720 KB Output is correct
5 Correct 472 ms 356708 KB Output is correct
6 Correct 472 ms 356728 KB Output is correct
7 Correct 474 ms 356600 KB Output is correct
8 Correct 514 ms 356728 KB Output is correct
9 Correct 500 ms 356728 KB Output is correct
10 Correct 499 ms 356756 KB Output is correct
11 Correct 485 ms 356648 KB Output is correct
12 Correct 472 ms 356748 KB Output is correct
13 Correct 472 ms 356676 KB Output is correct
14 Correct 472 ms 356676 KB Output is correct
15 Correct 480 ms 356600 KB Output is correct
16 Correct 479 ms 356744 KB Output is correct
17 Correct 506 ms 357240 KB Output is correct
18 Correct 479 ms 357084 KB Output is correct
19 Correct 486 ms 357172 KB Output is correct
20 Correct 478 ms 356856 KB Output is correct
21 Correct 481 ms 357052 KB Output is correct
22 Correct 486 ms 356856 KB Output is correct
23 Correct 477 ms 356984 KB Output is correct
24 Correct 472 ms 356728 KB Output is correct
25 Correct 487 ms 359496 KB Output is correct
26 Correct 482 ms 359416 KB Output is correct
27 Correct 482 ms 359448 KB Output is correct
28 Correct 489 ms 357752 KB Output is correct
29 Correct 498 ms 358520 KB Output is correct
30 Correct 496 ms 358460 KB Output is correct
31 Correct 491 ms 358352 KB Output is correct
32 Correct 499 ms 358324 KB Output is correct
33 Correct 563 ms 375928 KB Output is correct
34 Correct 565 ms 371064 KB Output is correct
35 Correct 538 ms 371040 KB Output is correct
36 Correct 546 ms 366412 KB Output is correct
37 Correct 619 ms 391244 KB Output is correct
38 Correct 616 ms 390984 KB Output is correct
39 Correct 624 ms 391288 KB Output is correct
40 Correct 613 ms 388828 KB Output is correct
41 Correct 565 ms 368148 KB Output is correct
42 Correct 594 ms 370676 KB Output is correct
43 Correct 702 ms 378616 KB Output is correct
44 Correct 709 ms 378816 KB Output is correct
45 Correct 588 ms 367808 KB Output is correct
46 Correct 585 ms 367724 KB Output is correct
47 Correct 684 ms 377440 KB Output is correct
48 Correct 697 ms 377392 KB Output is correct
49 Correct 480 ms 356572 KB Output is correct
50 Correct 473 ms 356600 KB Output is correct
51 Correct 476 ms 356728 KB Output is correct
52 Correct 473 ms 356600 KB Output is correct
53 Correct 472 ms 356728 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 482 ms 357076 KB Output is correct
2 Correct 472 ms 356984 KB Output is correct
3 Correct 487 ms 356764 KB Output is correct
4 Correct 477 ms 356728 KB Output is correct
5 Correct 473 ms 356972 KB Output is correct
6 Correct 475 ms 357008 KB Output is correct
7 Correct 473 ms 356956 KB Output is correct
8 Correct 479 ms 356856 KB Output is correct
9 Correct 478 ms 356956 KB Output is correct
10 Correct 472 ms 356784 KB Output is correct
11 Correct 475 ms 356860 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 470 ms 356740 KB Output is correct
2 Correct 1091 ms 424276 KB Output is correct
3 Correct 1854 ms 503400 KB Output is correct
4 Correct 1843 ms 504100 KB Output is correct
5 Correct 1893 ms 504364 KB Output is correct
6 Correct 585 ms 380920 KB Output is correct
7 Correct 714 ms 402680 KB Output is correct
8 Correct 726 ms 405756 KB Output is correct
9 Correct 480 ms 356572 KB Output is correct
10 Correct 473 ms 356600 KB Output is correct
11 Correct 476 ms 356728 KB Output is correct
12 Correct 473 ms 356600 KB Output is correct
13 Correct 472 ms 356728 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 484 ms 356760 KB Output is correct
2 Correct 471 ms 356728 KB Output is correct
3 Correct 476 ms 356684 KB Output is correct
4 Correct 504 ms 356720 KB Output is correct
5 Correct 472 ms 356708 KB Output is correct
6 Correct 472 ms 356728 KB Output is correct
7 Correct 474 ms 356600 KB Output is correct
8 Correct 514 ms 356728 KB Output is correct
9 Correct 500 ms 356728 KB Output is correct
10 Correct 499 ms 356756 KB Output is correct
11 Correct 485 ms 356648 KB Output is correct
12 Correct 472 ms 356748 KB Output is correct
13 Correct 472 ms 356676 KB Output is correct
14 Correct 472 ms 356676 KB Output is correct
15 Correct 480 ms 356600 KB Output is correct
16 Correct 479 ms 356744 KB Output is correct
17 Correct 506 ms 357240 KB Output is correct
18 Correct 479 ms 357084 KB Output is correct
19 Correct 486 ms 357172 KB Output is correct
20 Correct 478 ms 356856 KB Output is correct
21 Correct 481 ms 357052 KB Output is correct
22 Correct 486 ms 356856 KB Output is correct
23 Correct 477 ms 356984 KB Output is correct
24 Correct 472 ms 356728 KB Output is correct
25 Correct 487 ms 359496 KB Output is correct
26 Correct 482 ms 359416 KB Output is correct
27 Correct 482 ms 359448 KB Output is correct
28 Correct 489 ms 357752 KB Output is correct
29 Correct 498 ms 358520 KB Output is correct
30 Correct 496 ms 358460 KB Output is correct
31 Correct 491 ms 358352 KB Output is correct
32 Correct 499 ms 358324 KB Output is correct
33 Correct 563 ms 375928 KB Output is correct
34 Correct 565 ms 371064 KB Output is correct
35 Correct 538 ms 371040 KB Output is correct
36 Correct 546 ms 366412 KB Output is correct
37 Correct 619 ms 391244 KB Output is correct
38 Correct 616 ms 390984 KB Output is correct
39 Correct 624 ms 391288 KB Output is correct
40 Correct 613 ms 388828 KB Output is correct
41 Correct 565 ms 368148 KB Output is correct
42 Correct 594 ms 370676 KB Output is correct
43 Correct 702 ms 378616 KB Output is correct
44 Correct 709 ms 378816 KB Output is correct
45 Correct 588 ms 367808 KB Output is correct
46 Correct 585 ms 367724 KB Output is correct
47 Correct 684 ms 377440 KB Output is correct
48 Correct 697 ms 377392 KB Output is correct
49 Correct 482 ms 357076 KB Output is correct
50 Correct 472 ms 356984 KB Output is correct
51 Correct 487 ms 356764 KB Output is correct
52 Correct 477 ms 356728 KB Output is correct
53 Correct 473 ms 356972 KB Output is correct
54 Correct 475 ms 357008 KB Output is correct
55 Correct 473 ms 356956 KB Output is correct
56 Correct 479 ms 356856 KB Output is correct
57 Correct 478 ms 356956 KB Output is correct
58 Correct 472 ms 356784 KB Output is correct
59 Correct 475 ms 356860 KB Output is correct
60 Correct 470 ms 356740 KB Output is correct
61 Correct 1091 ms 424276 KB Output is correct
62 Correct 1854 ms 503400 KB Output is correct
63 Correct 1843 ms 504100 KB Output is correct
64 Correct 1893 ms 504364 KB Output is correct
65 Correct 585 ms 380920 KB Output is correct
66 Correct 714 ms 402680 KB Output is correct
67 Correct 726 ms 405756 KB Output is correct
68 Correct 2004 ms 601436 KB Output is correct
69 Correct 2220 ms 535336 KB Output is correct
70 Correct 1554 ms 535284 KB Output is correct
71 Correct 1819 ms 469156 KB Output is correct
72 Correct 3030 ms 796664 KB Output is correct
73 Correct 2688 ms 525176 KB Output is correct
74 Correct 2833 ms 535672 KB Output is correct
75 Correct 4285 ms 637764 KB Output is correct
76 Correct 2795 ms 526584 KB Output is correct
77 Correct 3630 ms 583336 KB Output is correct
78 Correct 4777 ms 640160 KB Output is correct
79 Correct 2531 ms 515852 KB Output is correct
80 Correct 3973 ms 623692 KB Output is correct
81 Correct 3796 ms 615516 KB Output is correct
82 Correct 1877 ms 620820 KB Output is correct
83 Correct 2966 ms 796388 KB Output is correct
84 Correct 2978 ms 796748 KB Output is correct
85 Correct 2978 ms 796920 KB Output is correct
86 Correct 480 ms 356572 KB Output is correct
87 Correct 473 ms 356600 KB Output is correct
88 Correct 476 ms 356728 KB Output is correct
89 Correct 473 ms 356600 KB Output is correct
90 Correct 472 ms 356728 KB Output is correct