結果

問題 No.2453 Seat Allocation
コンテスト
ユーザー noya2
提出日時 2023-09-01 23:22:02
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 99 ms / 2,000 ms
コード長 8,147 bytes
コンパイル時間 3,455 ms
コンパイル使用メモリ 288,336 KB
実行使用メモリ 9,100 KB
最終ジャッジ日時 2025-06-20 01:47:26
合計ジャッジ時間 5,927 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"
namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

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

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

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

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"


namespace noya2{

template<typename T>
struct rational{
    rational() : p(T(0)), q(T(1)) {}
    rational(T n) : p(n), q(T(1)) {}
    rational(T n, T m){
        assert(m != T(0));
        if (m < T(0)) n = -n, m = -m;
        T g = gcd(n,m);
        p = n / g; q = m / g;
    }
    T num(){return p;}
    T den(){return q;}
    void set_num(T n){
        p = n;
        T g = gcd(p,q);
        p /= g, q /= g;
    }
    void set_den(T n){
        assert(n != T(0));
        q = n;
        T g = gcd(p,q);
        p /= g, q /= g;
    }
    long double val(){
        return (long double)(p) / (long double)(q);
    }
    //explicit operator const long double () const { return (long double)(p) / (long double)(q); }
    rational& operator+=(const rational& rhs){
        T g = gcd(q,rhs.q);
        T np = rhs.q / g * p + q / g * rhs.p;
        T nq = q / g * rhs.q;
        T ng = gcd(np,nq);
        p = np/ng, q = nq/ng;
        return *this; 
    }
    rational& operator-=(const rational& rhs){
        T g = gcd(q,rhs.q);
        T np = rhs.q / g * p - q / g * rhs.p;
        T nq = q / g * rhs.q;
        T ng = gcd(np,nq);
        p = np/ng, q = nq/ng;
        return *this;
    }
    rational& operator*=(const rational& rhs){
        T g1 = gcd(q,rhs.p), g2 = gcd(p,rhs.q);
        T np = p / g2 * rhs.p / g1;
        T nq = q / g1 * rhs.q / g2;
        p = np, q = nq;
        return *this;
    }
    rational& operator/=(const rational& rhs){
        assert(rhs.p != T(0));
        T g1 = gcd(q,rhs.q), g2 = gcd(p,rhs.p);
        T np = p / g2 * rhs.q / g1;
        T nq = q / g1 * rhs.p / g2;
        p = np, q = nq;
        return *this;
    }
    rational operator+() const {return *this;}
    rational operator-() const {return rational() - *this;}
    friend rational operator+(const rational& lhs, const rational& rhs) {
        return rational(lhs) += rhs;
    }
    friend rational operator-(const rational& lhs, const rational& rhs) {
        return rational(lhs) -= rhs;
    }
    friend rational operator*(const rational& lhs, const rational& rhs) {
        return rational(lhs) *= rhs;
    }
    friend rational operator/(const rational& lhs, const rational& rhs) {
        return rational(lhs) /= rhs;
    }
    friend bool operator==(const rational& lhs, const rational& rhs) {
        return lhs.p == rhs.p && lhs.q == rhs.q;
    }
    friend bool operator!=(const rational& lhs, const rational& rhs) {
        return lhs.p != rhs.p || lhs.q != rhs.q;
    }
    friend bool operator< (const rational lhs, const rational rhs) {
        return less_than(lhs,rhs);
    }
    friend bool operator> (const rational lhs, const rational rhs) {
        return less_than(rhs,lhs);
    }
    friend bool operator<= (const rational lhs, const rational rhs) {
        return lhs == rhs || lhs < rhs;
    }
    friend bool operator>= (const rational lhs, const rational rhs) {
        return lhs == rhs || lhs > rhs;
    }
    friend std::ostream &operator<<(std::ostream &os,const rational&r) {
        return os << r.p << " / " << r.q;
    }
  private:
    T p, q;
    T gcd(T a,T b){if(a<T(0))return gcd(-a,b);if(b<T(0))return gcd(a,-b);return _gcd(a,b);}
    T _gcd(T a,T b){return b?_gcd(b,a%b):a;}
    static bool less_than(rational lhs, rational rhs){
        __int128_t lv = __int128_t(lhs.p) * __int128_t(rhs.q);
        __int128_t rv = __int128_t(lhs.q) * __int128_t(rhs.p);
        return lv < rv;
    }
};

using rat = rational<long long>;

} // namespace noya2

void solve(){
    int n, m; in(n,m);
    vector<ll> a(n), b(m); in(a,b);
    priority_queue<pair<rat,int>> pque;
    rep(i,n) pque.push(make_pair(rat(a[i],b[0]),n-i));
    vector<int> cnt(n,1);
    rep(j,m){
        auto [r, i] = pque.top(); pque.pop();
        i = n-i;
        out(i+1);
        if (j != m-1) pque.push(make_pair(rat(a[i],b[cnt[i]++]),n-i));
    }
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
0