Language: C++

#include<iostream>
#include<iomanip>
#include<cstdlib>
#include<math.h>
#include<algorithm>
#include<string>
#include<vector>
#include<list>
#include<queue>
#include<stack>
#include<set>
#include<map>
#define REP(i, N) for(ll i = 0; i < N; ++i)
#define ALL(a) (a).begin(),(a).end()
#define pb push_back
#define INF 1000000000
#define MOD 1000000007
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int qx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
int qy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
 
int main(void) {
    while(true) {
        int N;
        cin>>N;
        if(N==0) break;
        vector<vector<bool> > map(21, vector<bool>(21, false));
        int set = 0;
        REP(i, N) {
            int x, y;
            cin>>x>>y;
            map[x][y] = true;
        }
        int nx = 10, ny = 10;
        int ans = 0;
        if(map[nx][ny]) {
            ++ans;
            map[nx][ny] = false;
        }
        int M;
        cin>>M;
        REP(i, M) {
            char dir;
            int l;
            cin>>dir>>l;
            if(dir == 'E') {
                REP(j, l) {
                    nx = nx + dx[0];
                    ny = ny + dy[0];
                    if(map[nx][ny]) {
                        ++ans;
                        map[nx][ny] = false;
                    }
                }
            }
            if(dir == 'N') {
                REP(j, l) {
                    nx = nx + dx[1];
                    ny = ny + dy[1];
                    if(map[nx][ny]) {
                        ++ans;
                        map[nx][ny] = false;
                    }
                }
            }
            if(dir == 'W') {
                REP(j, l) {
                    nx = nx + dx[2];
                    ny = ny + dy[2];
                    if(map[nx][ny]) {
                        ++ans;
                        map[nx][ny] = false;
                    }
                }
            }
            if(dir == 'S') {
                REP(j, l) {
                    nx = nx + dx[3];
                    ny = ny + dy[3];
                    if(map[nx][ny]) {
                        ++ans;
                        map[nx][ny] = false;
                    }
                }
            }
        }
        if(ans == N) cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
    }
}

Compile Error Logs:

ステータス
Judge: 1/1	C++	CPU: 00:00 sec	Memory: 3076 KB	Length: 1642 B	2017-04-16 22:20
テストケースの判定結果
Case #	Verdict	CPU Time	Memory	In	Out	Case Name
Case #1	: Accepted	00:00	3076	30428	961	judge_data

< prev |		/		| next >	 		
 
Judge Input #  ( | )		Judge Output #  ( | )



Compiler output:
a.cc:101:6: error: stray '#' in program
  101 | Case #  Verdict CPU Time        Memory  In      Out     Case Name
      |      ^
a.cc:102:6: error: stray '#' in program
  102 | Case #1 : Accepted      00:00   3076    30428   961     judge_data
      |      ^
a.cc:106:13: error: stray '#' in program
  106 | Judge Input #  ( | )            Judge Output #  ( | )
      |             ^
a.cc:106:46: error: stray '#' in program
  106 | Judge Input #  ( | )            Judge Output #  ( | )
      |                                              ^
a.cc:96:1: error: 'Compile' does not name a type
   96 | Compile Error Logs:
      | ^~~~~~~