oj.uz

Submission #160932

# Submission time Handle Problem Language Result Execution time Memory
160932 2019-10-30T16:04:29 Z georgerapeanu Rectangles (IOI19_rect) C++14
59 / 100
 5000 ms 384256 KB 
#include "rect.h"

#pragma once
#include <vector>
#include <algorithm>
#include <map>

using namespace std;

int aib[2505][2505];
int n,m;
void update_aib(int x,int y,int val){
    x++;
    y++;
    for(int i = x;i;i -= (-i) & i){
        for(int j = y;j;j -= (-j) & j){
            aib[i][j] += val;
        }
    }
}

int query_aib(int x,int y){
    x++;
    y++;
    int ans = 0;
    for(int i = x;i <= max(m,n);i += (-i) & i){
        for(int j = y;j <= max(m,n);j += (-j) & j){
            ans += aib[i][j];
        }
    }
    return ans;
}

long long count_rectangles(std::vector<std::vector<int> > a) {

    map<pair<int,int>,int> h_heights;
    map<pair<int,int>,int> v_heights;

    n = a.size();
    m = a[0].size();

    long long ans = 0;

    vector<vector<int> > v_stack(m,vector<int>(0));
    vector<vector<vector<int> > > tervals(n,vector<vector<int> >(m,vector<int>(0)));
    for(int i = 0;i < n;i++){
        vector<int> h_stack;
        v_heights.clear();
        for(int j = 0;j < m;j++){
            map<pair<int,int>,int> tmp;
            while(v_stack[j].size() > 0 && a[v_stack[j].back()][j] < a[i][j]){
                tmp[{v_stack[j].back(),i}] = 1 + v_heights[{v_stack[j].back(),i}];
                v_stack[j].pop_back();
            }
            if(v_stack[j].size() > 0){
                tmp[{v_stack[j].back(),i}] = 1 + v_heights[{v_stack[j].back(),i}];
            }
            while(v_stack[j].size() > 0 && a[v_stack[j].back()][j] <= a[i][j]){
                v_stack[j].pop_back();
            }
            v_stack[j].push_back(i);
            v_heights = tmp;
            if(i > 0 && j < m - 1){
                for(auto it:tervals[i - 1][j + 1]){
                    if(it == j){
                        continue;
                    }
                    update_aib(it,h_heights[{it,j + 1}],1);
                }

                for(auto it:v_heights){
                    if(it.first.first == it.first.second - 1){
                        continue;
                    }
                    ans += query_aib(max(0,j - it.second),it.first.second - it.first.first - 1);
                }
                
                for(auto it:tervals[i - 1][j + 1]){
                    if(it == j){
                        continue;
                    }
                    update_aib(it,h_heights[{it,j + 1}],-1);
                }
            }
        }
        map<pair<int,int>,int> tmp;
        for(int j = 0;j < m;j++){
            while(h_stack.size() > 0 && a[i][h_stack.back()] < a[i][j]){
                tmp[{h_stack.back(),j}] = 1 + h_heights[{h_stack.back(),j}];
                tervals[i][j].push_back(h_stack.back());
                h_stack.pop_back();
            }
            if(h_stack.size() > 0){
                tmp[{h_stack.back(),j}] = 1 + h_heights[{h_stack.back(),j}];
                tervals[i][j].push_back(h_stack.back());
            }
            while(h_stack.size() > 0 && a[i][h_stack.back()] <= a[i][j]){
                h_stack.pop_back();
            }
            h_stack.push_back(j);
        }
        h_heights = tmp;
    }

	return ans;
}

Compilation message

rect.cpp:3:9: warning: #pragma once in main file
 #pragma once
         ^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 3 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 2 ms 504 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 296 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 3 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 7 ms 1144 KB Output is correct
