# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
148137 | WhipppedCream | Coins (IOI17_coins) | C++17 | 0 ms | 0 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>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
using namespace std;
#define X first
#define Y second
#define pb push_back
typedef pair<int, int> ii;
typedef long long ll;
const int maxn = 505;
const int maxs = 50005;
const int sz = 500*500;
int n, m, k;
char arr[maxn][maxn];
char dir[maxs];
int main()
{
scanf("%d %d %d", &n, &m, &k);
for(int i = 0; i< n; i++) scanf("%s", arr[i]);
bitset<sz> mask;
bitset<sz> mright, mleft;
mright.set(); mleft.set();
for(int i = 0; i< n; i++)
{
for(int j = 0; j< m; j++)
{
if(arr[i][j] == '#') mask[i*m+j] = 0;
else mask[i*m+j] = 1;