Submission #123340

#	Time	Username	Problem	Language	Result	Execution time	Memory
123340		claudy	Lamps (JOI19_lamps)	C++14	0 / 100	12 ms	7724 KiB

lamp

//# pragma GCC optimize("Ofast,no-stack-protector")
//# pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
# pragma GCC optimize("Ofast")
# pragma GCC optimization ("unroll-loops")
# include "bits/stdc++.h"
//std::pair<int,int> DR[] = {{-1,0},{0,1},{1,0},{0,-1},{-1,1},{-1,-1},{1,1},{1,-1}};
# define ll long long
# define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
# define rc(s) return cout << s,0
# define rcg(s) cout << s;exit(0)
# define _ ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
# define db(x) cerr << #x << " = " << x << '\n'
# define pb push_back
# define mp make_pair
# define all(s) s.begin(),s.end()
# define sz(x) (int)((x).size())
//# define int ll
using namespace std;
/*
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# define LOCAL
# define sim template < class c
# define ris return * this
# define dor > debug & operator <<
# define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define show(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
int gcd(int a, int b)
{
if(b) return gcd(b,a%b);
return a;
}mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
*/
 
int n;
string a,b;
int dp[1 << 17];

int32_t main(){_
	//freopen("input","r",stdin);
	cin >> n >> a >> b;
	dp[0] = 0;
	for(int i = 1;i <= n;i++)
	{
		dp[i] = 1e9;
	}
	for(int i = 1;i <= n;i++)
	{
		if(a[i - 1] == b[i - 1]) dp[i] = dp[i - 1];
		int cnt[2];
		cnt[0] = cnt[1] = 0;
		bool B = 1;
		for(int j = i;j >= 1;j--)
		{
			if(a[j - 1] == b[j - 1]) B = 0;
			if(i == j || b[j - 1] != b[j])
			{
				cnt[b[j - 1] - '0']++;
			}
			if(B) dp[i] = min(dp[i],dp[j - 1] + 1);
			dp[i] = min(dp[i],dp[j - 1] + min(cnt[0],cnt[1]) + 1);
		}
	}
	cout << dp[n] << '\n';
	return 0;
}
 
 
 
 
 
 

Compilation message (stderr)

lamp.cpp:4:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 # pragma GCC optimization ("unroll-loops")

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