oj.uz

Submission #823542

# Submission time Handle Problem Language Result Execution time Memory
823542 2023-08-12T17:25:49 Z phoenix Rectangles (IOI19_rect) C++17
100 / 100
 2049 ms 625124 KB 
#include<bits/stdc++.h>
#include "rect.h"

using namespace std;
using ll = long long;


struct FenwickTree {
    vector<int> bit;  // binary indexed tree
    int n;
    FenwickTree(int n) {
        this->n = n;
        bit.assign(n, 0);
    }
    FenwickTree(vector<int> const &a) : FenwickTree(a.size()) {
        for (size_t i = 0; i < a.size(); i++)
            add(i, a[i]);
    }
    int sum(int r) {
        int ret = 0;
        for (; r >= 0; r = (r & (r + 1)) - 1)
            ret += bit[r];
        return ret;
    }
    int sum(int l, int r) {
        return sum(r) - sum(l - 1);
    }
    void add(int idx, int delta) {
        for (; idx < n; idx = idx | (idx + 1))
            bit[idx] += delta;
    }
};

// O(nlogn)
vector<pair<int, int>> get_segments(vector<int> a) {
	int n = (int)a.size();
	
	vector<pair<int, int>> res;
	vector<int> st;
	for(int i = 0; i < n; i++) {
		while(!st.empty() && a[st.back()] < a[i]) {
			if(i - st.back() > 1) res.push_back({st.back() + 1, i - 1});
			st.pop_back();
		} 
		if(!st.empty()) {
			if(i - st.back() > 1) res.push_back({st.back() + 1, i - 1});
			if(a[st.back()] == a[i]) st.pop_back();
		}
		st.push_back(i);
	}
	return res;	
}

const int N = 2505;

struct segment {
	int l, d;
};

vector<segment> h[N][N], g[N][N];

ll count_rectangles(vector<vector<int>> a) {
	int n = (int)a.size(), m = (int)a[0].size();
	if(n < 3 || m < 3) return 0;
	for(int i = 0; i < n; i++) {
		vector<pair<int, int>> s = get_segments(a[i]);
		for(auto [l, r] : s) 
			g[i][r].push_back({l, 0});
	}
	for(int i = 0; i < m; i++) {
		vector<int> b;
		for(int j = 0; j < n; j++) 
			b.push_back(a[j][i]);
		vector<pair<int, int>> s = get_segments(b);
		for(auto [l, r] : s) 
			h[r][i].push_back({l, 0});
	}
	for(int i = 0; i < n; i++) {
		int cnt[n] = {};
		bool us[n] = {};
		for(int j = 0; j < m; j++) {
			if(!j) {
				for(auto c : h[i][j]) 
					cnt[c.l]++;
			} else {
				for(auto c : h[i][j])
					us[c.l] = 1;
				for(auto c : h[i][j - 1])
					if(!us[c.l]) cnt[c.l] = 0;
				
				for(auto c : h[i][j]) {
					cnt[c.l]++;
					us[c.l] = 0;
				}
			}
			for(auto &c : h[i][j]) {
				c.d = cnt[c.l];
			}
		}
	}
	for(int i = 0; i < m; i++) {
		int cnt[m] = {};
		bool us[m] = {};
		for(int j = 0; j < n; j++) {
			if(!j) {
				for(auto c : g[j][i]) 
					cnt[c.l]++;
			} else {
				for(auto c : g[j][i]) 
					us[c.l] = 1;
				for(auto c : g[j - 1][i]) 
					if(!us[c.l]) 
						cnt[c.l] = 0;
				for(auto c : g[j][i]) {
					cnt[c.l]++;
					us[c.l] = 0;
				}
			}
			for(auto &c : g[j][i])
				c.d = cnt[c.l];
		}
	}
	ll ans = 0;
	FenwickTree st(n);
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < m; j++) {
			sort(g[i][j].begin(), g[i][j].end(), [](segment x, segment y) {return x.l < y.l;});
			sort(h[i][j].begin(), h[i][j].end(), [](segment x, segment y) {return x.d > y.d;});
			int h_l = 0;
			for(segment cur : g[i][j]) {
				while(h_l < (int)h[i][j].size() && j - h[i][j][h_l].d < cur.l) {
					st.add(h[i][j][h_l++].l, +1);
				} 
				ans += st.sum(i - cur.d + 1, i);
			}
			while(h_l > 0) 
				st.add(h[i][j][--h_l].l, -1);
		}
	}
	return ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 294992 KB Output is correct
