| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 536650 | ammar2000 | Land of the Rainbow Gold (APIO17_rainbow) | 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>
#define ll long long
#define pb push_back
#define F first
#define S second
#define coy cout<<"YES\n"
#define con cout<<"NO\n"
#define co1 cout<<"-1\n"
#define sc(x) scanf("%lld",&x)
#define all(x) x.begin(),x.end()
#define fast ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int SI=3e5+7;
ll INF=8e18+7;
int dx[] = {1 , -1 , 0 , 0};
int dy[] = {0 , 0 , 1 , -1};
int MOD=1e9+7;
ll n,m,g[55][55];
ll vis[55][55],col;
ll u,l,d,r;
bool valid(int x,int y)
{
return x>=u&&x<=d&&y>=l&&y<=r&&g[x][y]==0&&vis[x][y]!=col;
}
void dfs(int x,int y)
{
// cout <<x<<" "<<y<<"\n";
vis[x][y]=col;
for (int i=0;i<4;i++)
{
if (valid(x+dx[i],y+dy[i]))
dfs(x+dx[i],y+dy[i]);
}
}
void init(int r,int c,int sr,int sc,int m,string s)
{
n=r,m=c;
g[sr][sc]=1;
for (auto i:s)
{
if (i=='N')
sr--;
else if (i=='S')
sr++;
else if (i=='E')
sc++;
else sc--;
g[sr][sc]=1;
}
}
ll colours(int ar,int ac,int br,int bc)
{
col++;
u=ar,l=ac,d=br,r=bc;
ll ret=0;
for (int i=ar;i<=br;i++)
for (int u=ac;u<=bc;u++)
{
if (vis[i][u]!=col&&g[i][u]==0)
ret++,dfs(i,u);
}
return ret;
}