oj.uz

답안 #1047479

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1047479 2024-08-07T13:31:07 Z vjudge1 Rectangles (IOI19_rect) C++17
72 / 100
 5000 ms 764352 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
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<int,int>> hsides[N][N];
vector<pair<int,int>> vsides[N][N];
vector<pair<int,int>> swp[N];
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.c1, seg.r1));
			}
		}
	}


	long long ans=0;
	for(int i = 0;i<n;i++) {
		for(int j = 0;j<m;j++) {
			int tmp=0;
			for(auto k:vsides[i][j]) {
				for(auto k2:hsides[i][j]) {
					if(k2.second >= k.first and k2.first <= k.second) {
//						cout << i << " " << k2.r1 << " " <<  k.r1 << " " << j <<  endl;
						ans++;
						tmp++;
					}

				}
			}
//			cout << i << " " << j << " " << tmp << endl;
		}
	}
	return ans;
}

Compilation message

rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:100:10: warning: 'seg.Side::c1' may be used uninitialized in this function [-Wmaybe-uninitialized]
  100 |    seg.c1--;
      |    ~~~~~~^~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 296284 KB Output is correct
2 Correct 39 ms 296356 KB Output is correct
3 Correct 39 ms 296536 KB Output is correct
4 Correct 39 ms 296544 KB Output is correct
5 Correct 41 ms 296284 KB Output is correct
6 Correct 42 ms 296528 KB Output is correct
7 Correct 41 ms 296536 KB Output is correct
8 Correct 42 ms 296272 KB Output is correct
9 Correct 40 ms 296544 KB Output is correct
10 Correct 39 ms 296528 KB Output is correct
11 Correct 40 ms 296540 KB Output is correct
12 Correct 41 ms 296336 KB Output is correct
13 Correct 39 ms 296284 KB Output is correct
14 Correct 45 ms 296272 KB Output is correct
15 Correct 39 ms 296456 KB Output is correct
16 Correct 41 ms 296276 KB Output is correct
17 Correct 39 ms 296272 KB Output is correct
18 Correct 39 ms 296424 KB Output is correct
19 Correct 39 ms 296532 KB Output is correct
20 Correct 40 ms 296284 KB Output is correct
21 Correct 39 ms 296284 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 296284 KB Output is correct
2 Correct 39 ms 296356 KB Output is correct
3 Correct 39 ms 296536 KB Output is correct
4 Correct 39 ms 296544 KB Output is correct
5 Correct 41 ms 296284 KB Output is correct
6 Correct 42 ms 296528 KB Output is correct
7 Correct 41 ms 296536 KB Output is correct
8 Correct 42 ms 296272 KB Output is correct
9 Correct 40 ms 296544 KB Output is correct
10 Correct 39 ms 296528 KB Output is correct
11 Correct 40 ms 296540 KB Output is correct
12 Correct 41 ms 296336 KB Output is correct
13 Correct 39 ms 296284 KB Output is correct
14 Correct 45 ms 296272 KB Output is correct
15 Correct 39 ms 296456 KB Output is correct
16 Correct 41 ms 296276 KB Output is correct
17 Correct 39 ms 296272 KB Output is correct
18 Correct 39 ms 296424 KB Output is correct
19 Correct 39 ms 296532 KB Output is correct
20 Correct 40 ms 296284 KB Output is correct
21 Correct 39 ms 296284 KB Output is correct
22 Correct 46 ms 297040 KB Output is correct
23 Correct 41 ms 296788 KB Output is correct
24 Correct 43 ms 297052 KB Output is correct
25 Correct 42 ms 297052 KB Output is correct
26 Correct 46 ms 297296 KB Output is correct
27 Correct 45 ms 297296 KB Output is correct
28 Correct 43 ms 297308 KB Output is correct
29 Correct 41 ms 296788 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 296284 KB Output is correct
2 Correct 39 ms 296356 KB Output is correct
3 Correct 39 ms 296536 KB Output is correct
4 Correct 39 ms 296544 KB Output is correct
5 Correct 41 ms 296284 KB Output is correct
6 Correct 42 ms 296528 KB Output is correct
7 Correct 41 ms 296536 KB Output is correct
8 Correct 42 ms 296272 KB Output is correct
9 Correct 40 ms 296544 KB Output is correct
10 Correct 39 ms 296528 KB Output is correct
11 Correct 40 ms 296540 KB Output is correct
12 Correct 41 ms 296336 KB Output is correct
13 Correct 39 ms 296284 KB Output is correct
14 Correct 45 ms 296272 KB Output is correct
15 Correct 39 ms 296456 KB Output is correct
16 Correct 41 ms 296276 KB Output is correct
17 Correct 46 ms 297040 KB Output is correct
18 Correct 41 ms 296788 KB Output is correct
19 Correct 43 ms 297052 KB Output is correct
20 Correct 42 ms 297052 KB Output is correct
21 Correct 46 ms 297296 KB Output is correct
22 Correct 45 ms 297296 KB Output is correct
23 Correct 43 ms 297308 KB Output is correct
24 Correct 41 ms 296788 KB Output is correct
25 Correct 39 ms 296272 KB Output is correct
26 Correct 39 ms 296424 KB Output is correct
27 Correct 39 ms 296532 KB Output is correct
28 Correct 40 ms 296284 KB Output is correct
29 Correct 39 ms 296284 KB Output is correct
30 Correct 46 ms 299092 KB Output is correct
31 Correct 47 ms 299088 KB Output is correct
32 Correct 50 ms 299088 KB Output is correct
33 Correct 54 ms 300112 KB Output is correct
34 Correct 70 ms 301364 KB Output is correct
35 Correct 67 ms 301396 KB Output is correct
36 Correct 64 ms 301144 KB Output is correct
37 Correct 64 ms 301136 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 296284 KB Output is correct
2 Correct 39 ms 296356 KB Output is correct
3 Correct 39 ms 296536 KB Output is correct
4 Correct 39 ms 296544 KB Output is correct
5 Correct 41 ms 296284 KB Output is correct
6 Correct 42 ms 296528 KB Output is correct
7 Correct 41 ms 296536 KB Output is correct
8 Correct 42 ms 296272 KB Output is correct
9 Correct 40 ms 296544 KB Output is correct
10 Correct 39 ms 296528 KB Output is correct
11 Correct 40 ms 296540 KB Output is correct
12 Correct 41 ms 296336 KB Output is correct
13 Correct 39 ms 296284 KB Output is correct
14 Correct 45 ms 296272 KB Output is correct
15 Correct 39 ms 296456 KB Output is correct
16 Correct 41 ms 296276 KB Output is correct
17 Correct 46 ms 297040 KB Output is correct
18 Correct 41 ms 296788 KB Output is correct
19 Correct 43 ms 297052 KB Output is correct
20 Correct 42 ms 297052 KB Output is correct
21 Correct 46 ms 297296 KB Output is correct
22 Correct 45 ms 297296 KB Output is correct
23 Correct 43 ms 297308 KB Output is correct
24 Correct 41 ms 296788 KB Output is correct
25 Correct 46 ms 299092 KB Output is correct
26 Correct 47 ms 299088 KB Output is correct
27 Correct 50 ms 299088 KB Output is correct
28 Correct 54 ms 300112 KB Output is correct
29 Correct 70 ms 301364 KB Output is correct
30 Correct 67 ms 301396 KB Output is correct
31 Correct 64 ms 301144 KB Output is correct
32 Correct 64 ms 301136 KB Output is correct
33 Correct 39 ms 296272 KB Output is correct
34 Correct 39 ms 296424 KB Output is correct
35 Correct 39 ms 296532 KB Output is correct
36 Correct 40 ms 296284 KB Output is correct
37 Correct 39 ms 296284 KB Output is correct
38 Correct 227 ms 332988 KB Output is correct
39 Correct 153 ms 335812 KB Output is correct
40 Correct 172 ms 336208 KB Output is correct
41 Correct 157 ms 338664 KB Output is correct
42 Correct 160 ms 332712 KB Output is correct
43 Correct 146 ms 332636 KB Output is correct
44 Correct 148 ms 332512 KB Output is correct
45 Correct 139 ms 330608 KB Output is correct
46 Correct 208 ms 334160 KB Output is correct
47 Correct 249 ms 338772 KB Output is correct
48 Correct 408 ms 360412 KB Output is correct
49 Correct 450 ms 361160 KB Output is correct
50 Correct 224 ms 328896 KB Output is correct
51 Correct 221 ms 328684 KB Output is correct
52 Correct 369 ms 354128 KB Output is correct
53 Correct 374 ms 354384 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 296796 KB Output is correct
2 Correct 42 ms 296792 KB Output is correct
3 Correct 40 ms 296672 KB Output is correct
4 Correct 39 ms 296500 KB Output is correct
5 Correct 47 ms 297020 KB Output is correct
6 Correct 43 ms 297040 KB Output is correct
7 Correct 43 ms 297048 KB Output is correct
8 Correct 42 ms 297044 KB Output is correct
9 Correct 43 ms 296784 KB Output is correct
10 Correct 40 ms 296608 KB Output is correct
11 Correct 41 ms 296796 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 296272 KB Output is correct
2 Correct 39 ms 296424 KB Output is correct
3 Correct 39 ms 296532 KB Output is correct
4 Correct 40 ms 296284 KB Output is correct
5 Correct 39 ms 296284 KB Output is correct
6 Correct 39 ms 296276 KB Output is correct
7 Correct 1175 ms 510072 KB Output is correct
8 Correct 2645 ms 761852 KB Output is correct
9 Correct 2699 ms 763908 KB Output is correct
10 Correct 2711 ms 764352 KB Output is correct
11 Correct 391 ms 414036 KB Output is correct
12 Correct 755 ms 511032 KB Output is correct
13 Correct 803 ms 524684 KB Output is correct

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 296284 KB Output is correct
2 Correct 39 ms 296356 KB Output is correct
3 Correct 39 ms 296536 KB Output is correct
4 Correct 39 ms 296544 KB Output is correct
5 Correct 41 ms 296284 KB Output is correct
6 Correct 42 ms 296528 KB Output is correct
7 Correct 41 ms 296536 KB Output is correct
8 Correct 42 ms 296272 KB Output is correct
9 Correct 40 ms 296544 KB Output is correct
10 Correct 39 ms 296528 KB Output is correct
11 Correct 40 ms 296540 KB Output is correct
12 Correct 41 ms 296336 KB Output is correct
13 Correct 39 ms 296284 KB Output is correct
14 Correct 45 ms 296272 KB Output is correct
15 Correct 39 ms 296456 KB Output is correct
16 Correct 41 ms 296276 KB Output is correct
17 Correct 46 ms 297040 KB Output is correct
18 Correct 41 ms 296788 KB Output is correct
19 Correct 43 ms 297052 KB Output is correct
20 Correct 42 ms 297052 KB Output is correct
21 Correct 46 ms 297296 KB Output is correct
22 Correct 45 ms 297296 KB Output is correct
23 Correct 43 ms 297308 KB Output is correct
24 Correct 41 ms 296788 KB Output is correct
25 Correct 46 ms 299092 KB Output is correct
26 Correct 47 ms 299088 KB Output is correct
27 Correct 50 ms 299088 KB Output is correct
28 Correct 54 ms 300112 KB Output is correct
29 Correct 70 ms 301364 KB Output is correct
30 Correct 67 ms 301396 KB Output is correct
31 Correct 64 ms 301144 KB Output is correct
32 Correct 64 ms 301136 KB Output is correct
33 Correct 227 ms 332988 KB Output is correct
34 Correct 153 ms 335812 KB Output is correct
35 Correct 172 ms 336208 KB Output is correct
36 Correct 157 ms 338664 KB Output is correct
37 Correct 160 ms 332712 KB Output is correct
38 Correct 146 ms 332636 KB Output is correct
39 Correct 148 ms 332512 KB Output is correct
40 Correct 139 ms 330608 KB Output is correct
41 Correct 208 ms 334160 KB Output is correct
42 Correct 249 ms 338772 KB Output is correct
43 Correct 408 ms 360412 KB Output is correct
44 Correct 450 ms 361160 KB Output is correct
45 Correct 224 ms 328896 KB Output is correct
46 Correct 221 ms 328684 KB Output is correct
47 Correct 369 ms 354128 KB Output is correct
48 Correct 374 ms 354384 KB Output is correct
49 Correct 42 ms 296796 KB Output is correct
50 Correct 42 ms 296792 KB Output is correct
51 Correct 40 ms 296672 KB Output is correct
52 Correct 39 ms 296500 KB Output is correct
53 Correct 47 ms 297020 KB Output is correct
54 Correct 43 ms 297040 KB Output is correct
55 Correct 43 ms 297048 KB Output is correct
56 Correct 42 ms 297044 KB Output is correct
57 Correct 43 ms 296784 KB Output is correct
58 Correct 40 ms 296608 KB Output is correct
59 Correct 41 ms 296796 KB Output is correct
60 Correct 39 ms 296276 KB Output is correct
61 Correct 1175 ms 510072 KB Output is correct
62 Correct 2645 ms 761852 KB Output is correct
63 Correct 2699 ms 763908 KB Output is correct
64 Correct 2711 ms 764352 KB Output is correct
65 Correct 391 ms 414036 KB Output is correct
66 Correct 755 ms 511032 KB Output is correct
67 Correct 803 ms 524684 KB Output is correct
68 Correct 39 ms 296272 KB Output is correct
69 Correct 39 ms 296424 KB Output is correct
70 Correct 39 ms 296532 KB Output is correct
71 Correct 40 ms 296284 KB Output is correct
72 Correct 39 ms 296284 KB Output is correct
73 Execution timed out 5067 ms 752776 KB Time limit exceeded
74 Halted 0 ms 0 KB -