結果
問題 | No.2453 Seat Allocation |
ユーザー |
|
提出日時 | 2023-09-01 21:51:19 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 62 ms / 2,000 ms |
コード長 | 6,759 bytes |
コンパイル時間 | 8,252 ms |
コンパイル使用メモリ | 311,256 KB |
実行使用メモリ | 9,992 KB |
最終ジャッジ日時 | 2024-06-25 09:24:52 |
合計ジャッジ時間 | 8,638 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 22 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>#include <atcoder/all>using namespace std;using namespace atcoder;#define overload4(_1, _2, _3, _4, name, ...) name#define rep1(n) for(int i = 0; i < (int)(n); ++i)#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)#define ALL(a) a.begin(), a.end()#define Sort(a) sort(a.begin(), a.end())#define RSort(a) sort(a.rbegin(), a.rend())typedef long long int ll;typedef unsigned long long ul;typedef long double ld;typedef vector<int> vi;typedef vector<long long> vll;typedef vector<char> vc;typedef vector<string> vst;typedef vector<double> vd;typedef vector<long double> vld;typedef pair<long long, long long> P;template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }const long long MINF = 0x7fffffffffff;const long long INF = 0x1fffffffffffffff;const long long MOD = 998244353;const long double EPS = 1e-9;const long double PI = acos(-1);template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; returnos; }template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " ";} return os; }template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr<< (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os <<*itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os<< pq.top() << " "; pq.pop(); } return os; }template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }template<class... T> void in(T&... a){ (cin >> ... >> a); }void out(){ cout << '\n'; }template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b;cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }struct fraction{long long p, q; // long long or __int128_tfraction(long long P = 0, long long Q = 1): p(P), q(Q){// normalize();}void normalize(){long long g = __gcd(p, q);p /= g, q /= g;if(q < 0) p *= -1, q *= -1;}inline bool operator==(const fraction &other) const {return p * other.q == other.p * q;}inline bool operator!=(const fraction &other) const {return p * other.q != other.p * q;}inline bool operator<(const fraction &other) const {return p * other.q < other.p * q;}inline bool operator<=(const fraction &other) const {return p * other.q <= other.p * q;}inline bool operator>(const fraction &other) const {return p * other.q > other.p * q;}inline bool operator>=(const fraction &other) const {return p * other.q >= other.p * q;}inline fraction operator+(const fraction &other) const { return fraction(p * other.q + q * other.p, q * other.q); }inline fraction operator-(const fraction &other) const { return fraction(p * other.q - q * other.p, q * other.q); }inline fraction operator*(const fraction &other) const { return fraction(p * other.p, q * other.q); }inline fraction operator/(const fraction &other) const { return fraction(p * other.q, q * other.p); }inline fraction& operator+=(const fraction& rhs) noexcept {*this = *this + rhs;return *this;}inline fraction& operator-=(const fraction& rhs) noexcept {*this = *this - rhs;return *this;}inline fraction& operator*=(const fraction& rhs) noexcept {*this = *this * rhs;return *this;}inline fraction& operator/=(const fraction& rhs) noexcept {*this = *this / rhs;return *this;}friend inline istream& operator>>(istream& is, fraction& x) noexcept {is >> x.p;x.q = 1;return is;}friend inline ostream& operator<<(ostream& os, const fraction& x) noexcept { return os << x.p << "/" << x.q; }};ll n, m;vll a, b;void input(){in(n, m);vin(a, n);vin(b, m);}void solve(){using T = tuple<fraction, ll, ll>;priority_queue<T> q;rep(i, n){q.emplace(fraction(a[i], b[0]), n - i, 1);}vll ans(m);rep(i, m){auto [score, num, nxt] = q.top();q.pop();ans[i] = (n - num) + 1;q.emplace(fraction(score.p, b[nxt]), num, nxt + 1);}vout(ans, "\n");}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);cout << fixed << setprecision(20);input();solve();}