oj.uz

Submission #824750

# Submission time Handle Problem Language Result Execution time Memory
824750 2023-08-14T09:32:08 Z tomruk Rectangles (IOI19_rect) C++17
100 / 100
 2317 ms 805412 KB 
#include "rect.h"
#include <bits/stdc++.h>
#define N 2505
using namespace std;
struct BIT2D{
	vector<vector<int>> bit;
	int n;
	BIT2D(){
		n = N;
		bit.assign(N,vector<int>(N,0));
	}
	void upd(int x,int y,int val){
		for(;x < n;x += x & -x){
			for(int tmp = y;tmp < n;tmp += tmp & -tmp){
				bit[x][tmp] += val;
			}
		}
	}
	int get(int x,int y){
		int ret = 0;
		for(;x > 0;x -= x & -x){
			for(int tmp = y;tmp > 0;tmp -= tmp & -tmp){
				ret += bit[x][tmp];
			}
		}
		return ret;
	}
};
vector<pair<int,int>> dwn[N][N];
vector<pair<int,int>> rght[N][N];
long long count_rectangles(vector<vector<int>> a){
	long long ans = 0;
	int n = a.size();
	int m = a[0].size();
	for(int i = m-1;i>=0;i--){
		vector<int> nxt(n + 5,n);
		stack<int> st;
		st.push(n-1);
		for(int j = n-2;j>=0;j--){
			while(st.size() && a[st.top()][i] <= a[j][i])
				st.pop();
			if(st.size())
				nxt[j] = st.top();
			st.push(j);
			if(a[j][i] <= a[j+1][i])
				continue;
			for(int c = nxt[j + 1];c < n;c = nxt[c]){
				auto x = lower_bound(rght[j][i+1].begin(),rght[j][i+1].end(),make_pair(c,0));
				rght[j][i].push_back({c,1});
				if(x != rght[j][i+1].end() && x->first == c){
					rght[j][i].back().second += x->second;
				}
				if(a[j][i] <= a[c][i])
					break;
			}
		}
	}
	int cnt = 0;
	BIT2D t;
	for(int i = n-1;i>0;i--){
		vector<int> nxt(m + 5,m);
		stack<int> st;
		st.push(m-1);
		for(int j = m-2;j>=0;j--){
			while(st.size() && a[i][st.top()] <= a[i][j])
				st.pop();
			if(st.size())
				nxt[j] = st.top();
			st.push(j);
			if(a[i][j] <= a[i][j+1])
				continue;
			// cout << "HEY" << ' ' << i << ' ' << j << endl;
			// cout << "ASDASD" << ans << endl;
			for(auto u:rght[i-1][j+1]){
				t.upd(u.first + 1,m-(u.second + j + 1) + 1,1);
				// cout << u.first + 1 << ' ' << m-(u.second + j + 1) + 1 << endl;
			}
			// cout << "HEY" << ' ' << i << ' ' << j << endl;
			for(int c = nxt[j + 1];c < m;c = nxt[c]){
				auto x = lower_bound(dwn[i+1][j].begin(),dwn[i+1][j].end(),make_pair(c,0));
				dwn[i][j].push_back({c,1});
				if(x != dwn[i+1][j].end() && x->first == c){
					dwn[i][j].back().second += x->second;
				}
				// cout << i + dwn[i][j].back().second + 1 << endl;
				// cout << c << endl;
				ans += t.get(i + dwn[i][j].back().second + 1,m - c + 1);
				// cout << i + dwn[i][j].back().second + 1 << ' ' <<  m - c + 1 << endl;
				// for(int d = i + 1;d <= i + dwn[i][j][c];d++){
				// 	ans += (j + 1 + rght[i-1][j+1][d]) >= c; 
				// }
				if(a[i][j] <= a[i][c])
					break;
			}
			for(auto u:rght[i-1][j+1]){
				t.upd(u.first + 1,m-(u.second + j + 1) + 1,-1);
			}
			// cout << "ASDASD" << ans << endl;	
		}
	}
	assert(cnt <= n * m);
	return ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 319688 KB Output is correct
2 Correct 132 ms 319672 KB Output is correct
3 Correct 132 ms 319604 KB Output is correct
4 Correct 129 ms 319644 KB Output is correct
5 Correct 130 ms 319592 KB Output is correct
6 Correct 130 ms 319672 KB Output is correct
7 Correct 133 ms 319628 KB Output is correct
8 Correct 129 ms 319568 KB Output is correct
9 Correct 130 ms 319564 KB Output is correct
10 Correct 133 ms 319580 KB Output is correct
11 Correct 131 ms 319560 KB Output is correct
12 Correct 134 ms 319660 KB Output is correct
13 Correct 131 ms 319636 KB Output is correct
14 Correct 134 ms 319640 KB Output is correct
15 Correct 132 ms 319548 KB Output is correct
16 Correct 131 ms 319584 KB Output is correct
17 Correct 131 ms 319588 KB Output is correct
18 Correct 133 ms 319588 KB Output is correct
19 Correct 132 ms 319556 KB Output is correct
20 Correct 131 ms 319552 KB Output is correct
21 Correct 131 ms 319536 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 319688 KB Output is correct
2 Correct 132 ms 319672 KB Output is correct
3 Correct 132 ms 319604 KB Output is correct
4 Correct 129 ms 319644 KB Output is correct
5 Correct 130 ms 319592 KB Output is correct
6 Correct 130 ms 319672 KB Output is correct
7 Correct 133 ms 319628 KB Output is correct
8 Correct 129 ms 319568 KB Output is correct
9 Correct 130 ms 319564 KB Output is correct
10 Correct 133 ms 319580 KB Output is correct
11 Correct 131 ms 319560 KB Output is correct
12 Correct 134 ms 319660 KB Output is correct
13 Correct 131 ms 319636 KB Output is correct
14 Correct 134 ms 319640 KB Output is correct
15 Correct 132 ms 319548 KB Output is correct
16 Correct 131 ms 319584 KB Output is correct
17 Correct 131 ms 319588 KB Output is correct
18 Correct 133 ms 319588 KB Output is correct
19 Correct 132 ms 319556 KB Output is correct
20 Correct 131 ms 319552 KB Output is correct
21 Correct 131 ms 319536 KB Output is correct
22 Correct 133 ms 320076 KB Output is correct
23 Correct 134 ms 319976 KB Output is correct
24 Correct 147 ms 320060 KB Output is correct
25 Correct 139 ms 319820 KB Output is correct
26 Correct 135 ms 319888 KB Output is correct
27 Correct 145 ms 319824 KB Output is correct
28 Correct 137 ms 319824 KB Output is correct
29 Correct 131 ms 319652 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 319688 KB Output is correct
2 Correct 132 ms 319672 KB Output is correct
3 Correct 132 ms 319604 KB Output is correct
4 Correct 129 ms 319644 KB Output is correct
5 Correct 130 ms 319592 KB Output is correct
6 Correct 130 ms 319672 KB Output is correct
7 Correct 133 ms 319628 KB Output is correct
8 Correct 129 ms 319568 KB Output is correct
9 Correct 130 ms 319564 KB Output is correct
10 Correct 133 ms 319580 KB Output is correct
11 Correct 131 ms 319560 KB Output is correct
12 Correct 134 ms 319660 KB Output is correct
13 Correct 131 ms 319636 KB Output is correct
14 Correct 134 ms 319640 KB Output is correct
15 Correct 132 ms 319548 KB Output is correct
16 Correct 131 ms 319584 KB Output is correct
17 Correct 133 ms 320076 KB Output is correct
18 Correct 134 ms 319976 KB Output is correct
19 Correct 147 ms 320060 KB Output is correct
20 Correct 139 ms 319820 KB Output is correct
21 Correct 135 ms 319888 KB Output is correct
22 Correct 145 ms 319824 KB Output is correct
23 Correct 137 ms 319824 KB Output is correct
24 Correct 131 ms 319652 KB Output is correct
25 Correct 131 ms 319588 KB Output is correct
26 Correct 133 ms 319588 KB Output is correct
27 Correct 132 ms 319556 KB Output is correct
28 Correct 131 ms 319552 KB Output is correct
29 Correct 131 ms 319536 KB Output is correct
30 Correct 151 ms 322424 KB Output is correct
31 Correct 141 ms 322364 KB Output is correct
32 Correct 149 ms 322324 KB Output is correct
33 Correct 144 ms 320732 KB Output is correct
34 Correct 143 ms 321284 KB Output is correct
35 Correct 145 ms 321364 KB Output is correct
36 Correct 145 ms 321272 KB Output is correct
37 Correct 154 ms 321200 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 319688 KB Output is correct
2 Correct 132 ms 319672 KB Output is correct
3 Correct 132 ms 319604 KB Output is correct
4 Correct 129 ms 319644 KB Output is correct
5 Correct 130 ms 319592 KB Output is correct
6 Correct 130 ms 319672 KB Output is correct
7 Correct 133 ms 319628 KB Output is correct
8 Correct 129 ms 319568 KB Output is correct
9 Correct 130 ms 319564 KB Output is correct
10 Correct 133 ms 319580 KB Output is correct
11 Correct 131 ms 319560 KB Output is correct
12 Correct 134 ms 319660 KB Output is correct
13 Correct 131 ms 319636 KB Output is correct
14 Correct 134 ms 319640 KB Output is correct
15 Correct 132 ms 319548 KB Output is correct
16 Correct 131 ms 319584 KB Output is correct
17 Correct 133 ms 320076 KB Output is correct
18 Correct 134 ms 319976 KB Output is correct
19 Correct 147 ms 320060 KB Output is correct
20 Correct 139 ms 319820 KB Output is correct
21 Correct 135 ms 319888 KB Output is correct
22 Correct 145 ms 319824 KB Output is correct
23 Correct 137 ms 319824 KB Output is correct
24 Correct 131 ms 319652 KB Output is correct
25 Correct 151 ms 322424 KB Output is correct
26 Correct 141 ms 322364 KB Output is correct
27 Correct 149 ms 322324 KB Output is correct
28 Correct 144 ms 320732 KB Output is correct
29 Correct 143 ms 321284 KB Output is correct
30 Correct 145 ms 321364 KB Output is correct
31 Correct 145 ms 321272 KB Output is correct
32 Correct 154 ms 321200 KB Output is correct
33 Correct 131 ms 319588 KB Output is correct
34 Correct 133 ms 319588 KB Output is correct
35 Correct 132 ms 319556 KB Output is correct
36 Correct 131 ms 319552 KB Output is correct
37 Correct 131 ms 319536 KB Output is correct
38 Correct 195 ms 338800 KB Output is correct
39 Correct 224 ms 333936 KB Output is correct
40 Correct 198 ms 333988 KB Output is correct
41 Correct 207 ms 329284 KB Output is correct
42 Correct 278 ms 355296 KB Output is correct
43 Correct 281 ms 355296 KB Output is correct
44 Correct 274 ms 355408 KB Output is correct
45 Correct 284 ms 353176 KB Output is correct
46 Correct 182 ms 332020 KB Output is correct
47 Correct 201 ms 334600 KB Output is correct
48 Correct 281 ms 342800 KB Output is correct
49 Correct 303 ms 342984 KB Output is correct
50 Correct 214 ms 331904 KB Output is correct
51 Correct 210 ms 331884 KB Output is correct
52 Correct 281 ms 341420 KB Output is correct
53 Correct 283 ms 341532 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 135 ms 319864 KB Output is correct
2 Correct 138 ms 319868 KB Output is correct
3 Correct 133 ms 319656 KB Output is correct
4 Correct 137 ms 319584 KB Output is correct
5 Correct 132 ms 319788 KB Output is correct
6 Correct 135 ms 319908 KB Output is correct
7 Correct 135 ms 319824 KB Output is correct
8 Correct 134 ms 319768 KB Output is correct
9 Correct 134 ms 319776 KB Output is correct
10 Correct 135 ms 319624 KB Output is correct
11 Correct 132 ms 319656 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 319588 KB Output is correct
2 Correct 133 ms 319588 KB Output is correct
3 Correct 132 ms 319556 KB Output is correct
4 Correct 131 ms 319552 KB Output is correct
5 Correct 131 ms 319536 KB Output is correct
6 Correct 131 ms 319528 KB Output is correct
7 Correct 603 ms 386856 KB Output is correct
8 Correct 911 ms 465652 KB Output is correct
9 Correct 909 ms 466336 KB Output is correct
10 Correct 911 ms 466452 KB Output is correct
11 Correct 215 ms 343828 KB Output is correct
12 Correct 326 ms 365652 KB Output is correct
13 Correct 321 ms 368680 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 143 ms 319688 KB Output is correct
2 Correct 132 ms 319672 KB Output is correct
3 Correct 132 ms 319604 KB Output is correct
4 Correct 129 ms 319644 KB Output is correct
5 Correct 130 ms 319592 KB Output is correct
6 Correct 130 ms 319672 KB Output is correct
7 Correct 133 ms 319628 KB Output is correct
8 Correct 129 ms 319568 KB Output is correct
9 Correct 130 ms 319564 KB Output is correct
10 Correct 133 ms 319580 KB Output is correct
11 Correct 131 ms 319560 KB Output is correct
12 Correct 134 ms 319660 KB Output is correct
13 Correct 131 ms 319636 KB Output is correct
14 Correct 134 ms 319640 KB Output is correct
15 Correct 132 ms 319548 KB Output is correct
16 Correct 131 ms 319584 KB Output is correct
17 Correct 133 ms 320076 KB Output is correct
18 Correct 134 ms 319976 KB Output is correct
19 Correct 147 ms 320060 KB Output is correct
20 Correct 139 ms 319820 KB Output is correct
21 Correct 135 ms 319888 KB Output is correct
22 Correct 145 ms 319824 KB Output is correct
23 Correct 137 ms 319824 KB Output is correct
24 Correct 131 ms 319652 KB Output is correct
25 Correct 151 ms 322424 KB Output is correct
26 Correct 141 ms 322364 KB Output is correct
27 Correct 149 ms 322324 KB Output is correct
28 Correct 144 ms 320732 KB Output is correct
29 Correct 143 ms 321284 KB Output is correct
30 Correct 145 ms 321364 KB Output is correct
31 Correct 145 ms 321272 KB Output is correct
32 Correct 154 ms 321200 KB Output is correct
33 Correct 195 ms 338800 KB Output is correct
34 Correct 224 ms 333936 KB Output is correct
35 Correct 198 ms 333988 KB Output is correct
36 Correct 207 ms 329284 KB Output is correct
37 Correct 278 ms 355296 KB Output is correct
38 Correct 281 ms 355296 KB Output is correct
39 Correct 274 ms 355408 KB Output is correct
40 Correct 284 ms 353176 KB Output is correct
41 Correct 182 ms 332020 KB Output is correct
42 Correct 201 ms 334600 KB Output is correct
43 Correct 281 ms 342800 KB Output is correct
44 Correct 303 ms 342984 KB Output is correct
45 Correct 214 ms 331904 KB Output is correct
46 Correct 210 ms 331884 KB Output is correct
47 Correct 281 ms 341420 KB Output is correct
48 Correct 283 ms 341532 KB Output is correct
49 Correct 135 ms 319864 KB Output is correct
50 Correct 138 ms 319868 KB Output is correct
51 Correct 133 ms 319656 KB Output is correct
52 Correct 137 ms 319584 KB Output is correct
53 Correct 132 ms 319788 KB Output is correct
54 Correct 135 ms 319908 KB Output is correct
55 Correct 135 ms 319824 KB Output is correct
56 Correct 134 ms 319768 KB Output is correct
57 Correct 134 ms 319776 KB Output is correct
58 Correct 135 ms 319624 KB Output is correct
59 Correct 132 ms 319656 KB Output is correct
60 Correct 131 ms 319528 KB Output is correct
61 Correct 603 ms 386856 KB Output is correct
62 Correct 911 ms 465652 KB Output is correct
63 Correct 909 ms 466336 KB Output is correct
64 Correct 911 ms 466452 KB Output is correct
65 Correct 215 ms 343828 KB Output is correct
66 Correct 326 ms 365652 KB Output is correct
67 Correct 321 ms 368680 KB Output is correct
68 Correct 131 ms 319588 KB Output is correct
69 Correct 133 ms 319588 KB Output is correct
70 Correct 132 ms 319556 KB Output is correct
71 Correct 131 ms 319552 KB Output is correct
72 Correct 131 ms 319536 KB Output is correct
73 Correct 976 ms 593352 KB Output is correct
74 Correct 1328 ms 543852 KB Output is correct
75 Correct 1039 ms 543748 KB Output is correct
76 Correct 882 ms 476820 KB Output is correct
77 Correct 2062 ms 805412 KB Output is correct
78 Correct 1358 ms 501048 KB Output is correct
79 Correct 1441 ms 502084 KB Output is correct
80 Correct 2195 ms 603852 KB Output is correct
81 Correct 1440 ms 494164 KB Output is correct
82 Correct 1819 ms 583528 KB Output is correct
83 Correct 2317 ms 627140 KB Output is correct
84 Correct 1346 ms 499356 KB Output is correct
85 Correct 2191 ms 629240 KB Output is correct
86 Correct 2149 ms 623788 KB Output is correct
87 Correct 1154 ms 594348 KB Output is correct
88 Correct 2182 ms 798388 KB Output is correct
89 Correct 1991 ms 804896 KB Output is correct
90 Correct 1987 ms 803984 KB Output is correct