Submission #3780556
Source Code Expand
#include <bits/stdc++.h>
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))
using namespace std;
template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}
typedef long long ll;
typedef long double R;
const R EPS=1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r){return(r > EPS)-(r < -EPS);}
inline R sq(R x){return sqrt(max(x,0.0L));}
const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};
// Problem Specific Parameter:
int main() {
int n; cin >> n;
int ans;
vector<ll> v(n);
set<ll> st;
for(int i = 0; i < n; i++) {
cin >> v[i];
st.insert(v[i]);
}
ans = n - st.size();
cout << ans << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Bumble Bee |
User |
atsuyoshi |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
1427 Byte |
Status |
AC |
Exec Time |
55 ms |
Memory |
3968 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt |
All |
sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
1 ms |
256 KB |
sample_02.txt |
AC |
1 ms |
256 KB |
subtask1_01.txt |
AC |
44 ms |
3072 KB |
subtask1_02.txt |
AC |
1 ms |
256 KB |
subtask1_03.txt |
AC |
5 ms |
512 KB |
subtask1_04.txt |
AC |
50 ms |
2688 KB |
subtask1_05.txt |
AC |
19 ms |
640 KB |
subtask1_06.txt |
AC |
39 ms |
2304 KB |
subtask1_07.txt |
AC |
49 ms |
3456 KB |
subtask1_08.txt |
AC |
14 ms |
768 KB |
subtask1_09.txt |
AC |
37 ms |
2432 KB |
subtask1_10.txt |
AC |
25 ms |
1664 KB |
subtask1_11.txt |
AC |
31 ms |
1280 KB |
subtask1_12.txt |
AC |
6 ms |
512 KB |
subtask1_13.txt |
AC |
28 ms |
1152 KB |
subtask1_14.txt |
AC |
33 ms |
2176 KB |
subtask1_15.txt |
AC |
40 ms |
1280 KB |
subtask1_16.txt |
AC |
52 ms |
3200 KB |
subtask1_17.txt |
AC |
53 ms |
3200 KB |
subtask1_18.txt |
AC |
55 ms |
3840 KB |
subtask1_19.txt |
AC |
53 ms |
3584 KB |
subtask1_20.txt |
AC |
47 ms |
1920 KB |
subtask1_21.txt |
AC |
37 ms |
1152 KB |
subtask1_22.txt |
AC |
55 ms |
3840 KB |
subtask1_23.txt |
AC |
41 ms |
1408 KB |
subtask1_24.txt |
AC |
46 ms |
1920 KB |
subtask1_25.txt |
AC |
43 ms |
1536 KB |
subtask1_26.txt |
AC |
52 ms |
3072 KB |
subtask1_27.txt |
AC |
55 ms |
3968 KB |
subtask1_28.txt |
AC |
53 ms |
3456 KB |
subtask1_29.txt |
AC |
49 ms |
2432 KB |