結果

問題 No.1123 Afforestation
コンテスト
ユーザー heno239
提出日時 2020-07-22 23:25:51
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
RE  
実行時間 -
コード長 5,318 bytes
コンパイル時間 1,661 ms
コンパイル使用メモリ 128,864 KB
実行使用メモリ 126,212 KB
最終ジャッジ日時 2024-06-23 01:16:24
合計ジャッジ時間 20,386 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 81 RE * 9
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);

ll mod_pow(ll x, ll n,ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1010000;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

#include<cstring>
struct edge { int to, cap, rev; };
vector<edge> G[100000];
bool used[100000];
void add_edge(int from, int to, int cap,int red=0) {
	G[from].push_back(edge{ to, cap-red, (int)G[to].size() });
	G[to].push_back(edge{ from, red, (int)G[from].size() - 1 });
}
int dfs(int v, int t, int f) {
	if (v == t)return f;
	used[v] = true;
	for (int i = 0; i < (int)G[v].size(); i++) {
		edge& e = G[v][i];
		if (!used[e.to] && e.cap > 0) {
			int d = dfs(e.to, t, min(f, e.cap));
			if (d > 0) {
				e.cap -= d;
				G[e.to][e.rev].cap += d;
				return d;
			}
		}
	}
	return 0;
}
int max_flow(int s, int t) {
	int flow = 0;
	for (;;) {
		memset(used, 0, sizeof(used));
		int f = dfs(s, t, mod);
		if (f == 0)return flow;
		flow += f;
	}
}

bool ish[2000][2000];
bool ist[2000][2000];
void solve(){
	int h, w; cin >> h >> w;
	vector<int> a(h), b(w);
	rep(i, h)cin >> a[i];
	rep(j, w)cin >> b[j];
	vector<int> cop = b;

	vector<int> ra = a, rb = b;

	int k; cin >> k;
	rep(i, k) {
		int x, y; cin >> x >> y; x--; y--;
		ish[x][y] = true;
	}
	{
		int sa = 0, sb = 0;
		rep(i, h)sa += a[i];
		rep(j, w)sb += b[j];
		if (sa != sb) {
			cout << ":(\n"; return;
		}
	}
	vector<P> va;
	rep(i, h)va.push_back({ a[i],i });
	sort(all(va), greater<P>());
	for(P p:va) {
		int i = p.second;
		vector<P> vs;
		rep(j, w) {
			vs.push_back({ cop[j],j });
		}
		sort(all(vs), greater<P>());
		rep(j, a[i]) {
			int id = vs[j].second;
			if (cop[id] == 0) {
				cout << ":(\n"; return;
			}
			ist[i][id] = true;
			//cout << "? " << i << " " << id << "\n";
			cop[id]--;
		}
	}

	int tmp = 0;
	rep(i, h)rep(j, w) {
		if (ish[i][j]) {
			if (ist[i][j]) {
				ra[i]--; rb[j]--;
				tmp++;
			}
			else {
				//
			}
		}
		else{
			if (ist[i][j]) {
				add_edge(i, h + j, 1, 1);
			}
			else {
				add_edge(i, h + j, 1, 0);
			}
		}
	}
	//cout << "wow " << tmp << "\n";
	int sta = h + w;
	int goa = sta + 1;
	rep(i, h) {
		add_edge(sta, i, a[i], ra[i]);
	}
	rep(j, w) {
		add_edge(j + h, goa, b[j], rb[j]);
	}
	int f = max_flow(sta, goa);
	if (f != tmp) {
		cout << ":(\n"; return;
	}
	rep(i, h) {
		rep(j, w)ist[i][j] = false;
		for (edge e : G[i]) {
			if(e.to != sta) {
				if (e.cap == 0) {
					//cout << "eee " << i << " " << e.to << "\n";
					ist[i][e.to-w] = true;
				}
			}
		}
	}
	vector<int> ca(h), cb(w);
	rep(i, h) {
		rep(j, w)if (ist[i][j]) {
			ca[i]++; cb[j]++;
		}
	}
	assert(a == ca && b == cb);
	cout << "Yay!\n";
	rep(i, h){
		rep(j, w) {
			if (ish[i][j])cout << "x";
			else {
				if (ist[i][j])cout << "o";
				else cout << ".";
			}
		}
		cout << "\n";
	}
}




signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//cout << grandy(2, 3, false, false) << "\n";
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0