C 解法, 执行用时: 1ms, 内存消耗: 344KB, 提交时间: 2021-09-08

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
struct pos
{
	int x;
	int y;
};
struct pos cur = {0,0};
void move(char *p)
{
	char dir = p[0];
	int n1=0, n2=0, d=0, len;
	
//	printf("%s\n",p);
	len = strlen(p);
	if(len>3)
		return;

	if(p[1]>='0' && p[1]<='9')
		n1 = p[1] - '0';
	else
		return;
	
	if(p[2]!=0)
	{
		if(p[2]>='0' && p[2]<='9')
			n2 = p[2] - '0';
		else
			return;
	}

	if(p[2]!=0)
		d = n1*10+n2;
	else
		d = n1;
	switch(dir)
	{
		case 'A':
		cur.x -= d;
		break;
		
		case 'D':
		cur.x += d;
		break;
		
		case 'W':
		cur.y += d;
		break;
		
		case 'S':
		cur.y -= d;
		break;
		
		default:
		break;
	}
//	printf("%d,%d\n",cur.x, cur.y);
}
int main()
{
	char op[100] = {0};
	char str[2000] = {0};
	int i,j,v,len;
	while(scanf("%s", str)!=EOF)
	{
		len = strlen(str);
		i = 0;
		while(i<len)
		{
			memset(op, 0, 100);
			j = 0;
			while(str[i]!=';' && i<len)
			{
				if(j<100)
					op[j++] = str[i++];
			}
			i++;
			move(op);
		}
		printf("%d,%d\n",cur.x, cur.y);
	}
	return 0;
}

C 解法, 执行用时: 1ms, 内存消耗: 348KB, 提交时间: 2021-09-09

#include<stdio.h>
#include<string.h>

int main(){
    char s[2048],*p,c,tmp[100];
    int len,x=0,y=0,n;
    fgets(s,2048,stdin);
    len=strlen(s)-1;
    s[len]='\0';
    p=strtok(s,";");
    while(p!=NULL){
        if(strlen(p)<=3&&sscanf(p, "%c%d%s",&c,&n,tmp)==2){
            switch(c){
                case 'A':
                    x-=n;
                    break;
                case 'S':
                    y-=n;
                    break;
                case 'W':
                    y+=n;
                    break;
                case 'D':
                    x+=n;
                    break;
            }
        }
        p=strtok(NULL,";");
    }
    printf("%d,%d",x,y);
}