Submission #180280

#TimeUsernameProblemLanguageResultExecution timeMemory
180280awlintqaaPohlepko (COCI16_pohlepko)C++14
0 / 80
74 ms65540 KiB
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0) #include <bits/stdc++.h> using namespace std; #define sqr 500 #define mid (l+r)/2 #define pb push_back #define ppb pop_back #define fi first #define se second #define lb lower_bound #define ub upper_bound #define ins insert #define era erase #define C continue #define mem(dp,i) memset(dp,i,sizeof(dp)) #define mset multiset typedef long long ll; typedef long double ld; typedef pair<int,int> pi; typedef pair<ll,ll> pll; typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll; const ll mod=1000000007;//998244353; const ll inf=1e18*4; const ld pai=acos(-1); int n,m; char xxx='z'+1; string s[2009]; string dp[2009][2009]; int done[2009][2009]; int check(int x,int y){ return (x>=0 && x<n && y>=0 && y<m); } string bt(int x,int y){ if(x==n-1 && y==m-1)return ""; string &ret=dp[x][y]; if(done[x][y])return ret; done[x][y]=1; ret=xxx; if(check(x+1,y))ret=min(ret,s[x+1][y]+bt(x+1,y)); if(check(x,y+1))ret=min(ret,s[x][y+1]+bt(x,y+1)); return ret; } int main(){ cin>>n>>m; for(int i=0;i<n;i++)cin>>s[i]; cout<<s[0][0]+bt(0,0)<<endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...