結果
問題 | No.8016 unordered_mapなるたけ落とすマン |
ユーザー | vabuff |
提出日時 | 2017-09-28 20:26:59 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 9,078 bytes |
コンパイル時間 | 1,383 ms |
コンパイル使用メモリ | 120,952 KB |
実行使用メモリ | 13,768 KB |
最終ジャッジ日時 | 2024-11-15 18:17:49 |
合計ジャッジ時間 | 11,198 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
13,768 KB |
testcase_01 | AC | 2 ms
10,496 KB |
testcase_02 | AC | 2 ms
12,596 KB |
testcase_03 | AC | 53 ms
9,160 KB |
testcase_04 | AC | 68 ms
9,288 KB |
testcase_05 | AC | 69 ms
9,160 KB |
testcase_06 | AC | 73 ms
9,160 KB |
testcase_07 | AC | 67 ms
9,160 KB |
testcase_08 | AC | 69 ms
9,264 KB |
testcase_09 | AC | 64 ms
9,156 KB |
testcase_10 | AC | 65 ms
9,284 KB |
testcase_11 | AC | 68 ms
9,292 KB |
testcase_12 | AC | 69 ms
9,288 KB |
testcase_13 | AC | 69 ms
9,284 KB |
testcase_14 | AC | 67 ms
9,160 KB |
testcase_15 | TLE | - |
testcase_16 | AC | 68 ms
9,156 KB |
testcase_17 | TLE | - |
testcase_18 | AC | 64 ms
9,284 KB |
testcase_19 | AC | 467 ms
9,272 KB |
testcase_20 | AC | 62 ms
9,288 KB |
testcase_21 | AC | 66 ms
9,288 KB |
testcase_22 | AC | 156 ms
9,292 KB |
testcase_23 | AC | 67 ms
9,288 KB |
testcase_24 | AC | 88 ms
9,284 KB |
testcase_25 | AC | 61 ms
9,160 KB |
testcase_26 | AC | 71 ms
9,160 KB |
testcase_27 | AC | 65 ms
9,292 KB |
testcase_28 | AC | 58 ms
9,160 KB |
testcase_29 | AC | 63 ms
9,284 KB |
testcase_30 | AC | 61 ms
9,404 KB |
testcase_31 | AC | 64 ms
9,284 KB |
testcase_32 | AC | 62 ms
9,288 KB |
testcase_33 | AC | 60 ms
9,288 KB |
testcase_34 | AC | 57 ms
9,288 KB |
testcase_35 | AC | 60 ms
9,288 KB |
testcase_36 | AC | 61 ms
9,288 KB |
testcase_37 | AC | 60 ms
9,292 KB |
testcase_38 | AC | 58 ms
9,160 KB |
testcase_39 | AC | 58 ms
9,288 KB |
testcase_40 | AC | 58 ms
9,140 KB |
testcase_41 | AC | 2 ms
5,248 KB |
testcase_42 | AC | 2 ms
5,248 KB |
testcase_43 | AC | 2 ms
5,248 KB |
testcase_44 | AC | 6 ms
5,248 KB |
testcase_45 | AC | 5 ms
5,248 KB |
testcase_46 | AC | 5 ms
5,248 KB |
testcase_47 | AC | 46 ms
6,840 KB |
testcase_48 | AC | 47 ms
6,968 KB |
testcase_49 | AC | 48 ms
7,100 KB |
testcase_50 | AC | 39 ms
10,624 KB |
ソースコード
/** * */ // #include {{{ #include <algorithm> #include <array> #include <bitset> #include <cassert> #include <cfloat> #include <cmath> #include <cstdint> #include <cstdio> #include <cstdlib> #include <cstring> #include <ctime> #include <deque> #include <forward_list> #include <functional> #include <iomanip> #include <iostream> #include <fstream> #include <sstream> #include <iterator> #include <limits> #include <list> #include <map> #include <numeric> #include <queue> #include <random> #include <set> #include <stack> #include <string> #include <tuple> #include <type_traits> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> #ifdef DEBUG #include <fmt/format.h> #include <fmt/ostream.h> #endif using namespace std; // }}} // type {{{ using s8 = int8_t; using u8 = uint8_t; using s16 = int16_t; using u16 = uint16_t; using s32 = int32_t; using u32 = uint32_t; using s64 = int64_t; using u64 = uint64_t; template<typename T> using max_heap = priority_queue<T, vector<T>, less<T>>; template<typename T> using min_heap = priority_queue<T, vector<T>, greater<T>>; // }}} // 適宜調整 //#define int s64 constexpr bool IOS_SYNCSTDIO = false; constexpr int IOS_PREC = 10; constexpr int INF = numeric_limits<int>::max(); constexpr double EPS = 1e-9; // util {{{ template<typename T> constexpr bool is_odd(T x) { return x % 2 == 1; } template<typename T> constexpr bool is_even(T x) { return x % 2 == 0; } template<typename T> constexpr int cmp(T x, T y) { return (x > y) - (x < y); } template<typename T> constexpr int sgn(T x) { return cmp(x, T(0)); } template<typename T> constexpr typename enable_if<is_signed<T>::value,T>::type modulo(T a, T b) { assert(b > 0); T r = a % b; return r >= 0 ? r : r+b; } template<typename T> constexpr T clamp(T x, T lo, T hi) { assert(lo <= hi); if(x < lo) return lo; else if(x > hi) return hi; else return x; } int sqrti(int x) { assert(x >= 0); return static_cast<int>(sqrt(x)); } s64 sqrtl(s64 x) { assert(x >= 0); return static_cast<s64>(sqrtl(x)); } template<typename T> bool chmax(T& xmax, const T& x) { if(x > xmax) { xmax = x; return true; } else { return false; } } template<typename T> bool chmin(T& xmin, const T& x) { if(x < xmin) { xmin = x; return true; } else { return false; } } template<typename T> constexpr int SIZE(const T& c) { return static_cast<int>(c.size()); } template<typename T, size_t N> constexpr int SIZE(const T (&)[N]) { return static_cast<int>(N); } ostream& FPRINT(ostream& out) { return out; } template<typename T, typename... TS> ostream& FPRINT(ostream& out, const T& x, const TS& ...args) { out << x; if(sizeof...(args)) out << ' '; return FPRINT(out, args...); } template<typename... TS> ostream& FPRINTLN(ostream& out, const TS& ...args) { FPRINT(out, args...); return out << '\n'; } template<typename InputIt> ostream& FPRINTSEQ(ostream& out, InputIt first, InputIt last) { for(InputIt it = first; it != last; ++it) { if(it != first) out << ' '; out << *it; } return out; } template<typename T, size_t N> ostream& FPRINTARRAY1(ostream& out, const T (&c)[N]) { return FPRINTSEQ(out, cbegin(c), cend(c)); } template<typename T, size_t N1, size_t N2> ostream& FPRINTARRAY2(ostream& out, const T (&c)[N1][N2]) { out << '\n'; for(const auto& e : c) { FPRINTARRAY1(out, e) << '\n'; } return out; } template<typename... TS> ostream& PRINT(const TS& ...args) { return FPRINT(cout, args...); } template<typename... TS> ostream& PRINTLN(const TS& ...args) { return FPRINTLN(cout, args...); } template<typename InputIt> ostream& PRINTSEQ(InputIt first, InputIt last) { return FPRINTSEQ(cout, first, last); } template<typename T, size_t N> ostream& PRINTARRAY1(const T (&c)[N]) { return FPRINTARRAY1(cout, c); } template<typename T, size_t N1, size_t N2> ostream& PRINTARRAY2(const T (&c)[N1][N2]) { return FPRINTARRAY2(cout, c); } template<typename... TS> ostream& DPRINT(const TS& ...args) { return FPRINT(cerr, args...); } template<typename... TS> ostream& DPRINTLN(const TS& ...args) { return FPRINTLN(cerr, args...); } template<typename InputIt> ostream& DPRINTSEQ(InputIt first, InputIt last) { return FPRINTSEQ(cerr, first, last); } template<typename T, size_t N> ostream& DPRINTARRAY1(const T (&c)[N]) { return FPRINTARRAY1(cerr, c); } template<typename T, size_t N1, size_t N2> ostream& DPRINTARRAY2(const T (&c)[N1][N2]) { return FPRINTARRAY2(cerr, c); } template<typename T1, typename T2> ostream& operator<<(ostream& out, const pair<T1,T2>& p) { return out << '(' << p.first << ',' << p.second << ')'; } template<typename T> ostream& operator<<(ostream& out, const vector<T>& c) { return FPRINTSEQ(out, cbegin(c), cend(c)); } template<typename T> ostream& operator<<(ostream& out, const vector<vector<T>>& c) { out << '\n'; for(const auto& e : c) { out << e << '\n'; } return out; } template<typename T> ostream& operator<<(ostream& out, const deque<T>& c) { return FPRINTSEQ(out, cbegin(c), cend(c)); } template<typename T> ostream& operator<<(ostream& out, const list<T>& c) { return FPRINTSEQ(out, cbegin(c), cend(c)); } template<typename T> ostream& operator<<(ostream& out, const forward_list<T>& c) { return FPRINTSEQ(out, cbegin(c), cend(c)); } template<typename T> ostream& operator<<(ostream& out, const set<T>& c) { return FPRINTSEQ(out, cbegin(c), cend(c)); } template<typename T> ostream& operator<<(ostream& out, const unordered_set<T>& c) { return out << set<T>(cbegin(c), cend(c)); } template<typename T, size_t N> ostream& operator<<(ostream& out, const array<T,N>& c) { return FPRINTSEQ(out, cbegin(c), cend(c)); } template<typename InputIt> ostream& FPRINTMAP(ostream& out, InputIt first, InputIt last) { out << "{\n"; for(auto it = first; it != last; ++it) { out << " " << it->first << " : " << it->second << '\n'; } out << "}\n"; return out; } template<typename InputIt> ostream& PRINTMAP(InputIt first, InputIt last) { return FPRINTMAP(cout, first, last); } template<typename InputIt> ostream& DPRINTMAP(InputIt first, InputIt last) { return FPRINTMAP(cerr, first, last); } template<typename K, typename V> ostream& operator<<(ostream& out, const map<K,V>& c) { return FPRINTMAP(out, cbegin(c), cend(c)); } template<typename K, typename V> ostream& operator<<(ostream& out, const unordered_map<K,V>& c) { return out << map<K,V>(cbegin(c), cend(c)); } template<typename T, typename C> ostream& operator<<(ostream& out, stack<T,C> c) { while(!c.empty()) { out << c.top(); c.pop(); if(!c.empty()) out << ' '; } return out; } template<typename T, typename C> ostream& operator<<(ostream& out, queue<T,C> c) { while(!c.empty()) { out << c.front(); c.pop(); if(!c.empty()) out << ' '; } return out; } template<typename T, typename Cont, typename Cmp> ostream& operator<<(ostream& out, priority_queue<T,Cont,Cmp> c) { while(!c.empty()) { out << c.top(); c.pop(); if(!c.empty()) out << ' '; } return out; } template<typename InputIt> bool alltrue(InputIt first, InputIt last) { return all_of(first, last, [](bool b) { return b; }); } template<typename InputIt> bool anytrue(InputIt first, InputIt last) { return any_of(first, last, [](bool b) { return b; }); } template<typename InputIt> bool allfalse(InputIt first, InputIt last) { return !anytrue(first, last); } template<typename InputIt> bool anyfalse(InputIt first, InputIt last) { return !alltrue(first, last); } struct pairhash { template<typename T1, typename T2> size_t operator()(const pair<T1,T2>& p) const { size_t ans = 17; ans = 31*ans + hash<T1>()(p.first); ans = 31*ans + hash<T2>()(p.second); return ans; } }; struct IosIni { IosIni() { cin.tie(nullptr); ios::sync_with_stdio(IOS_SYNCSTDIO); cout << fixed << setprecision(IOS_PREC); } } IOSINI; #define FOR(i, start, end) for(int i = (start); i < (end); ++i) #define REP(i, n) FOR(i, 0, n) #define ALL(f,c,...) (([&](decltype((c)) cc) { return (f)(begin(cc), end(cc), ## __VA_ARGS__); })(c)) #define DBG(x) DPRINTLN('L', __LINE__, ':', #x, ':', (x)) // }}} struct MyHash { size_t operator()(s64 key) const { u64 x = static_cast<u64>(key); return (x>>32) ^ (x&0xFFFFFFFF); } }; int N, M; void solve() { unordered_map<s64,int,MyHash> cnt; REP(_, N) { s64 a; cin >> a; ++cnt[a]; } REP(i, M) { s64 b; cin >> b; PRINT(cnt[b]); PRINT(i == M-1 ? '\n' : ' '); } } signed main(signed /*argc*/, char** /*argv*/) { cin >> N >> M; solve(); return 0; }