結果

問題 No.2453 Seat Allocation
ユーザー hamathhamath
提出日時 2023-09-01 23:03:16
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 88 ms / 2,000 ms
コード長 7,483 bytes
コンパイル時間 2,747 ms
コンパイル使用メモリ 221,364 KB
実行使用メモリ 9,644 KB
最終ジャッジ日時 2023-09-07 15:37:17
合計ジャッジ時間 5,032 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 1 ms
4,376 KB
testcase_05 AC 60 ms
8,808 KB
testcase_06 AC 36 ms
4,380 KB
testcase_07 AC 18 ms
9,044 KB
testcase_08 AC 7 ms
4,380 KB
testcase_09 AC 87 ms
9,644 KB
testcase_10 AC 80 ms
9,216 KB
testcase_11 AC 88 ms
8,632 KB
testcase_12 AC 29 ms
4,380 KB
testcase_13 AC 32 ms
4,380 KB
testcase_14 AC 36 ms
4,380 KB
testcase_15 AC 40 ms
4,384 KB
testcase_16 AC 30 ms
4,376 KB
testcase_17 AC 1 ms
4,380 KB
testcase_18 AC 59 ms
6,108 KB
testcase_19 AC 72 ms
9,380 KB
testcase_20 AC 30 ms
5,512 KB
testcase_21 AC 35 ms
4,384 KB
testcase_22 AC 51 ms
5,152 KB
testcase_23 AC 1 ms
4,376 KB
testcase_24 AC 1 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#ifdef LOCAL
//#define _GLIBCXX_DEBUG
#else
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#endif

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<char> Vc;
typedef vector<P> VP;
typedef vector<VP> VVP;
typedef vector<Vec> VV;
typedef vector<Vi> VVi;
typedef vector<Vc> VVc;
typedef vector<VV> VVV;
typedef vector<VVV> VVVV;
#define MAKEVV(variable, a, ...) VV variable(a, Vec(__VA_ARGS__))
#define MAKEVVc(variable, a, ...) VVc variable(a,Vc(__VA_ARGS__))
#define MAKEVVV(variable, a, b, ...) VVV variable(a, VV(b, Vec(__VA_ARGS__)))
#define MAKEVVVV(variable, a, b, c, ...) VVVV variable(a, VVV(b, (VV(c, Vec(__VA_ARGS__)))))

#define endl '\n'
#define REP(i, a, b) for(ll i=(a); i<(b); i++)
#define PER(i, a, b) for(ll i=(a); i>=(b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF = 4'000'000'000'000'000'010LL;
const ll MOD=998244353;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define rALL(v) v.rbegin(), v.rend()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a,b)
#define Each(a,b) for(auto &a :b)
#define rEach(i, mp) for (auto i = mp.rbegin(); i != mp.rend(); ++i)
#define SUM(a) accumulate(ALL(a),0LL)
#define outminusone(a) cout<< ( a==INF ? -1 : a ) <<endl
#define Uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define fi first
#define se second

template<class T, class S>bool chmax(T &a, const S &b) { if (a<b) { a=b; return true; } return false; }
template<class T, class S>bool chmin(T &a, const S &b) { if (b<a) { a=b; return true; } return false; }
template<class T>auto lb(vector<T> &X, T x){return lower_bound(ALL(X),x) - X.begin();}
template<class T>auto ub(vector<T> &X, T x){return upper_bound(ALL(X),x) - X.begin();}
ll popcnt(ll x){return __builtin_popcount(x);}
ll topbit(ll t){return t==0?-1:63-__builtin_clzll(t);}
ll floor(ll y,ll x){assert(x != 0);if(x < 0){y *= -1; x *= -1;}if(y < 0){return (y-x+1)/x;}return y/x;};
ll ceil(ll y, ll x){assert(x != 0);if(x < 0){y *= -1; x *= -1;}if(y < 0){return y/x;}return (y+x-1)/x;};

template<typename T1, typename T2>istream &operator>>(istream &i, pair<T1, T2> &p) { return i>>p.first>>p.second; }
template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T1, typename T2>ostream &operator<<(ostream &s, const pair<T1, T2> &p) { return s<<"("<<p.first<<", "<<p.second<<")"; }
template<class T>ostream &operator<<(ostream &os, const vector<T> &v) {bool f = false;for(const auto &d: v) {if(f) os<<" ";f = true;os<<d;}return os;}
template <class T> ostream& operator<<(ostream& os, const set<T>& s) {os << "{";bool f = false;for (auto d : s) {if (f) os << ", ";f = true;os << d;}return os << "}";}
template <class T> ostream& operator<<(ostream& os, const multiset<T>& s) {os << "{";bool f = false;for (auto d : s) {if (f) os << ", ";f = true;os << d;}return os << "}";}
template<class T, class U>ostream &operator<<(ostream &os, const map<T, U> &s) {bool f = false;os<<endl;for(auto p: s) {if(f) os<<endl;f = true;os<<p.first<<": "<<p.second;}return os<<endl;}
void out() { cout << endl; }
template <class Head, class... Tail> void out(const Head &head, const Tail &...tail) {cout << head;if(sizeof...(tail)) cout << ' ';out(tail...);}

