oj.uz

Submission #157356

# Submission time Handle Problem Language Result Execution time Memory
157356 2019-10-11T03:12:06 Z qkxwsm Rectangles (IOI19_rect) C++14
72 / 100
 3632 ms 1048580 KB 
#include "rect.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

template<class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

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;
int grid[MAXN][MAXN];
vector<short> ev[MAXN][MAXN], eh[MAXN][MAXN], dv[MAXN][MAXN], dh[MAXN][MAXN];
ll ans;
ordered_set<pii> ord;

ll count_rectangles(vector<vi> a)
{
	N = SZ(a); M = SZ(a[0]);
	FOR(i, 0, N)
	{
		FOR(j, 0, M)
		{
			grid[i][j] = a[i][j];
		}
	}
	FOR(i, 0, N)
	{
		vpi cand; cand.PB({INF, M + 1});
		FORD(j, M, 0)
		{
			while(cand.back().fi < grid[i][j]) cand.pop_back();
			short idx = cand.back().se;
			if (idx < M && idx != j + 1)
			{
				eh[i][j + 1].PB(idx - 1);
			}
			cand.PB({grid[i][j], j});
		}
		cand.clear(); cand.PB({INF, -2});
		FOR(j, 0, M)
		{
			while(cand.back().fi < grid[i][j]) cand.pop_back();
			short idx = cand.back().se;
			if (idx >= 0 & idx != j - 1)
			{
				eh[i][idx + 1].PB(j - 1);
			}
			cand.PB({grid[i][j], j});
		}
	}
	FOR(i, 0, M)
	{
		vpi cand; cand.PB({INF, N + 1});
		FORD(j, N, 0)
		{
			while(cand.back().fi < grid[j][i]) cand.pop_back();
			short idx = cand.back().se;
			if (idx < N && idx != j + 1)
			{
				ev[j + 1][i].PB(idx - 1);
			}
			cand.PB({grid[j][i], j});
		}
		cand.clear(); cand.PB({INF, -2});
		FOR(j, 0, N)
		{
			while(cand.back().fi < grid[j][i]) cand.pop_back();
			short idx = cand.back().se;
			if (idx >= 0 && idx != j - 1)
			{
				ev[idx + 1][i].PB(j - 1);
			}
			cand.PB({grid[j][i], j});
		}
	}
	FOR(i, 0, N)
	{
		FOR(j, 0, M)
		{
			sort(ALL(ev[i][j])); ev[i][j].erase(unique(ALL(ev[i][j])), ev[i][j].end());
			sort(ALL(eh[i][j])); eh[i][j].erase(unique(ALL(eh[i][j])), eh[i][j].end());
			dv[i][j].resize(SZ(ev[i][j]));
			dh[i][j].resize(SZ(eh[i][j]));
		}
	}
	FOR(i, 0, N)
	{
		FORD(j, M, 0)
		{
			int idx = 0;
			FOR(k, 0, SZ(ev[i][j]))
			{
				dv[i][j][k] = j;
				int x = ev[i][j][k];
				while(idx < SZ(ev[i][j + 1]) && ev[i][j + 1][idx] < x) idx++;
				if (idx >= SZ(ev[i][j + 1]) || ev[i][j + 1][idx] != x) continue;
				dv[i][j][k] = dv[i][j + 1][idx];
			}
		}
	}
	FOR(i, 0, M)
	{
		FORD(j, N, 0)
		{
			int idx = 0;
			FOR(k, 0, SZ(eh[j][i]))
			{
				dh[j][i][k] = j;
				int y = eh[j][i][k];
				while(idx < SZ(eh[j + 1][i]) && eh[j + 1][i][idx] < y) idx++;
				if (idx >= SZ(eh[j + 1][i]) || eh[j + 1][i][idx] != y) continue;
				dh[j][i][k] = dh[j + 1][i][idx];
			}
		}
	}
	FOR(i, 1, N - 1)
	{
		FOR(j, 1, M - 1)
		{
			vpi ps;
			FOR(k, 0, SZ(eh[i][j]))
			{
				ps.PB({dh[i][j][k], eh[i][j][k]});
			}
			sort(ALL(ps));
			FOR(k, 0, SZ(ps))
			{
				ord.insert({ps[k].se, k});
			}
			int iter = 0;
			FOR(k, 0, SZ(ev[i][j]))
			{
				while(iter < SZ(ps) && ps[iter].fi < ev[i][j][k])
				{
					ord.erase({ps[iter].se, iter});
					iter++;
				}
				ans += ord.order_of_key({dv[i][j][k], INF});
			}
			ord.clear();
		}
	}
	return ans;
}

