답안 #954705

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
954705 2024-03-28T11:57:34 Z waldi Rectangles (IOI19_rect) C++17
18 / 100
5000 ms 28284 KB
#include "rect.h"
#include <bits/stdc++.h>
#define FOR(i,p,k) for(int i=(p);i<=(k);++i)
#define REP(i,n) FOR(i,0,(n)-1)
#define ssize(x) (int((x).size()))
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

ll count_rectangles(vector<vector<int>> wej){
	int n = ssize(wej);
	int m = ssize(wej[0]);
	if(n<3 || m<3) return 0ll;
	
	ll wyn = 0ll;
	FOR(lewo, 1, m-2) FOR(prawo, lewo, m-2){
		FOR(gora, 1, n-2) FOR(dol, gora, n-2){
			bool git = 1;
			FOR(i, gora, dol) FOR(j, lewo, prawo){
				if(wej[i][j] >= wej[i][lewo-1]) git = 0;
				if(wej[i][j] >= wej[i][prawo+1]) git = 0;
				if(wej[i][j] >= wej[gora-1][j]) git = 0;
				if(wej[i][j] >= wej[dol+1][j]) git = 0;
			}
			if(git) ++wyn;
		}
	}
	return wyn;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 26 ms 348 KB Output is correct
3 Correct 29 ms 348 KB Output is correct
4 Correct 26 ms 348 KB Output is correct
5 Correct 26 ms 348 KB Output is correct
6 Correct 26 ms 348 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 26 ms 348 KB Output is correct
10 Correct 26 ms 344 KB Output is correct
11 Correct 26 ms 348 KB Output is correct
12 Correct 26 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 26 ms 432 KB Output is correct
20 Correct 3 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 26 ms 348 KB Output is correct
3 Correct 29 ms 348 KB Output is correct
4 Correct 26 ms 348 KB Output is correct
5 Correct 26 ms 348 KB Output is correct
6 Correct 26 ms 348 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 26 ms 348 KB Output is correct
10 Correct 26 ms 344 KB Output is correct
11 Correct 26 ms 348 KB Output is correct
12 Correct 26 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 26 ms 432 KB Output is correct
20 Correct 3 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Execution timed out 5021 ms 344 KB Time limit exceeded
23 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 26 ms 348 KB Output is correct
3 Correct 29 ms 348 KB Output is correct
4 Correct 26 ms 348 KB Output is correct
5 Correct 26 ms 348 KB Output is correct
6 Correct 26 ms 348 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 26 ms 348 KB Output is correct
10 Correct 26 ms 344 KB Output is correct
11 Correct 26 ms 348 KB Output is correct
12 Correct 26 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Execution timed out 5021 ms 344 KB Time limit exceeded
18 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 26 ms 348 KB Output is correct
3 Correct 29 ms 348 KB Output is correct
4 Correct 26 ms 348 KB Output is correct
5 Correct 26 ms 348 KB Output is correct
6 Correct 26 ms 348 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 26 ms 348 KB Output is correct
10 Correct 26 ms 344 KB Output is correct
11 Correct 26 ms 348 KB Output is correct
12 Correct 26 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Execution timed out 5021 ms 344 KB Time limit exceeded
18 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 3810 ms 480 KB Output is correct
2 Correct 2381 ms 468 KB Output is correct
3 Correct 3823 ms 472 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 3815 ms 472 KB Output is correct
6 Correct 3838 ms 476 KB Output is correct
7 Correct 3848 ms 472 KB Output is correct
8 Correct 3901 ms 496 KB Output is correct
9 Correct 3864 ms 476 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 26 ms 432 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Execution timed out 5043 ms 28284 KB Time limit exceeded
8 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 26 ms 348 KB Output is correct
3 Correct 29 ms 348 KB Output is correct
4 Correct 26 ms 348 KB Output is correct
5 Correct 26 ms 348 KB Output is correct
6 Correct 26 ms 348 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 26 ms 348 KB Output is correct
10 Correct 26 ms 344 KB Output is correct
11 Correct 26 ms 348 KB Output is correct
12 Correct 26 ms 348 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Execution timed out 5021 ms 344 KB Time limit exceeded
18 Halted 0 ms 0 KB -