답안 #222587

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
222587	2020-04-13T11:17:46 Z	_7_7_	Lamps (JOI19_lamps)	C++14	100 / 100	66 ms	16120 KB

lamp

#include <bits/stdc++.h>        	                                   
 
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
 
 
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define forev(i, b, a) for(int i = (b); i >= (a); --i)
#define forn(i, a, b) for(int i = (a); i <= (b); ++i)
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
 
 
using namespace std;
 
 
typedef pair < long long, long long > pll;    
typedef pair < int, int > pii;
typedef unsigned long long ull;         
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;  
typedef long long ll;  
typedef double db;                             
 
 
const int inf = 1e9, maxn = 4e5 + 148, mod = 1e9 + 7, N = 1e6 + 11;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 333;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;
 

 
 
int n, dp[N][3];
char s[N], t[N]; 
char f (char c, int j) {
	if (!j)
		return c;
	return '0' + j - 1;
}
int get (int i, int j, int k) {	
	int res = 0;
	if (j != k && j)//we need to open new interval
		++res;

	if ((i == 1 || f(s[i - 1], k) == t[i - 1]) && f(s[i], j) != t[i])
		++res;
	//if s[i - 1] = t[i - 1] and s[i] = t[i] then don't need to add anything
	//if s[i - 1] != t[i - 1] and s[i] = t[i] then we already added 1 before
	//if s[i - 1] != t[i - 1] and s[i] != t[i] then we just add i to the last interval of operation XOR
	//otherwise we need to add new operation XOR
	return res;
}

main () {
	scanf("%d\n%s\n%s", &n, s + 1, t + 1);

	dp[0][1] = dp[0][2] = 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) 
				dp[i][j] = min(dp[i][j], dp[i - 1][k] + get(i, j, k));
	}

	cout << min({dp[n][0], dp[n][1], dp[n][2]});
}

Compilation message

lamp.cpp:64:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main () {
       ^
lamp.cpp: In function 'int main()':
lamp.cpp:69:6: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
      for (int j = 0; j < 3; ++j)
      ^~~
lamp.cpp:72:3: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   for (int j = 0; j < 3; ++j)
   ^~~
lamp.cpp:65:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d\n%s\n%s", &n, s + 1, t + 1);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

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

Subtask #2
41.0 / 41.0

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

Subtask #3
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	5 ms	384 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	4 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	4 ms	384 KB	Output is correct
7	Correct	54 ms	15352 KB	Output is correct
8	Correct	54 ms	15480 KB	Output is correct
9	Correct	52 ms	15352 KB	Output is correct
10	Correct	52 ms	15352 KB	Output is correct
11	Correct	52 ms	15352 KB	Output is correct
12	Correct	52 ms	15352 KB	Output is correct
13	Correct	53 ms	15352 KB	Output is correct
14	Correct	57 ms	15608 KB	Output is correct

Subtask #4
49.0 / 49.0

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

답안 #222587

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