oj.uz

답안 #105776

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
105776 2019-04-14T15:27:18 Z JustasZ Lamps (JOI19_lamps) C++14
100 / 100
 78 ms 27820 KB 
#include <bits/stdc++.h>
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define x first
#define y second
#define debug(...) cout << "[" << #__VA_ARGS__ << ": " << __VA_ARGS__ << "]\n"
#define rd() abs((int)rng())
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int>pii;
const int maxn = 1e6 + 100;
const int mod = 1e9 + 7;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
int n, dp[maxn][3][2]; /// 0 - nothing, 1 - set 1, 2 - set 0
string a, b;
int main()
{
    ios_base::sync_with_stdio(false), cin.tie(0);
    cin >> n;
    cin >> a >> b;
    a = '.' + a;
    b = '.' + b;
    for(int i = 0; i < maxn; i++)
    {
        for(int j = 0; j < 3; j++)
        {
            for(int k = 0; k < 2; k++)
                dp[i][j][k] = mod;
        }
    }
    dp[0][0][0] = 0;
    for(int i = 1; i <= n; i++)
    {
        for(int op = 0; op < 3; op++)
        {
            for(int flip = 0; flip < 2; flip++)
            {
                if(a[i] == b[i])
                {
                    dp[i][0][0] = min(dp[i][0][0], dp[i - 1][op][flip]);
                    if(a[i] == '1')
                    {
                        dp[i][2][1] = min(dp[i][2][1], dp[i - 1][op][flip] + (2 != op) + (1 != flip));
                        dp[i][1][0] = min(dp[i][1][0], dp[i - 1][op][flip] + (1 != op));
                    }
                    else
                    {
                        dp[i][1][1] = min(dp[i][1][1], dp[i - 1][op][flip] + (1 != op) + (1 != flip));
                        dp[i][2][0] = min(dp[i][2][0], dp[i - 1][op][flip] + (2 != op));
                    }
                }
                else
                {
                    if(a[i] == '1')
                    {
                        dp[i][2][0] = min(dp[i][2][0], dp[i - 1][op][flip] + (2 != op));
                        dp[i][1][1] = min(dp[i][1][1], dp[i - 1][op][flip] + (1 != op) + (1 != flip));
                    }
                    else
                    {
                        dp[i][1][0] = min(dp[i][1][0], dp[i - 1][op][flip] + (1 != op));
                        dp[i][2][1] = min(dp[i][2][1], dp[i - 1][op][flip] + (2 != op) + (1 != flip));
                    }
                    dp[i][0][1] = min(dp[i][0][1], dp[i - 1][op][flip] + (1 != flip));
                }
            }
        }
    }
    int ans = mod;
    for(int op = 0; op < 3; op++)
        for(int flip = 0; flip < 2; flip++)
        {
            //cout << dp[n][op][flip] << endl;
            ans = min(ans, dp[n][op][flip]);
        }
    cout << ans << "\n";
    return 0;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 23800 KB Output is correct
2 Correct 25 ms 23800 KB Output is correct
3 Correct 24 ms 23800 KB Output is correct
4 Correct 24 ms 23808 KB Output is correct
5 Correct 22 ms 23800 KB Output is correct
6 Correct 22 ms 23812 KB Output is correct
7 Correct 22 ms 23808 KB Output is correct
8 Correct 26 ms 23808 KB Output is correct
9 Correct 26 ms 23800 KB Output is correct
10 Correct 23 ms 23808 KB Output is correct
11 Correct 26 ms 23796 KB Output is correct
12 Correct 22 ms 23928 KB Output is correct
13 Correct 25 ms 23772 KB Output is correct
14 Correct 23 ms 23936 KB Output is correct
15 Correct 25 ms 23836 KB Output is correct
16 Correct 24 ms 23800 KB Output is correct
17 Correct 24 ms 23808 KB Output is correct
18 Correct 23 ms 23808 KB Output is correct
19 Correct 26 ms 23808 KB Output is correct
20 Correct 22 ms 23800 KB Output is correct
21 Correct 23 ms 23800 KB Output is correct
22 Correct 23 ms 23900 KB Output is correct
23 Correct 23 ms 23808 KB Output is correct
24 Correct 25 ms 23828 KB Output is correct
25 Correct 23 ms 23936 KB Output is correct
26 Correct 24 ms 23808 KB Output is correct
27 Correct 25 ms 23808 KB Output is correct
28 Correct 22 ms 23936 KB Output is correct
29 Correct 22 ms 23780 KB Output is correct
30 Correct 23 ms 23808 KB Output is correct
31 Correct 21 ms 23808 KB Output is correct
32 Correct 25 ms 23780 KB Output is correct
33 Correct 23 ms 23868 KB Output is correct
34 Correct 23 ms 23808 KB Output is correct

Subtask #2
41.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 23800 KB Output is correct
2 Correct 25 ms 23800 KB Output is correct
3 Correct 24 ms 23800 KB Output is correct
4 Correct 24 ms 23808 KB Output is correct
5 Correct 22 ms 23800 KB Output is correct
6 Correct 22 ms 23812 KB Output is correct
7 Correct 22 ms 23808 KB Output is correct
8 Correct 26 ms 23808 KB Output is correct
9 Correct 26 ms 23800 KB Output is correct
10 Correct 23 ms 23808 KB Output is correct
11 Correct 26 ms 23796 KB Output is correct
12 Correct 22 ms 23928 KB Output is correct
13 Correct 25 ms 23772 KB Output is correct
14 Correct 23 ms 23936 KB Output is correct
15 Correct 25 ms 23836 KB Output is correct
16 Correct 24 ms 23800 KB Output is correct
17 Correct 24 ms 23808 KB Output is correct
18 Correct 23 ms 23808 KB Output is correct
19 Correct 26 ms 23808 KB Output is correct
20 Correct 22 ms 23800 KB Output is correct
21 Correct 23 ms 23800 KB Output is correct
22 Correct 23 ms 23900 KB Output is correct
23 Correct 23 ms 23808 KB Output is correct
24 Correct 25 ms 23828 KB Output is correct
25 Correct 23 ms 23936 KB Output is correct
26 Correct 24 ms 23808 KB Output is correct
27 Correct 25 ms 23808 KB Output is correct
28 Correct 22 ms 23936 KB Output is correct
29 Correct 22 ms 23780 KB Output is correct
30 Correct 23 ms 23808 KB Output is correct
31 Correct 21 ms 23808 KB Output is correct
32 Correct 25 ms 23780 KB Output is correct
33 Correct 23 ms 23868 KB Output is correct
34 Correct 23 ms 23808 KB Output is correct
35 Correct 27 ms 23928 KB Output is correct
36 Correct 21 ms 23808 KB Output is correct
37 Correct 21 ms 23800 KB Output is correct
38 Correct 21 ms 23808 KB Output is correct
39 Correct 23 ms 23808 KB Output is correct
40 Correct 22 ms 23808 KB Output is correct
41 Correct 26 ms 23808 KB Output is correct
42 Correct 23 ms 23808 KB Output is correct
43 Correct 22 ms 23800 KB Output is correct
44 Correct 22 ms 23800 KB Output is correct
45 Correct 23 ms 23808 KB Output is correct
46 Correct 25 ms 23808 KB Output is correct
47 Correct 23 ms 23780 KB Output is correct
48 Correct 25 ms 23800 KB Output is correct
49 Correct 22 ms 23808 KB Output is correct
50 Correct 21 ms 23800 KB Output is correct
51 Correct 25 ms 23800 KB Output is correct
52 Correct 24 ms 23808 KB Output is correct
53 Correct 22 ms 23800 KB Output is correct
54 Correct 24 ms 23808 KB Output is correct
55 Correct 23 ms 23800 KB Output is correct
56 Correct 22 ms 23808 KB Output is correct
57 Correct 24 ms 23800 KB Output is correct
58 Correct 22 ms 23808 KB Output is correct

Subtask #3
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 23808 KB Output is correct
2 Correct 23 ms 23800 KB Output is correct
3 Correct 24 ms 23848 KB Output is correct
4 Correct 24 ms 23808 KB Output is correct
5 Correct 27 ms 23780 KB Output is correct
6 Correct 22 ms 23800 KB Output is correct
7 Correct 54 ms 27680 KB Output is correct
8 Correct 57 ms 27680 KB Output is correct
9 Correct 60 ms 27684 KB Output is correct
10 Correct 53 ms 27684 KB Output is correct
11 Correct 57 ms 27680 KB Output is correct
12 Correct 51 ms 27684 KB Output is correct
13 Correct 60 ms 27680 KB Output is correct
14 Correct 55 ms 27680 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 23800 KB Output is correct
2 Correct 25 ms 23800 KB Output is correct
3 Correct 24 ms 23800 KB Output is correct
4 Correct 24 ms 23808 KB Output is correct
5 Correct 22 ms 23800 KB Output is correct
6 Correct 22 ms 23812 KB Output is correct
7 Correct 22 ms 23808 KB Output is correct
8 Correct 26 ms 23808 KB Output is correct
9 Correct 26 ms 23800 KB Output is correct
10 Correct 23 ms 23808 KB Output is correct
11 Correct 26 ms 23796 KB Output is correct
12 Correct 22 ms 23928 KB Output is correct
13 Correct 25 ms 23772 KB Output is correct
14 Correct 23 ms 23936 KB Output is correct
15 Correct 25 ms 23836 KB Output is correct
16 Correct 24 ms 23800 KB Output is correct
17 Correct 24 ms 23808 KB Output is correct
18 Correct 23 ms 23808 KB Output is correct
19 Correct 26 ms 23808 KB Output is correct
20 Correct 22 ms 23800 KB Output is correct
21 Correct 23 ms 23800 KB Output is correct
22 Correct 23 ms 23900 KB Output is correct
23 Correct 23 ms 23808 KB Output is correct
24 Correct 25 ms 23828 KB Output is correct
25 Correct 23 ms 23936 KB Output is correct
26 Correct 24 ms 23808 KB Output is correct
27 Correct 25 ms 23808 KB Output is correct
28 Correct 22 ms 23936 KB Output is correct
29 Correct 22 ms 23780 KB Output is correct
30 Correct 23 ms 23808 KB Output is correct
31 Correct 21 ms 23808 KB Output is correct
32 Correct 25 ms 23780 KB Output is correct
33 Correct 23 ms 23868 KB Output is correct
34 Correct 23 ms 23808 KB Output is correct
35 Correct 27 ms 23928 KB Output is correct
36 Correct 21 ms 23808 KB Output is correct
37 Correct 21 ms 23800 KB Output is correct
38 Correct 21 ms 23808 KB Output is correct
39 Correct 23 ms 23808 KB Output is correct
40 Correct 22 ms 23808 KB Output is correct
41 Correct 26 ms 23808 KB Output is correct
42 Correct 23 ms 23808 KB Output is correct
43 Correct 22 ms 23800 KB Output is correct
44 Correct 22 ms 23800 KB Output is correct
45 Correct 23 ms 23808 KB Output is correct
46 Correct 25 ms 23808 KB Output is correct
47 Correct 23 ms 23780 KB Output is correct
48 Correct 25 ms 23800 KB Output is correct
49 Correct 22 ms 23808 KB Output is correct
50 Correct 21 ms 23800 KB Output is correct
51 Correct 25 ms 23800 KB Output is correct
52 Correct 24 ms 23808 KB Output is correct
53 Correct 22 ms 23800 KB Output is correct
54 Correct 24 ms 23808 KB Output is correct
55 Correct 23 ms 23800 KB Output is correct
56 Correct 22 ms 23808 KB Output is correct
57 Correct 24 ms 23800 KB Output is correct
58 Correct 22 ms 23808 KB Output is correct
59 Correct 22 ms 23808 KB Output is correct
60 Correct 23 ms 23800 KB Output is correct
61 Correct 24 ms 23848 KB Output is correct
62 Correct 24 ms 23808 KB Output is correct
63 Correct 27 ms 23780 KB Output is correct
64 Correct 22 ms 23800 KB Output is correct
65 Correct 54 ms 27680 KB Output is correct
66 Correct 57 ms 27680 KB Output is correct
67 Correct 60 ms 27684 KB Output is correct
68 Correct 53 ms 27684 KB Output is correct
69 Correct 57 ms 27680 KB Output is correct
70 Correct 51 ms 27684 KB Output is correct
71 Correct 60 ms 27680 KB Output is correct
72 Correct 55 ms 27680 KB Output is correct
73 Correct 61 ms 27680 KB Output is correct
74 Correct 67 ms 27684 KB Output is correct
75 Correct 56 ms 27684 KB Output is correct
76 Correct 61 ms 27708 KB Output is correct
77 Correct 59 ms 27684 KB Output is correct
78 Correct 66 ms 27684 KB Output is correct
79 Correct 55 ms 27808 KB Output is correct
80 Correct 49 ms 27808 KB Output is correct
81 Correct 78 ms 27684 KB Output is correct
82 Correct 72 ms 27724 KB Output is correct
83 Correct 66 ms 27660 KB Output is correct
84 Correct 67 ms 27684 KB Output is correct
85 Correct 73 ms 27684 KB Output is correct
86 Correct 72 ms 27684 KB Output is correct
87 Correct 57 ms 27672 KB Output is correct
88 Correct 59 ms 27684 KB Output is correct
89 Correct 63 ms 27692 KB Output is correct
90 Correct 60 ms 27676 KB Output is correct
91 Correct 68 ms 27820 KB Output is correct
92 Correct 60 ms 27684 KB Output is correct
93 Correct 68 ms 27800 KB Output is correct
94 Correct 78 ms 27680 KB Output is correct
95 Correct 69 ms 27796 KB Output is correct
96 Correct 65 ms 27732 KB Output is correct
97 Correct 64 ms 27664 KB Output is correct
98 Correct 68 ms 27680 KB Output is correct
99 Correct 68 ms 27680 KB Output is correct
100 Correct 68 ms 27684 KB Output is correct
101 Correct 59 ms 27676 KB Output is correct
102 Correct 58 ms 27820 KB Output is correct