oj.uz

Submission #154451

# Submission time Handle Problem Language Result Execution time Memory
154451 2019-09-21T22:37:15 Z crackersamdjam Rectangles (IOI19_rect) C++14
72 / 100
 2818 ms 1048576 KB 
#include <bits/stdc++.h>
#define gc getchar_unlocked()
#define pc(x) putchar_unlocked(x)
template<typename T> void scan(T &x){x = 0;register bool _=0;register T c=gc;_=c==45;c=_?gc:c;while(c<48||c>57)c=gc;for(;c<48||c>57;c=gc);for(;c>47&&c<58;c=gc)x=(x<<3)+(x<<1)+(c&15);x=_?-x:x;}
template<typename T> void printn(T n){register bool _=0;_=n<0;n=_?-n:n;char snum[65];int i=0;do{snum[i++]=n%10+48;n/= 10;}while(n);--i;if (_)pc(45);while(i>=0)pc(snum[i--]);}
template<typename First, typename ... Ints> void scan(First &arg, Ints&... rest){scan(arg);scan(rest...);}
template<typename T> void print(T n){printn(n);pc(10);}
template<typename First, typename ... Ints> void print(First arg, Ints... rest){printn(arg);pc(32);print(rest...);}

const int MM = 2502;

int n, m, ans, stl, vecl;
int first[MM], last[MM], bit[MM];
std::pair<int, int> st[MM], vec[MM];
std::map<int, int, std::greater<int>> hor[MM][MM], vert[MM][MM];

inline void update(int i, int v){
    for(; i < MM; i += i&-i)
        bit[i] += v;
}

inline int query(int i){
    int ret = 0;
    for(; i; i -= i&-i)
        ret += bit[i];
    return ret;
}

long long count_rectangles(std::vector<std::vector<int>> a){
    n = a.size(), m = a[0].size();
    
    for(int i = 0; i < n; i++){
        stl = 0;
        for(int j = 0; j < m; j++){
            //remove duplicates
            while(stl && st[stl].first < a[i][j])
                stl--;
            first[j] = (!stl || st[stl].first == a[i][j]) ? -1 : st[stl].second;
            st[++stl] = {a[i][j], j};
        }
        stl = 0;
        for(int j = m-1; j >= 0; j--){
            while(stl && st[stl].first <= a[i][j])
                stl--;
            last[j] = !stl ? -1 : st[stl].second;
            st[++stl] = {a[i][j], j};
        }
        for(int j = 0; j < m; j++){
            if(first[j] == -1 || last[j] == -1)
                continue;
            
            first[j]++, last[j]--;
            
            hor[i][first[j]][last[j]] = 1;
        }
    }
    
    for(int j = 0; j < m; j++){
        stl = 0;
        for(int i = 0; i < n; i++){
            //remove duplicates
            while(stl && st[stl].first < a[i][j])
                stl--;
            first[i] = (!stl || st[stl].first == a[i][j]) ? -1 : st[stl].second;
            st[++stl] = {a[i][j], i};
        }
        stl = 0;
        for(int i = n-1; i >= 0; i--){
            while(stl && st[stl].first <= a[i][j])
                stl--;
            last[i] = !stl ? -1 : st[stl].second;
            st[++stl] = {a[i][j], i};
        }
        for(int i = 0; i < n; i++){
            if(first[i] == -1 || last[i] == -1)
                continue;
            
            first[i]++, last[i]--;
            
            vert[first[i]][j][last[i]] = 1;
        }
    }
    
    for(int i = n-1; i >= 0; i--){
        for(int j = m-1; j >= 0; j--){
    
            for(auto &x: vert[i][j])
                if(vert[i][j+1].count(x.first))
                    x.second += vert[i][j+1][x.first];
            
            for(auto &x: hor[i][j]){
                if(hor[i+1][j].count(x.first))
                    x.second += hor[i+1][j][x.first];
                vec[vecl++] = {x.first-j+1, x.second};
            }
            sort(vec, vec+vecl, [](const std::pair<int, int> &x, const std::pair<int, int> &y){
                return x.second > y.second;
            });
            
            int l = 0;
            
            for(auto &b: vert[i][j]){
                int bf = b.first-i+1;
                
                while(l < vecl && bf <= vec[l].second)
                    update(vec[l++].first, 1);
                ans += query(b.second);
            }
            
            while(l)
                update(vec[--l].first, -1);
            
            vecl = 0;
        }
    }
    
    return ans;
}

#ifndef ONLINE_JUDGE
int notmain(){
    
    print(count_rectangles({{4, 8, 7, 5, 6},
    {7, 4, 10, 3, 5},
    {9, 7, 20, 14, 2},
    {9, 14, 7, 3, 6},
    {5, 7, 5, 2, 7},
    {4, 5, 13, 5, 6}})
    );
    
    return 0;
}
#endif

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 597 ms 588340 KB Output is correct
2 Correct 529 ms 588532 KB Output is correct
3 Correct 545 ms 588376 KB Output is correct
4 Correct 525 ms 588408 KB Output is correct
5 Correct 552 ms 588536 KB Output is correct
6 Correct 616 ms 588468 KB Output is correct
7 Correct 574 ms 588536 KB Output is correct
8 Correct 526 ms 588444 KB Output is correct
9 Correct 524 ms 588520 KB Output is correct
10 Correct 538 ms 588456 KB Output is correct
11 Correct 528 ms 588404 KB Output is correct
12 Correct 524 ms 588428 KB Output is correct
13 Correct 525 ms 588344 KB Output is correct
14 Correct 585 ms 588452 KB Output is correct
15 Correct 567 ms 588584 KB Output is correct
16 Correct 595 ms 588536 KB Output is correct
17 Correct 524 ms 588408 KB Output is correct
18 Correct 527 ms 588540 KB Output is correct
19 Correct 528 ms 588348 KB Output is correct
20 Correct 525 ms 588404 KB Output is correct
21 Correct 536 ms 588476 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 597 ms 588340 KB Output is correct
2 Correct 529 ms 588532 KB Output is correct
3 Correct 545 ms 588376 KB Output is correct
4 Correct 525 ms 588408 KB Output is correct
5 Correct 552 ms 588536 KB Output is correct
6 Correct 616 ms 588468 KB Output is correct
7 Correct 574 ms 588536 KB Output is correct
8 Correct 526 ms 588444 KB Output is correct
9 Correct 524 ms 588520 KB Output is correct
10 Correct 538 ms 588456 KB Output is correct
11 Correct 528 ms 588404 KB Output is correct
12 Correct 524 ms 588428 KB Output is correct
13 Correct 525 ms 588344 KB Output is correct
14 Correct 585 ms 588452 KB Output is correct
15 Correct 567 ms 588584 KB Output is correct
16 Correct 595 ms 588536 KB Output is correct
17 Correct 557 ms 589088 KB Output is correct
18 Correct 594 ms 589036 KB Output is correct
19 Correct 530 ms 589020 KB Output is correct
20 Correct 530 ms 588656 KB Output is correct
21 Correct 530 ms 589036 KB Output is correct
22 Correct 531 ms 588996 KB Output is correct
23 Correct 556 ms 589148 KB Output is correct
24 Correct 529 ms 588624 KB Output is correct
25 Correct 524 ms 588408 KB Output is correct
26 Correct 527 ms 588540 KB Output is correct
27 Correct 528 ms 588348 KB Output is correct
28 Correct 525 ms 588404 KB Output is correct
29 Correct 536 ms 588476 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 597 ms 588340 KB Output is correct
2 Correct 529 ms 588532 KB Output is correct
3 Correct 545 ms 588376 KB Output is correct
4 Correct 525 ms 588408 KB Output is correct
5 Correct 552 ms 588536 KB Output is correct
6 Correct 616 ms 588468 KB Output is correct
7 Correct 574 ms 588536 KB Output is correct
8 Correct 526 ms 588444 KB Output is correct
9 Correct 524 ms 588520 KB Output is correct
10 Correct 538 ms 588456 KB Output is correct
11 Correct 528 ms 588404 KB Output is correct
12 Correct 524 ms 588428 KB Output is correct
13 Correct 525 ms 588344 KB Output is correct
14 Correct 585 ms 588452 KB Output is correct
15 Correct 567 ms 588584 KB Output is correct
16 Correct 595 ms 588536 KB Output is correct
17 Correct 557 ms 589088 KB Output is correct
18 Correct 594 ms 589036 KB Output is correct
19 Correct 530 ms 589020 KB Output is correct
20 Correct 530 ms 588656 KB Output is correct
21 Correct 530 ms 589036 KB Output is correct
22 Correct 531 ms 588996 KB Output is correct
23 Correct 556 ms 589148 KB Output is correct
24 Correct 529 ms 588624 KB Output is correct
25 Correct 543 ms 592692 KB Output is correct
26 Correct 545 ms 592776 KB Output is correct
27 Correct 543 ms 592716 KB Output is correct
28 Correct 636 ms 590240 KB Output is correct
29 Correct 547 ms 592364 KB Output is correct
30 Correct 547 ms 592608 KB Output is correct
31 Correct 551 ms 592256 KB Output is correct
32 Correct 544 ms 592320 KB Output is correct
33 Correct 524 ms 588408 KB Output is correct
34 Correct 527 ms 588540 KB Output is correct
35 Correct 528 ms 588348 KB Output is correct
36 Correct 525 ms 588404 KB Output is correct
37 Correct 536 ms 588476 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 597 ms 588340 KB Output is correct
2 Correct 529 ms 588532 KB Output is correct
3 Correct 545 ms 588376 KB Output is correct
4 Correct 525 ms 588408 KB Output is correct
5 Correct 552 ms 588536 KB Output is correct
6 Correct 616 ms 588468 KB Output is correct
7 Correct 574 ms 588536 KB Output is correct
8 Correct 526 ms 588444 KB Output is correct
9 Correct 524 ms 588520 KB Output is correct
10 Correct 538 ms 588456 KB Output is correct
11 Correct 528 ms 588404 KB Output is correct
12 Correct 524 ms 588428 KB Output is correct
13 Correct 525 ms 588344 KB Output is correct
14 Correct 585 ms 588452 KB Output is correct
15 Correct 567 ms 588584 KB Output is correct
16 Correct 595 ms 588536 KB Output is correct
17 Correct 557 ms 589088 KB Output is correct
18 Correct 594 ms 589036 KB Output is correct
19 Correct 530 ms 589020 KB Output is correct
20 Correct 530 ms 588656 KB Output is correct
21 Correct 530 ms 589036 KB Output is correct
22 Correct 531 ms 588996 KB Output is correct
23 Correct 556 ms 589148 KB Output is correct
24 Correct 529 ms 588624 KB Output is correct
25 Correct 543 ms 592692 KB Output is correct
26 Correct 545 ms 592776 KB Output is correct
27 Correct 543 ms 592716 KB Output is correct
28 Correct 636 ms 590240 KB Output is correct
29 Correct 547 ms 592364 KB Output is correct
30 Correct 547 ms 592608 KB Output is correct
31 Correct 551 ms 592256 KB Output is correct
32 Correct 544 ms 592320 KB Output is correct
33 Correct 650 ms 618052 KB Output is correct
34 Correct 670 ms 617832 KB Output is correct
35 Correct 625 ms 617836 KB Output is correct
36 Correct 676 ms 617952 KB Output is correct
37 Correct 732 ms 640948 KB Output is correct
38 Correct 725 ms 640648 KB Output is correct
39 Correct 727 ms 641072 KB Output is correct
40 Correct 749 ms 637816 KB Output is correct
41 Correct 627 ms 604792 KB Output is correct
42 Correct 705 ms 611116 KB Output is correct
43 Correct 844 ms 638584 KB Output is correct
44 Correct 808 ms 640312 KB Output is correct
45 Correct 680 ms 614568 KB Output is correct
46 Correct 695 ms 614760 KB Output is correct
47 Correct 828 ms 636136 KB Output is correct
48 Correct 924 ms 637048 KB Output is correct
49 Correct 524 ms 588408 KB Output is correct
50 Correct 527 ms 588540 KB Output is correct
51 Correct 528 ms 588348 KB Output is correct
52 Correct 525 ms 588404 KB Output is correct
53 Correct 536 ms 588476 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 528 ms 588976 KB Output is correct
2 Correct 527 ms 589040 KB Output is correct
3 Correct 528 ms 588468 KB Output is correct
4 Correct 532 ms 588408 KB Output is correct
5 Correct 530 ms 588840 KB Output is correct
6 Correct 556 ms 589036 KB Output is correct
7 Correct 538 ms 589048 KB Output is correct
8 Correct 562 ms 588884 KB Output is correct
9 Correct 543 ms 588920 KB Output is correct
10 Correct 594 ms 588792 KB Output is correct
11 Correct 556 ms 588704 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 586 ms 588392 KB Output is correct
2 Correct 1231 ms 680952 KB Output is correct
3 Correct 2020 ms 786548 KB Output is correct
4 Correct 2049 ms 786992 KB Output is correct
5 Correct 1984 ms 787036 KB Output is correct
6 Correct 654 ms 614708 KB Output is correct
7 Correct 824 ms 637944 KB Output is correct
8 Correct 868 ms 640792 KB Output is correct
9 Correct 524 ms 588408 KB Output is correct
10 Correct 527 ms 588540 KB Output is correct
11 Correct 528 ms 588348 KB Output is correct
12 Correct 525 ms 588404 KB Output is correct
13 Correct 536 ms 588476 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 597 ms 588340 KB Output is correct
2 Correct 529 ms 588532 KB Output is correct
3 Correct 545 ms 588376 KB Output is correct
4 Correct 525 ms 588408 KB Output is correct
5 Correct 552 ms 588536 KB Output is correct
6 Correct 616 ms 588468 KB Output is correct
7 Correct 574 ms 588536 KB Output is correct
8 Correct 526 ms 588444 KB Output is correct
9 Correct 524 ms 588520 KB Output is correct
10 Correct 538 ms 588456 KB Output is correct
11 Correct 528 ms 588404 KB Output is correct
12 Correct 524 ms 588428 KB Output is correct
13 Correct 525 ms 588344 KB Output is correct
14 Correct 585 ms 588452 KB Output is correct
15 Correct 567 ms 588584 KB Output is correct
16 Correct 595 ms 588536 KB Output is correct
17 Correct 557 ms 589088 KB Output is correct
18 Correct 594 ms 589036 KB Output is correct
19 Correct 530 ms 589020 KB Output is correct
20 Correct 530 ms 588656 KB Output is correct
21 Correct 530 ms 589036 KB Output is correct
22 Correct 531 ms 588996 KB Output is correct
23 Correct 556 ms 589148 KB Output is correct
24 Correct 529 ms 588624 KB Output is correct
25 Correct 543 ms 592692 KB Output is correct
26 Correct 545 ms 592776 KB Output is correct
27 Correct 543 ms 592716 KB Output is correct
28 Correct 636 ms 590240 KB Output is correct
29 Correct 547 ms 592364 KB Output is correct
30 Correct 547 ms 592608 KB Output is correct
31 Correct 551 ms 592256 KB Output is correct
32 Correct 544 ms 592320 KB Output is correct
33 Correct 650 ms 618052 KB Output is correct
34 Correct 670 ms 617832 KB Output is correct
35 Correct 625 ms 617836 KB Output is correct
36 Correct 676 ms 617952 KB Output is correct
37 Correct 732 ms 640948 KB Output is correct
38 Correct 725 ms 640648 KB Output is correct
39 Correct 727 ms 641072 KB Output is correct
40 Correct 749 ms 637816 KB Output is correct
41 Correct 627 ms 604792 KB Output is correct
42 Correct 705 ms 611116 KB Output is correct
43 Correct 844 ms 638584 KB Output is correct
44 Correct 808 ms 640312 KB Output is correct
45 Correct 680 ms 614568 KB Output is correct
46 Correct 695 ms 614760 KB Output is correct
47 Correct 828 ms 636136 KB Output is correct
48 Correct 924 ms 637048 KB Output is correct
49 Correct 528 ms 588976 KB Output is correct
50 Correct 527 ms 589040 KB Output is correct
51 Correct 528 ms 588468 KB Output is correct
52 Correct 532 ms 588408 KB Output is correct
53 Correct 530 ms 588840 KB Output is correct
54 Correct 556 ms 589036 KB Output is correct
55 Correct 538 ms 589048 KB Output is correct
56 Correct 562 ms 588884 KB Output is correct
57 Correct 543 ms 588920 KB Output is correct
58 Correct 594 ms 588792 KB Output is correct
59 Correct 556 ms 588704 KB Output is correct
60 Correct 586 ms 588392 KB Output is correct
61 Correct 1231 ms 680952 KB Output is correct
62 Correct 2020 ms 786548 KB Output is correct
63 Correct 2049 ms 786992 KB Output is correct
64 Correct 1984 ms 787036 KB Output is correct
65 Correct 654 ms 614708 KB Output is correct
66 Correct 824 ms 637944 KB Output is correct
67 Correct 868 ms 640792 KB Output is correct
68 Correct 2371 ms 931696 KB Output is correct
69 Correct 2818 ms 931756 KB Output is correct
70 Correct 1971 ms 931632 KB Output is correct
71 Correct 2243 ms 931636 KB Output is correct
72 Runtime error 1618 ms 1048576 KB Execution killed with signal 9 (could be triggered by violating memory limits)
73 Halted 0 ms 0 KB -