글 읽기 - 반례 부탁드립니다.. ㅜㅠㅠㅠ

jensoo7023 5년 전 0

ㅜㅜ 계속 틀렸다고 나오네요ㅠ ㅠㅠ
반례 부탁드립니다ㅠㅠ
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int board[20][20]={-1,};
int n=0;

void upup()
{
    for(int i=0; i<n; i++)
    {
        for(int j=0; j<n; j++)
        {
            if(board[i][j]==0)continue;
            int k=1;
            while(board[i-k][j]==0 && i-k>=0)
            {
                k++;
            }
            board[i-k+1][j]=board[i][j];
            if(k!=1)
                board[i][j]=0;
        }
    }

}

void together_up()
{
    for(int i=0; i<n; i++)
    {
        for(int j=0; j<n; j++)
        {
            if(i==n-1)continue;
            if(board[i][j]==board[i+1][j])
            {
                board[i][j]*=2;
                board[i+1][j]=0;
            }
        }
    }
}

void moving_up()
{
    for(int i=0; i<n; i++)
    {
        for(int j=0; j<n; j++)
        {
            if(i==0)continue;
            if(board[i-1][j]==0)
            {
                board[i-1][j]=board[i][j];
                board[i][j]=0;
            }
        }
    }

}

void leftleft()
{
    for(int j=0; j<n; j++)
    {
        for(int i=0; i<n; i++)
        {
            if(board[i][j]==0)continue;
            int k=1;
            while(board[i][j-k]==0 && j-k>=0)
            {
                k++;
            }
            board[i][j-k+1]=board[i][j];
            if(k!=1)
                board[i][j]=0;
        }
    }

}


void together_left()
{
    for(int j=0; j<n; j++)
    {
        for(int i=0; i<n; i++)
        {
            if(j==n-1)continue;
            if(board[i][j]==board[i][j+1])
            {
                board[i][j]*=2;
                board[i][j+1]=0;
            }
        }
    }

}

void moving_left()
{
    for(int j=0; j<n; j++)
    {
        for(int i=0; i<n; i++)
        {
            if(j==0)continue;
            if(board[i][j-1]==0)
            {
                board[i][j-1]=board[i][j];
                board[i][j]=0;
            }
        }
    }

}

void downdown()
{
    for(int i=n-1; i>=0; i--)
    {
        for(int j=0; j<n; j++)
        {
            if(board[i][j]==0)continue;
            int k=1;
            while(board[i+k][j]==0 && i+k<n)
            {
                k++;
            }
            board[i+k-1][j]=board[i][j];
            if(k!=1)
                board[i][j]=0;
        }
    }

}

void together_down()
{
    for(int i=n-1; i>=0; i--)
    {
        for(int j=0; j<n; j++)
        {
            if(i==0)continue;
            if(board[i][j]==board[i-1][j])
            {
                board[i][j]*=2;
                board[i-1][j]=0;
            }
        }
    }

}

void moving_down()
{
    for(int i=n-1; i>=0; i--)
    {
        for(int j=0; j<n; j++)
        {
            if(i==n-1)continue;
            if(board[i+1][j]==0)
            {
                board[i+1][j]=board[i][j];
                board[i][j]=0;
            }
        }
    }

}

void rightright()
{
    for(int j=n-1; j>=0; j--)
    {
        for(int i=0; i<n; i++)
        {
            if(board[i][j]==0)continue;
            int k=1;
            while(board[i][j+k]==0 && j+k<n)
            {
                k++;
            }
            board[i][j+k-1]=board[i][j];
            if(k!=1)
                board[i][j]=0;
        }
    }
}


void together_right()
{
    for(int j=n-1; j>=0; j--)
    {
        for(int i=0; i<n; i++)
        {
            if(j==0)continue;
            if(board[i][j]==board[i][j-1])
            {
                board[i][j]=board[i][j]*2;
                board[i][j-1]=0;
            }
        }
    }

}

void moving_right()
{
    for(int j=n-1; j>=0; j--)
    {
        for(int i=0; i<n; i++)
        {
            if(j==n-1)continue;
            if(board[i][j+1]==0)
            {
                board[i][j+1]=board[i][j];
                board[i][j]=0;
            }
        }
    }

}

int main()
{

    cin>>n;
    int save[20][20]={-1,};
    for(int i=0; i<n; i++)
    {
        for(int j=0; j<n; j++)
        {
            cin>>board[i][j];
            save[i][j]=board[i][j];
        }
    }
    int cnt=0;
    int dir=0; //1: up, 2: down 3: left 4:right

    int direct[5]={0,};
    int ans=0;


    for(int i=1; i<=4; i++)
    {
        direct[0]=i;
        for(int j=1;j<=4;j++)
        {
            direct[1]=j;
            for(int k=1; k<=4; k++)
            {
                direct[2]=k;
                for(int l=1;l<=4; l++)
                {
                    direct[3]=l;
                    for(int m=1;m<=4;m++)
                    {
                        direct[4]=m;
                        cnt++;
                        for(int i=0; i<n; i++)
                        {
                            for(int j=0; j<n; j++)
                            {
                                board[i][j]=save[i][j];
                            }
                        }

                        for(int i=0; i<5; i++)
                        {
                            dir = direct[i];
                            switch(dir)
                            {
                                case 1:
                                    upup();
                                    together_up();
                                    moving_up();
                                    break;
                                case 2:
                                    downdown();
                                    together_down();
                                    moving_down();
                                    break;
                                case 3:
                                    leftleft();
                                    together_left();
                                    moving_left();
                                    break;
                                case 4:
                                    rightright();
                                    together_right();
                                    moving_right();
                                    break;
                            }

                        }

                        for(int i=0; i<n; i++)
                        {
                            for(int j=0; j<n; j++)
                            {
                                if(board[i][j]>ans)
                                    ans=board[i][j];
                            }

                        }
                    }
                }
            }
        }
    }
    cout<<ans;
}
djm03178 5년 전 0

https://www.acmicpc.net/board/...
댓글을 작성하려면 로그인해야 합니다.
문제

문제

출처

ICPC

반례 부탁드립니다.. ㅜㅠㅠㅠ

jensoo7023 5년 전 0

djm03178 5년 전 0

Baekjoon Online Judge

채점 현황

문제

유저 대회

고등학교 대회

출처

대학교 대회

도움말
