Submission #745664

---

Source Code Expand

 #include <string>
 #include <vector>
 #include <algorithm>
 #include <numeric>
 #include <set>
 #include <map>
 #include <queue>
 #include <iostream>
 #include <sstream>
 #include <cstdio>
 #include <cstdlib>
 #include <cmath>
 #include <ctime>
 #include <cstring>
 #include <cctype>
 #include <cassert>
 #include <limits>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define PB push_back
using namespace std;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll; typedef map<int, int> mii;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }
#define MOD 1000000007
int main() {
  int n;
  cin >> n;
  int w,h;
  mii map,map2;
  rep(i,n){
    cin >> w >> h;
    if(map.find(w)==map.end())
      map.insert(pii(w,h));
    else if (map[w]>h) {
      map[w] = h;
    }
    if(map2.find(h)==map.end())
      map2.insert(pii(h,w));
    else if (map2[h]>w) {
      map2[h] = w;
    }
  }
  int ans = 0;
  auto it = map.begin();
  int pre = it->second;
  while( it != map.end() ){
    //cout << pre << endl;
    if(pre<it->second) {
      ans++;
    } 
    pre = it->second;
    it++;
  }

  int ans2 = 0;
  auto it2 = map2.begin();
  int pre2 = it2->second;
  while( it2 != map2.end() ){
    //cout << pre << endl;
    if(pre2<it2->second) {
      ans2++;
    } 
    pre2 = it2->second;
    it2++;
  }

  if(ans > ans2)
  cout << ans+1 << endl;
  else 
   cout << ans2+1 << endl;   
  return 0;
}

Submission Info

Judge Result