oj.uz

Submission #157358

# Submission time Handle Problem Language Result Execution time Memory
157358 2019-10-11T03:17:01 Z qkxwsm Rectangles (IOI19_rect) C++14
72 / 100
 3729 ms 1048576 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<short> ev[MAXN][MAXN], eh[MAXN][MAXN], dv[MAXN][MAXN], dh[MAXN][MAXN];
ll ans;

ll count_rectangles(vector<vi> a)
{
	N = SZ(a); M = SZ(a[0]);
	FOR(i, 0, N)
	{
		vpi cand; cand.PB({INF, M + 1});
		FORD(j, M, 0)
		{
			while(cand.back().fi < a[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({a[i][j], j});
		}
		cand.clear(); cand.PB({INF, -2});
		FOR(j, 0, M)
		{
			while(cand.back().fi < a[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({a[i][j], j});
		}
	}
	FOR(i, 0, M)
	{
		vpi cand; cand.PB({INF, N + 1});
		FORD(j, N, 0)
		{
			while(cand.back().fi < a[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({a[j][i], j});
		}
		cand.clear(); cand.PB({INF, -2});
		FOR(j, 0, N)
		{
			while(cand.back().fi < a[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({a[j][i], j});
		}
	}
	//log factor here.
	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];
			}
		}
	}
	//log factor here too.
	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));
			ordered_set<pii> ord;
			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:72: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 556 ms 593492 KB Output is correct
2 Correct 558 ms 593604 KB Output is correct
3 Correct 556 ms 593656 KB Output is correct
4 Correct 549 ms 593784 KB Output is correct
5 Correct 553 ms 593580 KB Output is correct
6 Correct 554 ms 593636 KB Output is correct
7 Correct 556 ms 593656 KB Output is correct
8 Correct 554 ms 593656 KB Output is correct
9 Correct 565 ms 593764 KB Output is correct
10 Correct 551 ms 593764 KB Output is correct
11 Correct 553 ms 593656 KB Output is correct
12 Correct 558 ms 593756 KB Output is correct
13 Correct 556 ms 593660 KB Output is correct
14 Correct 554 ms 593628 KB Output is correct
15 Correct 556 ms 593628 KB Output is correct
16 Correct 578 ms 593612 KB Output is correct
17 Correct 616 ms 593656 KB Output is correct
18 Correct 553 ms 593532 KB Output is correct
19 Correct 564 ms 593656 KB Output is correct
20 Correct 576 ms 593576 KB Output is correct
21 Correct 571 ms 593604 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 556 ms 593492 KB Output is correct
2 Correct 558 ms 593604 KB Output is correct
3 Correct 556 ms 593656 KB Output is correct
4 Correct 549 ms 593784 KB Output is correct
5 Correct 553 ms 593580 KB Output is correct
6 Correct 554 ms 593636 KB Output is correct
7 Correct 556 ms 593656 KB Output is correct
8 Correct 554 ms 593656 KB Output is correct
9 Correct 565 ms 593764 KB Output is correct
10 Correct 551 ms 593764 KB Output is correct
11 Correct 553 ms 593656 KB Output is correct
12 Correct 558 ms 593756 KB Output is correct
13 Correct 556 ms 593660 KB Output is correct
14 Correct 554 ms 593628 KB Output is correct
15 Correct 556 ms 593628 KB Output is correct
16 Correct 578 ms 593612 KB Output is correct
17 Correct 611 ms 594612 KB Output is correct
18 Correct 559 ms 594396 KB Output is correct
19 Correct 558 ms 594316 KB Output is correct
20 Correct 560 ms 593952 KB Output is correct
21 Correct 564 ms 593876 KB Output is correct
22 Correct 561 ms 594068 KB Output is correct
23 Correct 561 ms 593884 KB Output is correct
24 Correct 556 ms 593784 KB Output is correct
25 Correct 616 ms 593656 KB Output is correct
26 Correct 553 ms 593532 KB Output is correct
27 Correct 564 ms 593656 KB Output is correct
28 Correct 576 ms 593576 KB Output is correct
29 Correct 571 ms 593604 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 556 ms 593492 KB Output is correct
2 Correct 558 ms 593604 KB Output is correct
3 Correct 556 ms 593656 KB Output is correct
4 Correct 549 ms 593784 KB Output is correct
5 Correct 553 ms 593580 KB Output is correct
6 Correct 554 ms 593636 KB Output is correct
7 Correct 556 ms 593656 KB Output is correct
8 Correct 554 ms 593656 KB Output is correct
9 Correct 565 ms 593764 KB Output is correct
10 Correct 551 ms 593764 KB Output is correct
11 Correct 553 ms 593656 KB Output is correct
12 Correct 558 ms 593756 KB Output is correct
13 Correct 556 ms 593660 KB Output is correct
14 Correct 554 ms 593628 KB Output is correct
15 Correct 556 ms 593628 KB Output is correct
16 Correct 578 ms 593612 KB Output is correct
17 Correct 611 ms 594612 KB Output is correct
18 Correct 559 ms 594396 KB Output is correct
19 Correct 558 ms 594316 KB Output is correct
20 Correct 560 ms 593952 KB Output is correct
21 Correct 564 ms 593876 KB Output is correct
22 Correct 561 ms 594068 KB Output is correct
23 Correct 561 ms 593884 KB Output is correct
24 Correct 556 ms 593784 KB Output is correct
25 Correct 588 ms 598884 KB Output is correct
26 Correct 585 ms 598776 KB Output is correct
27 Correct 582 ms 598832 KB Output is correct
28 Correct 571 ms 595524 KB Output is correct
29 Correct 618 ms 596472 KB Output is correct
30 Correct 585 ms 596476 KB Output is correct
31 Correct 577 ms 596124 KB Output is correct
32 Correct 583 ms 596148 KB Output is correct
33 Correct 616 ms 593656 KB Output is correct
34 Correct 553 ms 593532 KB Output is correct
35 Correct 564 ms 593656 KB Output is correct
36 Correct 576 ms 593576 KB Output is correct
37 Correct 571 ms 593604 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 556 ms 593492 KB Output is correct
2 Correct 558 ms 593604 KB Output is correct
3 Correct 556 ms 593656 KB Output is correct
4 Correct 549 ms 593784 KB Output is correct
5 Correct 553 ms 593580 KB Output is correct
6 Correct 554 ms 593636 KB Output is correct
7 Correct 556 ms 593656 KB Output is correct
8 Correct 554 ms 593656 KB Output is correct
9 Correct 565 ms 593764 KB Output is correct
10 Correct 551 ms 593764 KB Output is correct
11 Correct 553 ms 593656 KB Output is correct
12 Correct 558 ms 593756 KB Output is correct
13 Correct 556 ms 593660 KB Output is correct
14 Correct 554 ms 593628 KB Output is correct
15 Correct 556 ms 593628 KB Output is correct
16 Correct 578 ms 593612 KB Output is correct
17 Correct 611 ms 594612 KB Output is correct
18 Correct 559 ms 594396 KB Output is correct
19 Correct 558 ms 594316 KB Output is correct
20 Correct 560 ms 593952 KB Output is correct
21 Correct 564 ms 593876 KB Output is correct
22 Correct 561 ms 594068 KB Output is correct
23 Correct 561 ms 593884 KB Output is correct
24 Correct 556 ms 593784 KB Output is correct
25 Correct 588 ms 598884 KB Output is correct
26 Correct 585 ms 598776 KB Output is correct
27 Correct 582 ms 598832 KB Output is correct
28 Correct 571 ms 595524 KB Output is correct
29 Correct 618 ms 596472 KB Output is correct
30 Correct 585 ms 596476 KB Output is correct
31 Correct 577 ms 596124 KB Output is correct
32 Correct 583 ms 596148 KB Output is correct
33 Correct 762 ms 627900 KB Output is correct
34 Correct 743 ms 614012 KB Output is correct
35 Correct 724 ms 613956 KB Output is correct
36 Correct 699 ms 600056 KB Output is correct
37 Correct 980 ms 658692 KB Output is correct
38 Correct 951 ms 658552 KB Output is correct
39 Correct 949 ms 658680 KB Output is correct
40 Correct 918 ms 654316 KB Output is correct
41 Correct 784 ms 612952 KB Output is correct
42 Correct 830 ms 617928 KB Output is correct
43 Correct 943 ms 628200 KB Output is correct
44 Correct 948 ms 628100 KB Output is correct
45 Correct 761 ms 610876 KB Output is correct
46 Correct 739 ms 610680 KB Output is correct
47 Correct 920 ms 625656 KB Output is correct
48 Correct 960 ms 625656 KB Output is correct
49 Correct 616 ms 593656 KB Output is correct
50 Correct 553 ms 593532 KB Output is correct
51 Correct 564 ms 593656 KB Output is correct
52 Correct 576 ms 593576 KB Output is correct
53 Correct 571 ms 593604 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 564 ms 594188 KB Output is correct
2 Correct 555 ms 594040 KB Output is correct
3 Correct 556 ms 593644 KB Output is correct
4 Correct 561 ms 593492 KB Output is correct
5 Correct 559 ms 593932 KB Output is correct
6 Correct 558 ms 593912 KB Output is correct
7 Correct 556 ms 593908 KB Output is correct
8 Correct 557 ms 593960 KB Output is correct
9 Correct 558 ms 593784 KB Output is correct
10 Correct 557 ms 593724 KB Output is correct
11 Correct 558 ms 593784 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 554 ms 593656 KB Output is correct
2 Correct 2004 ms 705784 KB Output is correct
3 Correct 3716 ms 837100 KB Output is correct
4 Correct 3729 ms 838328 KB Output is correct
5 Correct 3695 ms 838384 KB Output is correct
6 Correct 974 ms 617976 KB Output is correct
7 Correct 1382 ms 639684 KB Output is correct
8 Correct 1467 ms 642768 KB Output is correct
9 Correct 616 ms 593656 KB Output is correct
10 Correct 553 ms 593532 KB Output is correct
11 Correct 564 ms 593656 KB Output is correct
12 Correct 576 ms 593576 KB Output is correct
13 Correct 571 ms 593604 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 556 ms 593492 KB Output is correct
2 Correct 558 ms 593604 KB Output is correct
3 Correct 556 ms 593656 KB Output is correct
4 Correct 549 ms 593784 KB Output is correct
5 Correct 553 ms 593580 KB Output is correct
6 Correct 554 ms 593636 KB Output is correct
7 Correct 556 ms 593656 KB Output is correct
8 Correct 554 ms 593656 KB Output is correct
9 Correct 565 ms 593764 KB Output is correct
10 Correct 551 ms 593764 KB Output is correct
11 Correct 553 ms 593656 KB Output is correct
12 Correct 558 ms 593756 KB Output is correct
13 Correct 556 ms 593660 KB Output is correct
14 Correct 554 ms 593628 KB Output is correct
15 Correct 556 ms 593628 KB Output is correct
16 Correct 578 ms 593612 KB Output is correct
17 Correct 611 ms 594612 KB Output is correct
18 Correct 559 ms 594396 KB Output is correct
19 Correct 558 ms 594316 KB Output is correct
20 Correct 560 ms 593952 KB Output is correct
21 Correct 564 ms 593876 KB Output is correct
22 Correct 561 ms 594068 KB Output is correct
23 Correct 561 ms 593884 KB Output is correct
24 Correct 556 ms 593784 KB Output is correct
25 Correct 588 ms 598884 KB Output is correct
26 Correct 585 ms 598776 KB Output is correct
27 Correct 582 ms 598832 KB Output is correct
28 Correct 571 ms 595524 KB Output is correct
29 Correct 618 ms 596472 KB Output is correct
30 Correct 585 ms 596476 KB Output is correct
31 Correct 577 ms 596124 KB Output is correct
32 Correct 583 ms 596148 KB Output is correct
33 Correct 762 ms 627900 KB Output is correct
34 Correct 743 ms 614012 KB Output is correct
35 Correct 724 ms 613956 KB Output is correct
36 Correct 699 ms 600056 KB Output is correct
37 Correct 980 ms 658692 KB Output is correct
38 Correct 951 ms 658552 KB Output is correct
39 Correct 949 ms 658680 KB Output is correct
40 Correct 918 ms 654316 KB Output is correct
41 Correct 784 ms 612952 KB Output is correct
42 Correct 830 ms 617928 KB Output is correct
43 Correct 943 ms 628200 KB Output is correct
44 Correct 948 ms 628100 KB Output is correct
45 Correct 761 ms 610876 KB Output is correct
46 Correct 739 ms 610680 KB Output is correct
47 Correct 920 ms 625656 KB Output is correct
48 Correct 960 ms 625656 KB Output is correct
49 Correct 564 ms 594188 KB Output is correct
50 Correct 555 ms 594040 KB Output is correct
51 Correct 556 ms 593644 KB Output is correct
52 Correct 561 ms 593492 KB Output is correct
53 Correct 559 ms 593932 KB Output is correct
54 Correct 558 ms 593912 KB Output is correct
55 Correct 556 ms 593908 KB Output is correct
56 Correct 557 ms 593960 KB Output is correct
57 Correct 558 ms 593784 KB Output is correct
58 Correct 557 ms 593724 KB Output is correct
59 Correct 558 ms 593784 KB Output is correct
60 Correct 554 ms 593656 KB Output is correct
61 Correct 2004 ms 705784 KB Output is correct
62 Correct 3716 ms 837100 KB Output is correct
63 Correct 3729 ms 838328 KB Output is correct
64 Correct 3695 ms 838384 KB Output is correct
65 Correct 974 ms 617976 KB Output is correct
66 Correct 1382 ms 639684 KB Output is correct
67 Correct 1467 ms 642768 KB Output is correct
68 Correct 3629 ms 1048576 KB Output is correct
69 Correct 3425 ms 900452 KB Output is correct
70 Correct 2873 ms 900196 KB Output is correct
71 Correct 2774 ms 720148 KB Output is correct
72 Runtime error 2144 ms 1048576 KB Execution killed with signal 9 (could be triggered by violating memory limits)
73 Halted 0 ms 0 KB -