oj.uz

Submission #959519

# Submission time Handle Problem Language Result Execution time Memory
959519 2024-04-08T11:35:44 Z NemanjaSo2005 Rectangles (IOI19_rect) C++17
0 / 100
 9 ms 2396 KB 
#include "rect.h"
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=2505;
ll res=0;
int N,M,mat[maxn][maxn],maks[maxn];
bool moze[maxn];
ll prebroj(int x,int y){
   ll ret=0;
   for(int j=y;j<=M;j++){
      moze[j]=true;
      maks[j]=mat[x][j];
   }

   for(int i=x;i<N;i++){
      int rmaks=0;
      for(int j=y;j<M;j++){
         rmaks=max(rmaks,mat[i][j]);
         moze[j]&=(rmaks<mat[i][y-1] and  rmaks<mat[i][j+1]);
      }
      for(int j=y;j<M;j++)
         maks[j]=max(maks[j],mat[i][j]);
      for(int j=y;j<M;j++){
         if(!moze[j])
            continue;
         if(maks[j]>=mat[i+1][j])
            continue;
         if(maks[j]>=mat[x-1][j])
            continue;
         ret++;
        //cout<<x<<" "<<y<<" "<<i<<" "<<j<<endl;
      }
   }
   return ret;
}
ll count_rectangles(std::vector<std::vector<int> > inp) {
	N=inp.size();
	M=inp[0].size();
   for(int i=1;i<=N;i++)
      for(int j=1;j<=M;j++)
         mat[i][j]=inp[i-1][j-1];

   for(int i=2;i<N;i++)
      for(int j=2;j<M;j++)
         res+=prebroj(i,j);
   return res;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Incorrect 1 ms 2396 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Incorrect 1 ms 2396 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Incorrect 1 ms 2396 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Incorrect 1 ms 2396 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 600 KB Output is correct
2 Correct 7 ms 348 KB Output is correct
3 Correct 8 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Incorrect 8 ms 600 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Incorrect 1 ms 2396 KB Output isn't correct
7 Halted 0 ms 0 KB -