oj.uz

Submission #286040

# Submission time Handle Problem Language Result Execution time Memory
286040 2020-08-30T01:55:41 Z DanerZein Rectangles (IOI19_rect) C++14
50 / 100
 1924 ms 362788 KB 
#include "rect.h"
#include <bits/stdc++.h>
using namespace std;
#define MAX 1000000000
typedef vector<int> vi;
vector<vi> b;
int vis[2510][2510];
int Y[4]={-1,0,1,0};
int X[4]={0,-1,0,1};
int c1,r1,c2,r2;
bool sw1=0;
int flod(int y,int x){
  //cout<<y<<" "<<x<<endl;
  c1=min(c1,x);
  r1=min(r1,y);
  c2=max(c2,x);
  r2=max(r2,y);
  vis[y][x]=1;
  int ans=1;
  for(int i=0;i<4;i++){
    if(y+Y[i]<b.size()-1 and y+Y[i]>=1 and x+X[i]<b[0].size()-1 and x+X[i]>=1){
      if(b[y+Y[i]][x+X[i]]==0 and !vis[y+Y[i]][x+X[i]])
      ans+=flod(y+Y[i],x+X[i]);
    }
    else{
      if(b[y+Y[i]][x+X[i]]==0){
	sw1=1;
      }
    }
  }
  return ans;
}
long long count_rectangles(std::vector<std::vector<int> > a) {
  //cout<<"llamado\n";
  long long c=0;
   if((a.size()<=200 and b.size()<=200) or (a.size()<=3 and b.size()<=2500)){
  //if(c==1){
     //cout<<"if\n";
    for(int i=1;i<a.size()-1;i++){
      for(int j=1;j<a[i].size()-1;j++){
	for(int k=i;k<a.size()-1;k++){
	  for(int l=j;l<a[k].size()-1;l++){
	    bool sw=0;
	    for(int y=i;y<=k;y++){
	      for(int x=j;x<=l;x++){
		if(a[y][x]>=a[y][j-1] or a[y][x]>=a[y][l+1] or a[y][x]>=a[k+1][x] or a[y][x]>=a[i-1][x]){
		  sw=1;
		  break;
		}
	      }
	      if(sw==1) break;
	    }
	    if(sw==0){
	    c++;
	    }
	  }
	}
      }
    }
  }
  else{
    memset(vis,0,sizeof vis);
    b=a;
    // cout<<"else\n";
    for(int i=1;i<a.size()-1;i++){
      for(int j=1;j<a[i].size()-1;j++){
	if(a[i][j]==0 and !vis[i][j]){
	  c1=r1=MAX;
	  c2=r2=-MAX;
	   sw1=0;
	  int ar=flod(i,j);
	  //cout<<i<<" "<<j<<" "<<sw1<<endl;
	  if((abs(c1-c2)+1)*(abs(r1-r2)+1)==ar and sw1==0) c++;
	}
      }
    }
  }
  return c;
}

Compilation message

