oj.uz

Submission #937263

# Submission time Handle Problem Language Result Execution time Memory
937263 2024-03-03T17:22:14 Z GrindMachine Rectangles (IOI19_rect) C++17
59 / 100
 1938 ms 1048576 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

read some solutions long back, remember some ideas from there

*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "rect.h"

long long count_rectangles(std::vector<std::vector<int> > a) {
	int n = sz(a), m = sz(a[0]);
	if(n <= 2 or m <= 2) return 0;

	vector<pii> up[n][m];
	int ptr = 0;

	bool there[m][n][n];
	memset(there,0,sizeof there);

	rep(j,m){
		stack<int> st;
		rep(i,n){
			bool eq = false;
			while(!st.empty() and a[i][j] >= a[st.top()][j]){
				int k = st.top();
				st.pop();
				if(a[i][j] == a[k][j]){
					eq = true;
				}
				if(i-k >= 2){
					there[j][k][i] = 1;
					up[i][j].pb({k,ptr++});
				}
			}

			if(!st.empty() and !eq){
				int k = st.top();
				if(i-k >= 2){
					there[j][k][i] = 1;
					up[i][j].pb({k,ptr++});
				}
			}

			st.push(i);
		}
	}

	vector<int> farthest(ptr);
	map<array<int,3>,int> mp;

	rev(j,m-1,0){
		rep(i,n){
			for(auto [k,ptr] : up[i][j]){
				array<int,3> ar = {j,k,i};
				array<int,3> want = {j+1,k,i};
				if(mp.count(want)){
					farthest[ptr] = farthest[mp[want]];
				}
				else{
					farthest[ptr] = j;
				}

				mp[ar] = ptr;
			}
		}
	}

	int prev_occ[m][m], first_occ[m][m];
	memset(prev_occ,-1,sizeof prev_occ);
	memset(first_occ,-1,sizeof first_occ);

	ll ans = 0;

	rep1(i,n-1){
		stack<int> st;
		vector<pii> good;
		rep(j,m){
			bool eq = false;
			while(!st.empty() and a[i][j] >= a[i][st.top()]){
				int k = st.top();
				st.pop();
				if(a[i][j] == a[i][k]){
					eq = true;
				}
				if(j-k >= 2){
					good.pb({k,j});
				}
			}

			// cout << j << endl;
			// cout << eq << endl;
			// auto st_copy = st;
			// while(!st_copy.empty()){
			// 	cout << st_copy.top() << " ";
			// 	st_copy.pop();
			// }
			// cout << endl;

			if(!st.empty() and !eq){
				int k = st.top();
				if(j-k >= 2){
					// cout << k << " " << j << endl;
					good.pb({k,j});
				}
			}

			st.push(j);
		}

		for(auto [l,r] : good){
			if(prev_occ[l][r] != i-1){
				first_occ[l][r] = i;
			}

			prev_occ[l][r] = i;

			for(int k = first_occ[l][r]; k <= i; ++k){
				if(there[l+1][k-1][i+1]){
					array<int,3> ar = {l+1,k-1,i+1};
					int ptr = mp[ar];
					if(farthest[ptr] >= r-1){
						// cout << l << " " << r << endl;
						ans++;
					}
				}
			}
		}
	}

	/*

	int oans = 0;

	rep1(i1,n-1){
		rep1(j1,m-1){
			for(int i2 = i1; i2 < n-1; ++i2){
				for(int j2 = j1; j2 < m-1; ++j2){
					bool ok = true;
					for(int r = i1; r <= i2; ++r){
						for(int c = j1; c <= j2; ++c){
							if(a[r][c] >= min({a[i1-1][c],a[i2+1][c],a[r][j1-1],a[r][j2+1]})){
								ok = false;
								break;
							}
						}
						if(!ok) break;
					}

					if(ok){
						oans++;
						// cout << i1 << " " << j1 << " " << i2 << " " << j2 << endl;
					}
				}
			}
		}
	}
	
	*/
	
	// cout << ans << endl;
	// cout << oans << endl;
	// cout << endl;

	// assert(ans == oans);

	return ans;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 408 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 432 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 432 KB Output is correct
22 Correct 4 ms 1624 KB Output is correct
23 Correct 5 ms 1628 KB Output is correct
24 Correct 4 ms 1628 KB Output is correct
25 Correct 2 ms 1368 KB Output is correct
26 Correct 3 ms 1632 KB Output is correct
27 Correct 3 ms 1628 KB Output is correct
28 Correct 3 ms 1624 KB Output is correct
29 Correct 2 ms 988 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 408 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 432 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 4 ms 1624 KB Output is correct
18 Correct 5 ms 1628 KB Output is correct
19 Correct 4 ms 1628 KB Output is correct
20 Correct 2 ms 1368 KB Output is correct
21 Correct 3 ms 1632 KB Output is correct
22 Correct 3 ms 1628 KB Output is correct
23 Correct 3 ms 1624 KB Output is correct
24 Correct 2 ms 988 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 432 KB Output is correct
30 Correct 31 ms 12884 KB Output is correct
31 Correct 32 ms 12888 KB Output is correct
32 Correct 31 ms 13144 KB Output is correct
33 Correct 13 ms 11100 KB Output is correct
34 Correct 23 ms 13148 KB Output is correct
35 Correct 26 ms 13136 KB Output is correct
36 Correct 25 ms 12980 KB Output is correct
37 Correct 25 ms 12892 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 408 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 432 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 4 ms 1624 KB Output is correct
18 Correct 5 ms 1628 KB Output is correct
19 Correct 4 ms 1628 KB Output is correct
20 Correct 2 ms 1368 KB Output is correct
21 Correct 3 ms 1632 KB Output is correct
22 Correct 3 ms 1628 KB Output is correct
23 Correct 3 ms 1624 KB Output is correct
24 Correct 2 ms 988 KB Output is correct
25 Correct 31 ms 12884 KB Output is correct
26 Correct 32 ms 12888 KB Output is correct
27 Correct 31 ms 13144 KB Output is correct
28 Correct 13 ms 11100 KB Output is correct
29 Correct 23 ms 13148 KB Output is correct
30 Correct 26 ms 13136 KB Output is correct
31 Correct 25 ms 12980 KB Output is correct
32 Correct 25 ms 12892 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 432 KB Output is correct
38 Correct 385 ms 377424 KB Output is correct
39 Correct 378 ms 377292 KB Output is correct
40 Correct 316 ms 382288 KB Output is correct
41 Correct 344 ms 382208 KB Output is correct
42 Correct 1884 ms 396304 KB Output is correct
43 Correct 1938 ms 395856 KB Output is correct
44 Correct 1853 ms 396828 KB Output is correct
45 Correct 1587 ms 350820 KB Output is correct
46 Correct 297 ms 367948 KB Output is correct
47 Correct 347 ms 373884 KB Output is correct
48 Correct 527 ms 397596 KB Output is correct
49 Correct 541 ms 400032 KB Output is correct
50 Correct 280 ms 199248 KB Output is correct
51 Correct 215 ms 117920 KB Output is correct
52 Correct 530 ms 395604 KB Output is correct
53 Correct 532 ms 396592 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 49748 KB Output is correct
2 Correct 23 ms 36188 KB Output is correct
3 Correct 30 ms 49528 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 32 ms 49728 KB Output is correct
6 Correct 37 ms 49748 KB Output is correct
7 Correct 31 ms 49560 KB Output is correct
8 Correct 33 ms 49800 KB Output is correct
9 Correct 32 ms 49556 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 432 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Runtime error 591 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 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 408 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 432 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 4 ms 1624 KB Output is correct
18 Correct 5 ms 1628 KB Output is correct
19 Correct 4 ms 1628 KB Output is correct
20 Correct 2 ms 1368 KB Output is correct
21 Correct 3 ms 1632 KB Output is correct
22 Correct 3 ms 1628 KB Output is correct
23 Correct 3 ms 1624 KB Output is correct
24 Correct 2 ms 988 KB Output is correct
25 Correct 31 ms 12884 KB Output is correct
26 Correct 32 ms 12888 KB Output is correct
27 Correct 31 ms 13144 KB Output is correct
28 Correct 13 ms 11100 KB Output is correct
29 Correct 23 ms 13148 KB Output is correct
30 Correct 26 ms 13136 KB Output is correct
31 Correct 25 ms 12980 KB Output is correct
32 Correct 25 ms 12892 KB Output is correct
33 Correct 385 ms 377424 KB Output is correct
34 Correct 378 ms 377292 KB Output is correct
35 Correct 316 ms 382288 KB Output is correct
36 Correct 344 ms 382208 KB Output is correct
37 Correct 1884 ms 396304 KB Output is correct
38 Correct 1938 ms 395856 KB Output is correct
39 Correct 1853 ms 396828 KB Output is correct
40 Correct 1587 ms 350820 KB Output is correct
41 Correct 297 ms 367948 KB Output is correct
42 Correct 347 ms 373884 KB Output is correct
43 Correct 527 ms 397596 KB Output is correct
44 Correct 541 ms 400032 KB Output is correct
45 Correct 280 ms 199248 KB Output is correct
46 Correct 215 ms 117920 KB Output is correct
47 Correct 530 ms 395604 KB Output is correct
48 Correct 532 ms 396592 KB Output is correct
49 Correct 32 ms 49748 KB Output is correct
50 Correct 23 ms 36188 KB Output is correct
51 Correct 30 ms 49528 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 32 ms 49728 KB Output is correct
54 Correct 37 ms 49748 KB Output is correct
55 Correct 31 ms 49560 KB Output is correct
56 Correct 33 ms 49800 KB Output is correct
57 Correct 32 ms 49556 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 600 KB Output is correct
61 Runtime error 591 ms 1048576 KB Execution killed with signal 9
62 Halted 0 ms 0 KB -