제출 #766766

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
766766		khshg	Rectangles (IOI19_rect)	C++14	8 / 100	2669 ms	1048576 KiB

rect

#include <cstdio>
#include <unistd.h>
#include <cassert>
#include <string>
#include<bits/stdc++.h>
using namespace std;
 
using ll = long long;
using ld = long double;
using str = string;
 
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<ld, ld>;
#define mp make_pair
#define ff first
#define ss second
 
#define ar array
template<class T> using V = vector<T>;
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<ld>;
using vs = V<str>;
using vpi = V<pi>;
using vpl = V<pl>;
using vpd = V<pd>;
 
#define sz(x) (int)((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define sor(x) sort(all(x))
#define rsz resize
#define ins insert
#define pb push_back
#define eb emplace_back
#define ft front()
#define bk back()
#define lb lower_bound
#define ub upper_bound
 
#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for(int i = (b) - 1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define rep(a) F0R(_, a)
#define trav(a, x) for(auto& a : x)
 
template<class T> bool ckmin(T& a, const T& b) { return (b < a ? a = b, 1 : 0); }
template<class T> bool ckmax(T& a, const T& b) { return (b > a ? a = b, 1 : 0); }


ll count_rectangles(V<vi> a) {
	int N = sz(a);
	int M = sz(a.bk);
	V<V<bitset<8>>> row(N, V<bitset<8>>(M));
	F0R(i, N) {
		F0R(j, M - 1) {
			int mxx = a[i][j + 1];
			FOR(k, j + 2, M) {
				if(mxx < min(a[i][j], a[i][k])) {
					row[i][j][k] = 1;
					ckmax(mxx, a[i][k]);
				}
			}
		}
	}
	V<V<vi>> dp(M, V<vi>(N, vi(N)));
	{
		V<V<vi>> col(M, V<vi>(N));
		F0R(i, M) {
			F0R(j, N - 1) {
				int mxx = a[j + 1][i];
				FOR(k, j + 2, N) {
					if(mxx < min(a[j][i], a[k][i])) {
						col[i][j].eb(k);
						ckmax(mxx, a[k][i]);
					}
				}
			}
		}
		R0F(i, M) {
			F0R(j, N) {
				trav(u, col[i][j]) {
					if(i + 1 < M) dp[i][j][u] = dp[i + 1][j][u] + 1;
					else dp[i][j][u] = 1;
				}
			}
		}
	}
	ll ans = 0;
	FOR(i, 1, N - 1) {
		FOR(j, 1, M - 1) {
			bitset<8> cur = row[i][j - 1];
			FOR(k, i + 1, N) {
				F0R(bruh, dp[j][i - 1][k]) {
					ans += cur[j + 1 + bruh];
				}
				cur &= row[k][j - 1];
			}
		}
	}
	return ans;
}
/*
using namespace std;

class InputReader {
private:
	static const int SIZE = 4096;
	
	int inputFileDescriptor;
	char buf[SIZE];
	int curChar;
	int numChars;

public:

	inline InputReader(int _inputFileDescriptor):
		inputFileDescriptor(_inputFileDescriptor),
		curChar(0),
		numChars(0) {
	}

	inline void close() {
		::close(inputFileDescriptor);
	}

	inline char read() {
		assert(numChars != -1);
		if (curChar >= numChars) {
			curChar = 0;
			numChars = ::read(inputFileDescriptor, buf, SIZE);
			if (numChars == -1)
				return -1;
		}
		return buf[curChar++];
	}

	inline int readInt() {
		int c = eatWhite();
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		int res = 0;
		do {
			assert(c >= '0' && c <= '9');
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	inline string readString() {
		char c = eatWhite();
		string res;
		do {
			res += c;
			c = read();
		} while (!isSpaceChar(c));
		return res;
	}

	inline string readLine() {
		string res;
		while (true) {
			char c = read();
			if (c == '\n' || c == '\r' || c == -1)
				break;
			res += c;
		}
		return res;
	}

	inline char eatWhite() {
		char c = read();
		while (isSpaceChar(c)) 
			c = read();
		return c;
	}

	static inline bool isSpaceChar(char c) {
		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	}
};

int main() {
	InputReader inputReader(STDIN_FILENO);
	int n, m;
	n = inputReader.readInt();
	m = inputReader.readInt();
	vector<vector<int>> a(n, vector<int>(m));
	for (int i = 0; i < n; i++)	{
		for (int j = 0; j < m; j++) {
			a[i][j] = inputReader.readInt();
		}
	}
	inputReader.close();

	long long result = count_rectangles(a);

	printf("%lld\n", result);
	fclose(stdout);
	return 0;
}*/

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