oj.uz

Submission #1047774

# Submission time Handle Problem Language Result Execution time Memory
1047774 2024-08-07T15:53:59 Z mychecksedad Rectangles (IOI19_rect) C++17
23 / 100
 124 ms 98644 KB 
#include "rect.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define ff first
#define all(x) x.begin(), x.end()
#define ss second
const int N = 2600, K = 20;
int rmq[N][K];

int get(int l, int r){
	int k = int(log2(r-l+1));
	return max(rmq[l][k], rmq[r-(1<<k)+1][k]);
}
long long count_rectangles(std::vector<std::vector<int> > a) {
	int n = a.size();
	int m = a[0].size();

	if(n < 3 || m < 3){
		return 0;
	}

	if(n == 3){
		vector<bool> good(m);
		for(int i = 1; i + 1 < m; ++i){
			if(a[1][i] < a[0][i] && a[1][i] < a[2][i]){
				good[i] = 1;
			}else good[i] = 0;
		}

		for(int i = 1; i < m; ++i) rmq[i][0] = (good[i] ? a[1][i] : INT_MAX);
		for(int j = 1; j < K; ++j){
			for(int i = 1; i + (1<<j) <= m; ++i){
				rmq[i][j] = max(rmq[i][j - 1], rmq[i+(1<<(j-1))][j-1]);
			}
		}
		int ans = 0;
		for(int i = 1; i + 1 < m; ++i){
			for(int j = i; j + 1 < m; ++j){
				if(get(i, j) < min(a[1][i - 1], a[1][j + 1]) && good[i]){
					++ans;
				}
			}
		}

		return ans;
	}
	vector<vector<int>> dp(n, vector<int>(m));
	vector<vector<int>> dp2(n, vector<int>(m));
	ll ans = 0;
	for(int j = 1; j + 1 < m; ++j) dp[0][j] = (a[0][j] == 0 ? -n*m*5 : 0);
	for(int i = 1; i + 1 < n; ++i){
		for(int j = 0; j < m; ++j){
			if(a[i][j] == 1){
				dp[i][j] = 0;
				dp2[i][j] = dp2[i - 1][j] + 1;
			}else{
				dp[i][j] = dp[i - 1][j] + 1;
				dp2[i][j] = 0;
			}
		}
	}
	// for(int i = 0; i < n; ++i){
	// 	for(int j = 0; j < m; ++j) cout << a[i][j];
	// 	cout << '\n';
	// }
	for(int i = 1; i + 1 < n; ++i){
		int r = 1;
		for(int j = 1; j + 1 < m; ++j){
			// cout << i << ' ' << j << '\n';
			if(a[i][j] == 1) continue;
			// cout << i << ' ' << j << '\n';
			if(a[i][j - 1] != 1) continue;
			if(a[i + 1][j] != 1) continue;
			r = j;
			while(r + 1 < m && a[i][r] == 0 && a[i + 1][r] == 1) ++r;
			--r;
			if(a[i][r + 1] != 1){
				j = r;
				continue;
			}

			ll sum = 0;
			int mx = dp[i][j];
			if(mx < 0){
				j = r;
				continue;
			}
			int ok = 1;

			vector<pair<int, ll>> v;
			for(int l = j; l <= r; ++l){
				// int co = 1;
				// while(!v.empty() && v.back().first > dp[i][l]){
				// 	co += v.back().second;
				// 	sum -= v.back().first * v.back().second;
				// 	v.pop_back();
				// }
				// sum += dp[i][l] * co;
				// v.pb({dp[i][l], co});
				if(dp[i][l] != mx) ok = 0;
			}
			// cout << ok;
			// cout << i << ' ' << j-1 << ' ';
			// cout <<dp2[i][j-1] << ' ';
			ans += ok && dp2[i][j - 1] >= dp[i][j] && dp2[i][r + 1] >= dp[i][j];

			// cout << i << ' ' << j << ' ' << r << ' ' << ans << '\n';

			j = r;
		}
	}

	return ans;
}

Compilation message

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:84:7: warning: unused variable 'sum' [-Wunused-variable]
   84 |    ll sum = 0;
      |       ^~~

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 604 KB Output is correct
2 Correct 22 ms 600 KB Output is correct
3 Correct 30 ms 700 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 30 ms 704 KB Output is correct
6 Correct 30 ms 604 KB Output is correct
7 Correct 30 ms 604 KB Output is correct
8 Correct 31 ms 600 KB Output is correct
9 Correct 30 ms 604 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 54 ms 45280 KB Output is correct
3 Correct 115 ms 98128 KB Output is correct
4 Correct 124 ms 98448 KB Output is correct
5 Correct 119 ms 98472 KB Output is correct
6 Correct 35 ms 48796 KB Output is correct
7 Correct 68 ms 92500 KB Output is correct
8 Correct 81 ms 98644 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -