1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
| #include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
struct PairHash {inline std::size_t operator()(const std::pair<int,int> & v) const {return v.first*31+v.second;}};
#define MAX_N 202020
#define INF 987654321
#define EPS 1e-9
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vall3 vector<array<ll,3>>
#define all3 array<ll,3>
#define all5 array<ll,5>
#define vall5 vector<all5>
#define vll vector<ll>
#define vs vector<string>
#define usll unordered_set<ll>
#define uspll unordered_set<pll, PairHash>
#define vvs vector<vs>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
using namespace std;
struct Comp {
bool operator()(pll& a, pll& b) {
ll sa = a.first + a.second, sb = b.first + b.second;
if(sa == sb) return a.first > b.first;
return sa > sb;
}
};
vvll solve(vll& A, ll n) {
vvll res(n, vll(n,INF));
vll c = A;
unordered_map<ll, priority_queue<pll, vpll, Comp>> mp;
ll dy[4]{-1,0,0,1}, dx[4]{0,-1,1,0};
for(ll i = 0; i < n; i++) {
for (ll j = 0; j < i; j++) {
res[i][j] = 0;
}
res[i][i] = A[i];
for(ll j = 0; j < 4; j++) {
mp[A[i]].push({i + dy[j], i + dx[j]});
}
c[i]--;
}
for(ll rep = 0; rep < n; rep++) {
for(ll i = 0; i < n; i++) {
if(!c[i]) continue;
auto& pq = mp[A[i]];
bool inc = false;
while(!pq.empty()) {
auto [y, x] = pq.top(); pq.pop();
if(0 <= y and y < n and 0 <= x and x < n and res[y][x] == 0) {
res[y][x] = A[i];
for(ll j = 0; j < 4; j++) {
ll ny = y + dy[j], nx = x + dx[j];
if(0 <= ny and ny < n and 0 <= nx and nx < n and res[ny][nx] == 0)
pq.push({ny,nx});
}
c[i]--;
inc = true;
break;
}
}
if(!inc)
return {{-1}};
}
}
return res;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll tc = 1;
for(ll i = 1; i <= tc; i++) {
ll n;
cin>>n;
vll A(n);
for(ll j = 0; j < n; j++) cin>>A[j];
vvll res = solve(A, n);
for(auto& row : res) {
for(auto& c : row) {
if(c == INF) break;
cout<<c<<' ';
}
cout<<endl;
}
}
return 0;
}
|
