#910624 (C++17) No.2453 Seat Allocation

• 問題: No.2453 Seat Allocation
• ユーザー: akiaa11
• 提出日時: 2023-09-02 18:28:59
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 197 ms / 2,000 ms
• コード長: 3,354 bytes
• コンパイル時間: 4,296 ms
• コンパイル使用メモリ: 271,368 KB
• 実行使用メモリ: 7,420 KB
• 最終ジャッジ日時: 2024-06-25 09:37:39
• 合計ジャッジ時間: 8,009 ms
• ジャッジサーバーID （参考情報）: judge4 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	2 ms; 5,376 KB
testcase_05	AC	178 ms; 7,420 KB
testcase_06	AC	149 ms; 5,376 KB
testcase_07	AC	28 ms; 6,808 KB
testcase_08	AC	19 ms; 5,376 KB
testcase_09	AC	197 ms; 7,284 KB
testcase_10	AC	195 ms; 7,160 KB
testcase_11	AC	197 ms; 7,292 KB
testcase_12	AC	147 ms; 5,376 KB
testcase_13	AC	148 ms; 5,376 KB
testcase_14	AC	145 ms; 5,376 KB
testcase_15	AC	155 ms; 5,376 KB
testcase_16	AC	147 ms; 5,376 KB
testcase_17	AC	2 ms; 5,376 KB
testcase_18	AC	149 ms; 5,472 KB
testcase_19	AC	162 ms; 7,012 KB
testcase_20	AC	62 ms; 5,376 KB
testcase_21	AC	105 ms; 5,376 KB
testcase_22	AC	148 ms; 5,376 KB
testcase_23	AC	2 ms; 5,376 KB
testcase_24	AC	2 ms; 5,376 KB

ソースコード

#include <bits/stdc++.h>
#include <atcoder/all>
#define SELECTER(_1,_2,_3,SELECT,...) SELECT
#define rep1(i,n) for(int i=0;i<(int)n;++i)
#define rep2(i,a,n) for(int i=(int)a;i<(int)n;++i)
#define rep(...) SELECTER(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define RSELECTER(_1, _2, _3, RSELECT, ...) RSELECT
#define rrep1(i,n) for(int i=(int)n-1;i>=0;--i)
#define rrep2(i,a,n) for(int i=(int)n-1;i>=(int)a;--i)
#define rrep(...) RSELECTER(__VA_ARGS__, rrep2, rrep1)(__VA_ARGS__)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fi first
#define se second
#define PrintR LogOutput
#ifdef _DEBUG
#define Log(...) LogOutput(__VA_ARGS__)
#else
#define Log(...)
#endif
using namespace std;
using namespace atcoder;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<long long,long long>;
using pdd=pair<long double,long double>;
using veci=vector<int>;
using vecpii=vector<pair<int,int>>;
using vecll=vector<long long>;
using vecpll=vector<pair<long long,long long>>;
using vecpdd=vector<pair<long double,long double>>;
using vecs=vector<string>;
using vecb=vector<bool>;
using vecd=vector<long double>;
using tp=tuple<int,int,int>;
using tpll=tuple<ll,ll,ll>;
using mint=modint998244353;
using mint10=modint1000000007;
template<typename T, typename S>
istream& operator>>(istream& in, pair<T, S>& a){return in >> a.first >> a.second;}
template<typename T, typename S>
ostream& operator<<(ostream& out, const pair<T, S>& a){return out << a.first << ' ' << a.second;}
ostream& operator<<(ostream& out, const mint& a){return out << a.val();}
ostream& operator<<(ostream& out, const mint10& a){return out << a.val();}
ostream& operator<<(ostream& out, const modint& a){return out << a.val();}
template<typename T>
ostream& operator<<(ostream& out, const vector<T>& d){for(int i = 0 ; i < d.size() ; ++i) out << d[i] << (i == d.size() - 1 ? "" : " "); return out;}
template<typename T, typename S>
pair<T, S> operator+(const pair<T, S>& a, const pair<T, S>& b){return {a.fi + b.fi, a.se + b.se};}
template<typename T, typename S>
pair<T, S> operator-(const pair<T, S>& a, const pair<T, S>& b){return {a.fi - b.fi, a.se - b.se};}
template<class T> inline bool chmax(T& a,T b){if(a<b) {a=b;return true;} return false;}
template<class T> inline bool chmin(T& a,T b){if(a>b) {a=b;return true;} return false;}
bool Judge(int i, int j, int h, int w){return i < 0 || j < 0 || i >= h || j >= w;}

constexpr ll INF=numeric_limits<ll>::max() / 4;
constexpr ll MOD=998244353;
const int vi[] = {0, 1, 0, -1}, vj[] = {1, 0, -1, 0};

template<typename... Args>
void LogOutput(Args&&... args){
	stringstream ss;
	((ss << args << ' '), ...);
	cout << ss.str().substr(0, ss.str().length() - 1) << endl;
}
template<typename T>
void LogOutput(vector<vector<T>>& data){for(auto d : data) LogOutput(d);}

int main(){
	ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, m;cin>>n>>m;
	veci a(n), b(m);
	rep(i, n) cin>>a[i];
	rep(i, m) cin>>b[i];
	auto f = [](tpll a, tpll b){
		auto [x, y, z] = a;
		auto [x2, y2, z2] = b;
		if(x * y2 == x2 * y) return z > z2;
		return x * y2 < x2 * y;
	};
	priority_queue<tpll, vector<tpll>, decltype(f)> q(f);
	rep(i, n) q.emplace(a[i], b[0], i);
	rep(i, m){
		auto [x, y, z] = q.top(); q.pop();
		int v = lower_bound(all(b), y) - b.begin();
		v++;
		if(v < m) q.emplace(x, b[v], z);
		cout<<z + 1<<endl;
	}
}