oj.uz

Submission #1054403

# Submission time Handle Problem Language Result Execution time Memory
1054403 2024-08-12T09:39:40 Z dozer Rectangles (IOI19_rect) C++14
72 / 100
 5000 ms 942932 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;
#define sp " "
#define endl "\n"
#define pb push_back
#define pii pair<int, int>
#define st first
#define nd second
#define fileio() freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define LL node * 2
#define RR node * 2 + 1
#define ll long long
#define MAXN 2505
#define LOGN 12
 
vector<pii> rng_h[MAXN], rng_v[MAXN];
vector<int> hor[MAXN][MAXN], ver[MAXN][MAXN];
vector<int> nxt_hor[MAXN][MAXN], nxt_ver[MAXN][MAXN];

void compute(vector<vector<int>> &a, int t){
	int n = a.size(), m = a.front().size();
	if (t == 1) swap(n, m);
	for (int i = 1; i < n - 1; i++){
		
		set<int> s;
		vector<int> v(m);
		iota(v.begin(), v.end(), 0);
		sort(v.begin(), v.end(), [&](int x, int y){
			if (t == 0){
				if (a[i][x] == a[i][y]) return x < y;
				return a[i][x] > a[i][y];
			}
			else{
				if (a[x][i] == a[y][i]) return x < y;
				return a[x][i] > a[y][i];
			}
		});
		
		int it = 0;
		while(it < m){
			vector<int> tmp;
			int last = 0;
			if (t) last = a[v[it]][i];
			else last = a[i][v[it]];
			while(it < m){
				if (t == 0 && a[i][v[it]] != last) break;
				else if (t == 1 && a[v[it]][i] != last) break;
				tmp.pb(v[it]);
				it++;
			}
			
			for (int j = 0; j < tmp.size(); j++){
				int x = tmp[j];
				auto it2 = s.lower_bound(x);
				int prv = -1, nxt = m + 1;
				if (j > 0) prv = tmp[j - 1];
				if (j + 1 < tmp.size()) nxt = tmp[j + 1];
				
				if (it2 != s.begin() && !s.empty()){
					it2--;
					
					if (x - 1 > *it2) {
						if (t == 0) rng_h[i].pb({*it2 + 1, x - 1});
						else rng_v[i].pb({*it2 + 1, x - 1});
					}
				}
				it2 = s.lower_bound(x);
				if (it2 != s.end()){
					if (*it2 > x + 1 && *it2 < nxt) {
						
						if (t == 0) rng_h[i].pb({x + 1, *it2 - 1});
						else rng_v[i].pb({x + 1, *it2 - 1});
					}
				}
				
				s.insert(x);
			}
		}
		
	}
}
 
 
int b_search(vector<int> &v, int pos){
	int ans = pos;
	for (int i = LOGN; i >= 0; i--){
		int tmp = ans + (1<<i);
		if (tmp >= v.size()) continue;
		if (v[tmp] - v[pos] == tmp - pos) ans = tmp;
	}
	return ans;
}
 
 
 
