oj.uz

Submission #203475

# Submission time Handle Problem Language Result Execution time Memory
203475 2020-02-20T21:21:50 Z stefdasca Rectangles (IOI19_rect) C++14
62 / 100
 1936 ms 74104 KB 
#include "rect.h"
#include<bits/stdc++.h>
using namespace std;
long long count_rectangles(vector<vector<int> > a)
{
    int n = a.size();
    int m = a[0].size();
    int max_val = 0;
    int min_val = (1<<30);
	for(int i = 0; i < n; ++i)
        for(int j = 0; j < m; ++j)
        {
            max_val = max(max_val, a[i][j]);
            min_val = min(min_val, a[i][j]);
        }
    if(max_val == min_val)
        return 0;
    long long ans = 0;
    if(max_val == 1)
    {
        vector<vector<int> >viz(n, vector<int>(m));
        for(int i = 0; i < n; ++i)
            for(int j = 0; j < m; ++j)
                viz[i][j] = 0;
        for(int i = 0; i < n; ++i)
            for(int j = 0; j < m; ++j)
            {
                if(a[i][j] == 0 && !viz[i][j])
                {
                    int minix = i, maxix = i, miniy = j, maxiy = j;
                    int cnt = 1;
                    viz[i][j] = 1;
                    deque<pair<int, int> >d;
                    d.push_back({i, j});
                    while(!d.empty())
                    {
                        pair<int, int> nod = d[0];
                        d.pop_front();
                        for(int ox = -1; ox <= 1; ++ox)
                            for(int oy = -1; oy <= 1; ++oy)
                            {
                                if(ox && oy)
                                    continue;
                                if(!ox && !oy)
                                    continue;
                                int new_x = nod.first + ox;
                                int new_y = nod.second + oy;
                                if(new_x >= 0 && new_y >= 0 && new_x < n && new_y < m)
                                {
                                    if(a[new_x][new_y] == 0 && !viz[new_x][new_y])
                                    {
                                        viz[new_x][new_y] = 1;
                                        d.push_back({new_x, new_y});
                                        minix = min(minix, new_x);
                                        maxix = max(maxix, new_x);
                                        miniy = min(miniy, new_y);
                                        maxiy = max(maxiy, new_y);
                                        ++cnt;
                                    }
                                }
                            }
                    }
                    if(minix && miniy && maxix < n-1 && maxiy < m-1)
                    {
                        if(cnt == (maxix - minix + 1) * (maxiy - miniy + 1))
                            ++ans;
                    }
                }
            }
    }
    else
        if(n <= 700)
        {
            int maxst[702][702], maxdr[702][702], maxup[702][702], maxdwn[702][702];
            deque<int> d;
            for(int i = 0; i < n; ++i)
            {
                for(int j = 0; j < m; ++j)
                {
                    while(!d.empty() && a[i][j] > a[i][d.back()])
                        d.pop_back();
                    if(d.empty())
                        maxst[i][j] = -1;
                    else
                        maxst[i][j] = d.back();
                    d.push_back(j);
                }
                d.clear();
                for(int j = m - 1; j >= 0; --j)
                {
                    while(!d.empty() && a[i][j] > a[i][d.back()])
                        d.pop_back();
                    if(d.empty())
                        maxdr[i][j] = m;
                    else
                        maxdr[i][j] = d.back();
                    d.push_back(j);
                }
                d.clear();
            }
            for(int i = 0; i < m; ++i)
            {
                for(int j = 0; j < n; ++j)
                {
                    while(!d.empty() && a[j][i] > a[d.back()][i])
                        d.pop_back();
                    if(d.empty())
                        maxup[j][i] = -1;
                    else
                        maxup[j][i] = d.back();
                    d.push_back(j);
                }
                d.clear();
                for(int j = n-1; j >= 0; --j)
                {
                    while(!d.empty() && a[j][i] > a[d.back()][i])
                        d.pop_back();
                    if(d.empty())
                        maxdwn[j][i] = n;
                    else
                        maxdwn[j][i] = d.back();
                    d.push_back(j);
                }
                d.clear();
            }
            int rmq[702][12][702];
            int rmq2[702][12][702];
            int Logg[702] = {0};
            for(int i = 2; i <= 700; ++i)
                Logg[i] = Logg[i/2] + 1;
            for(int i = 0; i < m; ++i)
            {
                for(int j = 0; j < n; ++j)
                    rmq[i][0][j] = maxst[j][i];
                for(int stp = 1; (1<<stp) <= n; ++stp)
                    for(int j = 0; j + (1<<stp) - 1 < n; ++j)
                        rmq[i][stp][j] = max(rmq[i][stp-1][j], rmq[i][stp-1][j + (1<<(stp - 1))]);

                for(int j = 0; j < n; ++j)
                    rmq2[i][0][j] = maxdr[j][i];
                for(int stp = 1; (1<<stp) <= n; ++stp)
                    for(int j = 0; j + (1<<stp) - 1 < n; ++j)
                        rmq2[i][stp][j] = min(rmq2[i][stp-1][j], rmq2[i][stp-1][j + (1<<(stp - 1))]);
            }
            for(int borderup = 0; borderup < n; ++borderup)
                for(int borderdown = borderup + 2; borderdown < n; ++borderdown)
                {
                    for(int i = 0; i + 2 < m; ++i)
                    {
                        int lg = Logg[borderdown - borderup - 1];
                        int mx = min(rmq2[i][lg][borderup + 1], rmq2[i][lg][(borderdown - 1) - (1<<lg) + 1]);
                      //  cout << borderup << " " << borderdown << " " << i << " " << mx << '\n';
                        bool ok = 1;
                        for(int j = i+1; j < mx && ok; ++j)
                        {
                            ok &= (maxdwn[borderup][j] >= borderdown && maxup[borderdown][j] <= borderup);
                            if(ok && j+1 < m)
                            {
                                int mx2 = max(rmq[j+1][lg][borderup + 1], rmq[j+1][lg][(borderdown - 1) - (1<<lg) + 1]);
                                if(mx2 <= i)
                                    ++ans;
                            }
                        }
                      //  cout << ans << '\n';
                    }
                }
        }
	return ans;
}

