답안 #378099

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
378099	2021-03-16T02:33:51 Z	wiwiho	Lamps (JOI19_lamps)	C++14	100 / 100	76 ms	6460 KB

lamp

#include <bits/stdc++.h>
#include <bits/extc++.h>

#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define iceil(a, b) (((a) + (b) - 1) / (b))
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;

const ll MOD = 1000000007;
const ll MAX = 2147483647;

template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}

int main(){
    StarBurstStream

    int n;
    cin >> n;
    string a, b;
    cin >> a >> b;
    a = '0' + a + '0';
    b = '0' + b + '0';

    vector<ll> dp(3, MAX);
    dp[0] = 0;
    for(int i = 1; i <= n + 1; i++){
//        cerr << "test " << i << "\n";
        vector<ll> dp2(3, MAX);
        for(int j = 0; j < 3; j++){
            int now;
            if(j & 1) now = '0' != b[i];
            else if(j & 2) now = '1' != b[i];
            else now = a[i] != b[i];
            for(int k = 0; k < 3; k++){
                int lst;
                if(k & 1) lst = '0' != b[i - 1];
                else if(k & 2) lst = '1' != b[i - 1];
                else lst = a[i - 1] != b[i - 1];
//                cerr << j << " " << k << " " << now << " " << lst << "\n";
                dp2[j] = min(dp2[j], dp[k] + (now != lst) + (j != k ? !!k + !!j : 0));
            }
        }
        dp = dp2;
//        cerr << i << "  ";
//        printv(dp, cerr);
    }
    cout << dp[0] / 2 << "\n";

    return 0;
}

Subtask #1
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	512 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	492 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	1 ms	364 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	1 ms	364 KB	Output is correct

Subtask #2
41.0 / 41.0

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

Subtask #3
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	58 ms	6332 KB	Output is correct
8	Correct	59 ms	6332 KB	Output is correct
9	Correct	57 ms	6332 KB	Output is correct
10	Correct	58 ms	6332 KB	Output is correct
11	Correct	58 ms	6332 KB	Output is correct
12	Correct	63 ms	6332 KB	Output is correct
13	Correct	59 ms	6332 KB	Output is correct
14	Correct	76 ms	6332 KB	Output is correct

Subtask #4
49.0 / 49.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	512 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	492 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	1 ms	364 KB	Output is correct
22	Correct	1 ms	364 KB	Output is correct
23	Correct	1 ms	364 KB	Output is correct
24	Correct	1 ms	364 KB	Output is correct
25	Correct	1 ms	384 KB	Output is correct
26	Correct	1 ms	364 KB	Output is correct
27	Correct	1 ms	364 KB	Output is correct
28	Correct	1 ms	364 KB	Output is correct
29	Correct	1 ms	364 KB	Output is correct
30	Correct	1 ms	364 KB	Output is correct
31	Correct	1 ms	364 KB	Output is correct
32	Correct	1 ms	364 KB	Output is correct
33	Correct	1 ms	364 KB	Output is correct
34	Correct	1 ms	364 KB	Output is correct
35	Correct	1 ms	364 KB	Output is correct
36	Correct	1 ms	364 KB	Output is correct
37	Correct	1 ms	364 KB	Output is correct
38	Correct	1 ms	364 KB	Output is correct
39	Correct	1 ms	364 KB	Output is correct
40	Correct	1 ms	364 KB	Output is correct
41	Correct	1 ms	364 KB	Output is correct
42	Correct	1 ms	364 KB	Output is correct
43	Correct	1 ms	364 KB	Output is correct
44	Correct	1 ms	364 KB	Output is correct
45	Correct	1 ms	364 KB	Output is correct
46	Correct	1 ms	364 KB	Output is correct
47	Correct	1 ms	364 KB	Output is correct
48	Correct	1 ms	364 KB	Output is correct
49	Correct	1 ms	364 KB	Output is correct
50	Correct	1 ms	492 KB	Output is correct
51	Correct	1 ms	364 KB	Output is correct
52	Correct	1 ms	364 KB	Output is correct
53	Correct	1 ms	364 KB	Output is correct
54	Correct	1 ms	364 KB	Output is correct
55	Correct	1 ms	364 KB	Output is correct
56	Correct	1 ms	364 KB	Output is correct
57	Correct	1 ms	364 KB	Output is correct
58	Correct	1 ms	364 KB	Output is correct
59	Correct	1 ms	364 KB	Output is correct
60	Correct	1 ms	364 KB	Output is correct
61	Correct	1 ms	364 KB	Output is correct
62	Correct	1 ms	364 KB	Output is correct
63	Correct	1 ms	364 KB	Output is correct
64	Correct	1 ms	364 KB	Output is correct
65	Correct	58 ms	6332 KB	Output is correct
66	Correct	59 ms	6332 KB	Output is correct
67	Correct	57 ms	6332 KB	Output is correct
68	Correct	58 ms	6332 KB	Output is correct
69	Correct	58 ms	6332 KB	Output is correct
70	Correct	63 ms	6332 KB	Output is correct
71	Correct	59 ms	6332 KB	Output is correct
72	Correct	76 ms	6332 KB	Output is correct
73	Correct	59 ms	6352 KB	Output is correct
74	Correct	58 ms	6332 KB	Output is correct
75	Correct	57 ms	6332 KB	Output is correct
76	Correct	56 ms	6332 KB	Output is correct
77	Correct	58 ms	6332 KB	Output is correct
78	Correct	57 ms	6332 KB	Output is correct
79	Correct	67 ms	6332 KB	Output is correct
80	Correct	59 ms	6332 KB	Output is correct
81	Correct	56 ms	6332 KB	Output is correct
82	Correct	75 ms	6332 KB	Output is correct
83	Correct	60 ms	6460 KB	Output is correct
84	Correct	58 ms	6332 KB	Output is correct
85	Correct	59 ms	6332 KB	Output is correct
86	Correct	60 ms	6332 KB	Output is correct
87	Correct	56 ms	6332 KB	Output is correct
88	Correct	57 ms	6332 KB	Output is correct
89	Correct	58 ms	6332 KB	Output is correct
90	Correct	58 ms	6332 KB	Output is correct
91	Correct	60 ms	6332 KB	Output is correct
92	Correct	56 ms	6332 KB	Output is correct
93	Correct	57 ms	6332 KB	Output is correct
94	Correct	61 ms	6332 KB	Output is correct
95	Correct	57 ms	6400 KB	Output is correct
96	Correct	61 ms	6332 KB	Output is correct
97	Correct	57 ms	6332 KB	Output is correct
98	Correct	59 ms	6332 KB	Output is correct
99	Correct	57 ms	6332 KB	Output is correct
100	Correct	56 ms	6332 KB	Output is correct
101	Correct	70 ms	6460 KB	Output is correct
102	Correct	58 ms	6332 KB	Output is correct

답안 #378099

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 41.0 / 41.0

Subtask #3 4.0 / 4.0

Subtask #4 49.0 / 49.0

Subtask #1
6.0 / 6.0

Subtask #2
41.0 / 41.0

Subtask #3
4.0 / 4.0

Subtask #4
49.0 / 49.0