답안 #107173

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
107173	2019-04-22T09:44:39 Z	eriksuenderhauf	Lamps (JOI19_lamps)	C++11	100 / 100	83 ms	14840 KB

lamp

//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%lld", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%lld\n", (n))
#define pii pair<int, int>
#define pil pair<int, long long>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vil vector<pil>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 1e6 + 5;
const double eps = 1e-9;
char a[MAXN], b[MAXN];
int dp[MAXN][3];

char f(char cur, int type) {
	if (type == 0)
		return '0';
	else if (type == 1)
		return '1';
	return cur;
}

int main() {
	int n;
	scanf("%d %s %s", &n, a+1, b+1);
	dp[0][0] = dp[0][1] = INF;
	for (int i = 1; i <= n; i++) {
		for (int j = 0; j < 3; j++)
			dp[i][j] = INF;
		for (int j = 0; j < 3; j++) {
			for (int k = 0; k < 3; k++) {
				int cost = 0;
				if (j != k && j != 2)
					cost++;
				if ((i == 1 || f(a[i-1], k) == b[i-1]) && f(a[i], j) != b[i])
					cost++;
				dp[i][j] = min(dp[i][j], dp[i-1][k] + cost);
			}
		}
	}
	pri(min(dp[n][0], min(dp[n][1],dp[n][2])));
    return 0;
}

Compilation message

lamp.cpp: In function 'int main()':
lamp.cpp:49:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %s %s", &n, a+1, b+1);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
41.0 / 41.0

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

Subtask #3
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	384 KB	Output is correct
2	Correct	2 ms	384 KB	Output is correct
3	Correct	2 ms	384 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	3 ms	384 KB	Output is correct
6	Correct	2 ms	384 KB	Output is correct
7	Correct	54 ms	14736 KB	Output is correct
8	Correct	67 ms	14812 KB	Output is correct
9	Correct	46 ms	14712 KB	Output is correct
10	Correct	65 ms	14712 KB	Output is correct
11	Correct	47 ms	14716 KB	Output is correct
12	Correct	45 ms	14712 KB	Output is correct
13	Correct	52 ms	14712 KB	Output is correct
14	Correct	58 ms	14712 KB	Output is correct

Subtask #4
49.0 / 49.0

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

답안 #107173

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