rect.cpp: In function 'int flod(int, int)':
rect.cpp:21:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     if(y+Y[i]<b.size()-1 and y+Y[i]>=1 and x+X[i]<b[0].size()-1 and x+X[i]>=1){
      |        ~~~~~~^~~~~~~~~~~
rect.cpp:21:50: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     if(y+Y[i]<b.size()-1 and y+Y[i]>=1 and x+X[i]<b[0].size()-1 and x+X[i]>=1){
      |                                            ~~~~~~^~~~~~~~~~~~~~
rect.cpp: In function 'long long int count_rectangles(std::vector<std::vector<int> >)':
rect.cpp:39:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for(int i=1;i<a.size()-1;i++){
      |                 ~^~~~~~~~~~~
rect.cpp:40:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |       for(int j=1;j<a[i].size()-1;j++){
      |                   ~^~~~~~~~~~~~~~
rect.cpp:41:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |  for(int k=i;k<a.size()-1;k++){
      |              ~^~~~~~~~~~~
rect.cpp:42:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |    for(int l=j;l<a[k].size()-1;l++){
      |                ~^~~~~~~~~~~~~~
rect.cpp:65:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |     for(int i=1;i<a.size()-1;i++){
      |                 ~^~~~~~~~~~~
rect.cpp:66:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |       for(int j=1;j<a[i].size()-1;j++){
      |                   ~^~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 0 ms 256 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 57 ms 412 KB Output is correct
18 Correct 51 ms 504 KB Output is correct
19 Correct 48 ms 384 KB Output is correct
20 Correct 42 ms 384 KB Output is correct
21 Correct 46 ms 384 KB Output is correct
22 Correct 47 ms 384 KB Output is correct
23 Correct 47 ms 384 KB Output is correct
24 Correct 12 ms 384 KB Output is correct
25 Correct 0 ms 256 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 1 ms 256 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 57 ms 412 KB Output is correct
18 Correct 51 ms 504 KB Output is correct
19 Correct 48 ms 384 KB Output is correct
20 Correct 42 ms 384 KB Output is correct
21 Correct 46 ms 384 KB Output is correct
22 Correct 47 ms 384 KB Output is correct
23 Correct 47 ms 384 KB Output is correct
24 Correct 12 ms 384 KB Output is correct
25 Correct 1885 ms 760 KB Output is correct
26 Correct 1846 ms 692 KB Output is correct
27 Correct 1924 ms 684 KB Output is correct
28 Correct 1693 ms 652 KB Output is correct
29 Correct 1897 ms 640 KB Output is correct
30 Correct 1902 ms 640 KB Output is correct
31 Correct 1837 ms 692 KB Output is correct
32 Correct 1781 ms 764 KB Output is correct
33 Correct 0 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 1 ms 256 KB Output is correct
37 Correct 0 ms 256 KB Output is correct

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 57 ms 412 KB Output is correct
18 Correct 51 ms 504 KB Output is correct
19 Correct 48 ms 384 KB Output is correct
20 Correct 42 ms 384 KB Output is correct
21 Correct 46 ms 384 KB Output is correct
22 Correct 47 ms 384 KB Output is correct
23 Correct 47 ms 384 KB Output is correct
24 Correct 12 ms 384 KB Output is correct
25 Correct 1885 ms 760 KB Output is correct
26 Correct 1846 ms 692 KB Output is correct
27 Correct 1924 ms 684 KB Output is correct
28 Correct 1693 ms 652 KB Output is correct
29 Correct 1897 ms 640 KB Output is correct
30 Correct 1902 ms 640 KB Output is correct
31 Correct 1837 ms 692 KB Output is correct
32 Correct 1781 ms 764 KB Output is correct
33 Incorrect 31 ms 30840 KB Output isn't correct
34 Halted 0 ms 0 KB -

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 384 KB Output is correct
2 Correct 11 ms 384 KB Output is correct
3 Correct 10 ms 384 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 18 ms 512 KB Output is correct
6 Correct 17 ms 384 KB Output is correct
7 Correct 18 ms 384 KB Output is correct
8 Correct 19 ms 384 KB Output is correct
9 Correct 16 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 143 ms 58744 KB Output is correct
3 Correct 284 ms 99496 KB Output is correct
4 Correct 290 ms 99832 KB Output is correct
5 Correct 288 ms 99832 KB Output is correct
6 Correct 286 ms 146808 KB Output is correct
7 Correct 662 ms 310652 KB Output is correct
8 Correct 762 ms 362788 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 57 ms 412 KB Output is correct
18 Correct 51 ms 504 KB Output is correct
19 Correct 48 ms 384 KB Output is correct
20 Correct 42 ms 384 KB Output is correct
21 Correct 46 ms 384 KB Output is correct
22 Correct 47 ms 384 KB Output is correct
23 Correct 47 ms 384 KB Output is correct
24 Correct 12 ms 384 KB Output is correct
25 Correct 1885 ms 760 KB Output is correct
26 Correct 1846 ms 692 KB Output is correct
27 Correct 1924 ms 684 KB Output is correct
28 Correct 1693 ms 652 KB Output is correct
29 Correct 1897 ms 640 KB Output is correct
30 Correct 1902 ms 640 KB Output is correct
31 Correct 1837 ms 692 KB Output is correct
32 Correct 1781 ms 764 KB Output is correct
33 Incorrect 31 ms 30840 KB Output isn't correct
34 Halted 0 ms 0 KB -