Submission #1341119

---

Source Code Expand

#include <algorithm>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
 
#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v), end(v)
#define debug(x) cerr<< #x <<": "<<x<<endl
#define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl
 
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
typedef deque<bool> db;
template<class T> using vv=vector<vector< T > >;

int main() {
  int n;
  scanf("%d", &n);
  vi acc(9, 0);
  int b;
  rep (i, n) {
    scanf("%d", &b);
    acc[min(8, b / 400)] += 1;
  }
  int mi = 0;
  int ma = 0;
  rep (i, 7) {
    if (acc[i] > 0) {
      mi += 1;
    }
  }
  if (acc[7] > 0 || acc[8] > 0) {
    mi += 1;
  }

  rep (i, 7) {
    if (acc[i] > 0) {
      ma += 1;
    } else if (acc[8] > 0) {
      ma += 1;
      acc[8] -= 1;
    }
  }
  if (acc[7] > 0 || acc[8] > 0) {
    ma += 1;
  }

  printf("%d %d\n", mi, ma);
  
  return 0;
}

Submission Info

Judge Result