Submission #430253

#	Time	Username	Problem	Language	Result	Execution time	Memory
430253		egekabas	Rectangles (IOI19_rect)	C++14	72 / 100	5162 ms	848544 KiB

rect

#include "rect.h"
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
int bit[2509][2509];
int bitsz;
void upd(int x, int y, int val){
	for(int i1 = x+1; i1 > 0; i1 -= i1&(-i1))
		for(int i2 = y+1; i2 <= bitsz; i2 += i2&(-i2))
			bit[i1][i2] += val;
}
int get(int x, int y){
	int ret = 0;
	for(int i1 = x+1; i1 <= bitsz; i1 += i1&(-i1))
		for(int i2 = y+1; i2 > 0; i2 -= i2&(-i2))
			ret += bit[i1][i2];
	return ret;
}

long long count_rectangles(std::vector<std::vector<int> > a) {
	int n = a.size(), m = a[0].size();
	bitsz = max(n, m);
	for(int i = 1; i <= bitsz; ++i)
		for(int j = 1; j <= bitsz; ++j)
			bit[i][j] = 0;
	
	vector<vector<vector<int>>> pos(m, vector<vector<int>>(m));
	for(int i = 0; i < n; ++i){
		vector<int> cur;
		for(int j = m-1; j >= 0; --j){
			while(cur.size() && a[i][cur.back()] < a[i][j]){
				pos[j][cur.back()].pb(i);
				cur.pop_back();
			}
			if(cur.size())
				pos[j][cur.back()].pb(i);
			while(cur.size() && a[i][cur.back()] <= a[i][j])
				cur.pop_back();
			
			cur.pb(j);
		}
	}
	vector<vector<vector<pii>>> maxval(m, vector<vector<pii>>(n));
	
	for(int x = 0; x < m; ++x)
		for(int y = x+2; y < m; ++y)
			for(int i = 0; i < pos[x][y].size();){
				int j;
				for(j = i+1; j < pos[x][y].size(); ++j)
					if(pos[x][y][j] != pos[x][y][j-1]+1)
						break;
				int l = pos[x][y][i];
				int r = pos[x][y][j-1];
				//cout << x << ' ' << y << ' ' << l << ' ' << r << '\n';
				maxval[x][l].pb({r, y});//////////////////////////
				i = j;
			}
		
	pos = vector<vector<vector<int>>>(n, vector<vector<int>>(n));

	for(int i = 0; i < m; ++i){
		vector<int> cur;
		for(int j = n-1; j >= 0; --j){
			while(cur.size() && a[cur.back()][i] < a[j][i]){
				pos[j][cur.back()].pb(i);
				cur.pop_back();
			}
			if(cur.size())
				pos[j][cur.back()].pb(i);
			while(cur.size() && a[cur.back()][i] <= a[j][i])
				cur.pop_back();
			
			cur.pb(j);
		}
	}
	vector<vector<vector<pii>>> fin(m, vector<vector<pii>>(n));
	
	for(int x = 0; x < n; ++x)
		for(int y = x+2; y < n; ++y)
			for(int i = 0; i < pos[x][y].size();){
				int j;
				for(j = i+1; j < pos[x][y].size(); ++j)
					if(pos[x][y][j] != pos[x][y][j-1]+1)
						break;
				int l = pos[x][y][i];
				int r = pos[x][y][j-1];
				for(int k = l; k <= r; ++k)
					fin[k][x].pb({y, r});

				i = j;
			}
	ll ans = 0;
	for(int i = 1; i < m; ++i){
		int curidx = 0;
		for(int j = 0; j < n; ++j)
			for(auto u : fin[i][j]){
				while(curidx < n && curidx <= j+1){
					for(auto u : maxval[i-1][curidx])
						upd(u.ff, u.ss, 1);
					++curidx;
				}
				int val = get(u.ff-1, u.ss+1);
				//cout << i << ' ' << u.ss << ' ' << u.ff.ff << ' ' << u.ff.ss << ' ' << val << '\n';
				ans += val;
			}
		for(int j = 0; j < curidx; ++j)
			for(auto u : maxval[i-1][j])
				upd(u.ff, u.ss, -1);
	}
	return ans;
}

Compilation message (stderr)

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:58:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |    for(int i = 0; i < pos[x][y].size();){
      |                   ~~^~~~~~~~~~~~~~~~~~
rect.cpp:60:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |     for(j = i+1; j < pos[x][y].size(); ++j)
      |                  ~~^~~~~~~~~~~~~~~~~~
rect.cpp:91:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |    for(int i = 0; i < pos[x][y].size();){
      |                   ~~^~~~~~~~~~~~~~~~~~
rect.cpp:93:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |     for(j = i+1; j < pos[x][y].size(); ++j)
      |                  ~~^~~~~~~~~~~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 7 / 7
• Subtask 3: 12 / 12
• Subtask 4: 22 / 22
• Subtask 5: 10 / 10
• Subtask 6: 13 / 13
• Subtask 7: 0 / 28