oj.uz

Submission #298457

# Submission time Handle Problem Language Result Execution time Memory
298457 2020-09-12T21:37:15 Z arayi Rectangles (IOI19_rect) C++17
59 / 100
 5000 ms 183952 KB 
#include "rect.h"
#include <bits/stdc++.h>
#define MP make_pair
#define sc second
#define fr first
#define ad push_back
#define lli long long int
using namespace std;

const int N = 2525;
int n, m;
int aj[N][N], dz[N][N], nr[N][N], vr[N][N];
vector <pair<int, int> > fp[N], fp1[N];
int ajnr[N][N], ajvr[N][N], dznr[N][N], dzvr[N][N];
lli col[N][N], pat;
long long count_rectangles(vector<vector<int> > a)
{
	n = a.size(), m = a[0].size();
	for (int i = 0; i < n; i++)
	{
	    for(int j = 0; j < m; j++)
	    {
	        int i1;
	        i1 = 0;
	        while(j + i1 + 1 < m && a[i][j + i1 + 1] < a[i][j]) i1++;
	        aj[i][j] = i1;
	        i1 = 0;
	        while(j - i1 - 1 >= 0 && a[i][j - i1 - 1] < a[i][j]) i1++;
	        dz[i][j] = i1;
	        i1 = 0;
	        while(i + i1 + 1 < n && a[i + i1 + 1][j] < a[i][j]) i1++;
	        nr[i][j] = i1;
            i1 = 0;
	        while(i - i1 - 1 >= 0 && a[i - i1 - 1][j] < a[i][j]) i1++;
	        vr[i][j] = i1;
	        fp[nr[i][j]].ad(MP(i, j));
	        fp1[vr[i][j]].ad(MP(i, j));
	        ajnr[i][j] = ajvr[i][j] = m - j;
	        dznr[i][j] = dzvr[i][j] = j;
	    }
	}
	for(int l = 1; l < n - 1; l++)
    {
        for(auto p : fp[l - 1])
        {
            //if(l == 1) cout << p.fr << " " << p.sc << " " << endl;
            for(int j = p.sc; j < m; j++)
                dznr[p.fr][j] = min(dznr[p.fr][j], j - p.sc);
            for(int j = p.sc; j >= 0; j--)
                ajnr[p.fr][j] = min(ajnr[p.fr][j], p.sc - j);
        }
        for(auto p : fp1[l - 1])
        {
             for(int j = p.sc; j < m; j++)
                dzvr[p.fr][j] = min(dzvr[p.fr][j], j - p.sc);
            for(int j = p.sc; j >= 0; j--)
                ajvr[p.fr][j] = min(ajvr[p.fr][j], p.sc - j);
        }
        for (int i = n - 1; i >= l; i--)
            for(int j = 0; j < m; j++)
                if(l > 1) dz[i][j] = min(dz[i][j], dz[i - 1][j]);
        //cout << dz[4][4] << endl;
        for (int i = n - 1; i >= l; i--)
        {
            for(int j = 0; j < m - 1; j++)
            {
                if(l > 1) aj[i][j] = min(aj[i][j], aj[i - 1][j]);
                int sm = min(ajvr[i + 1][j + 1], ajnr[i - l][j + 1]);
                sm = min(sm, aj[i][j]);
                //if(l == 2) cout << sm << " ";
                for(int k = j + 2; k < min(m, j + sm + 2); k++)
                    if(k - j - 1 <= dz[i][k]) pat++;
            }
            //if(l == 2) cout << endl;
        }
        //cout << pat << endl;
    }
    return pat;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 2 ms 1408 KB Output is correct
3 Correct 1 ms 1408 KB Output is correct
4 Correct 1 ms 1408 KB Output is correct
5 Correct 1 ms 1408 KB Output is correct
6 Correct 1 ms 1408 KB Output is correct
7 Correct 1 ms 1536 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 2 ms 1408 KB Output is correct
10 Correct 2 ms 1408 KB Output is correct
11 Correct 1 ms 1408 KB Output is correct
12 Correct 1 ms 1408 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 1 ms 1536 KB Output is correct
20 Correct 1 ms 1408 KB Output is correct
21 Correct 1 ms 768 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 2 ms 1408 KB Output is correct
3 Correct 1 ms 1408 KB Output is correct
4 Correct 1 ms 1408 KB Output is correct
5 Correct 1 ms 1408 KB Output is correct
6 Correct 1 ms 1408 KB Output is correct
7 Correct 1 ms 1536 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 2 ms 1408 KB Output is correct
10 Correct 2 ms 1408 KB Output is correct
11 Correct 1 ms 1408 KB Output is correct
12 Correct 1 ms 1408 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 5 ms 3456 KB Output is correct
18 Correct 6 ms 3456 KB Output is correct
19 Correct 5 ms 3456 KB Output is correct
20 Correct 5 ms 3456 KB Output is correct
21 Correct 5 ms 3456 KB Output is correct
22 Correct 6 ms 3456 KB Output is correct
23 Correct 5 ms 3456 KB Output is correct
24 Correct 3 ms 3200 KB Output is correct
25 Correct 1 ms 512 KB Output is correct
26 Correct 1 ms 512 KB Output is correct
27 Correct 1 ms 1536 KB Output is correct
28 Correct 1 ms 1408 KB Output is correct
29 Correct 1 ms 768 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 2 ms 1408 KB Output is correct
3 Correct 1 ms 1408 KB Output is correct
4 Correct 1 ms 1408 KB Output is correct
5 Correct 1 ms 1408 KB Output is correct
6 Correct 1 ms 1408 KB Output is correct
7 Correct 1 ms 1536 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 2 ms 1408 KB Output is correct
10 Correct 2 ms 1408 KB Output is correct
11 Correct 1 ms 1408 KB Output is correct
12 Correct 1 ms 1408 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 5 ms 3456 KB Output is correct
18 Correct 6 ms 3456 KB Output is correct
19 Correct 5 ms 3456 KB Output is correct
20 Correct 5 ms 3456 KB Output is correct
21 Correct 5 ms 3456 KB Output is correct
22 Correct 6 ms 3456 KB Output is correct
23 Correct 5 ms 3456 KB Output is correct
24 Correct 3 ms 3200 KB Output is correct
25 Correct 50 ms 9208 KB Output is correct
26 Correct 50 ms 9208 KB Output is correct
27 Correct 64 ms 9208 KB Output is correct
28 Correct 44 ms 9164 KB Output is correct
29 Correct 42 ms 9208 KB Output is correct
30 Correct 44 ms 9208 KB Output is correct
31 Correct 48 ms 9208 KB Output is correct
32 Correct 46 ms 9080 KB Output is correct
33 Correct 1 ms 512 KB Output is correct
34 Correct 1 ms 512 KB Output is correct
35 Correct 1 ms 1536 KB Output is correct
36 Correct 1 ms 1408 KB Output is correct
37 Correct 1 ms 768 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 2 ms 1408 KB Output is correct
3 Correct 1 ms 1408 KB Output is correct
4 Correct 1 ms 1408 KB Output is correct
5 Correct 1 ms 1408 KB Output is correct
6 Correct 1 ms 1408 KB Output is correct
7 Correct 1 ms 1536 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 2 ms 1408 KB Output is correct
10 Correct 2 ms 1408 KB Output is correct
11 Correct 1 ms 1408 KB Output is correct
12 Correct 1 ms 1408 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 5 ms 3456 KB Output is correct
18 Correct 6 ms 3456 KB Output is correct
19 Correct 5 ms 3456 KB Output is correct
20 Correct 5 ms 3456 KB Output is correct
21 Correct 5 ms 3456 KB Output is correct
22 Correct 6 ms 3456 KB Output is correct
23 Correct 5 ms 3456 KB Output is correct
24 Correct 3 ms 3200 KB Output is correct
25 Correct 50 ms 9208 KB Output is correct
26 Correct 50 ms 9208 KB Output is correct
27 Correct 64 ms 9208 KB Output is correct
28 Correct 44 ms 9164 KB Output is correct
29 Correct 42 ms 9208 KB Output is correct
30 Correct 44 ms 9208 KB Output is correct
31 Correct 48 ms 9208 KB Output is correct
32 Correct 46 ms 9080 KB Output is correct
33 Correct 1814 ms 51876 KB Output is correct
34 Correct 1830 ms 51940 KB Output is correct
35 Correct 1827 ms 51872 KB Output is correct
36 Correct 1825 ms 51972 KB Output is correct
37 Correct 1928 ms 51808 KB Output is correct
38 Correct 1910 ms 51828 KB Output is correct
39 Correct 1911 ms 51804 KB Output is correct
40 Correct 1726 ms 48384 KB Output is correct
41 Correct 1462 ms 50472 KB Output is correct
42 Correct 1469 ms 51604 KB Output is correct
43 Correct 1491 ms 51536 KB Output is correct
44 Correct 1521 ms 51536 KB Output is correct
45 Correct 610 ms 37088 KB Output is correct
46 Correct 544 ms 26072 KB Output is correct
47 Correct 1478 ms 52692 KB Output is correct
48 Correct 1470 ms 53332 KB Output is correct
49 Correct 1 ms 512 KB Output is correct
50 Correct 1 ms 512 KB Output is correct
51 Correct 1 ms 1536 KB Output is correct
52 Correct 1 ms 1408 KB Output is correct
53 Correct 1 ms 768 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 1024 KB Output is correct
2 Correct 23 ms 896 KB Output is correct
3 Correct 34 ms 1144 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 23 ms 1024 KB Output is correct
6 Correct 23 ms 1152 KB Output is correct
7 Correct 23 ms 1024 KB Output is correct
8 Correct 24 ms 1024 KB Output is correct
9 Correct 26 ms 1144 KB Output is correct
10 Correct 1 ms 640 KB Output is correct
11 Correct 1 ms 896 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 768 KB Output is correct
2 Execution timed out 5113 ms 183952 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 2 ms 1408 KB Output is correct
3 Correct 1 ms 1408 KB Output is correct
4 Correct 1 ms 1408 KB Output is correct
5 Correct 1 ms 1408 KB Output is correct
6 Correct 1 ms 1408 KB Output is correct
7 Correct 1 ms 1536 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 2 ms 1408 KB Output is correct
10 Correct 2 ms 1408 KB Output is correct
11 Correct 1 ms 1408 KB Output is correct
12 Correct 1 ms 1408 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 1 ms 768 KB Output is correct
15 Correct 1 ms 768 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 5 ms 3456 KB Output is correct
18 Correct 6 ms 3456 KB Output is correct
19 Correct 5 ms 3456 KB Output is correct
20 Correct 5 ms 3456 KB Output is correct
21 Correct 5 ms 3456 KB Output is correct
22 Correct 6 ms 3456 KB Output is correct
23 Correct 5 ms 3456 KB Output is correct
24 Correct 3 ms 3200 KB Output is correct
25 Correct 50 ms 9208 KB Output is correct
26 Correct 50 ms 9208 KB Output is correct
27 Correct 64 ms 9208 KB Output is correct
28 Correct 44 ms 9164 KB Output is correct
29 Correct 42 ms 9208 KB Output is correct
30 Correct 44 ms 9208 KB Output is correct
31 Correct 48 ms 9208 KB Output is correct
32 Correct 46 ms 9080 KB Output is correct
33 Correct 1814 ms 51876 KB Output is correct
34 Correct 1830 ms 51940 KB Output is correct
35 Correct 1827 ms 51872 KB Output is correct
36 Correct 1825 ms 51972 KB Output is correct
37 Correct 1928 ms 51808 KB Output is correct
38 Correct 1910 ms 51828 KB Output is correct
39 Correct 1911 ms 51804 KB Output is correct
40 Correct 1726 ms 48384 KB Output is correct
41 Correct 1462 ms 50472 KB Output is correct
42 Correct 1469 ms 51604 KB Output is correct
43 Correct 1491 ms 51536 KB Output is correct
44 Correct 1521 ms 51536 KB Output is correct
45 Correct 610 ms 37088 KB Output is correct
46 Correct 544 ms 26072 KB Output is correct
47 Correct 1478 ms 52692 KB Output is correct
48 Correct 1470 ms 53332 KB Output is correct
49 Correct 31 ms 1024 KB Output is correct
50 Correct 23 ms 896 KB Output is correct
51 Correct 34 ms 1144 KB Output is correct
52 Correct 1 ms 640 KB Output is correct
53 Correct 23 ms 1024 KB Output is correct
54 Correct 23 ms 1152 KB Output is correct
55 Correct 23 ms 1024 KB Output is correct
56 Correct 24 ms 1024 KB Output is correct
57 Correct 26 ms 1144 KB Output is correct
58 Correct 1 ms 640 KB Output is correct
59 Correct 1 ms 896 KB Output is correct
60 Correct 1 ms 768 KB Output is correct
61 Execution timed out 5113 ms 183952 KB Time limit exceeded
62 Halted 0 ms 0 KB -