Submission #768409

#	Time	Username	Problem	Language	Result	Execution time	Memory
768409		Filya	Lamps (JOI19_lamps)	C++14	100 / 100	25 ms	22060 KiB

lamp

//♥God will make a way♥

//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stdio.h>
#include <climits>
#include <numeric>
using namespace std;
//#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/////////////////////
#define ci(x) if(x) cout << "YES" << '\n'; else cout << "NO" << '\n';
#define cii(x) if(check(x))
#define MOD 1000000007
#define MOD2 998244353
#define oo 1e9
#define ool 1e18L
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mii map<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector <ll>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define alll(x) (x), (x) + n
#define clr(x) (x).clear();
#define fri(x) for(int i = 0; i < x; ++i)
#define frj(x) for(int j = 0; j < x; ++j)
#define frp(x) for(int p = 0; p < x; ++p)
#define frr(a, b) for(int i = a; i < b; ++i)
#define frrj(a, b) for(int j = a; j < b; ++j)
#define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
#define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
#define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
#define fr(x) for(auto it : x) //el
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define dbg(x) cerr << #x << ": " << x << endl;
#define ce(x) cout << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
#define blt __builtin_popcount
/////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
/////////////////////code/////////////////////
int dp[1000005][4];
bool a[1000005], b[1000005];
int main() {
    fastio;
    int n, from0, from1, from2; 
	string s, t; cin >> n >> s >> t;
    for(int i = 1; i <= n; i++) {
		a[i] = s[i-1] - '0';
		b[i] = t[i-1] - '0';
	}
    dp[0][0] = dp[0][1] = 1e9; //sranq goy chunen
    for(int i = 1; i <= n; i++) {
		from0 = dp[i-1][0]; 
		if(b[i] && !b[i-1]) from0++; //verjum 1qaylov sa kpoxenq(ete naxordn el enq poxelu, miangamic ira het kpoxenq, el chenq gumari)
		from1 = dp[i-1][1] + 1; //0enq sarqum mi hat verjum
		if(b[i] && !b[i-1]) from1++; //ete sa 1piti verjum sarqenq u naxordy 0a, arandzin ksarqenq, ete che miangamic naxordi het ksarqenq
		from2 = dp[i-1][2] + 1; //0enq sarqum mi hat verjum
		if(b[i] && a[i-1] == b[i-1]) from2++;
		dp[i][0] = min({from0, from1, from2});
		from1 = dp[i-1][1]; 
		if(!b[i] && b[i-1]) from1++;
		from0 = dp[i-1][0] + 1;
		if(!b[i] && b[i-1]) from0++;
		from2 = dp[i-1][2] + 1;
		if(!b[i] && a[i-1] == b[i-1]) from2++;
		dp[i][1] = min({from0, from1, from2});
		from0 = dp[i-1][0], from1 = dp[i-1][1], from2 = dp[i-1][2];
		if(a[i] != b[i]) {
			from0 += !b[i-1]; //ete b[i-1] y 0chi, miangamic ira het kpoxeinw
			from1 += b[i-1];
			from2 += (a[i-1] == b[i-1]);
		}
		dp[i][2] = min({from0, from1, from2});
	}
    int ans = 1e9;
    fri(3) ans = min(ans, dp[n][i]);
    cout << ans;
}

• Subtask 1: 6 / 6
• Subtask 2: 41 / 41
• Subtask 3: 4 / 4
• Subtask 4: 49 / 49