oj.uz

Submission #157351

# Submission time Handle Problem Language Result Execution time Memory
157351 2019-10-11T03:03:43 Z qkxwsm Rectangles (IOI19_rect) C++14
72 / 100
 3553 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;
vector<vi> grid;
short rt[MAXN][MAXN], dn[MAXN][MAXN], lt[MAXN][MAXN], up[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]); grid = a;
	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();
			rt[i][j] = cand.back().se;
			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();
			lt[i][j] = cand.back().se;
			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();
			dn[j][i] = cand.back().se;
			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();
			up[j][i] = cand.back().se;
			cand.PB({grid[j][i], j});
		}
	}
	FOR(i, 0, N)
	{
		FOR(j, 0, M)
		{
			int idx = lt[i][j];
			if (idx >= 0 & idx != j - 1)
			{
				eh[i][idx + 1].PB(j - 1);
			}
			idx = rt[i][j];
			if (idx < M && idx != j + 1)
			{
				eh[i][j + 1].PB(idx - 1);
			}
			idx = up[i][j];
			if (idx >= 0 && idx != i - 1)
			{
				ev[idx + 1][j].PB(i - 1);
			}
			idx = dn[i][j];
			if (idx < N && idx != i + 1)
			{
				ev[i + 1][j].PB(idx - 1);
			}
		}
	}
	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:96: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 574 ms 593892 KB Output is correct
