# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
101179 | E869120 | Wall (CEOI14_wall) | C++14 | 1694 ms | 43228 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 <iostream>
#include <vector>
#include <queue>
#include <functional>
#include <tuple>
using namespace std;
long long dist[44][44][1024];
int H, W, P[1009][1009], A[1009][1009], B[1009][1009];
int cp[44][44][4], cq[44][44][4];
vector<pair<int, int>>L;
int main() {
cin >> H >> W;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) { cin >> P[i][j]; if (P[i][j] >= 1) L.push_back(make_pair(i, j)); }
}
for (int i = 0; i < H; i++) {
for (int j = 0; j < W + 1; j++) {
cin >> A[i][j];
cq[i][j][1] = A[i][j]; cq[i + 1][j][3] = A[i][j];
}
}
for (int i = 0; i < H + 1; i++) {
for (int j = 0; j < W; j++) {
cin >> B[i][j];
cq[i][j][0] = B[i][j]; cq[i][j + 1][2] = B[i][j];
for (int k = 0; k < L.size(); k++) {
if (L[k].second == j && L[k].first >= i) { cp[i][j][0] += (1 << k); cp[i][j + 1][2] += (1 << k); }
}
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... |