# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
491844 | codr0 | Nautilus (BOI19_nautilus) | C++14 | 185 ms | 844 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.
// Code by Parsa Eslami
#include <bits/stdc++.h>
#define int long long
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define FORR(i,a,b) for(int i=a;i>=b;i--)
#define S second
#define F first
#define pb push_back
#define SZ(x) (int)x.size()
#define all(x) x.begin(),x.end()
#define err(x) cerr<<#x<<" : "<<x<<'\n'
#define MOD(x) if(x>=M) x-=M; if(x<0) x+=M;
using namespace std;
const int N=500+3;
bitset<N> ocean[N];
bitset<N> B1[N];
bitset<N> BW[N];
bitset<N> BE[N];
bitset<N> BN[N];
bitset<N> BS[N];
int r,c;
void Do(int x0,int y0){
if(x0==0){
if(y0==1){
FOR(i,1,r) BE[i]=B1[i]<<1;
}else{
FOR(i,1,r) BW[i]=B1[i]>>1;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |