# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
945322 | LucaIlie | Nautilus (BOI19_nautilus) | C++17 | 146 ms | 158160 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;
const int MAX_N = 500;
const int MAX_M = 500;
const int MAX_K = 5000;
char mat[MAX_N + 2][MAX_M];
bitset<MAX_M> dp[MAX_K + 1][MAX_N + 2], line[MAX_N + 2];
int main() {
int n, m, k;
cin >> n >> m >> k;
for ( int l = 1; l <= n; l++ ) {
for ( int c = 0; c < m; c++ )
cin >> mat[l][c];
}
string moves;
cin >> moves;
moves = " " + moves;
for ( int l = 1; l <= n; l++ ) {
for ( int c = 0; c < m; c++ ) {
if ( mat[l][c] == '.' )
dp[0][l][c] = line[l][c] = true;
}
}
for ( int i = 1; i <= k; i++ ) {
for ( int l = 1; l <= n; l++ ) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |