結果

問題 No.2453 Seat Allocation
ユーザー Taiki0715Taiki0715
提出日時 2023-09-01 22:21:26
言語 C++17(clang)
(17.0.6 + boost 1.83.0)
結果
AC  
実行時間 206 ms / 2,000 ms
コード長 5,074 bytes
コンパイル時間 6,492 ms
コンパイル使用メモリ 151,152 KB
実行使用メモリ 8,524 KB
最終ジャッジ日時 2023-09-07 15:36:00
合計ジャッジ時間 10,019 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,376 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 5 ms
4,380 KB
testcase_05 AC 188 ms
8,496 KB
testcase_06 AC 150 ms
4,444 KB
testcase_07 AC 29 ms
7,432 KB
testcase_08 AC 18 ms
4,380 KB
testcase_09 AC 206 ms
8,420 KB
testcase_10 AC 198 ms
8,524 KB
testcase_11 AC 205 ms
8,524 KB
testcase_12 AC 142 ms
4,552 KB
testcase_13 AC 148 ms
4,516 KB
testcase_14 AC 144 ms
4,492 KB
testcase_15 AC 150 ms
4,552 KB
testcase_16 AC 137 ms
4,572 KB
testcase_17 AC 1 ms
4,376 KB
testcase_18 AC 149 ms
6,084 KB
testcase_19 AC 163 ms
7,896 KB
testcase_20 AC 65 ms
5,440 KB
testcase_21 AC 110 ms
4,500 KB
testcase_22 AC 153 ms
5,488 KB
testcase_23 AC 1 ms
4,376 KB
testcase_24 AC 2 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
template<int mod>istream &operator>>(istream &is,static_modint<mod> &a){long long b;is>>b;a=b;return is;}
istream &operator>>(istream &is,modint &a){long long b;cin>>b;a=b;return is;}
#endif
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define reps(i,a,n) for(int i=(a);i<(n);i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcount(x)
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
  if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
  else return init;
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) static_cast<void>(0)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
void SOLVE();
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  #ifdef LOCAL
  clock_t start=clock();
  #endif
  int testcase=1;
  //cin>>testcase;
  for(int i=0;i<testcase;i++){
    SOLVE();
  }
  #ifdef LOCAL
  cout<<"time:";
  cout<<(clock()-start)/1000;
  cout<<"ms\n";
  #endif
}
struct fraction{
private:
  ll num,den;
public:
  void simple(){
    ll g=gcd(num,den);
    this->num/=g;
    this->den/=g;
  }
  fraction():num(0),den(1){}
  fraction(ll a):num(a),den(1){}
  fraction(ll a,ll b):num(a),den(b){
    this->simple();
    if(this->den<0)this->num*=-1,this->den*=-1;
  }
  static fraction raw(ll a,ll b){
    fraction ret;
    ret.num=a;
    ret.den=b;
    return ret;
  }
  friend fraction operator+(const fraction &a){return a;}
  friend fraction operator-(const fraction &a){return fraction::raw(-a.num,a.den);}
  friend fraction operator+(const fraction &a,const fraction &b){
    return fraction(a.num*b.den+b.num*a.den,a.den*b.den);
  }
  friend fraction operator-(const fraction &a,const fraction &b){
    return fraction(a.num*b.den-b.num*a.den,a.den*b.den);
  }
  friend fraction operator*(const fraction &a,const fraction &b){
    fraction c(a.num,b.den),d(b.num,a.den);
    c.num*=d.num;
    c.den*=d.den;
    return c;
  }
  friend fraction operator/(const fraction &a,const fraction &b){
    fraction c(a.num,b.num),d(b.den,a.den);
    c.num*=d.num;
    c.den*=d.den;
    if(c.den<0){
      c.num*=-1;
      c.den*=-1;
    }
    return c;
  }
  friend bool operator==(const fraction &a,const fraction &b){
    return a.num==b.num&&a.den==b.den;
  }
  friend bool operator!=(const fraction &a,const fraction &b){
    return !(a==b);
  }
  friend bool operator<(const fraction &a,const fraction &b){
    return (__int128_t)a.num*b.den<(__int128_t)b.num*a.den;
  }
  friend bool operator>(const fraction &a,const fraction &b){
    return (__int128_t)a.num*b.den>(__int128_t)b.num*a.den;
  }
  friend bool operator<=(const fraction &a,const fraction &b){
    return !(a>b);
  }
  friend bool operator>=(const fraction &a,const fraction &b){
    return !(b<b);
  }
  fraction &operator=(const fraction &a)=default;
  fraction &operator+=(const fraction &a){return *this=*this+a;}
  fraction &operator-=(const fraction &a){return *this=*this-a;}
  fraction &operator*=(const fraction &a){return *this=*this*a;}
  fraction &operator/=(const fraction &a){return *this=*this/a;}
  inline fraction inv() const{
    if(this->num>0)return fraction::raw(this->den,this->num);
    else return fraction::raw(-this->den,-this->num);
  }
  friend ostream &operator<<(ostream &os,const fraction &a){
    if(a.den==1)os<<a.num;
    else os<<a.num<<'/'<<a.den;
    return os;
  }
};
void SOLVE(){
  int n,m;
  cin>>n>>m;
  vector<ll>a(n),b(m);
  cin>>a>>b;
  auto comp=[](pair<fraction,int>x,pair<fraction,int>y){
    if(x.first!=y.first)return x.first<y.first;
    return x.second>y.second;
  };
  priority_queue<pair<fraction,int>,vector<pair<fraction,int>>,decltype(comp)>que{comp};
  vector<int>idx(n,0);
  rep(i,n){
    que.push({fraction(a[i],b[idx[i]]),i});
    idx[i]++;
  }
  vector<int>ans;
  while(!que.empty()){
    auto [now,id]=que.top();
    que.pop();
    ans.push_back(id);
    if(ans.size()==m)break;
    que.push({fraction(a[id],b[idx[id]++]),id});
  }
  ans++;
  rep(i,m)cout<<ans[i]<<endl;
}
0