Submission #60948300


Source Code Expand

Copy
#include<bits/stdc++.h>
#define int long long
#define f(i,j,n) for(int i=j;i<=n;i++)
#define F(i,n,j) for(int i=n;i>=j;i--)
#define updmax(a,b) a=max(a,b)
#define updmin(a,b) a=min(a,b)
#define pb push_back
#define XQZ
using namespace std;
namespace fsd{
#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,MAXSIZE,stdin),p1==p2)?EOF:*p1++)
const int MAXSIZE=1<<20;
char buf[MAXSIZE],*p1,*p2;
inline int read(){
int ak=0,ioi=1;char c=gc();
while(!isdigit(c)){if(c=='-')ioi=-1;c=gc();}
while(isdigit(c))ak=ak*10+(c^48),c=gc();
return ak*ioi;
}
inline string reads(){
string o="";
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#include<bits/stdc++.h>
#define int long long
#define f(i,j,n) for(int i=j;i<=n;i++)
#define F(i,n,j) for(int i=n;i>=j;i--)
#define updmax(a,b) a=max(a,b)
#define updmin(a,b) a=min(a,b)
#define pb push_back
#define XQZ
using namespace std;
namespace fsd{
#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,MAXSIZE,stdin),p1==p2)?EOF:*p1++)
	const int MAXSIZE=1<<20;
	char buf[MAXSIZE],*p1,*p2;
	inline int read(){
		int ak=0,ioi=1;char c=gc();
		while(!isdigit(c)){if(c=='-')ioi=-1;c=gc();}
		while(isdigit(c))ak=ak*10+(c^48),c=gc();
		return ak*ioi;
	}
	inline string reads(){
		string o="";
		char p=gc();
		while(p>'z'||p<'a'){p=gc();}
		while(p<='z'&&p>='a'){o+=p;p=gc();}
		return o;
	}
	inline char readc(){
		char p=gc();
		while(!((p<='z'&&p>='a')||(p<='Z'&&p>='A'))){p=gc();}
		return p;
	}
	inline long double readd(){
		long double ak=0;int ioi=1;char c=gc();
		while(!isdigit(c)){if(c=='-')ioi=-1;c=gc();}
		while(isdigit(c))ak*=10,ak+=c-'0',c=gc();
		c=gc();
		long double q=0.1;
		while(isdigit(c))ak+=(c-'0')*q,q*=0.1,c=gc();
		return ak*ioi;
	}
}
using namespace fsd;
int n,m,x,y;
char s[110][110];
bool vis[110][110];
int q=0;
void gs(){
	cin>>n>>m>>x>>y;
	f(i,1,n){
		f(j,1,m){
			cin>>s[i][j];
		}
	}
	string t;cin>>t;
	for(auto v:t){
		if(!vis[x][y]&&s[x][y]=='@')q++;
		vis[x][y]=1;
		int nx=x,ny=y;
		if(v=='U'){
			nx--;
		}else if(v=='D'){
			nx++;
		}else if(v=='L')ny--;
		else ny++;
		if(nx>=1&&nx<=n&&ny>=1&&ny<=m&&s[nx][ny]!='#')x=nx,y=ny;
	}
	if(!vis[x][y]&&s[x][y]=='@')q++;
	vis[x][y]=1;
	cout<<x<<" "<<y<<" "<<q<<endl;
}
signed main(){
#ifndef XQZ
	freopen(".in","r",stdin);
	freopen(".out","w",stdout);
#endif
#ifdef NXD
	int t=0;cin>>t;while(t--)
#endif
		gs();
	return 0;
}

Submission Info

Submission Time
Task B - Santa Claus 1
User xiangqizhen
Language C++ 17 (gcc 12.2)
Score 200
Code Size 1785 Byte
Status AC
Exec Time 2 ms
Memory 3596 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 18
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All hand_01.txt, hand_02.txt, random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, random_10.txt, random_11.txt, random_12.txt, random_13.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
hand_01.txt AC 1 ms 3532 KB
hand_02.txt AC 1 ms 3524 KB
random_01.txt AC 1 ms 3508 KB
random_02.txt AC 1 ms 3584 KB
random_03.txt AC 1 ms 3484 KB
random_04.txt AC 1 ms 3596 KB
random_05.txt AC 1 ms 3552 KB
random_06.txt AC 1 ms 3568 KB
random_07.txt AC 1 ms 3472 KB
random_08.txt AC 1 ms 3544 KB
random_09.txt AC 1 ms 3484 KB
random_10.txt AC 1 ms 3548 KB
random_11.txt AC 1 ms 3536 KB
random_12.txt AC 1 ms 3516 KB
random_13.txt AC 2 ms 3492 KB
sample_01.txt AC 1 ms 3536 KB
sample_02.txt AC 1 ms 3504 KB
sample_03.txt AC 1 ms 3496 KB


2025-03-05 (Wed)
18:09:58 +00:00