답안 #125819

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
125819	2019-07-06T12:06:59 Z	claudy	Lamps (JOI19_lamps)	C++14	100 / 100	62 ms	27976 KB

lamp

//# pragma GCC optimize("Ofast,no-stack-protector")
//# pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
# pragma GCC optimize("Ofast")
# pragma GCC optimization ("unroll-loops")
# include "bits/stdc++.h"
std::pair<int,int> DR[] = {{-1,0},{0,1},{1,0},{0,-1},{-1,1},{-1,-1},{1,1},{1,-1}};
# define ll long long
# define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
# define rc(s) return cout << s,0
# define rcg(s) cout << s;exit(0)
# define _ ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
# define db(x) cerr << #x << " = " << x << '\n'
# define pb push_back
# define mp make_pair
# define all(s) s.begin(),s.end()
# define sz(x) (int)((x).size())
//# define int ll
using namespace std;

// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# define LOCAL
# define sim template < class c
# define ris return * this
# define dor > debug & operator <<
# define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define show(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
int gcd(int a, int b)
{
if(b) return gcd(b,a%b);
return a;
}mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~


int dp[1 << 20][3][2],ans = 1e9,n;

int32_t main(){_
	//freopen("input","r",stdin);
	cin >> n;
	string sa,sb;
	cin >> sa >> sb;
	for(int i = 0;i <= n;i++)
	{
		for(int a = 0;a < 3;a++)
		{
			for(int b = 0;b < 2;b++)
			{
				dp[i][a][b] = 1e9;
			}
		}
	}
	dp[0][0][0] = 0;
	for(int i = 1;i <= n;i++)
	{
		for(int a = 0;a < 3;a++)
		{
			for(int b = 0;b < 2;b++)
			{
				int col = sa[i - 1] - '0';
				if(a > 0) col = a - 1;
				if(b) col = !col;
				if(col == sb[i - 1] - '0')
				{
					for(int aa = 0;aa < 3;aa++)
					{
						for(int bb = 0;bb < 2;bb++) dp[i][a][b] = min(dp[i][a][b],dp[i - 1][aa][bb] + (a != aa && a != 0) + (bb == 0 && b == 1));
					}
				}
				//debug() << show(a) show(b) show(col) show(dp[i][a][b]);
				if(i == n) ans = min(ans,dp[i][a][b]);
			}
		}
	}
	rc(ans);
	return 0;
}

Compilation message

lamp.cpp:4:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 # pragma GCC optimization ("unroll-loops")

Subtask #1
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	380 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	348 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	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 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	2 ms	376 KB	Output is correct
33	Correct	2 ms	376 KB	Output is correct
34	Correct	2 ms	376 KB	Output is correct

Subtask #2
41.0 / 41.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	380 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	348 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	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 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	2 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	380 KB	Output is correct
36	Correct	2 ms	376 KB	Output is correct
37	Correct	2 ms	348 KB	Output is correct
38	Correct	2 ms	424 KB	Output is correct
39	Correct	2 ms	376 KB	Output is correct
40	Correct	2 ms	376 KB	Output is correct
41	Correct	2 ms	376 KB	Output is correct
42	Correct	2 ms	376 KB	Output is correct
43	Correct	2 ms	376 KB	Output is correct
44	Correct	2 ms	376 KB	Output is correct
45	Correct	2 ms	376 KB	Output is correct
46	Correct	2 ms	376 KB	Output is correct
47	Correct	2 ms	376 KB	Output is correct
48	Correct	2 ms	376 KB	Output is correct
49	Correct	2 ms	376 KB	Output is correct
50	Correct	2 ms	376 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	2 ms	376 KB	Output is correct
58	Correct	2 ms	376 KB	Output is correct

Subtask #3
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	380 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	380 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	50 ms	25940 KB	Output is correct
8	Correct	51 ms	27848 KB	Output is correct
9	Correct	51 ms	27852 KB	Output is correct
10	Correct	50 ms	27844 KB	Output is correct
11	Correct	50 ms	27848 KB	Output is correct
12	Correct	51 ms	27856 KB	Output is correct
13	Correct	51 ms	27844 KB	Output is correct
14	Correct	57 ms	27848 KB	Output is correct

Subtask #4
49.0 / 49.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	380 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	376 KB	Output is correct
12	Correct	2 ms	348 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	376 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 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	2 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	380 KB	Output is correct
36	Correct	2 ms	376 KB	Output is correct
37	Correct	2 ms	348 KB	Output is correct
38	Correct	2 ms	424 KB	Output is correct
39	Correct	2 ms	376 KB	Output is correct
40	Correct	2 ms	376 KB	Output is correct
41	Correct	2 ms	376 KB	Output is correct
42	Correct	2 ms	376 KB	Output is correct
43	Correct	2 ms	376 KB	Output is correct
44	Correct	2 ms	376 KB	Output is correct
45	Correct	2 ms	376 KB	Output is correct
46	Correct	2 ms	376 KB	Output is correct
47	Correct	2 ms	376 KB	Output is correct
48	Correct	2 ms	376 KB	Output is correct
49	Correct	2 ms	376 KB	Output is correct
50	Correct	2 ms	376 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	2 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	380 KB	Output is correct
61	Correct	2 ms	376 KB	Output is correct
62	Correct	2 ms	376 KB	Output is correct
63	Correct	2 ms	380 KB	Output is correct
64	Correct	2 ms	376 KB	Output is correct
65	Correct	50 ms	25940 KB	Output is correct
66	Correct	51 ms	27848 KB	Output is correct
67	Correct	51 ms	27852 KB	Output is correct
68	Correct	50 ms	27844 KB	Output is correct
69	Correct	50 ms	27848 KB	Output is correct
70	Correct	51 ms	27856 KB	Output is correct
71	Correct	51 ms	27844 KB	Output is correct
72	Correct	57 ms	27848 KB	Output is correct
73	Correct	50 ms	27848 KB	Output is correct
74	Correct	50 ms	27868 KB	Output is correct
75	Correct	51 ms	27852 KB	Output is correct
76	Correct	60 ms	27848 KB	Output is correct
77	Correct	51 ms	27848 KB	Output is correct
78	Correct	53 ms	27848 KB	Output is correct
79	Correct	51 ms	27852 KB	Output is correct
80	Correct	51 ms	27852 KB	Output is correct
81	Correct	50 ms	27848 KB	Output is correct
82	Correct	51 ms	27848 KB	Output is correct
83	Correct	57 ms	27848 KB	Output is correct
84	Correct	60 ms	27844 KB	Output is correct
85	Correct	57 ms	27888 KB	Output is correct
86	Correct	57 ms	27976 KB	Output is correct
87	Correct	57 ms	27848 KB	Output is correct
88	Correct	57 ms	27848 KB	Output is correct
89	Correct	57 ms	27844 KB	Output is correct
90	Correct	57 ms	27848 KB	Output is correct
91	Correct	59 ms	27852 KB	Output is correct
92	Correct	60 ms	27976 KB	Output is correct
93	Correct	61 ms	27852 KB	Output is correct
94	Correct	61 ms	27848 KB	Output is correct
95	Correct	61 ms	27848 KB	Output is correct
96	Correct	61 ms	27852 KB	Output is correct
97	Correct	61 ms	27968 KB	Output is correct
98	Correct	61 ms	27848 KB	Output is correct
99	Correct	61 ms	27972 KB	Output is correct
100	Correct	62 ms	27976 KB	Output is correct
101	Correct	62 ms	27848 KB	Output is correct
102	Correct	61 ms	27952 KB	Output is correct

답안 #125819

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