Submission #145001

#	Time	Username	Problem	Language	Result	Execution time	Memory
145001		cheetose	Sandwich (JOI16_sandwich)	C++11	0 / 100	4 ms	2936 KiB

sandwich

#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

char s[404][404];
int n,m;
inline int z(int x,int y,int c){return ((x*m+y)<<1) +c;}
int dist[320005],cnt[320005];
int main() {
	MEM_1(dist);
	fill(cnt,cnt+320005,2);
	scanf("%d%d",&n,&m);
	fup(i,0,n-1,1)scanf("%s",s[i]);
	deque<int> q;
	fup(i,0,n-1,1)
	{
		cnt[z(i,0,0)]--;
		cnt[z(i,m-1,1)]--;
	}
	fup(j,0,m-1,1)
	{
		if(s[0][j]=='N')cnt[z(0,j,1)]--;
		else cnt[z(0,j,0)]--;
		if(s[n-1][j]=='N')cnt[z(n-1,j,0)]--;
		else cnt[z(n-1,j,1)]--;
		
		fup(c,0,1,1)
		{
			if(cnt[z(0,j,c)]==0)
			{
				q.pb(z(0,j,c));
				dist[z(0,j,c)]=1;
			}
			if(cnt[z(n-1,j,c)]==0)
			{
				q.pb(z(n-1,j,c));
				dist[z(n-1,j,c)]=1;
			}
		}
	}
	while(!q.empty())
	{
		int Z=q.front();
		q.pop_front();
		int x=(Z>>1)/m,y=(Z>>1)%m,c=Z&1;
		int nx,ny,nc;
		if(dist[Z^1]==-1)
		{
			q.push_front(Z^1);
			dist[Z^1]=dist[Z];
		}
		if(s[x][y]=='N')
		{
			if(c)
			{
				if(x>0)
				{
					nx=x-1,ny=y,nc=(s[nx][ny]=='N'?0:1);
					int zz=z(nx,ny,nc);
					cnt[zz]--;
					if(dist[zz]==-1 && cnt[zz]==0)
					{
						dist[zz]=dist[Z]+1;
						q.pb(zz);
					}
				}
				if(y<m-1)
				{
					nx=x,ny=y+1,nc=0;
					int zz=z(nx,ny,nc);
					cnt[zz]--;
					if(dist[zz]==-1 && cnt[zz]==0)
					{
						dist[zz]=dist[Z]+1;
						q.pb(zz);
					}
				}
			}
			else
			{
				if(x<n-1)
				{
					nx=x+1,ny=y,nc=(s[nx][ny]=='N'?1:0);
					int zz=z(nx,ny,nc);
					cnt[zz]--;
					if(dist[zz]==-1 && cnt[zz]==0)
					{
						dist[zz]=dist[Z]+1;
						q.pb(zz);
					}
				}
				if(y>0)
				{
					nx=x,ny=y-1,nc=1;
					int zz=z(nx,ny,nc);
					cnt[zz]--;
					if(dist[zz]==-1 && cnt[zz]==0)
					{
						dist[zz]=dist[Z]+1;
						q.pb(zz);
					}
				}
			}
		}
		else
		{
			if(c)
			{
				if(x<n-1)
				{
					nx=x+1,ny=y,nc=(s[nx][ny]=='N'?1:0);
					int zz=z(nx,ny,nc);
					cnt[zz]--;
					if(dist[zz]==-1 && cnt[zz]==0)
					{
						dist[zz]=dist[Z]+1;
						q.pb(zz);
					}
				}
				if(y<m-1)
				{
					nx=x,ny=y+1,nc=0;
					int zz=z(nx,ny,nc);
					cnt[zz]--;
					if(dist[zz]==-1 && cnt[zz]==0)
					{
						dist[zz]=dist[Z]+1;
						q.pb(zz);
					}
				}
			}
			else
			{
				if(x>0)
				{
					nx=x-1,ny=y,nc=(s[nx][ny]=='N'?0:1);
					int zz=z(nx,ny,nc);
					cnt[zz]--;
					if(dist[zz]==-1 && cnt[zz]==0)
					{
						dist[zz]=dist[Z]+1;
						q.pb(zz);
					}
				}
				if(y>0)
				{
					nx=x,ny=y-1,nc=1;
					int zz=z(nx,ny,nc);
					cnt[zz]--;
					if(dist[zz]==-1 && cnt[zz]==0)
					{
						dist[zz]=dist[Z]+1;
						q.pb(zz);
					}
				}
			}
		}
	}
	fup(i,0,n-1,1)
	{
		fup(j,0,m-1,1)
		{
			int ans=dist[z(i,j,0)];
			if(ans==-1)printf("%d ",ans);
			else printf("%d ",2*ans);
		}
		puts("");
	}
}

Compilation message (stderr)

sandwich.cpp: In function 'int main()':
sandwich.cpp:70:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
  ~~~~~^~~~~~~~~~~~~~
sandwich.cpp:71:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  fup(i,0,n-1,1)scanf("%s",s[i]);
                ~~~~~^~~~~~~~~~~

• Subtask 1: 0 / 35
• Subtask 2: 0 / 65