oj.uz

답안 #146790

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
146790 2019-08-26T07:04:21 Z gs14004 Rectangles (IOI19_rect) C++17
10 / 100
 5000 ms 280384 KB 
#include "rect.h"
#include <bits/stdc++.h>
#define sz(v) ((int)(v).size())
using namespace std;
using pi = pair<int, int>;
using lint = long long;
const int MAXN = 2505;

struct bit{
	int tree[MAXN];
	void add(int x, int v){
		for(int i=x; i<MAXN; i+=i&-i) tree[i] += v;
	}
	int query(int x){
		int ret = 0;
		for(int i=x; i; i-=i&-i) ret += tree[i];
		return ret;
	}
}bit;

struct strip{ int x, s, e, up; };

void proc(vector<strip> &v){
	sort(v.begin(), v.end(), [&](const strip &a, const strip &b){
		if(a.s != b.s) return a.s < b.s;
		if(a.e != b.e) return a.e < b.e;
		if(a.x != b.x) return a.x < b.x;
	});
	v.resize(unique(v.begin(), v.end(), [&](const strip &a, const strip &b){
		return a.s == b.s && a.e == b.e && a.x == b.x;
	}) - v.begin());
	for(int i=1; i<v.size(); i++){
		if(pi(v[i-1].s, v[i-1].e) == pi(v[i].s, v[i].e) && v[i-1].x + 1 == v[i].x) v[i].up = v[i-1].up + 1;
	}
}

int L[MAXN], R[MAXN];
lint count_rectangles(vector<vector<int>> a){
	vector<strip> rdir, ldir;
	int n = sz(a);
	int m = sz(a[0]);
	vector<int> stk;
	for(int i=1; i<n-1; i++){
		memset(L, -1, sizeof(L));
		memset(R, -1, sizeof(R));
		for(int j=0; j<m; j++){
			while(!stk.empty() && a[i][stk.back()] <= a[i][j]) stk.pop_back();
			if(stk.size()) L[j] = stk.back();
			stk.push_back(j);
		}
		stk.clear();
		for(int j=m-1; j>=0; j--){
			while(!stk.empty() && a[i][stk.back()] <= a[i][j]) stk.pop_back();
			if(stk.size()) R[j] = stk.back();
			stk.push_back(j);
		}
		stk.clear();
		for(int j=0; j<m; j++){
			if(L[j] != -1 && R[j] != -1){
				rdir.push_back({i, L[j], R[j], 1});
			}
		}
	}
	for(int i=1; i<m-1; i++){
		memset(L, -1, sizeof(L));
		memset(R, -1, sizeof(R));
		for(int j=0; j<n; j++){
			while(!stk.empty() && a[stk.back()][i] <= a[j][i]) stk.pop_back();
			if(stk.size()) L[j] = stk.back();
			stk.push_back(j);
		}
		stk.clear();
		for(int j=n-1; j>=0; j--){
			while(!stk.empty() && a[stk.back()][i] <= a[j][i]) stk.pop_back();
			if(stk.size()) R[j] = stk.back();
			stk.push_back(j);
		}
		stk.clear();
		for(int j=0; j<n; j++){
			if(L[j] != -1 && R[j] != -1){
				ldir.push_back({i, L[j], R[j], 1});
			}
		}
	}
	proc(ldir);
	proc(rdir);
	sort(ldir.begin(), ldir.end(), [&](const strip &a, const strip &b){
		return pi(a.e, a.x) < pi(b.e, b.x);
	});
	sort(rdir.begin(), rdir.end(), [&](const strip &a, const strip &b){
		return pi(a.x, a.e) < pi(b.x, b.e);
	});
	int p1 = 0, p2 = 0;
	lint ret = 0;
	for(int i=2; i<n; i++){
		for(int j=2; j<m; j++){
			vector<pi> punk1, punk2;
			while(p1 < sz(rdir) && pi(rdir[p1].x + 1, rdir[p1].e) == pi(i, j)){
				punk1.emplace_back(j - rdir[p1].s - 1, rdir[p1].up);
				p1++;
			}
			while(p2 < sz(ldir) && pi(ldir[p2].e, ldir[p2].x + 1) == pi(i, j)){
				punk2.emplace_back(ldir[p2].up, i - ldir[p2].s - 1);
				p2++;
			}
			sort(punk1.begin(), punk1.end());
			sort(punk2.begin(), punk2.end());
			int p3 = 0;
			for(auto &y : punk2){
				while(p3 < sz(punk1) && punk1[p3].first <= y.first) bit.add(punk1[p3++].second, +1);
				ret += p3 - bit.query(y.second - 1);
			}
			for(int i=0; i<p3; i++) bit.add(punk1[i].second, -1);
		}
	}
	return ret;
}

