oj.uz

답안 #137119

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
137119 2019-07-27T05:37:54 Z arnold518 영역 (JOI16_ho_t4) C++14
15 / 100
 233 ms 9948 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;
char S[MAXN+10];
set<pii> S1, S2;
vector<ll> V;

ll ans;

int main()
{
    int i, j;

    scanf("%d%d%s", &N, &K, S+1);
    pii now={0, 0}; S1.insert(now);

    V.push_back(0);
    for(j=1; j<=K; j++)
    {
        set<pii> S3;
        if(j==1) S3.insert({0, 0});
        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++;
            if(!S1.count(now)) S1.insert(now), S3.insert(now);
        }
        for(auto it : S3)
        {
            if(S1.count({it.x, it.y}) && S1.count({it.x+1, it.y}) && S1.count({it.x, it.y+1}) && S1.count({it.x+1, it.y+1})) S2.insert({it.x, it.y});
            if(S1.count({it.x, it.y}) && S1.count({it.x+1, it.y}) && S1.count({it.x, it.y-1}) && S1.count({it.x+1, it.y-1})) S2.insert({it.x, it.y-1});
            if(S1.count({it.x, it.y}) && S1.count({it.x-1, it.y}) && S1.count({it.x, it.y+1}) && S1.count({it.x-1, it.y+1})) S2.insert({it.x-1, it.y});
            if(S1.count({it.x, it.y}) && S1.count({it.x-1, it.y}) && S1.count({it.x, it.y-1}) && S1.count({it.x-1, it.y-1})) S2.insert({it.x-1, it.y-1});
        }

        //printf("%d\n", S2.size());
        V.push_back((ll)S2.size());
        if(j>10 && V[j]-V[j-1]==V[j-1]-V[j-2] && V[j-2]-V[j-3]==V[j-1]-V[j-2])
        {
            printf("%lld", V[j]+(ll)(K-j)*(V[j]-V[j-1]));
            return 0;
        }
    }

    printf("%lld", V[K]);
}

Compilation message

2016_ho_t4.cpp: In function 'int main()':
2016_ho_t4.cpp:24: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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 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 256 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 252 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 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 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 252 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 252 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 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 256 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 252 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 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 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 252 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 252 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 5 ms 504 KB Output is correct
28 Correct 9 ms 888 KB Output is correct
29 Correct 32 ms 2156 KB Output is correct
30 Correct 36 ms 2424 KB Output is correct
31 Correct 160 ms 8568 KB Output is correct
32 Correct 49 ms 3064 KB Output is correct
33 Correct 57 ms 3640 KB Output is correct
34 Correct 57 ms 3844 KB Output is correct
35 Correct 58 ms 3616 KB Output is correct
36 Correct 51 ms 3288 KB Output is correct
37 Correct 55 ms 3544 KB Output is correct
38 Correct 54 ms 3676 KB Output is correct
39 Correct 56 ms 3568 KB Output is correct
40 Correct 50 ms 3192 KB Output is correct
41 Correct 46 ms 2988 KB Output is correct
42 Correct 38 ms 2552 KB Output is correct
43 Correct 59 ms 3832 KB Output is correct
44 Correct 53 ms 3320 KB Output is correct
45 Correct 44 ms 2936 KB Output is correct
46 Correct 103 ms 5240 KB Output is correct
47 Correct 117 ms 5252 KB Output is correct
48 Correct 208 ms 9948 KB Output is correct
49 Correct 210 ms 9940 KB Output is correct
50 Correct 233 ms 9944 KB Output is correct

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 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 256 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 252 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 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 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 252 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 252 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 3 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 2 ms 376 KB Output is correct
36 Correct 2 ms 376 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Incorrect 3 ms 380 KB Output isn't correct
39 Halted 0 ms 0 KB -

Subtask #4
0 / 62.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 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 256 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 252 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 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 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 252 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 256 KB Output is correct
23 Correct 2 ms 256 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 252 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 5 ms 504 KB Output is correct
28 Correct 9 ms 888 KB Output is correct
29 Correct 32 ms 2156 KB Output is correct
30 Correct 36 ms 2424 KB Output is correct
31 Correct 160 ms 8568 KB Output is correct
32 Correct 49 ms 3064 KB Output is correct
33 Correct 57 ms 3640 KB Output is correct
34 Correct 57 ms 3844 KB Output is correct
35 Correct 58 ms 3616 KB Output is correct
36 Correct 51 ms 3288 KB Output is correct
37 Correct 55 ms 3544 KB Output is correct
38 Correct 54 ms 3676 KB Output is correct
39 Correct 56 ms 3568 KB Output is correct
40 Correct 50 ms 3192 KB Output is correct
41 Correct 46 ms 2988 KB Output is correct
42 Correct 38 ms 2552 KB Output is correct
43 Correct 59 ms 3832 KB Output is correct
44 Correct 53 ms 3320 KB Output is correct
45 Correct 44 ms 2936 KB Output is correct
46 Correct 103 ms 5240 KB Output is correct
47 Correct 117 ms 5252 KB Output is correct
48 Correct 208 ms 9948 KB Output is correct
49 Correct 210 ms 9940 KB Output is correct
50 Correct 233 ms 9944 KB Output is correct
51 Correct 2 ms 376 KB Output is correct
52 Correct 2 ms 376 KB Output is correct
53 Correct 2 ms 376 KB Output is correct
54 Correct 2 ms 376 KB Output is correct
55 Correct 2 ms 376 KB Output is correct
56 Correct 2 ms 376 KB Output is correct
57 Correct 3 ms 376 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 2 ms 376 KB Output is correct
60 Correct 2 ms 376 KB Output is correct
61 Correct 2 ms 376 KB Output is correct
62 Correct 2 ms 376 KB Output is correct
63 Incorrect 3 ms 380 KB Output isn't correct
64 Halted 0 ms 0 KB -