2017 Multi-University Training Contest 8 hdu 6140

HDU - 6140 

题意：

思路：阅读理解题（全程做阅读理解，，，，，无语

AC代码：

#include "iostream"
#include "iomanip"
#include "string.h"
#include "stack"
#include "queue"
#include "string"
#include "vector"
#include "set"
#include "map"
#include "algorithm"
#include "stdio.h"
#include "math.h"
#pragma comment(linker, "/STACK:102400000,102400000")
#define bug(x) cout<<x<<" "<<"UUUUU"<<endl;
#define mem(a,x) memset(a,x,sizeof(a))
#define step(x) fixed<< setprecision(x)<<
#define mp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define ll long long
#define endl ("\n")
#define ft first
#define sd second
#define lrt (rt<<1)
#define rrt (rt<<1|1)
using namespace std;
const ll mod=1e9+7;
const ll INF = 1e18+1LL;
const int inf = 1e9+1e8;
const double PI=acos(-1.0);
const int N=1e5+100;

int n,k,a[N];
char b;
int main(){
    ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
    int T; cin>>T;
    while(T--){
        cin>>n>>k;
        for(int i=1; i<=n; ++i){
            cin>>a[i];
        }
        int L=0, R=0;
        for(int i=1; i<=n; ++i){
            cin>>b;
            if(b=='N') L-=a[i],R+=a[i];
            if(b=='L') R+=a[i];
            if(b=='D') L-=a[i];
        }
        if(k>=L && k<=R) cout<<"yes\n";
        else cout<<"no\n";
    }
    return 0;
}