oj.uz

답안 #144003

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
144003 2019-08-15T15:52:07 Z tincamatei Rectangles (IOI19_rect) C++14
100 / 100
 4712 ms 760004 KB 
#include "rect.h"
#include <cstdio>
#include <algorithm>

using namespace std;

bool goodRect(int i, int j, int exp) {
	return j - i - 1 > 0 && exp >= j - i - 1;
}

struct Column {
	int l1, l2, c;
};

const int MAX_N = 2500;
const int MAX_L = 12;

vector<Column> getColumns(const vector<vector<int> > matr) {
	int N = matr.size(), M = matr[0].size();
	vector<int> stiva(N, 0);
	vector<Column> rez;
	int top;

	for(int c = 0; c < M; ++c) {
		top = 0;
		for(int l = 0; l < N; ++l) {
			bool eq = false;

			while(top > 0 && matr[l][c] >= matr[stiva[top - 1]][c]) {
				if(l - stiva[top - 1] > 1)
					rez.push_back({stiva[top - 1], l, c});
				if(matr[l][c] == matr[stiva[top - 1]][c])
					eq = true;
				--top;
			}

			if(!eq && top > 0 && l - stiva[top - 1] > 1)
				rez.push_back({stiva[top - 1], l, c});
			stiva[top++] = l;
		}
	}

	return rez;
}

bool cmp(Column a, Column b) {
	return a.l1 < b.l1 || (a.l1 == b.l1 && a.l2 < b.l2) || (a.l1 == b.l1 && a.l2 == b.l2 && a.c < b.c);
}

int mylog[1+MAX_N];
int rmqleft[MAX_L][MAX_N][MAX_N];
int rmqright[MAX_L][MAX_N][MAX_N];

void initRmq(const vector<vector<int> > &a) {
	int N = a.size(), M = a[0].size();
	vector<int> stiva(M);
	int top;

	for(int l = 0; l < N; ++l)
		for(int c = 0; c < M; ++c) {
			rmqleft[0][l][c] = 0;
			rmqright[0][l][c] = M - 1;
		}

	for(int l = 0; l < N; ++l) {
		top = 0;
		for(int c = 0; c < M; ++c) {
			bool eq = false;
			while(top > 0 && a[l][c] >= a[l][stiva[top - 1]]) {
				rmqright[0][l][stiva[top - 1]] = c;
				if(a[l][stiva[top - 1]] == a[l][c]) {
					rmqleft[0][l][c] = stiva[top - 1];
					eq = true;
				}
				--top;
			}

			if(!eq && top > 0)
				rmqleft[0][l][c] = stiva[top - 1];
			stiva[top++] = c;
		}
	}

	for(int lg = 1; lg < MAX_L; ++lg)
		for(int l = 0; l < N; ++l)
			for(int c = 0; c < M; ++c) {
				rmqleft[lg][l][c] = max(rmqleft[lg - 1][l][c], rmqleft[lg - 1][l + (1 << (lg - 1))][c]);
				rmqright[lg][l][c] = min(rmqright[lg - 1][l][c], rmqright[lg - 1][l + (1 << (lg - 1))][c]);
			}
	
	for(int i = 2; i <= MAX_N; ++i)
		mylog[i] = mylog[i / 2] + 1;
}

int queryRmq(int c, int l1, int l2, bool left) {
	int lg = mylog[l2 - l1 + 1];
	if(left)
		return max(rmqleft[lg][l1][c], rmqleft[lg][l2 - (1 << lg) + 1][c]);
	else
		return min(rmqright[lg][l1][c], rmqright[lg][l2 - (1 << lg) + 1][c]);
}

int aib[1+MAX_N];

static inline int lsb(int x) {
	return x & (-x);
}

int limInf, limSup;

void update(int poz, int val) {
	poz++;
	while(poz <= limSup) {
		aib[poz] += val;
		poz += lsb(poz);
	}
}

int query(int poz) {
	int rez = 0;
	poz++;
	while(poz > limInf) {
		rez += aib[poz];
		poz -= lsb(poz);
	}
	return rez;
}

enum TypeEvent {
	INSERT,
	ERASE
};

struct Event {
	TypeEvent type;
	int x, c;
};

bool cmpEvent(Event &a, Event &b) {
	return a.x < b.x || (a.x == b.x && a.type < b.type);
}

long long processRectangle(int c1, int c2, int l1, int l2) {
	vector<Event> evs;

	++l1;
	--l2;

	limInf = c1;
	limSup = c2 + 1;

	for(int c = c1; c <= c2; ++c) {
		int left, right;
		right = queryRmq(c, l1, l2, false);

		evs.push_back({INSERT, c, c});
		evs.push_back({ERASE, right, c});
	}
	
	sort(evs.begin(), evs.end(), cmpEvent);

	int lastup = 0;
	long long rez = 0LL;
	for(int c = c1; c <= c2; ++c) {
		while(lastup < evs.size() && evs[lastup].x == c && evs[lastup].type == INSERT) {
			update(evs[lastup].c, 1);
			++lastup;
		}

		int left = queryRmq(c, l1, l2, true);
		rez = rez + query(max(c - 2, -1)) - query(max(left - 1, -1));

		while(lastup < evs.size() && evs[lastup].x == c && evs[lastup].type == ERASE) {
			update(evs[lastup].c, -1);
			++lastup;
		}
	}

	while(lastup < evs.size()) {
		if(evs[lastup].type == INSERT)
			update(evs[lastup].c, 1);
		else
			update(evs[lastup].c, -1);
		++lastup;
	}
	return rez;
}

long long count_rectangles(std::vector<std::vector<int> > a) {
	int N, M;
	long long sum = 0LL;
	N = a.size();
	M = a[0].size();

	initRmq(a);

	vector<Column> rez;
	rez = getColumns(a);
	
	sort(rez.begin(), rez.end(), cmp);

	int i, j;
	i = j = 0;

	while(i < rez.size()) {
		while(j < rez.size() && rez[i].l1 == rez[j].l1 && rez[i].l2 == rez[j].l2 && rez[i].c + (j - i) == rez[j].c)
			++j;
		sum = sum + processRectangle(max(0, rez[i].c - 1), min(M - 1, rez[j - 1].c + 1), rez[i].l1, rez[i].l2);

		i = j;
	}

	return sum;
}

Compilation message

rect.cpp: In function 'long long int processRectangle(int, int, int, int)':
rect.cpp:153:7: warning: unused variable 'left' [-Wunused-variable]
   int left, right;
       ^~~~
