oj.uz

Submission #707017

# Submission time Handle Problem Language Result Execution time Memory
707017 2023-03-08T09:49:52 Z Antekb Lamps (JOI19_lamps) C++14
100 / 100
 36 ms 31308 KB 
#include<bits/stdc++.h>
 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("trapv")
 
#define st first
#define nd second
#define pb push_back
#define eb emplace_back
#define pp(x) pop_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define rev(x) reverse(all(x))
#define sor(x) sort(all(x))
#define sz(x) (int)(x).size()
#define rsz(x) resize(x)
 
using namespace std;
 
///~~~~~~~~~~~~~~~~~~~~~~~~~~
 
template <typename H, typename T> 
ostream& operator<<(ostream& os, pair<H, T> m){
	return os <<"("<< m.st<<", "<<m.nd<<")";
}
template <typename H> 
ostream& operator<<(ostream& os, vector<H> V){
	os<<"{";
	for(int i=0; i<V.size(); i++){
		if(i)os<<" ";
		os<<V[i];
	}
	os<<"}";
	return os;
}
 
void debug(){cerr<<"\n";}
template <typename H, typename... T>
void debug(H h, T... t) {cerr<<h; if (sizeof...(t)) cerr << ", "; debug(t...);}
#define deb(x...) cerr<<#x<<" = ";debug(x);
//#define deb(x...) ;
 
///~~~~~~~~~~~~~~~~~~~~~~~~~
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef string str;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

 
#define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
 
const int K=20, N=1<<K, INF=1e9+5, mod2=1e9+7, mod=998244353;