2 Correct 121 ms 294960 KB Output is correct
3 Correct 120 ms 294916 KB Output is correct
4 Correct 121 ms 294988 KB Output is correct
5 Correct 127 ms 294968 KB Output is correct
6 Correct 122 ms 294988 KB Output is correct
7 Correct 124 ms 294896 KB Output is correct
8 Correct 121 ms 294976 KB Output is correct
9 Correct 128 ms 294916 KB Output is correct
10 Correct 121 ms 294956 KB Output is correct
11 Correct 123 ms 294984 KB Output is correct
12 Correct 125 ms 294988 KB Output is correct
13 Correct 123 ms 294904 KB Output is correct
14 Correct 124 ms 294952 KB Output is correct
15 Correct 121 ms 294944 KB Output is correct
16 Correct 122 ms 294988 KB Output is correct
17 Correct 123 ms 294876 KB Output is correct
18 Correct 122 ms 294908 KB Output is correct
19 Correct 121 ms 294992 KB Output is correct
20 Correct 122 ms 294936 KB Output is correct
21 Correct 122 ms 294980 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 294992 KB Output is correct
2 Correct 121 ms 294960 KB Output is correct
3 Correct 120 ms 294916 KB Output is correct
4 Correct 121 ms 294988 KB Output is correct
5 Correct 127 ms 294968 KB Output is correct
6 Correct 122 ms 294988 KB Output is correct
7 Correct 124 ms 294896 KB Output is correct
8 Correct 121 ms 294976 KB Output is correct
9 Correct 128 ms 294916 KB Output is correct
10 Correct 121 ms 294956 KB Output is correct
11 Correct 123 ms 294984 KB Output is correct
12 Correct 125 ms 294988 KB Output is correct
13 Correct 123 ms 294904 KB Output is correct
14 Correct 124 ms 294952 KB Output is correct
15 Correct 121 ms 294944 KB Output is correct
16 Correct 122 ms 294988 KB Output is correct
17 Correct 123 ms 294876 KB Output is correct
18 Correct 122 ms 294908 KB Output is correct
19 Correct 121 ms 294992 KB Output is correct
20 Correct 122 ms 294936 KB Output is correct
21 Correct 122 ms 294980 KB Output is correct
22 Correct 120 ms 295116 KB Output is correct
23 Correct 129 ms 295108 KB Output is correct
24 Correct 121 ms 295112 KB Output is correct
25 Correct 122 ms 295136 KB Output is correct
26 Correct 123 ms 295156 KB Output is correct
27 Correct 123 ms 295228 KB Output is correct
28 Correct 123 ms 295168 KB Output is correct
29 Correct 123 ms 295040 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 294992 KB Output is correct
2 Correct 121 ms 294960 KB Output is correct
3 Correct 120 ms 294916 KB Output is correct
4 Correct 121 ms 294988 KB Output is correct
5 Correct 127 ms 294968 KB Output is correct
6 Correct 122 ms 294988 KB Output is correct
7 Correct 124 ms 294896 KB Output is correct
8 Correct 121 ms 294976 KB Output is correct
9 Correct 128 ms 294916 KB Output is correct
10 Correct 121 ms 294956 KB Output is correct
11 Correct 123 ms 294984 KB Output is correct
12 Correct 125 ms 294988 KB Output is correct
13 Correct 123 ms 294904 KB Output is correct
14 Correct 124 ms 294952 KB Output is correct
15 Correct 121 ms 294944 KB Output is correct
16 Correct 122 ms 294988 KB Output is correct
17 Correct 120 ms 295116 KB Output is correct
18 Correct 129 ms 295108 KB Output is correct
19 Correct 121 ms 295112 KB Output is correct
20 Correct 122 ms 295136 KB Output is correct
21 Correct 123 ms 295156 KB Output is correct
22 Correct 123 ms 295228 KB Output is correct
23 Correct 123 ms 295168 KB Output is correct
24 Correct 123 ms 295040 KB Output is correct
25 Correct 123 ms 294876 KB Output is correct
26 Correct 122 ms 294908 KB Output is correct
27 Correct 121 ms 294992 KB Output is correct
28 Correct 122 ms 294936 KB Output is correct
29 Correct 122 ms 294980 KB Output is correct
30 Correct 125 ms 296144 KB Output is correct
31 Correct 124 ms 296012 KB Output is correct
32 Correct 129 ms 296032 KB Output is correct
33 Correct 128 ms 296196 KB Output is correct
34 Correct 131 ms 296652 KB Output is correct
35 Correct 133 ms 296712 KB Output is correct
36 Correct 133 ms 296652 KB Output is correct
37 Correct 133 ms 296636 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 294992 KB Output is correct
2 Correct 121 ms 294960 KB Output is correct
3 Correct 120 ms 294916 KB Output is correct
4 Correct 121 ms 294988 KB Output is correct
5 Correct 127 ms 294968 KB Output is correct
6 Correct 122 ms 294988 KB Output is correct
7 Correct 124 ms 294896 KB Output is correct
8 Correct 121 ms 294976 KB Output is correct
9 Correct 128 ms 294916 KB Output is correct
10 Correct 121 ms 294956 KB Output is correct
11 Correct 123 ms 294984 KB Output is correct
12 Correct 125 ms 294988 KB Output is correct
13 Correct 123 ms 294904 KB Output is correct
14 Correct 124 ms 294952 KB Output is correct
15 Correct 121 ms 294944 KB Output is correct
16 Correct 122 ms 294988 KB Output is correct
17 Correct 120 ms 295116 KB Output is correct
18 Correct 129 ms 295108 KB Output is correct
19 Correct 121 ms 295112 KB Output is correct
20 Correct 122 ms 295136 KB Output is correct
21 Correct 123 ms 295156 KB Output is correct
22 Correct 123 ms 295228 KB Output is correct
23 Correct 123 ms 295168 KB Output is correct
24 Correct 123 ms 295040 KB Output is correct
25 Correct 125 ms 296144 KB Output is correct
26 Correct 124 ms 296012 KB Output is correct
27 Correct 129 ms 296032 KB Output is correct
28 Correct 128 ms 296196 KB Output is correct
29 Correct 131 ms 296652 KB Output is correct
30 Correct 133 ms 296712 KB Output is correct
31 Correct 133 ms 296652 KB Output is correct
32 Correct 133 ms 296636 KB Output is correct
33 Correct 123 ms 294876 KB Output is correct
34 Correct 122 ms 294908 KB Output is correct
35 Correct 121 ms 294992 KB Output is correct
36 Correct 122 ms 294936 KB Output is correct
37 Correct 122 ms 294980 KB Output is correct
38 Correct 165 ms 304668 KB Output is correct
39 Correct 171 ms 309412 KB Output is correct
40 Correct 168 ms 309352 KB Output is correct
41 Correct 184 ms 314200 KB Output is correct
42 Correct 182 ms 310044 KB Output is correct
43 Correct 181 ms 310120 KB Output is correct
44 Correct 178 ms 310044 KB Output is correct
45 Correct 176 ms 309512 KB Output is correct
46 Correct 173 ms 306552 KB Output is correct
47 Correct 188 ms 309068 KB Output is correct
48 Correct 249 ms 316804 KB Output is correct
49 Correct 256 ms 317008 KB Output is correct
50 Correct 190 ms 305988 KB Output is correct
51 Correct 188 ms 305920 KB Output is correct
52 Correct 241 ms 315520 KB Output is correct
53 Correct 264 ms 315572 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 124 ms 295320 KB Output is correct
2 Correct 124 ms 295116 KB Output is correct
3 Correct 126 ms 295068 KB Output is correct
4 Correct 122 ms 294904 KB Output is correct
5 Correct 123 ms 295172 KB Output is correct
6 Correct 124 ms 295232 KB Output is correct
7 Correct 127 ms 295116 KB Output is correct
8 Correct 129 ms 295332 KB Output is correct
9 Correct 124 ms 295184 KB Output is correct
10 Correct 125 ms 294944 KB Output is correct
11 Correct 122 ms 294988 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 123 ms 294876 KB Output is correct
2 Correct 122 ms 294908 KB Output is correct
3 Correct 121 ms 294992 KB Output is correct
4 Correct 122 ms 294936 KB Output is correct
5 Correct 122 ms 294980 KB Output is correct
6 Correct 123 ms 295044 KB Output is correct
7 Correct 465 ms 362376 KB Output is correct
8 Correct 969 ms 441176 KB Output is correct
9 Correct 978 ms 441816 KB Output is correct
10 Correct 973 ms 441912 KB Output is correct
11 Correct 216 ms 319248 KB Output is correct
12 Correct 349 ms 341116 KB Output is correct
13 Correct 359 ms 344168 KB Output is correct

