답안 #128515

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
128515 2019-07-11T05:05:51 Z 윤교준(#3160) 영역 (JOI16_ho_t4) C++14
15 / 100
77 ms 6068 KB
#include <bits/stdc++.h>
#define eb emplace_back
#define sz(V) ((int)(V).size())
#define allv(V) ((V).begin()),((V).end())
#define sorv(V) sort(allv(V))
#define univ(V) (V).erase(unique(allv(V)),(V).end())
#define upmin(a,b) (a)=min((a),(b))
#define INF (0x3f3f3f3f)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int MAXN = 100055;

namespace TC1 {
	int *B, *C, N;

	void solve(int *_B, int *_C, int _N) {
		B = _B; C = _C; N = _N;

		set<pii> V;
		for(int i = 0; i <= N; i++) V.insert({B[i], C[i]});

		int ret = 0;
		for(auto &v : V) {
			bool flag = false;
			for(int dy : {0, 1}) for(int dx : {0, 1}) {
				int y = v.first+dy, x = v.second+dx;
				auto it = V.find({y, x});
				if(V.end() == it) {
					flag = true;
					break;
				}
			}
			if(!flag) ret++;
		}

		cout << ret << endl;
		exit(0);
	}
}

int B[MAXN], C[MAXN];
char A[MAXN];

int N, K;

int main() {
	scanf("%d%d %s", &N, &K, A+1);
	for(int i = 1; i <= N; i++) {
		if('N' == A[i]) C[i]--;
		if('S' == A[i]) C[i]++;
		if('E' == A[i]) B[i]--;
		if('W' == A[i]) B[i]++;
		B[i] += B[i-1];
		C[i] += C[i-1];
	}
	if(1 == K || (!B[N] && !C[N])) TC1::solve(B, C, N);
	return 0;
}

Compilation message

2016_ho_t4.cpp: In function 'int main()':
2016_ho_t4.cpp:49:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d %s", &N, &K, A+1);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 3 ms 400 KB Output is correct
17 Correct 2 ms 404 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 252 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 3 ms 400 KB Output is correct
17 Correct 2 ms 404 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 252 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 6 ms 632 KB Output is correct
29 Correct 13 ms 1476 KB Output is correct
30 Correct 16 ms 1784 KB Output is correct
31 Correct 48 ms 5240 KB Output is correct
32 Correct 21 ms 2296 KB Output is correct
33 Correct 23 ms 2424 KB Output is correct
34 Correct 24 ms 2552 KB Output is correct
35 Correct 23 ms 2424 KB Output is correct
36 Correct 21 ms 2296 KB Output is correct
37 Correct 22 ms 2424 KB Output is correct
38 Correct 23 ms 2424 KB Output is correct
39 Correct 23 ms 2552 KB Output is correct
40 Correct 21 ms 2280 KB Output is correct
41 Correct 20 ms 2296 KB Output is correct
42 Correct 18 ms 2040 KB Output is correct
43 Correct 24 ms 2552 KB Output is correct
44 Correct 23 ms 2296 KB Output is correct
45 Correct 20 ms 2168 KB Output is correct
46 Correct 35 ms 3704 KB Output is correct
47 Correct 37 ms 3708 KB Output is correct
48 Correct 60 ms 6008 KB Output is correct
49 Correct 77 ms 6068 KB Output is correct
50 Correct 61 ms 6068 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 3 ms 400 KB Output is correct
17 Correct 2 ms 404 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 252 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Incorrect 2 ms 256 KB Output isn't correct
27 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 3 ms 400 KB Output is correct
17 Correct 2 ms 404 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 252 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 3 ms 376 KB Output is correct
28 Correct 6 ms 632 KB Output is correct
29 Correct 13 ms 1476 KB Output is correct
30 Correct 16 ms 1784 KB Output is correct
31 Correct 48 ms 5240 KB Output is correct
32 Correct 21 ms 2296 KB Output is correct
33 Correct 23 ms 2424 KB Output is correct
34 Correct 24 ms 2552 KB Output is correct
35 Correct 23 ms 2424 KB Output is correct
36 Correct 21 ms 2296 KB Output is correct
37 Correct 22 ms 2424 KB Output is correct
38 Correct 23 ms 2424 KB Output is correct
39 Correct 23 ms 2552 KB Output is correct
40 Correct 21 ms 2280 KB Output is correct
41 Correct 20 ms 2296 KB Output is correct
42 Correct 18 ms 2040 KB Output is correct
43 Correct 24 ms 2552 KB Output is correct
44 Correct 23 ms 2296 KB Output is correct
45 Correct 20 ms 2168 KB Output is correct
46 Correct 35 ms 3704 KB Output is correct
47 Correct 37 ms 3708 KB Output is correct
48 Correct 60 ms 6008 KB Output is correct
49 Correct 77 ms 6068 KB Output is correct
50 Correct 61 ms 6068 KB Output is correct
51 Incorrect 2 ms 256 KB Output isn't correct
52 Halted 0 ms 0 KB -