글 읽기 - 62%에서 틀렸다고 나오는데 틀린부분이 어디일까요? ㅠ

zelot11 4년 전 0

맵 4가지 경로를 만들고 같은 위치 체크를 할때 40, 25, 30, 25, 35 인부분만 체크했는데 놓친 부분이 있을까요?

#include <iostream>
using namespace std;
int map1[100]={0};//////5,10,15
int map2[100]={0}; //5/////
int map3[100]={0};//10/////5
int map4[100]={0};//15/////5,10
#define N 4
#define R 10
int order[10];
int selected[R];
int ans=0;
void full(int depth)
{
      
//  int i;
  if( R==depth){
// cout<<"round"<<endl;
    // 모두 선택 되었음 출력하기
    ////제로 세팅 
       /////////////////
    int score=0; 
    int place[4]={0};
    selected[0]=1;
    int flag[4][3]={0};
 
    for(int i=0;i<R;i++){

    //  printf("%d ",selected[i]);
      place[selected[i]-1]+=order[i];
      int player_number = selected[i]-1;
  //  cout<< player_number+1<<" : number : "<<order[i]<<"  place : "<<   place[selected[i]-1]<<endl;
    
    //////////flag///////////////
    if ( place[player_number ]==5)  flag[player_number ][0]=1;
    if ( place[player_number ]==10) flag[player_number ][1]=1;
    if ( place[player_number ]==15) flag[player_number ][2]=1;
    ////////////중복위치 
    
  
         for( int k=0; k<4; k++)
         {
              if( player_number==k) continue;    
              if (place[k]==0) continue;
           
              
               if( flag[k][0] ==0  && flag[k][1]==0 && flag[k][2] ==0  )
               {
                   
                   if( flag[ player_number][0] ==0  && flag[ player_number][1]==0 && flag[ player_number][2] ==0  )
               {
                   if( place[k]==place[player_number]) return;
               }
               if( flag[ player_number][0] ==1  )
               {
                  
                  if( map1[place[k]-1]== map2[place[player_number]-1] && map1[place[k]-1]==40) return;
               }
                if( flag[ player_number][0] ==0  && flag[ player_number][1]==1  )
               {
                   if( map1[place[k]-1]== map3[place[player_number]-1] && map1[place[k]-1]==40) return;
                  // if( map1[place[k]-1]== map3[place[player_number]-1] && map1[place[k]-1]==20) return;
               }
               if( flag[ player_number][0] ==0  && flag[ player_number][1]==0 && flag[ player_number][2] ==1  )
               {
                   if( map1[place[k]-1]== map4[place[player_number]-1] && map1[place[k]-1]==40) return;
               }
               
                }
               
               if( flag[k][0] ==1   )
               {
                   if( flag[ player_number][0] ==0  && flag[ player_number][1]==0 && flag[ player_number][2] ==0  )
               {
                    if( map2[place[k]-1]== map1[place[player_number]-1] && map2[place[k]-1]==40) return;
               }
                   
                   if( flag[ player_number][0] ==1  )
               {
                   if( place[k]==place[player_number]) return;
               }
                if( flag[ player_number][0] ==0  && flag[ player_number][1]==1   )
               {
                   if( map2[place[k]-1]== map3[place[player_number]-1] && map2[place[k]-1]==25) return;
                   if( map2[place[k]-1]== map3[place[player_number]-1] && map2[place[k]-1]==30) 
                   {
                      if( map2[place[k]]== map3[place[player_number]] ) return;
                   }
                   if( map2[place[k]-1]== map3[place[player_number]-1] && map2[place[k]-1]==35) return;
                   if( map2[place[k]-1]== map3[place[player_number]-1] && map2[place[k]-1]==40) return;
               }
               if( flag[ player_number][0] ==0  && flag[ player_number][1]==0 && flag[ player_number][2] ==1  )
               {
                   if( map2[place[k]-1]== map4[place[player_number]-1] && map2[place[k]-1]==25) return;
                   if( map2[place[k]-1]== map4[place[player_number]-1] && map2[place[k]-1]==30) 
                   {
                       if(map2[place[k]]== map4[place[player_number]]) return;
                   }
                   if( map2[place[k]-1]== map4[place[player_number]-1] && map2[place[k]-1]==35) return;
                   if( map2[place[k]-1]== map4[place[player_number]-1] && map2[place[k]-1]==40) return;
               }
               
               
               
               }
               
               if( flag[k][0] ==0  && flag[k][1]==1 && flag[k ][2] ==0   )
               {
                if( flag[ player_number][0] ==0  && flag[ player_number][1]==0 && flag[ player_number][2] ==0  )
               {
                 if( map3[place[k]-1]== map1[place[player_number]-1] && map3[place[k]-1]==40) return;
               }
               if( flag[ player_number][0] ==1  )
               {
                  
                   if( map3[place[k]-1]== map2[place[player_number]-1] && map3[place[k]-1]==25) return;
                   if( map3[place[k]-1]== map2[place[player_number]-1] && map3[place[k]-1]==30) 
                   {
                      if( map3[place[k]]== map2[place[player_number]])   return;
                   }
                   if( map3[place[k]-1]== map2[place[player_number]-1] && map3[place[k]-1]==35) return;
                   if( map3[place[k]-1]== map2[place[player_number]-1] && map3[place[k]-1]==40) return;
               }
                  if( flag[ player_number][0] ==0  && flag[ player_number][1]==1  )
               {
                   if( place[k]==place[player_number]) return;
               }
               if( flag[ player_number][0] ==0  && flag[ player_number][1]==0 && flag[ player_number][2] ==1  )
               {
                   if( map3[place[k]-1]== map4[place[player_number]-1] && map3[place[k]-1]==25) return;
                   if( map3[place[k]-1]== map4[place[player_number]-1] && map3[place[k]-1]==30)
                   {
                if(  map3[place[k]]== map4[place[player_number]]) return;
                   }
                   
                   if( map3[place[k]-1]== map4[place[player_number]-1] && map3[place[k]-1]==35) return;
                   if( map3[place[k]-1]== map4[place[player_number]-1] && map3[place[k]-1]==40) return;
               }    
                   
                   
               
               
               
               }
               
                if( flag[k ][0] ==0  && flag[k ][1]==0 && flag[k ][2] ==1   )
                {
                    
                      if( flag[ player_number][0] ==0  && flag[ player_number][1]==0 && flag[ player_number][2] ==0  )
               {
                 if( map4[place[k]-1]== map1[place[player_number]-1] && map4[place[k]-1]==40) return;
               }
               if( flag[ player_number][0] ==1  )
               {
                  
                   if( map4[place[k]-1]== map2[place[player_number]-1] && map4[place[k]-1]==25) return;
                   
                   if( map4[place[k]-1]== map2[place[player_number]-1] && map4[place[k]-1]==30) 
                   {
                   if(map4[place[k]]== map2[place[player_number]] ) return;
                   } 
                   if( map4[place[k]-1]== map2[place[player_number]-1] && map4[place[k]-1]==35) return;
                   if( map4[place[k]-1]== map2[place[player_number]-1] && map4[place[k]-1]==40) return;
               }
                  if( flag[ player_number][0] ==0  && flag[ player_number][1]==1   )
               {
                    if( map4[place[k]-1]== map3[place[player_number]-1]&& map4[place[k]-1]==25) return;
                   if( map4[place[k]-1]== map3[place[player_number]-1] && map4[place[k]-1]==30) 
                   {
                   if(map4[place[k]]== map3[place[player_number]]) return;
                   }
                   if( map4[place[k]-1]== map3[place[player_number]-1] && map4[place[k]-1]==35) return;
                   if( map4[place[k]-1]== map3[place[player_number]-1] && map4[place[k]-1]==40) return;
               }
             
                    if( flag[ player_number][0] ==0  && flag[ player_number][1]==0 && flag[ player_number][2] ==1  )
               {
                   if( place[k]==place[player_number]) return;
               }
               
               
                }
        
         }
    

      /////////////////////////
      
    if( flag[player_number ][0] ==0  && flag[player_number ][1]==0 && flag[player_number ][2] ==0  )
    {
            // if( place[player_number]>20 ) continue;
              score+=map1[place[player_number]-1];
  // cout<< "1 : "<<player_number+1<<"  position "<< place[player_number]<<" value  " << map1[place[player_number]-1]<<endl;
    }

    if( flag[player_number ][0] ==1 )
    {
        // if( place[player_number]>12 ) continue;
          score+=map2[place[player_number]-1];
       
//      cout<< "2 : "<<player_number+1<<"  position "<< place[player_number]<<" value  " << map2[place[player_number]-1]<<endl;
    }
    if( flag[player_number ][0] ==0  && flag[player_number ][1]==1  )
    {
       //      if( place[player_number]>16 ) continue;
          score+=map3[place[player_number]-1];
  //  cout<< "3 : "<<player_number+1<<"  position "<< place[player_number]<<" value  " << map3[place[player_number]-1]<<endl;
    }

    if( flag[player_number ][0] ==0  && flag[player_number ][1]==0 && flag[player_number ][2] ==1   )
    {
      ///   if( place[player_number]>22 ) continue;
         score+=map4[place[player_number]-1];
 //   cout<< "4 : "<<player_number+1<<"  position "<< place[player_number]<<" value  " <<map4[place[player_number]-1]<<endl;
    }
 //cout<<"hi"<<endl;
    }
   /*
        if(score>ans )
        {
            for(int k=0; k<10; k++)
            {
                cout<<selected[k]<<" ";
            }
            cout<<endl;
        }
       */
    ans=max(ans,score);
   
// cout<<score<<endl;
    return;
  }

  for(int i=1;i<=N;i++){
    selected[depth]=i;
    full(depth+1);
  }
}
int main()
{
    for( int x=0; x<10; x++)
    {
        cin>> order[x];
      // cout<< order[x];
    }
    for( int k=1; k<21; k++)
    {
    map1[k-1]=2*k;
    }
    map2[0]=2;
    map2[1]=4;
    map2[2]=6;
    map2[3]=8;
    map2[4]=10;
    map2[5]=13;
    map2[6]=16;
    map2[7]=19;
    map2[8]=25;
    map2[9]=30;
    map2[10]=35;
    map2[11]=40;

     for( int k=1; k<13; k++)
    {
    map3[k-1]=2*k;
    }
    map3[12]=25;
    map3[13]=30;
    map3[14]=35;
    map3[15]=40;
     for( int k=1; k<16; k++)
    {
    map4[k-1]=2*k;
    }

    map4[15]=28;
    map4[16]=27;
    map4[17]=26;
    map4[18]=25;
    map4[19]=30;
    map4[20]=35;
    map4[21]=40;    
    
    full(1);

  //  cout<<"Hello World";

cout<<ans;

    return 0;

}

