# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
147351 | georgerapeanu | Nautilus (BOI19_nautilus) | C++11 | 95 ms | 572 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.
#pragma GCC optimize("Ofast")
#include <iostream>
#include <bitset>
#include <algorithm>
using namespace std;
bitset<505> dp[2][505];
bitset<505> base[505];
int r,c,m;
string s;
int main(){
cin >> r >> c >> m;
for(int i = 1;i <= r;i++){
cin >> s;
s = " " + s;
for(int j = 1;j <= c;j++){
base[i][j] = (s[j] == '.');
}
dp[0][i] = base[i];
}
cin >> s;
s = " " + s;
for(int l = 1,k = 1;k <= m;l ^= 1,k++){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |