Language: C++

//39
#include<iostream>
#include<algorithm>
#include<vector>
#include<utility>

using namespace std;

int main(){
  for(int n,r;cin>>n>>r,n|r;){
    vector<pair<short,short> >v[10000];
    for(int i=0;i<n;i++){
      int x,y,xx,yy;
      cin>>x>>y>>xx>>yy;
      for(int j=y;j<yy;j++){
	v[j].push_back(make_pair(x,xx));
      }
    }
    for(int i=0;i<10000;i++){
      sort(v[i].begin(),v[i].end());
      for(int j=0;j<v[i].size();j++){
	int m=v[i][j].second;
	int k;
	for(k=j+1;k<v[i].size()&&v[i][k].first<=m;k++){
	  m=max(m,v[i][k].second);
	}
	v[i][j].second=m;
	v[i].erase(v[i].begin()+j+1,v[i].begin()+k);
      }
    }
    int a=0;
    for(int i=0;i<10000;i++){
      for(int j=0;j<v[i].size();j++){
	a+=v[i][j].second-v[i][j].first;
      }
    }
    cout<<a<<endl;
    if(r==2){
      int l=0;
      bool b[2][10000]={};
      for(int i=0;i<10000;i++){
	l+=v[i].size()*2;
	fill(b[i&1],b[(i&1)+1],false);
	for(int j=0;j<v[i].size();j++){
	  for(int k=v[i][j].first;k<v[i][j].second;k++){
	    b[i&1][k]=true;
	  }
	}
	for(int j=0;j<10000;j++){
	  l+=b[i&1][j]^b[!(i&1)][j];
	}
      }
      l+=count(b[1],b[2],true);
      cout<<l<<endl;
    }
  }
  return 0;
}

Compiler output:
a.cc: In function 'int main()':
a.cc:25:16: error: no matching function for call to 'max(int&, short int&)'
   25 |           m=max(m,v[i][k].second);
      |             ~~~^~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/14/string:51,
                 from /usr/include/c++/14/bits/locale_classes.h:40,
                 from /usr/include/c++/14/bits/ios_base.h:41,
                 from /usr/include/c++/14/ios:44,
                 from /usr/include/c++/14/ostream:40,
                 from /usr/include/c++/14/iostream:41,
                 from a.cc:2:
/usr/include/c++/14/bits/stl_algobase.h:257:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
a.cc:25:16: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'short int')
   25 |           m=max(m,v[i][k].second);
      |             ~~~^~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  303 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:303:5: note:   candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:61,
                 from a.cc:3:
/usr/include/c++/14/bits/stl_algo.h:5706:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)'
 5706 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5706:5: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5716:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)'
 5716 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5716:5: note:   template argument deduction/substitution failed:
a.cc:25:16: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   25 |           m=max(m,v[i][k].second);
      |             ~~~^~~~~~~~~~~~~~~~~~