oj.uz

답안 #169801

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
169801 2019-12-22T22:54:57 Z arthur_nascimento Rectangles (IOI19_rect) C++14
37 / 100
 5000 ms 1048580 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define debug 
#define ll long long
#define maxn 2525


int lg[maxn];

struct rmq {
	
	int len;
	int arr[maxn];
	int mx[13][maxn];
	int id[13][maxn];
	
	void build(){
		lg[1] = 0;
		for(int i=2;i<=len;i++)
			lg[i] = lg[i-1] + (i == (i&-i));
	
		for(int i=0;i<len;i++){
			mx[0][i] = arr[i];
			id[0][i] = i;
		}
		for(int i=1;i<13;i++)
			for(int j=0;j<len;j++){
				int ot = min(len-1, j + ( 1 << (i-1)));
				int A = mx[i-1][j], B = mx[i-1][ot];
				if(A > B){
					mx[i][j] = A;
					id[i][j] = id[i-1][j];
				}
				else {
					mx[i][j] = B;
					id[i][j] = id[i-1][ot];
				}
			}
	}
	
	int pos(int x,int y){
		int l = lg[y-x+1];
		int A = mx[l][x], B = mx[l][y-(1<<l)+1];
		if(A > B) return id[l][x];
		else return id[l][y-(1<<l)+1];
	}

}

RMQ[2][maxn];


int M[maxn][maxn];

int n,m;

int line(int i,int yi,int yf){
	int r = 1;
	for(int j=yi;j<=yf;j++)
		if(M[i][j] >= M[i][yi-1] || M[i][j] >= M[i][yf+1]) r = 0;
	return r;
}

int column(int j,int xi,int xf){
	int r = 1;
	for(int i=xi;i<=xf;i++)
		if(M[i][j] >= M[xi-1][j] || M[i][j] >= M[xf+1][j]) r = 0;
	return r;
}

int check(int xi,int xf,int yi,int yf){
	int r = 1;
	assert(xi >= 1 && xf <= n-2 && yi >= 1 && yf <= m-2);
	for(int i=xi;i<=xf;i++)
		r *= line(i,yi,yf);
	for(int j=yi;j<=yf;j++)
		r *= column(j,xi,xf);
	if(r)
		debug("achou x:%d~%d y: %d~%d\n",xi,xf,yi,yf);
	return r;
} 

ll go4(int xi,int xf,int yi,int yf,int ym){

	if(xi > xf || yi > yf) return 0;
	if(yi > ym || yf < ym) return 0;
	debug("oi4\n");
	ll ans = check(xi,xf,yi,yf);
	
	int mx = -1, id = -1;
	
	for(int i=yi;i<=yf;i++)
		if(M[xi][i] > mx){
			mx = M[xi][i];
			id = i;
		}
		
	ans += go4(xi,xf,yi,id-1,ym) + go4(xi,xf,id+1,yf,ym);
	debug("tchau 4\n");
	return ans;

}

ll go3(int xi,int xf,int yi,int yf,int ym){

	if(xi == 0 || xf == n-1) return 0;
	if(xi > xf) return 0;
	
	int A = ym, B = ym;
	
	debug("oi x: %d~%d y: %d~%d quebra A ? B ?\n",xi,xf,yi,yf);

	
	while(1){
		A--;
		if(A == 0 || A < yi) break;
		debug("A %d\n",A);
		int ok = 1;
		for(int i=xi;i<=xf;i++)
			if(M[i][A] >= M[xi-1][A] || M[i][A] >= M[xf+1][A]) ok = 0;
		if(ok == 0) break;
	}
	A++;
	
	while(1){
		B++;
		if(B == m-1 || B > yf) break;
		int ok = 1;
		for(int i=xi;i<=xf;i++)
			if(M[i][B] >= M[xi-1][B] || M[i][B] >= M[xf+1][B]) ok = 0;
	}
	B--;
	
	debug("go3 x: %d~%d y: %d~%d quebra A %d B %d\n",xi,xf,yi,yf,A,B);
	
	return go4(xi,xf,A,B,ym);

}

ll go2(int xi,int xf,int yi,int yf,int ym){
	
	if(xi > xf) return 0;
	if(yi > yf) return 0;
	if(ym == 0 || ym == m-1) return 0;
	debug("go2 x %d~%d y %d~%d\n",xi,xf,yi,yf);
	
	int mx = -1, id = -1;
	
	/*for(int i=xi;i<=xf;i++)
		if(M[i][ym] > mx){
			mx = M[i][ym];
			id = i;
		}*/
	
	
	id = RMQ[1][ym].pos(xi,xf);
	
		
	ll ans = go3(xi,id-1,yi,yf,ym) + go3(id+1,xf,yi,yf,ym) + go2(xi,id-1,yi,yf,ym) + go2(id+1,xf,yi,yf,ym);
	
	return ans;

}

ll go(int yi,int yf){

	if(yi > yf) return 0;
	
	int ym = (yi+yf)/2;
	debug("oi\n");
	
	ll ans = go(yi,ym-1) + go(ym+1,yf) + go2(0,n-1,yi,yf,ym);
	
	return ans;

}

long long count_rectangles(std::vector<std::vector<int> > a) {
	
	 n = a.size();
	 m = a[0].size();
	
	for(int i=0;i<n;i++)
		for(int j=0;j<m;j++)
			M[i][j] = a[i][j];
			
	for(int i=0;i<n;i++){
		
		RMQ[0][i].len = m;
		
		for(int j=0;j<m;j++)
			RMQ[0][i].arr[j] = M[i][j];
			
		RMQ[0][i].build();
	
	}	
	
	for(int j=0;j<m;j++){
	
		RMQ[1][j].len = n;
		for(int i=0;i<n;i++)
			RMQ[1][j].arr[i] = M[i][j];
			
		RMQ[1][j].build();
	
	}	
	
	return go(0,m-1);
	
}

Compilation message

rect.cpp: In function 'int check(int, int, int, int)':
rect.cpp:81:36: warning: left operand of comma operator has no effect [-Wunused-value]
   debug("achou x:%d~%d y: %d~%d\n",xi,xf,yi,yf);
                                    ^~
rect.cpp:81:39: warning: right operand of comma operator has no effect [-Wunused-value]
   debug("achou x:%d~%d y: %d~%d\n",xi,xf,yi,yf);
                                       ^~
rect.cpp:81:42: warning: right operand of comma operator has no effect [-Wunused-value]
   debug("achou x:%d~%d y: %d~%d\n",xi,xf,yi,yf);
                                          ^~
rect.cpp:81:45: warning: right operand of comma operator has no effect [-Wunused-value]
   debug("achou x:%d~%d y: %d~%d\n",xi,xf,yi,yf);
                                             ^~
rect.cpp: In function 'long long int go4(int, int, int, int, int)':
rect.cpp:89:16: warning: statement has no effect [-Wunused-value]
  debug("oi4\n");
                ^
rect.cpp:101:20: warning: statement has no effect [-Wunused-value]
  debug("tchau 4\n");
                    ^
rect.cpp: In function 'long long int go3(int, int, int, int, int)':
rect.cpp:113:48: warning: left operand of comma operator has no effect [-Wunused-value]
  debug("oi x: %d~%d y: %d~%d quebra A ? B ?\n",xi,xf,yi,yf);
                                                ^~
rect.cpp:113:51: warning: right operand of comma operator has no effect [-Wunused-value]
  debug("oi x: %d~%d y: %d~%d quebra A ? B ?\n",xi,xf,yi,yf);
                                                   ^~
rect.cpp:113:54: warning: right operand of comma operator has no effect [-Wunused-value]
  debug("oi x: %d~%d y: %d~%d quebra A ? B ?\n",xi,xf,yi,yf);
                                                      ^~
rect.cpp:113:57: warning: right operand of comma operator has no effect [-Wunused-value]
  debug("oi x: %d~%d y: %d~%d quebra A ? B ?\n",xi,xf,yi,yf);
                                                         ^~
rect.cpp:119:18: warning: left operand of comma operator has no effect [-Wunused-value]
   debug("A %d\n",A);
                  ^
rect.cpp:130:7: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
   int ok = 1;
       ^~
rect.cpp:136:51: warning: left operand of comma operator has no effect [-Wunused-value]
  debug("go3 x: %d~%d y: %d~%d quebra A %d B %d\n",xi,xf,yi,yf,A,B);
                                                   ^~
rect.cpp:136:54: warning: right operand of comma operator has no effect [-Wunused-value]
  debug("go3 x: %d~%d y: %d~%d quebra A %d B %d\n",xi,xf,yi,yf,A,B);
                                                      ^~
rect.cpp:136:57: warning: right operand of comma operator has no effect [-Wunused-value]
  debug("go3 x: %d~%d y: %d~%d quebra A %d B %d\n",xi,xf,yi,yf,A,B);
                                                         ^~
rect.cpp:136:60: warning: right operand of comma operator has no effect [-Wunused-value]
  debug("go3 x: %d~%d y: %d~%d quebra A %d B %d\n",xi,xf,yi,yf,A,B);
                                                            ^~
rect.cpp:136:63: warning: right operand of comma operator has no effect [-Wunused-value]
  debug("go3 x: %d~%d y: %d~%d quebra A %d B %d\n",xi,xf,yi,yf,A,B);
                                                               ^
rect.cpp:136:65: warning: right operand of comma operator has no effect [-Wunused-value]
  debug("go3 x: %d~%d y: %d~%d quebra A %d B %d\n",xi,xf,yi,yf,A,B);
                                                                 ^
rect.cpp: In function 'long long int go2(int, int, int, int, int)':
rect.cpp:147:32: warning: left operand of comma operator has no effect [-Wunused-value]
  debug("go2 x %d~%d y %d~%d\n",xi,xf,yi,yf);
                                ^~
rect.cpp:147:35: warning: right operand of comma operator has no effect [-Wunused-value]
  debug("go2 x %d~%d y %d~%d\n",xi,xf,yi,yf);
                                   ^~
rect.cpp:147:38: warning: right operand of comma operator has no effect [-Wunused-value]
  debug("go2 x %d~%d y %d~%d\n",xi,xf,yi,yf);
                                      ^~
rect.cpp:147:41: warning: right operand of comma operator has no effect [-Wunused-value]
  debug("go2 x %d~%d y %d~%d\n",xi,xf,yi,yf);
                                         ^~
rect.cpp:149:6: warning: unused variable 'mx' [-Wunused-variable]
  int mx = -1, id = -1;
      ^~
