oj.uz

Submission #656837

# Submission time Handle Problem Language Result Execution time Memory
656837 2022-11-08T09:29:58 Z jcelin Rectangles (IOI19_rect) C++14
100 / 100
 2664 ms 695328 KB 
#include "rect.h"
#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;

typedef long long ll;
typedef long double ld;
typedef unsigned int ui;

#define ii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vii vector<ii>
#define vll vector<ll>
#define vpll vector<pll>
#define matrix vector<vi>
#define matrixLL vector<vll>
#define vs vector<string>
#define vui vector<ui>
#define msi multiset<int>
#define mss multiset<string>
#define si set<int>
#define ss set<string>
#define PB push_back
#define PF push_front
#define PPB pop_back
#define PPF pop_front
#define X first
#define Y second
#define MP make_pair
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()

const int dx[] = {-1, 1, 0, 0};
const int dy[] = {0, 0, -1, 1};
const int dxx[] = {-1, 1, 0, 0, 1, 1, -1, -1};
const int dyy[] = {0, 0, -1, 1, -1, 1, -1, 1};
const string abc="abcdefghijklmnopqrstuvwxyz";
const string ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const ld pi = 3.14159265;
const int mod = 1e9 + 7;
const int MOD = 1e9 + 7;
const int MAXN = 2510;
const int inf = mod;
const ll INF = 1e18;
const ll zero = ll(0);
const int logo = 13;
const int off = 1 << logo;
const int trsz = off << 1;

struct tournament{
	int seg[trsz], type;
	
	int merge(int a, int b){
		if(type == 0) return max(a, b);
		return min(a, b);
	}
	
	
	void build(){
		for(int i=off - 1; i; i--) seg[i] = merge(seg[i * 2], seg[i * 2 + 1]);
	}
	
	void update(int x, int val){
		seg[x + off] = val;
	}
	
	int query(int x, int lo, int hi, int a, int b){
		if(lo >= b or hi <= a) return inf * type - 5;
		if(lo >= a and hi <= b) return seg[x];
		int mid = (lo + hi) / 2;
		return merge(query(x * 2, lo, mid, a, b), query(x * 2 + 1, mid, hi, a, b));
	}
	
	int query(int l, int r){
		int sol = inf * type - 5;;
		for(l += off, r += off; l<r; l >>= 1, r >>= 1){
			if(l & 1) sol = merge(sol, seg[l++]);
			if(r & 1) sol = merge(sol, seg[--r]);
		}
		return sol;
	}
	
}h1[MAXN], h2[MAXN], h3[MAXN], h4[MAXN];

ii st[MAXN];
// i j 0 - prvi veci nalijevo od (i, j)
// i j 1 - prvi veci nadesno od (i, j)
// i j 2 - prvi veci gore od (i, j)
// i j 3 - prvi veci dolje od (i, j)
int bg[MAXN][MAXN][4];

