# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
927880 | KaleemRazaSyed | Nautilus (BOI19_nautilus) | C++17 | 142 ms | 1368 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 N = 505;
bitset<N> st[N], newst[N], null[N], W[N], E[N], No[N], S[N];
string s[N];
int r, c, m;
inline void update()
{
for(int i = 0; i < r; i ++)
st[i] = newst[i], newst[i] = null[i];
}
inline void move_West()
{
for(int i = 0; i < r; i ++)
newst[i] |= (st[i] >> 1) & W[i];
}
inline void move_East()
{
for(int i = 0; i < r; i ++)
newst[i] |= (st[i] << 1) & E[i];
}
inline void move_North()
{
for(int i = 0; i + 1 < r; i++)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |