답안 #203991

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
203991	2020-02-23T13:36:14 Z	cheetose	Lamps (JOI19_lamps)	C++11	100 / 100	228 ms	22008 KB

lamp

#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const int MOD = 998244353;
ll POW(ll a, ll b, ll MMM = MOD) { ll ret = 1; for (; b; b >>= 1, a = (a*a) % MMM)if (b & 1)ret = (ret*a) % MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

int a[1000005],b[1000005],d[3][1000005];
int main() {
	int n;
	scanf("%d",&n);
	fup(i,1,n,1)scanf("%1d",a+i);
	fup(i,1,n,1)scanf("%1d",b+i);
	d[0][1]=b[1]+1,d[1][1]=2-b[1],d[2][1]=a[1]!=b[1];
	fup(i,2,n,1)
	{
		d[0][i]=min(d[0][i-1]+(!b[i-1] && b[i]),d[2][i-1]+1+(a[i-1]==b[i-1] && b[i]));
		d[1][i]=min(d[1][i-1]+(b[i-1] && !b[i]),d[2][i-1]+1+(a[i-1]==b[i-1] && !b[i]));
		d[2][i]=min({
			d[2][i-1]+(a[i]!=b[i] && a[i-1]==b[i-1]),
			d[0][i-1]+(a[i]!=b[i] && !b[i-1]),
			d[1][i-1]+(a[i]!=b[i] && b[i-1])
		});
	}
	printf("%d\n",min({d[0][n],d[1][n],d[2][n]}));
}

Compilation message

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

Subtask #1
6.0 / 6.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	252 KB	Output is correct
2	Correct	5 ms	248 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	380 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	376 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	376 KB	Output is correct
18	Correct	5 ms	376 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	380 KB	Output is correct
31	Correct	5 ms	376 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	252 KB	Output is correct
2	Correct	5 ms	248 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	380 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	376 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	376 KB	Output is correct
18	Correct	5 ms	376 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	380 KB	Output is correct
31	Correct	5 ms	376 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	380 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	380 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	5 ms	376 KB	Output is correct
49	Correct	6 ms	376 KB	Output is correct
50	Correct	5 ms	376 KB	Output is correct
51	Correct	5 ms	376 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	5 ms	376 KB	Output is correct
57	Correct	5 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	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	380 KB	Output is correct
6	Correct	5 ms	376 KB	Output is correct
7	Correct	197 ms	22008 KB	Output is correct
8	Correct	207 ms	21880 KB	Output is correct
9	Correct	200 ms	21880 KB	Output is correct
10	Correct	205 ms	21880 KB	Output is correct
11	Correct	198 ms	21880 KB	Output is correct
12	Correct	202 ms	21848 KB	Output is correct
13	Correct	195 ms	21880 KB	Output is correct
14	Correct	201 ms	21880 KB	Output is correct

Subtask #4
49.0 / 49.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	252 KB	Output is correct
2	Correct	5 ms	248 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	380 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	376 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	376 KB	Output is correct
18	Correct	5 ms	376 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	380 KB	Output is correct
31	Correct	5 ms	376 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	380 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	380 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	5 ms	376 KB	Output is correct
49	Correct	6 ms	376 KB	Output is correct
50	Correct	5 ms	376 KB	Output is correct
51	Correct	5 ms	376 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	5 ms	376 KB	Output is correct
57	Correct	5 ms	376 KB	Output is correct
58	Correct	5 ms	376 KB	Output is correct
59	Correct	5 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	380 KB	Output is correct
64	Correct	5 ms	376 KB	Output is correct
65	Correct	197 ms	22008 KB	Output is correct
66	Correct	207 ms	21880 KB	Output is correct
67	Correct	200 ms	21880 KB	Output is correct
68	Correct	205 ms	21880 KB	Output is correct
69	Correct	198 ms	21880 KB	Output is correct
70	Correct	202 ms	21848 KB	Output is correct
71	Correct	195 ms	21880 KB	Output is correct
72	Correct	201 ms	21880 KB	Output is correct
73	Correct	202 ms	21880 KB	Output is correct
74	Correct	215 ms	21880 KB	Output is correct
75	Correct	216 ms	21880 KB	Output is correct
76	Correct	215 ms	21880 KB	Output is correct
77	Correct	206 ms	21880 KB	Output is correct
78	Correct	208 ms	21964 KB	Output is correct
79	Correct	210 ms	21884 KB	Output is correct
80	Correct	226 ms	21880 KB	Output is correct
81	Correct	212 ms	21880 KB	Output is correct
82	Correct	212 ms	21880 KB	Output is correct
83	Correct	204 ms	22008 KB	Output is correct
84	Correct	200 ms	21880 KB	Output is correct
85	Correct	205 ms	21884 KB	Output is correct
86	Correct	209 ms	21880 KB	Output is correct
87	Correct	204 ms	21884 KB	Output is correct
88	Correct	210 ms	21888 KB	Output is correct
89	Correct	204 ms	21884 KB	Output is correct
90	Correct	203 ms	21884 KB	Output is correct
91	Correct	214 ms	21940 KB	Output is correct
92	Correct	210 ms	21880 KB	Output is correct
93	Correct	214 ms	21880 KB	Output is correct
94	Correct	209 ms	21880 KB	Output is correct
95	Correct	211 ms	21880 KB	Output is correct
96	Correct	228 ms	21880 KB	Output is correct
97	Correct	209 ms	21756 KB	Output is correct
98	Correct	219 ms	21880 KB	Output is correct
99	Correct	213 ms	21880 KB	Output is correct
100	Correct	212 ms	21880 KB	Output is correct
101	Correct	217 ms	21880 KB	Output is correct
102	Correct	216 ms	21880 KB	Output is correct

답안 #203991

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