Submission #345069
Source Code Expand
#ifndef KOMAKI_LOCAL
#define NDEBUG
#endif
#include <bits/stdc++.h>
#include <sys/time.h>
#include <unistd.h>
using namespace std;
#define i64 int64_t
#define rep(i, n) for(i64 i = 0; i < ((i64)(n)); ++i)
#define sz(v) ((i64)((v).size()))
#define bit(n) (((i64)1)<<((i64)(n)))
#define all(v) (v).begin(), (v).end()
std::string dbgDelim(int &i){ return (i++ == 0 ? "" : ", "); }
#define dbgEmbrace(exp) { int i = 0; os << "{"; { exp; } os << "}"; return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> v);
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> v);
template <class T> std::ostream& operator<<(std::ostream &os, std::queue<T> q);
template <class T> std::ostream& operator<<(std::ostream &os, std::priority_queue<T> q);
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::pair<T, K> p);
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> mp);
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::unordered_map<T, K> mp);
template <int INDEX, class TUPLE> void dbgDeploy(std::ostream &os, TUPLE tuple){}
template <int INDEX, class TUPLE, class H, class ...Ts> void dbgDeploy(std::ostream &os, TUPLE t)
{ os << (INDEX == 0 ? "" : ", ") << get<INDEX>(t); dbgDeploy<INDEX + 1, TUPLE, Ts...>(os, t); }
template <class T, class K> void dbgDeploy(std::ostream &os, std::pair<T, K> p, std::string delim)
{ os << "(" << p.first << delim << p.second << ")"; }
template <class ...Ts> std::ostream& operator<<(std::ostream &os, std::tuple<Ts...> t)
{ os << "("; dbgDeploy<0, std::tuple<Ts...>, Ts...>(os, t); os << ")"; return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::pair<T, K> p)
{ dbgDeploy(os, p, ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> v)
{ dbgEmbrace( for(T t: v){ os << dbgDelim(i) << t; }); }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> s)
{ dbgEmbrace( for(T t: s){ os << dbgDelim(i) << t; }); }
template <class T> std::ostream& operator<<(std::ostream &os, std::queue<T> q)
{ dbgEmbrace( for(; q.size(); q.pop()){ os << dbgDelim(i) << q.front(); }); }
template <class T> std::ostream& operator<<(std::ostream &os, std::priority_queue<T> q)
{ dbgEmbrace( for(; q.size(); q.pop()){ os << dbgDelim(i) << q.top(); }); }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> mp)
{ dbgEmbrace( for(auto p: mp){ os << dbgDelim(i); dbgDeploy(os, p, "->"); }); }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::unordered_map<T, K> mp)
{ dbgEmbrace( for(auto p: mp){ os << dbgDelim(i); dbgDeploy(os, p, "->"); }); }
#define DBG_OUT std::cerr
#define DBG_OVERLOAD(_1, _2, _3, _4, _5, _6, macro_name, ...) macro_name
#define DBG_LINE() { char s[99]; sprintf(s, "line:%3d | ", __LINE__); DBG_OUT << s; }
#define DBG_OUTPUT(v) { DBG_OUT << (#v) << "=" << (v); }
#define DBG1(v, ...) { DBG_OUTPUT(v); }
#define DBG2(v, ...) { DBG_OUTPUT(v); DBG_OUT << ", "; DBG1(__VA_ARGS__); }
#define DBG3(v, ...) { DBG_OUTPUT(v); DBG_OUT << ", "; DBG2(__VA_ARGS__); }
#define DBG4(v, ...) { DBG_OUTPUT(v); DBG_OUT << ", "; DBG3(__VA_ARGS__); }
#define DBG5(v, ...) { DBG_OUTPUT(v); DBG_OUT << ", "; DBG4(__VA_ARGS__); }
#define DBG6(v, ...) { DBG_OUTPUT(v); DBG_OUT << ", "; DBG5(__VA_ARGS__); }
#define DEBUG0() { DBG_LINE(); DBG_OUT << std::endl; }
#define DEBUG(...) \
{ \
DBG_LINE(); \
DBG_OVERLOAD(__VA_ARGS__, DBG6, DBG5, DBG4, DBG3, DBG2, DBG1)(__VA_ARGS__); \
DBG_OUT << std::endl; \
}
int main()
{
i64 n;
cin >> n;
unordered_set<i64> s;
rep(i, n){
i64 t;
cin >> t;
while(t % 2 == 0) t /= 2;
s.insert(t);
}
cout << sz(s) << endl;
}
Submission Info
Submission Time |
|
Task |
C - 高橋くんと魔法の箱 |
User |
Komaki |
Language |
C++11 (GCC 4.8.1) |
Score |
100 |
Code Size |
4170 Byte |
Status |
AC |
Exec Time |
138 ms |
Memory |
4920 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
All |
Score / Max Score |
0 / 0 |
20 / 20 |
30 / 30 |
50 / 50 |
Status |
|
|
|
|
Set Name |
Test Cases |
Sample |
subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
Subtask1 |
subtask1_0.txt, subtask1_1.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_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
Subtask2 |
subtask2_0.txt, subtask2_1.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
All |
subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.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_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt, subtask2_0.txt, subtask2_1.txt, subtask2_2.txt, subtask2_3.txt, subtask2_4.txt, subtask2_5.txt, subtask2_6.txt, subtask2_7.txt, subtask2_8.txt, subtask2_9.txt, subtask3_0.txt, subtask3_1.txt, subtask3_2.txt, subtask3_3.txt, subtask3_4.txt, subtask3_5.txt, subtask3_6.txt, subtask3_7.txt, subtask3_8.txt, subtask3_9.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0_0.txt |
AC |
24 ms |
796 KB |
subtask0_1.txt |
AC |
25 ms |
728 KB |
subtask0_2.txt |
AC |
23 ms |
800 KB |
subtask1_0.txt |
AC |
25 ms |
924 KB |
subtask1_1.txt |
AC |
26 ms |
808 KB |
subtask1_10.txt |
AC |
25 ms |
804 KB |
subtask1_11.txt |
AC |
26 ms |
928 KB |
subtask1_12.txt |
AC |
27 ms |
928 KB |
subtask1_13.txt |
AC |
26 ms |
924 KB |
subtask1_14.txt |
AC |
24 ms |
792 KB |
subtask1_15.txt |
AC |
26 ms |
800 KB |
subtask1_16.txt |
AC |
27 ms |
928 KB |
subtask1_17.txt |
AC |
26 ms |
916 KB |
subtask1_18.txt |
AC |
27 ms |
920 KB |
subtask1_19.txt |
AC |
26 ms |
924 KB |
subtask1_2.txt |
AC |
26 ms |
800 KB |
subtask1_3.txt |
AC |
26 ms |
804 KB |
subtask1_4.txt |
AC |
26 ms |
920 KB |
subtask1_5.txt |
AC |
25 ms |
920 KB |
subtask1_6.txt |
AC |
26 ms |
924 KB |
subtask1_7.txt |
AC |
27 ms |
924 KB |
subtask1_8.txt |
AC |
27 ms |
928 KB |
subtask1_9.txt |
AC |
28 ms |
876 KB |
subtask2_0.txt |
AC |
91 ms |
4920 KB |
subtask2_1.txt |
AC |
111 ms |
4304 KB |
subtask2_2.txt |
AC |
107 ms |
4300 KB |
subtask2_3.txt |
AC |
109 ms |
4368 KB |
subtask2_4.txt |
AC |
111 ms |
4296 KB |
subtask2_5.txt |
AC |
114 ms |
4300 KB |
subtask2_6.txt |
AC |
110 ms |
4308 KB |
subtask2_7.txt |
AC |
114 ms |
4276 KB |
subtask2_8.txt |
AC |
112 ms |
4292 KB |
subtask2_9.txt |
AC |
110 ms |
4288 KB |
subtask3_0.txt |
AC |
89 ms |
4816 KB |
subtask3_1.txt |
AC |
138 ms |
4804 KB |
subtask3_2.txt |
AC |
137 ms |
4868 KB |
subtask3_3.txt |
AC |
137 ms |
4804 KB |
subtask3_4.txt |
AC |
135 ms |
4812 KB |
subtask3_5.txt |
AC |
133 ms |
4808 KB |
subtask3_6.txt |
AC |
136 ms |
4804 KB |
subtask3_7.txt |
AC |
132 ms |
4816 KB |
subtask3_8.txt |
AC |
127 ms |
4812 KB |
subtask3_9.txt |
AC |
128 ms |
4808 KB |