Submission #2025521
Source Code Expand
#include <iostream>
#include <iomanip>
#include <vector>
#include <valarray>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <stack>
#include <bitset>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <complex>
#include <string>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cmath>
using namespace std;
#define all(c) c.begin(),c.end()
#define repeat(i,n) for(int i=0;i<static_cast<int>(n);i++)
#define debug(x) #x << "=" << (x)
#define dump(x) cerr << debug(x) << " (L:" << __LINE__ << ")"<< endl
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<long> vl;
typedef vector<vector<long> > vvl;
typedef vector<string> vs;
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& vec){
os << "[";
for(int i = 0; i < vec.size(); i++){
os << vec[i] << ",";
}
os << "]";
return os;
}
template<typename T>
T input(){
T t;
cin >> t;
return t;
}
template<typename T>
vector<T> input(const int N){
vector<T> v(N);
repeat(i,N) cin >> v[i];
return v;
}
long long gcd(long long a, long long b){
if(b == 0){
return a;
}
return gcd(b, a % b);
}
long long lcm(long long a, long long b){
return (a / gcd(a, b)) * b;
}
long long mul(const long long& a, const long long& b, const long long& mod) {
return ((a % mod) * (b % mod)) % mod;
}
long long power(const long long& x, const long long& y, const long long& mod) {
if (y == 0) {
return 1;
} else if (y == 1) {
return x % mod;
} else {
long long value = power(x, y / 2, mod);
if (y % 2 == 0) {
return mul(value, value, mod);
} else {
return mul(value, value, mod) * x % mod;
}
}
}
long long div(const long long& a, const long long& b, const long long& mod) {
return mul(a, power(b, mod - 2, mod), mod);
}
map<long long, long long> factorials;
long long factorial(const long long& n, const long long& mod) {
if (n == 0 || n == 1) {
return 1;
}
if (factorials[n] != 0) {
return factorials[n];
}
factorials[n] = n * factorial(n - 1, mod) % mod;
return factorials[n] % mod;
}
long long combination(const long long& n, const long long& x, const long long& mod) {
long long numerator = 1;
long long denominator = 1;
repeat(i, x) {
numerator *= (n - i) % mod;
numerator %= mod;
denominator *= (i + 1) % mod;
denominator %= mod;
}
return div(numerator, denominator, mod);
}
int main(){
const int RATE_GRAY = 399;
const int RATE_BROWN = 799;
const int RATE_GREEN = 1199;
const int RATE_LIGHT_BLUE = 1599;
const int RATE_DARK_BLUE = 1999;
const int RATE_YELLOW = 2399;
const int RATE_ORANGE = 2799;
const int RATE_RED = 3199;
const int RATE_ANY = 3200;
int N;
cin >> N;
int rate;
map<int, int> playerGroups;
int minimum = 0;
int maximum = 0;
repeat (i, N) {
cin >> rate;
if (0 < rate && rate <= RATE_GRAY) {
playerGroups[RATE_GRAY] += 1;
if (playerGroups[RATE_GRAY] == 1) {
minimum += 1;
maximum += 1;
}
} else if (RATE_GRAY < rate && rate <= RATE_BROWN) {
playerGroups[RATE_BROWN] += 1;
if (playerGroups[RATE_BROWN] == 1) {
minimum += 1;
maximum += 1;
}
} else if (RATE_BROWN < rate && rate <= RATE_GREEN) {
playerGroups[RATE_GREEN] += 1;
if (playerGroups[RATE_GREEN] == 1) {
minimum += 1;
maximum += 1;
}
} else if (RATE_GREEN < rate && rate <= RATE_LIGHT_BLUE) {
playerGroups[RATE_LIGHT_BLUE] += 1;
if (playerGroups[RATE_LIGHT_BLUE] == 1) {
minimum += 1;
maximum += 1;
}
} else if (RATE_LIGHT_BLUE < rate && rate <= RATE_DARK_BLUE) {
playerGroups[RATE_DARK_BLUE] += 1;
if (playerGroups[RATE_DARK_BLUE] == 1) {
minimum += 1;
maximum += 1;
}
} else if (RATE_DARK_BLUE < rate && rate <= RATE_YELLOW) {
playerGroups[RATE_YELLOW] += 1;
if (playerGroups[RATE_YELLOW] == 1) {
minimum += 1;
maximum += 1;
}
} else if (RATE_YELLOW < rate && rate <= RATE_ORANGE) {
playerGroups[RATE_ORANGE] += 1;
if (playerGroups[RATE_ORANGE] == 1) {
minimum += 1;
maximum += 1;
}
} else if (RATE_ORANGE < rate && rate <= RATE_RED) {
playerGroups[RATE_RED] += 1;
if (playerGroups[RATE_RED] == 1) {
minimum += 1;
maximum += 1;
}
} else {
maximum += 1;
}
}
maximum = min(maximum, 8);
cout << minimum << " " << maximum << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
C - Colorful Leaderboard |
User |
xeonics |
Language |
C++11 (GCC 4.8.1) |
Score |
0 |
Code Size |
5125 Byte |
Status |
WA |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 300 |
Status |
|
|
Set Name |
Test Cases |
Sample |
s1.txt, s2.txt, s3.txt |
All |
in1.txt, in2.txt, in3.txt, in4.txt, in5.txt, s1.txt, s2.txt, s3.txt |
Case Name |
Status |
Exec Time |
Memory |
in1.txt |
WA |
1 ms |
256 KB |
in2.txt |
AC |
1 ms |
256 KB |
in3.txt |
WA |
1 ms |
256 KB |
in4.txt |
WA |
1 ms |
256 KB |
in5.txt |
AC |
1 ms |
256 KB |
s1.txt |
AC |
1 ms |
256 KB |
s2.txt |
AC |
1 ms |
256 KB |
s3.txt |
AC |
1 ms |
256 KB |