# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
594073 | Cross_Ratio | 영역 (JOI16_ho_t4) | C++14 | 49 ms | 6764 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> P;
signed main() {
cin.sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int N;
int K;
cin >> N >> K;
string s;
cin >> s;
int i, j;
int x = 0, y = 0;
set<P> S;
S.insert(P(0,0));
for(i=0;i<N;i++) {
if(s[i]=='E') x++;
if(s[i]=='W') x--;
if(s[i]=='N') y++;
if(s[i]=='S') y--;
S.insert(P(x,y));
}
int ans = 0;
for(P k : S) {
int x = k.first, y = k.second;
if(S.find(P(x,y+1))!=S.end()&&S.find(P(x+1,y))!=S.end()&&S.find(P(x+1,y+1))!=S.end()) {
ans++;
}
}
cout << ans;
}
Compilation message (stderr)
# | 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... |