SRM 695 easy

BearNSWE.cpp

#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
#define ITR(i,c) for(auto i=begin(c);i!=end(c);i++)
#define FORE(x,arr) for(auto &x:arr)
#define FOR(i,a,n) for(int i=a;i<(int)(n);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) begin(c),end(c)
const int DX[4]={0,1,0,-1}, DY[4]={-1,0,1,0};
const int INF = 1e9;

struct BearNSWE {
    double totalDistance(vector<int> a, string dir) {
        double ans = 0;
        int x=0,y=0;
        REP(i,dir.size()) {
            if(dir[i]=='N') y+=a[i];
            else if(dir[i]=='E') x+=a[i];
            else if(dir[i]=='S') y-=a[i];
            else x-=a[i];
            ans += a[i];
        }
        ans += sqrt(x*x+y*y);
        return ans;
    }
};