18 Correct 7 ms 1272 KB Output is correct
19 Correct 7 ms 1272 KB Output is correct
20 Correct 7 ms 1144 KB Output is correct
21 Correct 10 ms 1016 KB Output is correct
22 Correct 10 ms 1016 KB Output is correct
23 Correct 11 ms 1188 KB Output is correct
24 Correct 5 ms 760 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 504 KB Output is correct
27 Correct 2 ms 504 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 296 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 3 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 7 ms 1144 KB Output is correct
18 Correct 7 ms 1272 KB Output is correct
19 Correct 7 ms 1272 KB Output is correct
20 Correct 7 ms 1144 KB Output is correct
21 Correct 10 ms 1016 KB Output is correct
22 Correct 10 ms 1016 KB Output is correct
23 Correct 11 ms 1188 KB Output is correct
24 Correct 5 ms 760 KB Output is correct
25 Correct 47 ms 4472 KB Output is correct
26 Correct 50 ms 4472 KB Output is correct
27 Correct 47 ms 4472 KB Output is correct
28 Correct 35 ms 3708 KB Output is correct
29 Correct 57 ms 3960 KB Output is correct
30 Correct 60 ms 4188 KB Output is correct
31 Correct 56 ms 4088 KB Output is correct
32 Correct 57 ms 4092 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 504 KB Output is correct
35 Correct 2 ms 504 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 296 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 3 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 7 ms 1144 KB Output is correct
18 Correct 7 ms 1272 KB Output is correct
19 Correct 7 ms 1272 KB Output is correct
20 Correct 7 ms 1144 KB Output is correct
21 Correct 10 ms 1016 KB Output is correct
22 Correct 10 ms 1016 KB Output is correct
23 Correct 11 ms 1188 KB Output is correct
24 Correct 5 ms 760 KB Output is correct
25 Correct 47 ms 4472 KB Output is correct
26 Correct 50 ms 4472 KB Output is correct
27 Correct 47 ms 4472 KB Output is correct
28 Correct 35 ms 3708 KB Output is correct
29 Correct 57 ms 3960 KB Output is correct
30 Correct 60 ms 4188 KB Output is correct
31 Correct 56 ms 4088 KB Output is correct
32 Correct 57 ms 4092 KB Output is correct
33 Correct 519 ms 40364 KB Output is correct
34 Correct 524 ms 38696 KB Output is correct
35 Correct 505 ms 40012 KB Output is correct
36 Correct 615 ms 38648 KB Output is correct
37 Correct 687 ms 44928 KB Output is correct
38 Correct 703 ms 44956 KB Output is correct
39 Correct 778 ms 45432 KB Output is correct
40 Correct 675 ms 42860 KB Output is correct
41 Correct 413 ms 35124 KB Output is correct
42 Correct 471 ms 35216 KB Output is correct
43 Correct 823 ms 36604 KB Output is correct
44 Correct 821 ms 38396 KB Output is correct
45 Correct 398 ms 19544 KB Output is correct
46 Correct 421 ms 20860 KB Output is correct
47 Correct 755 ms 37720 KB Output is correct
48 Correct 765 ms 38480 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 504 KB Output is correct
51 Correct 2 ms 504 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 2 ms 296 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 11640 KB Output is correct
2 Correct 16 ms 9976 KB Output is correct
3 Correct 7 ms 1272 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 23 ms 10460 KB Output is correct
6 Correct 22 ms 10360 KB Output is correct
7 Correct 25 ms 10488 KB Output is correct
8 Correct 22 ms 10104 KB Output is correct
9 Correct 20 ms 9976 KB Output is correct
10 Correct 5 ms 1272 KB Output is correct
11 Correct 14 ms 8820 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2660 ms 189668 KB Output is correct
3 Execution timed out 5110 ms 384256 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 3 ms 504 KB Output is correct
11 Correct 3 ms 504 KB Output is correct
12 Correct 3 ms 504 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 3 ms 256 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 7 ms 1144 KB Output is correct
18 Correct 7 ms 1272 KB Output is correct
19 Correct 7 ms 1272 KB Output is correct
20 Correct 7 ms 1144 KB Output is correct
21 Correct 10 ms 1016 KB Output is correct
22 Correct 10 ms 1016 KB Output is correct
23 Correct 11 ms 1188 KB Output is correct
24 Correct 5 ms 760 KB Output is correct
25 Correct 47 ms 4472 KB Output is correct
26 Correct 50 ms 4472 KB Output is correct
27 Correct 47 ms 4472 KB Output is correct
28 Correct 35 ms 3708 KB Output is correct
29 Correct 57 ms 3960 KB Output is correct
30 Correct 60 ms 4188 KB Output is correct
31 Correct 56 ms 4088 KB Output is correct
32 Correct 57 ms 4092 KB Output is correct
33 Correct 519 ms 40364 KB Output is correct
34 Correct 524 ms 38696 KB Output is correct
35 Correct 505 ms 40012 KB Output is correct
36 Correct 615 ms 38648 KB Output is correct
37 Correct 687 ms 44928 KB Output is correct
38 Correct 703 ms 44956 KB Output is correct
39 Correct 778 ms 45432 KB Output is correct
40 Correct 675 ms 42860 KB Output is correct
41 Correct 413 ms 35124 KB Output is correct
42 Correct 471 ms 35216 KB Output is correct
43 Correct 823 ms 36604 KB Output is correct
44 Correct 821 ms 38396 KB Output is correct
45 Correct 398 ms 19544 KB Output is correct
46 Correct 421 ms 20860 KB Output is correct
47 Correct 755 ms 37720 KB Output is correct
48 Correct 765 ms 38480 KB Output is correct
49 Correct 19 ms 11640 KB Output is correct
50 Correct 16 ms 9976 KB Output is correct
51 Correct 7 ms 1272 KB Output is correct
52 Correct 2 ms 256 KB Output is correct
53 Correct 23 ms 10460 KB Output is correct
54 Correct 22 ms 10360 KB Output is correct
55 Correct 25 ms 10488 KB Output is correct
56 Correct 22 ms 10104 KB Output is correct
57 Correct 20 ms 9976 KB Output is correct
58 Correct 5 ms 1272 KB Output is correct
59 Correct 14 ms 8820 KB Output is correct
60 Correct 2 ms 376 KB Output is correct
61 Correct 2660 ms 189668 KB Output is correct
62 Execution timed out 5110 ms 384256 KB Time limit exceeded
63 Halted 0 ms 0 KB -