Compilation message

rect.cpp: In function 'll count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:81:12: warning: suggest parentheses around comparison in operand of '&' [-Wparentheses]
    if (idx >= 0 & idx != j - 1)
        ~~~~^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 551 ms 593656 KB Output is correct
2 Correct 552 ms 593752 KB Output is correct
3 Correct 550 ms 593784 KB Output is correct
4 Correct 603 ms 594004 KB Output is correct
5 Correct 574 ms 593720 KB Output is correct
6 Correct 559 ms 593920 KB Output is correct
7 Correct 559 ms 593656 KB Output is correct
8 Correct 555 ms 593656 KB Output is correct
9 Correct 611 ms 593776 KB Output is correct
10 Correct 560 ms 593756 KB Output is correct
11 Correct 554 ms 593692 KB Output is correct
12 Correct 551 ms 593720 KB Output is correct
13 Correct 583 ms 593628 KB Output is correct
14 Correct 554 ms 593656 KB Output is correct
15 Correct 555 ms 593560 KB Output is correct
16 Correct 571 ms 593624 KB Output is correct
17 Correct 584 ms 593528 KB Output is correct
18 Correct 554 ms 593528 KB Output is correct
19 Correct 560 ms 593736 KB Output is correct
20 Correct 557 ms 593632 KB Output is correct
21 Correct 554 ms 593668 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 551 ms 593656 KB Output is correct
2 Correct 552 ms 593752 KB Output is correct
3 Correct 550 ms 593784 KB Output is correct
4 Correct 603 ms 594004 KB Output is correct
5 Correct 574 ms 593720 KB Output is correct
6 Correct 559 ms 593920 KB Output is correct
7 Correct 559 ms 593656 KB Output is correct
8 Correct 555 ms 593656 KB Output is correct
9 Correct 611 ms 593776 KB Output is correct
10 Correct 560 ms 593756 KB Output is correct
11 Correct 554 ms 593692 KB Output is correct
12 Correct 551 ms 593720 KB Output is correct
13 Correct 583 ms 593628 KB Output is correct
14 Correct 554 ms 593656 KB Output is correct
15 Correct 555 ms 593560 KB Output is correct
16 Correct 571 ms 593624 KB Output is correct
17 Correct 559 ms 594820 KB Output is correct
18 Correct 560 ms 594808 KB Output is correct
19 Correct 558 ms 594772 KB Output is correct
20 Correct 564 ms 594360 KB Output is correct
21 Correct 569 ms 594540 KB Output is correct
22 Correct 577 ms 594384 KB Output is correct
23 Correct 557 ms 594320 KB Output is correct
24 Correct 557 ms 594136 KB Output is correct
25 Correct 584 ms 593528 KB Output is correct
26 Correct 554 ms 593528 KB Output is correct
27 Correct 560 ms 593736 KB Output is correct
28 Correct 557 ms 593632 KB Output is correct
29 Correct 554 ms 593668 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 551 ms 593656 KB Output is correct
2 Correct 552 ms 593752 KB Output is correct
3 Correct 550 ms 593784 KB Output is correct
4 Correct 603 ms 594004 KB Output is correct
5 Correct 574 ms 593720 KB Output is correct
6 Correct 559 ms 593920 KB Output is correct
7 Correct 559 ms 593656 KB Output is correct
8 Correct 555 ms 593656 KB Output is correct
9 Correct 611 ms 593776 KB Output is correct
10 Correct 560 ms 593756 KB Output is correct
11 Correct 554 ms 593692 KB Output is correct
12 Correct 551 ms 593720 KB Output is correct
13 Correct 583 ms 593628 KB Output is correct
14 Correct 554 ms 593656 KB Output is correct
15 Correct 555 ms 593560 KB Output is correct
16 Correct 571 ms 593624 KB Output is correct
17 Correct 559 ms 594820 KB Output is correct
18 Correct 560 ms 594808 KB Output is correct
19 Correct 558 ms 594772 KB Output is correct
20 Correct 564 ms 594360 KB Output is correct
21 Correct 569 ms 594540 KB Output is correct
22 Correct 577 ms 594384 KB Output is correct
23 Correct 557 ms 594320 KB Output is correct
24 Correct 557 ms 594136 KB Output is correct
25 Correct 583 ms 599980 KB Output is correct
26 Correct 608 ms 600128 KB Output is correct
27 Correct 578 ms 600028 KB Output is correct
28 Correct 573 ms 596616 KB Output is correct
29 Correct 582 ms 597484 KB Output is correct
30 Correct 576 ms 597752 KB Output is correct
31 Correct 579 ms 597576 KB Output is correct
32 Correct 573 ms 597380 KB Output is correct
33 Correct 584 ms 593528 KB Output is correct
34 Correct 554 ms 593528 KB Output is correct
35 Correct 560 ms 593736 KB Output is correct
36 Correct 557 ms 593632 KB Output is correct
37 Correct 554 ms 593668 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 551 ms 593656 KB Output is correct
2 Correct 552 ms 593752 KB Output is correct
3 Correct 550 ms 593784 KB Output is correct
4 Correct 603 ms 594004 KB Output is correct
5 Correct 574 ms 593720 KB Output is correct
6 Correct 559 ms 593920 KB Output is correct
7 Correct 559 ms 593656 KB Output is correct
8 Correct 555 ms 593656 KB Output is correct
9 Correct 611 ms 593776 KB Output is correct
10 Correct 560 ms 593756 KB Output is correct
11 Correct 554 ms 593692 KB Output is correct
12 Correct 551 ms 593720 KB Output is correct
13 Correct 583 ms 593628 KB Output is correct
14 Correct 554 ms 593656 KB Output is correct
15 Correct 555 ms 593560 KB Output is correct
16 Correct 571 ms 593624 KB Output is correct
17 Correct 559 ms 594820 KB Output is correct
18 Correct 560 ms 594808 KB Output is correct
19 Correct 558 ms 594772 KB Output is correct
20 Correct 564 ms 594360 KB Output is correct
21 Correct 569 ms 594540 KB Output is correct
22 Correct 577 ms 594384 KB Output is correct
23 Correct 557 ms 594320 KB Output is correct
24 Correct 557 ms 594136 KB Output is correct
25 Correct 583 ms 599980 KB Output is correct
26 Correct 608 ms 600128 KB Output is correct
27 Correct 578 ms 600028 KB Output is correct
28 Correct 573 ms 596616 KB Output is correct
29 Correct 582 ms 597484 KB Output is correct
30 Correct 576 ms 597752 KB Output is correct
31 Correct 579 ms 597576 KB Output is correct
32 Correct 573 ms 597380 KB Output is correct
33 Correct 750 ms 633216 KB Output is correct
34 Correct 738 ms 619260 KB Output is correct
35 Correct 764 ms 619268 KB Output is correct
36 Correct 683 ms 605228 KB Output is correct
37 Correct 948 ms 663856 KB Output is correct
38 Correct 945 ms 663848 KB Output is correct
39 Correct 945 ms 663800 KB Output is correct
40 Correct 917 ms 659196 KB Output is correct
41 Correct 760 ms 618272 KB Output is correct
42 Correct 805 ms 623228 KB Output is correct
43 Correct 926 ms 633276 KB Output is correct
44 Correct 937 ms 633284 KB Output is correct
45 Correct 746 ms 615160 KB Output is correct
46 Correct 735 ms 613696 KB Output is correct
47 Correct 936 ms 630720 KB Output is correct
48 Correct 979 ms 631020 KB Output is correct
49 Correct 584 ms 593528 KB Output is correct
50 Correct 554 ms 593528 KB Output is correct
51 Correct 560 ms 593736 KB Output is correct
52 Correct 557 ms 593632 KB Output is correct
53 Correct 554 ms 593668 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 562 ms 594280 KB Output is correct
2 Correct 612 ms 594268 KB Output is correct
3 Correct 594 ms 593768 KB Output is correct
4 Correct 579 ms 593640 KB Output is correct
5 Correct 566 ms 593992 KB Output is correct
6 Correct 556 ms 594000 KB Output is correct
7 Correct 614 ms 594016 KB Output is correct
8 Correct 571 ms 593912 KB Output is correct
9 Correct 558 ms 593948 KB Output is correct
10 Correct 607 ms 593752 KB Output is correct
11 Correct 567 ms 593760 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 558 ms 593580 KB Output is correct
2 Correct 1854 ms 718784 KB Output is correct
3 Correct 3498 ms 862068 KB Output is correct
4 Correct 3632 ms 862984 KB Output is correct
5 Correct 3541 ms 862996 KB Output is correct
6 Correct 875 ms 630136 KB Output is correct
7 Correct 1194 ms 664312 KB Output is correct
8 Correct 1247 ms 667288 KB Output is correct
9 Correct 584 ms 593528 KB Output is correct
10 Correct 554 ms 593528 KB Output is correct
11 Correct 560 ms 593736 KB Output is correct
12 Correct 557 ms 593632 KB Output is correct
13 Correct 554 ms 593668 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 551 ms 593656 KB Output is correct
2 Correct 552 ms 593752 KB Output is correct
3 Correct 550 ms 593784 KB Output is correct
4 Correct 603 ms 594004 KB Output is correct
5 Correct 574 ms 593720 KB Output is correct
6 Correct 559 ms 593920 KB Output is correct
7 Correct 559 ms 593656 KB Output is correct
8 Correct 555 ms 593656 KB Output is correct
9 Correct 611 ms 593776 KB Output is correct
10 Correct 560 ms 593756 KB Output is correct
11 Correct 554 ms 593692 KB Output is correct
12 Correct 551 ms 593720 KB Output is correct
13 Correct 583 ms 593628 KB Output is correct
14 Correct 554 ms 593656 KB Output is correct
15 Correct 555 ms 593560 KB Output is correct
16 Correct 571 ms 593624 KB Output is correct
17 Correct 559 ms 594820 KB Output is correct
18 Correct 560 ms 594808 KB Output is correct
19 Correct 558 ms 594772 KB Output is correct
20 Correct 564 ms 594360 KB Output is correct
21 Correct 569 ms 594540 KB Output is correct
22 Correct 577 ms 594384 KB Output is correct
23 Correct 557 ms 594320 KB Output is correct
24 Correct 557 ms 594136 KB Output is correct
25 Correct 583 ms 599980 KB Output is correct
26 Correct 608 ms 600128 KB Output is correct
27 Correct 578 ms 600028 KB Output is correct
28 Correct 573 ms 596616 KB Output is correct
29 Correct 582 ms 597484 KB Output is correct
30 Correct 576 ms 597752 KB Output is correct
31 Correct 579 ms 597576 KB Output is correct
32 Correct 573 ms 597380 KB Output is correct
33 Correct 750 ms 633216 KB Output is correct
34 Correct 738 ms 619260 KB Output is correct
35 Correct 764 ms 619268 KB Output is correct
36 Correct 683 ms 605228 KB Output is correct
37 Correct 948 ms 663856 KB Output is correct
38 Correct 945 ms 663848 KB Output is correct
39 Correct 945 ms 663800 KB Output is correct
40 Correct 917 ms 659196 KB Output is correct
41 Correct 760 ms 618272 KB Output is correct
42 Correct 805 ms 623228 KB Output is correct
43 Correct 926 ms 633276 KB Output is correct
44 Correct 937 ms 633284 KB Output is correct
45 Correct 746 ms 615160 KB Output is correct
46 Correct 735 ms 613696 KB Output is correct
47 Correct 936 ms 630720 KB Output is correct
48 Correct 979 ms 631020 KB Output is correct
49 Correct 562 ms 594280 KB Output is correct
50 Correct 612 ms 594268 KB Output is correct
51 Correct 594 ms 593768 KB Output is correct
52 Correct 579 ms 593640 KB Output is correct
53 Correct 566 ms 593992 KB Output is correct
54 Correct 556 ms 594000 KB Output is correct
55 Correct 614 ms 594016 KB Output is correct
56 Correct 571 ms 593912 KB Output is correct
57 Correct 558 ms 593948 KB Output is correct
58 Correct 607 ms 593752 KB Output is correct
59 Correct 567 ms 593760 KB Output is correct
60 Correct 558 ms 593580 KB Output is correct
61 Correct 1854 ms 718784 KB Output is correct
62 Correct 3498 ms 862068 KB Output is correct
63 Correct 3632 ms 862984 KB Output is correct
64 Correct 3541 ms 862996 KB Output is correct
65 Correct 875 ms 630136 KB Output is correct
66 Correct 1194 ms 664312 KB Output is correct
67 Correct 1247 ms 667288 KB Output is correct
68 Runtime error 2052 ms 1048580 KB Execution killed with signal 9 (could be triggered by violating memory limits)
69 Halted 0 ms 0 KB -