oj.uz

Submission #412116

# Submission time Handle Problem Language Result Execution time Memory
412116 2021-05-26T14:15:09 Z nathanlee726 Lamps (JOI19_lamps) C++14
100 / 100
 157 ms 27848 KB 
//#include<i_am_noob_orz>
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define int ll
#define ull unsigned long long
#define pii pair<int,int>
#define X first
#define Y second
#define mod ((ll)1e9+7)
#define pb push_back
#define mp make_pair
#define abs(x) ((x)>0?(x):(-(x)))
#define F(n) Fi(i,n)
#define Fi(i,n) Fl(i,0,n)
#define Fl(i,l,n) for(int i=l;i<n;i++)
#define memres(a) memset(a,0,sizeof(a))
#define all(a) a.begin(),a.end()
#define sz(a) ((int)a.size())
#define ceiling(a,b) (((a)+(b)-1)/(b))
#define endl '\n'
#define bit_count(x) __builtin_popcountll((x))
#define ykh mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define jimmy_is_kind false
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> rbtree;
 
//#define LOCAL
#ifdef LOCAL
#define bug(...) cerr<<"#"<<__LINE__<<' '<<#__VA_ARGS__<<"- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x) {cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr<<x<<", "; _do(y...);}
#define IOS()
#else
#define IOS() ios_base::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
#define bug(...)
#endif
 
