We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
This is my code it is not working on test case 5 and 6.
#include<bits/stdc++.h>usingnamespacestd;#define ll unsigned long long int#define MAX 1002structCell{intx,y;llsum;Cell(){}Cell(int_x,int_y,ll_sum){x=_x,y=_y,sum=_sum;}};classcompare{public:booloperator()(Cella,Cellb){returna.sum>b.sum;}};llpathsum(llgrid[MAX][MAX],intn){if(n==0)return0;intvisited[MAX][MAX];memset(visited,0,sizeof(visited));priority_queue<Cell,vector<Cell>,compare>que;for(inti=0;i<n;i++){que.push(Cell(i,0,grid[i][0]));visited[i][0]=1;}llmin_sum=INT_MAX;while(!que.empty()){Cellcell=que.top();que.pop();if(cell.y==n-1){min_sum=min(min_sum,cell.sum);returnmin_sum;}//downif(cell.x+1>=0&&cell.x+1<n&&cell.y>=0&&cell.y<n&&visited[cell.x+1][cell.y]==0){visited[cell.x+1][cell.y]=1;que.push(Cell(cell.x+1,cell.y,cell.sum+grid[cell.x+1][cell.y]));}//rightif(cell.x>=0&&cell.x<n&&cell.y+1>=0&&cell.y+1<n&&visited[cell.x][cell.y+1]==0){visited[cell.x+1][cell.y]=1;que.push(Cell(cell.x,cell.y+1,cell.sum+grid[cell.x][cell.y+1]));}//upif(cell.x-1>=0&&cell.x-1<n&&cell.y>=0&&cell.y<n&&visited[cell.x-1][cell.y]==0){visited[cell.x-1][cell.y]=1;que.push(Cell(cell.x-1,cell.y,cell.sum+grid[cell.x-1][cell.y]));}}return(min_sum==INT_MAX)?-1:min_sum;}intmain(){intn;cin>>n;llgrid[MAX][MAX];for(inti=0;i<n;i++){for(intj=0;j<n;j++){cin>>grid[i][j];}}cout<<pathsum(grid,n)<<endl;return0;}
Project Euler #82: Path sum: three ways
You are viewing a single comment's thread. Return to all comments →
This is my code it is not working on test case 5 and 6.