제출 #775606

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
775606		hgmhc	영역 (JOI16_ho_t4)	C++17	15 / 100	127 ms	5192 KiB

2016_ho_t4

#include <bits/stdc++.h>
#define rep(i,a,b) for (auto i = (a); i <= (b); ++i)
#define per(i,a,b) for (auto i = (b); i >= (a); --i)
#define all(x) begin(x),end(x)
#define siz(x) int((x).size())
#define Mup(x,y) x = max(x,y)
#define mup(x,y) x = min(x,y)
#define dbg(...) fprintf(stderr,__VA_ARGS__)
#define fi first
#define se second
using namespace std; using ll = long long; using ii = pair<int,int>;

const int N = 1e5+3;
int n, k;
char s[N];
set<ii> c, a;

bool make_square(int x, int y) {
    rep(i,0,1) rep(j,0,1)
        if (not c.count({x+i,y+j})) return false;
    return true;
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    cin >> n >> k >> &s[1];
    int x = 0, y = 0;
    c.insert({0,0});
    rep(i,1,n) {
        if (s[i] == 'E') {
            c.insert({x,++y});
        } else if (s[i] == 'W') {
            c.insert({x,--y});
        } else if (s[i] == 'N') {
            c.insert({++x,y});
        } else if (s[i] == 'S') {
            c.insert({--x,y});
        } else assert(0);
        rep(i,-1,1) rep(j,-1,1) {
            if (make_square(x+i,y+j)) a.insert({x+i,y+j});
        }
    }
    printf("%d", siz(a));
}

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 0 / 23
• Subtask 4: 0 / 62