oj.uz

답안 #823585

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
823585 2023-08-12T19:41:44 Z oscar1f Rectangles (IOI19_rect) C++17
59 / 100
 5000 ms 292988 KB 
#include<bits/stdc++.h>
#include "rect.h"

using namespace std;
using ll=long long;

const ll TAILLE_MAX=2505;
ll rep,nbLig,nbCol;
ll val[TAILLE_MAX][TAILLE_MAX];
ll limite[TAILLE_MAX][TAILLE_MAX][4];
ll limCalc[TAILLE_MAX][2];

bool checkCol(ll col,ll ligHaut,ll ligBas) {
	if (limite[ligHaut-1][col][3]>=ligBas and limite[ligBas+1][col][2]<=ligHaut) {
		return true;
	}
	return false;
}

void calc(ll ligHaut,ll ligBas,ll colGau,ll colDroi) {
	//cout<<ligHaut<<" "<<ligBas<<" "<<colGau<<" "<<colDroi<<" : ";
	for (ll i=colGau-1;i<=colDroi+1;i++) {
		limCalc[i][0]=0;
		for (ll j=ligHaut;j<=ligBas;j++) {
			limCalc[i][0]=max(limCalc[i][0],limite[j][i][0]);
		}
		limCalc[i][1]=nbCol-1;
		for (ll j=ligHaut;j<=ligBas;j++) {
			limCalc[i][1]=min(limCalc[i][1],limite[j][i][1]);
		}
		//cout<<i<<" "<<limCalc[i][0]<<" "<<limCalc[i][1]<<"   ";
	}
	//cout<<endl;
	for (ll i=colGau;i<=colDroi;i++) {
		for (ll j=i;j<=colDroi;j++) {
			if (limCalc[i-1][1]>=j and limCalc[j+1][0]<=i) {
				//cout<<"! "<<ligHaut<<" "<<ligBas<<" "<<i<<" "<<j<<endl;
				rep++;
			}
		}
	}
}