zelot11 4년 전 0

해결했습니다

#include <iostream>
using namespace std;
int map1[100]={0};//////5,10,15
int map2[100]={0}; //5/////
int map3[100]={0};//10/////5
int map4[100]={0};//15/////5,10
#define N 4
#define R 10
int order[10];
int selected[10];
int ans=0;
void full(int depth)
{
      
//  int i;
  if( R==depth){
// cout<<"round"<<endl;
    // 모두 선택 되었음 출력하기
    ////제로 세팅 
       /////////////////
    int score=0; 
    int place[4]={0};
    selected[0]=1;
    int flag[4][3]={0};
 
    for(int i=0;i<R;i++){

    //  printf("%d ",selected[i]);
      place[selected[i]-1]+=order[i];
      int player_number = selected[i]-1;
  //  cout<< player_number+1<<" : number : "<<order[i]<<"  place : "<<   place[selected[i]-1]<<endl;
    
    //////////flag///////////////
    if ( place[player_number ]==5)  flag[player_number ][0]=1;
    if ( place[player_number ]==10) flag[player_number ][1]=1;
    if ( place[player_number ]==15) flag[player_number ][2]=1;
    ////////////중복위치 
    
  
         for( int k=0; k<4; k++)
         {
              if( player_number==k) continue;    
              if (place[k]==0) continue;
           
              
               if( flag[k][0] ==0  && flag[k][1]==0 && flag[k][2] ==0  )
               {
                   
                   if( flag[ player_number][0] ==0  && flag[ player_number][1]==0 && flag[ player_number][2] ==0  )
               {
                   if( place[k]==place[player_number]) return;
               }
               
               if( flag[ player_number][0] ==1  )
               {
                  
                  if( map1[place[k]-1]== map2[place[player_number]-1] && map1[place[k]-1]==40) return;
               }
                if( flag[ player_number][0] ==0  && flag[ player_number][1]==1  )
               {
                   if( map1[place[k]-1]== map3[place[player_number]-1] && map1[place[k]-1]==40) return;
                  // if( map1[place[k]-1]== map3[place[player_number]-1] && map1[place[k]-1]==20) return;
               }
               if( flag[ player_number][0] ==0  && flag[ player_number][1]==0 && flag[ player_number][2] ==1  )
               {
                   if( map1[place[k]-1]== map4[place[player_number]-1] && map1[place[k]-1]==40) return;
               }
               
               }
               
               if( flag[k][0] ==1   )
               {
                   if( flag[ player_number][0] ==0  && flag[ player_number][1]==0 && flag[ player_number][2] ==0  )
               {
                    if( map2[place[k]-1]== map1[place[player_number]-1] && map2[place[k]-1]==40) return;
               }
                   
                   if( flag[ player_number][0] ==1  )
               {
                   if( place[k]==place[player_number]) return;
               }
                if( flag[ player_number][0] ==0  && flag[ player_number][1]==1   )
               {
                   if( map2[place[k]-1]== map3[place[player_number]-1] && map2[place[k]-1]==25) return;
                   if( map2[place[k]-1]== map3[place[player_number]-1] && map2[place[k]-1]==30) 
                   {
                      if( map2[place[k]]== map3[place[player_number]]&& map3[place[player_number]]==35 ) return;
                   }
                   if( map2[place[k]-1]== map3[place[player_number]-1] && map2[place[k]-1]==35) return;
                   if( map2[place[k]-1]== map3[place[player_number]-1] && map2[place[k]-1]==40) return;
               }
               if( flag[ player_number][0] ==0  && flag[ player_number][1]==0 && flag[ player_number][2] ==1  )
               {
                   if( map2[place[k]-1]== map4[place[player_number]-1] && map2[place[k]-1]==25) return;
                   if( map2[place[k]-1]== map4[place[player_number]-1] && map2[place[k]-1]==30) 
                   {
                       if(map2[place[k]]== map4[place[player_number]]&& map4[place[player_number]]==35) return;
                   }
                   if( map2[place[k]-1]== map4[place[player_number]-1] && map2[place[k]-1]==35) return;
                   if( map2[place[k]-1]== map4[place[player_number]-1] && map2[place[k]-1]==40) return;
               }
               
               
               
               }
               
               if( flag[k][0] ==0  && flag[k][1]==1  )
               {
                if( flag[ player_number][0] ==0  && flag[ player_number][1]==0 && flag[ player_number][2] ==0  )
               {
                 if( map3[place[k]-1]== map1[place[player_number]-1] && map3[place[k]-1]==40) return;
               }
               if( flag[ player_number][0] ==1  )
               {
                  
                   if( map3[place[k]-1]== map2[place[player_number]-1] && map3[place[k]-1]==25) return;
                   if( map3[place[k]-1]== map2[place[player_number]-1] && map3[place[k]-1]==30) 
                   {
                      if( map3[place[k]]== map2[place[player_number]]&& map2[place[player_number]]==35 )   return;
                   }
                   if( map3[place[k]-1]== map2[place[player_number]-1] && map3[place[k]-1]==35) return;
                   if( map3[place[k]-1]== map2[place[player_number]-1] && map3[place[k]-1]==40) return;
               }
                  if( flag[ player_number][0] ==0  && flag[ player_number][1]==1  )
               {
                   if( place[k]==place[player_number]) return;
               }
               if( flag[ player_number][0] ==0  && flag[ player_number][1]==0 && flag[ player_number][2] ==1  )
               {
                   if( map3[place[k]-1]== map4[place[player_number]-1] && map3[place[k]-1]==25) return;
                   if( map3[place[k]-1]== map4[place[player_number]-1] && map3[place[k]-1]==30)
                   {
                if(  map3[place[k]]== map4[place[player_number]]&& map4[place[player_number]]==35 ) return;
                   }
                   
                   if( map3[place[k]-1]== map4[place[player_number]-1] && map3[place[k]-1]==35) return;
                   if( map3[place[k]-1]== map4[place[player_number]-1] && map3[place[k]-1]==40) return;
               }    
                   
                   
               
               
               
               }
               
                if( flag[k ][0] ==0  && flag[k ][1]==0 && flag[k ][2] ==1   )
                {
                    
                      if( flag[ player_number][0] ==0  && flag[ player_number][1]==0 && flag[ player_number][2] ==0  )
               {
                 if( map4[place[k]-1]== map1[place[player_number]-1] && map4[place[k]-1]==40) return;
               }
               if( flag[ player_number][0] ==1  )
               {
                  
                   if( map4[place[k]-1]== map2[place[player_number]-1] && map4[place[k]-1]==25) return;
                   
                   if( map4[place[k]-1]== map2[place[player_number]-1] && map4[place[k]-1]==30) 
                   {
                   if(map4[place[k]]== map2[place[player_number]]&& map2[place[player_number]] ==35 ) return;
                   } 
                   if( map4[place[k]-1]== map2[place[player_number]-1] && map4[place[k]-1]==35) return;
                   if( map4[place[k]-1]== map2[place[player_number]-1] && map4[place[k]-1]==40) return;
               }
                  if( flag[ player_number][0] ==0  && flag[ player_number][1]==1   )
               {
                    if( map4[place[k]-1]== map3[place[player_number]-1]&& map4[place[k]-1]==25) return;
                   if( map4[place[k]-1]== map3[place[player_number]-1] && map4[place[k]-1]==30) 
                   {
                   if(map4[place[k]]== map3[place[player_number]]&&map3[place[player_number]]==35 ) return;
                   }
                   if( map4[place[k]-1]== map3[place[player_number]-1] && map4[place[k]-1]==35) return;
                   if( map4[place[k]-1]== map3[place[player_number]-1] && map4[place[k]-1]==40) return;
               }
             
                    if( flag[ player_number][0] ==0  && flag[ player_number][1]==0 && flag[ player_number][2] ==1  )
               {
                   if( place[k]==place[player_number]) return;
               }
               
               
                }
        
         }
    

      /////////////////////////
      
    if( flag[player_number ][0] ==0  && flag[player_number ][1]==0 && flag[player_number ][2] ==0  )
    {
            // if( place[player_number]>20 ) continue;
              score+=map1[place[player_number]-1];
  // cout<< "1 : "<<player_number+1<<"  position "<< place[player_number]<<" value  " << map1[place[player_number]-1]<<endl;
    }

    if( flag[player_number ][0] ==1 )
    {
        // if( place[player_number]>12 ) continue;
          score+=map2[place[player_number]-1];
       
//      cout<< "2 : "<<player_number+1<<"  position "<< place[player_number]<<" value  " << map2[place[player_number]-1]<<endl;
    }
    if( flag[player_number ][0] ==0  && flag[player_number ][1]==1  )
    {
       //      if( place[player_number]>16 ) continue;
          score+=map3[place[player_number]-1];
  //  cout<< "3 : "<<player_number+1<<"  position "<< place[player_number]<<" value  " << map3[place[player_number]-1]<<endl;
    }

    if( flag[player_number ][0] ==0  && flag[player_number ][1]==0 && flag[player_number ][2] ==1   )
    {
      ///   if( place[player_number]>22 ) continue;
         score+=map4[place[player_number]-1];
 //   cout<< "4 : "<<player_number+1<<"  position "<< place[player_number]<<" value  " <<map4[place[player_number]-1]<<endl;
    }
 //cout<<"hi"<<endl;
    }
 /*
        if(score>ans )
        {
            for(int k=0; k<10; k++)
            {
                cout<<selected[k]<<" ";
            }
            cout<<endl;
        }
       */
    ans=max(ans,score);
   
// cout<<score<<endl;
    return;
  }

  for(int i=1;i<=N;i++){
    selected[depth]=i;
    full(depth+1);
  }
}
int main()
{
    for( int x=0; x<10; x++)
    {
        cin>> order[x];
      // cout<< order[x];
    }
    for( int k=1; k<21; k++)
    {
    map1[k-1]=2*k;
    }
    map2[0]=2;
    map2[1]=4;
    map2[2]=6;
    map2[3]=8;
    map2[4]=10;
    map2[5]=13;
    map2[6]=16;
    map2[7]=19;
    map2[8]=25;
    map2[9]=30;
    map2[10]=35;
    map2[11]=40;

     for( int k=1; k<13; k++)
    {
    map3[k-1]=2*k;
    }
    map3[12]=25;
    map3[13]=30;
    map3[14]=35;
    map3[15]=40;
     for( int k=1; k<16; k++)
    {
    map4[k-1]=2*k;
    }

    map4[15]=28;
    map4[16]=27;
    map4[17]=26;
    map4[18]=25;
    map4[19]=30;
    map4[20]=35;
    map4[21]=40;    
    
    full(1);

  //  cout<<"Hello World";

cout<<ans;

    return 0;

}

댓글을 작성하려면 로그인해야 합니다.

문제

문제

출처

ICPC

62%에서 틀렸다고 나오는데 틀린부분이 어디일까요? ㅠ

zelot11 4년 전 0

zelot11 4년 전 0

Baekjoon Online Judge

채점 현황

문제

유저 대회

고등학교 대회

출처

대학교 대회

도움말