YMS Round #1 Div. 2 C Mowing the Field

CM_yali

于 2016-03-20 10:53:17 发布

阅读量360

点赞数

分类专栏： YMS 文章标签： YMS Round C++

本文链接：https://blog.youkuaiyun.com/CM_yali/article/details/50935575

版权

YMS 专栏收录该内容

4 篇文章

订阅专栏

#include <cstdio>
#include <cstdlib>
int a[4010][4010],n,d2[110],time[4010][4010],ans=2147483647;
char d1[110];
int main(){
    int i,j,k,m,p=1000,q=1000,t=0;
    scanf("%d",&n);
    getchar();
    for(i=1;i<=n;i++){
        scanf("%c",&d1[i]);
        getchar();
        scanf("%d",&d2[i]);
        getchar();
    }
    for(i=1;i<=n;i++){
        if(d1[i]=='N'){
            for(j=1;j<=d2[i];j++){
                t++;
                q++;
                if(a[p][q]==1){
                    if(t-time[p][q]<ans)
                        ans=t-time[p][q];
                }
                a[p][q]=1;
                time[p][q]=t;
            }
        }else
        if(d1[i]=='E'){
            for(j=1;j<=d2[i];j++){
                t++;
                p++;
                if(a[p][q]==1){
                    if(t-time[p][q]<ans)
                        ans=t-time[p][q];
                } 
                a[p][q]=1;
                time[p][q]=t;
            }
        }else
        if(d1[i]=='W'){
            for(j=1;j<=d2[i];j++){
                t++;
                p--;
                if(a[p][q]==1){
                    if(t-time[p][q]<ans)
                        ans=t-time[p][q];
                }
                a[p][q]=1;
                time[p][q]=t;
            }
        }else
        if(d1[i]=='S'){
            for(j=1;j<=d2[i];j++){
                t++;
                q--;
                if(a[p][q]==1){
                    if(t-time[p][q]<ans)
                        ans=t-time[p][q];
                }
                a[p][q]=1;
                time[p][q]=t;
            }
        }
    }
    if(ans==2147483647)
        printf("-1");
    else
        printf("%d",ans);
    return 0;
}