# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1157547 | mocha | 영역 (JOI16_ho_t4) | C++20 | 940 ms | 327680 KiB |
#include <bits/stdc++.h>
using namespace std;
const int mx = 1e5+5;
int n, k;
string s;
set<pair<int, int>> st;
char c[4] = {'E', 'N', 'W', 'S'};
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
signed main() {
cin >> n >> k;
cin >> s;
int x = 0, y = 0;
st.insert({x, y});
for (int i=0;i<k;i++) {
for (int j=0;j<n;j++) {
for (int k=0;k<4;k++) {
if (s[j] == c[k]) {
x += dx[k];
y += dy[k];
break;
}
}
st.insert({x, y});
}
}
int ans = 0;
for (auto [x, y]:st) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |