oj.uz

Submission #137084

# Submission time Handle Problem Language Result Execution time Memory
137084 2019-07-27T04:55:20 Z arnold518 None (JOI16_ho_t4) C++14
15 / 100
 71 ms 5280 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5;

#define x first
#define y second

int N, K, ans;
char S[MAXN+10];
set<pii> ST;

int main()
{
    int i, j;

    scanf("%d%d%s", &N, &K, S+1);
    pii now={0, 0}; ST.insert(now);
    for(i=1; i<=N; i++)
    {
        if(S[i]=='N') now.y++;
        else if(S[i]=='S') now.y--;
        else if(S[i]=='W') now.x--;
        else now.x++;
        ST.insert(now);
    }

    for(auto it : ST) ans+=(ST.count({it.x, it.y}) && ST.count({it.x+1, it.y}) && ST.count({it.x, it.y+1}) && ST.count({it.x+1, it.y+1}));
    printf("%d", ans);
}

Compilation message

2016_ho_t4.cpp: In function 'int main()':
2016_ho_t4.cpp:19:12: warning: unused variable 'j' [-Wunused-variable]
     int i, j;
            ^
2016_ho_t4.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%s", &N, &K, S+1);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 3 ms 256 KB Output is correct
15 Correct 2 ms 252 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 424 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 256 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 392 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 256 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 3 ms 256 KB Output is correct
15 Correct 2 ms 252 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 424 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 256 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 392 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 380 KB Output is correct
27 Correct 3 ms 380 KB Output is correct
28 Correct 5 ms 504 KB Output is correct
29 Correct 13 ms 1144 KB Output is correct
30 Correct 15 ms 1144 KB Output is correct
31 Correct 46 ms 4472 KB Output is correct
32 Correct 20 ms 1528 KB Output is correct
33 Correct 22 ms 1656 KB Output is correct
34 Correct 22 ms 1784 KB Output is correct
35 Correct 24 ms 1656 KB Output is correct
36 Correct 23 ms 1528 KB Output is correct
37 Correct 22 ms 1656 KB Output is correct
38 Correct 22 ms 1528 KB Output is correct
39 Correct 22 ms 1660 KB Output is correct
40 Correct 21 ms 1784 KB Output is correct
41 Correct 19 ms 1528 KB Output is correct
42 Correct 17 ms 1272 KB Output is correct
43 Correct 22 ms 1784 KB Output is correct
44 Correct 21 ms 1528 KB Output is correct
45 Correct 19 ms 1400 KB Output is correct
46 Correct 35 ms 2936 KB Output is correct
47 Correct 38 ms 2936 KB Output is correct
48 Correct 59 ms 5280 KB Output is correct
49 Correct 54 ms 5240 KB Output is correct
50 Correct 71 ms 5248 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 3 ms 256 KB Output is correct
15 Correct 2 ms 252 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 424 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 256 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 392 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Incorrect 2 ms 256 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #4
0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 256 KB Output is correct
14 Correct 3 ms 256 KB Output is correct
15 Correct 2 ms 252 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 424 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 256 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 392 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 256 KB Output is correct
26 Correct 2 ms 380 KB Output is correct
27 Correct 3 ms 380 KB Output is correct
28 Correct 5 ms 504 KB Output is correct
29 Correct 13 ms 1144 KB Output is correct
30 Correct 15 ms 1144 KB Output is correct
31 Correct 46 ms 4472 KB Output is correct
32 Correct 20 ms 1528 KB Output is correct
33 Correct 22 ms 1656 KB Output is correct
34 Correct 22 ms 1784 KB Output is correct
35 Correct 24 ms 1656 KB Output is correct
36 Correct 23 ms 1528 KB Output is correct
37 Correct 22 ms 1656 KB Output is correct
38 Correct 22 ms 1528 KB Output is correct
39 Correct 22 ms 1660 KB Output is correct
40 Correct 21 ms 1784 KB Output is correct
41 Correct 19 ms 1528 KB Output is correct
42 Correct 17 ms 1272 KB Output is correct
43 Correct 22 ms 1784 KB Output is correct
44 Correct 21 ms 1528 KB Output is correct
45 Correct 19 ms 1400 KB Output is correct
46 Correct 35 ms 2936 KB Output is correct
47 Correct 38 ms 2936 KB Output is correct
48 Correct 59 ms 5280 KB Output is correct
49 Correct 54 ms 5240 KB Output is correct
50 Correct 71 ms 5248 KB Output is correct
51 Incorrect 2 ms 256 KB Output isn't correct
52 Halted 0 ms 0 KB -