oj.uz

답안 #1047503

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1047503 2024-08-07T13:42:54 Z fuad27 Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 941140 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC optimize("avx2")
const int N = 2510;
int n,m;
vector<pair<int,int>> gdr[N];
vector<pair<int,int>> gdc[N];

struct Side {
	int r1, r2, c1, c2;
};
vector<pair<short,short>> hsides[N][N];
vector<pair<short,short>> vsides[N][N];


int fen[N];
void upd(int at, int add) {
	at++;
	while(at) {
		fen[at]+=add;
		at-=at&(-at);
	}
}
int qry(int at) {
	at++;
	int sum=0;
	while(at<N) {
		sum+=fen[at];
		at+=at&(-at);
	}
	return sum;
}
			

long long count_rectangles(std::vector<std::vector<int> > a) {
	n = a.size();
	m = a[0].size();
	for(int i = 0;i<n;i++) {
		vector<int> stk;
		for(int j = 0;j<m;j++) {
			while(stk.size() and a[i][stk.back()] < a[i][j]){
				stk.pop_back();
			}
			if(stk.size()) {
				gdr[i].push_back({stk.back(), j});
			}
			stk.push_back(j);
		}
		stk.clear();
		for(int j = m-1;j>=0;j--) {
			while(stk.size() and a[i][stk.back()] < a[i][j])stk.pop_back();
			if(stk.size()) {
				if(a[i][j] != a[i][stk.back()])
					gdr[i].push_back({j, stk.back()});
			}
			stk.push_back(j);
		}
		sort(gdr[i].begin(), gdr[i].end());
	}
	for(int i = 0;i<m;i++) {
		vector<int> stk;
		for(int j = 0;j<n;j++) {
			while(stk.size() and a[stk.back()][i] < a[j][i]){
				stk.pop_back();
			}
			if(stk.size()) {
				gdc[i].push_back({stk.back(), j});
			}
			stk.push_back(j);
		}
		stk.clear();
		for(int j = n-1;j>=0;j--) {
			while(stk.size() and a[stk.back()][i] < a[j][i])stk.pop_back();
			if(stk.size()) {
				gdc[i].push_back({j, stk.back()});
			}
			stk.push_back(j);
		}
		sort(gdc[i].begin(), gdc[i].end());
		gdc[i].erase(unique(gdc[i].begin(), gdc[i].end()), gdc[i].end());
	}
	Side seg;
	for(int i = 0;i<n;i++) {
		for(auto pr:gdr[i]) {

			if(pr.first +1 == pr.second)continue;
			if(i!=n-1 and (*lower_bound(gdr[i+1].begin(), gdr[i+1].end(), pr)) == pr)continue;
			seg.r1 = pr.first;
			seg.r2 = pr.second;
			seg.c2 = i;
			for(int j = i;j>=0;j--){
				auto it = (lower_bound(gdr[j].begin(), gdr[j].end(), pr));
				if(it == gdr[j].end())break;
				if((*it)!=pr)break;
				seg.c1=j;
			}
			seg.c1--;
			seg.c2++;
			seg.c1=max(seg.c1, 0);
			seg.c2=min(seg.c2, n-1);
			for(int j = seg.c1;j<=seg.c2;j++) {
				hsides[j][seg.r2].push_back(pair<int,int>(seg.c1, seg.r1));
			}
		}
	}
	for(int i = 0;i<m;i++) {
		for(auto pr:gdc[i]) {
			if(pr.first +1 == pr.second)continue;
			if(i!=m-1 and (*lower_bound(gdc[i+1].begin(), gdc[i+1].end(), pr)) == pr)continue;
			seg.r1 = pr.first;
			seg.r2 = pr.second;
			seg.c2 = i;
			for(int j = i;j>=0;j--){
				auto it = (lower_bound(gdc[j].begin(), gdc[j].end(), pr));
				if(it == gdc[j].end())break;
				if((*it)!=pr)break;
				seg.c1=j;
			}
			seg.c1--;
			seg.c2++;
			seg.c1=max(seg.c1, 0);
			seg.c2=min(seg.c2, m-1);
			for(int j = seg.c1;j<=seg.c2;j++) {
				vsides[seg.r2][j].push_back(pair<int,int>(seg.r1, seg.c1));
			}
		}
	}


	long long ans=0;
	for(int i = 0;i<n;i++) {
		for(int j = 0;j<m;j++) {
			int tmp=0;
			sort(vsides[i][j].begin(), vsides[i][j].end());
			sort(hsides[i][j].begin(), hsides[i][j].end());
			int p1 = 0;
			for(auto k:vsides[i][j]) {
				while(p1 < (int)hsides[i][j].size() and hsides[i][j][p1].first <= k.first) {
					upd(hsides[i][j][p1++].second, 1);
				}
				ans+=qry(k.second);
			}
			while(p1 < (int)hsides[i][j].size()) {
				upd(hsides[i][j][p1++].second, 1);
			}
			for(auto k:hsides[i][j]) {
				upd(k.second, -1);
			}
		}
	}
	return ans;
}

Compilation message

rect.cpp:5:28: warning: bad option '-favx2' to pragma 'optimize' [-Wpragmas]
    5 | #pragma GCC optimize("avx2")
      |                            ^
rect.cpp:19:25: warning: bad option '-favx2' to attribute 'optimize' [-Wattributes]
   19 | void upd(int at, int add) {
      |                         ^
rect.cpp:26:15: warning: bad option '-favx2' to attribute 'optimize' [-Wattributes]
   26 | int qry(int at) {
      |               ^
rect.cpp:37:60: warning: bad option '-favx2' to attribute 'optimize' [-Wattributes]
   37 | long long count_rectangles(std::vector<std::vector<int> > a) {
      |                                                            ^
rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:135:8: warning: unused variable 'tmp' [-Wunused-variable]
  135 |    int tmp=0;
      |        ^~~
rect.cpp:99:10: warning: 'seg.Side::c1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   99 |    seg.c1--;
      |    ~~~~~~^~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 296536 KB Output is correct
2 Correct 40 ms 296356 KB Output is correct
3 Correct 41 ms 296280 KB Output is correct
4 Correct 43 ms 296316 KB Output is correct
5 Correct 40 ms 296280 KB Output is correct
6 Correct 45 ms 296272 KB Output is correct
7 Correct 39 ms 296272 KB Output is correct
8 Correct 42 ms 296284 KB Output is correct
9 Correct 41 ms 296284 KB Output is correct
10 Correct 41 ms 296276 KB Output is correct
11 Correct 41 ms 296264 KB Output is correct
12 Correct 40 ms 296540 KB Output is correct
13 Correct 41 ms 296284 KB Output is correct
14 Correct 40 ms 296276 KB Output is correct
15 Correct 40 ms 296276 KB Output is correct
16 Correct 41 ms 296272 KB Output is correct
17 Correct 47 ms 296492 KB Output is correct
18 Correct 44 ms 296276 KB Output is correct
19 Correct 41 ms 296284 KB Output is correct
20 Correct 43 ms 296464 KB Output is correct
21 Correct 44 ms 296276 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 296536 KB Output is correct
2 Correct 40 ms 296356 KB Output is correct
3 Correct 41 ms 296280 KB Output is correct
4 Correct 43 ms 296316 KB Output is correct
5 Correct 40 ms 296280 KB Output is correct
6 Correct 45 ms 296272 KB Output is correct
7 Correct 39 ms 296272 KB Output is correct
8 Correct 42 ms 296284 KB Output is correct
9 Correct 41 ms 296284 KB Output is correct
10 Correct 41 ms 296276 KB Output is correct
11 Correct 41 ms 296264 KB Output is correct
12 Correct 40 ms 296540 KB Output is correct
13 Correct 41 ms 296284 KB Output is correct
14 Correct 40 ms 296276 KB Output is correct
15 Correct 40 ms 296276 KB Output is correct
16 Correct 41 ms 296272 KB Output is correct
17 Correct 47 ms 296492 KB Output is correct
18 Correct 44 ms 296276 KB Output is correct
19 Correct 41 ms 296284 KB Output is correct
20 Correct 43 ms 296464 KB Output is correct
21 Correct 44 ms 296276 KB Output is correct
22 Correct 41 ms 296704 KB Output is correct
23 Correct 41 ms 296784 KB Output is correct
24 Correct 41 ms 296668 KB Output is correct
25 Correct 42 ms 296788 KB Output is correct
26 Correct 44 ms 297040 KB Output is correct
27 Correct 45 ms 297040 KB Output is correct
28 Correct 46 ms 297048 KB Output is correct
29 Correct 42 ms 296516 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 296536 KB Output is correct
2 Correct 40 ms 296356 KB Output is correct
3 Correct 41 ms 296280 KB Output is correct
4 Correct 43 ms 296316 KB Output is correct
5 Correct 40 ms 296280 KB Output is correct
6 Correct 45 ms 296272 KB Output is correct
7 Correct 39 ms 296272 KB Output is correct
8 Correct 42 ms 296284 KB Output is correct
9 Correct 41 ms 296284 KB Output is correct
10 Correct 41 ms 296276 KB Output is correct
11 Correct 41 ms 296264 KB Output is correct
12 Correct 40 ms 296540 KB Output is correct
13 Correct 41 ms 296284 KB Output is correct
14 Correct 40 ms 296276 KB Output is correct
15 Correct 40 ms 296276 KB Output is correct
16 Correct 41 ms 296272 KB Output is correct
17 Correct 41 ms 296704 KB Output is correct
18 Correct 41 ms 296784 KB Output is correct
19 Correct 41 ms 296668 KB Output is correct
20 Correct 42 ms 296788 KB Output is correct
21 Correct 44 ms 297040 KB Output is correct
22 Correct 45 ms 297040 KB Output is correct
23 Correct 46 ms 297048 KB Output is correct
24 Correct 42 ms 296516 KB Output is correct
25 Correct 47 ms 296492 KB Output is correct
26 Correct 44 ms 296276 KB Output is correct
27 Correct 41 ms 296284 KB Output is correct
28 Correct 43 ms 296464 KB Output is correct
29 Correct 44 ms 296276 KB Output is correct
30 Correct 48 ms 298764 KB Output is correct
31 Correct 48 ms 298736 KB Output is correct
32 Correct 47 ms 298588 KB Output is correct
33 Correct 63 ms 299932 KB Output is correct
34 Correct 69 ms 300624 KB Output is correct
35 Correct 72 ms 300628 KB Output is correct
36 Correct 69 ms 300372 KB Output is correct
37 Correct 66 ms 300460 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 296536 KB Output is correct
2 Correct 40 ms 296356 KB Output is correct
3 Correct 41 ms 296280 KB Output is correct
4 Correct 43 ms 296316 KB Output is correct
5 Correct 40 ms 296280 KB Output is correct
6 Correct 45 ms 296272 KB Output is correct
7 Correct 39 ms 296272 KB Output is correct
8 Correct 42 ms 296284 KB Output is correct
9 Correct 41 ms 296284 KB Output is correct
10 Correct 41 ms 296276 KB Output is correct
11 Correct 41 ms 296264 KB Output is correct
12 Correct 40 ms 296540 KB Output is correct
13 Correct 41 ms 296284 KB Output is correct
14 Correct 40 ms 296276 KB Output is correct
15 Correct 40 ms 296276 KB Output is correct
16 Correct 41 ms 296272 KB Output is correct
17 Correct 41 ms 296704 KB Output is correct
18 Correct 41 ms 296784 KB Output is correct
19 Correct 41 ms 296668 KB Output is correct
20 Correct 42 ms 296788 KB Output is correct
21 Correct 44 ms 297040 KB Output is correct
22 Correct 45 ms 297040 KB Output is correct
23 Correct 46 ms 297048 KB Output is correct
24 Correct 42 ms 296516 KB Output is correct
25 Correct 48 ms 298764 KB Output is correct
26 Correct 48 ms 298736 KB Output is correct
27 Correct 47 ms 298588 KB Output is correct
28 Correct 63 ms 299932 KB Output is correct
29 Correct 69 ms 300624 KB Output is correct
30 Correct 72 ms 300628 KB Output is correct
31 Correct 69 ms 300372 KB Output is correct
32 Correct 66 ms 300460 KB Output is correct
33 Correct 47 ms 296492 KB Output is correct
34 Correct 44 ms 296276 KB Output is correct
35 Correct 41 ms 296284 KB Output is correct
36 Correct 43 ms 296464 KB Output is correct
37 Correct 44 ms 296276 KB Output is correct
38 Correct 172 ms 324400 KB Output is correct
39 Correct 181 ms 327600 KB Output is correct
40 Correct 180 ms 327760 KB Output is correct
41 Correct 165 ms 331092 KB Output is correct
42 Correct 161 ms 326992 KB Output is correct
43 Correct 157 ms 326992 KB Output is correct
44 Correct 158 ms 326936 KB Output is correct
45 Correct 147 ms 325200 KB Output is correct
46 Correct 233 ms 333800 KB Output is correct
47 Correct 279 ms 337808 KB Output is correct
48 Correct 461 ms 350796 KB Output is correct
49 Correct 449 ms 351088 KB Output is correct
50 Correct 245 ms 324180 KB Output is correct
51 Correct 246 ms 323696 KB Output is correct
52 Correct 429 ms 346964 KB Output is correct
53 Correct 434 ms 346960 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 296796 KB Output is correct
2 Correct 44 ms 297040 KB Output is correct
3 Correct 44 ms 296532 KB Output is correct
4 Correct 44 ms 296280 KB Output is correct
5 Correct 45 ms 296788 KB Output is correct
6 Correct 43 ms 296788 KB Output is correct
7 Correct 43 ms 296928 KB Output is correct
8 Correct 43 ms 296792 KB Output is correct
9 Correct 42 ms 296784 KB Output is correct
10 Correct 41 ms 296560 KB Output is correct
11 Correct 42 ms 296604 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 296492 KB Output is correct
2 Correct 44 ms 296276 KB Output is correct
3 Correct 41 ms 296284 KB Output is correct
4 Correct 43 ms 296464 KB Output is correct
5 Correct 44 ms 296276 KB Output is correct
6 Correct 43 ms 296276 KB Output is correct
7 Correct 1220 ms 509372 KB Output is correct
8 Correct 2699 ms 748304 KB Output is correct
9 Correct 2735 ms 750404 KB Output is correct
10 Correct 2726 ms 750556 KB Output is correct
11 Correct 327 ms 408148 KB Output is correct
12 Correct 607 ms 499540 KB Output is correct
13 Correct 673 ms 512596 KB Output is correct

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 296536 KB Output is correct
2 Correct 40 ms 296356 KB Output is correct
3 Correct 41 ms 296280 KB Output is correct
4 Correct 43 ms 296316 KB Output is correct
5 Correct 40 ms 296280 KB Output is correct
6 Correct 45 ms 296272 KB Output is correct
7 Correct 39 ms 296272 KB Output is correct
8 Correct 42 ms 296284 KB Output is correct
9 Correct 41 ms 296284 KB Output is correct
10 Correct 41 ms 296276 KB Output is correct
11 Correct 41 ms 296264 KB Output is correct
12 Correct 40 ms 296540 KB Output is correct
13 Correct 41 ms 296284 KB Output is correct
14 Correct 40 ms 296276 KB Output is correct
15 Correct 40 ms 296276 KB Output is correct
16 Correct 41 ms 296272 KB Output is correct
17 Correct 41 ms 296704 KB Output is correct
18 Correct 41 ms 296784 KB Output is correct
19 Correct 41 ms 296668 KB Output is correct
20 Correct 42 ms 296788 KB Output is correct
21 Correct 44 ms 297040 KB Output is correct
22 Correct 45 ms 297040 KB Output is correct
23 Correct 46 ms 297048 KB Output is correct
24 Correct 42 ms 296516 KB Output is correct
25 Correct 48 ms 298764 KB Output is correct
26 Correct 48 ms 298736 KB Output is correct
27 Correct 47 ms 298588 KB Output is correct
28 Correct 63 ms 299932 KB Output is correct
29 Correct 69 ms 300624 KB Output is correct
30 Correct 72 ms 300628 KB Output is correct
31 Correct 69 ms 300372 KB Output is correct
32 Correct 66 ms 300460 KB Output is correct
33 Correct 172 ms 324400 KB Output is correct
34 Correct 181 ms 327600 KB Output is correct
35 Correct 180 ms 327760 KB Output is correct
36 Correct 165 ms 331092 KB Output is correct
37 Correct 161 ms 326992 KB Output is correct
38 Correct 157 ms 326992 KB Output is correct
39 Correct 158 ms 326936 KB Output is correct
40 Correct 147 ms 325200 KB Output is correct
41 Correct 233 ms 333800 KB Output is correct
42 Correct 279 ms 337808 KB Output is correct
43 Correct 461 ms 350796 KB Output is correct
44 Correct 449 ms 351088 KB Output is correct
45 Correct 245 ms 324180 KB Output is correct
46 Correct 246 ms 323696 KB Output is correct
47 Correct 429 ms 346964 KB Output is correct
48 Correct 434 ms 346960 KB Output is correct
49 Correct 41 ms 296796 KB Output is correct
50 Correct 44 ms 297040 KB Output is correct
51 Correct 44 ms 296532 KB Output is correct
52 Correct 44 ms 296280 KB Output is correct
53 Correct 45 ms 296788 KB Output is correct
54 Correct 43 ms 296788 KB Output is correct
55 Correct 43 ms 296928 KB Output is correct
56 Correct 43 ms 296792 KB Output is correct
57 Correct 42 ms 296784 KB Output is correct
58 Correct 41 ms 296560 KB Output is correct
59 Correct 42 ms 296604 KB Output is correct
60 Correct 43 ms 296276 KB Output is correct
61 Correct 1220 ms 509372 KB Output is correct
62 Correct 2699 ms 748304 KB Output is correct
63 Correct 2735 ms 750404 KB Output is correct
64 Correct 2726 ms 750556 KB Output is correct
65 Correct 327 ms 408148 KB Output is correct
66 Correct 607 ms 499540 KB Output is correct
67 Correct 673 ms 512596 KB Output is correct
68 Correct 47 ms 296492 KB Output is correct
69 Correct 44 ms 296276 KB Output is correct
70 Correct 41 ms 296284 KB Output is correct
71 Correct 43 ms 296464 KB Output is correct
72 Correct 44 ms 296276 KB Output is correct
73 Correct 2009 ms 614008 KB Output is correct
74 Correct 1844 ms 659168 KB Output is correct
75 Correct 2115 ms 659840 KB Output is correct
76 Correct 1968 ms 706192 KB Output is correct
77 Correct 2421 ms 636228 KB Output is correct
78 Correct 3443 ms 686836 KB Output is correct
79 Correct 3575 ms 708748 KB Output is correct
80 Execution timed out 5030 ms 941140 KB Time limit exceeded
81 Halted 0 ms 0 KB -