ll count_rectangles(matrix mat){
	int n = mat.size();
	int m = mat[0].size();
	
	int ind = 0;
	REP(i, n){
		st[0] = {inf, -1};
		ind = 0;
		REP(j, m){
			while(st[ind].X < mat[i][j]) ind--;
			bg[i][j][0] = st[ind].Y;
			h1[j].update(i, bg[i][j][0]);
			while(st[ind].X <= mat[i][j]) ind--;
			bg[i][j][0] = st[ind].Y;
			ind++;
			st[ind] = {mat[i][j], j};
		}
		
		st[0] = {inf, m + 1};
		ind = 0;
		for(int j = m - 1; j >= 0; j--){
			while(st[ind].X < mat[i][j]) ind--;
			bg[i][j][1] = st[ind].Y;
			h2[j].update(i, bg[i][j][1]);
			while(st[ind].X <= mat[i][j]) ind--;
			bg[i][j][1] = st[ind].Y;
			ind++;
			st[ind] = {mat[i][j], j};
		}
	}
	
	
	REP(j, m){
		st[0] = {inf, -1};
		ind = 0;
		REP(i, n){
			while(st[ind].X < mat[i][j]) ind--;
			bg[i][j][2] = st[ind].Y;
			h3[i].update(j, bg[i][j][2]);
			while(st[ind].X <= mat[i][j]) ind--;
			
			ind++;
			st[ind] = {mat[i][j], i};
		}
		
		st[0] = {inf, n + 1};
		ind = 0;
		for(int i = n - 1; i >= 0; i--){
			while(st[ind].X < mat[i][j]) ind--;
			bg[i][j][3] = st[ind].Y;
			h4[i].update(j, bg[i][j][3]);
			while(st[ind].X <= mat[i][j]) ind--;
			bg[i][j][3] = st[ind].Y;
			ind++;
			st[ind] = {mat[i][j], i};
		}
	}
	
	
	/*
	REP(i, n) REP(j, m){
		h1[j].update(i, bg[i][j][0]);
		h2[j].update(i, bg[i][j][1]);
		h3[i].update(j, bg[i][j][2]);
		h4[i].update(j, bg[i][j][3]);
	}
	*/
	REP(i, m) h1[i].type = 0, h2[i].type = 1, h1[i].build(), h2[i].build();
	REP(j, n) h3[j].type = 0, h4[j].type = 1, h3[j].build(), h4[j].build();
	/*
	cout << "\n";
	REP(i, n){
		REP(j, m){
			cout << bg[i][j][3] << " ";
		}
		cout << "\n";
	}
	cout << "\n";
	REP(i, n){
		REP(j, m){
			cout << bg[i][j][2] << " ";
		}
		cout << "\n";
	}*/
	
	vll good;
	REP(i, n){
		REP(j, m){
			if(i == 0 or j == 0 or i == n - 1 or j == m - 1) continue;
			if(bg[i][j][0] == -1 or bg[i][j][1] == m + 1) continue;
			if(bg[i][j][2] == -1 or bg[i][j][3] == n + 1) continue;
			//if(i != 2 or j != 1) continue;
			
			//cout << i << " " << j << "\n";
			//REP(k, 4) cout << bg[i][j][k] << " ";
			//cout << '\n';
			
			ll hash = 0;
			REP(k, 4) hash *= MAXN, hash += bg[i][j][k];
			
			//lijeve gr.
			if(bg[i][j][0] < h1[bg[i][j][1]].query(bg[i][j][2] + 1, (bg[i][j][3] - 1) + 1)) continue;
			//cout << "PR1" << "\n";
			//desne
			if(bg[i][j][1] > h2[bg[i][j][0]].query(bg[i][j][2] + 1, (bg[i][j][3] - 1) + 1)) continue;
			//cout << "PR2" << "\n";
			//gore
			if(bg[i][j][2] < h3[bg[i][j][3]].query(bg[i][j][0] + 1, (bg[i][j][1] - 1) + 1)) continue;
			//cout << "PR3" << "\n";
			
			//cout << bg[i][j][3] << " " << h4[bg[i][j][2]].query(1, 0, off, bg[i][j][0] + 1, (bg[i][j][1] - 1) + 1) << "\n";
			//dolje
			if(bg[i][j][3] > h4[bg[i][j][2]].query(bg[i][j][0] + 1, (bg[i][j][1] - 1) + 1)) continue;
			//cout << "PR4" << "\n";
			//cout << "DOBARR " << i << " " << j << "\n";
			//REP(k, 4) cout << bg[i][j][k] << " ";
			//cout << "\n---------------\n";
			
			good.PB(hash);
		}
	}
	if(good.empty()) return 0;
	sort(all(good));
	ll pre = good[0];
	int ret = 1;
	for(auto &x : good) ret += (x != pre), pre = x;
	return ret;
}