2 Correct 609 ms 594240 KB Output is correct
3 Correct 645 ms 594168 KB Output is correct
4 Correct 607 ms 594296 KB Output is correct
5 Correct 552 ms 594032 KB Output is correct
6 Correct 553 ms 594152 KB Output is correct
7 Correct 554 ms 594116 KB Output is correct
8 Correct 594 ms 593808 KB Output is correct
9 Correct 616 ms 594040 KB Output is correct
10 Correct 620 ms 594224 KB Output is correct
11 Correct 554 ms 594168 KB Output is correct
12 Correct 642 ms 594168 KB Output is correct
13 Correct 553 ms 593528 KB Output is correct
14 Correct 556 ms 593676 KB Output is correct
15 Correct 550 ms 593784 KB Output is correct
16 Correct 572 ms 593724 KB Output is correct
17 Correct 599 ms 593508 KB Output is correct
18 Correct 571 ms 593528 KB Output is correct
19 Correct 563 ms 594044 KB Output is correct
20 Correct 556 ms 594088 KB Output is correct
21 Correct 560 ms 593944 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 574 ms 593892 KB Output is correct
2 Correct 609 ms 594240 KB Output is correct
3 Correct 645 ms 594168 KB Output is correct
4 Correct 607 ms 594296 KB Output is correct
5 Correct 552 ms 594032 KB Output is correct
6 Correct 553 ms 594152 KB Output is correct
7 Correct 554 ms 594116 KB Output is correct
8 Correct 594 ms 593808 KB Output is correct
9 Correct 616 ms 594040 KB Output is correct
10 Correct 620 ms 594224 KB Output is correct
11 Correct 554 ms 594168 KB Output is correct
12 Correct 642 ms 594168 KB Output is correct
13 Correct 553 ms 593528 KB Output is correct
14 Correct 556 ms 593676 KB Output is correct
15 Correct 550 ms 593784 KB Output is correct
16 Correct 572 ms 593724 KB Output is correct
17 Correct 567 ms 595756 KB Output is correct
18 Correct 563 ms 595700 KB Output is correct
19 Correct 622 ms 595892 KB Output is correct
20 Correct 654 ms 595284 KB Output is correct
21 Correct 562 ms 595332 KB Output is correct
22 Correct 564 ms 595368 KB Output is correct
23 Correct 563 ms 595328 KB Output is correct
24 Correct 574 ms 595248 KB Output is correct
25 Correct 599 ms 593508 KB Output is correct
26 Correct 571 ms 593528 KB Output is correct
27 Correct 563 ms 594044 KB Output is correct
28 Correct 556 ms 594088 KB Output is correct
29 Correct 560 ms 593944 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 574 ms 593892 KB Output is correct
2 Correct 609 ms 594240 KB Output is correct
3 Correct 645 ms 594168 KB Output is correct
4 Correct 607 ms 594296 KB Output is correct
5 Correct 552 ms 594032 KB Output is correct
6 Correct 553 ms 594152 KB Output is correct
7 Correct 554 ms 594116 KB Output is correct
8 Correct 594 ms 593808 KB Output is correct
9 Correct 616 ms 594040 KB Output is correct
10 Correct 620 ms 594224 KB Output is correct
11 Correct 554 ms 594168 KB Output is correct
12 Correct 642 ms 594168 KB Output is correct
13 Correct 553 ms 593528 KB Output is correct
14 Correct 556 ms 593676 KB Output is correct
15 Correct 550 ms 593784 KB Output is correct
16 Correct 572 ms 593724 KB Output is correct
17 Correct 567 ms 595756 KB Output is correct
18 Correct 563 ms 595700 KB Output is correct
19 Correct 622 ms 595892 KB Output is correct
20 Correct 654 ms 595284 KB Output is correct
21 Correct 562 ms 595332 KB Output is correct
22 Correct 564 ms 595368 KB Output is correct
23 Correct 563 ms 595328 KB Output is correct
24 Correct 574 ms 595248 KB Output is correct
25 Correct 626 ms 602624 KB Output is correct
26 Correct 588 ms 602656 KB Output is correct
27 Correct 583 ms 602744 KB Output is correct
28 Correct 578 ms 599464 KB Output is correct
29 Correct 606 ms 600504 KB Output is correct
30 Correct 620 ms 600180 KB Output is correct
31 Correct 583 ms 600056 KB Output is correct
32 Correct 636 ms 600056 KB Output is correct
33 Correct 599 ms 593508 KB Output is correct
34 Correct 571 ms 593528 KB Output is correct
35 Correct 563 ms 594044 KB Output is correct
36 Correct 556 ms 594088 KB Output is correct
37 Correct 560 ms 593944 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 574 ms 593892 KB Output is correct
2 Correct 609 ms 594240 KB Output is correct
3 Correct 645 ms 594168 KB Output is correct
4 Correct 607 ms 594296 KB Output is correct
5 Correct 552 ms 594032 KB Output is correct
6 Correct 553 ms 594152 KB Output is correct
7 Correct 554 ms 594116 KB Output is correct
8 Correct 594 ms 593808 KB Output is correct
9 Correct 616 ms 594040 KB Output is correct
10 Correct 620 ms 594224 KB Output is correct
11 Correct 554 ms 594168 KB Output is correct
12 Correct 642 ms 594168 KB Output is correct
13 Correct 553 ms 593528 KB Output is correct
14 Correct 556 ms 593676 KB Output is correct
15 Correct 550 ms 593784 KB Output is correct
16 Correct 572 ms 593724 KB Output is correct
17 Correct 567 ms 595756 KB Output is correct
18 Correct 563 ms 595700 KB Output is correct
19 Correct 622 ms 595892 KB Output is correct
20 Correct 654 ms 595284 KB Output is correct
21 Correct 562 ms 595332 KB Output is correct
22 Correct 564 ms 595368 KB Output is correct
23 Correct 563 ms 595328 KB Output is correct
24 Correct 574 ms 595248 KB Output is correct
25 Correct 626 ms 602624 KB Output is correct
26 Correct 588 ms 602656 KB Output is correct
27 Correct 583 ms 602744 KB Output is correct
28 Correct 578 ms 599464 KB Output is correct
29 Correct 606 ms 600504 KB Output is correct
30 Correct 620 ms 600180 KB Output is correct
31 Correct 583 ms 600056 KB Output is correct
32 Correct 636 ms 600056 KB Output is correct
33 Correct 776 ms 643956 KB Output is correct
34 Correct 1092 ms 630008 KB Output is correct
35 Correct 724 ms 629872 KB Output is correct
36 Correct 715 ms 615800 KB Output is correct
37 Correct 920 ms 674504 KB Output is correct
38 Correct 951 ms 674360 KB Output is correct
39 Correct 915 ms 674592 KB Output is correct
40 Correct 891 ms 669108 KB Output is correct
41 Correct 764 ms 628524 KB Output is correct
42 Correct 826 ms 633676 KB Output is correct
43 Correct 965 ms 643768 KB Output is correct
44 Correct 967 ms 643960 KB Output is correct
45 Correct 757 ms 625012 KB Output is correct
46 Correct 752 ms 618872 KB Output is correct
47 Correct 928 ms 641472 KB Output is correct
48 Correct 939 ms 641508 KB Output is correct
49 Correct 599 ms 593508 KB Output is correct
50 Correct 571 ms 593528 KB Output is correct
51 Correct 563 ms 594044 KB Output is correct
52 Correct 556 ms 594088 KB Output is correct
53 Correct 560 ms 593944 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 561 ms 594316 KB Output is correct
2 Correct 559 ms 594272 KB Output is correct
3 Correct 560 ms 594052 KB Output is correct
4 Correct 566 ms 593680 KB Output is correct
5 Correct 594 ms 594184 KB Output is correct
6 Correct 556 ms 594148 KB Output is correct
7 Correct 556 ms 594248 KB Output is correct
8 Correct 555 ms 594040 KB Output is correct
9 Correct 567 ms 594132 KB Output is correct
10 Correct 558 ms 593728 KB Output is correct
11 Correct 556 ms 593844 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 556 ms 593652 KB Output is correct
2 Correct 1859 ms 741412 KB Output is correct
3 Correct 3465 ms 910416 KB Output is correct
4 Correct 3481 ms 912828 KB Output is correct
5 Correct 3553 ms 912980 KB Output is correct
6 Correct 999 ms 655288 KB Output is correct
7 Correct 1481 ms 712884 KB Output is correct
8 Correct 1534 ms 717652 KB Output is correct
9 Correct 599 ms 593508 KB Output is correct
10 Correct 571 ms 593528 KB Output is correct
11 Correct 563 ms 594044 KB Output is correct
12 Correct 556 ms 594088 KB Output is correct
13 Correct 560 ms 593944 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 574 ms 593892 KB Output is correct
2 Correct 609 ms 594240 KB Output is correct
3 Correct 645 ms 594168 KB Output is correct
4 Correct 607 ms 594296 KB Output is correct
5 Correct 552 ms 594032 KB Output is correct
6 Correct 553 ms 594152 KB Output is correct
7 Correct 554 ms 594116 KB Output is correct
8 Correct 594 ms 593808 KB Output is correct
9 Correct 616 ms 594040 KB Output is correct
10 Correct 620 ms 594224 KB Output is correct
11 Correct 554 ms 594168 KB Output is correct
12 Correct 642 ms 594168 KB Output is correct
13 Correct 553 ms 593528 KB Output is correct
14 Correct 556 ms 593676 KB Output is correct
15 Correct 550 ms 593784 KB Output is correct
16 Correct 572 ms 593724 KB Output is correct
17 Correct 567 ms 595756 KB Output is correct
18 Correct 563 ms 595700 KB Output is correct
19 Correct 622 ms 595892 KB Output is correct
20 Correct 654 ms 595284 KB Output is correct
21 Correct 562 ms 595332 KB Output is correct
22 Correct 564 ms 595368 KB Output is correct
23 Correct 563 ms 595328 KB Output is correct
24 Correct 574 ms 595248 KB Output is correct
25 Correct 626 ms 602624 KB Output is correct
26 Correct 588 ms 602656 KB Output is correct
27 Correct 583 ms 602744 KB Output is correct
28 Correct 578 ms 599464 KB Output is correct
29 Correct 606 ms 600504 KB Output is correct
30 Correct 620 ms 600180 KB Output is correct
31 Correct 583 ms 600056 KB Output is correct
32 Correct 636 ms 600056 KB Output is correct
33 Correct 776 ms 643956 KB Output is correct
34 Correct 1092 ms 630008 KB Output is correct
35 Correct 724 ms 629872 KB Output is correct
36 Correct 715 ms 615800 KB Output is correct
37 Correct 920 ms 674504 KB Output is correct
38 Correct 951 ms 674360 KB Output is correct
39 Correct 915 ms 674592 KB Output is correct
40 Correct 891 ms 669108 KB Output is correct
41 Correct 764 ms 628524 KB Output is correct
42 Correct 826 ms 633676 KB Output is correct
43 Correct 965 ms 643768 KB Output is correct
44 Correct 967 ms 643960 KB Output is correct
45 Correct 757 ms 625012 KB Output is correct
46 Correct 752 ms 618872 KB Output is correct
47 Correct 928 ms 641472 KB Output is correct
48 Correct 939 ms 641508 KB Output is correct
49 Correct 561 ms 594316 KB Output is correct
50 Correct 559 ms 594272 KB Output is correct
51 Correct 560 ms 594052 KB Output is correct
52 Correct 566 ms 593680 KB Output is correct
53 Correct 594 ms 594184 KB Output is correct
54 Correct 556 ms 594148 KB Output is correct
55 Correct 556 ms 594248 KB Output is correct
56 Correct 555 ms 594040 KB Output is correct
57 Correct 567 ms 594132 KB Output is correct
58 Correct 558 ms 593728 KB Output is correct
59 Correct 556 ms 593844 KB Output is correct
60 Correct 556 ms 593652 KB Output is correct
61 Correct 1859 ms 741412 KB Output is correct
62 Correct 3465 ms 910416 KB Output is correct
63 Correct 3481 ms 912828 KB Output is correct
64 Correct 3553 ms 912980 KB Output is correct
65 Correct 999 ms 655288 KB Output is correct
66 Correct 1481 ms 712884 KB Output is correct
67 Correct 1534 ms 717652 KB Output is correct
68 Runtime error 2105 ms 1048580 KB Execution killed with signal 9 (could be triggered by violating memory limits)
69 Halted 0 ms 0 KB -