Solution | CodeChef

Average:

Your rating: None

CodeChef submission 149892 (C++ 4.0.0-8)

CodeChef submission 149892 (C++ 4.0.0-8) plaintext list. Status: WA, problem K3, contest DEC09. By aashish_iitm (aashish_iitm), 2009-12-11 13:15:20.
#include<iostream>
using namespace std;
int main()
{
    int test_cases,test_case=0;
    cin>>test_cases;
    while(test_case<test_cases)
    {
         int M,N;
         cin>>M>>N;
         int array[101][101];
         int start_x,start_y;
             for(int i=0;i<=M;i++)
             for(int j=0;j<=N;j++)
             {
                     char c;
                     cin>>c;
                     if(c=='0')
                     array[i][j]=0;
                     else if(c=='1')
                     array[i][j]=1;
                     else if(c=='2')
                     array[i][j]=2;
                     else if(c=='3')
                     array[i][j]=3;
                     else if(c=='4')
                     array[i][j]=4;
                     else if(c=='5')
                     array[i][j]=5;
                     else if(c=='6')
                     array[i][j]=6;
                     else if(c=='7')
                     array[i][j]=7;
                     else if(c=='8')
                     array[i][j]=8;
                     else if(c=='9')
                     array[i][j]=9;
                     else if(c=='.')
                     array[i][j]=10;
                     else if(c=='#')
                     array[i][j]=11;
                     else if(c=='*')
                     array[i][j]=12;
                     
                     if(array[i][j] == 12)
                     {start_x=i;start_y=j;}
             }                   
         
         //now lets create a array of positions
         int array1[11000][3];
         int array2[11000][3];
         int step_r[101][101];
         for(int i=0;i<101;i++)
         for(int t=0;t<101;t++)
         step_r[i][t]=-1;
         array1[0][0]=start_x;
         array1[0][1] = start_y;
         array1[0][2] = 0;
         int fill = 1;
         int sum1=0,final;
         cin>>final;
         int steps=0;
         if(final==0)
         cout<<0<<endl;
         else
         {
             while(sum1!=final&&steps<100)
             {
              
              int  fill1=0;
           /*   for(int i=0;i<fill;i++)
              {
         //             cout<<array1[i][0]<<"   "<<array1[i][1]<<"  "<<array1[i][2]<<endl;
          //            cout<<steps<<endl;
          //            cin>>fill1;
              }*/
              for(int i=0;i<fill;i++)
              {
                      int u1,u2;
                      
                      u1=1;u2=0;
                      
                      if(array1[i][0]+u1<=M&&array1[i][1]+u2<=N&&array1[i][0]+u1>=0&&array1[i][1]+u2>=0)
                      if(array[array1[i][0]+u1][array1[i][1]+u2]!=11)
                      {
                       {
                        array2[fill1][0] =  array1[i][0]+u1;
                        array2[fill1][1] =  array1[i][1]+u2;
                        if(array[array1[i][0]+u1][array1[i][1]+u2]<=9&&array[array1[i][0]+u1][array1[i][1]+u2]>=0)
                       array2[fill1][2] =  array1[i][2]+array[array1[i][0]+u1][array1[i][1]+u2];
                       else
                       array2[fill1][2] =  array1[i][2];
                       fill1++; }     }  
                      
                                u1=0;u2=1;                      
                       if(array1[i][0]+u1<=M&&array1[i][1]+u2<=N&&array1[i][0]+u1>=0&&array1[i][1]+u2>=0)
                      if(array[array1[i][0]+u1][array1[i][1]+u2]!=11)
                      {
                       {
                        array2[fill1][0] =  array1[i][0]+u1;
                        array2[fill1][1] =  array1[i][1]+u2;
                        if(array[array1[i][0]+u1][array1[i][1]+u2]<=9&&array[array1[i][0]+u1][array1[i][1]+u2]>=0)
                       array2[fill1][2] =  array1[i][2]+array[array1[i][0]+u1][array1[i][1]+u2];
                       else
                       array2[fill1][2] =  array1[i][2];
                       fill1++; }     }  
                       
                       
                        u1=-1;u2=0;
                        if(array1[i][0]+u1<=M&&array1[i][1]+u2<=N&&array1[i][0]+u1>=0&&array1[i][1]+u2>=0)
                      if(array[array1[i][0]+u1][array1[i][1]+u2]!=11)
                      {
                       {
                        array2[fill1][0] =  array1[i][0]+u1;
                        array2[fill1][1] =  array1[i][1]+u2;
                        if(array[array1[i][0]+u1][array1[i][1]+u2]<=9&&array[array1[i][0]+u1][array1[i][1]+u2]>=0)
                       array2[fill1][2] =  array1[i][2]+array[array1[i][0]+u1][array1[i][1]+u2];
                       else
                       array2[fill1][2] =  array1[i][2];
                       fill1++; }     }  
                       
                       
                        u1=0;u2=-1;
                        if(array1[i][0]+u1<=M&&array1[i][1]+u2<=N&&array1[i][0]+u1>=0&&array1[i][1]+u2>=0)
                      if(array[array1[i][0]+u1][array1[i][1]+u2]!=11)
                      {
                       {
                        array2[fill1][0] =  array1[i][0]+u1;
                        array2[fill1][1] =  array1[i][1]+u2;
                        if(array[array1[i][0]+u1][array1[i][1]+u2]<=9&&array[array1[i][0]+u1][array1[i][1]+u2]>=0)
                       array2[fill1][2] =  array1[i][2]+array[array1[i][0]+u1][array1[i][1]+u2];
                       else
                       array2[fill1][2] =  array1[i][2];
                       fill1++; }     }  
                      
                      
                      
                      
                      
                      
                                                           
              }              
              int yup=0;
              
            /*   for(int i=0;i<fill1;i++)
              {
                      cout<<"aLL "<<array2[i][0]<<"   "<<array2[i][1]<<"  "<<array2[i][2]<<endl;
              cout<<steps<<endl;
                     cin>>yup;
              }
              */
             /* for(int i=0;i<4;i++)
              {for(int k=0;k<4;k++)
              cout<<step_r[i][k]<<"  "; 
              cout<<endl;}
              */
                yup=0;
                int crap;
             //   cin>>crap;
               for(int i=0;i<fill1;i++){
              //                   cout<<"aLL "<<array2[i][0]<<"   "<<array2[i][1]<<"  "<<array2[i][2]<<"      "<<step_r[array2[i][0]][array2[i][1]]<<endl;
                //                 cin>>crap;            
              if(step_r[array2[i][0]][array2[i][1]]==-1){
                                                       //            cout<<"pass "<<array2[i][0]<<"   "<<array2[i][1]<<"  "<<array2[i][2]<<endl;
                                                         //          cin>>crap;
              array1[yup][0]=array2[i][0];
              array1[yup][1]=array2[i][1];
              array1[yup][2]=array2[i][2];
              step_r[array2[i][0]][array2[i][1]] = array2[i][2];yup++;}
            else if(step_r[array2[i][0]][array2[i][1]]<array2[i][2]){
              array1[yup][0]=array2[i][0];
              array1[yup][1]=array2[i][1];
              array1[yup][2]=array2[i][2];
              step_r[array2[i][0]][array2[i][1]] = array2[i][2];yup++;}
          /* else if(step_r[array2[i][0]][array2[i][1]]>array2[i][2]){
              array1[i][0]=array2[i][0];
              array1[i][1]=array2[i][1];
              array1[i][2]=array2[i][2];
              step_r[array2[i][0]][array2[i][1]] = array2[i][2];yup++;}
              */
          //   cout<<steps<<"asdgdasdg"<<endl;
         //     cout<<array2[i][0]<<"   "<<array2[i][1]<<"   "<<array2[i][2]<<endl;
          //   cin>>yup;
              }
              fill=yup;
               
              /* for(int i=0;i<fill;i++)
              {
                      cout<<"saved "<<array1[i][0]<<"   "<<array1[i][1]<<"  "<<array1[i][2]<<endl;
              cout<<steps<<endl;
                     cin>>yup;
              }*/
              steps++;
               sum1=0;
               for(int i=0;i<yup;i++)
               if(array1[i][2]==final)
               sum1 = array1[i][2];                 
              }
              if(steps<100)
              cout<<steps<<endl;
              else
              cout<<-1<<endl;
             // cout<<"asdfadf"<<endl;
              // cin>>fill;
          }
           
        
                               test_case++;
    }
    return 0;
}

Comments

Login or Register to post a comment.

CodeChef is a non-commercial competitive programming community

In order to report copyright violations of any kind, send in an email to copyright@codechef.com

CodeChef - A Platform for Aspiring Programmers

CodeChef was created as a platform to help programmers make it big in the world of algorithms, computer programming and programming contests. At CodeChef we work hard to revive the geek in you by hosting a programming contest at the start of the month and another smaller programming challenge in the middle of the month. We also aim to have training sessions and discussions related to algorithms, binary search, technicalities like array size and the likes. Apart from providing a platform for programming competitions, CodeChef also has various algorithm tutorials and forum discussions to help those who are new to the world of computer programming.

Practice Section - A Place to hone your 'Computer Programming Skills'

Try your hand at one of our many practice problems and submit your solution in a language of your choice. Our programming contest judge accepts solutions in over 35+ programming languages. Preparing for coding contests were never this much fun! Receive points, and move up through the CodeChef ranks. Use our practice section to better prepare yourself for the multiple programming challenges that take place through-out the month on CodeChef.

Compete - Monthly Programming Contests and Cook-offs

Here is where you can show off your computer programming skills. Take part in our 10 day long monthly coding contest and the shorter format Cook-off coding contest. Put yourself up for recognition and win great prizes. Our programming contests have prizes worth up to Rs.20,000 and $700lots more CodeChef goodies up for grabs.

Discuss

Are you new to computer programming? Do you need help with algorithms? Then be a part of CodeChef's Forums and interact with all our programmers - they love helping out other programmers and sharing their ideas. Have discussions around binary search, array size, branch-and-bound, Dijkstra's algorithm, Encryption algorithm and more by visiting the CodeChef Forums and Wiki section.

CodeChef Community

As part of our Educational initiative, we give institutes the opportunity to associate with CodeChef in the form of Campus Chapters. Hosting online programming competitions is not the only feature on CodeChef. You can also host a coding contest for your institute on CodeChef, organize an algorithm event and be a guest author on our blog.

Go For Gold

The Go for Gold Initiative was launched about a year after CodeChef was incepted, to help prepare Indian students for the ACM ICPC World Finals competition. In the run up to the ACM ICPC competition, the Go for Gold initiative uses CodeChef as a platform to train students for the ACM ICPC competition via multiple warm up contests. As an added incentive the Go for Gold initiative is also offering over Rs.8 lacs to the Indian team that beats the 29th position at the ACM ICPC world finals. Find out more about the Go for Gold and the ACM ICPC competition here.

Site Navigation

Comments