#ifdef LOCAL
template<typename T>ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {int len=vv.size();for(int i=0; i<len; ++i) {if(i==0)s<<endl;s<<i<<":"<<vv[i];if(i!=len-1)s<<endl;}return s;}
struct PrettyOS {ostream& os;bool first;template <class T> auto operator<<(T&& x) {if (!first) os << ", ";first = false;os << x;return *this;}};
template <class... T> void dbg0(T&&... t) {(PrettyOS{cerr, true} << ... << t);}
#define dbg(...)do {cerr << #__VA_ARGS__ << ":  ";dbg0(__VA_ARGS__);cerr << endl;} while (false);
#else
#define dbg(...)
#endif


struct fraction {
    //overflow注意 2e9以下想定 怪しかったらcpp_intに書き換える
    ll y;//分子
    ll x;//分母
    //verify https://atcoder.jp/contests/abc248/tasks/abc248_e
    //verify https://atcoder.jp/contests/abc274/tasks/abc274_f
    //verify(ll) https://atcoder.jp/contests/abc168/submissions/43728796
    fraction(){}
    fraction(ll y, ll x):y(y), x(x) {
        ll G = gcd(x,y);
        if(x == 0){
            this->y = 1;
            this->x = 0;
        }else if(y == 0){
            this->y = 0;
            this->x = 1;
        }else{
            if(x < 0){
                this->y *= -1;
                this->x *= -1;
            }
            this->y /= abs(G);
            this->x /= abs(G);
        }
    }
    using F = fraction;
    F operator-() const {
        F f;
        f.y = -y;
        f.x = x;
        return f;
    }
    F operator+(const F& r) const { return {r.x * y + x * r.y, x * r.x}; }
    F operator-(const F& r) const { return *this + (-r); }
    F operator*(const F& r) const { return {y * r.y, x * r.x}; }
    F operator/(const F& r) const { return {y * r.y, x * r.y}; }
    F& operator+=(const F& r) { return *this = *this + r; }
    F& operator-=(const F& r) { return *this = *this - r; }
    F& operator*=(const F& r) { return *this = *this * r; }
    F& operator/=(const F& r) { return *this = *this / r; }
    bool operator<(const F& r) const { return y * r.x < x * r.y; }
    bool operator>(const F& r) const { return r < *this; }
    bool operator<=(const F& r) const { return !(r < *this); }
    bool operator>=(const F& r) const { return !(*this < r); }
    bool operator==(const F& r) const { return !(*this < r) && !(r < *this); }
    bool operator!=(const F& r) const { return !(*this == r); }
    friend ostream& operator<<(ostream& os, const F& v) {
        return os << v.y << '/' << v.x;
    }
};

#ifdef  LOCAL
template<typename T>void qdbg(queue<T> Q){while(!Q.empty()){T &x = Q.front();Q.pop();cerr<<x<<" ";;}cerr<<endl;}
template<typename T>void qdbg(deque<T> Q){while(!Q.empty()){T &x = Q.front();Q.pop_front();cerr<<x<<" ";;}cerr<<endl;}
template<typename T, typename U, typename V>void qdbg(priority_queue<T,U,V> Q){while(!Q.empty()){T x = Q.top();Q.pop();cerr<<x<<" ";;}cerr<<endl;}
#else
template<typename T>void qdbg(queue<T> &q){}
template<typename T>void qdbg(deque<T> &q){}
template<typename T, typename U, typename V>void qdbg(priority_queue<T,U,V> &q){}
#endif

int solve(){
    ll n;
    cin>>n;
    ll m;
    cin>>m;
    using FP = pair<fraction,ll>;
    auto comp = [](FP a, FP b){
        if(a.fi == b.fi){
            return a.se > b.se;
        }
        return a.fi < b.fi;
    };
    priority_queue<FP, vector<FP>, decltype(comp)> pq(comp);
    Vec a(n);
    Vec b(m);
    Vec cnt(n);
    cin>>a>>b;
    rep(i,n){
        pq.emplace(fraction(a[i],b[0]),i);
    }
    qdbg(pq);
    ll counter = 0;
    while(!pq.empty()){
        auto [c, i] = pq.top();
        pq.pop();
        dbg(c,i);
        out(i+1);
        counter++;
        if(counter == m)break;

        cnt[i]++;
        pq.emplace(fraction(a[i],b[cnt[i]]),i);
    }
    return  0;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout<<std::setprecision(20);
//    ll T;
//    cin>>T;
//    while(T--)
    solve();
}
0