Submission #1991945

---

Source Code Expand

#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <functional>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cassert>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> P;
#define rep(i,a,n) for(ll i = (a);i < (n);i++)
#define per(i,a,n) for(ll i = (a);i > (n);i--)
#define lep(i,a,n) for(ll i = (a);i <= (n);i++)
#define pel(i,a,n) for(ll i = (a);i >= (n);i--)
#define clr(a,b) memset((a),(b),sizeof(a))
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(),(c).end()
#define sz size()
#define print(X) cout << (X) << endl
const ll INF = 1e+9+7;
ll n,m,l;
string s,t;
ll d[100000],dp[100][100];

int main(){
  cin >> n;
  int p[10];
  rep(i,0,n)cin >> d[i];
  rep(i,0,n){
    if(d[i] >= 3200){
      p[7]++;
    }else {
      p[d[i]/400]++;
    }
  }
  rep(i,0,7){
    if(p[i] != 0){
      m++;
      l++;
    }
  }
  if(p[7] != 0)m++;
  if(m > 8)printf("8 ");
  else printf("%lld ",m);
  l += p[7];
  if(l > 8)l = 8;
  print(l);
  return 0;
}

Submission Info

Judge Result