ll count_rectangles(vector<vector<int>> a) {
	nbLig=a.size();
	nbCol=a[0].size();
	if (nbLig<=2 or nbCol<=2) {
		return 0;
	}
	for (ll i=0;i<nbLig;i++) {
		for (ll j=0;j<nbCol;j++) {
			val[i][j]=a[i][j];
		}
	}
	ll deb,pos;
	for (ll i=0;i<nbLig;i++) {
		for (ll j=0;j<nbCol;j++) {
			pos=j;
			while (pos>0 and val[i][j]>val[i][pos-1]) {
				pos--;
			}
			limite[i][j][0]=pos;
			pos=j;
			while (pos<nbCol-1 and val[i][j]>val[i][pos+1]) {
				pos++;
			}
			limite[i][j][1]=pos;
			pos=i;
			while (pos>0 and val[i][j]>val[pos-1][j]) {
				pos--;
			}
			limite[i][j][2]=pos;
			pos=i;
			while (pos<nbLig-1 and val[i][j]>val[pos+1][j]) {
				pos++;
			}
			limite[i][j][3]=pos;
			//cout<<i<<" "<<j<<" : "<<limite[i][j][0]<<" "<<limite[i][j][1]<<endl;
		}
	}
	for (ll ligHaut=1;ligHaut<nbLig-1;ligHaut++) {
		for (ll ligBas=ligHaut;ligBas<nbLig-1;ligBas++) {
			pos=1;
			while (pos<nbCol-1) {
				deb=pos;
				while (pos<nbCol-1 and checkCol(pos,ligHaut,ligBas)) {
					pos++;
				}
				if (pos>deb) {
					calc(ligHaut,ligBas,deb,pos-1);
				}
				pos++;
			}
		}
	}
	return rep;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 0 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 596 KB Output is correct
20 Correct 0 ms 468 KB Output is correct
21 Correct 0 ms 212 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 0 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 596 KB Output is correct
20 Correct 0 ms 468 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 2 ms 1236 KB Output is correct
23 Correct 2 ms 1236 KB Output is correct
24 Correct 2 ms 1236 KB Output is correct
25 Correct 1 ms 1236 KB Output is correct
26 Correct 2 ms 1236 KB Output is correct
27 Correct 2 ms 1236 KB Output is correct
28 Correct 2 ms 1236 KB Output is correct
29 Correct 1 ms 1108 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 0 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 2 ms 1236 KB Output is correct
18 Correct 2 ms 1236 KB Output is correct
19 Correct 2 ms 1236 KB Output is correct
20 Correct 1 ms 1236 KB Output is correct
21 Correct 2 ms 1236 KB Output is correct
22 Correct 2 ms 1236 KB Output is correct
23 Correct 2 ms 1236 KB Output is correct
24 Correct 1 ms 1108 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 596 KB Output is correct
28 Correct 0 ms 468 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 22 ms 3812 KB Output is correct
31 Correct 22 ms 3796 KB Output is correct
32 Correct 30 ms 3812 KB Output is correct
33 Correct 7 ms 3796 KB Output is correct
34 Correct 11 ms 3836 KB Output is correct
35 Correct 11 ms 3812 KB Output is correct
36 Correct 10 ms 3796 KB Output is correct
37 Correct 10 ms 3796 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 0 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 2 ms 1236 KB Output is correct
18 Correct 2 ms 1236 KB Output is correct
19 Correct 2 ms 1236 KB Output is correct
20 Correct 1 ms 1236 KB Output is correct
21 Correct 2 ms 1236 KB Output is correct
22 Correct 2 ms 1236 KB Output is correct
23 Correct 2 ms 1236 KB Output is correct
24 Correct 1 ms 1108 KB Output is correct
25 Correct 22 ms 3812 KB Output is correct
26 Correct 22 ms 3796 KB Output is correct
27 Correct 30 ms 3812 KB Output is correct
28 Correct 7 ms 3796 KB Output is correct
29 Correct 11 ms 3836 KB Output is correct
30 Correct 11 ms 3812 KB Output is correct
31 Correct 10 ms 3796 KB Output is correct
32 Correct 10 ms 3796 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 596 KB Output is correct
36 Correct 0 ms 468 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 685 ms 29048 KB Output is correct
39 Correct 709 ms 29008 KB Output is correct
40 Correct 770 ms 29056 KB Output is correct
41 Correct 742 ms 29044 KB Output is correct
42 Correct 966 ms 29052 KB Output is correct
43 Correct 979 ms 29080 KB Output is correct
44 Correct 1048 ms 29052 KB Output is correct
45 Correct 870 ms 27156 KB Output is correct
46 Correct 193 ms 29012 KB Output is correct
47 Correct 190 ms 29052 KB Output is correct
48 Correct 273 ms 29052 KB Output is correct
49 Correct 271 ms 28964 KB Output is correct
50 Correct 135 ms 17540 KB Output is correct
51 Correct 93 ms 14660 KB Output is correct
52 Correct 222 ms 29056 KB Output is correct
53 Correct 231 ms 29052 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 596 KB Output is correct
2 Correct 5 ms 596 KB Output is correct
3 Correct 0 ms 596 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 596 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1744 ms 141624 KB Output is correct
8 Execution timed out 5093 ms 292988 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 0 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 2 ms 1236 KB Output is correct
18 Correct 2 ms 1236 KB Output is correct
19 Correct 2 ms 1236 KB Output is correct
20 Correct 1 ms 1236 KB Output is correct
21 Correct 2 ms 1236 KB Output is correct
22 Correct 2 ms 1236 KB Output is correct
23 Correct 2 ms 1236 KB Output is correct
24 Correct 1 ms 1108 KB Output is correct
25 Correct 22 ms 3812 KB Output is correct
26 Correct 22 ms 3796 KB Output is correct
27 Correct 30 ms 3812 KB Output is correct
28 Correct 7 ms 3796 KB Output is correct
29 Correct 11 ms 3836 KB Output is correct
30 Correct 11 ms 3812 KB Output is correct
31 Correct 10 ms 3796 KB Output is correct
32 Correct 10 ms 3796 KB Output is correct
33 Correct 685 ms 29048 KB Output is correct
34 Correct 709 ms 29008 KB Output is correct
35 Correct 770 ms 29056 KB Output is correct
36 Correct 742 ms 29044 KB Output is correct
37 Correct 966 ms 29052 KB Output is correct
38 Correct 979 ms 29080 KB Output is correct
39 Correct 1048 ms 29052 KB Output is correct
40 Correct 870 ms 27156 KB Output is correct
41 Correct 193 ms 29012 KB Output is correct
42 Correct 190 ms 29052 KB Output is correct
43 Correct 273 ms 29052 KB Output is correct
44 Correct 271 ms 28964 KB Output is correct
45 Correct 135 ms 17540 KB Output is correct
46 Correct 93 ms 14660 KB Output is correct
47 Correct 222 ms 29056 KB Output is correct
48 Correct 231 ms 29052 KB Output is correct
49 Correct 8 ms 596 KB Output is correct
50 Correct 5 ms 596 KB Output is correct
51 Correct 0 ms 596 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 1 ms 596 KB Output is correct
54 Correct 1 ms 596 KB Output is correct
55 Correct 1 ms 596 KB Output is correct
56 Correct 1 ms 596 KB Output is correct
57 Correct 1 ms 596 KB Output is correct
58 Correct 0 ms 212 KB Output is correct
59 Correct 0 ms 340 KB Output is correct
60 Correct 0 ms 340 KB Output is correct
61 Correct 1744 ms 141624 KB Output is correct
62 Execution timed out 5093 ms 292988 KB Time limit exceeded
63 Halted 0 ms 0 KB -