| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 258925 |
2020-08-06T19:40:05 Z |
Vimmer |
Domino (COCI15_domino) |
C++14 |
|
4000 ms |
283220 KB |
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 100050
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9
using namespace std;
//using namespace __gnu_pbds;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef short int si;
typedef array <ll, 5> a5;
typedef array <ll, 4> a4;
//typedef tree <ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
bool mk[2005][2005];
int a[2005][2005], id = 2, idr[2005][2005];
ll sum, ans, dp[2005], pr[2005];
vector <a5> edges;
bool cmp(a4 x, a4 y) {return a[x[0]][x[1]] + a[x[2]][x[3]] > a[y[0]][y[1]] + a[y[2]][y[3]];}
vector <a4 > gr;
set <pair <int, int> > wh, bl;
void add(pair <int, int> t) {if (mk[t.F][t.S]) bl.insert({t.F, t.S}); else wh.insert({t.F, t.S});}
void add_edge(int from, int to, int cost)
{
edges.pb({from, to, cost, 0, 1});
edges.pb({to, from, -cost, 0, 0});
}
int main()
{
//freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);
ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
{
cin >> a[i][j];
sum += ll(a[i][j]);
if (i != 0) gr.pb({i, j, i - 1, j});
if (j != 0) gr.pb({i, j, i, j - 1});
if (!mk[i][j])
{
if (i + 1 != n) mk[i + 1][j] = 1;
if (j + 1 != n) mk[i][j + 1] = 1;
}
}
sort(gr.begin(), gr.end(), cmp);
for (int i = 0; i < min(50, sz(gr)); i++)
{
add({gr[i][0], gr[i][1]}); add({gr[i][2], gr[i][3]});
pair <int, int> pt; pt.F = gr[i][0]; pt.S = gr[i][1];
if (pt.F != 0) add({pt.F - 1, pt.S});
if (pt.S != 0) add({pt.F, pt.S - 1});
if (pt.F + 1 != n) add({pt.F + 1, pt.S});
if (pt.S + 1 != n) add({pt.F, pt.S + 1});
pt.F = gr[i][2]; pt.S = gr[i][3];
if (pt.F != 0) add({pt.F - 1, pt.S});
if (pt.S != 0) add({pt.F, pt.S - 1});
if (pt.F + 1 != n) add({pt.F + 1, pt.S});
if (pt.S + 1 != n) add({pt.F, pt.S + 1});
}
for (auto it : wh)
{
idr[it.F][it.S] = id++;
add_edge(0, idr[it.F][it.S], 0);
}
for (auto it : bl)
{
idr[it.F][it.S] = id++;
add_edge(idr[it.F][it.S], 1, 0);
}
for (auto it : bl)
for (auto itr : wh)
if (abs(itr.F - it.F) + abs(itr.S - it.S) == 1)
add_edge(idr[itr.F][itr.S], idr[it.F][it.S], -(a[itr.F][itr.S] + a[it.F][it.S]));
for (; k > 0; k--)
{
for (int i = 0; i < 2005; i++) dp[i] = 1e18;
dp[0] = 0;
for (int it = 0; it < 1000; it++)
for (int i = 0; i < sz(edges); i++)
{
int to = edges[i][1], from = edges[i][0], cost = edges[i][2], flow = edges[i][3], cap = edges[i][4];
if (flow < cap && dp[from] < 1e18 && dp[from] + cost < dp[to])
{
dp[to] = dp[from] + cost;
pr[to] = i;
}
}
ans += dp[1];
int v = 1;
while (v != 0)
{
int id = pr[v];
edges[id][3]++;
edges[id ^ 1][3]--;
v = edges[id][0];
}
}
cout << sum + ans << '\n';
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
158 ms |
20800 KB |
Output is correct |
| 2 |
Correct |
105 ms |
20160 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
1152 KB |
Output is correct |
| 2 |
Correct |
3 ms |
1024 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4094 ms |
273544 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
640 KB |
Output is correct |
| 2 |
Correct |
2 ms |
512 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2368 ms |
276892 KB |
Output is correct |
| 2 |
Correct |
1108 ms |
283220 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
789 ms |
73688 KB |
Output is correct |
| 2 |
Correct |
541 ms |
76888 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4114 ms |
273492 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
15 ms |
1152 KB |
Output is correct |
| 2 |
Correct |
7 ms |
1024 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4096 ms |
273560 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
21 ms |
2044 KB |
Output is correct |
| 2 |
Correct |
11 ms |
2044 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
384 KB |
Output is correct |
| 2 |
Correct |
1 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4111 ms |
273452 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
21 ms |
1532 KB |
Output is correct |
| 2 |
Correct |
11 ms |
1408 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
860 ms |
73608 KB |
Output is correct |
| 2 |
Correct |
465 ms |
77184 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
384 KB |
Output is correct |
| 2 |
Correct |
2 ms |
384 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
4103 ms |
273620 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