long long count_rectangles(vector<vector<int>> a){
	compute(a, 0);
	compute(a, 1);
	
	int n = a.size(), m = a.front().size();
	for (int i = 1; i < n - 1; i++){
		sort(rng_h[i].begin(), rng_h[i].end());
		for (auto j : rng_h[i]){
			hor[j.st][j.nd].pb(i);
		}
	}
 
	for (int i = 1; i < m - 1; i++){
		sort(rng_v[i].begin(), rng_v[i].end());
		for (auto j : rng_v[i]){
			ver[j.st][j.nd].pb(i);
		}
	}
/*
	for (int i = 1; i < n - 1; i++){
		for (int j = i; j < n - 1; j++){
			int k = ver[i][j].size();
			nxt_ver[i][j].resize(k, 0);
			iota(nxt_ver[i][j].begin(), nxt_ver[i][j].end(), 0);
			for (int l = k - 2; l >= 0; l--){
				if (ver[i][j][l] + 1 == ver[i][j][l + 1]) nxt_ver[i][j][l] = nxt_ver[i][j][l + 1];
			}
		}
	}

	for (int i = 1; i < m - 1; i++){
		for (int j = i; j < m - 1; j++){
			int k = hor[i][j].size();
			nxt_hor[i][j].resize(k, 0);
			iota(nxt_hor[i][j].begin(), nxt_hor[i][j].end(), 0);
			
			for (int l = k - 2; l >= 0; l--){
				if (hor[i][j][l] + 1 == hor[i][j][l + 1]) nxt_hor[i][j][l] = nxt_hor[i][j][l + 1];

			}
		}
	}
 */
	long long ans = 0;
	
	for (int i = 1; i < n - 1; i++){
		for (int j = 1; j < m - 1; j++){
			vector<pii> horr, verr;
			int pos = lower_bound(rng_h[i].begin(), rng_h[i].end(), make_pair(j, 0)) - rng_h[i].begin();
			while(pos != rng_h[i].size() && rng_h[i][pos].st == j){
				int l = j, r = rng_h[i][pos].nd;
				pos++;
				int curr = lower_bound(hor[l][r].begin(), hor[l][r].end(), i) - hor[l][r].begin();
				int to = hor[l][r][b_search(hor[l][r], curr)];
				horr.pb({r, to});
			}

			pos = lower_bound(rng_v[j].begin(), rng_v[j].end(), make_pair(i, 0)) - rng_v[j].begin();
			while(pos != rng_v[j].size() && rng_v[j][pos].st == i){
				int l = i, r = rng_v[j][pos].nd;
				pos++;
				int curr = lower_bound(ver[l][r].begin(), ver[l][r].end(), j) - ver[l][r].begin();
				int to = ver[l][r][b_search(ver[l][r], curr)];
				verr.pb({r, to});
			}
			for (auto k : horr){
				for (auto l : verr)
					if (l.nd >= k.st && k.nd >= l.st) ans++;
			}
		}
	}
	return ans;
 
	return 0;
}
 
 /*

int main() {
	fileio();
	int n, m;
	cin>>n>>m;
	vector<vector<int>> a(n, vector<int>(m));
	for (int i = 0; i < n; i++)	{
		for (int j = 0; j < m; j++) {
			cin>>a[i][j];
		}
	}
	long long result = count_rectangles(a);
 
	printf("%lld\n", result);
	return 0;
}*/

Compilation message

