002:拨钟问题

#include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<map>
#include<cstdlib>
#include<cstring>
#define DEBUG(x) cout << #x << " = " << x << endl
using namespace std;
//二进制数枚举
short clocks[9];
short clocksTemp[9];
void copyClocks(short tar[],short src[]) {
    for(int i=0; i<9; i++) {
        clocksTemp[i]=clocks[i];
    }
}
bool areAllClear() {
    for(int i=0; i<9; i++) {
        if(clocksTemp[i]!=0)
            return false;
    }
    return true;
}
inline int getBit(int n,int i) {
    return (n>>i)&1;
}
char routs[9][9]= {"ABDE","ABC","BCEF"
                   ,"ADG","BDEFH","CFI"
                   ,"DEGH","GHI","EFHI"
                  };//todo
void movement(int i) {
    int N=strlen(routs[i]);
    for(int k=0; k<N; k++){
        int p=routs[i][k]-‘A‘;
        clocksTemp[p]=(clocksTemp[p]+1)%4;
    }
}
void debug(short a[],int n)
{
    for(int i=0;i<n;i++){
        printf("%d ",a[i]);
    }
    printf("\n");
}
vector<int> seq,seqt;
int main() {
    freopen("in.txt","r",stdin);
    for(int i=0; i<9; i++) {
        scanf("%d",&clocks[i]);
    }
//    printf("%d\n",(1<<9)-1);
    for(int i=0; i<(1<<9); i++) {
            //枚举操作序列，每个操作最多只有一次
        int times=0;
        seqt.clear();
        copyClocks(clocksTemp,clocks);
        for(int j=0; j<9; j++) {
                //获取操作序列
            if(getBit(i,j)) {
                movement(j);
                times++;
                seqt.push_back(j+1);
            }
        }
        if(areAllClear()){
            if(seq.size()==0)seq=seqt;
            else if(seq.size()>seqt.size()){
                seq=seqt;
            }
        }
    }
    for(int i=0;i<seq.size();i++){
        printf("%d",seq[i]);
        if(i!=seq.size()-1)printf(" ");
        else printf("\n");
    }
    return 0;
}

#include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<map>
#include<cstring>
#include<cstdlib>
#define DEBUG(x) cout << #x << " = " << x << endl
#define INF 0x3f3f3f3f
using namespace std;
int moveTimes[9]={0};
int resultTimes=INF;
int result[9];
int clocks[9],clocksTemp[9];
char routs[9][9]= {"ABDE","ABC","BCEF"
                   ,"ADG","BDEFH","CFI"
                   ,"DEGH","GHI","EFHI"
                  };//todo
void Enum(int p,int t)
{
    if(t>resultTimes)return;
    if(p>=9){
        int times=0;
        memcpy(clocksTemp,clocks,sizeof(clocksTemp));
        for(int i=0;i<9;i++){
//            times+=moveTimes[i];
            if(moveTimes[i])
            for(int j=0;routs[i][j];j++){
                clocksTemp[routs[i][j]-‘A‘]=(clocksTemp[routs[i][j]-‘A‘]
                                        +moveTimes[i])%4;
                times+=moveTimes[i];
            }
        }
        int i=0;
        for(;i<9;i++){
            if(clocksTemp[i])break;
        }
        if(i==9){
            if(resultTimes>times){
                resultTimes=times;
                memcpy(result,moveTimes,sizeof(result));
            }
        }
        return;
    }
    for(int i=0;i<4;i++){
        moveTimes[p]=i;
        Enum(p+1,t+i);
    }
    return;
}
int main()
{
//    freopen("in.txt","r",stdin);
    for(int i=0;i<9;i++){
        scanf("%d",&clocks[i]);
    }
    Enum(0,0);
    for(int i=0;i<9;i++){
        for(int j=0;j<result[i];j++){
            printf("%d ",i+1);
        }
    }
    return 0;
}