struct modint{
	int n=0;
	modint(){}
	modint(ll x){
		n=x%mod;
		if(n<0)n+=mod;
	}
	operator int(){
		return n;
	}
	modint operator+(modint a){a.n = n+a.n; if(a.n>=mod)a.n-=mod;return a;}
	modint operator+=(modint a){return (*this)=(*this)+a;}
	modint operator-(modint a){a.n = n-a.n; if(a.n<0)a.n+=mod;return a;}
	modint operator-=(modint a){return (*this)=(*this)-a;}
	modint operator*(modint a){a.n = (n*1ll*a.n)%mod; return a;}
	modint operator*=(modint a){return (*this)=(*this)*a;}
	modint operator^(const ll &m)const{
		modint a(1);
		if(m==0)return a;
		if(m==1)return (*this);
		a=(*this)^(m/2);
		a*=a;
		return a*((*this)^(m&1));
	}
	modint odw(){
		return (*this)^((ll)mod-2);
	}
	modint operator/(modint a){return (*this)*a.odw();}
	modint operator/=(modint a){return (*this)=(*this)/a;}
	bool operator==(modint a){return a.n==n;}
	friend ostream& operator<<(ostream& os, modint m) {
		return os << m.n; 
	}
};
modint fact[N], fact2[N];
typedef vector<modint> vm;
void factinit(){
    fact[0]=1;
    for(int i=1; i<N; i++){
        fact[i]=(fact[i-1]*modint(i))%mod;
    }
    fact2[N-1]=fact[N-1].odw();
    for(int i=N-2; i>=0; i--){
    	fact2[i]=(fact2[i+1]*modint(i+1))%mod;
    }
}
modint npok(int _n, int _k){
    return fact[_n]*fact2[_k]*fact2[_n-_k];
}
int A[N], B[N], dp[N][3];
int main(){
	//factinit();
	BOOST;
	int n;
	cin>>n;
	string s;
	cin>>s;
	for(int i=0; i<n; i++)A[i+1]=s[i]&1;
	cin>>s;
	for(int i=0; i<n; i++)B[i+1]=s[i]&1;
	dp[0][0]=dp[0][1]=INF;
	for(int i=1; i<=n+1; i++){
		for(int j=0; j<3; j++){
			dp[i][j]=INF;
			for(int k=0; k<3; k++){
				int c=0;
				if(j!=2 && k!=j)c=2;
				int a=A[i-1], b=A[i];
				if(j!=2)b=j;
				if(k!=2)a=k;
				a^=B[i-1];
				b^=B[i];
				dp[i][j]=min(dp[i][j], dp[i-1][k]+c+(a^b));
			}
		}
	}
	cout<<dp[n+1][2]/2;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
41.0 / 41.0

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

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8532 KB Output is correct
2 Correct 4 ms 8532 KB Output is correct
3 Correct 5 ms 8532 KB Output is correct
4 Correct 4 ms 8532 KB Output is correct
5 Correct 4 ms 8540 KB Output is correct
6 Correct 4 ms 8544 KB Output is correct
7 Correct 29 ms 31164 KB Output is correct
8 Correct 29 ms 31056 KB Output is correct
9 Correct 29 ms 31220 KB Output is correct
10 Correct 30 ms 31140 KB Output is correct
11 Correct 30 ms 31204 KB Output is correct
12 Correct 30 ms 31088 KB Output is correct
13 Correct 29 ms 31160 KB Output is correct
14 Correct 28 ms 31092 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8532 KB Output is correct
2 Correct 4 ms 8544 KB Output is correct
3 Correct 5 ms 8532 KB Output is correct
4 Correct 3 ms 8532 KB Output is correct
5 Correct 3 ms 8532 KB Output is correct
6 Correct 4 ms 8532 KB Output is correct
7 Correct 4 ms 8532 KB Output is correct
8 Correct 4 ms 8532 KB Output is correct
9 Correct 3 ms 8532 KB Output is correct
10 Correct 4 ms 8540 KB Output is correct
11 Correct 4 ms 8504 KB Output is correct
12 Correct 3 ms 8540 KB Output is correct
13 Correct 3 ms 8532 KB Output is correct
14 Correct 4 ms 8532 KB Output is correct
15 Correct 4 ms 8532 KB Output is correct
16 Correct 3 ms 8532 KB Output is correct
17 Correct 4 ms 8532 KB Output is correct
18 Correct 4 ms 8532 KB Output is correct
19 Correct 3 ms 8540 KB Output is correct
20 Correct 3 ms 8540 KB Output is correct
21 Correct 3 ms 8532 KB Output is correct
22 Correct 4 ms 8532 KB Output is correct
23 Correct 4 ms 8532 KB Output is correct
24 Correct 4 ms 8536 KB Output is correct
25 Correct 4 ms 8540 KB Output is correct
26 Correct 4 ms 8532 KB Output is correct
27 Correct 4 ms 8540 KB Output is correct
28 Correct 4 ms 8440 KB Output is correct
29 Correct 3 ms 8532 KB Output is correct
30 Correct 3 ms 8532 KB Output is correct
31 Correct 3 ms 8532 KB Output is correct
32 Correct 4 ms 8532 KB Output is correct
33 Correct 3 ms 8532 KB Output is correct
34 Correct 4 ms 8532 KB Output is correct
35 Correct 3 ms 8536 KB Output is correct
36 Correct 4 ms 8532 KB Output is correct
37 Correct 3 ms 8532 KB Output is correct
38 Correct 3 ms 8532 KB Output is correct
39 Correct 4 ms 8532 KB Output is correct
40 Correct 4 ms 8532 KB Output is correct
41 Correct 3 ms 8532 KB Output is correct
42 Correct 4 ms 8536 KB Output is correct
43 Correct 4 ms 8536 KB Output is correct
44 Correct 4 ms 8532 KB Output is correct
45 Correct 3 ms 8532 KB Output is correct
46 Correct 4 ms 8532 KB Output is correct
47 Correct 4 ms 8532 KB Output is correct
48 Correct 4 ms 8532 KB Output is correct
49 Correct 4 ms 8544 KB Output is correct
50 Correct 4 ms 8532 KB Output is correct
51 Correct 4 ms 8532 KB Output is correct
52 Correct 4 ms 8540 KB Output is correct
53 Correct 4 ms 8532 KB Output is correct
54 Correct 4 ms 8532 KB Output is correct
55 Correct 4 ms 8532 KB Output is correct
56 Correct 3 ms 8532 KB Output is correct
57 Correct 5 ms 8532 KB Output is correct
58 Correct 4 ms 8532 KB Output is correct
59 Correct 3 ms 8532 KB Output is correct
60 Correct 4 ms 8532 KB Output is correct
61 Correct 5 ms 8532 KB Output is correct
62 Correct 4 ms 8532 KB Output is correct
63 Correct 4 ms 8540 KB Output is correct
64 Correct 4 ms 8544 KB Output is correct
65 Correct 29 ms 31164 KB Output is correct
66 Correct 29 ms 31056 KB Output is correct
67 Correct 29 ms 31220 KB Output is correct
68 Correct 30 ms 31140 KB Output is correct
69 Correct 30 ms 31204 KB Output is correct
70 Correct 30 ms 31088 KB Output is correct
71 Correct 29 ms 31160 KB Output is correct
72 Correct 28 ms 31092 KB Output is correct
73 Correct 29 ms 31132 KB Output is correct
74 Correct 28 ms 31096 KB Output is correct
75 Correct 28 ms 31168 KB Output is correct
76 Correct 29 ms 31072 KB Output is correct
77 Correct 32 ms 31308 KB Output is correct
78 Correct 36 ms 31084 KB Output is correct
79 Correct 29 ms 31076 KB Output is correct
80 Correct 29 ms 31144 KB Output is correct
81 Correct 30 ms 31072 KB Output is correct
82 Correct 28 ms 31164 KB Output is correct
83 Correct 31 ms 31096 KB Output is correct
84 Correct 28 ms 31096 KB Output is correct
85 Correct 28 ms 31124 KB Output is correct
86 Correct 28 ms 31088 KB Output is correct
87 Correct 28 ms 31108 KB Output is correct
88 Correct 30 ms 31068 KB Output is correct
89 Correct 29 ms 31112 KB Output is correct
90 Correct 28 ms 31156 KB Output is correct
91 Correct 29 ms 31164 KB Output is correct
92 Correct 30 ms 31076 KB Output is correct
93 Correct 28 ms 31076 KB Output is correct
94 Correct 28 ms 31072 KB Output is correct
95 Correct 28 ms 31112 KB Output is correct
96 Correct 28 ms 31068 KB Output is correct
97 Correct 28 ms 31172 KB Output is correct
98 Correct 30 ms 31148 KB Output is correct
99 Correct 28 ms 31100 KB Output is correct
100 Correct 29 ms 31076 KB Output is correct
101 Correct 28 ms 31148 KB Output is correct
102 Correct 28 ms 31088 KB Output is correct