Compilation message

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:71:5: warning: this 'else' clause does not guard... [-Wmisleading-indentation]
     else
     ^~~~
rect.cpp:168:2: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'else'
  return ans;
  ^~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

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

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 5 ms 1656 KB Output is correct
3 Correct 5 ms 1528 KB Output is correct
4 Correct 6 ms 1656 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 1656 KB Output is correct
7 Correct 5 ms 1016 KB Output is correct
8 Correct 6 ms 1144 KB Output is correct
9 Correct 6 ms 1512 KB Output is correct
10 Correct 6 ms 1656 KB Output is correct
11 Correct 5 ms 1528 KB Output is correct
12 Correct 5 ms 1656 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 9 ms 4600 KB Output is correct
18 Correct 9 ms 4600 KB Output is correct
19 Correct 9 ms 4600 KB Output is correct
20 Correct 8 ms 4600 KB Output is correct
21 Correct 9 ms 4600 KB Output is correct
22 Correct 9 ms 4600 KB Output is correct
23 Correct 9 ms 4600 KB Output is correct
24 Correct 7 ms 2936 KB Output is correct
25 Correct 48 ms 12536 KB Output is correct
26 Correct 46 ms 12536 KB Output is correct
27 Correct 46 ms 12536 KB Output is correct
28 Correct 29 ms 12280 KB Output is correct
29 Correct 34 ms 12412 KB Output is correct
30 Correct 32 ms 12640 KB Output is correct
31 Correct 31 ms 12536 KB Output is correct
32 Correct 35 ms 12408 KB Output is correct
33 Correct 5 ms 256 KB Output is correct
34 Correct 4 ms 256 KB Output is correct
35 Correct 5 ms 376 KB Output is correct
36 Correct 4 ms 376 KB Output is correct
37 Correct 5 ms 256 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 5 ms 1656 KB Output is correct
3 Correct 5 ms 1528 KB Output is correct
4 Correct 6 ms 1656 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 1656 KB Output is correct
7 Correct 5 ms 1016 KB Output is correct
8 Correct 6 ms 1144 KB Output is correct
9 Correct 6 ms 1512 KB Output is correct
10 Correct 6 ms 1656 KB Output is correct
11 Correct 5 ms 1528 KB Output is correct
12 Correct 5 ms 1656 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 9 ms 4600 KB Output is correct
18 Correct 9 ms 4600 KB Output is correct
19 Correct 9 ms 4600 KB Output is correct
20 Correct 8 ms 4600 KB Output is correct
21 Correct 9 ms 4600 KB Output is correct
22 Correct 9 ms 4600 KB Output is correct
23 Correct 9 ms 4600 KB Output is correct
24 Correct 7 ms 2936 KB Output is correct
25 Correct 48 ms 12536 KB Output is correct
26 Correct 46 ms 12536 KB Output is correct
27 Correct 46 ms 12536 KB Output is correct
28 Correct 29 ms 12280 KB Output is correct
29 Correct 34 ms 12412 KB Output is correct
30 Correct 32 ms 12640 KB Output is correct
31 Correct 31 ms 12536 KB Output is correct
32 Correct 35 ms 12408 KB Output is correct
33 Correct 1157 ms 56440 KB Output is correct
34 Correct 1195 ms 56372 KB Output is correct
35 Correct 1161 ms 56444 KB Output is correct
36 Correct 1147 ms 56440 KB Output is correct
37 Correct 1885 ms 56440 KB Output is correct
38 Correct 1936 ms 56444 KB Output is correct
39 Correct 1912 ms 56780 KB Output is correct
40 Correct 1665 ms 55776 KB Output is correct
41 Correct 35 ms 7160 KB Output is correct
42 Correct 968 ms 54264 KB Output is correct
43 Correct 1093 ms 54904 KB Output is correct
44 Correct 1008 ms 56952 KB Output is correct
45 Correct 393 ms 32504 KB Output is correct
46 Correct 274 ms 44920 KB Output is correct
47 Correct 1073 ms 56056 KB Output is correct
48 Correct 1064 ms 57080 KB Output is correct
49 Correct 5 ms 256 KB Output is correct
50 Correct 4 ms 256 KB Output is correct
51 Correct 5 ms 376 KB Output is correct
52 Correct 4 ms 376 KB Output is correct
53 Correct 5 ms 256 KB Output is correct

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 34 ms 19960 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 191 ms 34040 KB Output is correct
3 Correct 412 ms 73676 KB Output is correct
4 Correct 405 ms 73976 KB Output is correct
5 Correct 413 ms 73976 KB Output is correct
6 Correct 237 ms 36728 KB Output is correct
7 Correct 532 ms 69496 KB Output is correct
8 Correct 592 ms 74104 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 4 ms 256 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 4 ms 376 KB Output is correct
13 Correct 5 ms 256 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 5 ms 1656 KB Output is correct
3 Correct 5 ms 1528 KB Output is correct
4 Correct 6 ms 1656 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 1656 KB Output is correct
7 Correct 5 ms 1016 KB Output is correct
8 Correct 6 ms 1144 KB Output is correct
9 Correct 6 ms 1512 KB Output is correct
10 Correct 6 ms 1656 KB Output is correct
11 Correct 5 ms 1528 KB Output is correct
12 Correct 5 ms 1656 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 5 ms 504 KB Output is correct
15 Correct 5 ms 376 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 9 ms 4600 KB Output is correct
18 Correct 9 ms 4600 KB Output is correct
19 Correct 9 ms 4600 KB Output is correct
20 Correct 8 ms 4600 KB Output is correct
21 Correct 9 ms 4600 KB Output is correct
22 Correct 9 ms 4600 KB Output is correct
23 Correct 9 ms 4600 KB Output is correct
24 Correct 7 ms 2936 KB Output is correct
25 Correct 48 ms 12536 KB Output is correct
26 Correct 46 ms 12536 KB Output is correct
27 Correct 46 ms 12536 KB Output is correct
28 Correct 29 ms 12280 KB Output is correct
29 Correct 34 ms 12412 KB Output is correct
30 Correct 32 ms 12640 KB Output is correct
31 Correct 31 ms 12536 KB Output is correct
32 Correct 35 ms 12408 KB Output is correct
33 Correct 1157 ms 56440 KB Output is correct
34 Correct 1195 ms 56372 KB Output is correct
35 Correct 1161 ms 56444 KB Output is correct
36 Correct 1147 ms 56440 KB Output is correct
37 Correct 1885 ms 56440 KB Output is correct
38 Correct 1936 ms 56444 KB Output is correct
39 Correct 1912 ms 56780 KB Output is correct
40 Correct 1665 ms 55776 KB Output is correct
41 Correct 35 ms 7160 KB Output is correct
42 Correct 968 ms 54264 KB Output is correct
43 Correct 1093 ms 54904 KB Output is correct
44 Correct 1008 ms 56952 KB Output is correct
45 Correct 393 ms 32504 KB Output is correct
46 Correct 274 ms 44920 KB Output is correct
47 Correct 1073 ms 56056 KB Output is correct
48 Correct 1064 ms 57080 KB Output is correct
49 Runtime error 34 ms 19960 KB Execution killed with signal 11 (could be triggered by violating memory limits)
50 Halted 0 ms 0 KB -