rect.cpp: In function 'long long int go(int, int)':
rect.cpp:172:15: warning: statement has no effect [-Wunused-value]
  debug("oi\n");
               ^

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 8 ms 7164 KB Output is correct
3 Correct 8 ms 7160 KB Output is correct
4 Correct 8 ms 7160 KB Output is correct
5 Correct 7 ms 7160 KB Output is correct
6 Correct 7 ms 7160 KB Output is correct
7 Correct 6 ms 5240 KB Output is correct
8 Correct 6 ms 4984 KB Output is correct
9 Correct 7 ms 7160 KB Output is correct
10 Correct 7 ms 7160 KB Output is correct
11 Correct 7 ms 7160 KB Output is correct
12 Correct 7 ms 7160 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 3 ms 1656 KB Output is correct
15 Correct 4 ms 2424 KB Output is correct
16 Correct 2 ms 1016 KB Output is correct
17 Correct 2 ms 632 KB Output is correct
18 Correct 3 ms 1016 KB Output is correct
19 Correct 7 ms 7096 KB Output is correct
20 Correct 6 ms 5396 KB Output is correct
21 Correct 3 ms 1656 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 8 ms 7164 KB Output is correct
3 Correct 8 ms 7160 KB Output is correct
4 Correct 8 ms 7160 KB Output is correct
5 Correct 7 ms 7160 KB Output is correct
6 Correct 7 ms 7160 KB Output is correct
7 Correct 6 ms 5240 KB Output is correct
8 Correct 6 ms 4984 KB Output is correct
9 Correct 7 ms 7160 KB Output is correct
10 Correct 7 ms 7160 KB Output is correct
11 Correct 7 ms 7160 KB Output is correct
12 Correct 7 ms 7160 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 3 ms 1656 KB Output is correct
15 Correct 4 ms 2424 KB Output is correct
16 Correct 2 ms 1016 KB Output is correct
17 Correct 47 ms 19508 KB Output is correct
18 Correct 48 ms 19528 KB Output is correct
19 Correct 48 ms 19512 KB Output is correct
20 Correct 22 ms 19448 KB Output is correct
21 Correct 22 ms 19352 KB Output is correct
22 Correct 25 ms 19320 KB Output is correct
23 Correct 20 ms 19448 KB Output is correct
24 Correct 14 ms 14456 KB Output is correct
25 Correct 2 ms 632 KB Output is correct
26 Correct 3 ms 1016 KB Output is correct
27 Correct 7 ms 7096 KB Output is correct
28 Correct 6 ms 5396 KB Output is correct
29 Correct 3 ms 1656 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 8 ms 7164 KB Output is correct
3 Correct 8 ms 7160 KB Output is correct
4 Correct 8 ms 7160 KB Output is correct
5 Correct 7 ms 7160 KB Output is correct
6 Correct 7 ms 7160 KB Output is correct
7 Correct 6 ms 5240 KB Output is correct
8 Correct 6 ms 4984 KB Output is correct
9 Correct 7 ms 7160 KB Output is correct
10 Correct 7 ms 7160 KB Output is correct
11 Correct 7 ms 7160 KB Output is correct
12 Correct 7 ms 7160 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 3 ms 1656 KB Output is correct
15 Correct 4 ms 2424 KB Output is correct
16 Correct 2 ms 1016 KB Output is correct
17 Correct 47 ms 19508 KB Output is correct
18 Correct 48 ms 19528 KB Output is correct
19 Correct 48 ms 19512 KB Output is correct
20 Correct 22 ms 19448 KB Output is correct
21 Correct 22 ms 19352 KB Output is correct
22 Correct 25 ms 19320 KB Output is correct
23 Correct 20 ms 19448 KB Output is correct
24 Correct 14 ms 14456 KB Output is correct
25 Correct 1227 ms 53552 KB Output is correct
26 Correct 1233 ms 53552 KB Output is correct
27 Correct 1232 ms 53496 KB Output is correct
28 Correct 53 ms 53500 KB Output is correct
29 Correct 66 ms 53696 KB Output is correct
30 Correct 66 ms 53496 KB Output is correct
31 Correct 68 ms 53656 KB Output is correct
32 Correct 66 ms 53108 KB Output is correct
33 Correct 2 ms 632 KB Output is correct
34 Correct 3 ms 1016 KB Output is correct
35 Correct 7 ms 7096 KB Output is correct
36 Correct 6 ms 5396 KB Output is correct
37 Correct 3 ms 1656 KB Output is correct