rect.cpp: In function 'void compute(std::vector<std::vector<int> >&, int)':
rect.cpp:54:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |    for (int j = 0; j < tmp.size(); j++){
      |                    ~~^~~~~~~~~~~~
rect.cpp:59:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |     if (j + 1 < tmp.size()) nxt = tmp[j + 1];
      |         ~~~~~~^~~~~~~~~~~~
rect.cpp:57:9: warning: variable 'prv' set but not used [-Wunused-but-set-variable]
   57 |     int prv = -1, nxt = m + 1;
      |         ^~~
rect.cpp: In function 'int b_search(std::vector<int>&, int)':
rect.cpp:90:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |   if (tmp >= v.size()) continue;
      |       ~~~~^~~~~~~~~~~
rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:147:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  147 |    while(pos != rng_h[i].size() && rng_h[i][pos].st == j){
      |          ~~~~^~~~~~~~~~~~~~~~~~
rect.cpp:156:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  156 |    while(pos != rng_v[j].size() && rng_v[j][pos].st == i){
      |          ~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 589748 KB Output is correct
2 Correct 147 ms 589908 KB Output is correct
3 Correct 149 ms 589904 KB Output is correct
4 Correct 149 ms 589924 KB Output is correct
5 Correct 148 ms 589740 KB Output is correct
6 Correct 149 ms 589860 KB Output is correct
7 Correct 152 ms 589796 KB Output is correct
8 Correct 145 ms 589904 KB Output is correct
9 Correct 146 ms 589904 KB Output is correct
10 Correct 148 ms 589908 KB Output is correct
11 Correct 147 ms 589904 KB Output is correct
12 Correct 147 ms 589904 KB Output is correct
13 Correct 144 ms 589740 KB Output is correct
14 Correct 152 ms 589768 KB Output is correct
15 Correct 147 ms 589904 KB Output is correct
16 Correct 165 ms 589908 KB Output is correct
17 Correct 150 ms 589904 KB Output is correct
18 Correct 147 ms 589876 KB Output is correct
19 Correct 148 ms 589908 KB Output is correct
20 Correct 146 ms 589904 KB Output is correct
21 Correct 146 ms 589868 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 589748 KB Output is correct
2 Correct 147 ms 589908 KB Output is correct
3 Correct 149 ms 589904 KB Output is correct
4 Correct 149 ms 589924 KB Output is correct
5 Correct 148 ms 589740 KB Output is correct
6 Correct 149 ms 589860 KB Output is correct
7 Correct 152 ms 589796 KB Output is correct
8 Correct 145 ms 589904 KB Output is correct
9 Correct 146 ms 589904 KB Output is correct
10 Correct 148 ms 589908 KB Output is correct
11 Correct 147 ms 589904 KB Output is correct
12 Correct 147 ms 589904 KB Output is correct
13 Correct 144 ms 589740 KB Output is correct
14 Correct 152 ms 589768 KB Output is correct
15 Correct 147 ms 589904 KB Output is correct
16 Correct 165 ms 589908 KB Output is correct
17 Correct 150 ms 589904 KB Output is correct
18 Correct 147 ms 589876 KB Output is correct
19 Correct 148 ms 589908 KB Output is correct
20 Correct 146 ms 589904 KB Output is correct
21 Correct 146 ms 589868 KB Output is correct
22 Correct 150 ms 590164 KB Output is correct
23 Correct 155 ms 590164 KB Output is correct
24 Correct 155 ms 590224 KB Output is correct
25 Correct 164 ms 589908 KB Output is correct
26 Correct 149 ms 590260 KB Output is correct
27 Correct 171 ms 590112 KB Output is correct
28 Correct 168 ms 590224 KB Output is correct
29 Correct 150 ms 589904 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 589748 KB Output is correct
2 Correct 147 ms 589908 KB Output is correct
3 Correct 149 ms 589904 KB Output is correct
4 Correct 149 ms 589924 KB Output is correct
5 Correct 148 ms 589740 KB Output is correct
6 Correct 149 ms 589860 KB Output is correct
7 Correct 152 ms 589796 KB Output is correct
8 Correct 145 ms 589904 KB Output is correct
9 Correct 146 ms 589904 KB Output is correct
10 Correct 148 ms 589908 KB Output is correct
11 Correct 147 ms 589904 KB Output is correct
12 Correct 147 ms 589904 KB Output is correct
13 Correct 144 ms 589740 KB Output is correct
14 Correct 152 ms 589768 KB Output is correct
15 Correct 147 ms 589904 KB Output is correct
16 Correct 165 ms 589908 KB Output is correct
17 Correct 150 ms 590164 KB Output is correct
18 Correct 155 ms 590164 KB Output is correct
19 Correct 155 ms 590224 KB Output is correct
20 Correct 164 ms 589908 KB Output is correct
21 Correct 149 ms 590260 KB Output is correct
22 Correct 171 ms 590112 KB Output is correct
23 Correct 168 ms 590224 KB Output is correct
24 Correct 150 ms 589904 KB Output is correct
25 Correct 150 ms 589904 KB Output is correct
26 Correct 147 ms 589876 KB Output is correct
27 Correct 148 ms 589908 KB Output is correct
28 Correct 146 ms 589904 KB Output is correct
29 Correct 146 ms 589868 KB Output is correct
30 Correct 164 ms 591440 KB Output is correct
31 Correct 170 ms 591444 KB Output is correct
32 Correct 161 ms 591440 KB Output is correct
33 Correct 171 ms 590932 KB Output is correct
34 Correct 176 ms 591604 KB Output is correct
35 Correct 199 ms 591524 KB Output is correct
36 Correct 186 ms 591444 KB Output is correct
37 Correct 186 ms 591540 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 589748 KB Output is correct
2 Correct 147 ms 589908 KB Output is correct
3 Correct 149 ms 589904 KB Output is correct
4 Correct 149 ms 589924 KB Output is correct
5 Correct 148 ms 589740 KB Output is correct
6 Correct 149 ms 589860 KB Output is correct
7 Correct 152 ms 589796 KB Output is correct
8 Correct 145 ms 589904 KB Output is correct
9 Correct 146 ms 589904 KB Output is correct
10 Correct 148 ms 589908 KB Output is correct
11 Correct 147 ms 589904 KB Output is correct
12 Correct 147 ms 589904 KB Output is correct
13 Correct 144 ms 589740 KB Output is correct
14 Correct 152 ms 589768 KB Output is correct
15 Correct 147 ms 589904 KB Output is correct
16 Correct 165 ms 589908 KB Output is correct
17 Correct 150 ms 590164 KB Output is correct
18 Correct 155 ms 590164 KB Output is correct
19 Correct 155 ms 590224 KB Output is correct
20 Correct 164 ms 589908 KB Output is correct
21 Correct 149 ms 590260 KB Output is correct
22 Correct 171 ms 590112 KB Output is correct
23 Correct 168 ms 590224 KB Output is correct
24 Correct 150 ms 589904 KB Output is correct
25 Correct 164 ms 591440 KB Output is correct
26 Correct 170 ms 591444 KB Output is correct
27 Correct 161 ms 591440 KB Output is correct
28 Correct 171 ms 590932 KB Output is correct
29 Correct 176 ms 591604 KB Output is correct
30 Correct 199 ms 591524 KB Output is correct
31 Correct 186 ms 591444 KB Output is correct
32 Correct 186 ms 591540 KB Output is correct
33 Correct 150 ms 589904 KB Output is correct
34 Correct 147 ms 589876 KB Output is correct
35 Correct 148 ms 589908 KB Output is correct
36 Correct 146 ms 589904 KB Output is correct
37 Correct 146 ms 589868 KB Output is correct
38 Correct 362 ms 614712 KB Output is correct
39 Correct 372 ms 614852 KB Output is correct
40 Correct 411 ms 614708 KB Output is correct
41 Correct 392 ms 614736 KB Output is correct
42 Correct 403 ms 610520 KB Output is correct
43 Correct 422 ms 610644 KB Output is correct
44 Correct 446 ms 610640 KB Output is correct
45 Correct 414 ms 609800 KB Output is correct
46 Correct 390 ms 598100 KB Output is correct
47 Correct 435 ms 601856 KB Output is correct
48 Correct 554 ms 611232 KB Output is correct
49 Correct 562 ms 611556 KB Output is correct
50 Correct 391 ms 600916 KB Output is correct
51 Correct 366 ms 600776 KB Output is correct
52 Correct 545 ms 610016 KB Output is correct
53 Correct 553 ms 610128 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 180 ms 590100 KB Output is correct
2 Correct 160 ms 590160 KB Output is correct
3 Correct 151 ms 590116 KB Output is correct
4 Correct 147 ms 589904 KB Output is correct
5 Correct 181 ms 590452 KB Output is correct
6 Correct 154 ms 590040 KB Output is correct
7 Correct 152 ms 590056 KB Output is correct
8 Correct 151 ms 590056 KB Output is correct
9 Correct 148 ms 590124 KB Output is correct
10 Correct 163 ms 589800 KB Output is correct
11 Correct 147 ms 589908 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 589904 KB Output is correct
2 Correct 147 ms 589876 KB Output is correct
3 Correct 148 ms 589908 KB Output is correct
4 Correct 146 ms 589904 KB Output is correct
5 Correct 146 ms 589868 KB Output is correct
6 Correct 148 ms 589908 KB Output is correct
7 Correct 1495 ms 641620 KB Output is correct
8 Correct 3300 ms 699708 KB Output is correct
9 Correct 3236 ms 699772 KB Output is correct
10 Correct 3202 ms 700144 KB Output is correct
11 Correct 839 ms 614484 KB Output is correct
12 Correct 1537 ms 636160 KB Output is correct
13 Correct 1575 ms 639312 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 589748 KB Output is correct
2 Correct 147 ms 589908 KB Output is correct
3 Correct 149 ms 589904 KB Output is correct
4 Correct 149 ms 589924 KB Output is correct
5 Correct 148 ms 589740 KB Output is correct
6 Correct 149 ms 589860 KB Output is correct
7 Correct 152 ms 589796 KB Output is correct
8 Correct 145 ms 589904 KB Output is correct
9 Correct 146 ms 589904 KB Output is correct
10 Correct 148 ms 589908 KB Output is correct
11 Correct 147 ms 589904 KB Output is correct
12 Correct 147 ms 589904 KB Output is correct
13 Correct 144 ms 589740 KB Output is correct
14 Correct 152 ms 589768 KB Output is correct
15 Correct 147 ms 589904 KB Output is correct
16 Correct 165 ms 589908 KB Output is correct
17 Correct 150 ms 590164 KB Output is correct
18 Correct 155 ms 590164 KB Output is correct
19 Correct 155 ms 590224 KB Output is correct
20 Correct 164 ms 589908 KB Output is correct
21 Correct 149 ms 590260 KB Output is correct
22 Correct 171 ms 590112 KB Output is correct
23 Correct 168 ms 590224 KB Output is correct
24 Correct 150 ms 589904 KB Output is correct
25 Correct 164 ms 591440 KB Output is correct
26 Correct 170 ms 591444 KB Output is correct
27 Correct 161 ms 591440 KB Output is correct
28 Correct 171 ms 590932 KB Output is correct
29 Correct 176 ms 591604 KB Output is correct
30 Correct 199 ms 591524 KB Output is correct
31 Correct 186 ms 591444 KB Output is correct
32 Correct 186 ms 591540 KB Output is correct
33 Correct 362 ms 614712 KB Output is correct
34 Correct 372 ms 614852 KB Output is correct
35 Correct 411 ms 614708 KB Output is correct
36 Correct 392 ms 614736 KB Output is correct
37 Correct 403 ms 610520 KB Output is correct
38 Correct 422 ms 610644 KB Output is correct
39 Correct 446 ms 610640 KB Output is correct
40 Correct 414 ms 609800 KB Output is correct
41 Correct 390 ms 598100 KB Output is correct
42 Correct 435 ms 601856 KB Output is correct
43 Correct 554 ms 611232 KB Output is correct
44 Correct 562 ms 611556 KB Output is correct
45 Correct 391 ms 600916 KB Output is correct
46 Correct 366 ms 600776 KB Output is correct
47 Correct 545 ms 610016 KB Output is correct
48 Correct 553 ms 610128 KB Output is correct
49 Correct 180 ms 590100 KB Output is correct
50 Correct 160 ms 590160 KB Output is correct
51 Correct 151 ms 590116 KB Output is correct
52 Correct 147 ms 589904 KB Output is correct
53 Correct 181 ms 590452 KB Output is correct
54 Correct 154 ms 590040 KB Output is correct
55 Correct 152 ms 590056 KB Output is correct
56 Correct 151 ms 590056 KB Output is correct
57 Correct 148 ms 590124 KB Output is correct
58 Correct 163 ms 589800 KB Output is correct
59 Correct 147 ms 589908 KB Output is correct
60 Correct 148 ms 589908 KB Output is correct
61 Correct 1495 ms 641620 KB Output is correct
62 Correct 3300 ms 699708 KB Output is correct
63 Correct 3236 ms 699772 KB Output is correct
64 Correct 3202 ms 700144 KB Output is correct
65 Correct 839 ms 614484 KB Output is correct
66 Correct 1537 ms 636160 KB Output is correct
67 Correct 1575 ms 639312 KB Output is correct
68 Correct 150 ms 589904 KB Output is correct
69 Correct 147 ms 589876 KB Output is correct
70 Correct 148 ms 589908 KB Output is correct
71 Correct 146 ms 589904 KB Output is correct
72 Correct 146 ms 589868 KB Output is correct
73 Correct 3392 ms 942488 KB Output is correct
74 Correct 3415 ms 942920 KB Output is correct
75 Correct 3304 ms 942932 KB Output is correct
76 Execution timed out 5074 ms 942744 KB Time limit exceeded
77 Halted 0 ms 0 KB -