Compilation message

rect.cpp: In function 'void proc(std::vector<strip>&)':
rect.cpp:32:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1; i<v.size(); i++){
               ~^~~~~~~~~
rect.cpp: In lambda function:
rect.cpp:28:2: warning: control reaches end of non-void function [-Wreturn-type]
  });
  ^

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 1 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Runtime error 3 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
20 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 1 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 760 KB Output is correct
18 Correct 6 ms 760 KB Output is correct
19 Correct 6 ms 812 KB Output is correct
20 Correct 4 ms 632 KB Output is correct
21 Correct 6 ms 760 KB Output is correct
22 Correct 6 ms 760 KB Output is correct
23 Correct 6 ms 760 KB Output is correct
24 Correct 4 ms 508 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Runtime error 3 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
28 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 1 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 760 KB Output is correct
18 Correct 6 ms 760 KB Output is correct
19 Correct 6 ms 812 KB Output is correct
20 Correct 4 ms 632 KB Output is correct
21 Correct 6 ms 760 KB Output is correct
22 Correct 6 ms 760 KB Output is correct
23 Correct 6 ms 760 KB Output is correct
24 Correct 4 ms 508 KB Output is correct
25 Correct 24 ms 3056 KB Output is correct
26 Correct 25 ms 3156 KB Output is correct
27 Correct 24 ms 3060 KB Output is correct
28 Correct 19 ms 1904 KB Output is correct
29 Correct 31 ms 2928 KB Output is correct
30 Correct 34 ms 3052 KB Output is correct
31 Correct 30 ms 3056 KB Output is correct
32 Correct 30 ms 3052 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Runtime error 3 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
36 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 1 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 760 KB Output is correct
18 Correct 6 ms 760 KB Output is correct
19 Correct 6 ms 812 KB Output is correct
20 Correct 4 ms 632 KB Output is correct
21 Correct 6 ms 760 KB Output is correct
22 Correct 6 ms 760 KB Output is correct
23 Correct 6 ms 760 KB Output is correct
24 Correct 4 ms 508 KB Output is correct
25 Correct 24 ms 3056 KB Output is correct
26 Correct 25 ms 3156 KB Output is correct
27 Correct 24 ms 3060 KB Output is correct
28 Correct 19 ms 1904 KB Output is correct
29 Correct 31 ms 2928 KB Output is correct
30 Correct 34 ms 3052 KB Output is correct
31 Correct 30 ms 3056 KB Output is correct
32 Correct 30 ms 3052 KB Output is correct
33 Correct 160 ms 17360 KB Output is correct
34 Correct 147 ms 17372 KB Output is correct
35 Correct 154 ms 17472 KB Output is correct
36 Correct 121 ms 17396 KB Output is correct
37 Correct 300 ms 27376 KB Output is correct
38 Correct 304 ms 27472 KB Output is correct
39 Correct 303 ms 27864 KB Output is correct
40 Correct 289 ms 26968 KB Output is correct
41 Correct 165 ms 15196 KB Output is correct
42 Correct 222 ms 22608 KB Output is correct
43 Correct 406 ms 25816 KB Output is correct
44 Correct 407 ms 27848 KB Output is correct
45 Correct 195 ms 14048 KB Output is correct
46 Correct 198 ms 14056 KB Output is correct
47 Correct 403 ms 26720 KB Output is correct
48 Correct 386 ms 27760 KB Output is correct
49 Correct 2 ms 256 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Runtime error 3 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
52 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 632 KB Output is correct
2 Correct 4 ms 588 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 4 ms 632 KB Output is correct
6 Correct 4 ms 580 KB Output is correct
7 Correct 4 ms 504 KB Output is correct
8 Correct 4 ms 504 KB Output is correct
9 Correct 4 ms 632 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 352 KB Output is correct
2 Correct 1004 ms 100116 KB Output is correct
3 Correct 2267 ms 168336 KB Output is correct
4 Correct 2301 ms 168844 KB Output is correct
5 Correct 2277 ms 168856 KB Output is correct
6 Correct 130 ms 30712 KB Output is correct
7 Correct 288 ms 51388 KB Output is correct
8 Correct 313 ms 54264 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Runtime error 3 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
12 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 1 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 5 ms 760 KB Output is correct
18 Correct 6 ms 760 KB Output is correct
19 Correct 6 ms 812 KB Output is correct
20 Correct 4 ms 632 KB Output is correct
21 Correct 6 ms 760 KB Output is correct
22 Correct 6 ms 760 KB Output is correct
23 Correct 6 ms 760 KB Output is correct
24 Correct 4 ms 508 KB Output is correct
25 Correct 24 ms 3056 KB Output is correct
26 Correct 25 ms 3156 KB Output is correct
27 Correct 24 ms 3060 KB Output is correct
28 Correct 19 ms 1904 KB Output is correct
29 Correct 31 ms 2928 KB Output is correct
30 Correct 34 ms 3052 KB Output is correct
31 Correct 30 ms 3056 KB Output is correct
32 Correct 30 ms 3052 KB Output is correct
33 Correct 160 ms 17360 KB Output is correct
34 Correct 147 ms 17372 KB Output is correct
35 Correct 154 ms 17472 KB Output is correct
36 Correct 121 ms 17396 KB Output is correct
37 Correct 300 ms 27376 KB Output is correct
38 Correct 304 ms 27472 KB Output is correct
39 Correct 303 ms 27864 KB Output is correct
40 Correct 289 ms 26968 KB Output is correct
41 Correct 165 ms 15196 KB Output is correct
42 Correct 222 ms 22608 KB Output is correct
43 Correct 406 ms 25816 KB Output is correct
44 Correct 407 ms 27848 KB Output is correct
45 Correct 195 ms 14048 KB Output is correct
46 Correct 198 ms 14056 KB Output is correct
47 Correct 403 ms 26720 KB Output is correct
48 Correct 386 ms 27760 KB Output is correct
49 Correct 4 ms 632 KB Output is correct
50 Correct 4 ms 588 KB Output is correct
51 Correct 3 ms 376 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 4 ms 632 KB Output is correct
54 Correct 4 ms 580 KB Output is correct
55 Correct 4 ms 504 KB Output is correct
56 Correct 4 ms 504 KB Output is correct
57 Correct 4 ms 632 KB Output is correct
58 Correct 3 ms 376 KB Output is correct
59 Correct 3 ms 376 KB Output is correct
60 Correct 2 ms 352 KB Output is correct
61 Correct 1004 ms 100116 KB Output is correct
62 Correct 2267 ms 168336 KB Output is correct
63 Correct 2301 ms 168844 KB Output is correct
64 Correct 2277 ms 168856 KB Output is correct
65 Correct 130 ms 30712 KB Output is correct
66 Correct 288 ms 51388 KB Output is correct
67 Correct 313 ms 54264 KB Output is correct
68 Correct 2309 ms 170632 KB Output is correct
69 Correct 2184 ms 165780 KB Output is correct
70 Correct 2346 ms 165796 KB Output is correct
71 Correct 1774 ms 166068 KB Output is correct
72 Correct 4709 ms 280384 KB Output is correct
73 Correct 3418 ms 156952 KB Output is correct
74 Correct 3649 ms 159120 KB Output is correct
75 Execution timed out 5031 ms 278960 KB Time limit exceeded
76 Halted 0 ms 0 KB -