/*
10 10
1 1 0 0 1 0 0 1 0 0
0 1 0 0 1 0 0 1 1 0
0 1 0 0 0 0 0 1 1 0
1 0 0 0 1 0 0 0 1 1
1 0 1 1 0 0 1 1 0 1
0 0 1 0 0 0 1 1 0 0
1 0 1 1 1 1 1 1 1 0
1 0 0 0 1 1 1 1 0 0
1 0 0 1 1 0 1 0 1 1
0 0 0 0 0 1 0 1 1 0


*/
/*
void solve(){
	int n, m;
	cin >> n >> m;
	matrix cur;
	vi s;
	s.resize(m);
	REP(i, n){
		for(auto &x : s) cin >> x;
		cur.PB(s);
	}
	cout << count_rectangles(cur);
}



int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int t=1;
	//cin >> t;
	while(t--)solve();
	return 0;
}


*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 3 ms 4820 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 3 ms 4820 KB Output is correct
5 Correct 3 ms 4820 KB Output is correct
6 Correct 3 ms 4820 KB Output is correct
7 Correct 2 ms 3540 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 3 ms 4820 KB Output is correct
10 Correct 3 ms 4820 KB Output is correct
11 Correct 4 ms 4760 KB Output is correct
12 Correct 3 ms 4820 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 1 ms 1236 KB Output is correct
15 Correct 1 ms 1748 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 4 ms 4820 KB Output is correct
20 Correct 3 ms 3668 KB Output is correct
21 Correct 1 ms 1236 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 3 ms 4820 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 3 ms 4820 KB Output is correct
5 Correct 3 ms 4820 KB Output is correct
6 Correct 3 ms 4820 KB Output is correct
7 Correct 2 ms 3540 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 3 ms 4820 KB Output is correct
10 Correct 3 ms 4820 KB Output is correct
11 Correct 4 ms 4760 KB Output is correct
12 Correct 3 ms 4820 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 1 ms 1236 KB Output is correct
15 Correct 1 ms 1748 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 0 ms 468 KB Output is correct
18 Correct 1 ms 724 KB Output is correct
19 Correct 4 ms 4820 KB Output is correct
20 Correct 3 ms 3668 KB Output is correct
21 Correct 1 ms 1236 KB Output is correct
22 Correct 9 ms 12752 KB Output is correct
23 Correct 13 ms 12748 KB Output is correct
24 Correct 9 ms 12740 KB Output is correct
25 Correct 9 ms 12548 KB Output is correct
26 Correct 9 ms 12500 KB Output is correct
27 Correct 9 ms 12508 KB Output is correct
28 Correct 9 ms 12628 KB Output is correct
29 Correct 6 ms 9556 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 3 ms 4820 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 3 ms 4820 KB Output is correct
5 Correct 3 ms 4820 KB Output is correct
6 Correct 3 ms 4820 KB Output is correct
7 Correct 2 ms 3540 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 3 ms 4820 KB Output is correct
10 Correct 3 ms 4820 KB Output is correct
11 Correct 4 ms 4760 KB Output is correct
12 Correct 3 ms 4820 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 1 ms 1236 KB Output is correct
15 Correct 1 ms 1748 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 9 ms 12752 KB Output is correct
18 Correct 13 ms 12748 KB Output is correct
19 Correct 9 ms 12740 KB Output is correct
20 Correct 9 ms 12548 KB Output is correct
21 Correct 9 ms 12500 KB Output is correct
22 Correct 9 ms 12508 KB Output is correct
23 Correct 9 ms 12628 KB Output is correct
24 Correct 6 ms 9556 KB Output is correct
25 Correct 0 ms 468 KB Output is correct
26 Correct 1 ms 724 KB Output is correct
27 Correct 4 ms 4820 KB Output is correct
28 Correct 3 ms 3668 KB Output is correct
29 Correct 1 ms 1236 KB Output is correct
30 Correct 27 ms 31832 KB Output is correct
31 Correct 28 ms 31820 KB Output is correct
32 Correct 26 ms 31824 KB Output is correct
33 Correct 22 ms 31340 KB Output is correct
34 Correct 25 ms 31480 KB Output is correct
35 Correct 25 ms 31504 KB Output is correct
36 Correct 25 ms 31444 KB Output is correct
37 Correct 25 ms 31192 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 3 ms 4820 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 3 ms 4820 KB Output is correct
5 Correct 3 ms 4820 KB Output is correct
6 Correct 3 ms 4820 KB Output is correct
7 Correct 2 ms 3540 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 3 ms 4820 KB Output is correct
10 Correct 3 ms 4820 KB Output is correct
11 Correct 4 ms 4760 KB Output is correct
12 Correct 3 ms 4820 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 1 ms 1236 KB Output is correct
15 Correct 1 ms 1748 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 9 ms 12752 KB Output is correct
18 Correct 13 ms 12748 KB Output is correct
19 Correct 9 ms 12740 KB Output is correct
20 Correct 9 ms 12548 KB Output is correct
21 Correct 9 ms 12500 KB Output is correct
22 Correct 9 ms 12508 KB Output is correct
23 Correct 9 ms 12628 KB Output is correct
24 Correct 6 ms 9556 KB Output is correct
25 Correct 27 ms 31832 KB Output is correct
26 Correct 28 ms 31820 KB Output is correct
27 Correct 26 ms 31824 KB Output is correct
28 Correct 22 ms 31340 KB Output is correct
29 Correct 25 ms 31480 KB Output is correct
30 Correct 25 ms 31504 KB Output is correct
31 Correct 25 ms 31444 KB Output is correct
32 Correct 25 ms 31192 KB Output is correct
33 Correct 0 ms 468 KB Output is correct
34 Correct 1 ms 724 KB Output is correct
35 Correct 4 ms 4820 KB Output is correct
36 Correct 3 ms 3668 KB Output is correct
37 Correct 1 ms 1236 KB Output is correct
38 Correct 108 ms 123524 KB Output is correct
39 Correct 112 ms 123508 KB Output is correct
40 Correct 108 ms 123584 KB Output is correct
41 Correct 105 ms 123632 KB Output is correct
42 Correct 193 ms 127820 KB Output is correct
43 Correct 195 ms 127676 KB Output is correct
44 Correct 199 ms 127784 KB Output is correct
45 Correct 186 ms 123120 KB Output is correct
46 Correct 108 ms 123912 KB Output is correct
47 Correct 115 ms 124240 KB Output is correct
48 Correct 138 ms 125780 KB Output is correct
49 Correct 153 ms 125692 KB Output is correct
50 Correct 92 ms 89160 KB Output is correct
51 Correct 87 ms 87724 KB Output is correct
52 Correct 157 ms 125700 KB Output is correct
53 Correct 155 ms 125728 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 181464 KB Output is correct
2 Correct 99 ms 154168 KB Output is correct
3 Correct 110 ms 181448 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 113 ms 181412 KB Output is correct
6 Correct 115 ms 181404 KB Output is correct
7 Correct 110 ms 181344 KB Output is correct
8 Correct 114 ms 181464 KB Output is correct
9 Correct 112 ms 181404 KB Output is correct
10 Correct 111 ms 181068 KB Output is correct
11 Correct 117 ms 181288 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 724 KB Output is correct
3 Correct 4 ms 4820 KB Output is correct
4 Correct 3 ms 3668 KB Output is correct
5 Correct 1 ms 1236 KB Output is correct
6 Correct 1 ms 1748 KB Output is correct
7 Correct 512 ms 374408 KB Output is correct
8 Correct 1025 ms 608384 KB Output is correct
9 Correct 1002 ms 610380 KB Output is correct
10 Correct 957 ms 610664 KB Output is correct
11 Correct 431 ms 390484 KB Output is correct
12 Correct 752 ms 585932 KB Output is correct
13 Correct 804 ms 606244 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1108 KB Output is correct
2 Correct 3 ms 4820 KB Output is correct
3 Correct 3 ms 4716 KB Output is correct
4 Correct 3 ms 4820 KB Output is correct
5 Correct 3 ms 4820 KB Output is correct
6 Correct 3 ms 4820 KB Output is correct
7 Correct 2 ms 3540 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 3 ms 4820 KB Output is correct
10 Correct 3 ms 4820 KB Output is correct
11 Correct 4 ms 4760 KB Output is correct
12 Correct 3 ms 4820 KB Output is correct
13 Correct 0 ms 468 KB Output is correct
14 Correct 1 ms 1236 KB Output is correct
15 Correct 1 ms 1748 KB Output is correct
16 Correct 1 ms 724 KB Output is correct
17 Correct 9 ms 12752 KB Output is correct
18 Correct 13 ms 12748 KB Output is correct
19 Correct 9 ms 12740 KB Output is correct
20 Correct 9 ms 12548 KB Output is correct
21 Correct 9 ms 12500 KB Output is correct
22 Correct 9 ms 12508 KB Output is correct
23 Correct 9 ms 12628 KB Output is correct
24 Correct 6 ms 9556 KB Output is correct
25 Correct 27 ms 31832 KB Output is correct
26 Correct 28 ms 31820 KB Output is correct
27 Correct 26 ms 31824 KB Output is correct
28 Correct 22 ms 31340 KB Output is correct
29 Correct 25 ms 31480 KB Output is correct
30 Correct 25 ms 31504 KB Output is correct
31 Correct 25 ms 31444 KB Output is correct
32 Correct 25 ms 31192 KB Output is correct
33 Correct 108 ms 123524 KB Output is correct
34 Correct 112 ms 123508 KB Output is correct
35 Correct 108 ms 123584 KB Output is correct
36 Correct 105 ms 123632 KB Output is correct
37 Correct 193 ms 127820 KB Output is correct
38 Correct 195 ms 127676 KB Output is correct
39 Correct 199 ms 127784 KB Output is correct
40 Correct 186 ms 123120 KB Output is correct
41 Correct 108 ms 123912 KB Output is correct
42 Correct 115 ms 124240 KB Output is correct
43 Correct 138 ms 125780 KB Output is correct
44 Correct 153 ms 125692 KB Output is correct
45 Correct 92 ms 89160 KB Output is correct
46 Correct 87 ms 87724 KB Output is correct
47 Correct 157 ms 125700 KB Output is correct
48 Correct 155 ms 125728 KB Output is correct
49 Correct 112 ms 181464 KB Output is correct
50 Correct 99 ms 154168 KB Output is correct
51 Correct 110 ms 181448 KB Output is correct
52 Correct 1 ms 596 KB Output is correct
53 Correct 113 ms 181412 KB Output is correct
54 Correct 115 ms 181404 KB Output is correct
55 Correct 110 ms 181344 KB Output is correct
56 Correct 114 ms 181464 KB Output is correct
57 Correct 112 ms 181404 KB Output is correct
58 Correct 111 ms 181068 KB Output is correct
59 Correct 117 ms 181288 KB Output is correct
60 Correct 1 ms 1748 KB Output is correct
61 Correct 512 ms 374408 KB Output is correct
62 Correct 1025 ms 608384 KB Output is correct
63 Correct 1002 ms 610380 KB Output is correct
64 Correct 957 ms 610664 KB Output is correct
65 Correct 431 ms 390484 KB Output is correct
66 Correct 752 ms 585932 KB Output is correct
67 Correct 804 ms 606244 KB Output is correct
68 Correct 0 ms 468 KB Output is correct
69 Correct 1 ms 724 KB Output is correct
70 Correct 4 ms 4820 KB Output is correct
71 Correct 3 ms 3668 KB Output is correct
72 Correct 1 ms 1236 KB Output is correct
73 Correct 909 ms 606340 KB Output is correct
74 Correct 914 ms 606244 KB Output is correct
75 Correct 905 ms 606348 KB Output is correct
76 Correct 906 ms 606368 KB Output is correct
77 Correct 2654 ms 672096 KB Output is correct
78 Correct 886 ms 466216 KB Output is correct
79 Correct 942 ms 497988 KB Output is correct
80 Correct 1417 ms 662036 KB Output is correct
81 Correct 953 ms 481280 KB Output is correct
82 Correct 1188 ms 565520 KB Output is correct
83 Correct 1578 ms 662896 KB Output is correct
84 Correct 1020 ms 474108 KB Output is correct
85 Correct 1671 ms 663048 KB Output is correct
86 Correct 1629 ms 650824 KB Output is correct
87 Correct 1735 ms 507560 KB Output is correct
88 Correct 2564 ms 693940 KB Output is correct
89 Correct 2650 ms 695316 KB Output is correct
90 Correct 2664 ms 695328 KB Output is correct