Subtask #4
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 8 ms 7164 KB Output is correct
3 Correct 8 ms 7160 KB Output is correct
4 Correct 8 ms 7160 KB Output is correct
5 Correct 7 ms 7160 KB Output is correct
6 Correct 7 ms 7160 KB Output is correct
7 Correct 6 ms 5240 KB Output is correct
8 Correct 6 ms 4984 KB Output is correct
9 Correct 7 ms 7160 KB Output is correct
10 Correct 7 ms 7160 KB Output is correct
11 Correct 7 ms 7160 KB Output is correct
12 Correct 7 ms 7160 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 3 ms 1656 KB Output is correct
15 Correct 4 ms 2424 KB Output is correct
16 Correct 2 ms 1016 KB Output is correct
17 Correct 47 ms 19508 KB Output is correct
18 Correct 48 ms 19528 KB Output is correct
19 Correct 48 ms 19512 KB Output is correct
20 Correct 22 ms 19448 KB Output is correct
21 Correct 22 ms 19352 KB Output is correct
22 Correct 25 ms 19320 KB Output is correct
23 Correct 20 ms 19448 KB Output is correct
24 Correct 14 ms 14456 KB Output is correct
25 Correct 1227 ms 53552 KB Output is correct
26 Correct 1233 ms 53552 KB Output is correct
27 Correct 1232 ms 53496 KB Output is correct
28 Correct 53 ms 53500 KB Output is correct
29 Correct 66 ms 53696 KB Output is correct
30 Correct 66 ms 53496 KB Output is correct
31 Correct 68 ms 53656 KB Output is correct
32 Correct 66 ms 53108 KB Output is correct
33 Execution timed out 5104 ms 264312 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 223 ms 273272 KB Output is correct
2 Correct 190 ms 232228 KB Output is correct
3 Correct 206 ms 273224 KB Output is correct
4 Correct 2 ms 760 KB Output is correct
5 Correct 208 ms 273272 KB Output is correct
6 Correct 207 ms 273432 KB Output is correct
7 Correct 208 ms 273312 KB Output is correct
8 Correct 233 ms 273144 KB Output is correct
9 Correct 207 ms 273276 KB Output is correct
10 Correct 206 ms 271932 KB Output is correct
11 Correct 208 ms 272612 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 2552 KB Output is correct
2 Correct 1336 ms 918812 KB Output is correct
3 Runtime error 1131 ms 1048580 KB Execution killed with signal 9 (could be triggered by violating memory limits)
4 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1528 KB Output is correct
2 Correct 8 ms 7164 KB Output is correct
3 Correct 8 ms 7160 KB Output is correct
4 Correct 8 ms 7160 KB Output is correct
5 Correct 7 ms 7160 KB Output is correct
6 Correct 7 ms 7160 KB Output is correct
7 Correct 6 ms 5240 KB Output is correct
8 Correct 6 ms 4984 KB Output is correct
9 Correct 7 ms 7160 KB Output is correct
10 Correct 7 ms 7160 KB Output is correct
11 Correct 7 ms 7160 KB Output is correct
12 Correct 7 ms 7160 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 3 ms 1656 KB Output is correct
15 Correct 4 ms 2424 KB Output is correct
16 Correct 2 ms 1016 KB Output is correct
17 Correct 47 ms 19508 KB Output is correct
18 Correct 48 ms 19528 KB Output is correct
19 Correct 48 ms 19512 KB Output is correct
20 Correct 22 ms 19448 KB Output is correct
21 Correct 22 ms 19352 KB Output is correct
22 Correct 25 ms 19320 KB Output is correct
23 Correct 20 ms 19448 KB Output is correct
24 Correct 14 ms 14456 KB Output is correct
25 Correct 1227 ms 53552 KB Output is correct
26 Correct 1233 ms 53552 KB Output is correct
27 Correct 1232 ms 53496 KB Output is correct
28 Correct 53 ms 53500 KB Output is correct
29 Correct 66 ms 53696 KB Output is correct
30 Correct 66 ms 53496 KB Output is correct
31 Correct 68 ms 53656 KB Output is correct
32 Correct 66 ms 53108 KB Output is correct
33 Execution timed out 5104 ms 264312 KB Time limit exceeded
34 Halted 0 ms 0 KB -