답안 #261187

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
261187	2020-08-11T13:38:36 Z	dorijanlendvaj	Lamps (JOI19_lamps)	C++17	100 / 100	53 ms	27832 KB

lamp

//DUEL
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back
#pragma GCC optimize("unroll-loops")
#define shandom_ruffle(a, b) shuffle(a, b, rng)
#define vi vector<int>
#define vl vector<ll>
#define popcnt __builtin_popcount
#define popcntll __builtin_popcountll
#define all(a) begin(a),end(a)

using namespace std;
using namespace __gnu_pbds;

using ll=long long;
using ull=unsigned long long;
using ld=long double;
int MOD=1000000007;
int MOD2=998244353;
vector<int> bases;
const ll LLINF=1ll<<60;
const char en='\n';

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void yes() {cout<<"YES"<<en; exit(0);}
void no() {cout<<"NO"<<en; exit(0);}
inline int rund() {int x576363482791fuweh=rng();return abs(x576363482791fuweh)%RAND_MAX;}
template<class T>
void prVec(vector<T> w,bool fl=false)
{
	cout<<w.size()<<en;
	for (int i=0;i<int(w.size())-1;++i) cout<<w[i]<<' ';
	if (w.size()) cout<<w[w.size()-1]<<en;
	if (fl) cout<<flush;
}

void M998()
{
	swap(MOD,MOD2);
}

ll raand()
{
	ll a=rund();
	a*=RAND_MAX;
	a+=rund();
    return a;
}

#define rand raand

ll raaand()
{
	return raand()*(MOD-7)+raand();
}

void compress(vi&v)
{
	set<int> s;
	for (auto a: v) s.insert(a);
	vi o(all(s));
	for (auto&a: v) a=lower_bound(all(o),a)-o.begin();
}

void compress(vl&v)
{
	set<ll> s;
	for (auto a: v) s.insert(a);
	vl o(all(s));
	for (auto&a: v) a=lower_bound(all(o),a)-o.begin();
}

string to_upper(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A';
	return a;
}

string to_lower(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A';
	return a;
}

ll sti(string a,int base=10)
{
	ll k=0;
	for (int i=0;i<(int)a.size();++i)
	{
		k*=base;
		k+=a[i]-'0';
	}
	return k;
}

template<class T>
void eras(vector<T>& a,T b)
{
	a.erase(find(a.begin(),a.end(),b));
}

string its(ll k,int base=10)
{
	if (k==0) return "0";
	string a;
	while (k)
	{
		a.push_back((k%base)+'0');
		k/=base;
	}
	reverse(a.begin(),a.end());
	return a;
}

ll min(ll a,int b)
{
	if (a<b) return a;
	return b;
}

ll min(int a,ll b)
{
	if (a<b) return a;
	return b;
}

ll max(ll a,int b)
{
	if (a>b) return a;
	return b;
}

ll max(int a,ll b)
{
	if (a>b) return a;
	return b;
}

ll gcd(ll a,ll b)
{
	if (b==0) return a;
	return gcd(b,a%b);
}

ll lcm(ll a,ll b)
{
	return a/gcd(a,b)*b;
}

template<class T,class K>
pair<T,K> mp(T a,K b)
{
	return make_pair(a,b);
}

inline int mult(ll a,ll b)
{
	return (a*b)%MOD;
}

inline int pot(int n,int k)
{
	if (k==0) return 1;
	ll a=pot(n,k/2);
	a=mult(a,a);
	if (k%2) return mult(a,n);
	else return a;
}

int divide(int a,int b)
{
	return mult(a,pot(b,MOD-2));
}

inline int sub(int a,int b)
{
	if (a-b>=0) return a-b;
	return a-b+MOD;
}

inline int add(int a,int b)
{
	if (a+b>=MOD) return a+b-MOD;
	return a+b;
}

bool prime(ll a)
{
	if (a==1) return 0;
	for (int i=2;i<=round(sqrt(a));++i)
	{
		if (a%i==0) return 0;
	}
	return 1;
}

const int N=1000010;
int t,n,dp[N][6];
//0 - ništa
//1 - toggle
//2 - postavi na 0
//3 - postavi na 0 pa toggle
//4 - postavi na 1
//5 - postavi na 1 pa toggle
bool ok[6];
int co[6][6];
string a,b;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	for (int i=0;i<10;++i) bases.push_back(rand()%(MOD-13893829*2)+13893829);
	co[0][1]=co[0][2]=co[0][4]=1;
	co[0][3]=co[0][5]=2;
	co[1][2]=co[1][3]=co[1][4]=co[1][5]=1;
	co[2][1]=co[2][3]=co[2][4]=1;
	co[2][5]=2;
	co[3][4]=co[3][5]=1;
	co[4][1]=co[4][2]=co[4][5]=1;
	co[4][3]=2;
	co[5][3]=co[5][2]=1;
	cin>>n>>a>>b;
	a="0"+a;
	b="0"+b;
	memset(dp,63,sizeof(dp));
	dp[0][0]=0;
	for (int i=1;i<=n;++i)
	{
		memset(ok,0,sizeof(ok));
		if (a[i]==b[i]) ok[0]=1;
		else ok[1]=1;
		if (b[i]=='0') ok[2]=1;
		else ok[3]=1;
		if (b[i]=='1') ok[4]=1;
		else ok[5]=1;
		for (int j=0;j<6;++j) if (ok[j]) for (int k=0;k<6;++k) dp[i][j]=min(dp[i][j],dp[i-1][k]+co[k][j]);
	}
	int mi=MOD;
	for (int i=0;i<6;++i) mi=min(mi,dp[n][i]);
	cout<<mi<<en;
}

Subtask #1
6.0 / 6.0

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

Subtask #2
41.0 / 41.0

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

Subtask #3
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	17 ms	23808 KB	Output is correct
2	Correct	16 ms	23808 KB	Output is correct
3	Correct	16 ms	23808 KB	Output is correct
4	Correct	16 ms	23808 KB	Output is correct
5	Correct	16 ms	23808 KB	Output is correct
6	Correct	16 ms	23808 KB	Output is correct
7	Correct	41 ms	27692 KB	Output is correct
8	Correct	38 ms	27684 KB	Output is correct
9	Correct	39 ms	27832 KB	Output is correct
10	Correct	38 ms	27692 KB	Output is correct
11	Correct	39 ms	27692 KB	Output is correct
12	Correct	38 ms	27692 KB	Output is correct
13	Correct	39 ms	27820 KB	Output is correct
14	Correct	38 ms	27692 KB	Output is correct

Subtask #4
49.0 / 49.0

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

답안 #261187

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