oj.uz

답안 #297673

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
297673 2020-09-11T17:46:56 Z shayan_p Rectangles (IOI19_rect) C++17
50 / 100
 5000 ms 172536 KB 
#include<bits/stdc++.h>
#include "rect.h"

#define F first
#define S second
#define PB push_back
#define sz(s) (int(s.size()))
#define bit(n, k) (((n)>>(k))&1)

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int maxn = 2510;

vector<vector<int>> a;
int aftx[maxn][maxn], befx[maxn][maxn], afty[maxn][maxn], befy[maxn][maxn];
int n, m;

bool ok(int LX, int RX, int LY, int RY, int i, int j){
    if(LX <= 0 || LY <= 0 || RX >= n-1 || RY >= m-1 || LX > RX || LY > RY)
	return 0;    
    bool ok = 1;
    for(int x = LX; x <= RX; x++){
	for(int y = LY; y <= RY; y++){
	    ok&= a[i][j] >= a[x][y];
	    if((pii){x, y} > (pii){i, j})
		ok&= a[i][j] > a[x][y];
	    ok&= befx[x][y] >= LY - 1;
	    ok&= befy[x][y] >= LX - 1;
	    ok&= aftx[x][y] <= RY + 1;
	    ok&= afty[x][y] <= RX + 1;
	}
    }
    return ok;
}

