fork download
copy 
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. int fun(pair<int,int>a,vector<vector<int>>&rect,int n){
  4.     int count=0;
  5.     for(int i=0;i<n;i++){
  6.         if(a.first>=rect[i][0]&&a.first<=rect[i][2] && a.second>=rect[i][1]&&a.second<=rect[i][3]){
  7.             count++;
  8.         }
  9.     }
  10.     return count;
  11. }
  12. int main(){
  13.     // int n;
  14.     // cin>>n;
  15.     // vector<vector<int>>rect(n,vector<int>(4,-1));
  16.     // for(int i=0;i<n;i++){
  17.     //     cin>>rect[i][0];
  18.     //     cin>>rect[i][1];
  19.     //     cin>>rect[i][2];
  20.     //     cin>>rect[i][3];
  21.     // }
  22.  
  23.     vector<vector<int>>rect={
  24.     {1,1,5,5},
  25.     {2,2,6,6},
  26.     {4,1,7,4},
  27.     {3,3,8,7},
  28.     {5,2,9,5}
  29. };
  30. int n=rect.size();
  31.  
  32.     vector<pair<int,int>>v;
  33.     for(int i=0;i<n;i++){
  34.           int a=rect[i][0];
  35.           int b=rect[i][2];
  36.           for(int j=0;j<n;j++){
  37.               v.push_back({a,rect[j][1]});
  38.               v.push_back({a,rect[j][3]});
  39.               v.push_back({b,rect[j][1]});
  40.               v.push_back({b,rect[j][3]});
  41.           }
  42.     }
  43.     int count=0;
  44.     int ans=1;
  45.     for(int i=0;i<v.size();i++){
  46.         ans=max(ans,fun(v[i],rect,n));
  47.     }
  48.     cout<<ans<<endl;
  49.     return 0;
  50. }
  51.  
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
5
https://ideone.com/OxwCDY
language:
C++ (gcc 8.3)
created:
3 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!