# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100329 | AKaan37 | Mobitel (COCI19_mobitel) | C++17 | 1230 ms | 66560 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//Bismillahirrahmanirrahim
#include <bits/stdc++.h>
using namespace std;
typedef long long int lo;
typedef pair< lo,pair<lo,lo> > PII;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(lo i=1;i<=n;i++)
#define mid (bas+son)/2
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 100005;
const lo mod = 1000000007;
lo n,m,cev,b,a[10005][10005],k;
string s;
vector<int> v;
map< PII,lo> dp;
lo bfs(lo satir,lo sutun,lo cost){
lo topl=0;
if(satir>n || sutun>m) return 0;
if(satir==n && sutun==m && cost>=k) return 1;
if(satir==n && sutun==m && cost<k) return 0;
if(dp.find(mp(satir,mp(sutun,cost)))!=dp.end()) return dp[mp(satir,mp(sutun,cost))];
topl+=bfs(satir+1,sutun,cost*a[satir+1][sutun]);
topl+=bfs(satir,sutun+1,cost*a[satir][sutun+1]);
return dp[mp(satir,mp(sutun,cost))]=topl;
}
int main(){
//~ freopen("CfE.cpp","r",stdin);
//~ memset(dp,-1,sizeof(dp));
scanf("%lld %lld %lld",&n,&m,&k);
FOR{
for(lo j=1;j<=m;j++){
scanf("%lld",&a[i][j]);
}
}
printf("%lld\n",bfs(1,1,a[1][1]));
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |