結果
問題 | No.918 LISGRID |
ユーザー |
|
提出日時 | 2019-10-25 22:33:30 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 44 ms / 2,000 ms |
コード長 | 4,549 bytes |
コンパイル時間 | 2,199 ms |
コンパイル使用メモリ | 183,292 KB |
実行使用メモリ | 13,952 KB |
最終ジャッジ日時 | 2024-09-13 04:48:28 |
合計ジャッジ時間 | 5,564 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 36 |
ソースコード
#include <bits/stdc++.h>#define whlie while#define pb push_back#define eb emplace_back#define fi first#define se second#define rep(i,N) for(int i = 0; i < (N); i++)#define repr(i,N) for(int i = (N) - 1; i >= 0; i--)#define rep1(i,N) for(int i = 1; i <= (N) ; i++)#define repr1(i,N) for(int i = (N) ; i > 0 ; i--)#define each(x,v) for(auto& x : v)#define all(v) (v).begin(),(v).end()#define sz(v) ((int)(v).size())#define vrep(v,it) for(auto it = v.begin(); it != v.end(); it++)#define vrepr(v,it) for(auto it = v.rbegin(); it != v.rend(); it++)#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)#define inl(...) ll __VA_ARGS__; in(__VA_ARGS__)#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)using namespace std; void solve();using ll = long long; using vl = vector<ll>;using vi = vector<int>; using vvi = vector< vector<int> >;constexpr int inf = 1001001001;constexpr ll infLL = (1LL << 61) - 1;struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);} } iosetupnya;template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }template<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; }template<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; }template<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); rep(i,s) os << (i ? " " : "") << v[i]; return os;}template<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; }void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}template<typename T>void die(T x){out(x); exit(0);}#ifdef NyaanDebug#include "NyaanDebug.h"#define trc(...) do { cerr << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0)#define trca(v,N) do { cerr << #v << " = "; array_out(v , N);cout << endl;} while(0)#else#define trc(...)#define trca(...)int main(){solve();}#endifusing P = pair<int,int>; using vp = vector<P>;constexpr int MOD = /** 1000000007; //*/ 998244353;////////////////// トポロジカルソート 任意のグラフに使用可能(たぶん) O(E+V)// DAGであるときはtrueを、閉路が存在するときfalseを返すtemplate<typename T>bool TopologicalSort(vector<int> &v , T &g){int N = g.size();vector<int> marked(N , 0) , temp(N , 0);v.clear(); v.reserve(N);// 訪問して帰りがけ順にvに追加auto visit = [&](auto f, int i) -> bool{if(temp[i] == 1) return false;if(marked[i] == 0){temp[i] = 1;for(auto &e : g[i]){if(f(f , e) == false) return false;}marked[i] = 1;v.push_back(i);temp[i] = 0;}return true;};for(int i = 0 ; i < N ; i++){if(marked[i] == 0) {if(visit(visit , i) == false) return false;}}reverse( v.begin() , v.end() );return true;}void solve(){ini(H , W);vi a(H); vi b(W); in(a , b);sort(rbegin(a) , rend(a)); sort(rbegin(b) , rend(b));trc(a);auto idx = [&](int h,int w)->int{assert(0<=h&&0<=w&&h<H&&w<W); return h * W + w;};vvi g(H * W);rep(i,H){if(a[i] == 1){rep(j,W - 1) g[idx(i,j+1)].pb(idx(i,j));}else if(a[i] == W){rep(j,W - 1){g[idx(i,j)].pb(idx(i,j+1));}}else{for(int j = 0; j < a[i] - 1; j++){g[idx(i,j)].pb(idx(i,j+1));trc(idx(i,j) , idx(i ,j+1));}for(int j = a[i] - 1; j < W - 1; j++){g[idx(i,j+1)].pb(idx(i,j));trc(idx(i,j + 1) , idx(i ,j));}}}rep(j,W){if(b[j] == 1){rep(i,H - 1) g[idx(i+1,j)].pb(idx(i,j));}else if(b[j] == H){rep(i,H - 1) g[idx(i,j)].pb(idx(i+1,j));}else{for(int i = 0; i < b[j] - 1; i++){g[idx(i,j)].pb(idx(i+1,j));}for(int i = b[j] - 1; i < H - 1; i++){g[idx(i+1,j)].pb(idx(i,j));}}}vi v;if( TopologicalSort(v , g) == false) {trc("hoge"); exit(1);}trc(v);vvi ans(H , vi(W , 0));rep(x , H * W) ans[v[x] / W][v[x] % W] = x + 1;each(x , ans) out(x);}