Submission #14129871

---

Source Code Expand

/* cmd
	g++ "$F"
*/
#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;

int main()
{
// Inputs
	int N;
	cin >> N;

	vector<vector<int>> Shelves(N);
	for (int i = 0; i < N; ++i) {
		int k;
		cin >> k;
		Shelves[i].resize(k);
		for (int j = 0; j < k; ++j) {
			cin >> Shelves[i][j];
		}
		swap_ranges(Shelves[i].begin(), Shelves[i].begin()+k/2,
		            Shelves[i].rbegin()
		);
	}

	int M;
	cin >> M;

	vector<int> A(M);
	for (int i = 0; i < M; ++i) {
		cin >> A[i];
	}

// Prepare
	map<int,int> Firsts, Seconds;
	for (int i = 0; i < N; ++i) {
		Firsts.emplace(Shelves[i].back(), i);
		if (1 < Shelves[i].size()) {
			Seconds.emplace(Shelves[i].rbegin()[1], i);
		}
	}

// Run
	for (int a: A) {
		auto& fs = (a==1 || Seconds.empty() || Firsts.rbegin()->first > Seconds.rbegin()->first) ? Firsts : Seconds;
		const int due = fs.rbegin()->first;
		const int shelfNo = fs.rbegin()->second;
		auto& shelf = Shelves[shelfNo];

		cout << due << endl;

		fs.erase(--fs.end());
		shelf.erase(shelf.end()-1-(&fs==&Seconds));
		if (&fs == &Firsts) {
			if (! shelf.empty()) {
				Firsts.emplace(shelf.back(), shelfNo);
				Seconds.erase(shelf.back());
			}
		}
		if (1 < shelf.size()) {
			Seconds.emplace(shelf.rbegin()[1], shelfNo);
		}
	}

	return 0;
}

Submission Info

Judge Result