oj.uz

Submission #766768

# Submission time Handle Problem Language Result Execution time Memory
766768 2023-06-26T07:10:39 Z khshg Rectangles (IOI19_rect) C++14
27 / 100
 2678 ms 1048576 KB 
#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<700>>> row(N, V<bitset<700>>(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<700> 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.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 292 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 212 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 292 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 5 ms 3412 KB Output is correct
23 Correct 5 ms 3412 KB Output is correct
24 Correct 5 ms 3412 KB Output is correct
25 Correct 5 ms 3284 KB Output is correct
26 Correct 5 ms 3284 KB Output is correct
27 Correct 5 ms 3284 KB Output is correct
28 Correct 5 ms 3412 KB Output is correct
29 Correct 3 ms 1748 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 5 ms 3412 KB Output is correct
18 Correct 5 ms 3412 KB Output is correct
19 Correct 5 ms 3412 KB Output is correct
20 Correct 5 ms 3284 KB Output is correct
21 Correct 5 ms 3284 KB Output is correct
22 Correct 5 ms 3284 KB Output is correct
23 Correct 5 ms 3412 KB Output is correct
24 Correct 3 ms 1748 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 292 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 76 ms 39120 KB Output is correct
31 Correct 83 ms 39184 KB Output is correct
32 Correct 72 ms 39116 KB Output is correct
33 Correct 68 ms 38280 KB Output is correct
34 Correct 72 ms 38476 KB Output is correct
35 Correct 71 ms 38564 KB Output is correct
36 Correct 72 ms 38508 KB Output is correct
37 Correct 70 ms 37948 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 5 ms 3412 KB Output is correct
18 Correct 5 ms 3412 KB Output is correct
19 Correct 5 ms 3412 KB Output is correct
20 Correct 5 ms 3284 KB Output is correct
21 Correct 5 ms 3284 KB Output is correct
22 Correct 5 ms 3284 KB Output is correct
23 Correct 5 ms 3412 KB Output is correct
24 Correct 3 ms 1748 KB Output is correct
25 Correct 76 ms 39120 KB Output is correct
26 Correct 83 ms 39184 KB Output is correct
27 Correct 72 ms 39116 KB Output is correct
28 Correct 68 ms 38280 KB Output is correct
29 Correct 72 ms 38476 KB Output is correct
30 Correct 71 ms 38564 KB Output is correct
31 Correct 72 ms 38508 KB Output is correct
32 Correct 70 ms 37948 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 292 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 0 ms 340 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Runtime error 450 ms 1048576 KB Execution killed with signal 9
39 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

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

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 292 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Runtime error 2678 ms 1048576 KB Execution killed with signal 9
8 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 0 ms 468 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 5 ms 3412 KB Output is correct
18 Correct 5 ms 3412 KB Output is correct
19 Correct 5 ms 3412 KB Output is correct
20 Correct 5 ms 3284 KB Output is correct
21 Correct 5 ms 3284 KB Output is correct
22 Correct 5 ms 3284 KB Output is correct
23 Correct 5 ms 3412 KB Output is correct
24 Correct 3 ms 1748 KB Output is correct
25 Correct 76 ms 39120 KB Output is correct
26 Correct 83 ms 39184 KB Output is correct
27 Correct 72 ms 39116 KB Output is correct
28 Correct 68 ms 38280 KB Output is correct
29 Correct 72 ms 38476 KB Output is correct
30 Correct 71 ms 38564 KB Output is correct
31 Correct 72 ms 38508 KB Output is correct
32 Correct 70 ms 37948 KB Output is correct
33 Runtime error 450 ms 1048576 KB Execution killed with signal 9
34 Halted 0 ms 0 KB -