結果

問題 No.2453 Seat Allocation
ユーザー tokusakuraitokusakurai
提出日時 2023-09-01 21:56:29
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 61 ms / 2,000 ms
コード長 6,809 bytes
コンパイル時間 2,152 ms
コンパイル使用メモリ 208,840 KB
実行使用メモリ 9,164 KB
最終ジャッジ日時 2023-09-07 15:35:18
合計ジャッジ時間 4,230 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 1 ms
4,376 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 51 ms
9,164 KB
testcase_06 AC 22 ms
4,376 KB
testcase_07 AC 14 ms
7,984 KB
testcase_08 AC 6 ms
4,380 KB
testcase_09 AC 61 ms
8,384 KB
testcase_10 AC 59 ms
8,108 KB
testcase_11 AC 60 ms
8,216 KB
testcase_12 AC 21 ms
4,376 KB
testcase_13 AC 26 ms
4,376 KB
testcase_14 AC 21 ms
4,380 KB
testcase_15 AC 32 ms
4,380 KB
testcase_16 AC 24 ms
4,380 KB
testcase_17 AC 1 ms
4,380 KB
testcase_18 AC 42 ms
5,916 KB
testcase_19 AC 49 ms
7,692 KB
testcase_20 AC 21 ms
5,524 KB
testcase_21 AC 27 ms
4,376 KB
testcase_22 AC 38 ms
4,984 KB
testcase_23 AC 1 ms
4,376 KB
testcase_24 AC 2 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define per(i, n) for (int i = (n)-1; i >= 0; i--)
#define rep2(i, l, r) for (int i = (l); i < (r); i++)
#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)
#define each(e, v) for (auto &e : v)
#define MM << " " <<
#define pb push_back
#define eb emplace_back
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;

template <typename T>
using maxheap = priority_queue<T>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

int pct(int x) { return __builtin_popcount(x); }
int pct(ll x) { return __builtin_popcountll(x); }
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int botbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int botbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename T>
void reorder(vector<T> &a, const vector<int> &ord) {
    int n = a.size();
    vector<T> b(n);
    for (int i = 0; i < n; i++) b[i] = a[ord[i]];
    swap(a, b);
}

template <typename T>
T floor(T x, T y) {
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return (x >= 0 ? x / y : (x - y + 1) / y);
}

template <typename T>
T ceil(T x, T y) {
    assert(y != 0);
    if (y < 0) x = -x, y = -y;
    return (x >= 0 ? (x + y - 1) / y : x / y);
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(15);
    }
} io_setup;

constexpr int inf = (1 << 30) - 1;
constexpr ll INF = (1LL << 60) - 1;
// constexpr int MOD = 1000000007;
constexpr int MOD = 998244353;

template <typename T>
T binary_gcd(T a, T b) {
    T g = 1;
    while (true) {
        if (a < b) swap(a, b);
        if (b == 0) {
            g *= a;
            break;
        }
        if (!(a & 1)) {
            if (!(b & 1)) {
                a >>= 1, b >>= 1, g <<= 1;
            } else {
                a >>= 1;
            }
        } else {
            if (!(b & 1)) {
                b >>= 1;
            } else {
                a = (a - b) >> 1;
            }
        }
    }
    return g;
}

// reduc : 約分するか (約分は非常に遅い)
template <typename T, bool reduc = false>
struct Rational {
    T a, b;

    Rational() : a(0), b(1) {}

    Rational(const T &a) : a(a), b(1) {}

    Rational(const T &a, const T &b) : a(a), b(b) { normalize(); }

    void normalize() {
        if (b < 0) a = -a, b = -b;
        if (reduc) {
            T g = binary_gcd(abs(a), b);
            a /= g, b /= g;
        }
    }

    Rational &operator+=(const Rational &x) {
        a = a * x.b + b * x.a;
        b *= x.b;
        normalize();
        return *this;
    }

    Rational &operator-=(const Rational &x) {
        a = a * x.b - b * x.a;
        b *= x.b;
        normalize();
        return *this;
    }

    Rational &operator*=(const Rational &x) {
        a *= x.a;
        b *= x.b;
        normalize();
        return *this;
    }

    Rational &operator/=(const Rational &x) {
        a *= x.b;
        b *= x.a;
        normalize();
        return *this;
    }

    Rational operator-() const { return Rational(-a, b); }

    Rational operator+(const Rational &x) const { return Rational(*this) += x; }

    Rational operator-(const Rational &x) const { return Rational(*this) -= x; }

    Rational operator*(const Rational &x) const { return Rational(*this) *= x; }

    Rational operator/(const Rational &x) const { return Rational(*this) /= x; }

    bool operator<(const Rational &x) const { return a * x.b < b * x.a; }

    bool operator<=(const Rational &x) const { return a * x.b <= b * x.a; }

    bool operator>(const Rational &x) const { return a * x.b > b * x.a; }

    bool operator>=(const Rational &x) const { return a * x.b > b * x.a; }

    bool operator==(const Rational &x) const { return a * x.b == b * x.a; }

    bool operator!=(const Rational &x) const { return a * x.b != b * x.a; }

    friend ostream &operator<<(ostream &os, const Rational &x) { return os << x.a << '/' << x.b; }
};

void solve() {
    int N, M;
    cin >> N >> M;

    vector<ll> a(N), b(M);

    rep(i, N) cin >> a[i];
    rep(i, M) cin >> b[i];

    maxheap<pair<Rational<ll>, int>> que;
    vector<int> ptr(N, 0);

    rep(i, N) {
        que.emplace(Rational<ll>(a[i], b[0]), -i);
        ptr[i]++;
    }

    rep(j, M) {
        auto [x, i] = que.top();
        que.pop();
        cout << -i + 1 << '\n';
        if (ptr[-i] < M) que.emplace(Rational<ll>(a[-i], b[ptr[-i]]), i);
        ptr[-i]++;
    }
}

int main() {
    int T = 1;
    // cin >> T;
    while (T--) solve();
}
0