oj.uz

Submission #143719

# Submission time Handle Problem Language Result Execution time Memory
143719 2019-08-15T00:39:00 Z qkxwsm Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 172424 KB 
#include "rect.h"
#include <bits/stdc++.h>

using namespace std;

template<class T, class U>
void ckmin(T &a, U b)
{
	if (a > b) a = b;
}

template<class T, class U>
void ckmax(T &a, U b)
{
	if (a < b) a = b;
}

#define y1 qkx
#define y2 wsm
#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define SZ(x) ((int) (x).size())
#define ALL(x) (x).begin(), (x).end()
#define INF 1000000007
#define MAXN 2513

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

int N, M;
vector<vi> grid;
int rt[MAXN][MAXN], dn[MAXN][MAXN], lt[MAXN][MAXN], up[MAXN][MAXN];
int pref[MAXN][MAXN];
bool subtask6 = true;
vector<vector<vi> > col, row;
set<pii> edges;
ll ans;

int psum(int x1, int x2, int y1, int y2)
{
	return pref[x2 + 1][y2 + 1] - pref[x1][y2 + 1] - pref[x2 + 1][y1] + pref[x1][y1];
}
ll count_rectangles(vector<vi> a)
{
	N = SZ(a); M = SZ(a[0]); grid = a;
	FOR(i, 0, N) FOR(j, 0, M) if (grid[i][j] > 1) subtask6 = false;
	if (subtask6)
	{
		FOR(i, 0, N)
		{
			FOR(j, 0, M)
			{
				pref[i + 1][j + 1] = pref[i][j + 1] + pref[i + 1][j] - pref[i][j] + grid[i][j];
			}
		}
		//for each square, compute the next 1 on the right
		FOR(i, 0, N)
		{
			rt[i][M] = M;
			FORD(j, M, 0)
			{
				rt[i][j] = (grid[i][j] ? j : rt[i][j + 1]);
			}
		}
		FOR(i, 0, M)
		{
			dn[N][i] = N;
			FORD(j, N, 0)
			{
				dn[j][i] = (grid[j][i] ? j : dn[j + 1][i]);
			}
		}
		FOR(x1, 1, N)
		{
			FOR(y1, 1, M)
			{
				if (grid[x1][y1]) continue;
				int y2 = rt[x1][y1] - 1, x2 = dn[x1][y1] - 1;
				if (x2 == N - 1 || y2 == M - 1) continue;
				// cerr << "CONSIDER " << x1 << ' ' << y1 << " -> " << x2 << ' ' << y2 << endl;
				if (psum(x1, x2, y1, y2) != 0) continue;
				if (psum(x1 - 1, x1 - 1, y1, y2) != (y2 - y1 + 1)) continue;
				if (psum(x2 + 1, x2 + 1, y1, y2) != (y2 - y1 + 1)) continue;
				if (psum(x1, x2, y1 - 1, y1 - 1) != (x2 - x1 + 1)) continue;
				if (psum(x1, x2, y2 + 1, y2 + 1) != (x2 - x1 + 1)) continue;
				ans++;
			}
		}
	}
	else
	{
		//BE SUPER CAREFUL ABOUT EQUALITY CASE.
		//for each guy, find the next guy right of it that's greater th an it.
		//ok fix the starting column #.
		FOR(i, 0, N)
		{
			vpi cand; cand.PB({INF, M});
			FORD(j, M, 0)
			{
				while(cand.back().fi < grid[i][j]) cand.pop_back();
				rt[i][j] = cand.back().se;
				cand.PB({grid[i][j], j});
			}
			cand.clear(); cand.PB({INF, -1});
			FOR(j, 0, M)
			{
				while(cand.back().fi < grid[i][j]) cand.pop_back();
				lt[i][j] = cand.back().se;
				cand.PB({grid[i][j], j});
			}
		}
		FOR(i, 0, M)
		{
			vpi cand; cand.PB({INF, N});
			FORD(j, N, 0)
			{
				while(cand.back().fi < grid[j][i]) cand.pop_back();
				dn[j][i] = cand.back().se;
				cand.PB({grid[j][i], j});
			}
			cand.clear(); cand.PB({INF, -1});
			FOR(j, 0, N)
			{
				while(cand.back().fi < grid[j][i]) cand.pop_back();
				up[j][i] = cand.back().se;
				cand.PB({grid[j][i], j});
			}
		}
		// FOR(i, 0, N)
		// {
		// 	FOR(j, 0, M)
		// 	{
		// 		cerr << up[i][j] << ' ';
		// 	}
		// 	cerr << endl;
		// }
		FOR(i, 0, N - 1)
		{
			edges.clear();
			FOR(j, 0, M)
			{
				if (lt[i + 1][j] != -1 && lt[i + 1][j] < j - 1) edges.insert({lt[i + 1][j], j});
				if (rt[i + 1][j] != M && rt[i + 1][j] > j + 1) edges.insert({j, rt[i + 1][j]});
			}
			// cerr << "FROM ROW " << i << endl;
			FOR(j, i + 2, N)
			{
				//find all edges which they share in common.
				// cerr << "ROWS " << i << " -> " << j << endl;
				// cerr << "EDGES\n";
				// for (pii p : edges)
				// {
				// 	cerr << p.fi << ' ' << p.se << endl;
				// }
				vpi ks;
				FOR(k, 0, M)
				{
					if (dn[i][k] == j || up[j][k] == i)
					{
						// cerr << "HI\n";
						if (ks.empty() || ks.back().se != k - 1)
						{
							ks.PB({k, k});
						}
						else
						{
							ks.back().se++;
						}
						// cerr << "BYE\n";
					}
				}
				// cerr << "KS\n";
				// for (pii p : ks)
				// {
				// 	cerr << p.fi << ',' << p.se << endl;
				// }
				for (pii p : ks)
				{
					for (pii q : edges)
					{
						if (p.fi <= q.fi + 1 && q.se - 1 <= p.se)
						{
							// cerr << "YAY " << i << ' ' << j << ' ' << q.fi << ' ' << q.se << endl;
							ans++;
						}
					}
				}
				for (auto it = edges.begin(); it != edges.end(); )
				{
					int x = it -> fi, y = it -> se;
					if (rt[j][x] != y && lt[j][y] != x) it = edges.erase(it);
					else it++;
				}
				//ok now find these ranges.
			}
		}
	}
	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 2 ms 888 KB Output is correct
3 Correct 2 ms 888 KB Output is correct
4 Correct 3 ms 892 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 2 ms 760 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 888 KB Output is correct
10 Correct 3 ms 888 KB Output is correct
11 Correct 3 ms 888 KB Output is correct
12 Correct 3 ms 888 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 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 376 KB Output is correct
19 Correct 2 ms 760 KB Output is correct
20 Correct 2 ms 632 KB Output is correct
21 Correct 2 ms 504 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 2 ms 888 KB Output is correct
3 Correct 2 ms 888 KB Output is correct
4 Correct 3 ms 892 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 2 ms 760 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 888 KB Output is correct
10 Correct 3 ms 888 KB Output is correct
11 Correct 3 ms 888 KB Output is correct
12 Correct 3 ms 888 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 6 ms 1784 KB Output is correct
18 Correct 6 ms 1784 KB Output is correct
19 Correct 6 ms 1784 KB Output is correct
20 Correct 5 ms 1784 KB Output is correct
21 Correct 6 ms 1784 KB Output is correct
22 Correct 6 ms 1784 KB Output is correct
23 Correct 7 ms 1784 KB Output is correct
24 Correct 4 ms 1656 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 760 KB Output is correct
28 Correct 2 ms 632 KB Output is correct
29 Correct 2 ms 504 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 2 ms 888 KB Output is correct
3 Correct 2 ms 888 KB Output is correct
4 Correct 3 ms 892 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 2 ms 760 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 888 KB Output is correct
10 Correct 3 ms 888 KB Output is correct
11 Correct 3 ms 888 KB Output is correct
12 Correct 3 ms 888 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 6 ms 1784 KB Output is correct
18 Correct 6 ms 1784 KB Output is correct
19 Correct 6 ms 1784 KB Output is correct
20 Correct 5 ms 1784 KB Output is correct
21 Correct 6 ms 1784 KB Output is correct
22 Correct 6 ms 1784 KB Output is correct
23 Correct 7 ms 1784 KB Output is correct
24 Correct 4 ms 1656 KB Output is correct
25 Correct 49 ms 4728 KB Output is correct
26 Correct 49 ms 4708 KB Output is correct
27 Correct 49 ms 4600 KB Output is correct
28 Correct 24 ms 4704 KB Output is correct
29 Correct 38 ms 4728 KB Output is correct
30 Correct 39 ms 4728 KB Output is correct
31 Correct 40 ms 4600 KB Output is correct
32 Correct 39 ms 4600 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 760 KB Output is correct
36 Correct 2 ms 632 KB Output is correct
37 Correct 2 ms 504 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 2 ms 888 KB Output is correct
3 Correct 2 ms 888 KB Output is correct
4 Correct 3 ms 892 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 2 ms 760 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 888 KB Output is correct
10 Correct 3 ms 888 KB Output is correct
11 Correct 3 ms 888 KB Output is correct
12 Correct 3 ms 888 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 6 ms 1784 KB Output is correct
18 Correct 6 ms 1784 KB Output is correct
19 Correct 6 ms 1784 KB Output is correct
20 Correct 5 ms 1784 KB Output is correct
21 Correct 6 ms 1784 KB Output is correct
22 Correct 6 ms 1784 KB Output is correct
23 Correct 7 ms 1784 KB Output is correct
24 Correct 4 ms 1656 KB Output is correct
25 Correct 49 ms 4728 KB Output is correct
26 Correct 49 ms 4708 KB Output is correct
27 Correct 49 ms 4600 KB Output is correct
28 Correct 24 ms 4704 KB Output is correct
29 Correct 38 ms 4728 KB Output is correct
30 Correct 39 ms 4728 KB Output is correct
31 Correct 40 ms 4600 KB Output is correct
32 Correct 39 ms 4600 KB Output is correct
33 Correct 374 ms 25212 KB Output is correct
34 Correct 378 ms 25080 KB Output is correct
35 Correct 369 ms 25208 KB Output is correct
36 Correct 371 ms 25208 KB Output is correct
37 Correct 1737 ms 25208 KB Output is correct
38 Correct 1739 ms 25336 KB Output is correct
39 Correct 1767 ms 25208 KB Output is correct
40 Correct 1573 ms 23544 KB Output is correct
41 Correct 38 ms 20344 KB Output is correct
42 Correct 550 ms 25080 KB Output is correct
43 Correct 1081 ms 25080 KB Output is correct
44 Correct 1101 ms 25228 KB Output is correct
45 Correct 374 ms 18424 KB Output is correct
46 Correct 482 ms 12892 KB Output is correct
47 Correct 1106 ms 25284 KB Output is correct
48 Correct 1091 ms 25180 KB Output is correct
49 Correct 2 ms 376 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 2 ms 760 KB Output is correct
52 Correct 2 ms 632 KB Output is correct
53 Correct 2 ms 504 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 632 KB Output is correct
2 Correct 4 ms 760 KB Output is correct
3 Correct 2 ms 508 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 19 ms 632 KB Output is correct
6 Correct 20 ms 632 KB Output is correct
7 Correct 19 ms 632 KB Output is correct
8 Correct 17 ms 632 KB Output is correct
9 Correct 15 ms 632 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 632 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 209 ms 70680 KB Output is correct
3 Correct 501 ms 147132 KB Output is correct
4 Correct 507 ms 147960 KB Output is correct
5 Correct 508 ms 147832 KB Output is correct
6 Correct 156 ms 73080 KB Output is correct
7 Correct 373 ms 143224 KB Output is correct
8 Correct 413 ms 147964 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 760 KB Output is correct
12 Correct 2 ms 632 KB Output is correct
13 Correct 2 ms 504 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 888 KB Output is correct
3 Correct 2 ms 888 KB Output is correct
4 Correct 3 ms 892 KB Output is correct
5 Correct 2 ms 760 KB Output is correct
6 Correct 3 ms 888 KB Output is correct
7 Correct 2 ms 760 KB Output is correct
8 Correct 2 ms 504 KB Output is correct
9 Correct 2 ms 888 KB Output is correct
10 Correct 3 ms 888 KB Output is correct
11 Correct 3 ms 888 KB Output is correct
12 Correct 3 ms 888 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 504 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 6 ms 1784 KB Output is correct
18 Correct 6 ms 1784 KB Output is correct
19 Correct 6 ms 1784 KB Output is correct
20 Correct 5 ms 1784 KB Output is correct
21 Correct 6 ms 1784 KB Output is correct
22 Correct 6 ms 1784 KB Output is correct
23 Correct 7 ms 1784 KB Output is correct
24 Correct 4 ms 1656 KB Output is correct
25 Correct 49 ms 4728 KB Output is correct
26 Correct 49 ms 4708 KB Output is correct
27 Correct 49 ms 4600 KB Output is correct
28 Correct 24 ms 4704 KB Output is correct
29 Correct 38 ms 4728 KB Output is correct
30 Correct 39 ms 4728 KB Output is correct
31 Correct 40 ms 4600 KB Output is correct
32 Correct 39 ms 4600 KB Output is correct
33 Correct 374 ms 25212 KB Output is correct
34 Correct 378 ms 25080 KB Output is correct
35 Correct 369 ms 25208 KB Output is correct
36 Correct 371 ms 25208 KB Output is correct
37 Correct 1737 ms 25208 KB Output is correct
38 Correct 1739 ms 25336 KB Output is correct
39 Correct 1767 ms 25208 KB Output is correct
40 Correct 1573 ms 23544 KB Output is correct
41 Correct 38 ms 20344 KB Output is correct
42 Correct 550 ms 25080 KB Output is correct
43 Correct 1081 ms 25080 KB Output is correct
44 Correct 1101 ms 25228 KB Output is correct
45 Correct 374 ms 18424 KB Output is correct
46 Correct 482 ms 12892 KB Output is correct
47 Correct 1106 ms 25284 KB Output is correct
48 Correct 1091 ms 25180 KB Output is correct
49 Correct 4 ms 632 KB Output is correct
50 Correct 4 ms 760 KB Output is correct
51 Correct 2 ms 508 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 19 ms 632 KB Output is correct
54 Correct 20 ms 632 KB Output is correct
55 Correct 19 ms 632 KB Output is correct
56 Correct 17 ms 632 KB Output is correct
57 Correct 15 ms 632 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 3 ms 632 KB Output is correct
60 Correct 2 ms 504 KB Output is correct
61 Correct 209 ms 70680 KB Output is correct
62 Correct 501 ms 147132 KB Output is correct
63 Correct 507 ms 147960 KB Output is correct
64 Correct 508 ms 147832 KB Output is correct
65 Correct 156 ms 73080 KB Output is correct
66 Correct 373 ms 143224 KB Output is correct
67 Correct 413 ms 147964 KB Output is correct
68 Execution timed out 5104 ms 172424 KB Time limit exceeded
69 Halted 0 ms 0 KB -