#395995 (C++14) No.918 LISGRID

• 問題: No.918 LISGRID
• ユーザー: sntea
• 提出日時: 2019-11-07 01:05:35
• 言語: C++14 (gcc 13.2.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 71 ms / 2,000 ms
• コード長: 4,665 bytes
• コンパイル時間: 2,656 ms
• コンパイル使用メモリ: 192,052 KB
• 実行使用メモリ: 15,964 KB
• 最終ジャッジ日時: 2023-10-13 02:54:03
• 合計ジャッジ時間: 6,700 ms
• ジャッジサーバーID （参考情報）: judge12 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 4,352 KB
testcase_01	AC	43 ms; 10,908 KB
testcase_02	AC	12 ms; 5,840 KB
testcase_03	AC	17 ms; 6,956 KB
testcase_04	AC	12 ms; 5,912 KB
testcase_05	AC	51 ms; 12,224 KB
testcase_06	AC	47 ms; 11,672 KB
testcase_07	AC	66 ms; 15,544 KB
testcase_08	AC	37 ms; 10,452 KB
testcase_09	AC	51 ms; 12,468 KB
testcase_10	AC	51 ms; 12,584 KB
testcase_11	AC	52 ms; 12,564 KB
testcase_12	AC	58 ms; 13,324 KB
testcase_13	AC	47 ms; 11,428 KB
testcase_14	AC	66 ms; 14,600 KB
testcase_15	AC	71 ms; 15,964 KB
testcase_16	AC	25 ms; 7,888 KB
testcase_17	AC	25 ms; 8,224 KB
testcase_18	AC	25 ms; 8,008 KB
testcase_19	AC	7 ms; 4,536 KB
testcase_20	AC	38 ms; 9,804 KB
testcase_21	AC	9 ms; 4,808 KB
testcase_22	AC	6 ms; 4,492 KB
testcase_23	AC	21 ms; 7,188 KB
testcase_24	AC	2 ms; 4,348 KB
testcase_25	AC	1 ms; 4,352 KB
testcase_26	AC	1 ms; 4,372 KB
testcase_27	AC	1 ms; 4,348 KB
testcase_28	AC	2 ms; 4,348 KB
testcase_29	AC	2 ms; 4,352 KB
testcase_30	AC	1 ms; 4,352 KB
testcase_31	AC	2 ms; 4,348 KB
testcase_32	AC	1 ms; 4,352 KB
testcase_33	AC	2 ms; 4,352 KB
testcase_34	AC	3 ms; 4,352 KB
testcase_35	AC	4 ms; 4,352 KB
testcase_36	AC	2 ms; 4,348 KB
testcase_37	AC	35 ms; 9,688 KB
testcase_38	AC	22 ms; 7,412 KB

ソースコード

#ifdef LOCAL111
	#define _GLIBCXX_DEBUG
#else
	#pragma GCC optimize ("O3")
	#define NDEBUG
#endif
// #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
const int INF = 1e9;
using namespace std;
template<typename T, typename U> ostream& operator<< (ostream& os, const pair<T,U>& p) { os << '(' << p.first << ' ' << p.second << ')'; return os; }

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n)  FOR(i,0,n)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#ifdef LOCAL111
	#define DEBUG(x) cout<<#x<<": "<<(x)<<endl
	template<typename T> void dpite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
#else
	#define DEBUG(x) true
	template<typename T> void dpite(T a, T b){ return; }
#endif
#define F first
#define S second
#define SNP string::npos
#define WRC(hoge) cout << "Case #" << (hoge)+1 << ": "
template<typename T> void pite(T a, T b){ for(T ite = a; ite != b; ite++) cout << (ite == a ? "" : " ") << *ite; cout << endl;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}

template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value!=0>::type
fill_v(U &u,const V... v){u=U(v...);}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_v(U &u,const V... v){
  for(auto &e:u) fill_v<T>(e,v...);
}

