#227134 (C++14) No.608 God's Maze

• 問題: No.608 God's Maze
• ユーザー: paruki
• 提出日時: 2018-01-01 19:28:15
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 6 ms / 2,000 ms
• コード長: 2,170 bytes
• コンパイル時間: 1,578 ms
• コンパイル使用メモリ: 170,304 KB
• 実行使用メモリ: 6,824 KB
• 最終ジャッジ日時: 2024-12-22 23:50:40
• 合計ジャッジ時間: 3,323 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

ファイルパターン	結果
other	AC * 65

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define mt make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
int N, K, D[2] = { -1, +1 };
string S;
int solve(vi a, int d, int p) {
    int to = 0;
    int res = 0;
    int cnt = 0;
    for (int i = p; i >= 0 && i < K; i+=d) {
        if (a[i]) {
            cnt++;
            to = i;
        }
    }
    for (int i = p; i != to + d; i += d) {
        if (a[i]) {
            if (i == to) {
                a[i] ^= 1;
                res += 3;
            } else {
                a[i] ^= 1;
                a[i + d] ^= 1;
                if (a[i + d])cnt++;
                else cnt--;
                i -= d;
                res += 2;
            }
            cnt--;
        } else {
            if (i != to) {
                a[i + d] ^= 1;
                if (a[i + d])cnt++;
                else cnt--;
                res++;
            }
        }
        if (cnt == 0)break;
    }
    return res;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin >> N >> S;
    K = sz(S);
    N--;
    int l = -1, r = -1;
    rep(i, K) if (S[i] == '#')r = i;
    for (int i = K - 1; i >= 0; --i)if (S[i] == '#')l = i;
    int P[] = { l,r };
    int ans = INT_MAX;
    rep(x, 2) {
        int p = P[x];
        vi v(K);
        rep(i, K)v[i] = S[i] == '#' ? 1 : 0;
        if (N <= l) {
            smin(ans, solve(v, 1, N));
        } else if (N >= r) {
            smin(ans, solve(v, -1, N));
        } else {
            int d = (p - N) / abs(p - N);
            for (int i = N + d; i != p + d; i += d) {
                v[i] ^= 1;
            }
            smin(ans, solve(v, -D[x], p) + abs(N - p));
        }
    }
    cout << ans << endl;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX