oj.uz

Submission #145066

# Submission time Handle Problem Language Result Execution time Memory
145066 2019-08-18T16:48:26 Z jwvg0425 Rectangles (IOI19_rect) C++17
59 / 100
 5000 ms 47188 KB 
#include "rect.h"
#include <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <map>
#include <set>
#include <tuple>
#include <string.h>
#include <math.h>
#include <random>
#include <functional>
#include <assert.h>
#include <math.h>
#include <stack>
#define all(x) (x).begin(), (x).end()
#define xx first
#define yy second

using namespace std;

using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;

int up[2505][2505];
int down[2505][2505];

long long count_rectangles(vector<vector<int>> a) {
    int n = a.size();
    int m = a[0].size();

    i64 ans = 0;

    for (int x = 0; x < n; x++)
    {
        for (int y = 0; y < m; y++)
        {
            int yu = y - 1;
            int yd = y + 1;

            while (yd < m && a[x][yd] < a[x][y])
                yd++;

            while (yu >= 0 && a[x][yu] < a[x][y])
                yu--;

            down[x][y] = yd - y - 1;
            up[x][y] = y - yu - 1;
        }
    }

    for (int l = 0; l < n - 2; l++)
    {
        vector<int> dnow(m, 987654321);
        vector<int> unow(m, 987654321);
		vector<int> maxv(m, 0); // 좌우에서 y별 최댓값값
        
        for (int r = l + 2; r < n; r++)
        {
            vector<int> newup(m + 1, 0);
            vector<int> newdown(m + 1, 0);
            vector<int> delup(m + 1, 0);
            vector<int> deldown(m + 1, 0);
			vector<int> lrup(m + 1, 0);
			vector<int> lrdown(m + 1, 0);
			vector<bool> lr(m, 0); // l - r은 가능한지
			vector<int> depth(m + 1, 0);

            for (int y = 0; y < m; y++)
            {
                dnow[y] = min(dnow[y], down[r - 1][y]);
                unow[y] = min(unow[y], up[r - 1][y]);
				maxv[y] = max(maxv[y], a[r - 1][y]);
				lr[y] = maxv[y] < a[l][y] && maxv[y] < a[r][y];
            }

			int lru = 0, lrd = 0;

			vector<int> dval(m + 1, 0);
			vector<int> uval(m + 1, 0);

			for (int y = 0; y < m; y++)
			{
				uval[y] = min(unow[y], lru);

				if (lr[y])
					lru++;
				else
					lru = 0;
			}

			for (int y = m - 1; y >= 0; y--)
			{
				dval[y] = min(dnow[y], lrd);

				if (lr[y])
					lrd++;
				else
					lrd = 0;
			}

			for (int y = 0; y < m; y++)
			{
				if (uval[y] >= 1)
				{
					newup[y - uval[y]]++;
					delup[y - 1]++;
				}

				if (dval[y] >= 1)
				{
					newdown[y + 1]++;
					deldown[y + dval[y]]++;
				}
			}

			int d = 0;
			for (int y = 0; y < m; y++)
			{
				d += newup[y];
				d -= delup[y];

				depth[y] = d;
			}

			// (ypos, minvalue)
			stack<ii> s;

            for (int y = 1; y < m; y++)
            {
				for (int j = 0; j < newdown[y]; j++)
					s.emplace(y, 987654321);

				if (!s.empty())
				{
					s.top().yy = min(s.top().yy, depth[y]);
				}

				for (int j = 0; j < deldown[y]; j++)
				{
					ii top = s.top();
					int f = depth[top.xx - 1] + newup[top.xx];

					ans += f - top.yy;

					s.pop();
					if (!s.empty())
						s.top().yy = min(s.top().yy, top.yy);
				}
            }
        }
    }

	return ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 632 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 3 ms 632 KB Output is correct
5 Correct 3 ms 636 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 3 ms 632 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 3 ms 632 KB Output is correct
10 Correct 3 ms 632 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 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 3 ms 632 KB Output is correct
20 Correct 3 ms 632 KB Output is correct
21 Correct 2 ms 376 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 632 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 3 ms 632 KB Output is correct
5 Correct 3 ms 636 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 3 ms 632 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 3 ms 632 KB Output is correct
10 Correct 3 ms 632 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 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 10 ms 1016 KB Output is correct
18 Correct 10 ms 1016 KB Output is correct
19 Correct 10 ms 1016 KB Output is correct
20 Correct 10 ms 1016 KB Output is correct
21 Correct 10 ms 1016 KB Output is correct
22 Correct 10 ms 1144 KB Output is correct
23 Correct 10 ms 1016 KB Output is correct
24 Correct 7 ms 1016 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 3 ms 632 KB Output is correct
28 Correct 3 ms 632 KB Output is correct
29 Correct 2 ms 376 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 632 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 3 ms 632 KB Output is correct
5 Correct 3 ms 636 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 3 ms 632 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 3 ms 632 KB Output is correct
10 Correct 3 ms 632 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 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 10 ms 1016 KB Output is correct
18 Correct 10 ms 1016 KB Output is correct
19 Correct 10 ms 1016 KB Output is correct
20 Correct 10 ms 1016 KB Output is correct
21 Correct 10 ms 1016 KB Output is correct
22 Correct 10 ms 1144 KB Output is correct
23 Correct 10 ms 1016 KB Output is correct
24 Correct 7 ms 1016 KB Output is correct
25 Correct 92 ms 2648 KB Output is correct
26 Correct 92 ms 2552 KB Output is correct
27 Correct 92 ms 2552 KB Output is correct
28 Correct 88 ms 2616 KB Output is correct
29 Correct 90 ms 2552 KB Output is correct
30 Correct 91 ms 2652 KB Output is correct
31 Correct 90 ms 2652 KB Output is correct
32 Correct 89 ms 2552 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 256 KB Output is correct
35 Correct 3 ms 632 KB Output is correct
36 Correct 3 ms 632 KB Output is correct
37 Correct 2 ms 376 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 632 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 3 ms 632 KB Output is correct
5 Correct 3 ms 636 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 3 ms 632 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 3 ms 632 KB Output is correct
10 Correct 3 ms 632 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 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 10 ms 1016 KB Output is correct
18 Correct 10 ms 1016 KB Output is correct
19 Correct 10 ms 1016 KB Output is correct
20 Correct 10 ms 1016 KB Output is correct
21 Correct 10 ms 1016 KB Output is correct
22 Correct 10 ms 1144 KB Output is correct
23 Correct 10 ms 1016 KB Output is correct
24 Correct 7 ms 1016 KB Output is correct
25 Correct 92 ms 2648 KB Output is correct
26 Correct 92 ms 2552 KB Output is correct
27 Correct 92 ms 2552 KB Output is correct
28 Correct 88 ms 2616 KB Output is correct
29 Correct 90 ms 2552 KB Output is correct
30 Correct 91 ms 2652 KB Output is correct
31 Correct 90 ms 2652 KB Output is correct
32 Correct 89 ms 2552 KB Output is correct
33 Correct 3252 ms 13660 KB Output is correct
34 Correct 3261 ms 13688 KB Output is correct
35 Correct 3258 ms 13756 KB Output is correct
36 Correct 3323 ms 13784 KB Output is correct
37 Correct 3314 ms 13724 KB Output is correct
38 Correct 3299 ms 13752 KB Output is correct
39 Correct 3316 ms 13816 KB Output is correct
40 Correct 2905 ms 13004 KB Output is correct
41 Correct 3109 ms 13788 KB Output is correct
42 Correct 3120 ms 13688 KB Output is correct
43 Correct 3213 ms 13688 KB Output is correct
44 Correct 3210 ms 16504 KB Output is correct
45 Correct 1681 ms 11512 KB Output is correct
46 Correct 812 ms 7160 KB Output is correct
47 Correct 3156 ms 13816 KB Output is correct
48 Correct 3154 ms 13692 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 256 KB Output is correct
51 Correct 3 ms 632 KB Output is correct
52 Correct 3 ms 632 KB Output is correct
53 Correct 2 ms 376 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 632 KB Output is correct
2 Correct 8 ms 624 KB Output is correct
3 Correct 2 ms 508 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 ms 504 KB Output is correct
6 Correct 3 ms 504 KB Output is correct
7 Correct 3 ms 632 KB Output is correct
8 Correct 3 ms 604 KB Output is correct
9 Correct 3 ms 504 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 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 Execution timed out 5083 ms 47188 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 632 KB Output is correct
3 Correct 3 ms 632 KB Output is correct
4 Correct 3 ms 632 KB Output is correct
5 Correct 3 ms 636 KB Output is correct
6 Correct 3 ms 632 KB Output is correct
7 Correct 3 ms 632 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 3 ms 632 KB Output is correct
10 Correct 3 ms 632 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 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 10 ms 1016 KB Output is correct
18 Correct 10 ms 1016 KB Output is correct
19 Correct 10 ms 1016 KB Output is correct
20 Correct 10 ms 1016 KB Output is correct
21 Correct 10 ms 1016 KB Output is correct
22 Correct 10 ms 1144 KB Output is correct
23 Correct 10 ms 1016 KB Output is correct
24 Correct 7 ms 1016 KB Output is correct
25 Correct 92 ms 2648 KB Output is correct
26 Correct 92 ms 2552 KB Output is correct
27 Correct 92 ms 2552 KB Output is correct
28 Correct 88 ms 2616 KB Output is correct
29 Correct 90 ms 2552 KB Output is correct
30 Correct 91 ms 2652 KB Output is correct
31 Correct 90 ms 2652 KB Output is correct
32 Correct 89 ms 2552 KB Output is correct
33 Correct 3252 ms 13660 KB Output is correct
34 Correct 3261 ms 13688 KB Output is correct
35 Correct 3258 ms 13756 KB Output is correct
36 Correct 3323 ms 13784 KB Output is correct
37 Correct 3314 ms 13724 KB Output is correct
38 Correct 3299 ms 13752 KB Output is correct
39 Correct 3316 ms 13816 KB Output is correct
40 Correct 2905 ms 13004 KB Output is correct
41 Correct 3109 ms 13788 KB Output is correct
42 Correct 3120 ms 13688 KB Output is correct
43 Correct 3213 ms 13688 KB Output is correct
44 Correct 3210 ms 16504 KB Output is correct
45 Correct 1681 ms 11512 KB Output is correct
46 Correct 812 ms 7160 KB Output is correct
47 Correct 3156 ms 13816 KB Output is correct
48 Correct 3154 ms 13692 KB Output is correct
49 Correct 9 ms 632 KB Output is correct
50 Correct 8 ms 624 KB Output is correct
51 Correct 2 ms 508 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 3 ms 504 KB Output is correct
54 Correct 3 ms 504 KB Output is correct
55 Correct 3 ms 632 KB Output is correct
56 Correct 3 ms 604 KB Output is correct
57 Correct 3 ms 504 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 2 ms 376 KB Output is correct
60 Correct 2 ms 376 KB Output is correct
61 Execution timed out 5083 ms 47188 KB Time limit exceeded
62 Halted 0 ms 0 KB -