제출 #235430

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
235430		Charis02	Lamps (JOI19_lamps)	C++14	0 / 100	19 ms	9556 KiB

lamp

#include<iostream>
#include<stdio.h>
#include<vector>
#include<cmath>
#include<queue>
#include<string.h>
#include<unordered_map>
#include<set>
#include<algorithm>
#define ll int
#define pi pair < ll,ll >
#define mp(a,b) make_pair(a,b)
#define mid (low+high)/2
#define rep(i,a,b) for(int i = a;i < b;i++)
#define N 300004
#define INF 1e9+7

using namespace std;

ll n;
string s,t;
bool vis[N][2];
int steps[N][2];

void solve()
{
    rep(i,0,N)
        steps[i][0] = steps[i][1] = n;
    queue < pair < int,int > > q;
    int ss = 0;
    rep(i,0,n)
        ss += (s[i]-'0')*(1 << i);
    q.push(mp(ss,1));
    vis[ss][1]=true;
    steps[ss][1] = 0;

    while(!q.empty())
    {
        pair < int,int > top = q.front();
        int cur = top.first;
        int used = top.second;
        q.pop();

        int tmp = cur;

        if(used == 1)
        {
            rep(i,0,n)
            {
                tmp = cur;
                rep(j,i,n)
                {
                    tmp |= (1 << j);
                    if(!vis[tmp][1])
                    {
                        vis[tmp][1]=true;
                        steps[tmp][1]=steps[cur][1]+1;
                        q.push(mp(tmp,1));
                    }
                }
            }
            rep(i,0,n)
            {
                tmp = cur;
                rep(j,i,n)
                {
                    tmp &= ~(1 << j);
                    if(!vis[tmp][1])
                    {
                        vis[tmp][1]=true;
                        steps[tmp][1]=steps[cur][1]+1;
                        q.push(mp(tmp,1));
                    }
                }
            }
        }

        if(used >= 0)
        {
            rep(i,0,n)
            {
                tmp = cur;
                rep(j,i,n)
                {
                    tmp ^= (1 << j);
                    if(!vis[tmp][0])
                    {
                        vis[tmp][0]=true;
                        steps[tmp][0]=steps[cur][0]+1;
                        q.push(mp(tmp,0));
                    }
                }
            }
        }
    }

    return;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    cin >> n;
    cin >> s;
    cin >> t;

    solve();
    int tt=0;
    rep(i,0,n)
        tt += (t[i]-'0')*(1<<i);
    cout << min(steps[tt][0],steps[tt][1]);

    return 0;
}

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