const array<int, 4> dx = {0, 1, 0, -1};
const array<int, 4> dy = {1, 0, -1, 0};


typedef long long int LL;
typedef unsigned long long ULL;
typedef pair<int,int> P;

void ios_init(){
	//cout.setf(ios::fixed);
	//cout.precision(12);
#ifdef LOCAL111
	return;
#endif
	ios::sync_with_stdio(false); cin.tie(0);
}

//library
typedef long long cost_t;

class Edge {
public:
	int to = -1;
	cost_t cost = -1;
	
	Edge(){
	}

	Edge(int x,cost_t y){
		to = x;
		cost = y;
	}

	// Edge(int x, int y, cost_t z){
	// 	// from = x;
	// 	to = y;
	// 	cost = z;
	// }

	// Edge(int x, int y, int r, cost_t z){
	// 	// from = x;
	// 	to = y;
	// 	cost = z;
	// 	// rev = r;
	// }

	bool operator< (const Edge& x) const {
		if(cost != x.cost) return cost < x.cost;
		return to < x.to;
	}

	bool operator> (const Edge& x) const {
		if(cost != x.cost) return cost > x.cost;
		return to > x.to;
	}
};

class Graph {
private:
	typedef vector<Edge> Edges;
	//const long long int INF = (long long)1e18;
	vector<Edges> v; 
	int n;
public:
	Graph(int x){
		n = x;
		v = vector<Edges>(x);
	}

	Graph(){}

	Edges& operator[](int x){
		return v[x];
	}

	const Edges& operator[](int x) const {
		return v[x];
	}

	int size() const {
		return n;
	}

	void add_edge(int from, const Edge &e){
		v[from].push_back(e);
	}

	void add_edge(int from, int to, cost_t cost = -1){
		add_edge(from,Edge(to,cost));
	}

	// void add_edge(int from, int to, cost_t cost = -1, int rev = -1){
	// 	add_edge(from,Edge(from,to,rev,cost));
	// }

	void add_uedge(int from, int to, cost_t cost = -1){
		add_edge(from,to,cost);
		add_edge(to,from,cost);
	}
};

vector<int> toposort(const Graph &g)
{
	int n = g.size();
	vector<int> res;
	res.reserve(n);
	vector<bool> used(n,false);
	function<void(int)> rec = [&](int p){
		if(used[p]) return;
		used[p] = true;
		for(auto&& e : g[p]) {
			rec(e.to);
		}
		res.push_back(p);
	};
	for(int i = 0; i < n; ++i) {
		if(!used[i]) rec(i);
	}
	reverse(res.begin(), res.end());
	return res;
}



int main()
{
	ios_init();
	int h, w;
	while(cin >> h >> w) {
		vector<int> a(h);
		REP(i, h) cin >> a[i];
		vector<int> b(w);
		REP(i, w) cin >> b[i];
		sort(ALL(a));
		sort(ALL(b));
		Graph g(h * w);
		auto id = [&](int i, int j) {
			return i * w + j;
		};

		REP(i, h) {
			DEBUG(a[i]);
			REP(j, a[i] - 1) {
				g.add_edge(id(i, j + 1), id(i, j));
			}
			FOR(j, a[i] - 1, w - 1) {
				g.add_edge(id(i, j), id(i, j + 1));	
			}
		}
		REP(j, w) {
			DEBUG(b[j]);
			REP(i, b[j] - 1) {
				g.add_edge(id(i + 1, j), id(i, j));	
			}
			FOR(i, b[j] - 1, h - 1) {
				g.add_edge(id(i, j), id(i + 1, j));
			}
		}


		auto topo = toposort(g);
		dpite(ALL(topo));
		reverse(ALL(topo));
		vector<vector<int>> ans(h, vector<int>(w));
		REP(i, SZ(topo)) {
			int x = topo[i] / w;
			int y = topo[i] % w;
			ans[x][y] = i + 1;
		}
		REP(i, h) {
			pite(ALL(ans[i]));
		}

	}
	return 0;
}