rect.cpp:165:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(lastup < evs.size() && evs[lastup].x == c && evs[lastup].type == INSERT) {
         ~~~~~~~^~~~~~~~~~~~
rect.cpp:173:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(lastup < evs.size() && evs[lastup].x == c && evs[lastup].type == ERASE) {
         ~~~~~~~^~~~~~~~~~~~
rect.cpp:179:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(lastup < evs.size()) {
        ~~~~~~~^~~~~~~~~~~~
rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:205:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(i < rez.size()) {
        ~~^~~~~~~~~~~~
rect.cpp:206:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(j < rez.size() && rez[i].l1 == rez[j].l1 && rez[i].l2 == rez[j].l2 && rez[i].c + (j - i) == rez[j].c)
         ~~^~~~~~~~~~~~
rect.cpp:190:6: warning: variable 'N' set but not used [-Wunused-but-set-variable]
  int N, M;
      ^

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1016 KB Output is correct
2 Correct 5 ms 3448 KB Output is correct
3 Correct 5 ms 3452 KB Output is correct
4 Correct 5 ms 3448 KB Output is correct
5 Correct 5 ms 3448 KB Output is correct
6 Correct 5 ms 3448 KB Output is correct
7 Correct 5 ms 3448 KB Output is correct
8 Correct 3 ms 1656 KB Output is correct
9 Correct 5 ms 3448 KB Output is correct
10 Correct 5 ms 3448 KB Output is correct
11 Correct 5 ms 3448 KB Output is correct
12 Correct 5 ms 3448 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 3 ms 1400 KB Output is correct
15 Correct 3 ms 1400 KB Output is correct
16 Correct 2 ms 760 KB Output is correct
17 Correct 2 ms 504 KB Output is correct
18 Correct 2 ms 504 KB Output is correct
19 Correct 5 ms 3448 KB Output is correct
20 Correct 5 ms 3320 KB Output is correct
21 Correct 3 ms 1400 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1016 KB Output is correct
2 Correct 5 ms 3448 KB Output is correct
3 Correct 5 ms 3452 KB Output is correct
4 Correct 5 ms 3448 KB Output is correct
5 Correct 5 ms 3448 KB Output is correct
6 Correct 5 ms 3448 KB Output is correct
7 Correct 5 ms 3448 KB Output is correct
8 Correct 3 ms 1656 KB Output is correct
9 Correct 5 ms 3448 KB Output is correct
10 Correct 5 ms 3448 KB Output is correct
11 Correct 5 ms 3448 KB Output is correct
12 Correct 5 ms 3448 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 3 ms 1400 KB Output is correct
15 Correct 3 ms 1400 KB Output is correct
16 Correct 2 ms 760 KB Output is correct
17 Correct 12 ms 8952 KB Output is correct
18 Correct 12 ms 8952 KB Output is correct
19 Correct 12 ms 8952 KB Output is correct
20 Correct 11 ms 8952 KB Output is correct
21 Correct 13 ms 8860 KB Output is correct
22 Correct 13 ms 8952 KB Output is correct
23 Correct 13 ms 8952 KB Output is correct
24 Correct 11 ms 8568 KB Output is correct
25 Correct 2 ms 504 KB Output is correct
26 Correct 2 ms 504 KB Output is correct
27 Correct 5 ms 3448 KB Output is correct
28 Correct 5 ms 3320 KB Output is correct
29 Correct 3 ms 1400 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1016 KB Output is correct
2 Correct 5 ms 3448 KB Output is correct
3 Correct 5 ms 3452 KB Output is correct
4 Correct 5 ms 3448 KB Output is correct
5 Correct 5 ms 3448 KB Output is correct
6 Correct 5 ms 3448 KB Output is correct
7 Correct 5 ms 3448 KB Output is correct
8 Correct 3 ms 1656 KB Output is correct
9 Correct 5 ms 3448 KB Output is correct
10 Correct 5 ms 3448 KB Output is correct
11 Correct 5 ms 3448 KB Output is correct
12 Correct 5 ms 3448 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 3 ms 1400 KB Output is correct
15 Correct 3 ms 1400 KB Output is correct
16 Correct 2 ms 760 KB Output is correct
17 Correct 12 ms 8952 KB Output is correct
18 Correct 12 ms 8952 KB Output is correct
19 Correct 12 ms 8952 KB Output is correct
20 Correct 11 ms 8952 KB Output is correct
21 Correct 13 ms 8860 KB Output is correct
22 Correct 13 ms 8952 KB Output is correct
23 Correct 13 ms 8952 KB Output is correct
24 Correct 11 ms 8568 KB Output is correct
25 Correct 37 ms 24816 KB Output is correct
26 Correct 37 ms 24828 KB Output is correct
27 Correct 37 ms 24820 KB Output is correct
28 Correct 33 ms 24248 KB Output is correct
29 Correct 48 ms 24872 KB Output is correct
30 Correct 47 ms 24848 KB Output is correct
31 Correct 44 ms 24820 KB Output is correct
32 Correct 44 ms 24688 KB Output is correct
33 Correct 2 ms 504 KB Output is correct
34 Correct 2 ms 504 KB Output is correct
35 Correct 5 ms 3448 KB Output is correct
36 Correct 5 ms 3320 KB Output is correct
37 Correct 3 ms 1400 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1016 KB Output is correct
2 Correct 5 ms 3448 KB Output is correct
3 Correct 5 ms 3452 KB Output is correct
4 Correct 5 ms 3448 KB Output is correct
5 Correct 5 ms 3448 KB Output is correct
6 Correct 5 ms 3448 KB Output is correct
7 Correct 5 ms 3448 KB Output is correct
8 Correct 3 ms 1656 KB Output is correct
9 Correct 5 ms 3448 KB Output is correct
10 Correct 5 ms 3448 KB Output is correct
11 Correct 5 ms 3448 KB Output is correct
12 Correct 5 ms 3448 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 3 ms 1400 KB Output is correct
15 Correct 3 ms 1400 KB Output is correct
16 Correct 2 ms 760 KB Output is correct
17 Correct 12 ms 8952 KB Output is correct
18 Correct 12 ms 8952 KB Output is correct
19 Correct 12 ms 8952 KB Output is correct
20 Correct 11 ms 8952 KB Output is correct
21 Correct 13 ms 8860 KB Output is correct
22 Correct 13 ms 8952 KB Output is correct
23 Correct 13 ms 8952 KB Output is correct
24 Correct 11 ms 8568 KB Output is correct
25 Correct 37 ms 24816 KB Output is correct
26 Correct 37 ms 24828 KB Output is correct
27 Correct 37 ms 24820 KB Output is correct
28 Correct 33 ms 24248 KB Output is correct
29 Correct 48 ms 24872 KB Output is correct
30 Correct 47 ms 24848 KB Output is correct
31 Correct 44 ms 24820 KB Output is correct
32 Correct 44 ms 24688 KB Output is correct
33 Correct 259 ms 122704 KB Output is correct
34 Correct 259 ms 122728 KB Output is correct
35 Correct 299 ms 122828 KB Output is correct
36 Correct 237 ms 122728 KB Output is correct
37 Correct 299 ms 125796 KB Output is correct
38 Correct 294 ms 125928 KB Output is correct
39 Correct 336 ms 125796 KB Output is correct
40 Correct 292 ms 117988 KB Output is correct
41 Correct 198 ms 121248 KB Output is correct
42 Correct 236 ms 122676 KB Output is correct
43 Correct 399 ms 125792 KB Output is correct
44 Correct 412 ms 125796 KB Output is correct
45 Correct 242 ms 97004 KB Output is correct
46 Correct 204 ms 63244 KB Output is correct
47 Correct 369 ms 125788 KB Output is correct
48 Correct 373 ms 125796 KB Output is correct
49 Correct 2 ms 504 KB Output is correct
50 Correct 2 ms 504 KB Output is correct
51 Correct 5 ms 3448 KB Output is correct
52 Correct 5 ms 3320 KB Output is correct
53 Correct 3 ms 1400 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1528 KB Output is correct
2 Correct 4 ms 1528 KB Output is correct
3 Correct 3 ms 1404 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 4 ms 1400 KB Output is correct
6 Correct 4 ms 1400 KB Output is correct
7 Correct 4 ms 1404 KB Output is correct
8 Correct 4 ms 1400 KB Output is correct
9 Correct 4 ms 1400 KB Output is correct
10 Correct 2 ms 888 KB Output is correct
11 Correct 3 ms 1144 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1400 KB Output is correct
2 Correct 835 ms 336600 KB Output is correct
3 Correct 1813 ms 682632 KB Output is correct
4 Correct 1802 ms 686024 KB Output is correct
5 Correct 1810 ms 686152 KB Output is correct
6 Correct 396 ms 326776 KB Output is correct
7 Correct 813 ms 656480 KB Output is correct
8 Correct 838 ms 661104 KB Output is correct
9 Correct 2 ms 504 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 5 ms 3448 KB Output is correct
12 Correct 5 ms 3320 KB Output is correct
13 Correct 3 ms 1400 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1016 KB Output is correct
2 Correct 5 ms 3448 KB Output is correct
3 Correct 5 ms 3452 KB Output is correct
4 Correct 5 ms 3448 KB Output is correct
5 Correct 5 ms 3448 KB Output is correct
6 Correct 5 ms 3448 KB Output is correct
7 Correct 5 ms 3448 KB Output is correct
8 Correct 3 ms 1656 KB Output is correct
9 Correct 5 ms 3448 KB Output is correct
10 Correct 5 ms 3448 KB Output is correct
11 Correct 5 ms 3448 KB Output is correct
12 Correct 5 ms 3448 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 3 ms 1400 KB Output is correct
15 Correct 3 ms 1400 KB Output is correct
16 Correct 2 ms 760 KB Output is correct
17 Correct 12 ms 8952 KB Output is correct
18 Correct 12 ms 8952 KB Output is correct
19 Correct 12 ms 8952 KB Output is correct
20 Correct 11 ms 8952 KB Output is correct
21 Correct 13 ms 8860 KB Output is correct
22 Correct 13 ms 8952 KB Output is correct
23 Correct 13 ms 8952 KB Output is correct
24 Correct 11 ms 8568 KB Output is correct
25 Correct 37 ms 24816 KB Output is correct
26 Correct 37 ms 24828 KB Output is correct
27 Correct 37 ms 24820 KB Output is correct
28 Correct 33 ms 24248 KB Output is correct
29 Correct 48 ms 24872 KB Output is correct
30 Correct 47 ms 24848 KB Output is correct
31 Correct 44 ms 24820 KB Output is correct
32 Correct 44 ms 24688 KB Output is correct
33 Correct 259 ms 122704 KB Output is correct
34 Correct 259 ms 122728 KB Output is correct
35 Correct 299 ms 122828 KB Output is correct
36 Correct 237 ms 122728 KB Output is correct
37 Correct 299 ms 125796 KB Output is correct
38 Correct 294 ms 125928 KB Output is correct
39 Correct 336 ms 125796 KB Output is correct
40 Correct 292 ms 117988 KB Output is correct
41 Correct 198 ms 121248 KB Output is correct
42 Correct 236 ms 122676 KB Output is correct
43 Correct 399 ms 125792 KB Output is correct
44 Correct 412 ms 125796 KB Output is correct
45 Correct 242 ms 97004 KB Output is correct
46 Correct 204 ms 63244 KB Output is correct
47 Correct 369 ms 125788 KB Output is correct
48 Correct 373 ms 125796 KB Output is correct
49 Correct 4 ms 1528 KB Output is correct
50 Correct 4 ms 1528 KB Output is correct
51 Correct 3 ms 1404 KB Output is correct
52 Correct 2 ms 760 KB Output is correct
53 Correct 4 ms 1400 KB Output is correct
54 Correct 4 ms 1400 KB Output is correct
55 Correct 4 ms 1404 KB Output is correct
56 Correct 4 ms 1400 KB Output is correct
57 Correct 4 ms 1400 KB Output is correct
58 Correct 2 ms 888 KB Output is correct
59 Correct 3 ms 1144 KB Output is correct
60 Correct 3 ms 1400 KB Output is correct
61 Correct 835 ms 336600 KB Output is correct
62 Correct 1813 ms 682632 KB Output is correct
63 Correct 1802 ms 686024 KB Output is correct
64 Correct 1810 ms 686152 KB Output is correct
65 Correct 396 ms 326776 KB Output is correct
66 Correct 813 ms 656480 KB Output is correct
67 Correct 838 ms 661104 KB Output is correct
68 Correct 2799 ms 710596 KB Output is correct
69 Correct 2779 ms 710572 KB Output is correct
70 Correct 2745 ms 710572 KB Output is correct
71 Correct 2526 ms 710700 KB Output is correct
72 Correct 3508 ms 759952 KB Output is correct
73 Correct 2729 ms 446636 KB Output is correct
74 Correct 3086 ms 683576 KB Output is correct
75 Correct 4581 ms 759920 KB Output is correct
76 Correct 2754 ms 446680 KB Output is correct
77 Correct 3845 ms 745136 KB Output is correct
78 Correct 4712 ms 759928 KB Output is correct
79 Correct 2456 ms 446508 KB Output is correct
80 Correct 4266 ms 759788 KB Output is correct
81 Correct 4156 ms 741912 KB Output is correct
82 Correct 2159 ms 681132 KB Output is correct
83 Correct 3445 ms 759500 KB Output is correct
84 Correct 3495 ms 759820 KB Output is correct
85 Correct 3496 ms 760004 KB Output is correct
86 Correct 2 ms 504 KB Output is correct
87 Correct 2 ms 504 KB Output is correct
88 Correct 5 ms 3448 KB Output is correct
89 Correct 5 ms 3320 KB Output is correct
90 Correct 3 ms 1400 KB Output is correct