結果
問題 | No.2453 Seat Allocation |
ユーザー | tamura-up |
提出日時 | 2023-09-01 22:06:44 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 96 ms / 2,000 ms |
コード長 | 9,706 bytes |
コンパイル時間 | 2,664 ms |
コンパイル使用メモリ | 223,280 KB |
実行使用メモリ | 9,236 KB |
最終ジャッジ日時 | 2024-06-25 09:25:30 |
合計ジャッジ時間 | 4,711 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 61 ms
8,336 KB |
testcase_06 | AC | 37 ms
6,944 KB |
testcase_07 | AC | 17 ms
8,396 KB |
testcase_08 | AC | 7 ms
6,944 KB |
testcase_09 | AC | 94 ms
9,236 KB |
testcase_10 | AC | 96 ms
8,468 KB |
testcase_11 | AC | 96 ms
8,464 KB |
testcase_12 | AC | 28 ms
6,940 KB |
testcase_13 | AC | 33 ms
6,944 KB |
testcase_14 | AC | 35 ms
6,940 KB |
testcase_15 | AC | 38 ms
6,944 KB |
testcase_16 | AC | 30 ms
6,940 KB |
testcase_17 | AC | 2 ms
6,940 KB |
testcase_18 | AC | 59 ms
6,940 KB |
testcase_19 | AC | 69 ms
8,968 KB |
testcase_20 | AC | 29 ms
6,940 KB |
testcase_21 | AC | 35 ms
6,940 KB |
testcase_22 | AC | 51 ms
6,940 KB |
testcase_23 | AC | 2 ms
6,944 KB |
testcase_24 | AC | 2 ms
6,944 KB |
ソースコード
/** * code generated by JHelper * More info: https://github.com/AlexeyDmitriev/JHelper * @author */ //@formatter:off #pragma GCC optimize("Ofast") #include <bits/stdc++.h> using namespace std; // #include <atcoder/all> // using namespace atcoder; //@formatter:off #define rep(i, n) for (int i = 0; i < (n); ++i) #define drep(i, n) for (int i = (n)-1; i >= 0; --i) #define srep(i, s, t) for (int i = s; i < t; ++i) #define rng(a) a.begin(), a.end() #define rrng(a) a.rbegin(), a.rend() using ll = long long; using P = pair<ll, ll>; using VI = vector<int>; using VVI = vector<VI>; using VVVI = vector<VVI>; using VVVVI = vector<VVVI>; using VL = vector<ll>; using VVL = vector<VL>; using VVVL = vector<VVL>; using VVVVL = vector<VVVL>; using VP = vector<P>; using VVP = vector<vector<P>>; using VS = vector<string>; using VC = vector<char>; using VVC = vector<vector<char>>; using VD = vector<double>; using VVD = vector<vector<double>>; using VVVD = vector<VVD>; using I_I = pair<int, int>; const int INF = (int)1e9 + 10; // int max > 2*10^9 const long long INFL = (ll)2e18 + 10; // ll max > 9*10^18 const int JU_5 = 100000; const int JU_6 = 1000000; const ll JU_9 = 1000000000; const ll JU_18 = JU_9*JU_9; #define YES cout << "YES" << endl #define NO cout << "NO" << endl #define Yes cout << "Yes" << endl #define No cout << "No" << endl template <typename T, typename C> pair<T,C> operator+(const pair<T,C> &a, const pair<T,C> &b) { return make_pair(a.first + b.first, a.second + b.second); } template <typename T, typename C> pair<T,C> operator-(const pair<T,C> &a, const pair<T,C> &b) { return make_pair(a.first - b.first, a.second - b.second); } template <typename T, typename C> pair<T,C> operator*(const pair<T,C> &a, const pair<T,C> &b) { return make_pair(a.first * b.first, a.second * b.second); } template <typename T, typename C> pair<T,C> operator/(const pair<T,C> &a, const pair<T,C> &b) { return make_pair(a.first / b.first, a.second / b.second); } // #define MOD 1000000007 #define MOD 998244353 #define pmod(x,y) ((x%y)+y)%y /********** libs **********/ //@formatter:off // jhelper 用変数 ostream *__cout; istream *__cin; void _init_io(std::istream &cin, std::ostream &cout) { // 入出力高速化用 ios::sync_with_stdio(false); cin.tie(nullptr); cout << std::setprecision(30); // jhelper 用 __cout = &cout; __cin = &cin; } //@formatter:off /* デバッグ用 出力 */ template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v: vec) os << v << ","; os << "]"; return os; } template<typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << "{"; for (auto v: vec) os << v << ","; os << "}"; return os; } template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec) { os << "{"; for (auto v: vec) os << v << ","; os << "}"; return os; } template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << "{"; for (auto v: vec) os << v << ","; os << "}"; return os; } template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << "{"; for (auto v: vec) os << v << ","; os << "}"; return os; } template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << "(" << pa.first << "," << pa.second << ")"; return os; } template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << "{"; for (auto v: mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; } template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp) { os << "{"; for (auto v: mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; } // print like python // src: https://qiita.com/Lily0727K/items/06cb1d6da8a436369eed ///////////////////////////////////////////////////////// void print() { *__cout << '\n'; } template<class Head, class... Tail> void print(Head &&head, Tail &&... tail) { *__cout << head; if (sizeof...(tail) != 0) *__cout << " "; print(forward<Tail>(tail)...); } template<class T> void print(vector<T> &vec) { for (auto &a: vec) { *__cout << a; if (&a != &vec.back()) *__cout << " "; } *__cout << '\n'; } template<class T> void print(vector<vector<T>> &df) { for (auto &vec: df) { print(vec); } } // endl なし void Print() {} template<class Head, class... Tail> void Print(Head &&head, Tail &&... tail) { *__cout << head; if (sizeof...(tail) != 0) *__cout << " "; Print(forward<Tail>(tail)...); } template<class T> void Print(vector<T> &vec) { for (auto &a: vec) { *__cout << a; if (&a != &vec.back()) *__cout << " "; } } //@formatter:off /* * org: https://atcoder.jp/contests/abc213/submissions/24901856 * jhelper で使用するため, 全部 cin での入力にしている. (現状のレベルでは困らないので) */ template<class T> void scan(T& a){ *__cin >> a; } template<class T> void scan(vector<T>&); template<class T, class L> void scan(pair<T, L>&); template<class T> void scan(vector<T>& a){ for(auto&& i : a) scan(i); } template<class T, class L> void scan(pair<T, L>& p){ scan(p.first); scan(p.second); } template<class T, size_t size> void scan(T (&a)[size]){ for(auto&& i : a) scan(i); } void in(){} template <class... T> void in(T&... a){ (void)initializer_list<int>{ (scan(a), 0)... }; } #define let_v(type,name,...) vector<type>name(__VA_ARGS__) #define let_V(type,name,size) vector<type>name(size);in(name) #define let_vv(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__)) #define let_VV(type,name,h,w) vector<vector<type>>name(h,vector<type>(w));in(name) #define let_vvv(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__))) #define let_vvvv(type,name,h,w,x,...) vector<vector<vector<vector<type>>>>name(h,vector<vector<vector<type>>>(w,vector<vector<type>>(x,vector<type>(__VA_ARGS__)))) #define let_vvvvv(type,name,h,w,x,y,...) vector<vector<vector<vector<vector<type>>>>>name(h,vector<vector<vector<vector<type>>>>(w,vector<vector<vector<type>>>(x,vector<vector<type>>(y,vector<type>(__VA_ARGS__))))) /* string 入力を vector<char> で受け取るみたいな */ vector<char> let_CharVec() { string s; *__cin >> s; return {s.begin(), s.end()}; } //@formatter:off //ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } template <class T, class C> bool chmax(T& a, C b) { if (a < b) { a = b; return true; } return false; } template <class T, class C> bool chmin(T& a, C b) { if (a > b) { a = b; return true; } return false; } template <class T> T sum(const vector<T>& v) { T res = 0; for (size_t i = 0; i < v.size(); ++i) res += v[i]; return res; } //template <class T, class C> //T min(T a, C b) { return a <= b ? a : T(b); } // //template <class T, class C> //T max(T a, C b) { return a >= b ? a : T(b); } template<class T> vector<pair<T, int>> idx_pair(vector<T> &vals) { vector<pair<T, int>> ans; rep(i, vals.size()) { ans.emplace_back(vals[i], i); } return ans; } template<typename T> int argmax(vector<T> &vals){ if(vals.size()==0)return -1; int res=0; for(int i = 1;i<vals.size();i++){ if(vals[i]>vals[res])res=i; } return res; } template<typename T> int argmin(vector<T> &vals){ if(vals.size()==0)return -1; int res=0; for(int i = 1;i<vals.size();i++){ if(vals[i]<vals[res])res=i; } return res; } // add other source // #include "../library/graph/UnionFind.cpp" // #include "../library/tree/SegmentTree.cpp" // #include "../library/others/Zaatsu.cpp" // #include "../library/graph/template.cpp" // utils // #include "../library/mint.cpp" // #include "../library/string/utils.cpp" // #include "../library/math/utils.cpp" /**************************/ struct Rat { ll a, b; // 分子、分母 int idx; /** * @param _a 分子 * @param _b 分母 * @param reduction インスタンス作成時に約分するか? */ Rat(ll _a, ll _b, bool reduction,int idx): a(_a), b(_b),idx(idx) { if (b == 0) { a = 1; b = 0; return;} if (b < 0) b = -b, a = -a; if(reduction) { ll g = gcd(abs(a), b); a /= g; b /= g; } } bool operator<(const Rat& x) const { if(a*x.b == x.a*b){ return idx>x.idx; } auto res= a*x.b < x.a*b; return res; } // bool operator<=(const Rat& x) const { // return a*x.b <= x.a*b; // } // bool operator>(const Rat& x) const { // return a*x.b > x.a*b; // } //// bool operator>=(const Rat& x) const { //// return a*x.b >= x.a*b; //// } // bool operator==(const Rat& x) const { // return a==x.a && b==x.b; // } }; ostream &operator<<(ostream &os, const Rat &a) { if (a.b == 1) return os << a.a; auto res=(double)a.a / a.b; return os << res; } class unko { public: void solve(std::istream &cin, std::ostream &cout) { _init_io(cin, cout); int t = 1; // cin >> t; while (t--) _solve(cin, cout); } //@formatter:on void _solve(std::istream &cin, std::ostream &cout) { // code int n, m; cin >> n >> m; let_V(ll, a, n); let_V(ll, b, m); priority_queue<Rat> que; VI cnt(n, 0); rep(i, n) { que.push(Rat(a[i], b[0], true, i)); } rep(i, m) { auto res = que.top(); auto ai = res.idx; print(ai + 1); cnt[ai]++; que.push(Rat(a[ai], b[cnt[ai]], true, ai)); que.pop(); } } }; int main() { unko solver; std::istream& in(std::cin); std::ostream& out(std::cout); solver.solve(in, out); return 0; }