/*input
0 4 1 5
0 0 1 0
0 0 0 1
0 1 1 1
1 1 0 1
*/
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<typename A, typename B>
using omap = tree <A, B, less<A>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename A>
using oset = tree <A, null_type, less<A>, rb_tree_tag, tree_order_statistics_node_update>;
const ll mod = 1e9 + 7;
ll ran(ll a, ll b)
{
//return a + (ll)(rng() % (b - a + 1));
return uniform_int_distribution<ll>(a, b)(rng);
}
ll power(ll x, ll p)
{
if (abs(x) >= mod)
x %= mod;
if (x < 0)
x += mod;
if (abs(p) >= mod - 1)
p %= mod - 1;
if (p < 0)
p += mod - 1;
ll r = 1;
while (p)
{
if (p % 2)
r = (r * x) % mod;
x = (x * x) % mod;
p /= 2;
}
return r;
}
void solve()
{
int t, n, k1, k2;
cin >> t >> n >> k1 >> k2;
int a[n][n];
int c = 0;
for (int i = n - 1; i >= 0; i--)
{
for (int j = n - 1; j >= 0; j--)
{
cin >> a[i][j];
c += a[i][j];
}
}
int sp[n][n + 1];
for (int i = 0; i < n; i++)
{
sp[i][0] = 0;
for (int j = 0; j < n; j++)
sp[i][j + 1] = sp[i][j] + a[i][j];
}
int x[n + 2];
int* h = x + 1;
h[-1] = n;
h[n] = 0;
{
for (int i = 0; i < n; i++)
h[i] = 0;
while (c > 0)
{
int j = rng() % n;
if (h[j] < n)
{
if (a[j][h[j]] || rng() % 10 == 0) {
h[j]++;
c--;
}
}
}
sort(h, h + n, greater<int>());
}
int D = 30;
int S = 150;
if (n <= 50)
{
D = 30;
S = 300;
}
int dp[n][2 * D + 1][2 * S + 1];
int bst = -1;
for (int t = 0;; t++)
{
for (int i = 0; i < n; i++)
for (int d = -D; d <= D; d++)
for (int s = -S; s <= S; s++)
dp[i][d + D][s + S] = -1e8;
for (int i = 0; i < n; i++)
{
for (int d = -D; d <= D; d++)
{
int hi = h[i] + d;
if (hi < 0 || hi > n)
continue;
if (i == 0)
{
dp[i][d + D][d + S] = sp[i][hi];
}
else
{
for (int dj = max(hi - h[i - 1], -D); dj <= D; dj++)
{
for (int s = max(-S, -S + d); s <= min(S, S + d); s++)
{
int sj = s - d;
dp[i][d + D][s + S] = max(dp[i][d + D][s + S], dp[i - 1][dj + D][sj + S] + sp[i][hi]);
}
}
}
}
}
int s = 0;
int i = n - 1;
int di = 0;
{
pair<int, int>mx = { -1000, -1000};
for (int d = -D; d <= D; d++)
mx = max(mx, {dp[i][d + D][s + S], d});
if (mx.first <= bst)
break;
bst = mx.first;
di = mx.second;
}
while (i >= 0)
{
h[i] += di;
int x = 0;
if (i > 0)
for (int dj = -D; dj <= D; dj++)
{
if (h[i - 1] + dj >= h[i])
{
int sj = s - di;
if (s >= max(-S, -S + di) && s <= min(S, S + di))
{
if (dp[i][di + D][s + S] == dp[i - 1][dj + D][sj + S] + sp[i][h[i]])
x = dj;
}
}
}
s -= di;
i--;
di = x;
}
}
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
a[i][j] = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < h[i]; j++)
a[i][j] = 1;
for (int i = n - 1; i >= 0; i--)
{
for (int j = n - 1; j >= 0; j--)
{
cout << a[i][j] << " ";
}
cout << "\n";
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
solve();
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
1748 KB |
K = 17 |
| 2 |
Correct |
29 ms |
7508 KB |
K = 576 |
| 3 |
Execution timed out |
2057 ms |
22604 KB |
Time limit exceeded |
| 4 |
Partially correct |
246 ms |
22760 KB |
K = 22568 |
| 5 |
Partially correct |
572 ms |
22768 KB |
K = 17887 |
| 6 |
Partially correct |
1190 ms |
22764 KB |
K = 21105 |
| 7 |
Partially correct |
233 ms |
22764 KB |
K = 22236 |
| 8 |
Correct |
901 ms |
22768 KB |
K = 19611 |
| 9 |
Correct |
472 ms |
22760 KB |
K = 20766 |
| 10 |
Partially correct |
923 ms |
22764 KB |
K = 21499 |
