Pagini recente » Borderou de evaluare (job #2448978) | Borderou de evaluare (job #1716355) | Borderou de evaluare (job #113991) | Borderou de evaluare (job #1154775) | Borderou de evaluare (job #3126857)
Borderou de evaluare (job #3126857)
Raport evaluator
Compilare:
main.cpp:1:2: warning: #import is a deprecated GCC extension [-Wdeprecated]
1 | #import<bits/stdc++.h>
| ^~~~~~
main.cpp:2:208: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
2 | using namespace std;int n,k,i,j,v[102][102],D[102][102],G[202];int q(int i,int j,int c){if(i<1||j<1||(c==1&&i!=1&&j!= 1))return 0;return D[i][j]?D[i][j]:D[i][j]=max(q(i-G[c],j,c-1),q(i,j-G[c],c-1))+v[i][j];}main(){ifstream f("sudest.in");ofstream g("sudest.out");for(f>>n;++i<=n;)for(j=0;++j<=n;f>>v[i][j]);for(f>>k,i=0;++i<=k;f>>G[i]);D[1][1]=v[1][1];g<<q(n,n,k)<<'\n';i=j=n;vector<pair<int,int>>A;while(i!=1||j!=1){A.push_back({i,j});if(j-G[k]<1)i-=G[k];else if(i-G[k]<1)j-=G[k];else if(D[i-G[k]][j]>D[i][j-G[k]])i-=G[k];else j-=G[k];--k;}A.push_back({i,j});for(i=A.size();--i>=0;g<<A[i].first<<' '<<A[i].second<<'\n');}
| ^~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 303kb | OKAY! | 10 |
2 | 0ms | 303kb | OKAY! | 10 |
3 | 0ms | 303kb | OKAY! | 10 |
4 | 0ms | 303kb | OKAY! | 10 |
5 | 0ms | 303kb | OKAY! | 10 |
6 | 0ms | 303kb | OKAY! | 10 |
7 | 0ms | 303kb | OKAY! | 10 |
8 | 0ms | 303kb | OKAY! | 10 |
9 | 0ms | 303kb | OKAY! | 10 |
10 | 0ms | 303kb | OKAY! | 10 |
Punctaj total | 100 |