0
Your rating: None

CodeChef submission 595754 (C++ 4.3.2)

CodeChef submission 595754 (C++ 4.3.2) plaintext list. Status: TLE, problem SUMTRIAN, contest . By gagangupt16 (gagangupt16), 2011-07-08 23:08:00.
  1. #include <iostream>
  2. #include <vector>
  3. #include <math.h>
  4. using namespace std;
  5. vector<int> bi;
  6.  
  7. void bindg(int i)
  8. {
  9.      int j;
  10.      for (j=0;j<bi.size();j++){
  11.            bi[j]=i%2;
  12.            i/=2;
  13.      }
  14. }
  15.  
  16. int main()
  17. {
  18.     vector<vector<int> > v;
  19.     int y,tc,n,i,j,pres=0,high=0,b,ptr;
  20.     scanf("%d",&tc);
  21.     
  22.     for (y=0;y<tc;y++){
  23.         scanf("%d",&n);
  24.         v.resize(n);
  25.         for (i=0;i<n;i++)
  26.             v[i].resize(i+1);
  27.         
  28.         for (i=0;i<n;i++)
  29.             for (j=0;j<i+1;j++)
  30.                 scanf("%d",&v[i][j]);       
  31.     
  32.          bi.resize(n-1);
  33.          b=n-2;
  34.          for (i=0;i<pow(2,n-1);i++){
  35.              pres=v[0][0];
  36.              b=n-2;
  37.              ptr=0;
  38.              bindg(i);
  39.         
  40.              for (j=1;j<=n-1;j++){
  41.                  ptr+=bi[b];
  42.                  pres+=v[j][ptr];
  43.                  b--;
  44.              }
  45.         
  46.              if (pres>high)
  47.                 high=pres;
  48.         }
  49.     
  50.         printf("%d\n",high);
  51.     }
  52.     return 0;
  53. }
  54.

Comments