Submission #1569152
Source Code Expand
// Readable Usable Compilable Scalable Expandable Defendable
// Super Hyper Ultra Extremely
// Good(Bad) Template
// By tiger0133
#include <bits/stdc++.h>
using namespace std;
// ————————————————————— Constant ————————————————————— //
#define N 100005
#define MOD 1000000007
#define CINF 0x3f
#define CMAX 0x7f
#define UCMAX 0xff
#define SINF 0x3f3f
#define SMAX 0x7fff
#define USMAX 0xffff
#define IINF 0x3f3f3f3f
#define IMAX 0x7fffffff
#define UMAX 0xffffffff
#define LLINF 0x3f3f3f3f3f3f3f3f
#define LLMAX 0x7fffffffffffffff
#define ULLMAX 0xffffffffffffffff
// ——————————— Function-Like Macro & Alias ————————————— //
#define pue(c) while (!c.empty()) //pop until empty
#define clr(arr) memset(arr, 0, sizeof(arr));
#define inf(arr) memset(arr, CINF, sizeof(arr));
#define nln putchar('\n');
#define alm putchar('\a');
#define tab putchar('\t');
#define spc putchar(' ');
// ———————————————————— Optimizes ————————————————————— //
#define getchar getchar_x
// ——————————————————— Shorten Name ——————————————————— //
typedef float fl;
typedef double db;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define pir pair
#define vct vector
#define tup tuple
#define sta stack
#define deq deque
#define que queue
#define bst bitset
#define mst multiset
#define mmp multimap
#define ust unordered_set
#define ump unordered_map
#define pri priority_queue
#define pb emplace_back
#define pf emplace_front
#define psh emplace
#define itr iterator
#define rit reverse_iterator
#define st first
#define nd second
typedef pir<int, int> pii;
typedef tup<int, int, int> t3;
typedef vct<int> vi;
typedef vct<pii> vii;
typedef vct<t3> vt3;
typedef vct<vi> vvi;
typedef vi grh[N];
typedef vii wgr[N];
#define ppc __builtin_popcount
#define ffs __builtin_ffs
#define clz __builtin_clz
#define ctz __builtin_ctz
#define prt __builtin_parity
#define ppcl __builtin_popcountll
#define ffsl __builtin_ffsll
#define clzl __builtin_clzll
#define ctzl __builtin_ctzll
#define prtl __builtin_parityll
// ——————————————————————— Exit ——————————————————————— //
#ifdef __TIGER0133__
void pause() {
double __used_time__ = clock() * 1. / CLOCKS_PER_SEC;
cout.precision(3);
cout << endl;
cout << "--------------------------------" << endl;
cout << "Process exited after " << fixed << __used_time__ << " seconds with return value 0" << endl;
cout << "Press any key to do nothing. . ." << endl;
while (1);
}
void sigsegv(int code) {
cout << "Program received signal SIGSEGV, Segmentation fault.";
while (1);
}
#endif
// ————————————————————— Function ————————————————————— //
inline void mat(int n, int m, int **arr) {
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> arr[i][j];
}
}
}
inline void mat(vvi& arr) {
for (vi& i : arr) {
for (int& j : i) {
cin >> j;
}
}
}
char B[1 << 15], *S = B, *T = B;
inline char getcharx() { //如果数据中有非数字的输入, 请勿使用!
return S == T && (T = (S = B) + fread(B, 1, 1 << 15, stdin), S == T) ? 0 : *S++;
}
inline void get(register int& val) {
register int fac = 1;
register char ch;
val = 0;
while (!isdigit(ch = getcharx())) ch == 45 && (fac = -1);
do {val = val * 10 + ch - 48;} while (isdigit(ch = getcharx()));
val *= fac;
}
inline bool put(register int val) {
val < 0 && (val = -val);
val > 9 && put(val / 10);
putchar(val % 10 + 48);
return true;
}
template <typename T, typename Compare = less<T>>
inline void normalize(T& x, const T& y, const Compare& comp = less<T>()) {
if (!comp(x, y)) {
x = y;
}
}
// ————————————————————— Solution ————————————————————— //
int n, x, r[N];
int main() {
#ifdef __TIGER0133__
signal(SIGSEGV, sigsegv);
atexit(pause);
#endif
get(n);
while (n--) {
get(x);
r[x]++, r[x + 1]++, r[x + 2]++;
}
cout << *max_element(r, r + N);
}
Submission Info
Submission Time |
|
Task |
C - Together |
User |
tiger0132 |
Language |
C++14 (GCC 5.4.1) |
Score |
300 |
Code Size |
4764 Byte |
Status |
AC |
Exec Time |
3 ms |
Memory |
640 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
300 / 300 |
Status |
|
|
Set Name |
Test Cases |
Sample |
0_000.txt, 0_001.txt, 0_002.txt |
All |
0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt |
Case Name |
Status |
Exec Time |
Memory |
0_000.txt |
AC |
1 ms |
256 KB |
0_001.txt |
AC |
1 ms |
256 KB |
0_002.txt |
AC |
1 ms |
256 KB |
1_003.txt |
AC |
1 ms |
256 KB |
1_004.txt |
AC |
2 ms |
256 KB |
1_005.txt |
AC |
2 ms |
256 KB |
1_006.txt |
AC |
2 ms |
256 KB |
1_007.txt |
AC |
2 ms |
256 KB |
1_008.txt |
AC |
3 ms |
640 KB |