結果

問題 No.2453 Seat Allocation
ユーザー woodywoodywoodywoody
提出日時 2023-09-01 21:52:48
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 109 ms / 2,000 ms
コード長 9,994 bytes
コンパイル時間 3,819 ms
コンパイル使用メモリ 235,640 KB
実行使用メモリ 8,544 KB
最終ジャッジ日時 2023-09-07 15:35:14
合計ジャッジ時間 6,245 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 74 ms
8,512 KB
testcase_06 AC 50 ms
4,712 KB
testcase_07 AC 20 ms
7,756 KB
testcase_08 AC 7 ms
4,380 KB
testcase_09 AC 109 ms
8,544 KB
testcase_10 AC 98 ms
8,448 KB
testcase_11 AC 106 ms
8,492 KB
testcase_12 AC 30 ms
4,604 KB
testcase_13 AC 35 ms
4,476 KB
testcase_14 AC 57 ms
4,476 KB
testcase_15 AC 49 ms
4,516 KB
testcase_16 AC 38 ms
4,612 KB
testcase_17 AC 2 ms
4,380 KB
testcase_18 AC 74 ms
6,220 KB
testcase_19 AC 87 ms
7,760 KB
testcase_20 AC 38 ms
5,544 KB
testcase_21 AC 45 ms
5,028 KB
testcase_22 AC 65 ms
5,432 KB
testcase_23 AC 1 ms
4,376 KB
testcase_24 AC 2 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define retval(x) {cout << #x << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define assertmle(x) if (!x) {vi v(3e8);}
#define asserttle(x) if (!x) {while(1){}}
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define no {cout <<"No"<<endl;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#include "./debug/localDebug.cpp"
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show1(a) cerr<<#a<<" = "<<a<<endl
#define show2(a,b) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<endl
#define show3(a,b,c) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<endl
#define show4(a,b,c,d) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<endl
#define show5(a,b,c,d,e) cerr<<#a<<" = "<<a<<" : "<<#b<<" = "<<b<<" : "<<#c<<" = "<<c<<" : "<<#d<<" = "<<d<<" : "<<#e<<" = "<<e<<endl
#define DEBUG_LINE cout << "DEBUG_LINE : " << __LINE__ << endl
#define showv(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) {cout<<#v<<endl; fore(vy , v) cout << vy << "\n";}
#define showvm(v) {cout<<#v<<" : "; fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) {cout<<#v<<endl; fore(vy , v) cout << vy.val() << "\n";}
#define showmat(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg << " "; cout << endl;}}
#define showmatm(v) {cout<<#v<<endl; fore(row , v) { fore(seg , row) cout << seg.val() << " "; cout << endl;}}
#else
#define showp(p)
#define show1(a)
#define show2(a,b)
#define show3(a,b,c)
#define show4(a,b,c,d)
#define show5(a,b,c,d,e)
#define DEBUG_LINE
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#define showmat(v)
#define showmatm(v)
#endif
#define overload5(a,b,c,d,e,f, ...) f
#define show(...) overload5(__VA_ARGS__, show5, show4, show3, show2, show1)(__VA_ARGS__)

// 偏角モード
// #define DECLINATION 

struct rational{
    ll num; // 分子
    ll den; // 分母
#if defined(DECLINATION)
    int quad; // 第1象限～4象限(境界上に注意)
#endif

    rational(ll num_=0,ll den_=0){
        assert(num_ != 0 || den_ != 0);
#if defined(DECLINATION)
        if     (den_ >= 0 && num_ >  0) quad = 1;
        else if(den_ <  0 && num_ >= 0) quad = 2;
        else if(den_ <= 0 && num_ <  0) quad = 3;
        else if(den_ >  0 && num_ <= 0) quad = 4;
        if (num_ == 0){
            num = 0;
            den = 1;
            if (den_ < 0) den *= -1;
        }else if(den_ == 0){
            num = 1;
            if (num_ < 0) num *= -1;
            den = 0;
        }else{
            ll d = gcd(abs(num_),abs(den_));
            num = num_/d;
            den = den_/d;
        }
#else
        if (num_ == 0){
            num = 0;
            den = 1;
        }else if(den_ == 0){
            num = 1;
            den = 0;
        }else{
            ll d = gcd(abs(num_),abs(den_));
            num = abs(num_)/d;
            den = abs(den_)/d;
            if((num_ < 0 && den_ > 0) || (num_ > 0 && den_ < 0)) num *= -1;
        }
#endif
    }
    rational operator+(rational const other) const{
        if (den == 0 || other.den == 0) return rational(1,0);
        assert(abs(other.num) < LLONG_MAX/abs(den));
        assert(abs(num) < LLONG_MAX/abs(other.den));
        ll p,q;
        p = num*other.den + den*other.num;
        q = den*other.den;
        return rational(p,q);
    }
    rational operator-(rational const other) const{
        if (den == 0 || other.den == 0) return rational(1,0);
        assert(abs(other.num) < LLONG_MAX/abs(den));
        assert(abs(num) < LLONG_MAX/abs(other.den));
        ll p,q;
        p = num*other.den - den*other.num;
        q = den*other.den;
        return rational(p,q);
    }
    rational operator*(rational const other) const{
        if (den == 0 || other.den == 0) return rational(1,0);
        if (other.num == 0) return rational(0,1);
        assert(abs(num) < LLONG_MAX/abs(other.num));
        assert(abs(other.den) < LLONG_MAX/abs(den));
        ll p,q;
        p = num*other.num;
        q = den*other.den;
        return rational(p,q);
    }
    rational operator*(ll const other) const{
        if (other == 0) return rational(0,1);
        assert(abs(num) < LLONG_MAX/abs(other));
        ll p,q;
        p = num*other;
        q = den;
        return rational(p,q);
    }
    rational operator/(rational const other) const{
        rational r(other.den , other.num);
        return *this * r;
    }
    rational operator/(ll const other) const{
        assert(abs(other)>0);
        assert(abs(den) < LLONG_MAX/abs(other));
        ll p,q;
        p = num;
        q = den*other;
        return rational(p,q);
    }
    rational operator+=(rational const other){
        *this = *this + other;
        return *this;
    }
    rational operator-=(rational const other){
        *this = *this - other;
        return *this;
    }
    rational operator*=(rational const other){
        *this = *this * other;
        return *this;
    }
    rational operator*=(ll const other){
        *this = *this * other;
        return *this;
    }
    rational operator/=(rational const other){
        *this = *this / other;
        return *this;
    }
    rational operator/=(ll const other){
        *this = *this * other;
        return *this;
    }

    bool operator==(rational const other) const{
        return (num == other.num) && (den == other.den);
    }
    bool operator!=(rational const other) const{
        return (num != other.num) || (den != other.den);
    }
    bool operator<(rational const other) const{
#if defined(DECLINATION)
        if (quad != other.quad){
            return ((quad+1)%4 < (other.quad+1)%4);
        }else{
            if (abs(other.den)) assert(abs(num) < LLONG_MAX/abs(other.den));
            if (abs(den)) assert(abs(other.num) < LLONG_MAX/abs(den));
            return num*other.den < den*other.num;
        }
#else
        return num*other.den < den*other.num;
#endif
    }
    bool operator<=(rational const other) const{
        if (*this == other) return true;
        else return (*this < other);
    }
    bool operator>(rational const other) const{
        return !(*this <= other);
    }
    bool operator>=(rational const other) const{
        return !(*this < other);
    }
};

// rational(a,b) でa/bを既約分数の状態で管理。
// a == 0 && b == 0のときアサートが出る

// DECLINATIONが定義されている場合
//  ・大小関係は偏角(a,b)を参照する。atan2と同じ扱い。

// 定義されていない場合
//  ・大小関係はa/bの値を参照する。
//  ・a*b < 0の時、a<0 , b>0で管理。
//  ・a == 0 の時　(0,1)、b == 0 の時 (1,0)で管理。

void solve(){
    int n,m; cin>>n>>m;
    vl a(n),b(m);
    rep(i,n) cin>>a[i];
    rep(i,m) cin>>b[i];
    sort(rng(b));
    vi idx(n);
    priority_queue<pair<rational, int>> q;
    rep(i,n){
        q.push({rational(a[i], b[idx[i]++]), (n-i)});
    }
    vi ans;
    rep(i,m){
        pair<rational, int> p = q.top();
        q.pop();
        int id = (n-p.se);
        ans.pb(id+1);
        rational nxt(0,1);
        if (idx[id]==m){
            nxt = rational(0,1);
        }else{
            nxt = rational(a[id], b[idx[id]++]);
        }
        q.push({nxt, (n-id)});
    }
    outv;

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}
0