답안 #203031

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
203031	2020-02-19T04:03:01 Z	dimash241	Lamps (JOI19_lamps)	C++17	100 / 100	76 ms	4552 KB

lamp

//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")

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

# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;
 
template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

inline void Input_Output () {
	//freopen(".in", "r", stdin);
   //freopen(".out", "w", stdout);
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n;
string s, t;
int dp[33];

void upd (int &a, int b) {
	if (a > b) a = b;
}

char op (int j, char c) {
	if (2 <= j && j <= 3) c = '0';
    if (4 <= j && j <= 7) c = '1';
    if (8 <= j && j <= 9) c = '0';
    if (j & 1) c = char('0'+(1-(c-'0')));
    return c;
}

void process () {
	for (int i = 1; i < 10; i += 2) upd(dp[i-1], dp[i]); // remove toggle 
    for (int i = 8; i <= 9; i ++) upd(dp[i-4], dp[i]); // remove white 
    for (int i = 6; i <= 7; i ++) upd(dp[i-4], dp[i]); // remove black
    for (int i = 4; i <= 5; i ++) upd(dp[i-4], dp[i]); // remove black 
    for (int i = 2; i <= 3; i ++) upd(dp[i-2], dp[i]); // remove white 
    
    for (int i = 2; i <= 3; i ++) upd(dp[i], dp[i-2]+1); // add white 
    for (int i = 4; i <= 5; i ++) upd(dp[i], dp[i-4]+1); // add black 
    for (int i = 6; i <= 7; i ++) upd(dp[i], dp[i-4]+1); // add black
    for (int i = 8; i <= 9; i ++) upd(dp[i], dp[i-4]+1); // add white 
    for (int i = 1; i < 10; i += 2) upd(dp[i], dp[i-1]+1); //toggle add
}


int main () {
   	SpeedForce;

   	cin >> n;
   	cin >> s >> t;
	for (int j = 1; j <= 10; ++j) dp[j] = inf;
	for (int i = 0; i < n; i ++) {
		process();
		for (int j = 0; j < 11; ++j)
			if (op(j, s[i]) != t[i])
				dp[j] = inf;
	}

	cout << *min_element(dp, dp + 11) << '\n';

   	return Accepted;
}

// B...a

Subtask #1
6.0 / 6.0

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

Subtask #2
41.0 / 41.0

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

Subtask #3
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	6 ms	376 KB	Output is correct
2	Correct	5 ms	376 KB	Output is correct
3	Correct	5 ms	376 KB	Output is correct
4	Correct	5 ms	376 KB	Output is correct
5	Correct	5 ms	376 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	53 ms	4496 KB	Output is correct
8	Correct	50 ms	4500 KB	Output is correct
9	Correct	52 ms	4500 KB	Output is correct
10	Correct	57 ms	4500 KB	Output is correct
11	Correct	50 ms	4496 KB	Output is correct
12	Correct	51 ms	4500 KB	Output is correct
13	Correct	53 ms	4500 KB	Output is correct
14	Correct	59 ms	4496 KB	Output is correct

Subtask #4
49.0 / 49.0

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

답안 #203031

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