ABC335C - Loong Tracking

最新推荐文章于 2024-02-19 16:04:35 发布

PYL2077

最新推荐文章于 2024-02-19 16:04:35 发布

阅读量450

点赞数 10

分类专栏： AtCoder 题解文章标签：算法

本文链接：https://blog.csdn.net/Brian_Pan_/article/details/135435949

版权

题解同时被 2 个专栏收录

173 篇文章 1 订阅

订阅专栏

AtCoder

23 篇文章 0 订阅

订阅专栏

problem link

A brute force solution to this problem would be modifying all $n$ body parts with each move. However, one might notice that we don’t have to maintain the entire snake body dynamically. Since each part will take the place of the previous part, the $i$ th part will always be $i - 1$ indices down from the snake head.

With this conclusion, we can simply update the snake head position in a stack-like data structure. In each new move, we append the new position of the snake head to the stack. During queries, the $i$ th body part would be the $i$ th element down the stack. This gives us $\mathcal O(n+q)$ complexity.

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
using namespace std;
const int Maxn=2e6+10;
int a[Maxn],b[Maxn];
int n,q,cnt;
inline int read()
{
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0' || ch>'9'){if(ch=='-')w-=1;ch=getchar();}
	while(ch>='0' && ch<='9')s=(s<<3)+(s<<1)+(ch^48),ch=getchar();
	return s*w;
}
int main()
{
	// freopen("in.txt","r",stdin);
	n=read(),q=read(),cnt=n;
	for(int i=1;i<=n;++i)
	a[i]=n-i+1;
	while(q--)
	{
		int opt=read();
		if(opt==1)
		{
			// printf("mod\n");
			string s;
			cin>>s;
			int x=a[cnt],y=b[cnt];
			if(s[0]=='U')++y;
			if(s[0]=='D')--y;
			if(s[0]=='L')--x;
			if(s[0]=='R')++x;
			a[++cnt]=x;
			b[cnt]=y;
		}
		else
		{
			int p=read();
			printf("%d %d\n",a[cnt-p+1],b[cnt-p+1]);
		}
	}
	return 0;
}