int add(int a,int b){return(a+b>=mod?a+b-mod:a+b);}
int sub(int a,int b){return(a<b?a+mod-b:a-b);}
int po(int a,int b){
	if(b==0)return 1;
	if(b==1)return(a%mod);
	int tem=po(a,b/2);
	if(b&1)return(((tem*tem)%mod)*a)%mod;
	else return(tem*tem)%mod; 
}
int GCD(int a,int b){
	int x=0;
	int ra,rb;
	while(a&&b){
		if(((a&1)==0)&&((b&1)==0)){
			a>>=1,b>>=1,x++;
		}
		else if((a^b)&1){
			if(a&1)b>>=1;
			else a>>=1;
		}
		else{
			ra=abs(a-b),rb=min(a,b);
			a=ra,b=rb;
		}
	}
	return max(a,b)<<x;
}
int gcd(int a,int b){if(b==0)return a;return gcd(b,a%b);}
int n,dp[1000010][3];
signed main(){
	IOS();
	int n;
	cin>>n;
	string s1,s2;
	cin>>s1>>s2;
	dp[0][2]=(s1[0]!=s2[0]);
	dp[0][0]=1+(s2[0]=='1');
	dp[0][1]=1+(s2[0]=='0');
	F(3)bug(dp[0][i]);
	Fl(i,1,n){
		Fi(j,3)dp[i][j]=1e18;
		if(s2[i-1]!='0'){
			dp[i][0]=min(dp[i][0],dp[i-1][0]);
			dp[i][1]=min(dp[i][1],dp[i-1][0]+1);
			dp[i][2]=min(dp[i][2],dp[i-1][0]);
		}
		else{
			dp[i][0]=min(dp[i][0],dp[i-1][0]+(s2[i]=='1'));
			dp[i][1]=min(dp[i][1],1+dp[i-1][0]+(s2[i]=='0'));
			dp[i][2]=min(dp[i][2],dp[i-1][0]+(s1[i]!=s2[i]));			
		}
		if(s2[i-1]!='1'){
			dp[i][0]=min(dp[i][0],dp[i-1][1]+1);
			dp[i][1]=min(dp[i][1],dp[i-1][1]);
			dp[i][2]=min(dp[i][2],dp[i-1][1]);
		}
		else{
			dp[i][0]=min(dp[i][0],1+dp[i-1][1]+(s2[i]=='1'));
			dp[i][1]=min(dp[i][1],dp[i-1][1]+(s2[i]=='0'));
			dp[i][2]=min(dp[i][2],dp[i-1][1]+(s1[i]!=s2[i]));			
		}
		if(s1[i-1]!=s2[i-1]){
			dp[i][0]=min(dp[i][0],dp[i-1][2]+1);
			dp[i][1]=min(dp[i][1],dp[i-1][2]+1);
			dp[i][2]=min(dp[i][2],dp[i-1][2]);
		}
		else{
			dp[i][0]=min(dp[i][0],1+dp[i-1][2]+(s2[i]=='1'));
			dp[i][1]=min(dp[i][1],1+dp[i-1][2]+(s2[i]=='0'));
			dp[i][2]=min(dp[i][2],dp[i-1][2]+(s1[i]!=s2[i]));
		}
		Fi(j,3)bug(dp[i][j]);
	}
	int ans=1e18;
	F(3)ans=min(dp[n-1][i],ans);
	cout<<ans<<endl;
	return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 3 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct

Subtask #2
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 3 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 11 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 344 KB Output is correct

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 25 ms 25828 KB Output is correct
8 Correct 26 ms 27792 KB Output is correct
9 Correct 25 ms 27800 KB Output is correct
10 Correct 25 ms 27796 KB Output is correct
11 Correct 25 ms 27720 KB Output is correct
12 Correct 27 ms 27764 KB Output is correct
13 Correct 26 ms 27792 KB Output is correct
14 Correct 26 ms 27800 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 3 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 1 ms 332 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 332 KB Output is correct
39 Correct 1 ms 332 KB Output is correct
40 Correct 1 ms 332 KB Output is correct
41 Correct 1 ms 332 KB Output is correct
42 Correct 1 ms 332 KB Output is correct
43 Correct 1 ms 332 KB Output is correct
44 Correct 1 ms 332 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 11 ms 332 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 1 ms 332 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 332 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 332 KB Output is correct
58 Correct 1 ms 344 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 1 ms 204 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Correct 1 ms 204 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 25 ms 25828 KB Output is correct
66 Correct 26 ms 27792 KB Output is correct
67 Correct 25 ms 27800 KB Output is correct
68 Correct 25 ms 27796 KB Output is correct
69 Correct 25 ms 27720 KB Output is correct
70 Correct 27 ms 27764 KB Output is correct
71 Correct 26 ms 27792 KB Output is correct
72 Correct 26 ms 27800 KB Output is correct
73 Correct 26 ms 27756 KB Output is correct
74 Correct 25 ms 27844 KB Output is correct
75 Correct 157 ms 27812 KB Output is correct
76 Correct 25 ms 27804 KB Output is correct
77 Correct 31 ms 27800 KB Output is correct
78 Correct 26 ms 27796 KB Output is correct
79 Correct 28 ms 27756 KB Output is correct
80 Correct 31 ms 27796 KB Output is correct
81 Correct 25 ms 27800 KB Output is correct
82 Correct 90 ms 27768 KB Output is correct
83 Correct 27 ms 27828 KB Output is correct
84 Correct 33 ms 27776 KB Output is correct
85 Correct 29 ms 27736 KB Output is correct
86 Correct 27 ms 27800 KB Output is correct
87 Correct 28 ms 27788 KB Output is correct
88 Correct 27 ms 27724 KB Output is correct
89 Correct 30 ms 27836 KB Output is correct
90 Correct 27 ms 27748 KB Output is correct
91 Correct 49 ms 27848 KB Output is correct
92 Correct 30 ms 27760 KB Output is correct
93 Correct 32 ms 27844 KB Output is correct
94 Correct 32 ms 27732 KB Output is correct
95 Correct 32 ms 27728 KB Output is correct
96 Correct 41 ms 27728 KB Output is correct
97 Correct 33 ms 27828 KB Output is correct
98 Correct 31 ms 27776 KB Output is correct
99 Correct 36 ms 27772 KB Output is correct
100 Correct 35 ms 27844 KB Output is correct
101 Correct 37 ms 27764 KB Output is correct
102 Correct 32 ms 27720 KB Output is correct