Cod sursa(job #2322698)
| Utilizator | Data | 18 ianuarie 2019 09:54:21 | |
|---|---|---|---|
| Problema | Problema rucsacului | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.76 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("metro.in");
int n, m, k, dp[1000][1000], v[1000][1000], x, y;
int main()
{
in>>n>>m>>k;
for(int i=1;i<=k;i++){
in>>x>>y;
v[x][y]=1;
}
dp[1][1]=0;
for(int i=1;i<=m+1;i++){
for(int j=1;j<=n+1;j++){
if(v[i][j]==1){
dp[i][j]=dp[i-1][j-1]+141.42;
}else{
if(i>1){
dp[i][j]=dp[i-1][j]+100;
}else{
dp[i][j]=dp[i][j-1]+100;
}
}
}
}
for(int i=1;i<=m;i++){
for(int j=1;j<=n;j++){
cout<<dp[i][j]<<" ";
}
cout<<endl;
}
cout<<dp[m][n];
}