ll count_rectangles(vector< vector<int> > a){
    ::a = a;
    n = sz(a);
    m = sz(a[0]);
    for(int i = 0; i < n; i++){
	for(int j = 0; j < m; j++){
	    befx[i][j] = j-1;
	    while(befx[i][j] >= 0 && a[i][befx[i][j]] <= a[i][j])
		befx[i][j] = befx[i][ befx[i][j] ];
	}
	for(int j = m-1; j >= 0; j--){
	    aftx[i][j] = j+1;
	    while(aftx[i][j] < m && a[i][aftx[i][j]] <= a[i][j])
		aftx[i][j] = aftx[i][ aftx[i][j] ];
	}
    }
    for(int j = 0; j < m; j++){
	for(int i = 0; i < n; i++){
	    befy[i][j] = i-1;
	    while(befy[i][j] >= 0 && a[befy[i][j]][j] <= a[i][j])
		befy[i][j] = befy[ befy[i][j] ][j];
	}
	for(int i = n-1; i >= 0; i--){
	    afty[i][j] = i+1;
	    while(afty[i][j] < n && a[afty[i][j]][j] <= a[i][j])
		afty[i][j] = afty[ afty[i][j] ][j];
	}	
    }
    
    ll ans = 0;
    for(int i = 0; i < n; i++){
	for(int j = 0; j < m; j++){
	    ans+= ok(befy[i][j] + 1, afty[i][j] - 1, befx[i][j] + 1, aftx[i][j] - 1, i, j);
	}
    }
    return ans;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 896 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 896 KB Output is correct
5 Correct 1 ms 896 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 896 KB Output is correct
10 Correct 1 ms 896 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 896 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 544 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 30 ms 1792 KB Output is correct
18 Correct 30 ms 1792 KB Output is correct
19 Correct 31 ms 1848 KB Output is correct
20 Correct 2 ms 1792 KB Output is correct
21 Correct 3 ms 1792 KB Output is correct
22 Correct 3 ms 1792 KB Output is correct
23 Correct 3 ms 1920 KB Output is correct
24 Correct 2 ms 1792 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 416 KB Output is correct
27 Correct 1 ms 896 KB Output is correct
28 Correct 1 ms 768 KB Output is correct
29 Correct 1 ms 512 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 896 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 896 KB Output is correct
5 Correct 1 ms 896 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 896 KB Output is correct
10 Correct 1 ms 896 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 896 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 544 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 30 ms 1792 KB Output is correct
18 Correct 30 ms 1792 KB Output is correct
19 Correct 31 ms 1848 KB Output is correct
20 Correct 2 ms 1792 KB Output is correct
21 Correct 3 ms 1792 KB Output is correct
22 Correct 3 ms 1792 KB Output is correct
23 Correct 3 ms 1920 KB Output is correct
24 Correct 2 ms 1792 KB Output is correct
25 Correct 1217 ms 4728 KB Output is correct
26 Correct 1205 ms 4728 KB Output is correct
27 Correct 1219 ms 4728 KB Output is correct
28 Correct 7 ms 4608 KB Output is correct
29 Correct 19 ms 4608 KB Output is correct
30 Correct 21 ms 4608 KB Output is correct
31 Correct 26 ms 4736 KB Output is correct
32 Correct 18 ms 4608 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 416 KB Output is correct
35 Correct 1 ms 896 KB Output is correct
36 Correct 1 ms 768 KB Output is correct
37 Correct 1 ms 512 KB Output is correct

Subtask #4
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 896 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 896 KB Output is correct
5 Correct 1 ms 896 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 896 KB Output is correct
10 Correct 1 ms 896 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 896 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 544 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 30 ms 1792 KB Output is correct
18 Correct 30 ms 1792 KB Output is correct
19 Correct 31 ms 1848 KB Output is correct
20 Correct 2 ms 1792 KB Output is correct
21 Correct 3 ms 1792 KB Output is correct
22 Correct 3 ms 1792 KB Output is correct
23 Correct 3 ms 1920 KB Output is correct
24 Correct 2 ms 1792 KB Output is correct
25 Correct 1217 ms 4728 KB Output is correct
26 Correct 1205 ms 4728 KB Output is correct
27 Correct 1219 ms 4728 KB Output is correct
28 Correct 7 ms 4608 KB Output is correct
29 Correct 19 ms 4608 KB Output is correct
30 Correct 21 ms 4608 KB Output is correct
31 Correct 26 ms 4736 KB Output is correct
32 Correct 18 ms 4608 KB Output is correct
33 Correct 55 ms 25080 KB Output is correct
34 Correct 52 ms 24984 KB Output is correct
35 Correct 55 ms 25080 KB Output is correct
36 Correct 52 ms 25080 KB Output is correct
37 Execution timed out 5023 ms 25080 KB Time limit exceeded
38 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 512 KB Output is correct
2 Correct 7 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 640 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 512 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 354 ms 82552 KB Output is correct
3 Correct 827 ms 171512 KB Output is correct
4 Correct 789 ms 172408 KB Output is correct
5 Correct 801 ms 172536 KB Output is correct
6 Correct 247 ms 85240 KB Output is correct
7 Correct 475 ms 167672 KB Output is correct
8 Correct 509 ms 172408 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 416 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 768 KB Output is correct
13 Correct 1 ms 512 KB Output is correct

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 896 KB Output is correct
3 Correct 1 ms 896 KB Output is correct
4 Correct 1 ms 896 KB Output is correct
5 Correct 1 ms 896 KB Output is correct
6 Correct 1 ms 896 KB Output is correct
7 Correct 1 ms 768 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 896 KB Output is correct
10 Correct 1 ms 896 KB Output is correct
11 Correct 1 ms 896 KB Output is correct
12 Correct 1 ms 896 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 544 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 30 ms 1792 KB Output is correct
18 Correct 30 ms 1792 KB Output is correct
19 Correct 31 ms 1848 KB Output is correct
20 Correct 2 ms 1792 KB Output is correct
21 Correct 3 ms 1792 KB Output is correct
22 Correct 3 ms 1792 KB Output is correct
23 Correct 3 ms 1920 KB Output is correct
24 Correct 2 ms 1792 KB Output is correct
25 Correct 1217 ms 4728 KB Output is correct
26 Correct 1205 ms 4728 KB Output is correct
27 Correct 1219 ms 4728 KB Output is correct
28 Correct 7 ms 4608 KB Output is correct
29 Correct 19 ms 4608 KB Output is correct
30 Correct 21 ms 4608 KB Output is correct
31 Correct 26 ms 4736 KB Output is correct
32 Correct 18 ms 4608 KB Output is correct
33 Correct 55 ms 25080 KB Output is correct
34 Correct 52 ms 24984 KB Output is correct
35 Correct 55 ms 25080 KB Output is correct
36 Correct 52 ms 25080 KB Output is correct
37 Execution timed out 5023 ms 25080 KB Time limit exceeded
38 Halted 0 ms 0 KB -