Subtask #7
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 294992 KB Output is correct
2 Correct 121 ms 294960 KB Output is correct
3 Correct 120 ms 294916 KB Output is correct
4 Correct 121 ms 294988 KB Output is correct
5 Correct 127 ms 294968 KB Output is correct
6 Correct 122 ms 294988 KB Output is correct
7 Correct 124 ms 294896 KB Output is correct
8 Correct 121 ms 294976 KB Output is correct
9 Correct 128 ms 294916 KB Output is correct
10 Correct 121 ms 294956 KB Output is correct
11 Correct 123 ms 294984 KB Output is correct
12 Correct 125 ms 294988 KB Output is correct
13 Correct 123 ms 294904 KB Output is correct
14 Correct 124 ms 294952 KB Output is correct
15 Correct 121 ms 294944 KB Output is correct
16 Correct 122 ms 294988 KB Output is correct
17 Correct 120 ms 295116 KB Output is correct
18 Correct 129 ms 295108 KB Output is correct
19 Correct 121 ms 295112 KB Output is correct
20 Correct 122 ms 295136 KB Output is correct
21 Correct 123 ms 295156 KB Output is correct
22 Correct 123 ms 295228 KB Output is correct
23 Correct 123 ms 295168 KB Output is correct
24 Correct 123 ms 295040 KB Output is correct
25 Correct 125 ms 296144 KB Output is correct
26 Correct 124 ms 296012 KB Output is correct
27 Correct 129 ms 296032 KB Output is correct
28 Correct 128 ms 296196 KB Output is correct
29 Correct 131 ms 296652 KB Output is correct
30 Correct 133 ms 296712 KB Output is correct
31 Correct 133 ms 296652 KB Output is correct
32 Correct 133 ms 296636 KB Output is correct
33 Correct 165 ms 304668 KB Output is correct
34 Correct 171 ms 309412 KB Output is correct
35 Correct 168 ms 309352 KB Output is correct
36 Correct 184 ms 314200 KB Output is correct
37 Correct 182 ms 310044 KB Output is correct
38 Correct 181 ms 310120 KB Output is correct
39 Correct 178 ms 310044 KB Output is correct
40 Correct 176 ms 309512 KB Output is correct
41 Correct 173 ms 306552 KB Output is correct
42 Correct 188 ms 309068 KB Output is correct
43 Correct 249 ms 316804 KB Output is correct
44 Correct 256 ms 317008 KB Output is correct
45 Correct 190 ms 305988 KB Output is correct
46 Correct 188 ms 305920 KB Output is correct
47 Correct 241 ms 315520 KB Output is correct
48 Correct 264 ms 315572 KB Output is correct
49 Correct 124 ms 295320 KB Output is correct
50 Correct 124 ms 295116 KB Output is correct
51 Correct 126 ms 295068 KB Output is correct
52 Correct 122 ms 294904 KB Output is correct
53 Correct 123 ms 295172 KB Output is correct
54 Correct 124 ms 295232 KB Output is correct
55 Correct 127 ms 295116 KB Output is correct
56 Correct 129 ms 295332 KB Output is correct
57 Correct 124 ms 295184 KB Output is correct
58 Correct 125 ms 294944 KB Output is correct
59 Correct 122 ms 294988 KB Output is correct
60 Correct 123 ms 295044 KB Output is correct
61 Correct 465 ms 362376 KB Output is correct
62 Correct 969 ms 441176 KB Output is correct
63 Correct 978 ms 441816 KB Output is correct
64 Correct 973 ms 441912 KB Output is correct
65 Correct 216 ms 319248 KB Output is correct
66 Correct 349 ms 341116 KB Output is correct
67 Correct 359 ms 344168 KB Output is correct
68 Correct 123 ms 294876 KB Output is correct
69 Correct 122 ms 294908 KB Output is correct
70 Correct 121 ms 294992 KB Output is correct
71 Correct 122 ms 294936 KB Output is correct
72 Correct 122 ms 294980 KB Output is correct
73 Correct 748 ms 407716 KB Output is correct
74 Correct 897 ms 472536 KB Output is correct
75 Correct 980 ms 473672 KB Output is correct
76 Correct 1148 ms 539732 KB Output is correct
77 Correct 908 ms 461900 KB Output is correct
78 Correct 1164 ms 462936 KB Output is correct
79 Correct 1264 ms 472976 KB Output is correct
80 Correct 2009 ms 575036 KB Output is correct
81 Correct 1218 ms 492976 KB Output is correct
82 Correct 1643 ms 559012 KB Output is correct
83 Correct 2049 ms 625124 KB Output is correct
84 Correct 1145 ms 474940 KB Output is correct
85 Correct 1918 ms 608880 KB Output is correct
86 Correct 1898 ms 599452 KB Output is correct
87 Correct 595 ms 428088 KB Output is correct
88 Correct 931 ms 509884 KB Output is correct
89 Correct 944 ms 509800 KB Output is correct
90 Correct 987 ms 509852 KB Output is correct