fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. int g[500][500]= {1};
  4. int h[4];
  5. int main(){
  6.     int a,b,c,e=0;
  7.     cin>>a>>b>>c;
  8.  
  9.     for(int i=0; i<c; i++)
  10.     {
  11.     	cin>>h[0]>>h[1]>>h[2]>>h[3];
  12.         if(h[0]>h[2]&&h[1]>h[3])
  13.         {
  14.             for(int k=h[2];k<=h[0];k+=1)
  15.             {int t=0;
  16.                     if(g[k-1][h[3]+t-1]>0)
  17.                     {
  18.                         e++;
  19.                         g[k-1][h[3]+t-1]=0;
  20.                     }
  21.                     t++;
  22.             }
  23.         }
  24.         else if(h[2]>h[0]&&h[3]>h[1])
  25.         {
  26.             for(int k=h[0]; k<=h[2]; k++)
  27.             {int t=0;
  28.                     if(g[k-1][h[1]+t-1]>0)
  29.                     {
  30.                         e++;
  31.                         g[k-1][h[1]+t-1]=0;
  32.                     }
  33.                     t++;
  34.             }
  35.         }
  36.           else if(h[2]>h[0]&&h[3]<h[1])
  37.         {
  38.             for(int k=h[0]; k<=h[2]; k++)
  39.             {int t=0;
  40.                     if(g[k-1][h[1]-t-1]>0)
  41.                     {
  42.                         e++;
  43.                         g[k-1][h[1]-t-1]=0;
  44.                     }
  45.                     t++;
  46.             }
  47.         }
  48.          else if(h[2]<h[0]&&h[3]>h[1])
  49.         {
  50.             for(int k=h[2]; k<=h[0]; k++)
  51.             {int t=0;
  52.                     if(g[k-1][h[3]-t-1]>0)
  53.                     {
  54.                         e++;
  55.                         g[k-1][h[3]-t-1]=0;
  56.                     }
  57.                     t++;
  58.             }
  59.         }
  60.  
  61.         else if(h[2]>h[0])
  62.         {
  63.             for(int k=h[0]; k<=h[2];k++)
  64.             {
  65.  
  66.                 if(g[k-1][h[3]-1]>0)
  67.                 {
  68.                     e++;
  69.                     g[k-1][h[3]-1]=0;
  70.  
  71.                 }
  72.  
  73.  
  74.             }
  75.         }
  76.  
  77.         else if(h[2]<h[0])
  78.         {
  79.             for(int k=h[2]; k<=h[0]; k++)
  80.             {
  81.  
  82.                 if(g[k-1][h[3]-1]>0)
  83.                 {
  84.                     e++;
  85.                     g[k-1][h[3]-1]=0;
  86.                 }
  87.  
  88.  
  89.             }
  90.         }
  91.  
  92.         else if(h[3]<h[1])
  93.         {
  94.             for(int k=h[3]; k<=h[1]; k++)
  95.             {
  96.  
  97.                 if(g[h[2]-1][k-1]>0)
  98.                 {
  99.                     e++;
  100.                     g[h[2]-1][k-1]=0;
  101.                 }
  102.  
  103.  
  104.             }
  105.         }
  106.  
  107.         else if(h[3]>h[1])
  108.         {
  109.             for(int k=h[1]; k<=h[3]; k++)
  110.             {
  111.  
  112.                 if(g[h[2]-1][k-1]>0)
  113.                 {
  114.                     e++;
  115.                     g[h[2]-1][k-1]=0;
  116.                 }
  117.  
  118.  
  119.             }
  120.         }
  121.  
  122.     }
  123.       cout<<e;
  124. }
Success #stdin #stdout 0.01s 5276KB
comments (?)
stdin
copy 
7 8
8
2 8 6 8
4 7 2 5
6 7 4 5
1 5 1 7
7 7 7 5
6 4 2 4
2 3 4 1
6 3 4 1
stdout
copy 
Standard output is empty
https://ideone.com/iSmGVc
language:
C++ (gcc 8.3)
created:
6 days 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!