이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n,m,k;
vector<vector<int>>a;
vector<vector<bool>>b;
vector<pair<int,int>>v;
int ori[15];
pair<int,int>cell[10][10];
int ans = -1;
void afis()
{
bool bb = true;
int sm = 0;
for (int i = 1; i <= k; i++)
{
bool boo = true;
for (int j = 1; j <= 4; j++)
{
int l = v[i].first + cell[ori[i]][j].first,c = v[i].second + cell[ori[i]][j].second;
if (l == 0 or l == n + 1 or c == 0 or c == m + 1)
boo = false,bb = false;
}
if (boo == true)
{
for (int j = 1; j <= 4; j++)
{
int l = v[i].first + cell[ori[i]][j].first,c = v[i].second + cell[ori[i]][j].second;
if (!b[l][c])
b[l][c] = true,sm += a[l][c];
else
bb = false;
}
}
}
for (int i = 1; i <= k; i++)
{
bool boo = true;
for (int j = 1; j <= 4; j++)
{
int l = v[i].first + cell[ori[i]][j].first,c = v[i].second + cell[ori[i]][j].second;
if (l == 0 or l == n + 1 or c == 0 or c == m + 1)
boo = false;
}
if (boo == true)
{
for (int j = 1; j <= 4; j++)
{
int l = v[i].first + cell[ori[i]][j].first,c = v[i].second + cell[ori[i]][j].second;
b[l][c] = false;
}
}
}
if (bb == true)
ans = max(ans,sm);
}
void bkt(int pos)
{
if (pos == k + 1)
afis();
else
{
for (int i = 1; i <= 4; i++)
{
ori[pos] = i;
bkt(pos + 1);
}
}
}
void solve_small()
{
b.resize(n + 1);
for (int i = 1; i <= n; i++)
b[i].resize(m + 1);
bkt(1);
if (ans == -1)
cout << "No";
else
cout << ans;
}
bool all_same_row()
{
for (int i = 2; i <= k; i++)
if (v[i].first != v[1].first)
return false;
return true;
}
int dp[1005][10];///dp[i][j] = cmax sa pun primele i T-uri, ultimul avand rotatia j
bool inters(pair<int,int>p1,int r1,pair<int,int>p2,int r2)
{
for (int c1 = 1; c1 <= 4; c1++)
{
for (int c2 = 1; c2 <= 4; c2++)
{
pair<int,int>n1 = {p1.first + cell[r1][c1].first,p1.second + cell[r1][c1].second};
pair<int,int>n2 = {p2.first + cell[r2][c2].first,p2.second + cell[r2][c2].second};
if (n1 == n2)
return true;
}
}
return false;
}
void solve_all_same_row()
{
sort(v.begin() + 1,v.end());
for (int r = 1; r <= 4; r++)
{
bool boo = true;
int sm = 0;
for (int j = 1; j <= 4; j++)
{
int l = v[1].first + cell[r][j].first,c = v[1].second + cell[r][j].second;
if (l == 0 or l == m + 1 or c == 0 or c == m + 1)
boo = false;
else
sm += a[l][c];
}
if (boo == true)
dp[1][r] = sm;
else
dp[1][r] = -2e6;
}
for (int i = 2; i <= k; i++)
{
for (int r = 1; r <= 4; r++)
{
bool boo = true;
int sm = 0;
for (int j = 1; j <= 4; j++)
{
int l = v[i].first + cell[r][j].first,c = v[i].second + cell[r][j].second;
if (l == 0 or l == m + 1 or c == 0 or c == m + 1)
boo = false;
else
sm += a[l][c];
}
if (boo == false)
dp[i][r] = -2e6;
else
{
dp[i][r] = -2e6;
for (int rant = 1; rant <= 4; rant++)
if (dp[i - 1][rant] >= 0 and !inters(v[i - 1],rant,v[i],r))
dp[i][r] = max(dp[i][r],dp[i - 1][rant] + sm);
}
}
}
int mx = max(max(dp[k][1],dp[k][2]),max(dp[k][3],dp[k][4]));
if (mx < 0)
cout << "No";
else
cout << mx;
}
bool all_subtask3()
{
for (int i = 1; i <= k; i++)
{
for (int j = i + 1; j <= k; j++)
{
if (abs(v[i].first - v[j].first) <= 2 and abs(v[i].second - v[j].second) <= 2)
if (abs(v[i].first - v[j].second) == 2 or abs(v[i].second - v[j].second) == 2)
return false;
}
}
return true;
}
bool viz[1005];
int get_single(pair<int,int>p)
{
int mx = -1;
for (int r = 1; r <= 4; r++)
{
bool boo = true;
int sm = 0;
for (int j = 1; j <= 4; j++)
{
int l = p.first + cell[r][j].first,c = p.second + cell[r][j].second;
if (l == 0 or l == n + 1 or c == 0 or c == m + 1)
boo = false;
else
sm += a[l][c];
}
if (boo == true)
mx = max(mx,sm);
}
return mx;
}
bool in_bounds(pair<int,int>p,int r)
{
for (int j = 1; j <= 4; j++)
{
int l = p.first + cell[r][j].first,c = p.second + cell[r][j].second;
if (l == 0 or l == n + 1 or c == 0 or c == m + 1)
return false;
}
return true;
}
int get_double(pair<int,int>p1,pair<int,int>p2)
{
int mx = -1;
for (int r1 = 1; r1 <= 4; r1++)
{
for (int r2 = 1; r2 <= 4; r2++)
{
if (!inters(p1,r1,p2,r2) and in_bounds(p1,r1) == true and in_bounds(p2,r2) == true)
{
int cr = 0;
for (int j = 1; j <= 4; j++)
{
int l = p1.first + cell[r1][j].first,c = p1.second + cell[r1][j].second;
cr += a[l][c];
}
for (int j = 1; j <= 4; j++)
{
int l = p2.first + cell[r2][j].first,c = p2.second + cell[r2][j].second;
cr += a[l][c];
}
mx = max(mx,cr);
}
}
}
return mx;
}
void solve_subtask3()
{
for (int i = 1; i <= k; i++)
{
int cnt = 0;
for (int j = 1; j <= k; j++)
{
if (j != i)
{
if (abs(v[i].first - v[j].first) <= 1 and abs(v[i].second - v[j].second) <= 1)
cnt++;
}
}
if (cnt >= 2)
{
cout << "No";
return;
}
}
ans = 0;
for (int i = 1; i <= k; i++)
{
if (!viz[i])
{
int id = -1;
for (int j = i + 1; j <= k; j++)
{
if (abs(v[i].first - v[j].first) <= 1 and abs(v[i].second - v[j].second) <= 1)
id = j;
}
if (id == -1)
{
int cr = get_single(v[i]);
if (cr == -1)
{
cout << "No";
return;
}
ans += cr;
}
else
{
viz[id] = true;
int cr = get_double(v[i],v[id]);
if (cr == -1)
{
cout << "No";
return;
}
ans += cr;
}
}
}
cout << ans;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> m;
a.resize(n + 1);
for (int i = 1; i <= n; i++)
{
a[i].resize(m + 1);
for (int j = 1; j <= m; j++)
cin >> a[i][j];
}
cin >> k;
v.resize(k + 1);
for (int i = 1; i <= k; i++)
cin >> v[i].first >> v[i].second,v[i].first++,v[i].second++;
cell[1][1] = {0,0},cell[1][2] = {0,-1},cell[1][3] = {0,1},cell[1][4] = {1,0};
cell[2][1] = {0,0},cell[2][2] = {0,-1},cell[2][3] = {0,1},cell[2][4] = {-1,0};
cell[3][1] = {0,0},cell[3][2] = {-1,0},cell[3][3] = {0,1},cell[3][4] = {1,0};
cell[4][1] = {0,0},cell[4][2] = {-1,0},cell[4][3] = {0,-1},cell[4][4] = {1,0};
if (k <= 10)
{
solve_small();
return 0;
}
if (all_same_row() == true)
{
solve_all_same_row();
return 0;
}
if (all_subtask3() == true)
{
solve_subtask3();
return 0;
}
//solve_normal();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |