# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
110568 | ckodser | Wall (CEOI14_wall) | C++14 | 957 ms | 20192 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 44, K = 10;
int n, m, vert[N][N], horz[N][N], F[N][N];
ll dp[N][N][1 << K];
priority_queue < pair < ll , int > > Pq;
inline void Relax(int a, int b, int mask, ll d)
{
if (dp[a][b][mask] > d)
{
dp[a][b][mask] = d;
Pq.push(make_pair(- d, (mask << 12) | (b << 6) | a));
}
}
int main()
{
scanf("%d%d", &n, &m);
vector < pair < int , int > > vec;
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
{
int b;
scanf("%d", &b);
if (b)
vec.push_back({i, j});
}
for (int i = 0; i < n; i++)
for (int j = 0; j <= m; j++)
scanf("%d", &vert[i][j]);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |