이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vint vector<int>
#define vll vector<long long>
#define fo(a, b, c) for (int a = b; a < (int)c; a++)
#define rfo(a, b, c) for (int a = b - 1; a >= (int)c; a--)
#define print(x) cout << x << "\n"
ll count_rectangles(vector<vint> grid)
{
int n = grid.size();
int m = grid[0].size();
if(n <=2 || m <= 2){
return 0;
}
ll count=0;
bool work=true;
int maxEdge = max(grid[1][0], grid[1][m-1]);
//subtask 5
fo(i,1,m-1){
fo(j,i,m-1){
fo(x,i,j+1){
int val = grid[1][x];
if(val >= maxEdge || val >= grid[0][x] || val >= grid[2][x])
{
work=false;
break;
}
}
if(work){
count++;
}
}
}
return count;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |