제출 #376193

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
376193		wiwiho	Lamps (JOI19_lamps)	C++14	6 / 100	464 ms	4796 KiB

lamp

#include <bits/stdc++.h>
 
#define eb emplace_back
#define printv(a, b) { \
    for(auto pv : a) b << pv << " "; \
    b << "\n"; \
}
 
using namespace std;
 
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
 
    int n;
    string sa, sb;
    cin >> n >> sa >> sb;
    
    assert(n <= 18);

    int a = bitset<20>(sa).to_ulong(), b = bitset<20>(sb).to_ulong();

    vector<int> dis(1 << n, -1);
    queue<int> q;
    q.push(a);
    dis[a] = 0;
    
    while(!q.empty()){
        int now = q.front();
        q.pop();
        
        for(int j = 0; j < n; j++){
            int tmp = now;
            for(int k = j; k < n; k++){
                tmp ^= 1 << k;
                if(dis[tmp] == -1){
                    dis[tmp] = dis[now] + 1;
                    q.push(tmp);
                }
            }
        }

        for(int j = 0; j < n; j++){
            int tmp = now;
            for(int k = j; k < n; k++){
                tmp |= 1 << k;
                if(dis[tmp] == -1){
                    dis[tmp] = dis[now] + 1;
                    q.push(tmp);
                }
            }
        }
        
        for(int j = 0; j < n; j++){
            int tmp = now;
            for(int k = j; k < n; k++){
                if(1 << k & tmp) tmp ^= 1 << k;
                if(dis[tmp] == -1){
                    dis[tmp] = dis[now] + 1;
                    q.push(tmp);
                }
            }
        }
    }
   
    cout << dis[b] << "\n";
 
    return 0;
}

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