Confronta il testo

Trova la differenza tra due file di testo

Editor live

Comprimi invariate

Senza a capo

Layout

Livello di dettaglio

Evidenziazione sintassi

Diffchecker Desktop Il modo più sicuro per usare Diffchecker. Ottieni l'app Diffchecker Desktop: i tuoi diff non lasciano mai il tuo computer!Ottieni Desktop

Untitled diff

Creato 9 anni faIl diff non scade mai

4 rimozioni

Linee
Totale
Rimosso

Caratteri
Totale
Rimosso

Per continuare a utilizzare questa funzione, aggiorna a Diffchecker Pro Visualizza prezzi

102 linee

6 aggiunte

Linee
Totale
Aggiunto

Caratteri
Totale
Aggiunto

Per continuare a utilizzare questa funzione, aggiorna a Diffchecker Pro Visualizza prezzi

105 linee

#include <cstdio>

#include <cstring>

#include <algorithm>

#define CLEAR(x) memset((x),0,sizeof(x))

using namespace std;

struct Step{

int x,y;

int x,y,d;

int d;

} T[1010];

int N,SCnt,GameMap[6][8],GameMapBkup[10][6][8],cr[6][8],cc[6][8];

bool del[6][8];

inline bool isValid(int x,int y) { return x>=0 && x<=4 && y>=0 && y<=6; }

inline bool drag(int x,int y,int d) {

if(!isValid(x+d,y) || GameMap[x][y] == GameMap[x+d][y] || GameMap[x][y]==0)

return false;

else {

swap(GameMap[x][y],GameMap[x+d][y]);

T[++SCnt] = (Step) {x,y,d};

}

return true;

}

inline bool Click() {

bool ret=false;

CLEAR(del);CLEAR(cr);CLEAR(cc);

for(int i=4;i>=0;i--)

for(int j=6;j>=0;j--) {

if(GameMap[i][j] == GameMap[i][j+1] && GameMap[i][j])

if(!GameMap[i][j]) continue;

if(GameMap[i][j] == GameMap[i][j+1])

cc[i][j]=cc[i][j+1]+1;

else cc[i][j]=1;

if(GameMap[i][j] == GameMap[i+1][j] && GameMap[i][j])

if(GameMap[i][j] == GameMap[i+1][j])

cr[i][j]=cr[i+1][j]+1;

else cr[i][j]=1;

}

for(int i=0;i<=4;i++)

for(int j=0;j<=6;j++) {

if(cc[i][j]>=3) {

del[i][j]=true;

while(cc[i][j]>1) del[i][j+1]=true,j++;

}

for(int j=0;j<=6;j++)

for(int i=0;i<=4;i++){

if(cr[i][j]>=3) {

del[i][j]=true;

while(cr[i][j]>1) del[i+1][j]=true,i++;

}

for(int i=0;i<=4;i++)

for(int j=0;j<=6;j++)

if(del[i][j]) {

GameMap[i][j]=0;ret=true;

}

return ret;

}

inline void Fall() {

for(int i=0;i<=4;i++)

for(int j=0;j<=6;j++) {

for(int tj=j;tj!=0 && GameMap[i][tj-1]==0;tj--)

swap(GameMap[i][tj-1],GameMap[i][tj]);

}

inline bool Succeed() {

for(int i=0;i<=4;i++)

for(int j=0;j<=6;j++)

if(GameMap[i][j]) return false;

return true;

}

inline void PrintAns() {

for(int i=1;i<=SCnt;i++) printf("%d %d %d\n",T[i].x,T[i].y,T[i].d);

exit(0);

}

inline void dfs(int cur) {

if(Succeed()) PrintAns();

if(cur>N) return;

memcpy(GameMapBkup[cur],GameMap,sizeof(GameMap));

for(int i=0;i<=4;i++)

for(int j=0;j<=6;j++) {

//Right

if(drag(i,j,1)) {

Fall();

while(Click()) Fall();

dfs(cur+1);

SCnt--;

memcpy(GameMap,GameMapBkup[cur],sizeof(GameMap));

}

//Left

if(drag(i,j,-1)) {

Fall();

while(Click()) Fall();

dfs(cur+1);

SCnt--;

memcpy(GameMap,GameMapBkup[cur],sizeof(GameMap));

}

int main() {

scanf("%d",&N);

for(int i=0;i<=4;i++) {

int j=0,t=0;

while(scanf("%d",&t) && t) GameMap[i][j++]=t;

}

dfs(1);

printf("-1");

}

Diff salvati

Testo originale

Apri file

#include <cstdio>
#include <cstring> 
#include <algorithm>
#define CLEAR(x) memset((x),0,sizeof(x))
using namespace std;
struct Step{
    int x,y;
    int d;
} T[1010];

int N,SCnt,GameMap[6][8],GameMapBkup[10][6][8],cr[6][8],cc[6][8];
bool del[6][8];
inline bool isValid(int x,int y) { return x>=0 && x<=4 && y>=0 && y<=6; }
inline bool drag(int x,int y,int d) {
    if(!isValid(x+d,y) || GameMap[x][y] == GameMap[x+d][y] || GameMap[x][y]==0)
        return false;
    else {
        swap(GameMap[x][y],GameMap[x+d][y]);
        T[++SCnt] = (Step) {x,y,d};
    }
    return true;
}
inline bool Click() {
    bool ret=false;
    CLEAR(del);CLEAR(cr);CLEAR(cc);
    for(int i=4;i>=0;i--)
        for(int j=6;j>=0;j--) {
            if(GameMap[i][j] == GameMap[i][j+1] && GameMap[i][j])
                cc[i][j]=cc[i][j+1]+1;
            else cc[i][j]=1;
            if(GameMap[i][j] == GameMap[i+1][j] && GameMap[i][j])
                cr[i][j]=cr[i+1][j]+1;
            else cr[i][j]=1;
        }
    for(int i=0;i<=4;i++)
        for(int j=0;j<=6;j++) {
            if(cc[i][j]>=3) {
                del[i][j]=true;
                while(cc[i][j]>1) del[i][j+1]=true,j++;
            }
        }
    for(int j=0;j<=6;j++)
        for(int i=0;i<=4;i++){
            if(cr[i][j]>=3) {
                del[i][j]=true;
                while(cr[i][j]>1) del[i+1][j]=true,i++;
            }
        }
    for(int i=0;i<=4;i++)
        for(int j=0;j<=6;j++)
            if(del[i][j]) {
                GameMap[i][j]=0;ret=true;
            }
    return ret;
}
inline void Fall() {
    for(int i=0;i<=4;i++)
        for(int j=0;j<=6;j++) {
            for(int tj=j;tj!=0 && GameMap[i][tj-1]==0;tj--)
                swap(GameMap[i][tj-1],GameMap[i][tj]);
        }
}
inline bool Succeed() {
    for(int i=0;i<=4;i++)
        for(int j=0;j<=6;j++)
            if(GameMap[i][j]) return false;
    return true;
}
inline void PrintAns() {
    for(int i=1;i<=SCnt;i++) printf("%d %d %d\n",T[i].x,T[i].y,T[i].d);
    exit(0);
}
inline void dfs(int cur) {
    if(Succeed()) PrintAns();
    if(cur>N) return;
    memcpy(GameMapBkup[cur],GameMap,sizeof(GameMap));
    for(int i=0;i<=4;i++)
        for(int j=0;j<=6;j++) {
            //Right
            if(drag(i,j,1)) {
                while(Click()) Fall();
                dfs(cur+1);
                SCnt--;
                memcpy(GameMap,GameMapBkup[cur],sizeof(GameMap));
            }
            if(drag(i,j,-1)) {
                while(Click()) Fall();
                dfs(cur+1);
                SCnt--;
                memcpy(GameMap,GameMapBkup[cur],sizeof(GameMap));
            }
        }
}
int main() {
    scanf("%d",&N);
    for(int i=0;i<=4;i++) {
        int j=0,t=0;
        while(scanf("%d",&t) && t) GameMap[i][j++]=t;
    }
    dfs(1);
    printf("-1");
}

Testo modificato

Apri file

#include <cstdio>
#include <cstring> 
#include <algorithm>
#define CLEAR(x) memset((x),0,sizeof(x))
using namespace std;
struct Step{
    int x,y,d;
} T[1010];

int N,SCnt,GameMap[6][8],GameMapBkup[10][6][8],cr[6][8],cc[6][8];
bool del[6][8];
inline bool isValid(int x,int y) { return x>=0 && x<=4 && y>=0 && y<=6; }
inline bool drag(int x,int y,int d) {
    if(!isValid(x+d,y) || GameMap[x][y] == GameMap[x+d][y] || GameMap[x][y]==0)
        return false;
    else {
        swap(GameMap[x][y],GameMap[x+d][y]);
        T[++SCnt] = (Step) {x,y,d};
    }
    return true;
}
inline bool Click() {
    bool ret=false;
    CLEAR(del);CLEAR(cr);CLEAR(cc);
    for(int i=4;i>=0;i--)
        for(int j=6;j>=0;j--) {
            if(!GameMap[i][j]) continue;
            if(GameMap[i][j] == GameMap[i][j+1])
                cc[i][j]=cc[i][j+1]+1;
            else cc[i][j]=1;
            if(GameMap[i][j] == GameMap[i+1][j])
                cr[i][j]=cr[i+1][j]+1;
            else cr[i][j]=1;
        }
    for(int i=0;i<=4;i++)
        for(int j=0;j<=6;j++) {
            if(cc[i][j]>=3) {
                del[i][j]=true;
                while(cc[i][j]>1) del[i][j+1]=true,j++;
            }
        }
    for(int j=0;j<=6;j++)
        for(int i=0;i<=4;i++){
            if(cr[i][j]>=3) {
                del[i][j]=true;
                while(cr[i][j]>1) del[i+1][j]=true,i++;
            }
        }
    for(int i=0;i<=4;i++)
        for(int j=0;j<=6;j++)
            if(del[i][j]) {
                GameMap[i][j]=0;ret=true;
            }
    return ret;
}
inline void Fall() {
    for(int i=0;i<=4;i++)
        for(int j=0;j<=6;j++) {
            for(int tj=j;tj!=0 && GameMap[i][tj-1]==0;tj--)
                swap(GameMap[i][tj-1],GameMap[i][tj]);
        }
}
inline bool Succeed() {
    for(int i=0;i<=4;i++)
        for(int j=0;j<=6;j++)
            if(GameMap[i][j]) return false;
    return true;
}
inline void PrintAns() {
    for(int i=1;i<=SCnt;i++) printf("%d %d %d\n",T[i].x,T[i].y,T[i].d);
    exit(0);
}
inline void dfs(int cur) {
    if(Succeed()) PrintAns();
    if(cur>N) return;
    memcpy(GameMapBkup[cur],GameMap,sizeof(GameMap));
    for(int i=0;i<=4;i++)
        for(int j=0;j<=6;j++) {
            //Right
            if(drag(i,j,1)) {
                Fall();
                while(Click()) Fall();
                dfs(cur+1);
                SCnt--;
                memcpy(GameMap,GameMapBkup[cur],sizeof(GameMap));
            }
            //Left
            if(drag(i,j,-1)) {
                Fall();
                while(Click()) Fall();
                dfs(cur+1);
                SCnt--;
                memcpy(GameMap,GameMapBkup[cur],sizeof(GameMap));
            }
        }
}
int main() {
    scanf("%d",&N);
    for(int i=0;i<=4;i++) {
        int j=0,t=0;
        while(scanf("%d",&t) && t) GameMap[i][j++]=t;
    }
    dfs(1);
    printf("-1");
}